mirror of
http://git.haproxy.org/git/haproxy.git/
synced 2024-12-11 05:54:39 +00:00
f3bfede52e
(from ebtree 6.0.6) This version is mainly aimed at clarifying the fact that the ebtree license is LGPL. Some files used to indicate LGPL and other ones GPL, while the goal clearly is to have it LGPL. A LICENSE file has also been added. No code is affected, but it's better to have the local tree in sync anyway. (cherry picked from commit 24dc7cca051f081600fe8232f33e55ed30e88425)
43 lines
1.7 KiB
C
43 lines
1.7 KiB
C
/*
|
|
* Elastic Binary Trees - exported functions for Indirect String 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 ebistree.h for more details about those functions */
|
|
|
|
#include "ebistree.h"
|
|
|
|
/* Find the first occurence of a zero-terminated string <x> in the tree <root>.
|
|
* It's the caller's reponsibility to use this function only on trees which
|
|
* only contain zero-terminated strings. If none can be found, return NULL.
|
|
*/
|
|
REGPRM2 struct ebpt_node *ebis_lookup(struct eb_root *root, const char *x)
|
|
{
|
|
return __ebis_lookup(root, x);
|
|
}
|
|
|
|
/* Insert ebpt_node <new> into subtree starting at node root <root>. Only
|
|
* new->key needs be set with the zero-terminated string key. The ebpt_node is
|
|
* returned. If root->b[EB_RGHT]==1, the tree may only contain unique keys. The
|
|
* caller is responsible for properly terminating the key with a zero.
|
|
*/
|
|
REGPRM2 struct ebpt_node *ebis_insert(struct eb_root *root, struct ebpt_node *new)
|
|
{
|
|
return __ebis_insert(root, new);
|
|
}
|