25 #include <freeradius-devel/bio/bio_priv.h>
26 #include <freeradius-devel/bio/queue.h>
27 #include <freeradius-devel/bio/null.h>
28 #include <freeradius-devel/util/dlist.h>
86 if (fr_bio_queue_list_num_elements(&my->pending) == 0)
return;
91 while ((
item = fr_bio_queue_list_pop_head(&my->pending)) != NULL) {
93 item->cancelled =
true;
94 fr_bio_queue_list_insert_head(&my->free,
item);
115 item = fr_bio_queue_list_pop_head(&my->free);
123 fr_assert((fr_bio_queue_list_num_elements(&my->pending) == 0) ||
124 (already_written == 0));
126 item->packet_ctx = packet_ctx;
129 item->already_written = already_written;
130 item->cancelled =
false;
132 fr_bio_queue_list_insert_tail(&my->pending,
item);
152 fr_assert(fr_bio_queue_list_num_elements(&my->pending) == 0);
160 rcode = next->
write(next, packet_ctx,
buffer, size);
161 if ((
size_t) rcode == size)
return rcode;
167 if (rcode !=
fr_bio_error(IO_WOULD_BLOCK))
return rcode;
182 if (!
buffer)
return rcode;
190 fr_assert(fr_bio_queue_list_num_elements(&my->free) > 0);
206 if (fr_bio_queue_list_num_elements(&my->pending) == 0) {
218 while (written < size) {
225 item = fr_bio_queue_list_head(&my->pending);
238 if (rcode == 0)
break;
250 item->already_written += rcode;
252 if (
item->already_written <
item->size)
break;
257 if (
item->cancelled) {
263 (void) fr_bio_queue_list_pop_head(&my->pending);
266 item->packet_ctx = NULL;
268 item->already_written = 0;
270 item->cancelled =
true;
272 fr_bio_queue_list_insert_head(&my->free,
item);
318 rcode = next->
read(next, packet_ctx,
buffer, size);
319 if (rcode >= 0)
return rcode;
324 if (rcode ==
fr_bio_error(IO_WOULD_BLOCK))
return rcode;
411 if (!my)
return NULL;
417 fr_bio_queue_list_init(&my->pending);
418 fr_bio_queue_list_init(&my->free);
425 my->array[i].my = my;
426 my->array[i].cancelled =
true;
427 fr_bio_queue_list_insert_tail(&my->free, &my->array[i]);
470 if (
item->cancelled)
return 0;
487 if (rcode <= 0)
return -1;
492 item->already_written += rcode;
493 if (
item->already_written <
item->size)
return -1;
503 (void) fr_bio_queue_list_remove(&my->pending,
item);
504 fr_bio_queue_list_insert_head(&my->free,
item);
static int const char char buffer[256]
fr_bio_write_t _CONST write
write to the underlying bio
fr_bio_read_t _CONST read
read from the underlying bio
static fr_bio_t * fr_bio_next(fr_bio_t *bio)
fr_bio_queue_callback_t cancel
static int fr_bio_queue_destructor(fr_bio_queue_t *my)
static ssize_t fr_bio_queue_list_push(fr_bio_queue_t *my, void *packet_ctx, const void *buffer, size_t size, size_t already_written)
Push a packet onto a list.
int fr_bio_queue_cancel(fr_bio_t *bio, fr_bio_queue_entry_t *item)
Cancel the write for a packet.
fr_bio_queue_callback_t sent
static ssize_t fr_bio_queue_write_flush(fr_bio_queue_t *my, size_t size)
Flush the packet list.
struct fr_bio_queue_list_s fr_bio_queue_list_t
static ssize_t fr_bio_queue_read(fr_bio_t *bio, void *packet_ctx, void *buffer, size_t size)
Read one packet from next bio.
fr_bio_t * fr_bio_queue_alloc(TALLOC_CTX *ctx, size_t max_saved, fr_bio_queue_saved_t saved, fr_bio_queue_callback_t sent, fr_bio_queue_callback_t cancel, fr_bio_t *next)
Allocate a packet-based bio.
struct fr_bio_queue_s fr_bio_queue_t
fr_bio_queue_saved_t saved
static int fr_bio_queue_shutdown(fr_bio_t *bio)
Shutdown.
static ssize_t fr_bio_queue_write_next(fr_bio_t *bio, void *packet_ctx, void const *buffer, size_t size)
Write one packet to the next bio.
static ssize_t fr_bio_queue_write_buffer(fr_bio_t *bio, void *packet_ctx, void const *buffer, size_t size)
Write to the packet list buffer.
static void fr_bio_queue_list_cancel(fr_bio_queue_t *my)
Forcibly cancel all outstanding packets.
void(* fr_bio_queue_callback_t)(fr_bio_t *bio, void *packet_ctx, const void *buffer, size_t size)
struct fr_bio_queue_entry_s fr_bio_queue_entry_t
void(* fr_bio_queue_saved_t)(fr_bio_t *bio, void *packet_ctx, const void *buffer, size_t size, fr_bio_queue_entry_t *queue_ctx)
static void fr_bio_chain(fr_bio_t *first, fr_bio_t *second)
Chain one bio after another.
#define FR_DLIST_TYPES(_name)
Define type specific wrapper structs for dlists.
#define FR_DLIST_ENTRY(_name)
Expands to the type name used for the entry wrapper structure.
#define FR_DLIST_FUNCS(_name, _element_type, _element_entry)
Define type specific wrapper functions for dlists.
ssize_t fr_bio_eof_read(UNUSED fr_bio_t *bio, UNUSED void *packet_ctx, UNUSED void *buffer, UNUSED size_t size)
Always returns EOF on fr_bio_read()
int fr_bio_destructor(fr_bio_t *bio)
Free this bio.
static void * item(fr_lst_t const *lst, fr_lst_index_t idx)
typedef FR_DLIST_HEAD(map_list) map_list_t
Given these are used in so many places, it's more friendly to have a proper type.
static size_t array[MY_ARRAY_SIZE]
ssize_t fr_bio_null_write(UNUSED fr_bio_t *bio, UNUSED void *packet_ctx, UNUSED void const *buffer, UNUSED size_t size)
Always return 0 on write.