diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-28 09:35:11 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-28 09:35:11 +0000 |
commit | da76459dc21b5af2449af2d36eb95226cb186ce2 (patch) | |
tree | 542ebb3c1e796fac2742495b8437331727bbbfa0 /src/ebtree.c | |
parent | Initial commit. (diff) | |
download | haproxy-upstream.tar.xz haproxy-upstream.zip |
Adding upstream version 2.6.12.upstream/2.6.12upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'src/ebtree.c')
-rw-r--r-- | src/ebtree.c | 50 |
1 files changed, 50 insertions, 0 deletions
diff --git a/src/ebtree.c b/src/ebtree.c new file mode 100644 index 0000000..db27875 --- /dev/null +++ b/src/ebtree.c @@ -0,0 +1,50 @@ +/* + * Elastic Binary Trees - exported generic functions + * 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 + */ + +#include <import/ebtree.h> + +void eb_delete(struct eb_node *node) +{ + __eb_delete(node); +} + +/* used by insertion primitives */ +struct eb_node *eb_insert_dup(struct eb_node *sub, struct eb_node *new) +{ + return __eb_insert_dup(sub, new); +} + +/* compares memory blocks m1 and m2 for up to <len> bytes. Immediately stops at + * the first non-matching byte. It returns 0 on full match, non-zero otherwise. + * One byte will always be checked so this must not be called with len==0. It + * takes 2+5cy/B on x86_64 and is ~29 bytes long. + */ +int eb_memcmp(const void *m1, const void *m2, size_t len) +{ + const char *p1 = (const char *)m1 + len; + const char *p2 = (const char *)m2 + len; + ssize_t ofs = -len; + char diff; + + do { + diff = p1[ofs] - p2[ofs]; + } while (!diff && ++ofs); + return diff; +} |