Lines Matching defs:new
89 * the partial slab counter. If taken then no new slabs may be added or
535 freelist_aba_t new = { .freelist = freelist_new, .counter = counters_new };
537 return try_cmpxchg_freelist(&slab->freelist_counter.full, &old.full, new.full);
1827 /* Move object to the new freelist */
2228 struct slab new;
2239 new.counters = counters;
2241 new.inuse = slab->objects;
2242 new.freelist = NULL;
2244 new.freelist = freelist;
2247 VM_BUG_ON(new.frozen);
2248 new.frozen = 1;
2252 new.freelist, new.counters,
2502 struct slab new;
2552 new.counters = old.counters;
2554 new.inuse -= free_delta;
2556 new.freelist = freelist;
2558 new.freelist = old.freelist;
2560 new.frozen = 0;
2562 if (!new.inuse && n->nr_partial >= s->min_partial) {
2564 } else if (new.freelist) {
2578 new.freelist, new.counters,
2607 struct slab new;
2628 new.counters = old.counters;
2629 new.freelist = old.freelist;
2631 new.frozen = 0;
2635 new.freelist, new.counters,
2638 if (unlikely(!new.inuse && n->nr_partial >= s->min_partial)) {
3036 freelist_aba_t new = { .freelist = freelist_new, .counter = next_tid(tid) };
3039 &old.full, new.full);
3052 struct slab new;
3062 new.counters = counters;
3063 VM_BUG_ON(!new.frozen);
3065 new.inuse = slab->objects;
3066 new.frozen = freelist != NULL;
3070 NULL, new.counters,
3080 * Processing is still very fast if new objects have been freed to the
3088 * And if we were unable to get a new slab from the partial slab lists then
3089 * we need to allocate a new slab. This is the slowest path since it involves
3090 * a call to the page allocator and the setup of a new slab.
3607 struct slab new;
3630 new.counters = counters;
3631 was_frozen = new.frozen;
3632 new.inuse -= cnt;
3633 if ((!new.inuse || !prior) && !was_frozen) {
3643 new.frozen = 1;
3663 head, new.counters,
3674 } else if (new.frozen) {
3686 if (unlikely(!new.inuse && n->nr_partial >= s->min_partial))
3881 /* Start new detached freelist */
4948 * initialized for the new node.
5346 * Not found. Insert new tracking element.