1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

TAILQ_HEAD(tailhead, entry) head = TAILQ_HEAD_INITIALIZER(head);
struct tailhead *headp;		     /*	Tail queue head. */
struct entry {
    ...
    TAILQ_ENTRY(entry)	entries;     /*	Tail queue. */
    ...
} *n1, *n2, *n3, *np;

TAILQ_INIT(&head);			     /*	Initialize the queue. */

n1	= malloc(sizeof(struct entry));	     /*	Insert at the head. */
TAILQ_INSERT_HEAD(&head, n1, entries);

n1	= malloc(sizeof(struct entry));	     /*	Insert at the tail. */
TAILQ_INSERT_TAIL(&head, n1, entries);

n2	= malloc(sizeof(struct entry));	     /*	Insert after. */
TAILQ_INSERT_AFTER(&head, n1, n2, entries);

n3	= malloc(sizeof(struct entry));	     /*	Insert before. */
TAILQ_INSERT_BEFORE(n2, n3, entries);

TAILQ_REMOVE(&head, n2, entries);	     /*	Deletion. */
free(n2);
                    /*	Forward	traversal. */
TAILQ_FOREACH(np, &head, entries)
    np-> ...

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13

struct message {
    int idx;
    TAILQ_ENTRY(message) entries;
};

TAILQ_HEAD(msg_head, message) head; // struct msg_head head 와 같다.

#define	TAILQ_ENTRY(type)						\
struct {								\
	struct type *tqe_next;	/* next element */			\
	struct type **tqe_prev;	/* address of previous next element */	\
	TRACEBUF							\
}

1
2
3
4
5
6

#define	TAILQ_CLASS_HEAD(name, type)					\
struct name {								\
	class type *tqh_first;	/* first element */			\
	class type **tqh_last;	/* addr of last next element */		\
	TRACEBUF							\
}