| /netbsd/src/external/bsd/openldap/dist/include/ |
| D | ldap_queue.h | 143 #define LDAP_SLIST_HEAD_INITIALIZER(head) \ argument
157 #define LDAP_SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
159 #define LDAP_SLIST_FIRST(head) ((head)->slh_first) argument
161 #define LDAP_SLIST_FOREACH(var, head, field) \ argument
162 for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)
164 #define LDAP_SLIST_INIT(head) { \ argument
165 (head)->slh_first = NULL; \
177 #define LDAP_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
178 (elm)->field.sle_next = (head)->slh_first; \
179 (head)->slh_first = (elm); \
[all …]
|
| /netbsd/src/external/bsd/ntp/dist/sntp/libevent/compat/sys/ |
| D | queue.h | 95 #define SLIST_HEAD_INITIALIZER(head) \ argument
108 #define SLIST_FIRST(head) ((head)->slh_first) argument
109 #define SLIST_END(head) NULL argument
110 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
113 #define SLIST_FOREACH(var, head, field) \ argument
114 for((var) = SLIST_FIRST(head); \
115 (var) != SLIST_END(head); \
121 #define SLIST_INIT(head) { \ argument
122 SLIST_FIRST(head) = SLIST_END(head); \
130 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
|
| /netbsd/src/sys/sys/ |
| D | queue.h | 107 #define SLIST_HEAD_INITIALIZER(head) \ argument
118 #define SLIST_FIRST(head) ((head)->slh_first) argument
119 #define SLIST_END(head) NULL argument
120 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
123 #define SLIST_FOREACH(var, head, field) \ argument
124 for((var) = (head)->slh_first; \
125 (var) != SLIST_END(head); \
128 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
129 for ((var) = SLIST_FIRST((head)); \
130 (var) != SLIST_END(head) && \
[all …]
|
| D | tree.h | 78 #define SPLAY_ROOT(head) (head)->sph_root argument
79 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
82 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
83 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
84 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
85 (head)->sph_root = tmp; \
88 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
89 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
90 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
91 (head)->sph_root = tmp; \
[all …]
|
| /netbsd/src/crypto/dist/ipsec-tools/src/include-glibc/sys/ |
| D | queue.h | 114 #define SLIST_HEAD_INITIALIZER(head) \ argument
125 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
127 #define SLIST_FIRST(head) ((head)->slh_first) argument
129 #define SLIST_FOREACH(var, head, field) \ argument
130 for ((var) = SLIST_FIRST((head)); \
134 #define SLIST_INIT(head) do { \ argument
135 SLIST_FIRST((head)) = NULL; \
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
144 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
145 SLIST_FIRST((head)) = (elm); \
[all …]
|
| /netbsd/src/external/bsd/ntp/dist/sntp/libevent/ |
| D | ht-internal.h | 43 #define HT_EMPTY(head) \ argument
44 ((head)->hth_n_entries == 0)
47 #define HT_SIZE(head) \ argument
48 ((head)->hth_n_entries)
51 #define HT_MEM_USAGE(head) \ argument
52 (sizeof(*head) + (head)->hth_table_length * sizeof(void*))
54 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument
55 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument
56 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument
57 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm)) argument
[all …]
|
| /netbsd/src/external/bsd/libevent/dist/ |
| D | ht-internal.h | 42 #define HT_EMPTY(head) \ argument
43 ((head)->hth_n_entries == 0)
46 #define HT_SIZE(head) \ argument
47 ((head)->hth_n_entries)
50 #define HT_MEM_USAGE(head) \ argument
51 (sizeof(*head) + (head)->hth_table_length * sizeof(void*))
53 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument
54 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument
55 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument
56 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm)) argument
[all …]
|
| /netbsd/src/sys/dev/dm/ |
| D | dm_table.c | 67 dm_table_busy(dm_table_head_t *head, uint8_t table_id) in dm_table_busy() argument
71 mutex_enter(&head->table_mtx); in dm_table_busy()
74 id = head->cur_active_table; in dm_table_busy()
76 id = 1 - head->cur_active_table; in dm_table_busy()
78 head->io_cnt++; in dm_table_busy()
80 mutex_exit(&head->table_mtx); in dm_table_busy()
88 dm_table_unbusy(dm_table_head_t *head) in dm_table_unbusy() argument
91 KASSERT(head->io_cnt != 0); in dm_table_unbusy()
93 mutex_enter(&head->table_mtx); in dm_table_unbusy()
95 if (--head->io_cnt == 0) in dm_table_unbusy()
[all …]
|
| /netbsd/src/external/gpl2/lvm2/dist/lib/datastruct/ |
| D | list.c | 24 void dm_list_init(struct dm_list *head) in dm_list_init() argument
26 head->n = head->p = head; in dm_list_init()
33 void dm_list_add(struct dm_list *head, struct dm_list *elem) in dm_list_add() argument
35 assert(head->n); in dm_list_add()
37 elem->n = head; in dm_list_add()
38 elem->p = head->p; in dm_list_add()
40 head->p->n = elem; in dm_list_add()
41 head->p = elem; in dm_list_add()
48 void dm_list_add_h(struct dm_list *head, struct dm_list *elem) in dm_list_add_h() argument
50 assert(head->n); in dm_list_add_h()
[all …]
|
| D | list.h | 38 void dm_list_init(struct dm_list *head);
44 void dm_list_add(struct dm_list *head, struct dm_list *elem);
50 void dm_list_add_h(struct dm_list *head, struct dm_list *elem);
62 void dm_list_move(struct dm_list *head, struct dm_list *elem);
67 int dm_list_empty(const struct dm_list *head);
72 int dm_list_start(const struct dm_list *head, const struct dm_list *elem);
77 int dm_list_end(const struct dm_list *head, const struct dm_list *elem);
82 struct dm_list *dm_list_first(const struct dm_list *head);
87 struct dm_list *dm_list_last(const struct dm_list *head);
92 struct dm_list *dm_list_prev(const struct dm_list *head, const struct dm_list *elem);
[all …]
|
| /netbsd/src/external/gpl2/lvm2/dist/libdm/datastruct/ |
| D | list.c | 25 void dm_list_init(struct dm_list *head) in dm_list_init() argument
27 head->n = head->p = head; in dm_list_init()
34 void dm_list_add(struct dm_list *head, struct dm_list *elem) in dm_list_add() argument
36 assert(head->n); in dm_list_add()
38 elem->n = head; in dm_list_add()
39 elem->p = head->p; in dm_list_add()
41 head->p->n = elem; in dm_list_add()
42 head->p = elem; in dm_list_add()
49 void dm_list_add_h(struct dm_list *head, struct dm_list *elem) in dm_list_add_h() argument
51 assert(head->n); in dm_list_add_h()
[all …]
|
| D | list.h | 38 void dm_list_init(struct dm_list *head);
44 void dm_list_add(struct dm_list *head, struct dm_list *elem);
50 void dm_list_add_h(struct dm_list *head, struct dm_list *elem);
62 void dm_list_move(struct dm_list *head, struct dm_list *elem);
67 int dm_list_empty(const struct dm_list *head);
72 int dm_list_start(const struct dm_list *head, const struct dm_list *elem);
77 int dm_list_end(const struct dm_list *head, const struct dm_list *elem);
82 struct dm_list *dm_list_first(const struct dm_list *head);
87 struct dm_list *dm_list_last(const struct dm_list *head);
92 struct dm_list *dm_list_prev(const struct dm_list *head, const struct dm_list *elem);
[all …]
|
| /netbsd/src/crypto/external/bsd/heimdal/dist/lib/asn1/ |
| D | asn1_queue.h | 49 #define ASN1_TAILQ_HEAD_INITIALIZER(head) \ argument
50 { NULL, &(head).tqh_first }
61 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \ argument
62 if ((head)->tqh_first && \
63 (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
64 panic("ASN1_TAILQ_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__);
65 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \ argument
66 if (*(head)->tqh_last != NULL) \
67 panic("ASN1_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE__, __LINE__);
75 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) \ argument
[all …]
|
| /netbsd/src/external/bsd/ntp/dist/sntp/libevent/WIN32-Code/ |
| D | tree.h | 79 #define SPLAY_ROOT(head) (head)->sph_root argument
80 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
83 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
84 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
85 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
86 (head)->sph_root = tmp; \
89 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
90 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
91 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
92 (head)->sph_root = tmp; \
[all …]
|
| /netbsd/src/external/bsd/libevent/dist/WIN32-Code/ |
| D | tree.h | 78 #define SPLAY_ROOT(head) (head)->sph_root argument
79 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
82 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
83 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
84 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
85 (head)->sph_root = tmp; \
88 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
89 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
90 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
91 (head)->sph_root = tmp; \
[all …]
|
| /netbsd/src/external/ibm-public/postfix/dist/src/global/ |
| D | scache_multi.c | 103 SCACHE_MULTI_HEAD *head; /* parent linkage: list head */ member
118 SCACHE_MULTI_HEAD *head; /* parent linkage: list head */ member
141 SCACHE_MULTI_HEAD *head; in scache_multi_drop_endp() local
158 head = endp->head; in scache_multi_drop_endp()
159 head->cache->sess_count--; in scache_multi_drop_endp()
160 if (direction == BOTTOM_UP && ring_pred(head->ring) == head->ring) in scache_multi_drop_endp()
161 htable_delete(head->cache->endp_cache, head->parent_key, myfree); in scache_multi_drop_endp()
186 SCACHE_MULTI_HEAD *head = (SCACHE_MULTI_HEAD *) ptr; in scache_multi_free_endp() local
194 while ((ring = ring_succ(head->ring)) != head->ring) { in scache_multi_free_endp()
198 myfree((void *) head); in scache_multi_free_endp()
[all …]
|
| /netbsd/src/sys/external/bsd/drm/dist/bsd-core/ |
| D | drm_linux_list.h | 43 INIT_LIST_HEAD(struct list_head *head) { in INIT_LIST_HEAD() argument
44 (head)->next = head; in INIT_LIST_HEAD()
45 (head)->prev = head; in INIT_LIST_HEAD()
49 list_empty(struct list_head *head) { in list_empty() argument
50 return (head)->next == head; in list_empty()
54 list_add(struct list_head *new, struct list_head *head) { in list_add() argument
55 (head)->next->prev = new; in list_add()
56 (new)->next = (head)->next; in list_add()
57 (new)->prev = head; in list_add()
58 (head)->next = new; in list_add()
[all …]
|
| /netbsd/src/external/bsd/ipf/dist/sys/ |
| D | tree.h | 80 #define SPLAY_ROOT(head) (head)->sph_root argument
81 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
84 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
85 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
86 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
87 (head)->sph_root = tmp; \
90 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
91 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
92 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
93 (head)->sph_root = tmp; \
[all …]
|
| /netbsd/src/lib/libpthread/ |
| D | pthread_queue.h | 64 #define PTQ_INIT(head) do { \ argument
65 (head)->ptqh_first = NULL; \
66 (head)->ptqh_last = &(head)->ptqh_first; \
69 #define PTQ_INSERT_HEAD(head, elm, field) do { \ argument
70 if (((elm)->field.ptqe_next = (head)->ptqh_first) != NULL) \
71 (head)->ptqh_first->field.ptqe_prev = \
74 (head)->ptqh_last = &(elm)->field.ptqe_next; \
75 (head)->ptqh_first = (elm); \
76 (elm)->field.ptqe_prev = &(head)->ptqh_first; \
79 #define PTQ_INSERT_TAIL(head, elm, field) do { \ argument
[all …]
|
| /netbsd/src/sys/altq/ |
| D | altq_afmap.c | 85 struct afm_head *head; in afm_alloc() local
87 head = malloc(sizeof(struct afm_head), M_DEVBUF, M_WAITOK|M_ZERO); in afm_alloc()
88 if (head == NULL) in afm_alloc()
92 LIST_INIT(&head->afh_head); in afm_alloc()
94 head->afh_ifp = ifp; in afm_alloc()
97 LIST_INSERT_HEAD(&afhead_chain, head, afh_chain); in afm_alloc()
105 struct afm_head *head; in afm_dealloc() local
107 if ((head = afmhead_if(ifp)) == NULL) in afm_dealloc()
112 LIST_REMOVE(head, afh_chain); in afm_dealloc()
114 free(head, M_DEVBUF); in afm_dealloc()
[all …]
|
| /netbsd/src/sys/external/bsd/common/include/linux/ |
| D | list.h | 61 INIT_LIST_HEAD(struct list_head *head) in INIT_LIST_HEAD() argument
63 head->prev = head; in INIT_LIST_HEAD()
64 head->next = head; in INIT_LIST_HEAD()
68 list_first(const struct list_head *head) in list_first() argument
70 return head->next; in list_first()
74 list_last(const struct list_head *head) in list_last() argument
76 return head->prev; in list_last()
92 list_empty(const struct list_head *head) in list_empty() argument
94 return (head->next == head); in list_empty()
98 list_is_singular(const struct list_head *head) in list_is_singular() argument
[all …]
|
| /netbsd/src/external/bsd/ntp/dist/ntpd/ |
| D | ntp_leapsec.c | 58 leap_head_t head; member
154 memset(&pt->head, 0, sizeof(pt->head)); in leapsec_clear()
191 pt->head.expire = strtouv64(cp, &ep, 10); in leapsec_load()
194 pt->lsig.etime = pt->head.expire.D_s.lo; in leapsec_load()
197 pt->head.update = strtouv64(cp, &ep, 10); in leapsec_load()
215 pt->head.base_tai = (int16_t)taiof; in leapsec_load()
244 ntpcal_ntp64_to_date(&ttb, &pt->head.expire); in leapsec_dump()
246 pt->head.size, in leapsec_dump()
248 idx = pt->head.size; in leapsec_dump()
284 if (ucmpv64(&ts64, &pt->head.ebase) < 0) { in leapsec_query()
[all …]
|
| /netbsd/src/sbin/fsck_msdos/ |
| D | fat.c | 338 clearchain(struct bootblock *boot, struct fatEntry *fat, cl_t head) in clearchain() argument
342 for (p = head; p >= CLUST_FIRST && p < boot->NumClusters; p = q) { in clearchain()
343 if (fat[p].head != head) in clearchain()
346 fat[p].next = fat[p].head = CLUST_FREE; in clearchain()
352 tryclear(struct bootblock *boot, struct fatEntry *fat, cl_t head, cl_t *truncp) in tryclear() argument
354 if (ask(0, "Clear chain starting at %u", head)) { in tryclear()
355 clearchain(boot, fat, head); in tryclear()
361 for (p = head, len = 0; in tryclear()
366 fat[head].length = len; in tryclear()
378 cl_t head, p, h, n; in checkfat() local
[all …]
|
| /netbsd/src/external/gpl3/gcc/dist/libgomp/ |
| D | priority_queue.h | 144 priority_queue_multi_p (struct priority_queue *head) in priority_queue_multi_p() argument
146 return __builtin_expect (head->t.root != NULL, 0); in priority_queue_multi_p()
152 priority_queue_init (struct priority_queue *head) in priority_queue_init() argument
154 head->t.root = NULL; in priority_queue_init()
161 head->l.tasks = NULL; in priority_queue_init()
162 head->l.last_parent_depends_on = NULL; in priority_queue_init()
166 priority_queue_free (struct priority_queue *head) in priority_queue_free() argument
188 priority_queue_empty_p (struct priority_queue *head, enum memmodel model) in priority_queue_empty_p() argument
196 if (priority_queue_multi_p (head)) in priority_queue_empty_p()
199 return __atomic_load_n (&head->t.root, MEMMODEL_ACQUIRE) == NULL; in priority_queue_empty_p()
[all …]
|
| /netbsd/src/crypto/external/bsd/heimdal/dist/lib/gssapi/mech/ |
| D | mechqueue.h | 47 #define HEIM_SLIST_HEAD_INITIALIZER(head) \ argument
58 #define HEIM_SLIST_INIT(head) do { \ argument
59 (head)->slh_first = NULL; \
67 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
68 (elm)->field.sle_next = (head)->slh_first; \
69 (head)->slh_first = (elm); \
72 #define HEIM_SLIST_REMOVE_HEAD(head, field) do { \ argument
73 (head)->slh_first = (head)->slh_first->field.sle_next; \
76 #define HEIM_SLIST_REMOVE(head, elm, type, field) do { \ argument
77 if ((head)->slh_first == (elm)) { \
[all …]
|