Home
last modified time | relevance | path

Searched refs:field (Results 1 – 25 of 1121) sorted by relevance

12345678910>>...45

/freebsd/contrib/ntp/sntp/libevent/compat/sys/
H A Dqueue.h176 (listelm)->field.le_next->field.le_prev = \
183 (elm)->field.le_prev = (listelm)->field.le_prev; \
198 (elm)->field.le_next->field.le_prev = \
200 *(elm)->field.le_prev = (elm)->field.le_next; \
205 (elm2)->field.le_next->field.le_prev = \
207 (elm2)->field.le_prev = (elm)->field.le_prev; \
341 (elm)->field.tqe_next->field.tqe_prev = \
358 (elm)->field.tqe_next->field.tqe_prev = \
367 (elm2)->field.tqe_next->field.tqe_prev = \
466 (elm)->field.cqe_next->field.cqe_prev = \
[all …]
/freebsd/contrib/libevent/compat/sys/
H A Dqueue.h176 (listelm)->field.le_next->field.le_prev = \
183 (elm)->field.le_prev = (listelm)->field.le_prev; \
198 (elm)->field.le_next->field.le_prev = \
200 *(elm)->field.le_prev = (elm)->field.le_next; \
205 (elm2)->field.le_next->field.le_prev = \
207 (elm2)->field.le_prev = (elm)->field.le_prev; \
341 (elm)->field.tqe_next->field.tqe_prev = \
358 (elm)->field.tqe_next->field.tqe_prev = \
367 (elm2)->field.tqe_next->field.tqe_prev = \
466 (elm)->field.cqe_next->field.cqe_prev = \
[all …]
/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
313 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
338 RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \
343 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
363 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
539 (elm)->field = (old)->field; \
542 RB_LEFT(RB_PARENT(old, field), field) = elm;\
544 RB_RIGHT(RB_PARENT(old, field), field) = elm;\
548 RB_PARENT(RB_LEFT(old, field), field) = elm; \
[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
313 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
338 RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \
343 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
363 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
539 (elm)->field = (old)->field; \
542 RB_LEFT(RB_PARENT(old, field), field) = elm;\
544 RB_RIGHT(RB_PARENT(old, field), field) = elm;\
548 RB_PARENT(RB_LEFT(old, field), field) = elm; \
[all …]
/freebsd/sys/sys/
H A Dqueue.h270 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
287 SLIST_NEXT(SLIST_NEXT(elm, field), field); \
500 LIST_NEXT((elm), field)->field.le_prev != \
568 LIST_NEXT((listelm), field)->field.le_prev = \
576 (elm)->field.le_prev = (listelm)->field.le_prev; \
590 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
606 LIST_NEXT((elm), field)->field.le_prev = \
620 LIST_NEXT((elm2), field)->field.le_prev = \
622 (elm2)->field.le_prev = (elm)->field.le_prev; \
794 TAILQ_NEXT((elm), field)->field.tqe_prev = \
[all …]
H A Darb.h119 #define ARB_COLOR(elm, field) (elm)->field.arbe_color argument
148 ARB_RIGHTIDX(elm, field) = ARB_LEFTIDX(tmp, field); \
150 ARB_PARENTIDX(ARB_LEFT(head, tmp, field), field) = \
157 ARB_LEFTIDX(ARB_PARENT(head, elm, field), field)) \
176 ARB_LEFTIDX(elm, field) = ARB_RIGHTIDX(tmp, field); \
178 ARB_PARENTIDX(ARB_RIGHT(head, tmp, field), field) = \
468 (elm)->field = (old)->field; \
480 ARB_PARENTIDX(ARB_LEFT(head, old, field), field) = \
631 elm, field), field))) \
656 field), field))) \
[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
332 #define _RB_LINK(elm, dir, field) (elm)->field.rbe_link[dir] argument
333 #define _RB_UP(elm, field) _RB_LINK(elm, 0, field) argument
342 #define RB_PARENT(elm, field) _RB_PTR(_RB_UP(elm, field)) argument
343 #define RB_LEFT(elm, field) _RB_LINK(elm, _RB_L, field) argument
344 #define RB_RIGHT(elm, field) _RB_LINK(elm, _RB_R, field) argument
355 RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
402 RB_SET_PARENT(_RB_LINK(tmp, dir, field), elm, field); \
914 (elm == RB_RIGHT(RB_PARENT(elm, field), field))) \
[all …]
/freebsd/crypto/openssh/openbsd-compat/
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
320 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
345 RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \
350 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
370 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
556 (elm)->field = (old)->field; \
559 RB_LEFT(RB_PARENT(old, field), field) = elm;\
561 RB_RIGHT(RB_PARENT(old, field), field) = elm;\
565 RB_PARENT(RB_LEFT(old, field), field) = elm; \
[all …]
H A Dsys-queue.h235 (elm)->field.sle_next = (elm)->field.sle_next->field.sle_next; \
251 curelm->field.sle_next->field.sle_next; \
300 (listelm)->field.le_next->field.le_prev = \
322 (elm)->field.le_next->field.le_prev = \
324 *(elm)->field.le_prev = (elm)->field.le_next; \
331 (elm2)->field.le_next->field.le_prev = \
406 if (((elm)->field.sqe_next = (elm)->field.sqe_next->field.sqe_next) \
492 (elm)->field.sqx_next)->field.sqx_next) \
581 (elm)->field.tqe_next->field.tqe_prev = \
598 (elm)->field.tqe_next->field.tqe_prev = \
[all …]
/freebsd/contrib/openbsm/compat/
H A Dqueue.h189 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
200 SLIST_NEXT(SLIST_NEXT(curelm, field), field); \
340 LIST_NEXT((elm), field)->field.le_prev != \
376 LIST_NEXT((listelm), field)->field.le_prev = \
384 (elm)->field.le_prev = (listelm)->field.le_prev; \
398 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
404 LIST_NEXT((elm), field)->field.le_prev = \
406 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
477 TAILQ_NEXT((elm), field)->field.tqe_prev = \
490 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
[all …]
/freebsd/contrib/libucl/src/
H A Dtree.h71 (( (((self)->field.avl_left) ? (self)->field.avl_left->field.avl_height : 0)) \
72 - (((self)->field.avl_right) ? (self)->field.avl_right->field.avl_height : 0))
83 self->field.avl_right= r->field.avl_left; \
91 self->field.avl_left= l->field.avl_right; \
103 self->field.avl_right= TREE_ROTR_##node##_##field(self->field.avl_right); \
109 self->field.avl_left= TREE_ROTL_##node##_##field(self->field.avl_left); \
113 if (self->field.avl_left && (self->field.avl_left->field.avl_height > self->field.avl_height)) \
114 self->field.avl_height= self->field.avl_left->field.avl_height; \
115 … if (self->field.avl_right && (self->field.avl_right->field.avl_height > self->field.avl_height)) \
116 self->field.avl_height= self->field.avl_right->field.avl_height; \
[all …]
/freebsd/contrib/libarchive/unzip/
H A Dla_queue.h240 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
258 SLIST_NEXT(SLIST_NEXT(elm, field), field); \
464 LIST_NEXT((elm), field)->field.le_prev != \
532 LIST_NEXT((listelm), field)->field.le_prev = \
540 (elm)->field.le_prev = (listelm)->field.le_prev; \
554 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
567 LIST_NEXT((elm), field)->field.le_prev = \
569 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
653 TAILQ_NEXT((elm), field)->field.tqe_prev != \
738 TAILQ_NEXT((elm), field)->field.tqe_prev = \
[all …]
/freebsd/crypto/heimdal/base/
H A Dheimqueue.h68 (elm)->field.tqe_next->field.tqe_prev != \
69 &(elm)->field.tqe_next) \
115 if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
116 (elm)->field.tqe_next->field.tqe_prev = \
121 (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \
126 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
129 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
136 (elm)->field.tqe_next->field.tqe_prev = \
137 (elm)->field.tqe_prev; \
140 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
[all …]
/freebsd/crypto/heimdal/lib/asn1/
H A Dasn1_queue.h68 (elm)->field.tqe_next->field.tqe_prev != \
69 &(elm)->field.tqe_next) \
115 if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
116 (elm)->field.tqe_next->field.tqe_prev = \
121 (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \
126 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
129 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
136 (elm)->field.tqe_next->field.tqe_prev = \
137 (elm)->field.tqe_prev; \
140 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
[all …]
/freebsd/sys/contrib/ck/include/
H A Dck_queue.h177 (b)->field.csle_next = (a)->field.csle_next; \
196 (elm)->field.csle_next->field.csle_next); \
288 (elm)->field.cstqe_next = (tqelm)->field.cstqe_next; \
326 (elm)->field.cstqe_next->field.cstqe_next); \
403 (elm)->field.cle_next = (listelm)->field.cle_next; \
404 (elm)->field.cle_prev = &(listelm)->field.cle_next; \
407 (listelm)->field.cle_next->field.cle_prev = &(elm)->field.cle_next;\
412 (elm)->field.cle_prev = (listelm)->field.cle_prev; \
416 (listelm)->field.cle_prev = &(elm)->field.cle_next; \
423 (head)->clh_first->field.cle_prev = &(elm)->field.cle_next; \
[all …]
/freebsd/contrib/sendmail/include/sm/
H A Dtailq.h77 #define SM_TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
122 if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
123 (elm)->field.tqe_next->field.tqe_prev = \
128 (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \
132 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
135 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
140 (elm)->field.tqe_next->field.tqe_prev = \
144 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
148 if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != NULL) \
149 (elm2)->field.tqe_next->field.tqe_prev = \
[all …]
/freebsd/contrib/ncurses/form/
H A Dfrm_driver.c170 ((field)->dcols > (field)->cols))
654 if (field && Growable(field)) in Field_Grown()
756 if (field != field->link) in Field_Grown()
914 field->cols + field->fcol - 1, in _nc_Refresh_Current_Field()
922 if (field->drows > field->rows) in _nc_Refresh_Current_Field()
975 field->cols + field->fcol - 1, in _nc_Refresh_Current_Field()
1146 field->rows, field->cols, field->frow, field->fcol); in Display_Or_Erase_Field()
1309 field->frow, field->fcol, in _nc_Synchronize_Attributes()
1466 field->cols + field->fcol - 1, in _nc_Unset_Current_Field()
1527 field->rows, field->cols, field->frow, field->fcol); in _nc_Set_Current_Field()
[all …]
H A Dfld_link.c68 New_Field->link = field->link; in FORM_EXPORT()
69 field->link = New_Field; in FORM_EXPORT()
71 New_Field->buf = field->buf; in FORM_EXPORT()
72 New_Field->rows = field->rows; in FORM_EXPORT()
73 New_Field->cols = field->cols; in FORM_EXPORT()
74 New_Field->nrow = field->nrow; in FORM_EXPORT()
75 New_Field->nbuf = field->nbuf; in FORM_EXPORT()
79 New_Field->just = field->just; in FORM_EXPORT()
80 New_Field->fore = field->fore; in FORM_EXPORT()
81 New_Field->back = field->back; in FORM_EXPORT()
[all …]
/freebsd/sys/dev/aic7xxx/
H A Daic79xx.reg120 field {
621 field RDY 0x01
1087 field DPE 0x80
1088 field SSE 0x40
1089 field RMA 0x20
1090 field RTA 0x10
1094 field DPR 0x01
1104 field DPE 0x80
1105 field SSE 0x40
1106 field RMA 0x20
[all …]
H A Daic7xxx.reg75 field DFON 0x80
107 field CDI 0x80
108 field IOI 0x40
109 field MSGI 0x20
110 field ATNI 0x10
111 field SELI 0x08
112 field BSYI 0x04
113 field REQI 0x02
114 field ACKI 0x01
138 field CDO 0x80
[all …]
/freebsd/usr.sbin/nscd/
H A Dhashtable.h117 (var) < &((entry)->field.values[(entry)->field.size]); \
121 ((entry)->field.size = 0)
124 ((entry)->field.size)
127 ((entry)->field.capacity)
131 (entry)->field.capacity *= 2; \
132 (entry)->field.values = realloc((entry)->field.values, \
139 (entry)->field.values = realloc((entry)->field.values, \
167 if (the_entry->field.size == the_entry->field.capacity) \
170 memcpy(&(the_entry->field.values[the_entry->field.size++]), \
173 qsort(the_entry->field.values, the_entry->field.size, \
[all …]
/freebsd/contrib/libxo/xolint/
H A Dxolint.pl347 my(@field) = @_;
373 $field[4] = substr($field[0], index($field[0], ","));
379 if $field[1] && $field[0] !~ /[DELNPTUW\[\]]/;
428 if $field[3];
443 if $field[1] && $field[2];
448 if ($field[1]) {
516 if (length($field[0]) == 0 || $field[0] =~ /V/) {
526 unless $field[1];
606 if $field[1] && $field[1] !~ /^-?\d+$/ ;
616 if $field[2] && $field[2] ne "%d";
[all …]
/freebsd/contrib/elftoolchain/common/
H A D_elftc.h135 (var) = ((var)->field.stqe_next))
162 (elm)->field.stqe_next = NULL; \
170 if (((elm)->field.stqe_next = (listelm)->field.stqe_next) == NULL)\
184 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
196 curelm->field.stqe_next->field.stqe_next) == NULL) \
243 _q = STAILQ_NEXT(_q, field); \
245 field); \
249 _p = STAILQ_NEXT(_p, field); \
254 _p = STAILQ_NEXT(_p, field); \
259 _q = STAILQ_NEXT(_q, field); \
[all …]
/freebsd/sys/dev/bnxt/bnxt_en/
H A Dconvert_hsi.pl182 my $field=shift;
200 …UT "\tRTE_LOG(DEBUG, PMD, \" % *s = 0x%%02\"PRIX8\"\\n\", data->$field);\n",$max_field_len,$field;
206 if ($field =~ s/\[([0-9]+)\]//) {
261 next if ($extra_field eq $field);
262 if ($extra_field =~ /^$field/) {
322 foreach my $field (@fields) {
323 if ($field =~ /\[([0-9]+)\]/) {
324 if ($type{$field} eq 'char') {
325 print_single_val($field, $type{$field}, $max_field_len, $name, \%macros, \@macros, \@fields);
329 my $item = $field;
[all …]
/freebsd/crypto/heimdal/lib/gssapi/mech/
H A Dmechqueue.h61 (elm)->field.sle_next = (slistelm)->field.sle_next; \
62 (slistelm)->field.sle_next = (elm); \
66 (elm)->field.sle_next = (head)->slh_first; \
70 #define HEIM_SLIST_REMOVE_HEAD(head, field) do { \ argument
76 HEIM_SLIST_REMOVE_HEAD((head), field); \
80 while(curelm->field.sle_next != (elm)) \
81 curelm = curelm->field.sle_next; \
82 curelm->field.sle_next = \
83 curelm->field.sle_next->field.sle_next; \
87 #define HEIM_SLIST_FOREACH(var, head, field) \ argument
[all …]

12345678910>>...45