diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-28 09:35:11 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-28 09:35:11 +0000 |
commit | da76459dc21b5af2449af2d36eb95226cb186ce2 (patch) | |
tree | 542ebb3c1e796fac2742495b8437331727bbbfa0 /src/ebimtree.c | |
parent | Initial commit. (diff) | |
download | haproxy-upstream.tar.xz haproxy-upstream.zip |
Adding upstream version 2.6.12.upstream/2.6.12upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to '')
-rw-r--r-- | src/ebimtree.c | 44 |
1 files changed, 44 insertions, 0 deletions
diff --git a/src/ebimtree.c b/src/ebimtree.c new file mode 100644 index 0000000..1ac444a --- /dev/null +++ b/src/ebimtree.c @@ -0,0 +1,44 @@ +/* + * Elastic Binary Trees - exported functions for Indirect Multi-Byte data nodes. + * Version 6.0.6 + * (C) 2002-2011 - Willy Tarreau <w@1wt.eu> + * + * This library is free software; you can redistribute it and/or + * modify it under the terms of the GNU Lesser General Public + * License as published by the Free Software Foundation, version 2.1 + * exclusively. + * + * This library is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + * Lesser General Public License for more details. + * + * You should have received a copy of the GNU Lesser General Public + * License along with this library; if not, write to the Free Software + * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + */ + +/* Consult ebimtree.h for more details about those functions */ + +#include <import/ebimtree.h> +#include <import/ebpttree.h> + +/* Find the first occurrence of a key of <len> bytes in the tree <root>. + * If none can be found, return NULL. + */ +struct ebpt_node * +ebim_lookup(struct eb_root *root, const void *x, unsigned int len) +{ + return __ebim_lookup(root, x, len); +} + +/* Insert ebpt_node <new> into subtree starting at node root <root>. + * Only new->key needs be set with the key. The ebpt_node is returned. + * If root->b[EB_RGHT]==1, the tree may only contain unique keys. The + * len is specified in bytes. + */ +struct ebpt_node * +ebim_insert(struct eb_root *root, struct ebpt_node *new, unsigned int len) +{ + return __ebim_insert(root, new, len); +} |