*/
struct list_head input_queue;
btr_command_handler execute;
+ void *context;
};
#define FOR_EACH_CHILD(_tn, _btrn) list_for_each_entry((_tn), \
list_for_each_entry_safe((_br), (_tmp), &(_btrn)->input_queue, node)
struct btr_node *btr_new_node(char *name, struct btr_node *parent,
- btr_command_handler handler)
+ btr_command_handler handler, void *context)
{
struct btr_node *btrn = para_malloc(sizeof(*btrn));
btrn->name = para_strdup(name);
btrn->parent = parent;
btrn->execute = handler;
+ btrn->context = context;
if (parent)
list_add_tail(&btrn->node, &parent->children);
INIT_LIST_HEAD(&btrn->children);
}
}
-static void add_btrb_to_children(struct btr_buffer *btrb, struct btr_node *btrn)
+static void add_btrb_to_children(struct btr_buffer *btrb,
+ struct btr_node *btrn, size_t consumed)
{
struct btr_node *ch;
FOR_EACH_CHILD(ch, btrn) {
struct btr_buffer_reference *br = para_malloc(sizeof(*br));
br->btrb = btrb;
- br->consumed = 0;
+ br->consumed = consumed;
list_add_tail(&br->node, &ch->input_queue);
btrb->refcount++;
}
struct btr_buffer *btrb;
btrb = new_btrb(buf, size);
- add_btrb_to_children(btrb, btrn);
+ add_btrb_to_children(btrb, btrn, 0);
}
static void btr_pushdown_br(struct btr_buffer_reference *br, struct btr_node *btrn)
{
- add_btrb_to_children(br->btrb, btrn);
+ add_btrb_to_children(br->btrb, btrn, br->consumed);
btr_drop_buffer_reference(br);
}
return size;
}
+int btr_splice_out_node(struct btr_node *btrn)
+{
+ struct btr_node *ch;
+
+ if (!btrn)
+ return -ERRNO_TO_PARA_ERROR(EINVAL);
+ if (btr_get_input_queue_size(btrn) != 0)
+ return -ERRNO_TO_PARA_ERROR(EINVAL);
+ PARA_NOTICE_LOG("splicing out %s\n", btrn->name);
+ if (btrn->parent)
+ list_del(&btrn->node);
+ FOR_EACH_CHILD(ch, btrn)
+ ch->parent = btrn->parent;
+ free(btrn->name);
+ free(btrn);
+ return 1;
+}
+
/**
* Return the size of the largest input queue.
*
return -ERRNO_TO_PARA_ERROR(EINVAL);
if (!btrn->execute)
return -ERRNO_TO_PARA_ERROR(ENOTSUP);
- return btrn->execute(command, value_result);
+ return btrn->execute(btrn, command, value_result);
}
int btr_exec_up(struct btr_node *btrn, const char *command, char **value_result)
return -ERRNO_TO_PARA_ERROR(ENOTSUP);
if (!parent->execute)
continue;
- ret = parent->execute(command, value_result);
+ ret = parent->execute(parent, command, value_result);
if (ret == -ERRNO_TO_PARA_ERROR(ENOTSUP))
continue;
if (ret < 0)
}
return -ERRNO_TO_PARA_ERROR(ENOTSUP);
}
+
+void *btr_context(struct btr_node *btrn)
+{
+ return btrn->context;
+}