blob: e82ed59e42a9c31d20c57ffde4fe7bb383bd1fb5 [file] [log] [blame]
Willy Tarreauc2186022009-10-26 19:48:54 +01001/*
2 * Elastic Binary Trees - exported generic functions
Willy Tarreauf3bfede2011-07-25 11:38:17 +02003 * Version 6.0.6
4 * (C) 2002-2011 - Willy Tarreau <w@1wt.eu>
Willy Tarreauc2186022009-10-26 19:48:54 +01005 *
Willy Tarreauf3bfede2011-07-25 11:38:17 +02006 * 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.
Willy Tarreauc2186022009-10-26 19:48:54 +010010 *
Willy Tarreauf3bfede2011-07-25 11:38:17 +020011 * This library is distributed in the hope that it will be useful,
Willy Tarreauc2186022009-10-26 19:48:54 +010012 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Willy Tarreauf3bfede2011-07-25 11:38:17 +020013 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
Willy Tarreauc2186022009-10-26 19:48:54 +010015 *
Willy Tarreauf3bfede2011-07-25 11:38:17 +020016 * 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
Willy Tarreauc2186022009-10-26 19:48:54 +010019 */
20
21#include "ebtree.h"
22
23void eb_delete(struct eb_node *node)
24{
25 __eb_delete(node);
26}
27
28/* used by insertion primitives */
29REGPRM1 struct eb_node *eb_insert_dup(struct eb_node *sub, struct eb_node *new)
30{
31 return __eb_insert_dup(sub, new);
32}
Willy Tarreau1b7f58f2020-06-16 11:10:53 +020033
34/* compares memory blocks m1 and m2 for up to <len> bytes. Immediately stops at
35 * the first non-matching byte. It returns 0 on full match, non-zero otherwise.
36 * One byte will always be checked so this must not be called with len==0. It
37 * takes 2+5cy/B on x86_64 and is ~29 bytes long.
38 */
39int eb_memcmp(const void *m1, const void *m2, size_t len)
40{
41 const char *p1 = (const char *)m1 + len;
42 const char *p2 = (const char *)m2 + len;
43 ssize_t ofs = -len;
44 char diff;
45
46 do {
47 diff = p1[ofs] - p2[ofs];
48 } while (!diff && ++ofs);
49 return diff;
50}