return br_available_bytes(br);
}
+/**
+ * \return zero if the input buffer queue is empty.
+ */
size_t btr_next_buffer(struct btr_node *btrn, char **bufp)
{
struct btr_buffer_reference *br;
assert(list_empty(&btrn->children));
free(btrn->name);
free(btrn);
- return 1;
}
/**
*
* This is a quite expensive operation.
*
- * \return The number of buffers that have been merged (zero, one or two).
+ * \return The number of buffers that have been available (zero, one or two).
*/
int btr_merge(struct btr_node *btrn)
{
para_list_add(&br->node, &btrn->input_queue);
return 2;
}
+
+void btr_merge_to(struct btr_node *btrn, size_t dest_size)
+{
+ for (;;) {
+ char *buf;
+ size_t len = btr_next_buffer(btrn, &buf);
+ if (len >= dest_size)
+ return;
+ if (btr_merge(btrn) < 2)
+ return;
+ }
+}