f78d8e74fd
A new call to vm lets processes yield a part of their memory to vm, together with an id, getting newly allocated memory in return. vm is allowed to forget about it if it runs out of memory. processes can ask for it back using the same id. (These two operations are normally combined in a single call.) It can be used as a as-big-as-memory-will-allow block cache for filesystems, which is how mfs now uses it.
17 lines
800 B
C
17 lines
800 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) USE((h1), (h1)->less = h2;);
|
|
#define AVL_SET_GREATER(h1, h2) USE((h1), (h1)->greater = h2;);
|
|
#define AVL_GET_BALANCE_FACTOR(h) (h)->factor
|
|
#define AVL_SET_BALANCE_FACTOR(h, f) USE((h), (h)->factor = f;);
|
|
#define AVL_SET_ROOT(h, v) (h)->root = v;
|
|
#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)
|
|
#define AVL_INSIDE_STRUCT char pad[4];
|
|
|