RepoMirrors/haproxy
1
0
Fork 0
mirror of http://git.haproxy.org/git/haproxy.git/ synced 2025-04-01 22:48:25 +00:00
Code Issues Packages Projects Releases Wiki Activity

IMPORT: import cebtree (compact elastic binary trees)

Browse Source 
This is an import of the compact elastic binary trees at commit
a9cd84a ("OPTIM: descent: better prefetch less and for writes when
deleting")

These will be used to replace certain lists (and possibly certain
tree nodes as well). They're as fast (or even faster) than ebtrees
for lookups, as fast for insertion and slower for deletion, and a
node only uses 2 pointers (like a list).

The only changes were cebtree.h where common/tools.h was replaced
with ebtree.h which we already have and already provides the needed
functions and macros, and the addition of a wrapper cebtree-prv.h in
src/ to redirect to import/cebtree-prv.h.
This commit is contained in:
Willy Tarreau 2024-09-15 10:10:29 +02:00
parent 6e92988e20
commit a0205f9de4
20 changed files with 3419 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
Makefile
View File

@ -983,6 +983,9 @@ OBJS += src/mux_h2.o src/mux_h1.o src/mux_fcgi.o src/stream.o \
src/hpack-tbl.o src/ebsttree.o src/ebistree.o src/auth.o \
src/hpack-huff.o src/freq_ctr.o src/dict.o src/wdt.o \
src/pipe.o src/init.o src/http_acl.o src/hpack-enc.o \
src/cebu32_tree.o src/cebu64_tree.o src/cebua_tree.o \
src/cebub_tree.o src/cebuib_tree.o src/cebuis_tree.o \
src/cebul_tree.o src/cebus_tree.o \
src/ebtree.o src/dgram.o src/hash.o src/version.o \
src/limits.o src/mux_spop.o

1601
include/import/cebtree-prv.h Normal file
View File

File diff suppressed because it is too large Load Diff

83
include/import/cebtree.h Normal file
View File

@ -0,0 +1,83 @@
/*
* Compact Elastic Binary Trees - exported functions operating on node's address
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#ifndef _CEBTREE_H
#define _CEBTREE_H
#include <stddef.h>
#include "ebtree.h"
/* Standard node when using absolute pointers */
struct ceb_node {
struct ceb_node *b[2]; /* branches: 0=left, 1=right */
};
/* indicates whether a valid node is in a tree or not */
static inline int ceb_intree(const struct ceb_node *node)
{
return !!node->b[0];
}
/* tag an untagged pointer */
static inline struct ceb_node *__ceb_dotag(const struct ceb_node *node)
{
return (struct ceb_node *)((size_t)node + 1);
}
/* untag a tagged pointer */
static inline struct ceb_node *__ceb_untag(const struct ceb_node *node)
{
return (struct ceb_node *)((size_t)node - 1);
}
/* clear a pointer's tag */
static inline struct ceb_node *__ceb_clrtag(const struct ceb_node *node)
{
return (struct ceb_node *)((size_t)node & ~((size_t)1));
}
/* returns whether a pointer is tagged */
static inline int __ceb_tagged(const struct ceb_node *node)
{
return !!((size_t)node & 1);
}
/* returns an integer equivalent of the pointer */
static inline size_t __ceb_intptr(struct ceb_node *tree)
{
return (size_t)tree;
}
///* returns true if at least one of the branches is a subtree node, indicating
// * that the current node is at the top of a duplicate sub-tree and that all
// * values below it are the same.
// */
//static inline int __ceb_is_dup(const struct ceb_node *node)
//{
// return __ceb_tagged((struct ceb_node *)(__ceb_intptr(node->l) | __ceb_intptr(node->r)));
//}
#endif /* _CEBTREE_H */

58
include/import/cebu32_tree.h Normal file
View File

@ -0,0 +1,58 @@
/*
* Compact Elastic Binary Trees - exported functions operating on u32 keys
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include "cebtree.h"
#include <inttypes.h>
/* simpler version */
struct ceb_node *cebu32_insert(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebu32_first(struct ceb_node **root);
struct ceb_node *cebu32_last(struct ceb_node **root);
struct ceb_node *cebu32_lookup(struct ceb_node **root, uint32_t key);
struct ceb_node *cebu32_lookup_le(struct ceb_node **root, uint32_t key);
struct ceb_node *cebu32_lookup_lt(struct ceb_node **root, uint32_t key);
struct ceb_node *cebu32_lookup_ge(struct ceb_node **root, uint32_t key);
struct ceb_node *cebu32_lookup_gt(struct ceb_node **root, uint32_t key);
struct ceb_node *cebu32_next(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebu32_prev(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebu32_delete(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebu32_pick(struct ceb_node **root, uint32_t key);
void cebu32_default_dump(struct ceb_node **ceb_root, const char *label, const void *ctx);
/* version taking a key offset */
struct ceb_node *cebu32_ofs_insert(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebu32_ofs_first(struct ceb_node **root, ptrdiff_t kofs);
struct ceb_node *cebu32_ofs_last(struct ceb_node **root, ptrdiff_t kofs);
struct ceb_node *cebu32_ofs_lookup(struct ceb_node **root, ptrdiff_t kofs, uint32_t key);
struct ceb_node *cebu32_ofs_lookup_le(struct ceb_node **root, ptrdiff_t kofs, uint32_t key);
struct ceb_node *cebu32_ofs_lookup_lt(struct ceb_node **root, ptrdiff_t kofs, uint32_t key);
struct ceb_node *cebu32_ofs_lookup_ge(struct ceb_node **root, ptrdiff_t kofs, uint32_t key);
struct ceb_node *cebu32_ofs_lookup_gt(struct ceb_node **root, ptrdiff_t kofs, uint32_t key);
struct ceb_node *cebu32_ofs_next(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebu32_ofs_prev(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebu32_ofs_delete(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebu32_ofs_pick(struct ceb_node **root, ptrdiff_t kofs, uint32_t key);
void cebu32_ofs_default_dump(struct ceb_node **root, ptrdiff_t kofs, const char *label, const void *ctx);

58
include/import/cebu64_tree.h Normal file
View File

@ -0,0 +1,58 @@
/*
* Compact Elastic Binary Trees - exported functions for operations on u64 keys
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include "cebtree.h"
#include <inttypes.h>
/* simpler version */
struct ceb_node *cebu64_insert(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebu64_first(struct ceb_node **root);
struct ceb_node *cebu64_last(struct ceb_node **root);
struct ceb_node *cebu64_lookup(struct ceb_node **root, uint64_t key);
struct ceb_node *cebu64_lookup_le(struct ceb_node **root, uint64_t key);
struct ceb_node *cebu64_lookup_lt(struct ceb_node **root, uint64_t key);
struct ceb_node *cebu64_lookup_ge(struct ceb_node **root, uint64_t key);
struct ceb_node *cebu64_lookup_gt(struct ceb_node **root, uint64_t key);
struct ceb_node *cebu64_next(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebu64_prev(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebu64_delete(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebu64_pick(struct ceb_node **root, uint64_t key);
void cebu64_default_dump(struct ceb_node **ceb_root, const char *label, const void *ctx);
/* version taking a key offset */
struct ceb_node *cebu64_ofs_insert(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebu64_ofs_first(struct ceb_node **root, ptrdiff_t kofs);
struct ceb_node *cebu64_ofs_last(struct ceb_node **root, ptrdiff_t kofs);
struct ceb_node *cebu64_ofs_lookup(struct ceb_node **root, ptrdiff_t kofs, uint64_t key);
struct ceb_node *cebu64_ofs_lookup_le(struct ceb_node **root, ptrdiff_t kofs, uint64_t key);
struct ceb_node *cebu64_ofs_lookup_lt(struct ceb_node **root, ptrdiff_t kofs, uint64_t key);
struct ceb_node *cebu64_ofs_lookup_ge(struct ceb_node **root, ptrdiff_t kofs, uint64_t key);
struct ceb_node *cebu64_ofs_lookup_gt(struct ceb_node **root, ptrdiff_t kofs, uint64_t key);
struct ceb_node *cebu64_ofs_next(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebu64_ofs_prev(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebu64_ofs_delete(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebu64_ofs_pick(struct ceb_node **root, ptrdiff_t kofs, uint64_t key);
void cebu64_ofs_default_dump(struct ceb_node **root, ptrdiff_t kofs, const char *label, const void *ctx);

57
include/import/cebua_tree.h Normal file
View File

@ -0,0 +1,57 @@
/*
* Compact Elastic Binary Trees - exported functions operating on addr keys
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include "cebtree.h"
/* simpler version */
struct ceb_node *cebua_insert(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebua_first(struct ceb_node **root);
struct ceb_node *cebua_last(struct ceb_node **root);
struct ceb_node *cebua_lookup(struct ceb_node **root, const void *key);
struct ceb_node *cebua_lookup_le(struct ceb_node **root, const void *key);
struct ceb_node *cebua_lookup_lt(struct ceb_node **root, const void *key);
struct ceb_node *cebua_lookup_ge(struct ceb_node **root, const void *key);
struct ceb_node *cebua_lookup_gt(struct ceb_node **root, const void *key);
struct ceb_node *cebua_next(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebua_prev(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebua_delete(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebua_pick(struct ceb_node **root, const void *key);
void cebua_default_dump(struct ceb_node **root, const char *label, const void *ctx);
/* version taking a key offset */
struct ceb_node *cebua_ofs_insert(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebua_ofs_first(struct ceb_node **root, ptrdiff_t kofs);
struct ceb_node *cebua_ofs_last(struct ceb_node **root, ptrdiff_t kofs);
struct ceb_node *cebua_ofs_lookup(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebua_ofs_lookup_le(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebua_ofs_lookup_lt(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebua_ofs_lookup_ge(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebua_ofs_lookup_gt(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebua_ofs_next(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebua_ofs_prev(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebua_ofs_delete(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebua_ofs_pick(struct ceb_node **root, ptrdiff_t kofs, const void *key);
void cebua_ofs_default_dump(struct ceb_node **root, ptrdiff_t kofs, const char *label, const void *ctx);

55
include/import/cebub_tree.h Normal file
View File

@ -0,0 +1,55 @@
/*
* Compact Elastic Binary Trees - exported functions operating on mb keys
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include "cebtree.h"
/* simpler version */
struct ceb_node *cebub_insert(struct ceb_node **root, struct ceb_node *node, size_t len);
struct ceb_node *cebub_first(struct ceb_node **root);
struct ceb_node *cebub_last(struct ceb_node **root);
struct ceb_node *cebub_lookup(struct ceb_node **root, const void *key, size_t len);
struct ceb_node *cebub_lookup_le(struct ceb_node **root, const void *key, size_t len);
struct ceb_node *cebub_lookup_lt(struct ceb_node **root, const void *key, size_t len);
struct ceb_node *cebub_lookup_ge(struct ceb_node **root, const void *key, size_t len);
struct ceb_node *cebub_lookup_gt(struct ceb_node **root, const void *key, size_t len);
struct ceb_node *cebub_next(struct ceb_node **root, struct ceb_node *node, size_t len);
struct ceb_node *cebub_prev(struct ceb_node **root, struct ceb_node *node, size_t len);
struct ceb_node *cebub_delete(struct ceb_node **root, struct ceb_node *node, size_t len);
struct ceb_node *cebub_pick(struct ceb_node **root, const void *key, size_t len);
/* version taking a key offset */
struct ceb_node *cebub_ofs_insert(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node, size_t len);
struct ceb_node *cebub_ofs_first(struct ceb_node **root, ptrdiff_t kofs, size_t len);
struct ceb_node *cebub_ofs_last(struct ceb_node **root, ptrdiff_t kofs, size_t len);
struct ceb_node *cebub_ofs_lookup(struct ceb_node **root, ptrdiff_t kofs, const void *key, size_t len);
struct ceb_node *cebub_ofs_lookup_le(struct ceb_node **root, ptrdiff_t kofs, const void *key, size_t len);
struct ceb_node *cebub_ofs_lookup_lt(struct ceb_node **root, ptrdiff_t kofs, const void *key, size_t len);
struct ceb_node *cebub_ofs_lookup_ge(struct ceb_node **root, ptrdiff_t kofs, const void *key, size_t len);
struct ceb_node *cebub_ofs_lookup_gt(struct ceb_node **root, ptrdiff_t kofs, const void *key, size_t len);
struct ceb_node *cebub_ofs_next(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node, size_t len);
struct ceb_node *cebub_ofs_prev(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node, size_t len);
struct ceb_node *cebub_ofs_delete(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node, size_t len);
struct ceb_node *cebub_ofs_pick(struct ceb_node **root, ptrdiff_t kofs, const void *key, size_t len);

55
include/import/cebuib_tree.h Normal file
View File

@ -0,0 +1,55 @@
/*
* Compact Elastic Binary Trees - exported functions operating on indirect blocks
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include "cebtree.h"
/* simpler version */
struct ceb_node *cebuib_insert(struct ceb_node **root, struct ceb_node *node, size_t len);
struct ceb_node *cebuib_first(struct ceb_node **root);
struct ceb_node *cebuib_last(struct ceb_node **root);
struct ceb_node *cebuib_lookup(struct ceb_node **root, const void *key, size_t len);
struct ceb_node *cebuib_lookup_le(struct ceb_node **root, const void *key, size_t len);
struct ceb_node *cebuib_lookup_lt(struct ceb_node **root, const void *key, size_t len);
struct ceb_node *cebuib_lookup_ge(struct ceb_node **root, const void *key, size_t len);
struct ceb_node *cebuib_lookup_gt(struct ceb_node **root, const void *key, size_t len);
struct ceb_node *cebuib_next(struct ceb_node **root, struct ceb_node *node, size_t len);
struct ceb_node *cebuib_prev(struct ceb_node **root, struct ceb_node *node, size_t len);
struct ceb_node *cebuib_delete(struct ceb_node **root, struct ceb_node *node, size_t len);
struct ceb_node *cebuib_pick(struct ceb_node **root, const void *key, size_t len);
/* version taking a key offset */
struct ceb_node *cebuib_ofs_insert(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node, size_t len);
struct ceb_node *cebuib_ofs_first(struct ceb_node **root, ptrdiff_t kofs, size_t len);
struct ceb_node *cebuib_ofs_last(struct ceb_node **root, ptrdiff_t kofs, size_t len);
struct ceb_node *cebuib_ofs_lookup(struct ceb_node **root, ptrdiff_t kofs, const void *key, size_t len);
struct ceb_node *cebuib_ofs_lookup_le(struct ceb_node **root, ptrdiff_t kofs, const void *key, size_t len);
struct ceb_node *cebuib_ofs_lookup_lt(struct ceb_node **root, ptrdiff_t kofs, const void *key, size_t len);
struct ceb_node *cebuib_ofs_lookup_ge(struct ceb_node **root, ptrdiff_t kofs, const void *key, size_t len);
struct ceb_node *cebuib_ofs_lookup_gt(struct ceb_node **root, ptrdiff_t kofs, const void *key, size_t len);
struct ceb_node *cebuib_ofs_next(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node, size_t len);
struct ceb_node *cebuib_ofs_prev(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node, size_t len);
struct ceb_node *cebuib_ofs_delete(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node, size_t len);
struct ceb_node *cebuib_ofs_pick(struct ceb_node **root, ptrdiff_t kofs, const void *key, size_t len);

57
include/import/cebuis_tree.h Normal file
View File

@ -0,0 +1,57 @@
/*
* Compact Elastic Binary Trees - exported functions operating on indirect strings
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include "cebtree.h"
/* simpler version */
struct ceb_node *cebuis_insert(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebuis_first(struct ceb_node **root);
struct ceb_node *cebuis_last(struct ceb_node **root);
struct ceb_node *cebuis_lookup(struct ceb_node **root, const void *key);
struct ceb_node *cebuis_lookup_le(struct ceb_node **root, const void *key);
struct ceb_node *cebuis_lookup_lt(struct ceb_node **root, const void *key);
struct ceb_node *cebuis_lookup_ge(struct ceb_node **root, const void *key);
struct ceb_node *cebuis_lookup_gt(struct ceb_node **root, const void *key);
struct ceb_node *cebuis_next(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebuis_prev(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebuis_delete(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebuis_pick(struct ceb_node **root, const void *key);
void cebuis_default_dump(struct ceb_node **root, const char *label, const void *ctx);
/* version taking a key offset */
struct ceb_node *cebuis_ofs_insert(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebuis_ofs_first(struct ceb_node **root, ptrdiff_t kofs);
struct ceb_node *cebuis_ofs_last(struct ceb_node **root, ptrdiff_t kofs);
struct ceb_node *cebuis_ofs_lookup(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebuis_ofs_lookup_le(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebuis_ofs_lookup_lt(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebuis_ofs_lookup_ge(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebuis_ofs_lookup_gt(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebuis_ofs_next(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebuis_ofs_prev(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebuis_ofs_delete(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebuis_ofs_pick(struct ceb_node **root, ptrdiff_t kofs, const void *key);
void cebuis_ofs_default_dump(struct ceb_node **root, ptrdiff_t kofs, const char *label, const void *ctx);

57
include/import/cebul_tree.h Normal file
View File

@ -0,0 +1,57 @@
/*
* Compact Elastic Binary Trees - exported functions operating on ulong keys
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include "cebtree.h"
/* simpler version */
struct ceb_node *cebul_insert(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebul_first(struct ceb_node **root);
struct ceb_node *cebul_last(struct ceb_node **root);
struct ceb_node *cebul_lookup(struct ceb_node **root, unsigned long key);
struct ceb_node *cebul_lookup_le(struct ceb_node **root, unsigned long key);
struct ceb_node *cebul_lookup_lt(struct ceb_node **root, unsigned long key);
struct ceb_node *cebul_lookup_ge(struct ceb_node **root, unsigned long key);
struct ceb_node *cebul_lookup_gt(struct ceb_node **root, unsigned long key);
struct ceb_node *cebul_next(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebul_prev(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebul_delete(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebul_pick(struct ceb_node **root, unsigned long key);
void cebul_default_dump(struct ceb_node **ceb_root, const char *label, const void *ctx);
/* version taking a key offset */
struct ceb_node *cebul_ofs_insert(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebul_ofs_first(struct ceb_node **root, ptrdiff_t kofs);
struct ceb_node *cebul_ofs_last(struct ceb_node **root, ptrdiff_t kofs);
struct ceb_node *cebul_ofs_lookup(struct ceb_node **root, ptrdiff_t kofs, unsigned long key);
struct ceb_node *cebul_ofs_lookup_le(struct ceb_node **root, ptrdiff_t kofs, unsigned long key);
struct ceb_node *cebul_ofs_lookup_lt(struct ceb_node **root, ptrdiff_t kofs, unsigned long key);
struct ceb_node *cebul_ofs_lookup_ge(struct ceb_node **root, ptrdiff_t kofs, unsigned long key);
struct ceb_node *cebul_ofs_lookup_gt(struct ceb_node **root, ptrdiff_t kofs, unsigned long key);
struct ceb_node *cebul_ofs_next(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebul_ofs_prev(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebul_ofs_delete(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebul_ofs_pick(struct ceb_node **root, ptrdiff_t kofs, unsigned long key);
void cebul_ofs_default_dump(struct ceb_node **root, ptrdiff_t kofs, const char *label, const void *ctx);

57
include/import/cebus_tree.h Normal file
View File

@ -0,0 +1,57 @@
/*
* Compact Elastic Binary Trees - exported functions operating on string keys
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include "cebtree.h"
/* simpler version */
struct ceb_node *cebus_insert(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebus_first(struct ceb_node **root);
struct ceb_node *cebus_last(struct ceb_node **root);
struct ceb_node *cebus_lookup(struct ceb_node **root, const void *key);
struct ceb_node *cebus_lookup_le(struct ceb_node **root, const void *key);
struct ceb_node *cebus_lookup_lt(struct ceb_node **root, const void *key);
struct ceb_node *cebus_lookup_ge(struct ceb_node **root, const void *key);
struct ceb_node *cebus_lookup_gt(struct ceb_node **root, const void *key);
struct ceb_node *cebus_next(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebus_prev(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebus_delete(struct ceb_node **root, struct ceb_node *node);
struct ceb_node *cebus_pick(struct ceb_node **root, const void *key);
void cebus_default_dump(struct ceb_node **root, const char *label, const void *ctx);
/* version taking a key offset */
struct ceb_node *cebus_ofs_insert(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebus_ofs_first(struct ceb_node **root, ptrdiff_t kofs);
struct ceb_node *cebus_ofs_last(struct ceb_node **root, ptrdiff_t kofs);
struct ceb_node *cebus_ofs_lookup(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebus_ofs_lookup_le(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebus_ofs_lookup_lt(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebus_ofs_lookup_ge(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebus_ofs_lookup_gt(struct ceb_node **root, ptrdiff_t kofs, const void *key);
struct ceb_node *cebus_ofs_next(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebus_ofs_prev(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebus_ofs_delete(struct ceb_node **root, ptrdiff_t kofs, struct ceb_node *node);
struct ceb_node *cebus_ofs_pick(struct ceb_node **root, ptrdiff_t kofs, const void *key);
void cebus_ofs_default_dump(struct ceb_node **root, ptrdiff_t kofs, const char *label, const void *ctx);

2
src/cebtree-prv.h Normal file
View File

@ -0,0 +1,2 @@
/* Only needed for ceb*.c */
#include <import/cebtree-prv.h>

162
src/cebu32_tree.c Normal file
View File

@ -0,0 +1,162 @@
/*
* Compact Elastic Binary Trees - exported functions operating on u32 keys
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include "cebtree-prv.h"
/*****************************************************************************\
* The declarations below always cause two functions to be declared, one *
* starting with "cebu32_*" and one with "cebu32_ofs_*" which takes a key *
* offset just after the root. The one without kofs just has this argument *
* omitted from its declaration and replaced with sizeof(struct ceb_node) in *
* the call to the underlying functions. *
\*****************************************************************************/
/* Inserts node <node> into unique tree <tree> based on its key that
* immediately follows the node. Returns the inserted node or the one
* that already contains the same key.
*/
CEB_FDECL3(struct ceb_node *, cebu32, _insert, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
uint32_t key = NODEK(node, kofs)->u32;
return _cebu_insert(root, node, kofs, CEB_KT_U32, key, 0, NULL);
}
/* return the first node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebu32, _first, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_first(root, kofs, CEB_KT_U32);
}
/* return the last node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebu32, _last, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_last(root, kofs, CEB_KT_U32);
}
/* look up the specified key, and returns either the node containing it, or
* NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebu32, _lookup, struct ceb_node **, root, ptrdiff_t, kofs, uint32_t, key)
{
return _cebu_lookup(root, kofs, CEB_KT_U32, key, 0, NULL);
}
/* look up the specified key or the highest below it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebu32, _lookup_le, struct ceb_node **, root, ptrdiff_t, kofs, uint32_t, key)
{
return _cebu_lookup_le(root, kofs, CEB_KT_U32, key, 0, NULL);
}
/* look up highest key below the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebu32, _lookup_lt, struct ceb_node **, root, ptrdiff_t, kofs, uint32_t, key)
{
return _cebu_lookup_lt(root, kofs, CEB_KT_U32, key, 0, NULL);
}
/* look up the specified key or the smallest above it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebu32, _lookup_ge, struct ceb_node **, root, ptrdiff_t, kofs, uint32_t, key)
{
return _cebu_lookup_ge(root, kofs, CEB_KT_U32, key, 0, NULL);
}
/* look up the smallest key above the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebu32, _lookup_gt, struct ceb_node **, root, ptrdiff_t, kofs, uint32_t, key)
{
return _cebu_lookup_gt(root, kofs, CEB_KT_U32, key, 0, NULL);
}
/* search for the next node after the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a left turn was made, and returning the first node along the right
* branch at that fork.
*/
CEB_FDECL3(struct ceb_node *, cebu32, _next, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
uint32_t key = NODEK(node, kofs)->u32;
return _cebu_next(root, kofs, CEB_KT_U32, key, 0, NULL);
}
/* search for the prev node before the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a right turn was made, and returning the last node along the left
* branch at that fork.
*/
CEB_FDECL3(struct ceb_node *, cebu32, _prev, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
uint32_t key = NODEK(node, kofs)->u32;
return _cebu_prev(root, kofs, CEB_KT_U32, key, 0, NULL);
}
/* look up the specified node with its key and deletes it if found, and in any
* case, returns the node.
*/
CEB_FDECL3(struct ceb_node *, cebu32, _delete, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
uint32_t key = NODEK(node, kofs)->u32;
return _cebu_delete(root, node, kofs, CEB_KT_U32, key, 0, NULL);
}
/* look up the specified key, and detaches it and returns it if found, or NULL
* if not found.
*/
CEB_FDECL3(struct ceb_node *, cebu32, _pick, struct ceb_node **, root, ptrdiff_t, kofs, uint32_t, key)
{
return _cebu_delete(root, NULL, kofs, CEB_KT_U32, key, 0, NULL);
}
/* dumps a ceb_node tree using the default functions above. If a node matches
* <ctx>, this one will be highlighted in red.
*/
CEB_FDECL4(void, cebu32, _default_dump, struct ceb_node **, root, ptrdiff_t, kofs, const char *, label, const void *, ctx)
{
printf("\ndigraph cebu32_tree {\n"
" fontname=\"fixed\";\n"
" fontsize=8\n"
" label=\"%s\"\n"
"", label);
printf(" node [fontname=\"fixed\" fontsize=8 shape=\"box\" style=\"filled\" color=\"black\" fillcolor=\"white\"];\n"
" edge [fontname=\"fixed\" fontsize=8 style=\"solid\" color=\"magenta\" dir=\"forward\"];\n");
cebu_default_dump_tree(kofs, CEB_KT_U32, root, 0, NULL, 0, ctx, NULL, NULL, NULL);
printf("}\n");
}

162
src/cebu64_tree.c Normal file
View File

@ -0,0 +1,162 @@
/*
* Compact Elastic Binary Trees - exported functions operating on u64 keys
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include "cebtree-prv.h"
/*****************************************************************************\
* The declarations below always cause two functions to be declared, one *
* starting with "cebu64_*" and one with "cebu64_ofs_*" which takes a key *
* offset just after the root. The one without kofs just has this argument *
* omitted from its declaration and replaced with sizeof(struct ceb_node) in *
* the call to the underlying functions. *
\*****************************************************************************/
/* Inserts node <node> into unique tree <tree> based on its key that
* immediately follows the node. Returns the inserted node or the one
* that already contains the same key.
*/
CEB_FDECL3(struct ceb_node *, cebu64, _insert, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
uint64_t key = NODEK(node, kofs)->u64;
return _cebu_insert(root, node, kofs, CEB_KT_U64, 0, key, NULL);
}
/* return the first node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebu64, _first, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_first(root, kofs, CEB_KT_U64);
}
/* return the last node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebu64, _last, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_last(root, kofs, CEB_KT_U64);
}
/* look up the specified key, and returns either the node containing it, or
* NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebu64, _lookup, struct ceb_node **, root, ptrdiff_t, kofs, uint64_t, key)
{
return _cebu_lookup(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* look up the specified key or the highest below it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebu64, _lookup_le, struct ceb_node **, root, ptrdiff_t, kofs, uint64_t, key)
{
return _cebu_lookup_le(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* look up highest key below the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebu64, _lookup_lt, struct ceb_node **, root, ptrdiff_t, kofs, uint64_t, key)
{
return _cebu_lookup_lt(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* look up the specified key or the smallest above it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebu64, _lookup_ge, struct ceb_node **, root, ptrdiff_t, kofs, uint64_t, key)
{
return _cebu_lookup_ge(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* look up the smallest key above the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebu64, _lookup_gt, struct ceb_node **, root, ptrdiff_t, kofs, uint64_t, key)
{
return _cebu_lookup_gt(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* search for the next node after the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a left turn was made, and returning the first node along the right
* branch at that fork.
*/
CEB_FDECL3(struct ceb_node *, cebu64, _next, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
uint64_t key = NODEK(node, kofs)->u64;
return _cebu_next(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* search for the prev node before the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a right turn was made, and returning the last node along the left
* branch at that fork.
*/
CEB_FDECL3(struct ceb_node *, cebu64, _prev, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
uint64_t key = NODEK(node, kofs)->u64;
return _cebu_prev(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* look up the specified node with its key and deletes it if found, and in any
* case, returns the node.
*/
CEB_FDECL3(struct ceb_node *, cebu64, _delete, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
uint64_t key = NODEK(node, kofs)->u64;
return _cebu_delete(root, node, kofs, CEB_KT_U64, 0, key, NULL);
}
/* look up the specified key, and detaches it and returns it if found, or NULL
* if not found.
*/
CEB_FDECL3(struct ceb_node *, cebu64, _pick, struct ceb_node **, root, ptrdiff_t, kofs, uint64_t, key)
{
return _cebu_delete(root, NULL, kofs, CEB_KT_U64, 0, key, NULL);
}
/* dumps a ceb_node tree using the default functions above. If a node matches
* <ctx>, this one will be highlighted in red.
*/
CEB_FDECL4(void, cebu64, _default_dump, struct ceb_node **, root, ptrdiff_t, kofs, const char *, label, const void *, ctx)
{
printf("\ndigraph cebu64_tree {\n"
" fontname=\"fixed\";\n"
" fontsize=8\n"
" label=\"%s\"\n"
"", label);
printf(" node [fontname=\"fixed\" fontsize=8 shape=\"box\" style=\"filled\" color=\"black\" fillcolor=\"white\"];\n"
" edge [fontname=\"fixed\" fontsize=8 style=\"solid\" color=\"magenta\" dir=\"forward\"];\n");
cebu_default_dump_tree(kofs, CEB_KT_U64, root, 0, NULL, 0, ctx, NULL, NULL, NULL);
printf("}\n");
}

153
src/cebua_tree.c Normal file
View File

@ -0,0 +1,153 @@
/*
* Compact Elastic Binary Trees - exported functions operating on addr keys
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include "cebtree-prv.h"
/*****************************************************************************\
* The declarations below always cause two functions to be declared, one *
* starting with "cebua_*" and one with "cebua_ofs_*" which takes a key *
* offset just after the root. The one without kofs just has this argument *
* omitted from its declaration and replaced with sizeof(struct ceb_node) in *
* the call to the underlying functions. *
\*****************************************************************************/
/* Inserts node <node> into unique tree <tree> based on its own address
* Returns the inserted node or the one that has the same address.
*/
CEB_FDECL3(struct ceb_node *, cebua, _insert, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
return _cebu_insert(root, node, kofs, CEB_KT_ADDR, 0, 0, node);
}
/* return the first node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebua, _first, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_first(root, kofs, CEB_KT_ADDR);
}
/* return the last node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebua, _last, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_last(root, kofs, CEB_KT_ADDR);
}
/* look up the specified key, and returns either the node containing it, or
* NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebua, _lookup, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup(root, kofs, CEB_KT_ADDR, 0, 0, key);
}
/* look up the specified key or the highest below it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebua, _lookup_le, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup_le(root, kofs, CEB_KT_ADDR, 0, 0, key);
}
/* look up highest key below the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebua, _lookup_lt, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup_lt(root, kofs, CEB_KT_ADDR, 0, 0, key);
}
/* look up the specified key or the smallest above it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebua, _lookup_ge, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup_ge(root, kofs, CEB_KT_ADDR, 0, 0, key);
}
/* look up the smallest key above the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebua, _lookup_gt, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup_gt(root, kofs, CEB_KT_ADDR, 0, 0, key);
}
/* search for the next node after the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a left turn was made, and returning the first node along the right
* branch at that fork.
*/
CEB_FDECL3(struct ceb_node *, cebua, _next, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
return _cebu_next(root, kofs, CEB_KT_ADDR, 0, 0, node);
}
/* search for the prev node before the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a right turn was made, and returning the last node along the left
* branch at that fork.
*/
CEB_FDECL3(struct ceb_node *, cebua, _prev, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
return _cebu_prev(root, kofs, CEB_KT_ADDR, 0, 0, node);
}
/* look up the specified node with its key and deletes it if found, and in any
* case, returns the node.
*/
CEB_FDECL3(struct ceb_node *, cebua, _delete, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
return _cebu_delete(root, node, kofs, CEB_KT_ADDR, 0, 0, node);
}
/* look up the specified key, and detaches it and returns it if found, or NULL
* if not found.
*/
CEB_FDECL3(struct ceb_node *, cebua, _pick, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_delete(root, NULL, kofs, CEB_KT_ADDR, 0, 0, key);
}
/* dumps a ceb_node tree using the default functions above. If a node matches
* <ctx>, this one will be highlighted in red.
*/
CEB_FDECL4(void, cebua, _default_dump, struct ceb_node **, root, ptrdiff_t, kofs, const char *, label, const void *, ctx)
{
printf("\ndigraph cebua_tree {\n"
" fontname=\"fixed\";\n"
" fontsize=8\n"
" label=\"%s\"\n"
"", label);
printf(" node [fontname=\"fixed\" fontsize=8 shape=\"box\" style=\"filled\" color=\"black\" fillcolor=\"white\"];\n"
" edge [fontname=\"fixed\" fontsize=8 style=\"solid\" color=\"magenta\" dir=\"forward\"];\n");
cebu_default_dump_tree(kofs, CEB_KT_ADDR, root, 0, NULL, 0, ctx, NULL, NULL, NULL);
printf("}\n");
}

147
src/cebub_tree.c Normal file
View File

@ -0,0 +1,147 @@
/*
* Compact Elastic Binary Trees - exported functions operating on mb keys
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "cebtree-prv.h"
/*****************************************************************************\
* The declarations below always cause two functions to be declared, one *
* starting with "cebub_*" and one with "cebub_ofs_*" which takes a key *
* offset just after the root. The one without kofs just has this argument *
* omitted from its declaration and replaced with sizeof(struct ceb_node) in *
* the call to the underlying functions. *
\*****************************************************************************/
/* Inserts node <node> into unique tree <tree> based on its key that
* immediately follows the node and for <len> bytes. Returns the
* inserted node or the one that already contains the same key.
*/
CEB_FDECL4(struct ceb_node *, cebub, _insert, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node, size_t, len)
{
const void *key = NODEK(node, kofs)->mb;
return _cebu_insert(root, node, kofs, CEB_KT_MB, 0, len, key);
}
/* return the first node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebub, _first, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_first(root, kofs, CEB_KT_MB);
}
/* return the last node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebub, _last, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_last(root, kofs, CEB_KT_MB);
}
/* look up the specified key <key> of length <len>, and returns either the node
* containing it, or NULL if not found.
*/
CEB_FDECL4(struct ceb_node *, cebub, _lookup, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key, size_t, len)
{
return _cebu_lookup(root, kofs, CEB_KT_MB, 0, len, key);
}
/* look up the specified key or the highest below it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL4(struct ceb_node *, cebub, _lookup_le, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key, size_t, len)
{
return _cebu_lookup_le(root, kofs, CEB_KT_MB, 0, len, key);
}
/* look up highest key below the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL4(struct ceb_node *, cebub, _lookup_lt, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key, size_t, len)
{
return _cebu_lookup_lt(root, kofs, CEB_KT_MB, 0, len, key);
}
/* look up the specified key or the smallest above it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL4(struct ceb_node *, cebub, _lookup_ge, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key, size_t, len)
{
return _cebu_lookup_ge(root, kofs, CEB_KT_MB, 0, len, key);
}
/* look up the smallest key above the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL4(struct ceb_node *, cebub, _lookup_gt, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key, size_t, len)
{
return _cebu_lookup_gt(root, kofs, CEB_KT_MB, 0, len, key);
}
/* search for the next node after the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a left turn was made, and returning the first node along the right
* branch at that fork. The <len> field must correspond to the key length in
* bytes.
*/
CEB_FDECL4(struct ceb_node *, cebub, _next, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node, size_t, len)
{
const void *key = NODEK(node, kofs)->mb;
return _cebu_next(root, kofs, CEB_KT_MB, 0, len, key);
}
/* search for the prev node before the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a right turn was made, and returning the last node along the left
* branch at that fork. The <len> field must correspond to the key length in
* bytes.
*/
CEB_FDECL4(struct ceb_node *, cebub, _prev, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node, size_t, len)
{
const void *key = NODEK(node, kofs)->mb;
return _cebu_prev(root, kofs, CEB_KT_MB, 0, len, key);
}
/* look up the specified node with its key and deletes it if found, and in any
* case, returns the node. The <len> field must correspond to the key length in
* bytes.
*/
CEB_FDECL4(struct ceb_node *, cebub, _delete, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node, size_t, len)
{
const void *key = NODEK(node, kofs)->mb;
return _cebu_delete(root, node, kofs, CEB_KT_MB, 0, len, key);
}
/* look up the specified key, and detaches it and returns it if found, or NULL
* if not found. The <len> field must correspond to the key length in bytes.
*/
CEB_FDECL4(struct ceb_node *, cebub, _pick, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key, size_t, len)
{
return _cebu_delete(root, NULL, kofs, CEB_KT_MB, 0, len, key);
}

147
src/cebuib_tree.c Normal file
View File

@ -0,0 +1,147 @@
/*
* Compact Elastic Binary Trees - exported functions operating on indirect blocks
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "cebtree-prv.h"
/*****************************************************************************\
* The declarations below always cause two functions to be declared, one *
* starting with "cebuib_*" and one with "cebuib_ofs_*" which takes a key *
* offset just after the root. The one without kofs just has this argument *
* omitted from its declaration and replaced with sizeof(struct ceb_node) in *
* the call to the underlying functions. *
\*****************************************************************************/
/* Inserts node <node> into unique tree <tree> based on its key whose pointer
* immediately follows the node and for <len> bytes. Returns the inserted node
* or the one that already contains the same key.
*/
CEB_FDECL4(struct ceb_node *, cebuib, _insert, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node, size_t, len)
{
const void *key = NODEK(node, kofs)->ptr;
return _cebu_insert(root, node, kofs, CEB_KT_IM, 0, len, key);
}
/* return the first node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebuib, _first, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_first(root, kofs, CEB_KT_IM);
}
/* return the last node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebuib, _last, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_last(root, kofs, CEB_KT_IM);
}
/* look up the specified key <key> of length <len>, and returns either the node
* containing it, or NULL if not found.
*/
CEB_FDECL4(struct ceb_node *, cebuib, _lookup, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key, size_t, len)
{
return _cebu_lookup(root, kofs, CEB_KT_IM, 0, len, key);
}
/* look up the specified key or the highest below it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL4(struct ceb_node *, cebuib, _lookup_le, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key, size_t, len)
{
return _cebu_lookup_le(root, kofs, CEB_KT_IM, 0, len, key);
}
/* look up highest key below the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL4(struct ceb_node *, cebuib, _lookup_lt, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key, size_t, len)
{
return _cebu_lookup_lt(root, kofs, CEB_KT_IM, 0, len, key);
}
/* look up the specified key or the smallest above it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL4(struct ceb_node *, cebuib, _lookup_ge, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key, size_t, len)
{
return _cebu_lookup_ge(root, kofs, CEB_KT_IM, 0, len, key);
}
/* look up the smallest key above the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL4(struct ceb_node *, cebuib, _lookup_gt, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key, size_t, len)
{
return _cebu_lookup_gt(root, kofs, CEB_KT_IM, 0, len, key);
}
/* search for the next node after the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a left turn was made, and returning the first node along the right
* branch at that fork. The <len> field must correspond to the key length in
* bytes.
*/
CEB_FDECL4(struct ceb_node *, cebuib, _next, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node, size_t, len)
{
const void *key = NODEK(node, kofs)->ptr;
return _cebu_next(root, kofs, CEB_KT_IM, 0, len, key);
}
/* search for the prev node before the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a right turn was made, and returning the last node along the left
* branch at that fork. The <len> field must correspond to the key length in
* bytes.
*/
CEB_FDECL4(struct ceb_node *, cebuib, _prev, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node, size_t, len)
{
const void *key = NODEK(node, kofs)->ptr;
return _cebu_prev(root, kofs, CEB_KT_IM, 0, len, key);
}
/* look up the specified node with its key and deletes it if found, and in any
* case, returns the node. The <len> field must correspond to the key length in
* bytes.
*/
CEB_FDECL4(struct ceb_node *, cebuib, _delete, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node, size_t, len)
{
const void *key = NODEK(node, kofs)->ptr;
return _cebu_delete(root, node, kofs, CEB_KT_IM, 0, len, key);
}
/* look up the specified key, and detaches it and returns it if found, or NULL
* if not found. The <len> field must correspond to the key length in bytes.
*/
CEB_FDECL4(struct ceb_node *, cebuib, _pick, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key, size_t, len)
{
return _cebu_delete(root, NULL, kofs, CEB_KT_IM, 0, len, key);
}

144
src/cebuis_tree.c Normal file
View File

@ -0,0 +1,144 @@
/*
* Compact Elastic Binary Trees - exported functions operating on indirect strings
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "cebtree-prv.h"
/*****************************************************************************\
* The declarations below always cause two functions to be declared, one *
* starting with "cebuis_*" and one with "cebuis_ofs_*" which takes a key *
* offset just after the root. The one without kofs just has this argument *
* omitted from its declaration and replaced with sizeof(struct ceb_node) in *
* the call to the underlying functions. *
\*****************************************************************************/
/* Inserts node <node> into unique tree <tree> based on its key whose pointer
* immediately follows the node. Returns the inserted node or the one that
* already contains the same key.
*/
CEB_FDECL3(struct ceb_node *, cebuis, _insert, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
const void *key = NODEK(node, kofs)->ptr;
return _cebu_insert(root, node, kofs, CEB_KT_IS, 0, 0, key);
}
/* return the first node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebuis, _first, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_first(root, kofs, CEB_KT_IS);
}
/* return the last node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebuis, _last, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_last(root, kofs, CEB_KT_IS);
}
/* look up the specified key, and returns either the node containing it, or
* NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebuis, _lookup, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup(root, kofs, CEB_KT_IS, 0, 0, key);
}
/* look up the specified key or the highest below it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebuis, _lookup_le, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup_le(root, kofs, CEB_KT_IS, 0, 0, key);
}
/* look up highest key below the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebuis, _lookup_lt, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup_lt(root, kofs, CEB_KT_IS, 0, 0, key);
}
/* look up the specified key or the smallest above it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebuis, _lookup_ge, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup_ge(root, kofs, CEB_KT_IS, 0, 0, key);
}
/* look up the smallest key above the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebuis, _lookup_gt, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup_gt(root, kofs, CEB_KT_IS, 0, 0, key);
}
/* search for the next node after the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a left turn was made, and returning the first node along the right
* branch at that fork.
*/
CEB_FDECL3(struct ceb_node *, cebuis, _next, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
const void *key = NODEK(node, kofs)->ptr;
return _cebu_next(root, kofs, CEB_KT_IS, 0, 0, key);
}
/* search for the prev node before the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a right turn was made, and returning the last node along the left
* branch at that fork.
*/
CEB_FDECL3(struct ceb_node *, cebuis, _prev, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
const void *key = NODEK(node, kofs)->ptr;
return _cebu_prev(root, kofs, CEB_KT_IS, 0, 0, key);
}
/* look up the specified node with its key and deletes it if found, and in any
* case, returns the node.
*/
CEB_FDECL3(struct ceb_node *, cebuis, _delete, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
const void *key = NODEK(node, kofs)->ptr;
return _cebu_delete(root, node, kofs, CEB_KT_IS, 0, 0, key);
}
/* look up the specified key, and detaches it and returns it if found, or NULL
* if not found.
*/
CEB_FDECL3(struct ceb_node *, cebuis, _pick, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_delete(root, NULL, kofs, CEB_KT_IS, 0, 0, key);
}

198
src/cebul_tree.c Normal file
View File

@ -0,0 +1,198 @@
/*
* Compact Elastic Binary Trees - exported functions operating on ulong keys
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include "cebtree-prv.h"
/*****************************************************************************\
* The declarations below always cause two functions to be declared, one *
* starting with "cebu32_*" and one with "cebu32_ofs_*" which takes a key *
* offset just after the root. The one without kofs just has this argument *
* omitted from its declaration and replaced with sizeof(struct ceb_node) in *
* the call to the underlying functions. *
\*****************************************************************************/
/* Inserts node <node> into unique tree <tree> based on its key that
* immediately follows the node. Returns the inserted node or the one
* that already contains the same key.
*/
CEB_FDECL3(struct ceb_node *, cebul, _insert, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
unsigned long key = NODEK(node, kofs)->ul;
if (sizeof(long) <= 4)
return _cebu_insert(root, node, kofs, CEB_KT_U32, key, 0, NULL);
else
return _cebu_insert(root, node, kofs, CEB_KT_U64, 0, key, NULL);
}
/* return the first node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebul, _first, struct ceb_node **, root, ptrdiff_t, kofs)
{
if (sizeof(long) <= 4)
return _cebu_first(root, kofs, CEB_KT_U32);
else
return _cebu_first(root, kofs, CEB_KT_U64);
}
/* return the last node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebul, _last, struct ceb_node **, root, ptrdiff_t, kofs)
{
if (sizeof(long) <= 4)
return _cebu_last(root, kofs, CEB_KT_U32);
else
return _cebu_last(root, kofs, CEB_KT_U64);
}
/* look up the specified key, and returns either the node containing it, or
* NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebul, _lookup, struct ceb_node **, root, ptrdiff_t, kofs, unsigned long, key)
{
if (sizeof(long) <= 4)
return _cebu_lookup(root, kofs, CEB_KT_U32, key, 0, NULL);
else
return _cebu_lookup(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* look up the specified key or the highest below it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebul, _lookup_le, struct ceb_node **, root, ptrdiff_t, kofs, unsigned long, key)
{
if (sizeof(long) <= 4)
return _cebu_lookup_le(root, kofs, CEB_KT_U32, key, 0, NULL);
else
return _cebu_lookup_le(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* look up highest key below the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebul, _lookup_lt, struct ceb_node **, root, ptrdiff_t, kofs, unsigned long, key)
{
if (sizeof(long) <= 4)
return _cebu_lookup_lt(root, kofs, CEB_KT_U32, key, 0, NULL);
else
return _cebu_lookup_lt(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* look up the specified key or the smallest above it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebul, _lookup_ge, struct ceb_node **, root, ptrdiff_t, kofs, unsigned long, key)
{
if (sizeof(long) <= 4)
return _cebu_lookup_ge(root, kofs, CEB_KT_U32, key, 0, NULL);
else
return _cebu_lookup_ge(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* look up the smallest key above the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebul, _lookup_gt, struct ceb_node **, root, ptrdiff_t, kofs, unsigned long, key)
{
if (sizeof(long) <= 4)
return _cebu_lookup_gt(root, kofs, CEB_KT_U32, key, 0, NULL);
else
return _cebu_lookup_gt(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* search for the next node after the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a left turn was made, and returning the first node along the right
* branch at that fork.
*/
CEB_FDECL3(struct ceb_node *, cebul, _next, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
unsigned long key = NODEK(node, kofs)->ul;
if (sizeof(long) <= 4)
return _cebu_next(root, kofs, CEB_KT_U32, key, 0, NULL);
else
return _cebu_next(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* search for the prev node before the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a right turn was made, and returning the last node along the left
* branch at that fork.
*/
CEB_FDECL3(struct ceb_node *, cebul, _prev, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
unsigned long key = NODEK(node, kofs)->ul;
if (sizeof(long) <= 4)
return _cebu_prev(root, kofs, CEB_KT_U32, key, 0, NULL);
else
return _cebu_prev(root, kofs, CEB_KT_U64, 0, key, NULL);
}
/* look up the specified node with its key and deletes it if found, and in any
* case, returns the node.
*/
CEB_FDECL3(struct ceb_node *, cebul, _delete, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
unsigned long key = NODEK(node, kofs)->ul;
if (sizeof(long) <= 4)
return _cebu_delete(root, node, kofs, CEB_KT_U32, key, 0, NULL);
else
return _cebu_delete(root, node, kofs, CEB_KT_U64, 0, key, NULL);
}
/* look up the specified key, and detaches it and returns it if found, or NULL
* if not found.
*/
CEB_FDECL3(struct ceb_node *, cebul, _pick, struct ceb_node **, root, ptrdiff_t, kofs, unsigned long, key)
{
if (sizeof(long) <= 4)
return _cebu_delete(root, NULL, kofs, CEB_KT_U32, key, 0, NULL);
else
return _cebu_delete(root, NULL, kofs, CEB_KT_U64, 0, key, NULL);
}
/* dumps a ceb_node tree using the default functions above. If a node matches
* <ctx>, this one will be highlighted in red.
*/
CEB_FDECL4(void, cebul, _default_dump, struct ceb_node **, root, ptrdiff_t, kofs, const char *, label, const void *, ctx)
{
printf("\ndigraph cebul_tree {\n"
" fontname=\"fixed\";\n"
" fontsize=8\n"
" label=\"%s\"\n"
"", label);
printf(" node [fontname=\"fixed\" fontsize=8 shape=\"box\" style=\"filled\" color=\"black\" fillcolor=\"white\"];\n"
" edge [fontname=\"fixed\" fontsize=8 style=\"solid\" color=\"magenta\" dir=\"forward\"];\n");
cebu_default_dump_tree(kofs, sizeof(long) <= 4 ? CEB_KT_U32 : CEB_KT_U64, root, 0, NULL, 0, ctx, NULL, NULL, NULL);
printf("}\n");
}

163
src/cebus_tree.c Normal file
View File

@ -0,0 +1,163 @@
/*
* Compact Elastic Binary Trees - exported functions operating on string keys
*
* Copyright (C) 2014-2024 Willy Tarreau - w@1wt.eu
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "cebtree-prv.h"
/*****************************************************************************\
* The declarations below always cause two functions to be declared, one *
* starting with "cebus_*" and one with "cebus_ofs_*" which takes a key *
* offset just after the root. The one without kofs just has this argument *
* omitted from its declaration and replaced with sizeof(struct ceb_node) in *
* the call to the underlying functions. *
\*****************************************************************************/
/* Inserts node <node> into unique tree <tree> based on its key that
* immediately follows the node. Returns the inserted node or the one
* that already contains the same key.
*/
CEB_FDECL3(struct ceb_node *, cebus, _insert, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
const void *key = NODEK(node, kofs)->str;
return _cebu_insert(root, node, kofs, CEB_KT_ST, 0, 0, key);
}
/* return the first node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebus, _first, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_first(root, kofs, CEB_KT_ST);
}
/* return the last node or NULL if not found. */
CEB_FDECL2(struct ceb_node *, cebus, _last, struct ceb_node **, root, ptrdiff_t, kofs)
{
return _cebu_last(root, kofs, CEB_KT_ST);
}
/* look up the specified key, and returns either the node containing it, or
* NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebus, _lookup, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup(root, kofs, CEB_KT_ST, 0, 0, key);
}
/* look up the specified key or the highest below it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebus, _lookup_le, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup_le(root, kofs, CEB_KT_ST, 0, 0, key);
}
/* look up highest key below the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebus, _lookup_lt, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup_lt(root, kofs, CEB_KT_ST, 0, 0, key);
}
/* look up the specified key or the smallest above it, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebus, _lookup_ge, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup_ge(root, kofs, CEB_KT_ST, 0, 0, key);
}
/* look up the smallest key above the specified one, and returns either the
* node containing it, or NULL if not found.
*/
CEB_FDECL3(struct ceb_node *, cebus, _lookup_gt, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_lookup_gt(root, kofs, CEB_KT_ST, 0, 0, key);
}
/* search for the next node after the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a left turn was made, and returning the first node along the right
* branch at that fork.
*/
CEB_FDECL3(struct ceb_node *, cebus, _next, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
const void *key = NODEK(node, kofs)->str;
return _cebu_next(root, kofs, CEB_KT_ST, 0, 0, key);
}
/* search for the prev node before the specified one, and return it, or NULL if
* not found. The approach consists in looking up that node, recalling the last
* time a right turn was made, and returning the last node along the left
* branch at that fork.
*/
CEB_FDECL3(struct ceb_node *, cebus, _prev, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
const void *key = NODEK(node, kofs)->str;
return _cebu_prev(root, kofs, CEB_KT_ST, 0, 0, key);
}
/* look up the specified node with its key and deletes it if found, and in any
* case, returns the node.
*/
CEB_FDECL3(struct ceb_node *, cebus, _delete, struct ceb_node **, root, ptrdiff_t, kofs, struct ceb_node *, node)
{
const void *key = NODEK(node, kofs)->str;
return _cebu_delete(root, node, kofs, CEB_KT_ST, 0, 0, key);
}
/* look up the specified key, and detaches it and returns it if found, or NULL
* if not found.
*/
CEB_FDECL3(struct ceb_node *, cebus, _pick, struct ceb_node **, root, ptrdiff_t, kofs, const void *, key)
{
return _cebu_delete(root, NULL, kofs, CEB_KT_ST, 0, 0, key);
}
/* dumps a ceb_node tree using the default functions above. If a node matches
* <ctx>, this one will be highlighted in red.
*/
CEB_FDECL4(void, cebus, _default_dump, struct ceb_node **, root, ptrdiff_t, kofs, const char *, label, const void *, ctx)
{
printf("\ndigraph cebus_tree {\n"
" fontname=\"fixed\";\n"
" fontsize=8\n"
" label=\"%s\"\n"
"", label);
printf(" node [fontname=\"fixed\" fontsize=8 shape=\"box\" style=\"filled\" color=\"black\" fillcolor=\"white\"];\n"
" edge [fontname=\"fixed\" fontsize=8 style=\"solid\" color=\"magenta\" dir=\"forward\"];\n");
cebu_default_dump_tree(kofs, CEB_KT_ST, root, 0, NULL, 0, ctx, NULL, NULL, NULL);
printf("}\n");
}