head              145 libdb/mpool.c  	struct _hqh *head;
head              165 libdb/mpool.c  	head = &mp->hqh[HASHKEY(bp->pgno)];
head              166 libdb/mpool.c  	CIRCLEQ_INSERT_HEAD(head, bp, hq);
head              185 libdb/mpool.c  	struct _hqh *head;
head              213 libdb/mpool.c  		head = &mp->hqh[HASHKEY(bp->pgno)];
head              214 libdb/mpool.c  		CIRCLEQ_REMOVE(head, bp, hq);
head              215 libdb/mpool.c  		CIRCLEQ_INSERT_HEAD(head, bp, hq);
head              257 libdb/mpool.c  	head = &mp->hqh[HASHKEY(bp->pgno)];
head              258 libdb/mpool.c  	CIRCLEQ_INSERT_HEAD(head, bp, hq);
head              356 libdb/mpool.c  	struct _hqh *head;
head              380 libdb/mpool.c  			head = &mp->hqh[HASHKEY(bp->pgno)];
head              381 libdb/mpool.c  			CIRCLEQ_REMOVE(head, bp, hq);
head              455 libdb/mpool.c  	struct _hqh *head;
head              458 libdb/mpool.c  	head = &mp->hqh[HASHKEY(pgno)];
head              459 libdb/mpool.c  	for (bp = head->cqh_first; bp != (void *)head; bp = bp->hq.cqe_next)
head              118 libdb/queue.h  #define SLIST_HEAD_INITIALIZER(head)					\
head              131 libdb/queue.h  #define	SLIST_EMPTY(head)	((head)->slh_first == NULL)
head              133 libdb/queue.h  #define	SLIST_FIRST(head)	((head)->slh_first)
head              135 libdb/queue.h  #define SLIST_FOREACH(var, head, field)					\
head              136 libdb/queue.h  	for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)
head              138 libdb/queue.h  #define SLIST_INIT(head) {						\
head              139 libdb/queue.h  	(head)->slh_first = NULL;					\
head              147 libdb/queue.h  #define SLIST_INSERT_HEAD(head, elm, field) do {			\
head              148 libdb/queue.h  	(elm)->field.sle_next = (head)->slh_first;			\
head              149 libdb/queue.h  	(head)->slh_first = (elm);					\
head              154 libdb/queue.h  #define SLIST_REMOVE_HEAD(head, field) do {				\
head              155 libdb/queue.h  	(head)->slh_first = (head)->slh_first->field.sle_next;		\
head              158 libdb/queue.h  #define SLIST_REMOVE(head, elm, type, field) do {			\
head              159 libdb/queue.h  	if ((head)->slh_first == (elm)) {				\
head              160 libdb/queue.h  		SLIST_REMOVE_HEAD((head), field);			\
head              163 libdb/queue.h  		struct type *curelm = (head)->slh_first;		\
head              182 libdb/queue.h  #define STAILQ_HEAD_INITIALIZER(head)					\
head              183 libdb/queue.h  	{ NULL, &(head).stqh_first }
head              195 libdb/queue.h  #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL)
head              197 libdb/queue.h  #define	STAILQ_INIT(head) do {						\
head              198 libdb/queue.h  	(head)->stqh_first = NULL;					\
head              199 libdb/queue.h  	(head)->stqh_last = &(head)->stqh_first;			\
head              202 libdb/queue.h  #define STAILQ_FIRST(head)	((head)->stqh_first)
head              204 libdb/queue.h  #define	STAILQ_LAST(head, type, field)					\
head              205 libdb/queue.h  	(STAILQ_EMPTY(head) ?						\
head              208 libdb/queue.h  		((char *)((head)->stqh_last) - __offsetof(struct type, field))))
head              210 libdb/queue.h  #define STAILQ_FOREACH(var, head, field)				\
head              211 libdb/queue.h  	for((var) = (head)->stqh_first; (var); (var) = (var)->field.stqe_next)
head              213 libdb/queue.h  #define STAILQ_INSERT_HEAD(head, elm, field) do {			\
head              214 libdb/queue.h  	if (((elm)->field.stqe_next = (head)->stqh_first) == NULL)	\
head              215 libdb/queue.h  		(head)->stqh_last = &(elm)->field.stqe_next;		\
head              216 libdb/queue.h  	(head)->stqh_first = (elm);					\
head              219 libdb/queue.h  #define STAILQ_INSERT_TAIL(head, elm, field) do {			\
head              221 libdb/queue.h  	*(head)->stqh_last = (elm);					\
head              222 libdb/queue.h  	(head)->stqh_last = &(elm)->field.stqe_next;			\
head              225 libdb/queue.h  #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {		\
head              227 libdb/queue.h  		(head)->stqh_last = &(elm)->field.stqe_next;		\
head              233 libdb/queue.h  #define STAILQ_REMOVE_HEAD(head, field) do {				\
head              234 libdb/queue.h  	if (((head)->stqh_first =					\
head              235 libdb/queue.h  	     (head)->stqh_first->field.stqe_next) == NULL)		\
head              236 libdb/queue.h  		(head)->stqh_last = &(head)->stqh_first;		\
head              239 libdb/queue.h  #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do {			\
head              240 libdb/queue.h  	if (((head)->stqh_first = (elm)->field.stqe_next) == NULL)	\
head              241 libdb/queue.h  		(head)->stqh_last = &(head)->stqh_first;		\
head              244 libdb/queue.h  #define STAILQ_REMOVE(head, elm, type, field) do {			\
head              245 libdb/queue.h  	if ((head)->stqh_first == (elm)) {				\
head              246 libdb/queue.h  		STAILQ_REMOVE_HEAD(head, field);			\
head              249 libdb/queue.h  		struct type *curelm = (head)->stqh_first;		\
head              254 libdb/queue.h  			(head)->stqh_last = &(curelm)->field.stqe_next;	\
head              268 libdb/queue.h  #define LIST_HEAD_INITIALIZER(head)					\
head              282 libdb/queue.h  #define	LIST_EMPTY(head) ((head)->lh_first == NULL)
head              284 libdb/queue.h  #define LIST_FIRST(head)	((head)->lh_first)
head              286 libdb/queue.h  #define LIST_FOREACH(var, head, field)					\
head              287 libdb/queue.h  	for((var) = (head)->lh_first; (var); (var) = (var)->field.le_next)
head              289 libdb/queue.h  #define	LIST_INIT(head) do {						\
head              290 libdb/queue.h  	(head)->lh_first = NULL;					\
head              308 libdb/queue.h  #define LIST_INSERT_HEAD(head, elm, field) do {				\
head              309 libdb/queue.h  	if (((elm)->field.le_next = (head)->lh_first) != NULL)		\
head              310 libdb/queue.h  		(head)->lh_first->field.le_prev = &(elm)->field.le_next;\
head              311 libdb/queue.h  	(head)->lh_first = (elm);					\
head              312 libdb/queue.h  	(elm)->field.le_prev = &(head)->lh_first;			\
head              335 libdb/queue.h  #define TAILQ_HEAD_INITIALIZER(head)					\
head              336 libdb/queue.h  	{ NULL, &(head).tqh_first }
head              349 libdb/queue.h  #define	TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
head              351 libdb/queue.h  #define TAILQ_FOREACH(var, head, field)					\
head              352 libdb/queue.h  	for (var = TAILQ_FIRST(head); var; var = TAILQ_NEXT(var, field))
head              354 libdb/queue.h  #define TAILQ_FOREACH_REVERSE(var, head, headname, field)		\
head              355 libdb/queue.h  	for ((var) = TAILQ_LAST((head), headname);			\
head              359 libdb/queue.h  #define	TAILQ_FIRST(head) ((head)->tqh_first)
head              361 libdb/queue.h  #define	TAILQ_LAST(head, headname) \
head              362 libdb/queue.h  	(*(((struct headname *)((head)->tqh_last))->tqh_last))
head              369 libdb/queue.h  #define	TAILQ_INIT(head) do {						\
head              370 libdb/queue.h  	(head)->tqh_first = NULL;					\
head              371 libdb/queue.h  	(head)->tqh_last = &(head)->tqh_first;				\
head              374 libdb/queue.h  #define TAILQ_INSERT_HEAD(head, elm, field) do {			\
head              375 libdb/queue.h  	if (((elm)->field.tqe_next = (head)->tqh_first) != NULL)	\
head              376 libdb/queue.h  		(head)->tqh_first->field.tqe_prev =			\
head              379 libdb/queue.h  		(head)->tqh_last = &(elm)->field.tqe_next;		\
head              380 libdb/queue.h  	(head)->tqh_first = (elm);					\
head              381 libdb/queue.h  	(elm)->field.tqe_prev = &(head)->tqh_first;			\
head              384 libdb/queue.h  #define TAILQ_INSERT_TAIL(head, elm, field) do {			\
head              386 libdb/queue.h  	(elm)->field.tqe_prev = (head)->tqh_last;			\
head              387 libdb/queue.h  	*(head)->tqh_last = (elm);					\
head              388 libdb/queue.h  	(head)->tqh_last = &(elm)->field.tqe_next;			\
head              391 libdb/queue.h  #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
head              396 libdb/queue.h  		(head)->tqh_last = &(elm)->field.tqe_next;		\
head              408 libdb/queue.h  #define TAILQ_REMOVE(head, elm, field) do {				\
head              413 libdb/queue.h  		(head)->tqh_last = (elm)->field.tqe_prev;		\
head              439 libdb/queue.h  #define CIRCLEQ_EMPTY(head) ((head)->cqh_first == (void *)(head))
head              441 libdb/queue.h  #define CIRCLEQ_FIRST(head) ((head)->cqh_first)
head              443 libdb/queue.h  #define CIRCLEQ_FOREACH(var, head, field)				\
head              444 libdb/queue.h  	for((var) = (head)->cqh_first;					\
head              445 libdb/queue.h  	    (var) != (void *)(head);					\
head              448 libdb/queue.h  #define CIRCLEQ_FOREACH_REVERSE(var, head, field)			\
head              449 libdb/queue.h  	for((var) = (head)->cqh_last;					\
head              450 libdb/queue.h  	    (var) != (void *)(head);					\
head              453 libdb/queue.h  #define	CIRCLEQ_INIT(head) do {						\
head              454 libdb/queue.h  	(head)->cqh_first = (void *)(head);				\
head              455 libdb/queue.h  	(head)->cqh_last = (void *)(head);				\
head              458 libdb/queue.h  #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\
head              461 libdb/queue.h  	if ((listelm)->field.cqe_next == (void *)(head))		\
head              462 libdb/queue.h  		(head)->cqh_last = (elm);				\
head              468 libdb/queue.h  #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\
head              471 libdb/queue.h  	if ((listelm)->field.cqe_prev == (void *)(head))		\
head              472 libdb/queue.h  		(head)->cqh_first = (elm);				\
head              478 libdb/queue.h  #define CIRCLEQ_INSERT_HEAD(head, elm, field) do {			\
head              479 libdb/queue.h  	(elm)->field.cqe_next = (head)->cqh_first;			\
head              480 libdb/queue.h  	(elm)->field.cqe_prev = (void *)(head);				\
head              481 libdb/queue.h  	if ((head)->cqh_last == (void *)(head))				\
head              482 libdb/queue.h  		(head)->cqh_last = (elm);				\
head              484 libdb/queue.h  		(head)->cqh_first->field.cqe_prev = (elm);		\
head              485 libdb/queue.h  	(head)->cqh_first = (elm);					\
head              488 libdb/queue.h  #define CIRCLEQ_INSERT_TAIL(head, elm, field) do {			\
head              489 libdb/queue.h  	(elm)->field.cqe_next = (void *)(head);				\
head              490 libdb/queue.h  	(elm)->field.cqe_prev = (head)->cqh_last;			\
head              491 libdb/queue.h  	if ((head)->cqh_first == (void *)(head))			\
head              492 libdb/queue.h  		(head)->cqh_first = (elm);				\
head              494 libdb/queue.h  		(head)->cqh_last->field.cqe_next = (elm);		\
head              495 libdb/queue.h  	(head)->cqh_last = (elm);					\
head              498 libdb/queue.h  #define CIRCLEQ_LAST(head) ((head)->cqh_last)
head              504 libdb/queue.h  #define	CIRCLEQ_REMOVE(head, elm, field) do {				\
head              505 libdb/queue.h  	if ((elm)->field.cqe_next == (void *)(head))			\
head              506 libdb/queue.h  		(head)->cqh_last = (elm)->field.cqe_prev;		\
head              510 libdb/queue.h  	if ((elm)->field.cqe_prev == (void *)(head))			\
head              511 libdb/queue.h  		(head)->cqh_first = (elm)->field.cqe_next;		\
head              536 libdb/queue.h  	struct quehead *element = a, *head = b;
head              538 libdb/queue.h  	element->qh_link = head->qh_link;
head              539 libdb/queue.h  	element->qh_rlink = head;
head              540 libdb/queue.h  	head->qh_link = element;
head               66 libltdl/libltdl/slist.h LT_SCOPE SList *slist_concat	(SList *head, SList *tail);
head              119 libltdl/lt_dlloader.c       const lt_dlvtable *head = (const lt_dlvtable *) loaders->userdata;
head              120 libltdl/lt_dlloader.c       fprintf (stderr, "%s", (head && head->name) ? head->name : "(null)");
head               54 libltdl/slist.c slist_delete (SList *head, void (*delete_fct) (void *item))
head               58 libltdl/slist.c   while (head)
head               60 libltdl/slist.c       SList *next = head->next;
head               61 libltdl/slist.c       (*delete_fct) (head);
head               62 libltdl/slist.c       head = next;
head               98 libltdl/slist.c       SList *head;
head               99 libltdl/slist.c       for (head = *phead; head->next; head = head->next)
head              101 libltdl/slist.c 	  result = (*find) (head->next, matchdata);
head              104 libltdl/slist.c 	      stale		= head->next;
head              105 libltdl/slist.c 	      head->next	= stale->next;
head              142 libltdl/slist.c slist_concat (SList *head, SList *tail)
head              146 libltdl/slist.c   if (!head)
head              151 libltdl/slist.c   last = head;
head              157 libltdl/slist.c   return head;
head              113 libutil/strhash.c 	struct sh_head *head = &sh->htab[__hash_string(name) % sh->buckets];
head              119 libutil/strhash.c 	SLIST_FOREACH(entry, head, ptr)
head              129 libutil/strhash.c 		SLIST_INSERT_HEAD(head, entry, ptr);