The Linux Manuals (man pages) document is an important part of Linux documents. Linux Manuals are organized as several sections. Each section has a group of commands for a specific area in Linux usage, administration or development.
CK_COHORT_INIT – initialize instance of a cohort type Library Concurrency Kit (libck, -lck) Synopsis In ck_cohort.h Fn CK_COHORT_INIT COHORT_NAME cohort_name COHORT *cohort void *global_lock void *local_lock unsigned int pass_limit Description Until a cohort instance is initialized using the CK_COHORT_INIT macro, any operations involving it will have undefined behavior. After this macro has been called, the…
CK_ARRAY_FOREACH – iterate through an array Library Concurrency Kit (libck, -lck) Synopsis In ck_array.h Ft bool Fn CK_ARRAY_FOREACH ck_array_t *array ck_array_iterator_t *iterator void **b Description The Fn CK_ARRAY_FOREACH 3 macro iterates through the array pointed to by Fa array . A pointer to an iterator object must be specified by Fa iterator and Fa b…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis #include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD…