Aren/NetBSD
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Implement access methods:

Browse Source 
lists: LIST_FIRST(), LIST_NEXT()

simple queues: SIMPLEQ_FIRST(), SIMPLEQ_NEXT()

tail queues: TAILQ_FIRST(), TAILQ_NEXT()

circular queues: CIRCLEQ_FIRST(), CIRCLEQ_LAST(), CIRCLEQ_NEXT(),
CIRCLEQ_PREV()
This commit is contained in:
thorpej 1998-01-05 06:27:42 +00:00
parent 4a7fabf18c
commit 010625fefd
1 changed files with 33 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
sys/sys/queue.h
View File

@ -1,4 +1,4 @@
/* $NetBSD: queue.h,v 1.13 1997/02/08 04:47:41 mrg Exp $ */
/* $NetBSD: queue.h,v 1.14 1998/01/05 06:27:42 thorpej Exp $ */
/*
* Copyright (c) 1991, 1993
@ -127,6 +127,13 @@ struct { \
*(elm)->field.le_prev = (elm)->field.le_next; \
} while (0)
/*
* List access methods.
*/
#define LIST_FIRST(head) ((head)->lh_first)
#define LIST_NEXT(elm, field) ((elm)->field.le_next)
/*
* Simple queue definitions.
*/
@ -175,6 +182,13 @@ struct { \
(head)->sqh_last = &(head)->sqh_first; \
} while (0)
/*
* Simple queue access methods.
*/
#define SIMPLEQ_FIRST(head) ((head)->sqh_first)
#define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next)
/*
* Tail queue definitions.
*/
@ -244,6 +258,13 @@ struct { \
*(elm)->field.tqe_prev = (elm)->field.tqe_next; \
} while (0)
/*
* Tail queue access methods.
*/
#define TAILQ_FIRST(head) ((head)->tqh_first)
#define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
/*
* Circular queue definitions.
*/
@ -322,4 +343,15 @@ struct { \
(elm)->field.cqe_prev->field.cqe_next = \
(elm)->field.cqe_next; \
} while (0)
/*
* Circular queue access methods.
*/
#define CIRCLEQ_FIRST(head) ((head)->cqh_first)
#define CIRCLEQ_LAST(head) ((head)->cqh_last)
#define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next)
#define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev)
#endif /* !_SYS_QUEUE_H_ */