Lines Matching defs:head
99 #define SET_QUEUE_FOR_SIZE(head, q, i, len) do { \
101 q = &(head)->sizeq[i]; \
121 ALLOC_LAYOUT *head;
134 head = infop->addr;
135 memset(head, 0, sizeof(*head));
136 SH_TAILQ_INIT(&head->addrq);
138 SH_TAILQ_INIT(&head->sizeq[i]);
139 COMPQUIET(head->unused, 0);
144 elp = (ALLOC_ELEMENT *)((u_int8_t *)head + sizeof(ALLOC_LAYOUT));
148 SH_TAILQ_INSERT_HEAD(&head->addrq, elp, addrq, __alloc_element);
150 &head->sizeq[DB_SIZE_Q_COUNT - 1], elp, sizeq, __alloc_element);
204 ALLOC_LAYOUT *head;
249 head = infop->addr;
253 SET_QUEUE_FOR_SIZE(head, q, i, total_len);
256 ++head->pow2_size[i]; /* Note the size of the request. */
295 if (head->longest < st_search)
296 head->longest = st_search;
303 STAT((++head->failure));
306 STAT((++head->success));
320 &head->addrq, elp, frag, addrq, __alloc_element);
323 __env_size_insert(head, frag);
348 ALLOC_LAYOUT *head;
375 head = infop->addr;
376 STAT((++head->freed));
397 SH_TAILQ_PREV(&head->addrq, elp, addrq, __alloc_element)) != NULL &&
405 SH_TAILQ_REMOVE(&head->addrq, elp, addrq, __alloc_element);
406 SET_QUEUE_FOR_SIZE(head, q, i, elp_tmp->len);
420 SH_TAILQ_REMOVE(&head->addrq, elp_tmp, addrq, __alloc_element);
421 SET_QUEUE_FOR_SIZE(head, q, i, elp_tmp->len);
428 __env_size_insert(head, elp);
436 __env_size_insert(head, elp)
437 ALLOC_LAYOUT *head;
445 SET_QUEUE_FOR_SIZE(head, q, i, elp->len);
472 ALLOC_LAYOUT *head;
477 head = infop->addr;
484 (u_long)head->success, (u_long)head->failure, (u_long)head->freed,
485 (u_long)head->longest);
493 (1024 << i) / 1024, (u_long)head->pow2_size[i]);
502 SH_TAILQ_FOREACH(elp, &head->addrq, addrq, __alloc_element)
509 SH_TAILQ_FOREACH(elp, &head->sizeq[i], sizeq, __alloc_element)