X-Git-Url: http://git.tuebingen.mpg.de/?p=paraslash.git;a=blobdiff_plain;f=buffer_tree.c;h=941d58dba07521dc773721b93262b56ea2466f4f;hp=b3aea0e4143cbed3ecaff1ca56055106b6108e5a;hb=883af94f87f7d5465047c3bdd626a9dca3c2be8c;hpb=34fee5954159a9598110316ae79b64f0e408b423

diff --git a/buffer_tree.c b/buffer_tree.c
index b3aea0e4..941d58db 100644
--- a/buffer_tree.c
+++ b/buffer_tree.c
@@ -44,8 +44,6 @@ struct btr_node {
 #define FOR_EACH_BUFFER_REF_SAFE(_br, _tmp, _btrn) \
 	list_for_each_entry_safe((_br), (_tmp), &(_btrn)->input_queue, node)
 
-INIT_STDERR_LOGGING(0);
-
 struct btr_node *btr_new_node(char *name, struct btr_node *parent)
 {
 	struct btr_node *btrn = para_malloc(sizeof(*btrn));
@@ -199,7 +197,19 @@ size_t btr_get_input_queue_size(struct btr_node *btrn)
 	return size;
 }
 
-int main(void)
+/**
+ * Return the size of the largest input queue.
+ *
+ * Iterates over all children of the given node.
+ */
+size_t btr_bytes_pending(struct btr_node *btrn)
 {
-	return 1;
+	size_t max_size = 0;
+	struct btr_node *ch;
+
+	FOR_EACH_CHILD(ch, btrn) {
+		size_t size = btr_get_input_queue_size(ch);
+		max_size = PARA_MAX(max_size, size);
+	}
+	return max_size;
 }