Lines Matching defs:level
33 * 2. It lets us use the bottom 6 bits of the pointer to store the tree level
53 _util_sparse_array_node(void *data, unsigned level)
57 assert((level & NODE_PTR_MASK) == 0);
58 return (uintptr_t)data | level;
98 unsigned level)
101 if (level == 0) {
110 return _util_sparse_array_node(data, level);
154 /* In this case, we have a root but its level is low enough that the
196 uintptr_t node, unsigned level)
198 assert(_util_sparse_array_node_level(node) == level);
205 validate_node_level(arr, children[i], level - 1);