X-Git-Url: http://git.tuebingen.mpg.de/?p=paraslash.git;a=blobdiff_plain;f=buffer_tree.h;h=34535219364a6cdc2ce32efcc04ca2d44c2c20c2;hp=8bc8e6029c841482bdfb8c5a01e0c4fc1d2b404e;hb=ac93cb364106bbaa88bf0d0852981a872166e6a9;hpb=fd09012ca62c214fb3e2f48935e658b885c967b6 diff --git a/buffer_tree.h b/buffer_tree.h index 8bc8e602..34535219 100644 --- a/buffer_tree.h +++ b/buffer_tree.h @@ -1,8 +1,4 @@ -/* - * Copyright (C) 2009-2010 Andre Noll - * - * Licensed under the GPL v2. For licencing details see COPYING. - */ +/* Copyright (C) 2009 Andre Noll , see file COPYING. */ /** * \file buffer_tree.h Buffer tree management. @@ -182,20 +178,21 @@ void btr_copy(const void *src, size_t n, struct btr_pool *btrp, struct btr_node *btrn); struct btr_node *btr_new_node(struct btr_node_description *bnd); -void btr_remove_node(struct btr_node *btrn); -void btr_free_node(struct btr_node *btrn); +void btr_remove_node(struct btr_node **btrnp); void btr_add_output(char *buf, size_t size, struct btr_node *btrn); +void btr_add_output_dont_free(const char *buf, size_t size, struct btr_node *btrn); size_t btr_get_input_queue_size(struct btr_node *btrn); size_t btr_get_output_queue_size(struct btr_node *btrn); bool btr_no_parent(struct btr_node *btrn); size_t btr_next_buffer(struct btr_node *btrn, char **bufp); +size_t btr_next_buffer_omit(struct btr_node *btrn, size_t omit, char **bufp); void btr_consume(struct btr_node *btrn, size_t numbytes); int btr_exec_up(struct btr_node *btrn, const char *command, char **value_result); -void btr_splice_out_node(struct btr_node *btrn); +void btr_splice_out_node(struct btr_node **btrnp); void btr_pushdown(struct btr_node *btrn); void *btr_context(struct btr_node *btrn); void btr_merge(struct btr_node *btrn, size_t dest_size); -void btr_log_tree(struct btr_node *btrn, int loglevel); +void btr_log_tree(struct btr_node *btrn, int ll); void btr_pushdown_one(struct btr_node *btrn); bool btr_inplace_ok(struct btr_node *btrn); int btr_node_status(struct btr_node *btrn, size_t min_iqs, @@ -203,3 +200,4 @@ int btr_node_status(struct btr_node *btrn, size_t min_iqs, void btr_get_node_start(struct btr_node *btrn, struct timeval *tv); struct btr_node *btr_search_node(const char *name, struct btr_node *root); void btr_drain(struct btr_node *btrn); +struct btr_node *btr_parent(struct btr_node *btrn);