| Willy Tarreau | c218602 | 2009-10-26 19:48:54 +0100 | [diff] [blame] | 1 | /* |
| 2 | * Elastic Binary Trees - exported functions for Indirect String data nodes. |
| 3 | * Version 5.0 |
| 4 | * (C) 2002-2009 - Willy Tarreau <w@1wt.eu> |
| 5 | * |
| 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" |
| 24 | |
| 25 | /* Find the first occurence of a zero-terminated string <x> in the tree <root>. |
| 26 | * It's the caller's reponsibility to use this function only on trees which |
| 27 | * only contain zero-terminated strings. If none can be found, return NULL. |
| 28 | */ |
| 29 | REGPRM2 struct ebpt_node *ebis_lookup(struct eb_root *root, const char *x) |
| 30 | { |
| 31 | return __ebis_lookup(root, x); |
| 32 | } |
| 33 | |
| 34 | /* Insert ebpt_node <new> into subtree starting at node root <root>. Only |
| 35 | * new->key needs be set with the zero-terminated string key. The ebpt_node is |
| 36 | * returned. If root->b[EB_RGHT]==1, the tree may only contain unique keys. The |
| 37 | * caller is responsible for properly terminating the key with a zero. |
| 38 | */ |
| 39 | REGPRM2 struct ebpt_node *ebis_insert(struct eb_root *root, struct ebpt_node *new) |
| 40 | { |
| 41 | return __ebis_insert(root, new); |
| 42 | } |