head 132 libdb/mpool.c struct _hqh *head; head 152 libdb/mpool.c head = &mp->hqh[HASHKEY(bp->pgno)]; head 153 libdb/mpool.c CIRCLEQ_INSERT_HEAD(head, bp, hq); head 168 libdb/mpool.c struct _hqh *head; head 196 libdb/mpool.c head = &mp->hqh[HASHKEY(bp->pgno)]; head 197 libdb/mpool.c CIRCLEQ_REMOVE(head, bp, hq); head 198 libdb/mpool.c CIRCLEQ_INSERT_HEAD(head, bp, hq); head 232 libdb/mpool.c head = &mp->hqh[HASHKEY(bp->pgno)]; head 233 libdb/mpool.c CIRCLEQ_INSERT_HEAD(head, bp, hq); head 321 libdb/mpool.c struct _hqh *head; head 345 libdb/mpool.c head = &mp->hqh[HASHKEY(bp->pgno)]; head 346 libdb/mpool.c CIRCLEQ_REMOVE(head, bp, hq); head 409 libdb/mpool.c struct _hqh *head; head 412 libdb/mpool.c head = &mp->hqh[HASHKEY(pgno)]; head 413 libdb/mpool.c for (bp = head->cqh_first; bp != (void *)head; bp = bp->hq.cqe_next) head 116 libdb/queue.h #define SLIST_HEAD_INITIALIZER(head) \ head 127 libdb/queue.h #define SLIST_EMPTY(head) ((head)->slh_first == NULL) head 129 libdb/queue.h #define SLIST_FIRST(head) ((head)->slh_first) head 131 libdb/queue.h #define SLIST_FOREACH(var, head, field) \ head 132 libdb/queue.h for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next) head 134 libdb/queue.h #define SLIST_INIT(head) { \ head 135 libdb/queue.h (head)->slh_first = NULL; \ head 143 libdb/queue.h #define SLIST_INSERT_HEAD(head, elm, field) do { \ head 144 libdb/queue.h (elm)->field.sle_next = (head)->slh_first; \ head 145 libdb/queue.h (head)->slh_first = (elm); \ head 150 libdb/queue.h #define SLIST_REMOVE_HEAD(head, field) do { \ head 151 libdb/queue.h (head)->slh_first = (head)->slh_first->field.sle_next; \ head 154 libdb/queue.h #define SLIST_REMOVE(head, elm, type, field) do { \ head 155 libdb/queue.h if ((head)->slh_first == (elm)) { \ head 156 libdb/queue.h SLIST_REMOVE_HEAD((head), field); \ head 159 libdb/queue.h struct type *curelm = (head)->slh_first; \ head 176 libdb/queue.h #define STAILQ_HEAD_INITIALIZER(head) \ head 177 libdb/queue.h { NULL, &(head).stqh_first } head 187 libdb/queue.h #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) head 189 libdb/queue.h #define STAILQ_INIT(head) do { \ head 190 libdb/queue.h (head)->stqh_first = NULL; \ head 191 libdb/queue.h (head)->stqh_last = &(head)->stqh_first; \ head 194 libdb/queue.h #define STAILQ_FIRST(head) ((head)->stqh_first) head 196 libdb/queue.h #define STAILQ_LAST(head, type, field) \ head 197 libdb/queue.h (STAILQ_EMPTY(head) ? \ head 200 libdb/queue.h ((char *)((head)->stqh_last) - __offsetof(struct type, field)))) head 202 libdb/queue.h #define STAILQ_FOREACH(var, head, field) \ head 203 libdb/queue.h for((var) = (head)->stqh_first; (var); (var) = (var)->field.stqe_next) head 205 libdb/queue.h #define STAILQ_INSERT_HEAD(head, elm, field) do { \ head 206 libdb/queue.h if (((elm)->field.stqe_next = (head)->stqh_first) == NULL) \ head 207 libdb/queue.h (head)->stqh_last = &(elm)->field.stqe_next; \ head 208 libdb/queue.h (head)->stqh_first = (elm); \ head 211 libdb/queue.h #define STAILQ_INSERT_TAIL(head, elm, field) do { \ head 213 libdb/queue.h *(head)->stqh_last = (elm); \ head 214 libdb/queue.h (head)->stqh_last = &(elm)->field.stqe_next; \ head 217 libdb/queue.h #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ head 219 libdb/queue.h (head)->stqh_last = &(elm)->field.stqe_next; \ head 225 libdb/queue.h #define STAILQ_REMOVE_HEAD(head, field) do { \ head 226 libdb/queue.h if (((head)->stqh_first = \ head 227 libdb/queue.h (head)->stqh_first->field.stqe_next) == NULL) \ head 228 libdb/queue.h (head)->stqh_last = &(head)->stqh_first; \ head 231 libdb/queue.h #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \ head 232 libdb/queue.h if (((head)->stqh_first = (elm)->field.stqe_next) == NULL) \ head 233 libdb/queue.h (head)->stqh_last = &(head)->stqh_first; \ head 236 libdb/queue.h #define STAILQ_REMOVE(head, elm, type, field) do { \ head 237 libdb/queue.h if ((head)->stqh_first == (elm)) { \ head 238 libdb/queue.h STAILQ_REMOVE_HEAD(head, field); \ head 241 libdb/queue.h struct type *curelm = (head)->stqh_first; \ head 246 libdb/queue.h (head)->stqh_last = &(curelm)->field.stqe_next; \ head 258 libdb/queue.h #define LIST_HEAD_INITIALIZER(head) \ head 271 libdb/queue.h #define LIST_EMPTY(head) ((head)->lh_first == NULL) head 273 libdb/queue.h #define LIST_FIRST(head) ((head)->lh_first) head 275 libdb/queue.h #define LIST_FOREACH(var, head, field) \ head 276 libdb/queue.h for((var) = (head)->lh_first; (var); (var) = (var)->field.le_next) head 278 libdb/queue.h #define LIST_INIT(head) do { \ head 279 libdb/queue.h (head)->lh_first = NULL; \ head 297 libdb/queue.h #define LIST_INSERT_HEAD(head, elm, field) do { \ head 298 libdb/queue.h if (((elm)->field.le_next = (head)->lh_first) != NULL) \ head 299 libdb/queue.h (head)->lh_first->field.le_prev = &(elm)->field.le_next;\ head 300 libdb/queue.h (head)->lh_first = (elm); \ head 301 libdb/queue.h (elm)->field.le_prev = &(head)->lh_first; \ head 322 libdb/queue.h #define TAILQ_HEAD_INITIALIZER(head) \ head 323 libdb/queue.h { NULL, &(head).tqh_first } head 334 libdb/queue.h #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) head 336 libdb/queue.h #define TAILQ_FOREACH(var, head, field) \ head 337 libdb/queue.h for (var = TAILQ_FIRST(head); var; var = TAILQ_NEXT(var, field)) head 339 libdb/queue.h #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ head 340 libdb/queue.h for ((var) = TAILQ_LAST((head), headname); \ head 344 libdb/queue.h #define TAILQ_FIRST(head) ((head)->tqh_first) head 346 libdb/queue.h #define TAILQ_LAST(head, headname) \ head 347 libdb/queue.h (*(((struct headname *)((head)->tqh_last))->tqh_last)) head 354 libdb/queue.h #define TAILQ_INIT(head) do { \ head 355 libdb/queue.h (head)->tqh_first = NULL; \ head 356 libdb/queue.h (head)->tqh_last = &(head)->tqh_first; \ head 359 libdb/queue.h #define TAILQ_INSERT_HEAD(head, elm, field) do { \ head 360 libdb/queue.h if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \ head 361 libdb/queue.h (head)->tqh_first->field.tqe_prev = \ head 364 libdb/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \ head 365 libdb/queue.h (head)->tqh_first = (elm); \ head 366 libdb/queue.h (elm)->field.tqe_prev = &(head)->tqh_first; \ head 369 libdb/queue.h #define TAILQ_INSERT_TAIL(head, elm, field) do { \ head 371 libdb/queue.h (elm)->field.tqe_prev = (head)->tqh_last; \ head 372 libdb/queue.h *(head)->tqh_last = (elm); \ head 373 libdb/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \ head 376 libdb/queue.h #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ head 381 libdb/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \ head 393 libdb/queue.h #define TAILQ_REMOVE(head, elm, field) do { \ head 398 libdb/queue.h (head)->tqh_last = (elm)->field.tqe_prev; \ head 420 libdb/queue.h #define CIRCLEQ_EMPTY(head) ((head)->cqh_first == (void *)(head)) head 422 libdb/queue.h #define CIRCLEQ_FIRST(head) ((head)->cqh_first) head 424 libdb/queue.h #define CIRCLEQ_FOREACH(var, head, field) \ head 425 libdb/queue.h for((var) = (head)->cqh_first; \ head 426 libdb/queue.h (var) != (void *)(head); \ head 429 libdb/queue.h #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ head 430 libdb/queue.h for((var) = (head)->cqh_last; \ head 431 libdb/queue.h (var) != (void *)(head); \ head 434 libdb/queue.h #define CIRCLEQ_INIT(head) do { \ head 435 libdb/queue.h (head)->cqh_first = (void *)(head); \ head 436 libdb/queue.h (head)->cqh_last = (void *)(head); \ head 439 libdb/queue.h #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ head 442 libdb/queue.h if ((listelm)->field.cqe_next == (void *)(head)) \ head 443 libdb/queue.h (head)->cqh_last = (elm); \ head 449 libdb/queue.h #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ head 452 libdb/queue.h if ((listelm)->field.cqe_prev == (void *)(head)) \ head 453 libdb/queue.h (head)->cqh_first = (elm); \ head 459 libdb/queue.h #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ head 460 libdb/queue.h (elm)->field.cqe_next = (head)->cqh_first; \ head 461 libdb/queue.h (elm)->field.cqe_prev = (void *)(head); \ head 462 libdb/queue.h if ((head)->cqh_last == (void *)(head)) \ head 463 libdb/queue.h (head)->cqh_last = (elm); \ head 465 libdb/queue.h (head)->cqh_first->field.cqe_prev = (elm); \ head 466 libdb/queue.h (head)->cqh_first = (elm); \ head 469 libdb/queue.h #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ head 470 libdb/queue.h (elm)->field.cqe_next = (void *)(head); \ head 471 libdb/queue.h (elm)->field.cqe_prev = (head)->cqh_last; \ head 472 libdb/queue.h if ((head)->cqh_first == (void *)(head)) \ head 473 libdb/queue.h (head)->cqh_first = (elm); \ head 475 libdb/queue.h (head)->cqh_last->field.cqe_next = (elm); \ head 476 libdb/queue.h (head)->cqh_last = (elm); \ head 479 libdb/queue.h #define CIRCLEQ_LAST(head) ((head)->cqh_last) head 485 libdb/queue.h #define CIRCLEQ_REMOVE(head, elm, field) do { \ head 486 libdb/queue.h if ((elm)->field.cqe_next == (void *)(head)) \ head 487 libdb/queue.h (head)->cqh_last = (elm)->field.cqe_prev; \ head 491 libdb/queue.h if ((elm)->field.cqe_prev == (void *)(head)) \ head 492 libdb/queue.h (head)->cqh_first = (elm)->field.cqe_next; \ head 515 libdb/queue.h struct quehead *element = a, *head = b; head 517 libdb/queue.h element->qh_link = head->qh_link; head 518 libdb/queue.h element->qh_rlink = head; head 519 libdb/queue.h head->qh_link = element; head 112 libutil/strhash.c struct sh_head *head = &sh->htab[__hash_string(name) % sh->buckets]; head 118 libutil/strhash.c SLIST_FOREACH(entry, head, ptr) head 128 libutil/strhash.c SLIST_INSERT_HEAD(head, entry, ptr);