assert(list_empty(&btrn->children));
}
-/*
- * Return the size of the largest input queue.
+/**
+ * Return number of queued output bytes of a buffer tree node.
+ *
+ * \param btrn The node whose output queue size should be computed.
*
- * Iterates over all children of the given node.
+ * This function iterates over all children of the given node and returns the
+ * size of the largest input queue.
*/
-static size_t btr_bytes_pending(struct btr_node *btrn)
+size_t btr_get_output_queue_size(struct btr_node *btrn)
{
size_t max_size = 0;
struct btr_node *ch;
if (type != BTR_NT_LEAF) {
if (btr_no_children(btrn))
return -E_BTR_NO_CHILD;
- if (btr_bytes_pending(btrn) > BTRN_MAX_PENDING)
+ if (btr_get_output_queue_size(btrn) > BTRN_MAX_PENDING)
return 0;
}
if (type != BTR_NT_ROOT) {