Searched refs:elm (Results 1 - 25 of 29) sorted by relevance

12

/freebsd-10.1-release/crypto/heimdal/base/
H A Dheimqueue.h59 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \
63 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \
66 #define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field) \
67 if ((elm)->field.tqe_next && \
68 (elm)->field.tqe_next->field.tqe_prev != \
69 &(elm)->field.tqe_next) \
70 panic("HEIM_TAILQ_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
71 if (*(elm)->field.tqe_prev != (elm)) \
72 panic("HEIM_TAILQ_* back %p %s:%d", (elm), __FILE_
[all...]
/freebsd-10.1-release/crypto/heimdal/lib/asn1/
H A Dasn1_queue.h59 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \
63 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \
66 #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) \
67 if ((elm)->field.tqe_next && \
68 (elm)->field.tqe_next->field.tqe_prev != \
69 &(elm)->field.tqe_next) \
70 panic("ASN1_TAILQ_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
71 if (*(elm)->field.tqe_prev != (elm)) \
72 panic("ASN1_TAILQ_* back %p %s:%d", (elm), __FILE_
[all...]
/freebsd-10.1-release/contrib/sendmail/include/sm/
H A Dtailq.h77 #define SM_TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
81 #define SM_TAILQ_PREV(elm, headname, field) \
82 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
104 #define SM_TAILQ_INSERT_HEAD(head, elm, field) do { \
105 if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
107 &(elm)->field.tqe_next; \
109 (head)->tqh_last = &(elm)->field.tqe_next; \
110 (head)->tqh_first = (elm); \
111 (elm)
[all...]
/freebsd-10.1-release/contrib/ntp/sntp/libevent/compat/sys/
H A Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
124 (elm)->field.sle_next = (slistelm)->field.sle_next; \
125 (slistelm)->field.sle_next = (elm); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \
129 (elm)->field.sle_next = (head)->slh_first; \
130 (head)->slh_first = (elm); \
160 #define LIST_NEXT(elm, field) ((elm)
[all...]
/freebsd-10.1-release/crypto/heimdal/lib/gssapi/mech/
H A Dmechqueue.h60 #define HEIM_SLIST_INSERT_AFTER(slistelm, elm, field) do { \
61 (elm)->field.sle_next = (slistelm)->field.sle_next; \
62 (slistelm)->field.sle_next = (elm); \
65 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \
66 (elm)->field.sle_next = (head)->slh_first; \
67 (head)->slh_first = (elm); \
74 #define HEIM_SLIST_REMOVE(head, elm, type, field) do { \
75 if ((head)->slh_first == (elm)) { \
80 while(curelm->field.sle_next != (elm)) \
95 #define HEIM_SLIST_NEXT(elm, fiel
[all...]
/freebsd-10.1-release/lib/libc/iconv/
H A Dcitrus_hash.h45 #define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field)
46 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \
47 LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)
48 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \
50 LIST_FOREACH((elm), &(head)->chh_table[hashval], field) \
51 if (matchfunc((elm), key) == 0) \
/freebsd-10.1-release/contrib/openbsm/compat/
H A Dqueue.h180 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
181 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
182 SLIST_NEXT((slistelm), field) = (elm); \
185 #define SLIST_INSERT_HEAD(head, elm, field) do { \
186 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
187 SLIST_FIRST((head)) = (elm); \
190 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
192 #define SLIST_REMOVE(head, elm, type, field) do { \
193 if (SLIST_FIRST((head)) == (elm)) { \
[all...]
/freebsd-10.1-release/contrib/ipfilter/sys/
H A Dtree.h78 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
79 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
123 /* Finds the node with the same key as elm */ \
125 name##_SPLAY_FIND(struct name *head, struct type *elm) \
129 name##_SPLAY(head, elm); \
130 if ((cmp)(elm, (head)->sph_root) == 0) \
136 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
138 name##_SPLAY(head, elm); \
[all...]
/freebsd-10.1-release/crypto/openssh/openbsd-compat/
H A Dsys-tree.h82 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
83 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
127 /* Finds the node with the same key as elm */ \
129 name##_SPLAY_FIND(struct name *head, struct type *elm) \
133 name##_SPLAY(head, elm); \
134 if ((cmp)(elm, (head)->sph_root) == 0) \
140 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
142 name##_SPLAY(head, elm); \
[all...]
H A Dsys-queue.h198 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
217 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
218 (elm)->field.sle_next = (slistelm)->field.sle_next; \
219 (slistelm)->field.sle_next = (elm); \
222 #define SLIST_INSERT_HEAD(head, elm, field) do { \
223 (elm)->field.sle_next = (head)->slh_first; \
224 (head)->slh_first = (elm); \
227 #define SLIST_REMOVE_AFTER(elm, field) do { \
228 (elm)
[all...]
/freebsd-10.1-release/sys/sys/
H A Dtree.h80 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
81 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
125 /* Finds the node with the same key as elm */ \
127 name##_SPLAY_FIND(struct name *head, struct type *elm) \
131 name##_SPLAY(head, elm); \
132 if ((cmp)(elm, (head)->sph_root) == 0) \
138 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
140 name##_SPLAY(head, elm); \
[all...]
H A Dqueue.h198 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
199 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
200 SLIST_NEXT((slistelm), field) = (elm); \
203 #define SLIST_INSERT_HEAD(head, elm, field) do { \
204 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
205 SLIST_FIRST((head)) = (elm); \
208 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
210 #define SLIST_REMOVE(head, elm, type, field) do { \
211 QMD_SAVELINK(oldnext, (elm)
[all...]
/freebsd-10.1-release/contrib/ntp/sntp/libevent/
H A Dht-internal.h52 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm))
53 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm))
54 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm))
55 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm))
57 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm))
[all...]
H A Devent-internal.h379 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
390 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
391 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
392 (elm)->field.tqe_next = (listelm); \
393 *(listelm)->field.tqe_prev = (elm); \
394 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
/freebsd-10.1-release/usr.bin/csup/
H A Dqueue.h86 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
87 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
88 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
89 STAILQ_NEXT((tqelm), field) = (elm); \
93 #define STAILQ_INSERT_HEAD(head, elm, field) do { \
94 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
95 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
96 STAILQ_FIRST((head)) = (elm); \
100 #define STAILQ_INSERT_TAIL(head, elm, field) do { \
101 STAILQ_NEXT((elm), fiel
[all...]
/freebsd-10.1-release/contrib/ntp/sntp/libevent/WIN32-Code/
H A Dtree.h75 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
76 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
120 /* Finds the node with the same key as elm */ \
122 name##_SPLAY_FIND(struct name *head, struct type *elm) \
126 name##_SPLAY(head, elm); \
127 if ((cmp)(elm, (head)->sph_root) == 0) \
133 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
135 name##_SPLAY(head, elm); \
[all...]
/freebsd-10.1-release/contrib/libucl/src/
H A Dtree.h115 (struct node *self, struct node *elm, int (*compare)(struct node *lhs, struct node *rhs)) \
118 return elm; \
119 if (compare(elm, self) < 0) \
120 self->field.avl_left= TREE_INSERT_##node##_##field(self->field.avl_left, elm, compare); \
122 self->field.avl_right= TREE_INSERT_##node##_##field(self->field.avl_right, elm, compare); \
127 (struct node *self, struct node *elm, int (*compare)(struct node *lhs, struct node *rhs)) \
131 if (compare(elm, self) == 0) \
133 if (compare(elm, self) < 0) \
134 return TREE_FIND_##node##_##field(self->field.avl_left, elm, compare); \
136 return TREE_FIND_##node##_##field(self->field.avl_right, elm, compar
[all...]
/freebsd-10.1-release/libexec/rtld-elf/
H A Drtld.c1730 const Objlist_Entry *elm; local
1747 STAILQ_FOREACH(elm, &root->dagmembers, link) {
1748 for (needed = elm->obj->needed; needed != NULL; needed = needed->next) {
1761 const Objlist_Entry *elm; local
1768 STAILQ_FOREACH(elm, &root->dagmembers, link) {
1769 if (elm->obj != NULL && elm->obj->z_nodelete &&
1770 !elm->obj->ref_nodel) {
1771 dbg("obj %s nodelete", elm->obj->path);
1772 init_dag(elm
2214 Objlist_Entry *elm; local
2289 Objlist_Entry *elm; local
2350 Objlist_Entry *elm; local
2362 Objlist_Entry *elm; local
2379 Objlist_Entry *elm; local
2389 Objlist_Entry *elm; local
2399 Objlist_Entry *elm, *listelm; local
2416 Objlist_Entry *elm; local
2433 Objlist_Entry *elm; local
2594 Objlist_Entry *elm; local
3576 const Objlist_Entry *elm; local
3620 const Objlist_Entry *elm; local
3676 const Objlist_Entry *elm; local
4128 Objlist_Entry *elm; local
4146 Objlist_Entry *elm; local
4156 Objlist_Entry *elm; local
[all...]
H A Dmap_object.c366 Objlist_Entry *elm; local
381 elm = STAILQ_FIRST(&obj->dldags);
383 free(elm);
386 elm = STAILQ_FIRST(&obj->dagmembers);
388 free(elm);
/freebsd-10.1-release/sys/net/
H A Dif_epair.c274 struct epair_ifp_drain *elm, *tvar; local
285 STAILQ_FOREACH_SAFE(elm, &epair_dpcpu->epair_ifp_drain_list,
287 ifp = elm->ifp;
297 elm, epair_ifp_drain, ifp_next);
304 free(elm, M_EPAIR);
326 struct epair_ifp_drain *elm, *tvar; local
332 STAILQ_FOREACH_SAFE(elm, &epair_dpcpu->epair_ifp_drain_list,
334 if (ifp == elm->ifp) {
338 &epair_dpcpu->epair_ifp_drain_list, elm,
346 free(elm, M_EPAI
358 struct epair_ifp_drain *elm = NULL; local
[all...]
/freebsd-10.1-release/contrib/jemalloc/src/
H A Dctl.c719 const char *elm, *tdot, *dot; local
723 elm = name;
725 dot = ((tdot = strchr(elm, '.')) != NULL) ? tdot : strchr(elm, '\0');
726 elen = (size_t)((uintptr_t)dot - (uintptr_t)elm);
743 strncmp(elm, child->name, elen) == 0) {
761 index = malloc_strtoumax(elm, NULL, 10);
794 /* Update elm. */
800 elm = &dot[1];
801 dot = ((tdot = strchr(elm, '
[all...]
/freebsd-10.1-release/contrib/nvi/common/
H A Dmem.h239 #define TAILQ_ENTRY_ISVALID(elm, field) \
240 ((elm)->field.tqe_prev != NULL)
/freebsd-10.1-release/sys/dev/asr/
H A Dasr.c3196 } * elm; local
3385 if ((elm = (struct ioctlSgList_S *)malloc (
3386 sizeof(*elm) - sizeof(elm->KernelSpace) + len,
3393 SLIST_INSERT_HEAD(&sgList, elm, link);
3394 elm->FlagsCount = sg->FlagsCount;
3395 elm->UserSpace = (caddr_t)
3397 v = elm->KernelSpace;
3399 if ((error = copyin (elm->UserSpace, (caddr_t)v, len))
3437 &(elm
[all...]
/freebsd-10.1-release/sys/cam/scsi/
H A Dscsi_enc_ses.c805 * additional element status data for elm, passing that data
808 * \param enc SES instance containing elm
809 * \param elm Element for which to extract device ID data.
811 * device id descriptor for elm.
815 ses_devids_iter(enc_softc_t *enc, enc_element_t *elm, argument
823 elmpriv = elm->elm_private;
852 callback(enc, elm, devid, callback_arg);
875 * \param enc SES instance containing elm
876 * \param elm Element on which device ID matching is active.
877 * \param periph A device ID corresponding to elm
948 ses_paths_iter(enc_softc_t *enc, enc_element_t *elm, ses_path_callback_t *callback, void *callback_arg) argument
997 ses_setphyspath_callback(enc_softc_t *enc, enc_element_t *elm, struct cam_path *path, void *arg) argument
1045 ses_set_physpath(enc_softc_t *enc, enc_element_t *elm, struct ses_iterator *iter) argument
[all...]
/freebsd-10.1-release/sys/dev/mfi/
H A Dmfi.c1643 struct mfi_evt_queue_elm *elm; local
1646 elm = malloc(sizeof(*elm), M_MFIBUF, M_NOWAIT|M_ZERO);
1647 if (elm == NULL)
1649 memcpy(&elm->detail, detail, sizeof(*detail));
1650 TAILQ_INSERT_TAIL(&sc->mfi_evt_queue, elm, link);
1659 struct mfi_evt_queue_elm *elm; local
1666 while ((elm = TAILQ_FIRST(&queue)) != NULL) {
1667 TAILQ_REMOVE(&queue, elm, link);
1668 mfi_decode_evt(sc, &elm
[all...]

Completed in 310 milliseconds

12