Lines Matching refs:n
27 struct genradix_node *n, *new_node = NULL; in __genradix_ptr_alloc() local
37 n = genradix_root_to_node(r); in __genradix_ptr_alloc()
40 if (n && ilog2(offset) < genradix_depth_shift(level)) in __genradix_ptr_alloc()
49 new_node->children[0] = n; in __genradix_ptr_alloc()
51 ((unsigned long) new_node | (n ? level + 1 : 0))); in __genradix_ptr_alloc()
63 &n->children[offset >> genradix_depth_shift(level)]; in __genradix_ptr_alloc()
66 n = READ_ONCE(*p); in __genradix_ptr_alloc()
67 if (!n) { in __genradix_ptr_alloc()
74 if (!(n = cmpxchg_release(p, NULL, new_node))) in __genradix_ptr_alloc()
75 swap(n, new_node); in __genradix_ptr_alloc()
82 return &n->data[offset]; in __genradix_ptr_alloc()
91 struct genradix_node *n; in __genradix_iter_peek() local
102 n = genradix_root_to_node(r); in __genradix_iter_peek()
114 while (!n->children[i]) { in __genradix_iter_peek()
132 n = n->children[i]; in __genradix_iter_peek()
135 return &n->data[iter->offset & (GENRADIX_NODE_SIZE - 1)]; in __genradix_iter_peek()
145 struct genradix_node *n; in __genradix_iter_peek_prev() local
156 n = genradix_root_to_node(r); in __genradix_iter_peek_prev()
173 while (!n->children[i]) { in __genradix_iter_peek_prev()
190 n = n->children[i]; in __genradix_iter_peek_prev()
193 return &n->data[iter->offset & (GENRADIX_NODE_SIZE - 1)]; in __genradix_iter_peek_prev()
197 static void genradix_free_recurse(struct genradix_node *n, unsigned level) in genradix_free_recurse() argument
203 if (n->children[i]) in genradix_free_recurse()
204 genradix_free_recurse(n->children[i], level - 1); in genradix_free_recurse()
207 genradix_free_node(n); in genradix_free_recurse()