7 #include "buffer_tree.h"
14 /** The number of references to this buffer. */
18 struct btr_buffer_reference {
19 struct btr_buffer *btrb;
21 /* Each buffer reference belongs to the buffer queue list of some buffer tree node. */
22 struct list_head node;
27 struct btr_node *parent;
28 /* The position of this btr node in the buffer tree. */
29 struct list_head node;
30 /* The children nodes of this btr node are linked together in a list. */
31 struct list_head children;
33 * The input queue is a list of references to btr buffers. Each item on
34 * the list represents an input buffer which has not been completely
35 * used by this btr node.
37 struct list_head input_queue;
38 btr_command_handler execute;
42 #define FOR_EACH_CHILD(_tn, _btrn) list_for_each_entry((_tn), \
43 &((_btrn)->children), node)
44 #define FOR_EACH_CHILD_SAFE(_tn, _tmp, _btrn) \
45 list_for_each_entry_safe((_tn), (_tmp), &((_btrn)->children), node)
47 #define FOR_EACH_BUFFER_REF(_br, _btrn) \
48 list_for_each_entry((_br), &(_btrn)->input_queue, node)
49 #define FOR_EACH_BUFFER_REF_SAFE(_br, _tmp, _btrn) \
50 list_for_each_entry_safe((_br), (_tmp), &(_btrn)->input_queue, node)
52 struct btr_node *btr_new_node(const char *name, struct btr_node *parent,
53 btr_command_handler handler, void *context)
55 struct btr_node *btrn = para_malloc(sizeof(*btrn));
57 btrn->name = para_strdup(name);
58 btrn->parent = parent;
59 btrn->execute = handler;
60 btrn->context = context;
62 list_add_tail(&btrn->node, &parent->children);
63 INIT_LIST_HEAD(&btrn->children);
64 INIT_LIST_HEAD(&btrn->input_queue);
66 PARA_INFO_LOG("added %s as child of %s\n", name, parent->name);
68 PARA_INFO_LOG("added %s as btr root\n", name);
73 * Allocate a new btr buffer.
75 * The freshly allocated buffer will have a zero refcount.
77 static struct btr_buffer *new_btrb(char *buf, size_t size)
79 struct btr_buffer *btrb = para_malloc(sizeof(*btrb));
88 * Deallocate the reference, release the resources if refcount drops to zero.
90 static void btr_drop_buffer_reference(struct btr_buffer_reference *br)
92 struct btr_buffer *btrb = br->btrb;
94 //PARA_CRIT_LOG("dropping buffer reference %p\n", br);
98 if (btrb->refcount == 0) {
104 static void add_btrb_to_children(struct btr_buffer *btrb,
105 struct btr_node *btrn, size_t consumed)
109 FOR_EACH_CHILD(ch, btrn) {
110 struct btr_buffer_reference *br = para_malloc(sizeof(*br));
112 br->consumed = consumed;
113 list_add_tail(&br->node, &ch->input_queue);
118 void btr_add_output(char *buf, size_t size, struct btr_node *btrn)
120 struct btr_buffer *btrb;
123 if (list_empty(&btrn->children)) {
127 btrb = new_btrb(buf, size);
128 add_btrb_to_children(btrb, btrn, 0);
131 static void btr_pushdown_br(struct btr_buffer_reference *br, struct btr_node *btrn)
133 add_btrb_to_children(br->btrb, btrn, br->consumed);
134 btr_drop_buffer_reference(br);
137 void btr_pushdown(struct btr_node *btrn)
139 struct btr_buffer_reference *br, *tmp;
141 FOR_EACH_BUFFER_REF_SAFE(br, tmp, btrn)
142 btr_pushdown_br(br, btrn);
145 int btr_pushdown_one(struct btr_node *btrn)
147 struct btr_buffer_reference *br;
149 if (list_empty(&btrn->input_queue))
151 br = list_first_entry(&btrn->input_queue, struct btr_buffer_reference, node);
152 btr_pushdown_br(br, btrn);
156 /* Return true if this node has no children. */
157 bool btr_no_children(struct btr_node *btrn)
159 return list_empty(&btrn->children);
162 bool btr_no_parent(struct btr_node *btrn)
164 return !btrn->parent;
167 bool btr_inplace_ok(struct btr_node *btrn)
171 return list_is_singular(&btrn->parent->children);
174 static inline size_t br_available_bytes(struct btr_buffer_reference *br)
176 return br->btrb->size - br->consumed;
179 size_t btr_get_buffer_by_reference(struct btr_buffer_reference *br, char **buf)
181 *buf = br->btrb->buf + br->consumed;
182 return br_available_bytes(br);
186 * \return zero if the input buffer queue is empty.
188 size_t btr_next_buffer(struct btr_node *btrn, char **bufp)
190 struct btr_buffer_reference *br;
192 if (list_empty(&btrn->input_queue)) {
196 br = list_first_entry(&btrn->input_queue, struct btr_buffer_reference, node);
197 return btr_get_buffer_by_reference(br, bufp);
200 void btr_consume(struct btr_node *btrn, size_t numbytes)
202 struct btr_buffer_reference *br;
204 assert(!list_empty(&btrn->input_queue));
205 br = list_first_entry(&btrn->input_queue, struct btr_buffer_reference, node);
206 assert(br->consumed + numbytes <= br->btrb->size);
207 br->consumed += numbytes;
208 if (br->consumed == br->btrb->size)
209 btr_drop_buffer_reference(br);
212 static void flush_input_queue(struct btr_node *btrn)
214 struct btr_buffer_reference *br, *tmp;
215 FOR_EACH_BUFFER_REF_SAFE(br, tmp, btrn)
216 btr_drop_buffer_reference(br);
219 void btr_del_node(struct btr_node *btrn)
225 PARA_NOTICE_LOG("deleting %s\n", btrn->name);
226 FOR_EACH_CHILD(ch, btrn)
228 flush_input_queue(btrn);
230 list_del(&btrn->node);
235 size_t btr_get_input_queue_size(struct btr_node *btrn)
237 struct btr_buffer_reference *br;
240 FOR_EACH_BUFFER_REF(br, btrn) {
241 //PARA_CRIT_LOG("size: %zu\n", size);
242 size += br_available_bytes(br);
247 void btr_splice_out_node(struct btr_node *btrn)
249 struct btr_node *ch, *tmp;
252 PARA_NOTICE_LOG("splicing out %s\n", btrn->name);
255 list_del(&btrn->node);
256 FOR_EACH_CHILD_SAFE(ch, tmp, btrn) {
257 PARA_INFO_LOG("parent(%s): %s\n", ch->name,
258 btrn->parent? btrn->parent->name : "NULL");
259 ch->parent = btrn->parent;
261 list_move(&ch->node, &btrn->parent->children);
263 assert(list_empty(&btrn->children));
269 * Return the size of the largest input queue.
271 * Iterates over all children of the given node.
273 size_t btr_bytes_pending(struct btr_node *btrn)
278 FOR_EACH_CHILD(ch, btrn) {
279 size_t size = btr_get_input_queue_size(ch);
280 max_size = PARA_MAX(max_size, size);
285 int btr_exec(struct btr_node *btrn, const char *command, char **value_result)
288 return -ERRNO_TO_PARA_ERROR(EINVAL);
290 return -ERRNO_TO_PARA_ERROR(ENOTSUP);
291 return btrn->execute(btrn, command, value_result);
294 int btr_exec_up(struct btr_node *btrn, const char *command, char **value_result)
298 for (; btrn; btrn = btrn->parent) {
299 struct btr_node *parent = btrn->parent;
301 return -ERRNO_TO_PARA_ERROR(ENOTSUP);
302 if (!parent->execute)
304 PARA_INFO_LOG("parent: %s, cmd: %s\n", parent->name, command);
305 ret = parent->execute(parent, command, value_result);
306 if (ret == -ERRNO_TO_PARA_ERROR(ENOTSUP))
310 if (value_result && *value_result)
311 PARA_NOTICE_LOG("%s(%s): %s\n", command, parent->name,
315 return -ERRNO_TO_PARA_ERROR(ENOTSUP);
318 void *btr_context(struct btr_node *btrn)
320 return btrn->context;
324 * Merge the first two input buffers into one.
326 * This is a quite expensive operation.
328 * \return The number of buffers that have been available (zero, one or two).
330 static int merge_input(struct btr_node *btrn)
332 struct btr_buffer_reference *brs[2], *br;
337 if (list_empty(&btrn->input_queue))
339 if (list_is_singular(&btrn->input_queue))
342 /* get references to the first two buffers */
343 FOR_EACH_BUFFER_REF(br, btrn) {
345 szs[i] = btr_get_buffer_by_reference(brs[i], bufs + i);
350 /* make a new btrb that combines the two buffers and a br to it. */
351 sz = szs[0] + szs[1];
352 //PARA_CRIT_LOG("merging input buffers: (%zu, %zu) -> %zu\n",
353 // szs[0], szs[1], sz);
354 buf = para_malloc(sz);
355 /* TODO: Avoid this memcopy by introducing btr buffer pool. */
356 memcpy(buf, bufs[0], szs[0]);
357 memcpy(buf + szs[0], bufs[1], szs[1]);
359 br = para_malloc(sizeof(*br));
360 br->btrb = new_btrb(buf, sz);
361 br->btrb->refcount = 1;
364 /* replace the first two refs by the new one */
365 btr_drop_buffer_reference(brs[0]);
366 btr_drop_buffer_reference(brs[1]);
367 para_list_add(&br->node, &btrn->input_queue);
371 void btr_merge(struct btr_node *btrn, size_t dest_size)
375 size_t len = btr_next_buffer(btrn, &buf);
376 if (len >= dest_size)
378 if (merge_input(btrn) < 2)
383 bool btr_eof(struct btr_node *btrn)
386 size_t len = btr_next_buffer(btrn, &buf);
388 return (len == 0 && btr_no_parent(btrn));
391 void log_tree_recursively(struct btr_node *btrn, int loglevel, int depth)
394 const char spaces[] = " ", *space = spaces + 16 - depth;
398 para_log(loglevel, "%s%s\n", space, btrn->name);
399 FOR_EACH_CHILD(ch, btrn)
400 log_tree_recursively(ch, loglevel, depth + 1);
403 void btr_log_tree(struct btr_node *btrn, int loglevel)
405 return log_tree_recursively(btrn, loglevel, 0);
408 /** 640K ought to be enough for everybody ;) */
409 #define BTRN_MAX_PENDING (640 * 1024)
411 int btr_node_status(struct btr_node *btrn, size_t min_iqs)
417 if (btr_bytes_pending(btrn) > BTRN_MAX_PENDING)
419 iqs = btr_get_input_queue_size(btrn);
420 if (iqs == 0) /* we have a parent, because not eof */
422 if (iqs < min_iqs && !btr_no_parent(btrn))