#define FOR_EACH_CHILD(_tn, _btrn) list_for_each_entry((_tn), \
&((_btrn)->children), node)
+#define FOR_EACH_CHILD_SAFE(_tn, _tmp, _btrn) \
+ list_for_each_entry_safe((_tn), (_tmp), &((_btrn)->children), node)
#define FOR_EACH_BUFFER_REF(_br, _btrn) \
list_for_each_entry((_br), &(_btrn)->input_queue, node)
list_add_tail(&btrn->node, &parent->children);
INIT_LIST_HEAD(&btrn->children);
INIT_LIST_HEAD(&btrn->input_queue);
+ if (parent)
+ PARA_INFO_LOG("added %s as child of %s\n", name, parent->name);
+ else
+ PARA_INFO_LOG("added %s as btr root\n", name);
return btrn;
}
{
struct btr_buffer *btrb;
+ assert(size != 0);
+ if (list_empty(&btrn->children)) {
+ free(buf);
+ return;
+ }
btrb = new_btrb(buf, size);
add_btrb_to_children(btrb, btrn, 0);
}
btr_pushdown_br(br, btrn);
}
+int btr_pushdown_one(struct btr_node *btrn)
+{
+ struct btr_buffer_reference *br;
+
+ if (list_empty(&btrn->input_queue))
+ return 0;
+ br = list_first_entry(&btrn->input_queue, struct btr_buffer_reference, node);
+ btr_pushdown_br(br, btrn);
+ return 1;
+}
+
/* Return true if this node has no children. */
bool btr_no_children(struct btr_node *btrn)
{
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;
btr_drop_buffer_reference(br);
}
-void btr_del_node(struct btr_node *btrn)
+void btr_free_node(struct btr_node *btrn)
+{
+ if (!btrn)
+ return;
+ free(btrn->name);
+ free(btrn);
+}
+
+void btr_remove_node(struct btr_node *btrn)
{
struct btr_node *ch;
if (!btrn)
return;
- PARA_NOTICE_LOG("deleting %s\n", btrn->name);
+ PARA_NOTICE_LOG("removing btr node %s from buffer tree\n", btrn->name);
FOR_EACH_CHILD(ch, btrn)
ch->parent = NULL;
flush_input_queue(btrn);
if (btrn->parent)
list_del(&btrn->node);
- free(btrn->name);
- free(btrn);
}
size_t btr_get_input_queue_size(struct btr_node *btrn)
return size;
}
-int btr_splice_out_node(struct btr_node *btrn)
+void btr_splice_out_node(struct btr_node *btrn)
{
- struct btr_node *ch;
+ struct btr_node *ch, *tmp;
- if (!btrn)
- return -ERRNO_TO_PARA_ERROR(EINVAL);
- if (btr_get_input_queue_size(btrn) != 0)
- return -ERRNO_TO_PARA_ERROR(EINVAL);
+ assert(btrn);
PARA_NOTICE_LOG("splicing out %s\n", btrn->name);
+ btr_pushdown(btrn);
if (btrn->parent)
list_del(&btrn->node);
- FOR_EACH_CHILD(ch, btrn)
+ FOR_EACH_CHILD_SAFE(ch, tmp, btrn) {
+ PARA_INFO_LOG("parent(%s): %s\n", ch->name,
+ btrn->parent? btrn->parent->name : "NULL");
ch->parent = btrn->parent;
- free(btrn->name);
- free(btrn);
- return 1;
+ if (btrn->parent)
+ list_move(&ch->node, &btrn->parent->children);
+ }
+ assert(list_empty(&btrn->children));
}
/**
for (; btrn; btrn = btrn->parent) {
struct btr_node *parent = btrn->parent;
- PARA_CRIT_LOG("parent: %p\n", parent);
if (!parent)
return -ERRNO_TO_PARA_ERROR(ENOTSUP);
if (!parent->execute)
continue;
+ PARA_INFO_LOG("parent: %s, cmd: %s\n", parent->name, command);
ret = parent->execute(parent, command, value_result);
if (ret == -ERRNO_TO_PARA_ERROR(ENOTSUP))
continue;
if (ret < 0)
return ret;
+ if (value_result && *value_result)
+ PARA_NOTICE_LOG("%s(%s): %s\n", command, parent->name,
+ *value_result);
+ return 1;
}
return -ERRNO_TO_PARA_ERROR(ENOTSUP);
}
*
* 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));
+}
+
+void log_tree_recursively(struct btr_node *btrn, int loglevel, int depth)
+{
+ struct btr_node *ch;
+ const char spaces[] = " ", *space = spaces + 16 - depth;
+
+ if (depth > 16)
+ return;
+ para_log(loglevel, "%s%s\n", space, btrn->name);
+ FOR_EACH_CHILD(ch, btrn)
+ log_tree_recursively(ch, loglevel, depth + 1);
+}
+
+void btr_log_tree(struct btr_node *btrn, int loglevel)
+{
+ return log_tree_recursively(btrn, loglevel, 0);
+}
+
+/** 640K ought to be enough for everybody ;) */
+#define BTRN_MAX_PENDING (640 * 1024)
+
+int btr_node_status(struct btr_node *btrn, size_t min_iqs)
+{
+ size_t iqs;
+
+ if (btr_eof(btrn))
+ return -E_BTR_EOF;
+ if (btr_bytes_pending(btrn) > BTRN_MAX_PENDING)
+ return 0;
+ iqs = btr_get_input_queue_size(btrn);
+ if (iqs == 0) /* we have a parent, because not eof */
+ return 0;
+ if (iqs < min_iqs && !btr_no_parent(btrn))
+ return 0;
+ return 1;
+}
projects / paraslash.git / blobdiff