Lines Matching refs:head
41 * However, when the head becomes full we purposefully keep it around
58 LIST_DEL(&entry->head); /* remove from reclaim list */
59 LIST_ADD(&entry->head, &slab->free);
63 if (!slab->head.next) {
65 LIST_ADDTAIL(&slab->head, &group->slabs);
69 LIST_DEL(&slab->head);
79 LIST_ENTRY(struct pb_slab_entry, slabs->reclaim.next, head);
118 LIST_IS_EMPTY(&LIST_ENTRY(struct pb_slab, group->slabs.next, head)->free))
123 slab = LIST_ENTRY(struct pb_slab, group->slabs.next, head);
127 LIST_DEL(&slab->head);
144 LIST_ADD(&slab->head, &group->slabs);
147 entry = LIST_ENTRY(struct pb_slab_entry, slab->free.next, head);
148 LIST_DEL(&entry->head);
166 LIST_ADDTAIL(&entry->head, &slabs->reclaim);
246 LIST_ENTRY(struct pb_slab_entry, slabs->reclaim.next, head);
