Implement buffer tree pool support.
[paraslash.git] / buffer_tree.h
1
2 struct btr_node;
3 struct btr_pool;
4
5 typedef int (*btr_command_handler)(struct btr_node *btrn,
6 const char *command, char **result);
7
8 enum btr_node_type {
9 BTR_NT_ROOT,
10 BTR_NT_INTERNAL,
11 BTR_NT_LEAF,
12 };
13
14 struct btr_pool *btr_pool_new(size_t area_size);
15 void btr_pool_free(struct btr_pool *btrp);
16 size_t btr_pool_get_buffer(struct btr_pool *btrp, char **result);
17 void btr_pool_allocate(struct btr_pool *btrp, size_t size);
18 void btr_add_output_pool(struct btr_pool *btrp, char *buf, size_t size,
19 struct btr_node *btrn);
20
21 struct btr_node *btr_new_node(const char *name, struct btr_node *parent,
22 btr_command_handler handler, void *context);
23 void btr_remove_node(struct btr_node *btrn);
24 void btr_free_node(struct btr_node *btrn);
25 void btr_add_output(char *buf, size_t size, struct btr_node *btrn);
26 bool btr_no_children(struct btr_node *btrn);
27 size_t btr_bytes_pending(struct btr_node *btrn);
28 size_t btr_get_input_queue_size(struct btr_node *btrn);
29 bool btr_no_parent(struct btr_node *btrn);
30 size_t btr_next_buffer(struct btr_node *btrn, char **bufp);
31 void btr_consume(struct btr_node *btrn, size_t numbytes);
32 int btr_exec(struct btr_node *btrn, const char *command, char **value_result);
33 int btr_exec_up(struct btr_node *btrn, const char *command, char **value_result);
34 void btr_splice_out_node(struct btr_node *btrn);
35 void btr_pushdown(struct btr_node *btrn);
36 void *btr_context(struct btr_node *btrn);
37 void btr_merge(struct btr_node *btrn, size_t dest_size);
38 bool btr_eof(struct btr_node *btrn);
39 void btr_log_tree(struct btr_node *btrn, int loglevel);
40 int btr_pushdown_one(struct btr_node *btrn);
41 bool btr_inplace_ok(struct btr_node *btrn);
42 int btr_node_status(struct btr_node *btrn, size_t min_iqs,
43 enum btr_node_type type);
44 void btr_get_node_start(struct btr_node *btrn, struct timeval *tv);