/* * Elastic Binary Trees - exported functinos for Multi-Byte data nodes. * Version 5.0 * (C) 2002-2009 - Willy Tarreau * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program 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 General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* Consult ebmbtree.h for more details about those functions */ #include "ebmbtree.h" /* Find the first occurence of a key of bytes in the tree . * If none can be found, return NULL. */ REGPRM3 struct ebmb_node * ebmb_lookup(struct eb_root *root, const void *x, unsigned int len) { return __ebmb_lookup(root, x, len); } /* Insert ebmb_node into subtree starting at node root . * Only new->key needs be set with the key. The ebmb_node is returned. * If root->b[EB_RGHT]==1, the tree may only contain unique keys. The * len is specified in bytes. */ REGPRM3 struct ebmb_node * ebmb_insert(struct eb_root *root, struct ebmb_node *new, unsigned int len) { return __ebmb_insert(root, new, len); }