
where possible (no buffering); no more explicit vm checkranges in kernel; new allocator for vm using avl tree without needing remapping
18 lines
706 B
C
18 lines
706 B
C
|
|
#define AVL_UNIQUE(id) addr_ ## id
|
|
#define AVL_HANDLE pagerange_t *
|
|
#define AVL_KEY phys_bytes
|
|
#define AVL_MAX_DEPTH 30 /* good for 2 million nodes */
|
|
#define AVL_NULL NULL
|
|
#define AVL_GET_LESS(h, a) (h)->less
|
|
#define AVL_GET_GREATER(h, a) (h)->greater
|
|
#define AVL_SET_LESS(h1, h2) (h1)->less = h2;
|
|
#define AVL_SET_GREATER(h1, h2) (h1)->greater = h2;
|
|
#define AVL_GET_BALANCE_FACTOR(h) (h)->factor
|
|
#define AVL_SET_BALANCE_FACTOR(h, f) (h)->factor = f;
|
|
#define AVL_COMPARE_KEY_KEY(k1, k2) ((k1) > (k2) ? 1 : ((k1) < (k2) ? -1 : 0))
|
|
#define AVL_COMPARE_KEY_NODE(k, h) AVL_COMPARE_KEY_KEY((k), (h)->addr)
|
|
#define AVL_COMPARE_NODE_NODE(h1, h2) AVL_COMPARE_KEY_KEY((h1)->addr, (h2)->addr)
|
|
|
|
#include "cavl_if.h"
|