Lines Matching defs:head
1724 struct slab *slab, void *head, void *tail, int *bulk_cnt,
1804 void **head, void **tail,
1809 void *next = *head;
1810 void *old_tail = *tail ? *tail : *head;
1818 *head = NULL;
1828 set_freepointer(s, object, *head);
1829 *head = object;
1841 if (*head == *tail)
1844 return *head != NULL;
2535 * freelist to the head of slab's freelist.
2908 struct slab *slab, void *head, void *tail, int *bulk_cnt,
2912 void *object = head;
3533 void *head, void *tail, int bulk_cnt,
3547 if (free_debug_processing(s, slab, head, tail, &cnt, addr, handle)) {
3553 slab->freelist = head;
3601 void *head, void *tail, int cnt,
3614 if (kfence_free(head))
3618 free_to_partial_list(s, slab, head, tail, cnt, addr);
3663 head, new.counters,
3731 * same slab) possible by specifying head and tail ptr, plus objects
3735 struct slab *slab, void *head, void *tail,
3738 void *tail_obj = tail ? : head;
3757 __slab_free(s, slab, head, tail_obj, cnt, addr);
3766 if (unlikely(!__update_cpu_freelist_fast(s, freelist, head, tid))) {
3782 c->freelist = head;
3791 struct slab *slab, void *head, void *tail,
3794 void *tail_obj = tail ? : head;
3796 __slab_free(s, slab, head, tail_obj, cnt, addr);
3801 void *head, void *tail, void **p, int cnt,
3809 if (slab_free_freelist_hook(s, &head, &tail, &cnt))
3810 do_slab_free(s, slab, head, tail, cnt, addr);
4792 * up most to the head of the partial lists. New allocations will then
4842 * Promote the slabs filled up most to the head of the