*
* 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)
+static int merge_input(struct btr_node *btrn)
{
struct btr_buffer_reference *brs[2], *br;
char *bufs[2], *buf;
para_list_add(&br->node, &btrn->input_queue);
return 2;
}
+
+void btr_merge(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 (merge_input(btrn) < 2)
+ return;
+ }
+}
+
+bool btr_eof(struct btr_node *btrn)
+{
+ char *buf;
+ size_t len = btr_next_buffer(btrn, &buf);
+
+ return (len == 0 && btr_no_parent(btrn));
+}