/src/haproxy/src/ebimtree.c
Line | Count | Source |
1 | | /* |
2 | | * Elastic Binary Trees - exported functions for Indirect Multi-Byte data nodes. |
3 | | * Version 6.0.6 |
4 | | * (C) 2002-2011 - Willy Tarreau <w@1wt.eu> |
5 | | * |
6 | | * This library is free software; you can redistribute it and/or |
7 | | * modify it under the terms of the GNU Lesser General Public |
8 | | * License as published by the Free Software Foundation, version 2.1 |
9 | | * exclusively. |
10 | | * |
11 | | * This library is distributed in the hope that it will be useful, |
12 | | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
14 | | * Lesser General Public License for more details. |
15 | | * |
16 | | * You should have received a copy of the GNU Lesser General Public |
17 | | * License along with this library; if not, write to the Free Software |
18 | | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
19 | | */ |
20 | | |
21 | | /* Consult ebimtree.h for more details about those functions */ |
22 | | |
23 | | #include <import/ebimtree.h> |
24 | | #include <import/ebpttree.h> |
25 | | |
26 | | /* Find the first occurrence of a key of <len> bytes in the tree <root>. |
27 | | * If none can be found, return NULL. |
28 | | */ |
29 | | struct ebpt_node * |
30 | | ebim_lookup(struct eb_root *root, const void *x, unsigned int len) |
31 | 0 | { |
32 | 0 | return __ebim_lookup(root, x, len); |
33 | 0 | } |
34 | | |
35 | | /* Insert ebpt_node <new> into subtree starting at node root <root>. |
36 | | * Only new->key needs be set with the key. The ebpt_node is returned. |
37 | | * If root->b[EB_RGHT]==1, the tree may only contain unique keys. The |
38 | | * len is specified in bytes. |
39 | | */ |
40 | | struct ebpt_node * |
41 | | ebim_insert(struct eb_root *root, struct ebpt_node *new, unsigned int len) |
42 | 0 | { |
43 | 0 | return __ebim_insert(root, new, len); |
44 | 0 | } |