Lines Matching refs:new
15 * a new id quick.
123 struct idr_layer *new;
124 new = kmem_cache_zalloc(idr_layer_cache, gfp_mask);
125 if (new == NULL)
127 move_to_free_list(idp, new);
136 struct idr_layer *p, *new;
187 new = get_from_free_list(idp);
188 if (!new)
190 new->layer = l-1;
191 rcu_assign_pointer(p->ary[m], new);
205 struct idr_layer *p, *new;
220 * Add a new layer to the top of the tree if the requested
233 if (!(new = get_from_free_list(idp))) {
239 for (new = p; p && p != idp->top; new = p) {
241 new->ary[0] = NULL;
242 new->bitmap = new->count = 0;
243 __move_to_free_list(idp, new);
248 new->ary[0] = p;
249 new->count = 1;
250 new->layer = layers-1;
252 __set_bit(0, &new->bitmap);
253 p = new;
284 * idr_get_new_above - allocate new idr entry above or equal to a start id
316 * idr_get_new - allocate new idr entry
759 * ida_get_new_above - allocate new ID above or equal to a start id
764 * Allocate new ID above or equal to @ida. It should be called with
795 /* if bitmap isn't there, create a new one */
847 * ida_get_new - allocate new ID
851 * Allocate new ID. It should be called with any required locks.