2 * Copyright (C) 2009-2011 Andre Noll <maan@systemlinux.org>
4 * Licensed under the GPL v2. For licencing details see COPYING.
7 /** \file buffer_tree.c Buffer tree and buffer pool implementations. */
14 #include "buffer_tree.h"
18 /* whead = NULL means area full */
30 /** The number of references to this buffer. */
32 /* NULL means no buffer pool but a malloced buffer. */
33 struct btr_pool
*pool
;
36 struct btr_buffer_reference
{
37 struct btr_buffer
*btrb
;
39 /* Each buffer reference belongs to the buffer queue list of some buffer tree node. */
40 struct list_head node
;
46 struct btr_node
*parent
;
47 /* The position of this btr node in the buffer tree. */
48 struct list_head node
;
49 /* The children nodes of this btr node are linked together in a list. */
50 struct list_head children
;
51 /* Time of first data transfer. */
54 * The input queue is a list of references to btr buffers. Each item on
55 * the list represents an input buffer which has not been completely
56 * used by this btr node.
58 struct list_head input_queue
;
59 btr_command_handler execute
;
64 * Create a new buffer pool.
66 * \param name The name of the new buffer pool.
67 * \param area_size The size in bytes of the pool area.
69 * \return An opaque pointer to the newly created buffer pool. It must be
70 * passed to btr_pool_free() after it is no longer used to deallocate all
73 struct btr_pool
*btr_pool_new(const char *name
, size_t area_size
)
75 struct btr_pool
*btrp
;
77 PARA_INFO_LOG("%s, %zu bytes\n", name
, area_size
);
78 btrp
= para_malloc(sizeof(*btrp
));
79 btrp
->area_start
= para_malloc(area_size
);
80 btrp
->area_end
= btrp
->area_start
+ area_size
;
81 btrp
->rhead
= btrp
->area_start
;
82 btrp
->whead
= btrp
->area_start
;
83 btrp
->name
= para_strdup(name
);
88 * Deallocate resources used by a buffer pool.
90 * \param btrp A pointer obtained via btr_pool_new().
92 void btr_pool_free(struct btr_pool
*btrp
)
96 free(btrp
->area_start
);
102 * Return the size of the buffer pool area.
104 * \param btrp The buffer pool.
106 * \return The same value which was passed during creation time to
109 size_t btr_pool_size(struct btr_pool
*btrp
)
111 return btrp
->area_end
- btrp
->area_start
;
114 static size_t btr_pool_filled(struct btr_pool
*btrp
)
117 return btr_pool_size(btrp
);
118 if (btrp
->rhead
<= btrp
->whead
)
119 return btrp
->whead
- btrp
->rhead
;
120 return btr_pool_size(btrp
) - (btrp
->rhead
- btrp
->whead
);
124 * Get the number of unused bytes in the buffer pool.
126 * \param btrp The pool.
128 * \return The number of bytes that can currently be allocated.
130 * Note that in general the returned number of bytes is not available as a
131 * single contiguous buffer. Use btr_pool_available() to obtain the length of
132 * the largest contiguous buffer that can currently be allocated from the
135 size_t btr_pool_unused(struct btr_pool
*btrp
)
137 return btr_pool_size(btrp
) - btr_pool_filled(btrp
);
141 * Return maximal size available for one read. This is
142 * smaller than the value returned by btr_pool_unused().
144 static size_t btr_pool_available(struct btr_pool
*btrp
)
148 if (btrp
->rhead
<= btrp
->whead
)
149 return btrp
->area_end
- btrp
->whead
;
150 return btrp
->rhead
- btrp
->whead
;
154 * Obtain the current write head.
156 * \param btrp The buffer pool.
157 * \param result The write head is returned here.
159 * \return The maximal amount of bytes that may be written to the returned
162 size_t btr_pool_get_buffer(struct btr_pool
*btrp
, char **result
)
165 *result
= btrp
->whead
;
166 return btr_pool_available(btrp
);
170 * Get references to buffers pointing to free space of the buffer pool area.
172 * \param btrp The buffer pool.
173 * \param iov The scatter array.
175 * \return Zero if the buffer pool is full, one if the free space of the buffer
176 * pool area is available as a single contiguous buffer, two if the free space
177 * consists of two buffers. If this function returns the value n, then n
178 * elements of \a iov are initialized.
180 int btr_pool_get_buffers(struct btr_pool
*btrp
, struct iovec iov
[2])
185 sz
= btr_pool_get_buffer(btrp
, &buf
);
189 iov
[0].iov_base
= buf
;
190 unused
= btr_pool_unused(btrp
);
193 iov
[1].iov_len
= unused
- sz
;
194 iov
[1].iov_base
= btrp
->area_start
;
199 * Mark a part of the buffer pool area as allocated.
201 * \param btrp The buffer pool.
202 * \param size The amount of bytes to be allocated.
204 * This is usually called after the caller wrote to the buffer obtained by
205 * btr_pool_get_buffer().
207 static void btr_pool_allocate(struct btr_pool
*btrp
, size_t size
)
213 assert(size
<= btr_pool_available(btrp
));
214 end
= btrp
->whead
+ size
;
215 assert(end
<= btrp
->area_end
);
217 if (end
== btrp
->area_end
) {
218 PARA_DEBUG_LOG("%s: end of pool area reached\n", btrp
->name
);
219 end
= btrp
->area_start
;
221 if (end
== btrp
->rhead
) {
222 PARA_DEBUG_LOG("%s btrp buffer full\n", btrp
->name
);
223 end
= NULL
; /* buffer full */
228 static void btr_pool_deallocate(struct btr_pool
*btrp
, size_t size
)
230 char *end
= btrp
->rhead
+ size
;
234 assert(end
<= btrp
->area_end
);
235 assert(size
<= btr_pool_filled(btrp
));
236 if (end
== btrp
->area_end
)
237 end
= btrp
->area_start
;
239 btrp
->whead
= btrp
->rhead
;
241 if (btrp
->rhead
== btrp
->whead
)
242 btrp
->rhead
= btrp
->whead
= btrp
->area_start
;
245 #define FOR_EACH_CHILD(_tn, _btrn) list_for_each_entry((_tn), \
246 &((_btrn)->children), node)
247 #define FOR_EACH_CHILD_SAFE(_tn, _tmp, _btrn) \
248 list_for_each_entry_safe((_tn), (_tmp), &((_btrn)->children), node)
250 #define FOR_EACH_BUFFER_REF(_br, _btrn) \
251 list_for_each_entry((_br), &(_btrn)->input_queue, node)
252 #define FOR_EACH_BUFFER_REF_SAFE(_br, _tmp, _btrn) \
253 list_for_each_entry_safe((_br), (_tmp), &(_btrn)->input_queue, node)
256 * Create a new buffer tree node.
258 * \param bnd Specifies how to create the new node.
260 * This function always succeeds (or calls exit()). The returned pointer must
261 * be freed using btr_free_node() after the node has been removed from the
262 * buffer tree via btr_remove_node().
264 struct btr_node
*btr_new_node(struct btr_node_description
*bnd
)
266 struct btr_node
*btrn
= para_malloc(sizeof(*btrn
));
268 btrn
->name
= para_strdup(bnd
->name
);
269 btrn
->parent
= bnd
->parent
;
270 btrn
->execute
= bnd
->handler
;
271 btrn
->context
= bnd
->context
;
272 btrn
->start
.tv_sec
= 0;
273 btrn
->start
.tv_usec
= 0;
274 INIT_LIST_HEAD(&btrn
->children
);
275 INIT_LIST_HEAD(&btrn
->input_queue
);
278 list_add_tail(&btrn
->node
, &bnd
->parent
->children
);
279 PARA_INFO_LOG("new leaf node: %s (child of %s)\n",
280 bnd
->name
, bnd
->parent
->name
);
282 PARA_INFO_LOG("added %s as btr root\n", bnd
->name
);
286 assert(!bnd
->child
->parent
);
287 PARA_INFO_LOG("new root: %s (was %s)\n",
288 bnd
->name
, bnd
->child
->name
);
290 list_add_tail(&bnd
->child
->node
, &btrn
->children
);
292 bnd
->child
->parent
= btrn
;
295 PARA_EMERG_LOG("inserting internal nodes not yet supported.\n");
297 assert(bnd
->child
->parent
== bnd
->parent
);
303 * Allocate a new btr buffer.
305 * The freshly allocated buffer will have a zero refcount and will
306 * not be associated with a btr pool.
308 static struct btr_buffer
*new_btrb(char *buf
, size_t size
)
310 struct btr_buffer
*btrb
= para_calloc(sizeof(*btrb
));
317 static void dealloc_buffer(struct btr_buffer
*btrb
)
320 btr_pool_deallocate(btrb
->pool
, btrb
->size
);
325 static struct btr_buffer_reference
*get_first_input_br(struct btr_node
*btrn
)
327 if (list_empty(&btrn
->input_queue
))
329 return list_first_entry(&btrn
->input_queue
,
330 struct btr_buffer_reference
, node
);
334 * Deallocate the reference, release the resources if refcount drops to zero.
336 static void btr_drop_buffer_reference(struct btr_buffer_reference
*br
)
338 struct btr_buffer
*btrb
= br
->btrb
;
343 if (btrb
->refcount
== 0) {
344 dealloc_buffer(btrb
);
349 static void add_btrb_to_children(struct btr_buffer
*btrb
,
350 struct btr_node
*btrn
, size_t consumed
)
354 if (btrn
->start
.tv_sec
== 0)
356 FOR_EACH_CHILD(ch
, btrn
) {
357 struct btr_buffer_reference
*br
= para_calloc(sizeof(*br
));
359 br
->consumed
= consumed
;
360 list_add_tail(&br
->node
, &ch
->input_queue
);
362 if (ch
->start
.tv_sec
== 0)
368 * Insert a malloced buffer into the buffer tree.
370 * \param buf The buffer to insert.
371 * \param size The size of \a buf in bytes.
372 * \param btrn Position in the buffer tree to create the output.
374 * This creates references to \a buf and adds these references to each child of
375 * \a btrn. The buffer will be freed using standard free() once no buffer tree
376 * node is referencing it any more.
378 * Note that this function must not be used if \a buf was obtained from a
379 * buffer pool. Use btr_add_output_pool() in this case.
381 void btr_add_output(char *buf
, size_t size
, struct btr_node
*btrn
)
383 struct btr_buffer
*btrb
;
386 if (list_empty(&btrn
->children
)) {
390 btrb
= new_btrb(buf
, size
);
391 add_btrb_to_children(btrb
, btrn
, 0);
395 * Feed data to child nodes of a buffer tree node.
397 * \param btrp The buffer pool.
398 * \param size The number of bytes to be allocated and fed to each child.
399 * \param btrn The node whose children are to be fed.
401 * This function allocates the amount of bytes from the buffer pool area,
402 * starting at the current value of the write head, and creates buffer
403 * references to the resulting part of the buffer pool area, one for each child
404 * of \a btrn. The references are then fed into the input queue of each child.
406 void btr_add_output_pool(struct btr_pool
*btrp
, size_t size
,
407 struct btr_node
*btrn
)
409 struct btr_buffer
*btrb
;
414 if (list_empty(&btrn
->children
))
416 avail
= btr_pool_get_buffer(btrp
, &buf
);
417 assert(avail
>= size
);
418 btr_pool_allocate(btrp
, size
);
419 btrb
= new_btrb(buf
, size
);
421 add_btrb_to_children(btrb
, btrn
, 0);
425 * Copy data to write head of a buffer pool and feed it to all children nodes.
427 * \param src The source buffer.
428 * \param n The size of the source buffer in bytes.
429 * \param btrp The destination buffer pool.
430 * \param btrn Add the data as output of this node.
432 * This is expensive. The caller must make sure the data fits into the buffer
435 void btr_copy(const void *src
, size_t n
, struct btr_pool
*btrp
,
436 struct btr_node
*btrn
)
443 assert(n
<= btr_pool_unused(btrp
));
444 sz
= btr_pool_get_buffer(btrp
, &buf
);
445 copy
= PARA_MIN(sz
, n
);
446 memcpy(buf
, src
, copy
);
447 btr_add_output_pool(btrp
, copy
, btrn
);
450 sz
= btr_pool_get_buffer(btrp
, &buf
);
451 assert(sz
>= n
- copy
);
452 memcpy(buf
, src
+ copy
, n
- copy
);
453 btr_add_output_pool(btrp
, n
- copy
, btrn
);
456 static void btr_pushdown_br(struct btr_buffer_reference
*br
, struct btr_node
*btrn
)
458 add_btrb_to_children(br
->btrb
, btrn
, br
->consumed
);
459 btr_drop_buffer_reference(br
);
463 * Feed all buffer references of the input queue through the output channel.
465 * \param btrn The node whose buffer references should be pushed down.
467 * This function is useful for filters that do not change the contents of the
468 * buffers at all, like the wav filter or the amp filter if no amplification
469 * was specified. This function is rather cheap.
471 * \sa \ref btr_pushdown_one().
473 void btr_pushdown(struct btr_node
*btrn
)
475 struct btr_buffer_reference
*br
, *tmp
;
477 FOR_EACH_BUFFER_REF_SAFE(br
, tmp
, btrn
)
478 btr_pushdown_br(br
, btrn
);
482 * Feed the next buffer of the input queue through the output channel.
484 * \param btrn The node whose first input queue buffer should be pushed down.
486 * This works like \ref btr_pushdown() but pushes down only one buffer
489 void btr_pushdown_one(struct btr_node
*btrn
)
491 struct btr_buffer_reference
*br
;
493 if (list_empty(&btrn
->input_queue
))
495 br
= list_first_entry(&btrn
->input_queue
, struct btr_buffer_reference
, node
);
496 btr_pushdown_br(br
, btrn
);
500 * Find out whether a node is a leaf node.
502 * \param btrn The node to check.
504 * \return True if this node has no children. False otherwise.
506 static bool btr_no_children(struct btr_node
*btrn
)
508 return list_empty(&btrn
->children
);
512 * Find out whether a node is an orphan node.
514 * \param btrn The buffer tree node.
516 * \return True if \a btrn has no parent.
518 * This function will always return true for the root node. However in case
519 * nodes have been removed from the tree, other nodes may become orphans too.
521 bool btr_no_parent(struct btr_node
*btrn
)
523 return !btrn
->parent
;
527 * Find out whether it is OK to change an input buffer.
529 * \param btrn The buffer tree node to check.
531 * This is used by filters that produce exactly the same amount of output as
532 * there is input. The amp filter which multiplies each sample by some number
533 * is an example of such a filter. If there are no other nodes in the buffer
534 * tree that read the same input stream (i.e. if \a btrn has no siblings), a
535 * node may modify its input buffer directly and push down the modified buffer
536 * to its children, thereby avoiding to allocate a possibly large additional
539 * Since the buffer tree may change at any time, this function should be called
540 * during each post_select call.
542 * \return True if \a btrn has no siblings.
544 bool btr_inplace_ok(struct btr_node
*btrn
)
548 return list_is_singular(&btrn
->parent
->children
);
551 static inline size_t br_available_bytes(struct btr_buffer_reference
*br
)
553 return br
->btrb
->size
- br
->consumed
;
556 static size_t btr_get_buffer_by_reference(struct btr_buffer_reference
*br
, char **buf
)
559 *buf
= br
->btrb
->buf
+ br
->consumed
;
560 return br_available_bytes(br
);
564 * Obtain the next buffer of the input queue of a buffer tree node.
566 * \param btrn The node whose input queue is to be queried.
567 * \param bufp Result pointer.
569 * \return The number of bytes that can be read from buf. Zero if the input
570 * buffer queue is empty. In this case the value of \a bufp is undefined.
572 size_t btr_next_buffer(struct btr_node
*btrn
, char **bufp
)
574 struct btr_buffer_reference
*br
;
575 char *buf
, *result
= NULL
;
578 FOR_EACH_BUFFER_REF(br
, btrn
) {
579 sz
= btr_get_buffer_by_reference(br
, &buf
);
589 if (result
+ rv
!= buf
)
599 * Deallocate the given number of bytes from the input queue.
601 * \param btrn The buffer tree node.
602 * \param numbytes The number of bytes to be deallocated.
604 * This function must be used to get rid of existing buffer references in the
605 * node's input queue. If no references to a buffer remain, the underlying
606 * buffers are either freed (in the non-buffer pool case) or the read head of
607 * the buffer pool is being advanced.
609 * Note that \a numbytes may be smaller than the buffer size. In this case the
610 * buffer is not deallocated and subsequent calls to btr_next_buffer() return
611 * the remaining part of the buffer.
613 void btr_consume(struct btr_node
*btrn
, size_t numbytes
)
615 struct btr_buffer_reference
*br
, *tmp
;
620 br
= get_first_input_br(btrn
);
623 if (br
->wrap_count
== 0) {
625 * No wrap buffer. Drop buffer references whose buffer
626 * has been fully used. */
627 FOR_EACH_BUFFER_REF_SAFE(br
, tmp
, btrn
) {
628 if (br
->consumed
+ numbytes
<= br
->btrb
->size
) {
629 br
->consumed
+= numbytes
;
630 if (br
->consumed
== br
->btrb
->size
)
631 btr_drop_buffer_reference(br
);
634 numbytes
-= br
->btrb
->size
- br
->consumed
;
635 btr_drop_buffer_reference(br
);
640 * We have a wrap buffer, consume from it. If in total, i.e. including
641 * previous calls to brt_consume(), less than wrap_count has been
642 * consumed, there's nothing more we can do.
644 * Otherwise we drop the wrap buffer and consume from subsequent
645 * buffers of the input queue the correct amount of bytes. This is the
646 * total number of bytes that have been consumed from the wrap buffer.
648 PARA_DEBUG_LOG("consuming %zu/%zu bytes from wrap buffer\n", numbytes
,
649 br_available_bytes(br
));
651 assert(numbytes
<= br_available_bytes(br
));
652 if (br
->consumed
+ numbytes
< br
->wrap_count
) {
653 br
->consumed
+= numbytes
;
656 PARA_DEBUG_LOG("dropping wrap buffer (%zu bytes)\n", br
->btrb
->size
);
657 /* get rid of the wrap buffer */
658 sz
= br
->consumed
+ numbytes
;
659 btr_drop_buffer_reference(br
);
660 return btr_consume(btrn
, sz
);
663 void btr_drain(struct btr_node
*btrn
)
665 struct btr_buffer_reference
*br
, *tmp
;
667 FOR_EACH_BUFFER_REF_SAFE(br
, tmp
, btrn
)
668 btr_drop_buffer_reference(br
);
672 * Free all resources allocated by btr_new_node().
674 * \param btrn Pointer to a btr node obtained by \ref btr_new_node().
676 * Like free(3), it is OK to call this with a \p NULL pointer argument.
678 void btr_free_node(struct btr_node
*btrn
)
687 * Remove a node from a buffer tree.
689 * \param btrn The node to remove.
691 * This makes all child nodes of \a btrn orphans and removes \a btrn from the
692 * list of children of its parent. Moreover, the input queue of \a btrn is
693 * flushed if it is not empty.
695 * \sa \ref btr_splice_out_node.
697 void btr_remove_node(struct btr_node
*btrn
)
703 PARA_NOTICE_LOG("removing btr node %s from buffer tree\n", btrn
->name
);
704 FOR_EACH_CHILD(ch
, btrn
)
708 list_del(&btrn
->node
);
712 * Return the amount of available input bytes of a buffer tree node.
714 * \param btrn The node whose input size should be computed.
716 * \return The total number of bytes available in the node's input
719 * This simply iterates over all buffer references in the input queue and
720 * returns the sum of the sizes of all references.
722 size_t btr_get_input_queue_size(struct btr_node
*btrn
)
724 struct btr_buffer_reference
*br
;
725 size_t size
= 0, wrap_consumed
= 0;
727 FOR_EACH_BUFFER_REF(br
, btrn
) {
728 if (br
->wrap_count
!= 0) {
729 wrap_consumed
= br
->consumed
;
732 size
+= br_available_bytes(br
);
734 assert(wrap_consumed
<= size
);
735 size
-= wrap_consumed
;
740 * Remove a node from the buffer tree, reconnecting parent and children.
742 * \param btrn The node to splice out.
744 * This function is used by buffer tree nodes that do not exist during the
745 * whole lifetime of the buffer tree. Unlike btr_remove_node(), calling
746 * btr_splice_out_node() does not split the tree into disconnected components
747 * but reconnects the buffer tree by making all child nodes of \a btrn children
748 * of the parent of \a btrn.
750 void btr_splice_out_node(struct btr_node
*btrn
)
752 struct btr_node
*ch
, *tmp
;
755 PARA_NOTICE_LOG("splicing out %s\n", btrn
->name
);
758 list_del(&btrn
->node
);
759 FOR_EACH_CHILD_SAFE(ch
, tmp
, btrn
) {
760 PARA_INFO_LOG("parent(%s): %s\n", ch
->name
,
761 btrn
->parent
? btrn
->parent
->name
: "NULL");
762 ch
->parent
= btrn
->parent
;
764 list_move(&ch
->node
, &btrn
->parent
->children
);
766 assert(list_empty(&btrn
->children
));
770 * Return number of queued output bytes of a buffer tree node.
772 * \param btrn The node whose output queue size should be computed.
774 * This function iterates over all children of the given node and returns the
775 * size of the largest input queue.
777 size_t btr_get_output_queue_size(struct btr_node
*btrn
)
782 FOR_EACH_CHILD(ch
, btrn
) {
783 size_t size
= btr_get_input_queue_size(ch
);
784 max_size
= PARA_MAX(max_size
, size
);
790 * Execute a inter-node command on a parent node.
792 * \param btrn The node to start looking.
793 * \param command The command to execute.
794 * \param value_result Additional arguments and result value.
796 * This function traverses the buffer tree upwards and looks for parent nodes
797 * of \a btrn that understands \a command. On the first such node the command
798 * is executed, and the result is stored in \a value_result.
800 * \return \p -ENOTSUP if no parent node of \a btrn understands \a command.
801 * Otherwise the return value of the command handler is returned.
803 int btr_exec_up(struct btr_node
*btrn
, const char *command
, char **value_result
)
807 for (; btrn
; btrn
= btrn
->parent
) {
808 struct btr_node
*parent
= btrn
->parent
;
810 return -ERRNO_TO_PARA_ERROR(ENOTSUP
);
811 if (!parent
->execute
)
813 PARA_INFO_LOG("parent: %s, cmd: %s\n", parent
->name
, command
);
814 ret
= parent
->execute(parent
, command
, value_result
);
815 if (ret
== -ERRNO_TO_PARA_ERROR(ENOTSUP
))
819 if (value_result
&& *value_result
)
820 PARA_NOTICE_LOG("%s(%s): %s\n", command
, parent
->name
,
824 return -ERRNO_TO_PARA_ERROR(ENOTSUP
);
828 * Obtain the context of a buffer node tree.
830 * The returned pointer equals the context pointer used at creation time of the
833 * \sa btr_new_node(), struct \ref btr_node_description.
835 void *btr_context(struct btr_node
*btrn
)
837 return btrn
->context
;
840 static bool need_buffer_pool_merge(struct btr_node
*btrn
)
842 struct btr_buffer_reference
*br
= get_first_input_br(btrn
);
846 if (br
->wrap_count
!= 0)
853 static void merge_input_pool(struct btr_node
*btrn
, size_t dest_size
)
855 struct btr_buffer_reference
*br
, *wbr
= NULL
;
856 int num_refs
; /* including wrap buffer */
857 char *buf
, *buf1
= NULL
, *buf2
= NULL
;
858 size_t sz
, sz1
= 0, sz2
= 0, wb_consumed
= 0;
860 br
= get_first_input_br(btrn
);
861 if (!br
|| br_available_bytes(br
) >= dest_size
)
864 FOR_EACH_BUFFER_REF(br
, btrn
) {
866 sz
= btr_get_buffer_by_reference(br
, &buf
);
869 if (br
->wrap_count
!= 0) {
871 assert(num_refs
== 1);
875 wb_consumed
= br
->consumed
;
883 if (buf1
+ sz1
== buf
) {
892 assert(buf2
+ sz2
== buf
);
895 if (sz1
+ sz2
>= dest_size
+ wb_consumed
)
898 if (!buf2
) /* nothing to do */
900 assert(buf1
&& sz2
> 0);
902 * If the second buffer is large, we only take the first part of it to
903 * avoid having to memcpy() huge buffers.
905 sz2
= PARA_MIN(sz2
, (size_t)(64 * 1024));
907 /* Make a new wrap buffer combining buf1 and buf2. */
909 buf
= para_malloc(sz
);
910 PARA_DEBUG_LOG("merging input buffers: (%p:%zu, %p:%zu) -> %p:%zu\n",
911 buf1
, sz1
, buf2
, sz2
, buf
, sz
);
912 memcpy(buf
, buf1
, sz1
);
913 memcpy(buf
+ sz1
, buf2
, sz2
);
914 br
= para_calloc(sizeof(*br
));
915 br
->btrb
= new_btrb(buf
, sz
);
916 br
->btrb
->refcount
= 1;
918 /* This is a wrap buffer */
919 br
->wrap_count
= sz1
;
920 para_list_add(&br
->node
, &btrn
->input_queue
);
924 * We already have a wrap buffer, but it is too small. It might be
927 if (wbr
->wrap_count
== sz1
&& wbr
->btrb
->size
>= sz1
+ sz2
) /* nothing we can do about it */
929 sz
= sz1
+ sz2
- wbr
->btrb
->size
; /* amount of new data */
930 PARA_DEBUG_LOG("increasing wrap buffer %zu -> %zu\n", wbr
->btrb
->size
,
931 wbr
->btrb
->size
+ sz
);
932 wbr
->btrb
->size
+= sz
;
933 wbr
->btrb
->buf
= para_realloc(wbr
->btrb
->buf
, wbr
->btrb
->size
);
934 /* copy the new data to the end of the reallocated buffer */
936 memcpy(wbr
->btrb
->buf
+ wbr
->btrb
->size
- sz
, buf2
+ sz2
- sz
, sz
);
940 * Merge the first two input buffers into one.
942 * This is a quite expensive operation.
944 * \return The number of buffers that have been available (zero, one or two).
946 static int merge_input(struct btr_node
*btrn
)
948 struct btr_buffer_reference
*brs
[2], *br
;
953 if (list_empty(&btrn
->input_queue
))
955 if (list_is_singular(&btrn
->input_queue
))
958 /* get references to the first two buffers */
959 FOR_EACH_BUFFER_REF(br
, btrn
) {
961 szs
[i
] = btr_get_buffer_by_reference(brs
[i
], bufs
+ i
);
967 /* make a new btrb that combines the two buffers and a br to it. */
968 sz
= szs
[0] + szs
[1];
969 buf
= para_malloc(sz
);
970 PARA_DEBUG_LOG("%s: memory merging input buffers: (%zu, %zu) -> %zu\n",
971 btrn
->name
, szs
[0], szs
[1], sz
);
972 memcpy(buf
, bufs
[0], szs
[0]);
973 memcpy(buf
+ szs
[0], bufs
[1], szs
[1]);
975 br
= para_calloc(sizeof(*br
));
976 br
->btrb
= new_btrb(buf
, sz
);
977 br
->btrb
->refcount
= 1;
979 /* replace the first two refs by the new one */
980 btr_drop_buffer_reference(brs
[0]);
981 btr_drop_buffer_reference(brs
[1]);
982 para_list_add(&br
->node
, &btrn
->input_queue
);
987 * Combine input queue buffers.
989 * \param btrn The buffer tree node whose input should be merged.
990 * \param dest_size Stop merging if a buffer of at least this size exists.
992 * Used to combine as many buffers as needed into a single buffer whose size is
993 * at least \a dest_size. This function is rather cheap in case the parent node
994 * uses buffer pools and rather expensive otherwise.
996 * Note that if less than \a dest_size bytes are available in total, this
997 * function does nothing and subsequent calls to btr_next_buffer() will still
998 * return a buffer size less than \a dest_size.
1000 void btr_merge(struct btr_node
*btrn
, size_t dest_size
)
1002 if (need_buffer_pool_merge(btrn
))
1003 return merge_input_pool(btrn
, dest_size
);
1006 size_t len
= btr_next_buffer(btrn
, &buf
);
1007 if (len
>= dest_size
)
1009 PARA_DEBUG_LOG("input size = %zu < %zu = dest\n", len
, dest_size
);
1010 if (merge_input(btrn
) < 2)
1015 static bool btr_eof(struct btr_node
*btrn
)
1018 size_t len
= btr_next_buffer(btrn
, &buf
);
1020 return (len
== 0 && btr_no_parent(btrn
));
1023 static void log_tree_recursively(struct btr_node
*btrn
, int loglevel
, int depth
)
1025 struct btr_node
*ch
;
1026 const char spaces
[] = " ", *space
= spaces
+ 16 - depth
;
1030 para_log(loglevel
, "%s%s\n", space
, btrn
->name
);
1031 FOR_EACH_CHILD(ch
, btrn
)
1032 log_tree_recursively(ch
, loglevel
, depth
+ 1);
1036 * Write the current buffer (sub-)tree to the log.
1038 * \param btrn Start logging at this node.
1039 * \param loglevel Set severity with which the tree should be logged.
1041 void btr_log_tree(struct btr_node
*btrn
, int loglevel
)
1043 return log_tree_recursively(btrn
, loglevel
, 0);
1047 * Find the node with the given name in the buffer tree.
1049 * \param name The name of the node to search.
1050 * \param root Where to start the search.
1052 * \return A pointer to the node with the given name on success. If \a name is
1053 * \p NULL, the function returns \a root. If there is no node with the given
1054 * name, \p NULL is returned.
1056 struct btr_node
*btr_search_node(const char *name
, struct btr_node
*root
)
1058 struct btr_node
*ch
;
1062 if (!strcmp(root
->name
, name
))
1064 FOR_EACH_CHILD(ch
, root
) {
1065 struct btr_node
*result
= btr_search_node(name
, ch
);
1072 /** 640K ought to be enough for everybody ;) */
1073 #define BTRN_MAX_PENDING (96 * 1024)
1076 * Return the current state of a buffer tree node.
1078 * \param btrn The node whose state should be queried.
1079 * \param min_iqs The minimal input queue size.
1080 * \param type The supposed type of \a btrn.
1082 * Most users of the buffer tree subsystem call this function from both
1083 * their pre_select and the post_select methods.
1085 * \return Negative if an error condition was detected, zero if there
1086 * is nothing to do and positive otherwise.
1090 * - If a non-root node has no parent and an empty input queue, the function
1091 * returns \p -E_BTR_EOF. Similarly, if a non-leaf node has no children, \p
1092 * -E_BTR_NO_CHILD is returned.
1094 * - If less than \a min_iqs many bytes are available in the input queue and no
1095 * EOF condition was detected, the function returns zero.
1097 * - If there's plenty of data left in the input queue of the children of \a
1098 * btrn, the function also returns zero in order to bound the memory usage of
1101 int btr_node_status(struct btr_node
*btrn
, size_t min_iqs
,
1102 enum btr_node_type type
)
1107 if (type
!= BTR_NT_LEAF
) {
1108 if (btr_no_children(btrn
))
1109 return -E_BTR_NO_CHILD
;
1110 if (btr_get_output_queue_size(btrn
) > BTRN_MAX_PENDING
)
1113 if (type
!= BTR_NT_ROOT
) {
1116 iqs
= btr_get_input_queue_size(btrn
);
1117 if (iqs
== 0) /* we have a parent, because not eof */
1119 if (iqs
< min_iqs
&& !btr_no_parent(btrn
))
1126 * Get the time of the first I/O for a buffer tree node.
1128 * \param btrn The node whose I/O time should be obtained.
1129 * \param tv Result pointer.
1131 * Mainly useful for the time display of para_audiod.
1133 void btr_get_node_start(struct btr_node
*btrn
, struct timeval
*tv
)