Lines Matching defs:layer
57 struct idr_layer *layer;
59 layer = container_of(head, struct idr_layer, rcu_head);
60 kmem_cache_free(idr_layer_cache, layer);
95 * If this layer is full mark the bit in the layer above to
97 * complete the layer above and require walking up the radix
153 /* no space available go back to previous layer. */
158 /* if already at the top layer, we need to grow */
166 /* If we need to go up one layer, continue the
184 * Create the layer below if it is missing.
190 new->layer = l-1;
216 p->layer = 0;
220 * Add a new layer to the top of the tree if the requested
230 p->layer++;
250 new->layer = layers-1;
513 n = (p->layer+1) * IDR_BITS;
524 BUG_ON(n != p->layer*IDR_BITS);
653 n = (p->layer+1) * IDR_BITS;