blob: 1b8c912e2c0711d47f07c3df5bead8ec38cceb11 [file] [log] [blame]
Willy Tarreauc2186022009-10-26 19:48:54 +01001/*
2 * Elastic Binary Trees - exported functions for Indirect String data nodes.
Willy Tarreau3a932442010-05-09 19:29:23 +02003 * Version 6.0
4 * (C) 2002-2010 - Willy Tarreau <w@1wt.eu>
Willy Tarreauc2186022009-10-26 19:48:54 +01005 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
10 *
11 * This program 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
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 */
20
21/* Consult ebistree.h for more details about those functions */
22
23#include "ebistree.h"
Willy Tarreauc9a31da2009-12-14 12:40:27 +010024#include "ebimtree.h"
Willy Tarreauc2186022009-10-26 19:48:54 +010025
26/* Find the first occurence of a zero-terminated string <x> in the tree <root>.
27 * It's the caller's reponsibility to use this function only on trees which
28 * only contain zero-terminated strings. If none can be found, return NULL.
29 */
30REGPRM2 struct ebpt_node *ebis_lookup(struct eb_root *root, const char *x)
31{
32 return __ebis_lookup(root, x);
33}
34
Willy Tarreauc9a31da2009-12-14 12:40:27 +010035/* Find the first occurence of a length <len> string <x> in the tree <root>.
36 * It's the caller's reponsibility to use this function only on trees which
37 * only contain zero-terminated strings, and that no null character is present
38 * in string <x> in the first <len> chars. If none can be found, return NULL.
39 */
40REGPRM3 struct ebpt_node *ebis_lookup_len(struct eb_root *root, const char *x, unsigned int len)
41{
42 struct ebpt_node *node;
43
44 node = ebim_lookup(root, x, len);
45 if (!node || ((const char *)node->key)[len] != 0)
46 return NULL;
47 return node;
48}
49
Willy Tarreauc2186022009-10-26 19:48:54 +010050/* Insert ebpt_node <new> into subtree starting at node root <root>. Only
51 * new->key needs be set with the zero-terminated string key. The ebpt_node is
52 * returned. If root->b[EB_RGHT]==1, the tree may only contain unique keys. The
53 * caller is responsible for properly terminating the key with a zero.
54 */
55REGPRM2 struct ebpt_node *ebis_insert(struct eb_root *root, struct ebpt_node *new)
56{
57 return __ebis_insert(root, new);
58}