Home
last modified time | relevance | path

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

12345678910>>...13

/freebsd/crypto/heimdal/base/
H A Dheimqueue.h66 #define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field) \ argument
78 #define QUEUEDEBUG_HEIM_TAILQ_POSTREMOVE(elm, field) \ argument
82 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(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
94 #define HEIM_TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
105 #define HEIM_TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
132 #define HEIM_TAILQ_REMOVE(head, elm, field) do { \ argument
144 #define HEIM_TAILQ_FOREACH(var, head, field) \ argument
[all …]
/freebsd/crypto/heimdal/lib/asn1/
H A Dasn1_queue.h66 #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) \ argument
78 #define QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE(elm, field) \ argument
82 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(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
94 #define ASN1_TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
105 #define ASN1_TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
132 #define ASN1_TAILQ_REMOVE(head, elm, field) do { \ argument
144 #define ASN1_TAILQ_FOREACH(var, head, 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
194 #define CK_SLIST_REMOVE_AFTER(elm, field) do { \ argument
210 #define CK_SLIST_REMOVE_HEAD(head, field) do { \ argument
265 #define CK_STAILQ_FOREACH(var, head, field) \ argument
270 #define CK_STAILQ_FOREACH_FROM(var, head, field) \ argument
310 #define CK_STAILQ_NEXT(elm, field) \ argument
382 #define CK_LIST_FOREACH(var, head, field) \ argument
428 #define CK_LIST_REMOVE(elm, field) do { \ argument
[all …]
/freebsd/contrib/libarchive/unzip/
H A Dla_queue.h201 #define SLIST_FOREACH(var, head, field) \ argument
320 #define STAILQ_FOREACH(var, head, field) \ argument
363 #define STAILQ_LAST(head, type, field) \ argument
479 #define QMD_LIST_CHECK_HEAD(head, field) argument
480 #define QMD_LIST_CHECK_NEXT(elm, field) argument
481 #define QMD_LIST_CHECK_PREV(elm, field) argument
505 #define LIST_FOREACH(var, head, field) \ argument
561 #define LIST_REMOVE(elm, field) do { \ argument
668 #define QMD_TAILQ_CHECK_HEAD(head, field) argument
670 #define QMD_TAILQ_CHECK_NEXT(elm, field) argument
[all …]
/freebsd/sys/sys/
H A Dqueue.h231 #define SLIST_FOREACH(var, head, field) \ argument
397 #define STAILQ_LAST(head, type, field) \ argument
515 #define QMD_LIST_CHECK_HEAD(head, field) argument
516 #define QMD_LIST_CHECK_NEXT(elm, field) argument
517 #define QMD_LIST_CHECK_PREV(elm, field) argument
541 #define LIST_FOREACH(var, head, field) \ argument
597 #define LIST_REMOVE_HEAD(head, field) \ argument
600 #define LIST_REMOVE(elm, field) do { \ argument
724 #define QMD_TAILQ_CHECK_HEAD(head, field) argument
726 #define QMD_TAILQ_CHECK_NEXT(elm, field) argument
[all …]
H A Dtree.h110 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
116 #define SPLAY_LINKRIGHT(head, tmp, field) do { \ argument
173 #define SPLAY_GENERATE(name, type, field, cmp) \ argument
348 #define RB_SET_PARENT(dst, src, field) do { \ argument
353 #define RB_SET(elm, parent, field) do { \ argument
373 #define RB_UPDATE_AUGMENT(elm, field) do { \ argument
399 #define RB_ROTATE(elm, tmp, dir, field) do { \ argument
408 #define RB_PROTOTYPE(name, type, field, cmp) \ argument
468 #define RB_GENERATE(name, type, field, cmp) \ argument
521 #define RB_GENERATE_RANK(name, type, field, attr) argument
[all …]
H A Darb.h66 #define ARB_INIT(x, field, head, maxn) \ argument
86 #define ARB_ENTRYINIT(elm, field) do { \ argument
120 #define ARB_PREVFREE(head, elm, field) \ argument
123 #define ARB_NEXTFREE(head, elm, field) \ argument
128 #define ARB_SET(head, elm, parent, field) do { \ argument
200 #define ARB_RETURNFREE(head, elm, field) \ argument
208 #define ARB_GETFREEAT(head, field, fidx) \ argument
235 #define ARB_PROTOTYPE(name, type, field, cmp) \ argument
292 #define ARB_GENERATE(name, type, field, cmp) \ argument
763 #define ARB_ARRFOREACH(x, field, head) \ argument
[all …]
/freebsd/contrib/openbsm/compat/
H A Dqueue.h160 #define SLIST_FOREACH(var, head, field) \ argument
205 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
241 #define STAILQ_FOREACH(var, head, field) \ argument
275 #define STAILQ_LAST(head, type, field) \ argument
350 #define QMD_LIST_CHECK_HEAD(head, field) argument
351 #define QMD_LIST_CHECK_NEXT(elm, field) argument
352 #define QMD_LIST_CHECK_PREV(elm, field) argument
359 #define LIST_FOREACH(var, head, field) \ argument
400 #define LIST_REMOVE(elm, field) do { \ argument
449 #define TAILQ_FOREACH(var, head, field) \ argument
[all …]
/freebsd/crypto/openssh/openbsd-compat/
H A Dsys-queue.h207 #define SLIST_FOREACH(var, head, field) \ argument
234 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
238 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
281 #define LIST_FOREACH(var, head, field) \ argument
320 #define LIST_REMOVE(elm, field) do { \ argument
329 #define LIST_REPLACE(elm, elm2, field) do { \ argument
364 #define SIMPLEQ_FOREACH(var, head, field) \ argument
445 #define XSIMPLEQ_FOREACH(var, head, field) \ argument
526 #define TAILQ_PREV(elm, headname, field) \ argument
531 #define TAILQ_FOREACH(var, head, field) \ argument
[all …]
H A Dsys-tree.h82 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left 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
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
327 #define RB_SET(elm, parent, field) do { \ argument
383 #define RB_PROTOTYPE(name, type, field, cmp) \ argument
[all …]
/freebsd/contrib/ntp/sntp/libevent/compat/sys/
H A Dqueue.h111 #define SLIST_FOREACH(var, head, field) \ argument
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
133 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
162 #define LIST_FOREACH(var, head, field) \ argument
196 #define LIST_REMOVE(elm, field) do { \ argument
203 #define LIST_REPLACE(elm, elm2, field) do { \ argument
236 #define SIMPLEQ_FOREACH(var, head, field) \ argument
299 #define TAILQ_PREV(elm, headname, field) \ argument
304 #define TAILQ_FOREACH(var, head, field) \ argument
356 #define TAILQ_REMOVE(head, elm, field) do { \ argument
[all …]
/freebsd/contrib/libevent/compat/sys/
H A Dqueue.h111 #define SLIST_FOREACH(var, head, field) \ argument
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
133 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
162 #define LIST_FOREACH(var, head, field) \ argument
196 #define LIST_REMOVE(elm, field) do { \ argument
203 #define LIST_REPLACE(elm, elm2, field) do { \ argument
236 #define SIMPLEQ_FOREACH(var, head, field) \ argument
299 #define TAILQ_PREV(elm, headname, field) \ argument
304 #define TAILQ_FOREACH(var, head, field) \ argument
356 #define TAILQ_REMOVE(head, elm, field) do { \ argument
[all …]
/freebsd/contrib/ncurses/form/
H A Dfrm_driver.c481 FIELD *field; in Adjust_Cursor_Position() local
832 FIELD *field; in _nc_Position_Form_Cursor() local
875 FIELD *field; in _nc_Refresh_Current_Field() local
1089 FIELD *field, in Check_Char()
1195 Synchronize_Field(FIELD *field) in Synchronize_Field()
1437 FIELD *field = form->current; in _nc_Unset_Current_Field() local
1497 FIELD *field; in _nc_Set_Current_Field() local
1580 FIELD *field = form->current; in IFN_Next_Character() local
1651 FIELD *field = form->current; in IFN_Next_Line() local
1701 FIELD *field = form->current; in IFN_Next_Word() local
[all …]
H A Dfld_opts.c76 field_opts(const FIELD *field) in field_opts()
96 field_opts_on(FIELD *field, Field_Options opts) in field_opts_on()
124 field_opts_off(FIELD *field, Field_Options opts) in field_opts_off()
/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
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
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
320 #define RB_SET(elm, parent, field) do { \ argument
376 #define RB_PROTOTYPE(name, type, field, cmp) \ argument
[all …]
/freebsd/contrib/libevent/WIN32-Code/
H A Dtree.h75 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left 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
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
320 #define RB_SET(elm, parent, field) do { \ argument
376 #define RB_PROTOTYPE(name, type, field, cmp) \ 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
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
203 #define STAILQ_REMOVE_HEAD(head, 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()
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()
1370 char *mad_dump_val(enum MAD_FIELDS field, char *buf, int bufsz, void *val) in mad_dump_val()
[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

12345678910>>...13