| /onnv/onnv-gate/usr/src/uts/common/io/drm/ |
| drm_linux_list.h | 46 #define INIT_LIST_HEAD(head) { \
47 (head)->next = head; \
48 (head)->prev = head; \
51 #define list_add_tail(entry, head) { \
52 (entry)->prev = (head)->prev; \
53 (entry)->next = head; \
54 (head)->prev->next = entry; \
55 (head)->prev = entry;
[all...] |
| queue.h | 46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
54 * head of the list and the other to the tail of the list. The elements are
57 * to the list after an existing element, at the head of the list, or at the
58 * end of the list. Elements being removed from the head of the tail queue
68 * or after an existing element or at the head of the list. A list
71 * A tail queue is headed by a pair of pointers, one to the head of the
75 * after an existing element, at the head of the list, or at the end of
105 /* Store the last 2 places the queue element or head was altered */
116 #define QMD_TRACE_HEAD(head) do {
[all...] |
| /onnv/onnv-gate/usr/src/cmd/syslogd/ |
| llt.h | 41 void ll_init(llh_t *head);
42 void ll_enqueue(llh_t *head, ll_t *data);
43 void ll_mapf(llh_t *head, void (*func)(void *));
44 ll_t * ll_peek(llh_t *head);
45 ll_t * ll_dequeue(llh_t *head);
47 int ll_check(llh_t *head);
|
| list.c | 36 ll_init(llh_t *head)
38 head->back = &head->front;
39 head->front = NULL;
42 ll_enqueue(llh_t *head, ll_t *data)
45 *head->back = data;
46 head->back = &data->n;
54 ll_mapf(llh_t *head, void (*func)(void *))
56 ll_t *t = head->front;
66 ll_peek(llh_t *head)
[all...] |
| /onnv/onnv-gate/usr/src/lib/libsmbfs/smb/ |
| queue.h | 68 #define SLIST_EMPTY(head) ((head)->slh_first == NULL)
70 #define SLIST_FIRST(head) ((head)->slh_first)
72 #define SLIST_FOREACH(var, head, field) \
73 for ((var) = SLIST_FIRST((head)); \
77 #define SLIST_INIT(head) do { \
78 SLIST_FIRST((head)) = NULL; \
86 #define SLIST_INSERT_HEAD(head, elm, field) do { \
87 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
[all...] |
| /onnv/onnv-gate/usr/src/lib/libpp/common/ |
| ppcomment.c | 31 ppcomment(char* head, char* comment, char* tail, int line)
34 ppprintf("%s%-.*s%s", head, MAXTOKEN - 4, comment, tail);
|
| /onnv/onnv-gate/usr/src/cmd/sendmail/db/include/ |
| queue.h | 56 * or after an existing element or at the head of the list. A list
59 * A tail queue is headed by a pair of pointers, one to the head of the
63 * after an existing element, at the head of the list, or at the end of
66 * A circle queue is headed by a pair of pointers, one to the head of the
70 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_FIRST(head) ((head)->lh_first)
93 #define LIST_END(head) NULL
98 #define LIST_INIT(head) { \
99 (head)->lh_first = NULL;
[all...] |
| shqueue.h | 28 * parameter, only used by the HEAD and ENTRY macros of the standard macros.
55 #define SH_LIST_FIRSTP(head, type) \
56 ((struct type *)(((u_int8_t *)(head)) + (head)->slh_first))
58 #define SH_LIST_FIRST(head, type) \
59 ((head)->slh_first == -1 ? NULL : \
60 ((struct type *)(((u_int8_t *)(head)) + (head)->slh_first)))
75 #define SH_LIST_END(head) NULL
85 #define SH_LIST_INIT(head) (head)->slh_first = -
[all...] |
| /onnv/onnv-gate/usr/src/cmd/ssh/include/ |
| sys-queue.h | 138 * added to the list after an existing element or at the head of the list.
139 * Elements being removed from the head of the list should use the explicit
149 * or after an existing element or at the head of the list. A list
152 * A simple queue is headed by a pair of pointers, one the head of the
155 * head of the list. New elements can be added to the list before or after
156 * an existing element, at the head of the list, or at the end of the
159 * A tail queue is headed by a pair of pointers, one to the head of the
163 * after an existing element, at the head of the list, or at the end of
166 * A circle queue is headed by a pair of pointers, one to the head of the
170 * an existing element, at the head of the list, or at the end of the list
[all...] |
| /onnv/onnv-gate/usr/src/cmd/sendmail/include/sm/ |
| tailq.h | 48 * A tail queue is headed by a pair of pointers, one to the head of the
52 * after an existing element, at the head of the list, or at the end of
65 #define SM_TAILQ_HEAD_INITIALIZER(head) \
66 { NULL, &(head).tqh_first }
77 #define SM_TAILQ_FIRST(head) ((head)->tqh_first)
78 #define SM_TAILQ_END(head) NULL
80 #define SM_TAILQ_LAST(head, headname) \
81 (*(((struct headname *)((head)->tqh_last))->tqh_last))
85 #define SM_TAILQ_EMPTY(head) \
[all...] |
| /onnv/onnv-gate/usr/src/lib/krb5/plugins/kdb/db2/libdb2/include/ |
| db-queue.h | 61 * an existing element or at the head of the list. A list may only be
64 * A tail queue is headed by a pair of pointers, one to the head of the
68 * an existing element, at the head of the list, or at the end of the
71 * A circle queue is headed by a pair of pointers, one to the head of the
75 * an existing element, at the head of the list, or at the end of the list.
99 #define LIST_INIT(head) { \
100 (head)->lh_first = NULL; \
111 #define LIST_INSERT_HEAD(head, elm, field) { \
112 if (((elm)->field.le_next = (head)->lh_first) != NULL) \
113 (head)->lh_first->field.le_prev = &(elm)->field.le_next;
[all...] |
| /onnv/onnv-gate/usr/src/lib/libdhcpsvc/ |
| Makefile | 31 SUBDIRS = head private modules
38 @cd head; pwd; $(MAKE) $@
|
| /onnv/onnv-gate/usr/src/uts/common/sys/ |
| queue.h | 57 * head of the list. Elements being removed from the head of the list
67 * or after an existing element or at the head of the list. A list
70 * A simple queue is headed by a pair of pointers, one the head of the
73 * head of the list. New elements can be added to the list after
74 * an existing element, at the head of the list, or at the end of the
77 * A tail queue is headed by a pair of pointers, one to the head of the
81 * after an existing element, at the head of the list, or at the end of
84 * A circle queue is headed by a pair of pointers, one to the head of the
88 * an existing element, at the head of the list, or at the end of the list
[all...] |
| /onnv/onnv-gate/usr/src/lib/libc/amd64/unwind/ |
| thrp_unwind.c | 53 __cleanup_t *head; local
69 while ((head = *headp) != NULL &&
70 (caddr_t)cfa == head->fp + CFA_ADJUST) {
71 *headp = head->next;
72 (*head->func)(head->arg);
91 __cleanup_t *head; local
114 while ((head = *headp) != NULL) {
115 *headp = head->next;
116 (*head->func)(head->arg)
[all...] |
| /onnv/onnv-gate/usr/src/lib/libc/port/unwind/ |
| unwind.c | 73 __cleanup_t *head; local
91 if ((head = self->ul_clnup_hdr) != NULL && fp == head->fp) {
92 self->ul_clnup_hdr = head->next;
94 _ex_clnup_handler(head->arg, head->func);
102 } else if (head != NULL) {
|
| /onnv/onnv-gate/usr/src/lib/udapl/udapl_tavor/common/ |
| dapl_llist.c | 37 * A link list head points to the first member of a linked list, but
42 * HEAD -> | +-------+ +-------+ +-------+ |
61 * Purpose: initialize a linked list head
64 dapl_llist_init_head(DAPL_LLIST_HEAD *head)
66 *head = NULL;
89 dapl_llist_is_empty(DAPL_LLIST_HEAD *head)
91 return (*head == NULL);
97 * Purpose: Add an entry to the head of a linked list
100 dapl_llist_add_head(DAPL_LLIST_HEAD *head,
107 if (dapl_llist_is_empty(head)) {
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/io/aggr/ |
| aggr_recv.c | 84 mblk_t *cmp, *last, *head; local
90 head = cmp = mp;
94 if (head == cmp) {
96 head = cmp->b_next;
99 cmp = head;
105 head);
107 freemsgchain(head);
109 head = cmp->b_next;
112 cmp = head;
126 if (head == cmp)
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/io/mega_sas/ |
| list.h | 94 * @head: list head to add it after
96 * Insert a new entry after the specified head.
99 static void mlist_add(struct mlist_head *new, struct mlist_head *head)
101 __list_add(new, head, head->next);
108 * @head: list head to add it before
110 * Insert a new entry before the specified head.
113 static void mlist_add_tail(struct mlist_head *new, struct mlist_head *head)
[all...] |
| /onnv/onnv-gate/usr/src/lib/libntfs/common/include/ntfs/ |
| list.h | 71 * @head: list head to add it after
73 * Insert a new entry after the specified head.
76 static __inline__ void list_add(struct list_head *new, struct list_head *head)
78 __list_add(new, head, head->next);
84 * @head: list head to add it before
86 * Insert a new entry before the specified head.
89 static __inline__ void list_add_tail(struct list_head *new, struct list_head *head)
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/io/mr_sas/ |
| mr_sas_list.h | 94 * @head: list head to add it after
96 * Insert a new entry after the specified head.
99 static void mlist_add(struct mlist_head *new, struct mlist_head *head)
101 __list_add(new, head, head->next);
108 * @head: list head to add it before
110 * Insert a new entry before the specified head.
113 static void mlist_add_tail(struct mlist_head *new, struct mlist_head *head)
[all...] |
| /onnv/onnv-gate/usr/src/lib/libnsl/ |
| req.flg | 28 echo_file usr/src/head/Makefile
29 echo_file usr/src/head/rpcsvc/nis.x
30 echo_file usr/src/head/rpcsvc/nis_object.x
31 echo_file usr/src/head/rpcsvc/nis_callback.x
32 echo_file usr/src/head/rpcsvc/nis_cache.x
|
| /onnv/onnv-gate/usr/src/lib/efcode/engine/ |
| resource.c | 37 find_resource(fc_resource_t **head, void *ptr, int (cmp)(void *, void *))
39 fc_resource_t *f, *prev, *r = *head;
50 *head = r->next;
68 add_resource(fc_resource_t **head, void *ptr, int (cmp)(void *, void *))
72 r = find_resource(head, ptr, cmp);
76 r->next = *head;
77 *head = r;
85 free_resource(fc_resource_t **head, void *ptr, int (cmp)(void *, void *))
89 if ((r = find_resource(head, ptr, cmp)) != NULL)
108 fc_resource_t **head; local
[all...] |
| /onnv/onnv-gate/usr/src/cmd/mail/ |
| pckaffspot.c | 46 if (hdrlines[H_AFWDFROM].head == (struct hdrs *)NULL) {
51 if (hdrlines[H_EOH].head != (struct hdrs *)NULL) {
52 if (hdrlines[H_DATE].head != (struct hdrs *)NULL) {
59 (hdrlines[H_EOH].head != (struct hdrs *)NULL)) {
|
| pckrcvspot.c | 45 if (hdrlines[H_RECEIVED].head == (struct hdrs *)NULL) {
52 if (hdrlines[H_EOH].head != (struct hdrs *)NULL) {
53 if (hdrlines[H_DATE].head != (struct hdrs *)NULL) {
60 (hdrlines[H_EOH].head != (struct hdrs *)NULL)) {
|
| /onnv/onnv-gate/usr/src/stand/lib/tcp/ |
| tcp_sack.c | 50 * sack_blk_t *head: pointer to the array of SACK blks.
56 tcp_sack_insert(sack_blk_t *head, tcp_seq begin, tcp_seq end, int32_t *num)
63 head[0].begin = begin;
64 head[0].end = end;
75 * 4. head part of new SACK blk overlaps with another blk.
79 * to head.
88 if (SEQ_LT(end, head[i].begin) || SEQ_GT(begin, head[i].end)) {
90 tmp[j].begin = head[i].begin;
91 tmp[j].end = head[i].end
[all...] |
