Home
last modified time | relevance | path

Searched defs:field (Results 1 – 25 of 310) sorted by relevance

12345678910>>...13

/freebsd/crypto/heimdal/base/
H A Dheimqueue.h59 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \ argument
63 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \ argument
66 #define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field) \ argument
73 #define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) \ argument
78 #define QUEUEDEBUG_HEIM_TAILQ_POSTREMOVE(elm, field) \ argument
82 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) argument
83 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) argument
84 #define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field) argument
85 #define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) argument
86 #define QUEUEDEBUG_HEIM_TAILQ_POSTREMOVE(elm, field) argument
[all …]
/freebsd/crypto/heimdal/lib/asn1/
H A Dasn1_queue.h59 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \ argument
63 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \ argument
66 #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) \ argument
73 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) \ argument
78 #define QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE(elm, field) \ argument
82 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) argument
83 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) argument
84 #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) argument
85 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) argument
86 #define QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE(elm, field) argument
[all …]
/freebsd/sys/contrib/ck/include/
H A Dck_queue.h148 #define CK_SLIST_NEXT(elm, field) \ argument
151 #define CK_SLIST_FOREACH(var, head, field) \ argument
156 #define CK_SLIST_FOREACH_FROM(var, head, field) \ argument
161 #define CK_SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
166 #define CK_SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
176 #define CK_SLIST_INSERT_AFTER(a, b, field) do { \ argument
182 #define CK_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
188 #define CK_SLIST_INSERT_PREVPTR(prevp, slistelm, elm, field) do { \ argument
194 #define CK_SLIST_REMOVE_AFTER(elm, field) do { \ argument
199 #define CK_SLIST_REMOVE(head, elm, type, field) do { \ argument
[all …]
/freebsd/contrib/libarchive/unzip/
H A Dla_queue.h184 #define SLIST_CONCAT(head1, head2, type, field) do { \ argument
201 #define SLIST_FOREACH(var, head, field) \ argument
206 #define SLIST_FOREACH_FROM(var, head, field) \ argument
211 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
216 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
221 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
230 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
235 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
240 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
242 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
[all …]
/freebsd/sys/sys/
H A Dqueue.h214 #define SLIST_CONCAT(head1, head2, type, field) do { \ argument
234 #define SLIST_FOREACH(var, head, field) \ argument
239 #define SLIST_FOREACH_FROM(var, head, field) \ argument
244 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
249 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
254 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
263 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
268 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
273 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
275 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
[all …]
H A Dtree.h92 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
93 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
98 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
104 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
110 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
116 #define SPLAY_LINKRIGHT(head, tmp, field) do { \ argument
122 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ argument
131 #define SPLAY_PROTOTYPE(name, type, field, cmp) \ argument
173 #define SPLAY_GENERATE(name, type, field, cmp) \ argument
332 #define _RB_LINK(elm, dir, field) (elm)->field.rbe_link[dir] argument
[all …]
H A Darb.h66 #define ARB_INIT(x, field, head, maxn) \ argument
86 #define ARB_ENTRYINIT(elm, field) do { \ argument
105 #define ARB_LEFT(head, elm, field) ARB_NODE(head, ARB_LEFTIDX(elm, field)) argument
106 #define ARB_RIGHT(head, elm, field) ARB_NODE(head, ARB_RIGHTIDX(elm, field)) argument
107 #define ARB_PARENT(head, elm, field) ARB_NODE(head, ARB_PARENTIDX(elm, field)) argument
116 #define ARB_LEFTIDX(elm, field) (elm)->field.arbe_left_idx argument
117 #define ARB_RIGHTIDX(elm, field) (elm)->field.arbe_right_idx argument
118 #define ARB_PARENTIDX(elm, field) (elm)->field.arbe_parent_idx argument
119 #define ARB_COLOR(elm, field) (elm)->field.arbe_color argument
120 #define ARB_PREVFREE(head, elm, field) \ argument
[all …]
/freebsd/contrib/openbsm/compat/
H A Dqueue.h160 #define SLIST_FOREACH(var, head, field) \ argument
165 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
170 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
179 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
184 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
189 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
191 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
205 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
241 #define STAILQ_FOREACH(var, head, field) \ argument
247 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
[all …]
/freebsd/crypto/openssh/openbsd-compat/
H A Dsys-queue.h205 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
207 #define SLIST_FOREACH(var, head, field) \ argument
212 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
224 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
229 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
234 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
238 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
242 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
279 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
281 #define LIST_FOREACH(var, head, field) \ argument
[all …]
H A Dsys-tree.h82 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
83 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
88 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
94 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
100 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
106 #define SPLAY_LINKRIGHT(head, tmp, field) do { \ argument
112 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ argument
121 #define SPLAY_PROTOTYPE(name, type, field, cmp) \ argument
163 #define SPLAY_GENERATE(name, type, field, cmp) \ argument
320 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
[all …]
/freebsd/contrib/ntp/sntp/libevent/compat/sys/
H A Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
111 #define SLIST_FOREACH(var, head, field) \ argument
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
133 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
160 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
162 #define LIST_FOREACH(var, head, field) \ argument
174 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
182 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
189 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
/freebsd/contrib/libevent/compat/sys/
H A Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
111 #define SLIST_FOREACH(var, head, field) \ argument
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
133 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
160 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
162 #define LIST_FOREACH(var, head, field) \ argument
174 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
182 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
189 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
/freebsd/contrib/ncurses/form/
H A Dfrm_driver.c132 #define Position_Of_Row_In_Buffer(field,row) ((row)*(field)->dcols) argument
135 #define Address_Of_Nth_Buffer(field,N) \ argument
139 #define Address_Of_Row_In_Nth_Buffer(field,N,row) \ argument
143 #define Address_Of_Row_In_Buffer(field,row) \ argument
168 #define Is_Scroll_Field(field) \ argument
175 #define Has_Invisible_Parts(field) \ argument
180 #define Justification_Allowed(field) \ argument
188 #define Growable(field) ((field)->status & _MAY_GROW) argument
191 #define Set_Field_Window_Attributes(field,win) \ argument
196 #define Field_Really_Appears(field) \ argument
[all …]
/freebsd/contrib/sendmail/include/sm/
H A Dtailq.h77 #define SM_TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
81 #define SM_TAILQ_PREV(elm, headname, field) \ argument
86 #define SM_TAILQ_FOREACH(var, head, field) \ argument
91 #define SM_TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
104 #define SM_TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
114 #define SM_TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
121 #define SM_TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
131 #define SM_TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
138 #define SM_TAILQ_REMOVE(head, elm, field) do { \ argument
147 #define SM_TAILQ_REPLACE(head, elm, elm2, field) do { \ argument
/freebsd/contrib/ntp/sntp/libevent/WIN32-Code/
H A Dtree.h75 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
76 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
81 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
87 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
93 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
99 #define SPLAY_LINKRIGHT(head, tmp, field) do { \ argument
105 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ argument
114 #define SPLAY_PROTOTYPE(name, type, field, cmp) \ argument
156 #define SPLAY_GENERATE(name, type, field, cmp) \ argument
313 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
[all …]
/freebsd/contrib/libevent/WIN32-Code/
H A Dtree.h75 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
76 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
81 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
87 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
93 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
99 #define SPLAY_LINKRIGHT(head, tmp, field) do { \ argument
105 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ argument
114 #define SPLAY_PROTOTYPE(name, type, field, cmp) \ argument
156 #define SPLAY_GENERATE(name, type, field, cmp) \ argument
313 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
[all …]
/freebsd/contrib/libucl/src/
H A Dtree.h70 #define TREE_DELTA(self, field) \ argument
76 #define TREE_DEFINE(node, field) \ argument
195 #define TREE_INSERT(head, node, field, elm) \ argument
198 #define TREE_FIND(head, node, field, elm) \ argument
201 #define TREE_REMOVE(head, node, field, elm) \ argument
204 #define TREE_DEPTH(head, field) \ argument
207 #define TREE_FORWARD_APPLY(head, node, field, function, data) \ argument
210 #define TREE_REVERSE_APPLY(head, node, field, function, data) \ argument
/freebsd/crypto/heimdal/lib/gssapi/mech/
H A Dmechqueue.h60 #define HEIM_SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
65 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
70 #define HEIM_SLIST_REMOVE_HEAD(head, field) do { \ argument
74 #define HEIM_SLIST_REMOVE(head, elm, type, field) do { \ argument
87 #define HEIM_SLIST_FOREACH(var, head, field) \ argument
95 #define HEIM_SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
/freebsd/usr.sbin/nscd/
H A Dhashtable.h73 #define HASHTABLE_INIT(table, type, field, _entries_size) \ argument
93 #define HASHTABLE_DESTROY(table, field) \ argument
115 #define HASHTABLE_ENTRY_FOREACH(entry, field, var) \ argument
120 #define HASHTABLE_ENTRY_CLEAR(entry, field) \ argument
123 #define HASHTABLE_ENTRY_SIZE(entry, field) \ argument
126 #define HASHTABLE_ENTRY_CAPACITY(entry, field) \ argument
129 #define HASHTABLE_ENTRY_CAPACITY_INCREASE(entry, field, type) \ argument
136 #define HASHTABLE_ENTRY_CAPACITY_DECREASE(entry, field, type) \ argument
157 #define HASHTABLE_GENERATE(name, entry_, type, field, HASH, CMP) \ argument
/freebsd/contrib/elftoolchain/common/
H A D_elftc.h80 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
87 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
132 #define STAILQ_FOREACH(var, head, field) \ argument
139 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
153 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
161 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
169 #define STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
177 #define STAILQ_LAST(head, type, field) \ argument
184 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
188 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
[all …]
/freebsd/contrib/ntp/sntp/libevent/
H A Dht-internal.h105 #define HT_SET_HASH_(elm, field, hashfn) \ argument
107 #define HT_SET_HASHVAL_(elm, field, val) \ argument
109 #define HT_ELT_HASH_(elm, field, hashfn) \ argument
112 #define HT_SET_HASH_(elm, field, hashfn) \ argument
114 #define HT_ELT_HASH_(elm, field, hashfn) \ argument
116 #define HT_SET_HASHVAL_(elm, field, val) \ argument
121 #define HT_BUCKET_(head, field, elm, hashfn) \ argument
129 #define HT_PROTOTYPE(name, type, field, hashfn, eqfn) \ argument
300 #define HT_GENERATE(name, type, field, hashfn, eqfn, load, mallocfn, \ argument
425 #define HT_FIND_OR_INSERT_(name, field, hashfn, head, eltype, elm, var, y, n) \ argument
[all …]
/freebsd/contrib/libevent/
H A Dht-internal.h105 #define HT_SET_HASH_(elm, field, hashfn) \ argument
107 #define HT_SET_HASHVAL_(elm, field, val) \ argument
109 #define HT_ELT_HASH_(elm, field, hashfn) \ argument
112 #define HT_SET_HASH_(elm, field, hashfn) \ argument
114 #define HT_ELT_HASH_(elm, field, hashfn) \ argument
116 #define HT_SET_HASHVAL_(elm, field, val) \ argument
121 #define HT_BUCKET_(head, field, elm, hashfn) \ argument
129 #define HT_PROTOTYPE(name, type, field, hashfn, eqfn) \ argument
300 #define HT_GENERATE(name, type, field, hashfn, eqfn, load, mallocfn, \ argument
425 #define HT_FIND_OR_INSERT_(name, field, hashfn, head, eltype, elm, var, y, n) \ argument
[all …]
/freebsd/contrib/ofed/libibmad/
H A Dfields.c1231 uint32_t mad_get_field(void *buf, int base_offs, enum MAD_FIELDS field) in mad_get_field()
1236 void mad_set_field(void *buf, int base_offs, enum MAD_FIELDS field, in mad_set_field()
1242 uint64_t mad_get_field64(void *buf, int base_offs, enum MAD_FIELDS field) in mad_get_field64()
1247 void mad_set_field64(void *buf, int base_offs, enum MAD_FIELDS field, in mad_set_field64()
1253 void mad_set_array(void *buf, int base_offs, enum MAD_FIELDS field, void *val) in mad_set_array()
1258 void mad_get_array(void *buf, int base_offs, enum MAD_FIELDS field, void *val) in mad_get_array()
1263 void mad_decode_field(uint8_t * buf, enum MAD_FIELDS field, void *val) in mad_decode_field()
1282 void mad_encode_field(uint8_t * buf, enum MAD_FIELDS field, void *val) in mad_encode_field()
1356 int mad_print_field(enum MAD_FIELDS field, const char *name, void *val) in mad_print_field()
1363 char *mad_dump_field(enum MAD_FIELDS field, char *buf, int bufsz, void *val) in mad_dump_field()
[all …]
/freebsd/sys/compat/linuxkpi/common/include/linux/
H A Dinterval_tree_generic.h31 #define INTERVAL_TREE_DEFINE(type, field, valtype, dummy, START, LAST, \ argument
39 #define __IT_DEFINE_ITER_FROM(type, field, valtype, START, LAST, name) \ argument
63 #define __IT_DEFINE_ITER_NEXT(type, field, valtype, attr, name) \ argument
70 #define __IT_DEFINE_INSERT(type, field, START, attr, name) \ argument
94 #define __IT_DEFINE_REMOVE(type, field, attr, name) \ argument
/freebsd/lib/libusb/
H A Dlibusb20_desc.h114 #define LIBUSB20_ME_STRUCT(n, field, arg, ismeta) \ argument
118 #define LIBUSB20_ME_STRUCT_ARRAY(n, field, arg, ismeta) \ argument
123 #define LIBUSB20_ME_INTEGER(n, field, ismeta, un, u, bits, a, size) \ argument
130 #define LIBUSB20_ME_UINT8_T(n, field, arg, ismeta) \ argument
133 #define LIBUSB20_ME_UINT8_ARRAY_T(n, field, arg, ismeta) \ argument
136 #define LIBUSB20_ME_SINT8_T(n, field, arg, ismeta) \ argument
139 #define LIBUSB20_ME_SINT8_ARRAY_T(n, field, arg, ismeta) \ argument
142 #define LIBUSB20_ME_UINT16_T(n, field, arg, ismeta) \ argument
145 #define LIBUSB20_ME_UINT16_ARRAY_T(n, field, arg, ismeta) \ argument
148 #define LIBUSB20_ME_SINT16_T(n, field, arg, ismeta) \ argument
[all …]

12345678910>>...13