wash/mango
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

sandbox: btree: add macros to define custom btree inserter

Browse Source 
tree keys are no longer stored in btree_node_t. The tree user is responsible for
defining their own node type that includes btree_node_t, and a comparator for the nodes.
This commit is contained in:
max 🍓
2023-01-26 18:30:14 +00:00
parent c35f06e191
commit e2fbc4e40b
2 changed files with 125 additions and 54 deletions
Download Patch File Download Diff File Expand all files Collapse all files

115
sandbox/btree/include/socks/btree.h
View File

@@ -3,22 +3,127 @@
#include <stdint.h>
typedef uint64_t btree_key_t;
#define BTREE_CONTAINER(t, m, v) ((void *)((v) ? (uintptr_t)(v) - (offsetof(t, m)) : 0))
struct btree;
#define BTREE_DEFINE_SIMPLE_INSERT(node_type, container_node_member, container_key_member, function_name) \
static void function_name(btree_t *tree, node_type *node) \
{ \
if (!tree->b_root) { \
tree->b_root = &node->container_node_member; \
btree_insert_fixup(tree, &node->container_node_member); \
return; \
} \
\
btree_node_t *cur = tree->b_root; \
while (1) { \
node_type *cur_node = BTREE_CONTAINER(node_type, container_node_member, cur); \
btree_node_t *next = NULL; \
\
if (node->container_key_member > cur_node->container_key_member) { \
next = btree_right(cur); \
\
if (!next) { \
btree_put_right(cur, &node->container_node_member); \
break; \
} \
} else if (node->container_key_member < cur_node->container_key_member) { \
next = btree_left(cur); \
\
if (!next) { \
btree_put_left(cur, &node->container_node_member); \
break; \
} \
} else { \
return; \
} \
\
cur = next; \
} \
\
btree_insert_fixup(tree, &node->container_node_member); \
}
#define BTREE_DEFINE_INSERT(node_type, container_node_member, container_key_member, function_name, comparator) \
static void function_name(btree_t *tree, node_type *node) \
{ \
if (!tree->b_root) { \
tree->b_root = &node->container_node_member; \
btree_insert_fixup(tree, &node->container_node_member); \
return; \
} \
\
btree_node_t *cur = tree->b_root; \
while (1) { \
node_type *cur_node = BTREE_CONTAINER(node_type, container_node_member, cur); \
btree_node_t *next = NULL; \
int cmp = comparator(node, cur_node); \
\
if (cmp == 1) { \
next = btree_right(cur); \
\
if (!next) { \
btree_put_right(cur, &node->container_node_member); \
break; \
} \
} else if (cmp == -1) { \
next = btree_left(cur); \
\
if (!next) { \
btree_put_left(cur, &node->container_node_member); \
break; \
} \
} else { \
return; \
} \
\
cur = next; \
} \
\
btree_insert_fixup(tree, &node->container_node_member); \
}
typedef struct btree_node {
struct btree_node *b_parent, *b_left, *b_right;
unsigned short b_height;
btree_key_t b_key;
struct btree *b_owner;
} btree_node_t;
typedef struct btree {
struct btree_node *b_root;
} btree_t;
extern void btree_insert(btree_t *tree, btree_node_t *node);
extern void btree_insert_fixup(btree_t *tree, btree_node_t *node);
extern void btree_delete(btree_t *tree, btree_node_t *node);
static inline void btree_put_left(btree_node_t *parent, btree_node_t *child)
{
parent->b_left = child;
child->b_parent = parent;
}
static inline void btree_put_right(btree_node_t *parent, btree_node_t *child)
{
parent->b_right = child;
child->b_parent = parent;
}
static inline btree_node_t *btree_left(btree_node_t *node)
{
return node->b_left;
}
static inline btree_node_t *btree_right(btree_node_t *node)
{
return node->b_right;
}
static inline btree_node_t *btree_parent(btree_node_t *node)
{
return node->b_parent;
}
static inline unsigned short btree_height(btree_node_t *node)
{
return node->b_height;
}
#endif