Home
last modified time | relevance | path

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

12345678910>>...45

/freebsd-11-stable/contrib/ntp/sntp/libevent/compat/sys/
HDqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
111 #define SLIST_FOREACH(var, head, field) \ argument
114 (var) = SLIST_NEXT(var, field))
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
124 (elm)->field.sle_next = (slistelm)->field.sle_next; \
125 (slistelm)->field.sle_next = (elm); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
129 (elm)->field.sle_next = (head)->slh_first; \
133 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
134 (head)->slh_first = (head)->slh_first->field.sle_next; \
[all …]
/freebsd-11-stable/contrib/ntp/sntp/libevent/WIN32-Code/
HDtree.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
82 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
83 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
87 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
88 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
89 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
93 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
94 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
[all …]
/freebsd-11-stable/crypto/openssh/openbsd-compat/
HDsys-queue.h198 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
200 #define SLIST_FOREACH(var, head, field) \ argument
203 (var) = SLIST_NEXT(var, field))
205 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
207 (var) && ((tvar) = SLIST_NEXT(var, field), 1); \
217 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
218 (elm)->field.sle_next = (slistelm)->field.sle_next; \
219 (slistelm)->field.sle_next = (elm); \
222 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
223 (elm)->field.sle_next = (head)->slh_first; \
[all …]
HDsys-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
89 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
90 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
94 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
95 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
96 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
100 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
101 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
[all …]
/freebsd-11-stable/sys/sys/
HDtree.h80 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
81 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
86 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
87 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
88 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
92 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
93 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
94 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
98 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
99 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
[all …]
HDqueue.h191 #define SLIST_CONCAT(head1, head2, type, field) do { \ argument
197 while (SLIST_NEXT(curelm, field) != NULL) \
198 curelm = SLIST_NEXT(curelm, field); \
199 SLIST_NEXT(curelm, field) = SLIST_FIRST(head2); \
208 #define SLIST_FOREACH(var, head, field) \ argument
211 (var) = SLIST_NEXT((var), field))
213 #define SLIST_FOREACH_FROM(var, head, field) \ argument
216 (var) = SLIST_NEXT((var), field))
218 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
220 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
[all …]
/freebsd-11-stable/contrib/ipfilter/sys/
HDtree.h78 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
79 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right 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; \
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; \
96 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
97 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
[all …]
/freebsd-11-stable/contrib/openbsm/compat/
HDqueue.h160 #define SLIST_FOREACH(var, head, field) \ argument
163 (var) = SLIST_NEXT((var), field))
165 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
167 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
170 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
173 (varp) = &SLIST_NEXT((var), field))
179 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
180 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
181 SLIST_NEXT((slistelm), field) = (elm); \
184 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
/freebsd-11-stable/contrib/libucl/src/
HDtree.h70 #define TREE_DELTA(self, field) \ argument
71 (( (((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))
76 #define TREE_DEFINE(node, field) \ argument
78 static struct node *_HU_FUNCTION(TREE_BALANCE_##node##_##field)(struct node *); \
80 static struct node *_HU_FUNCTION(TREE_ROTL_##node##_##field)(struct node *self) \
82 struct node *r= self->field.avl_right; \
83 self->field.avl_right= r->field.avl_left; \
84 r->field.avl_left= TREE_BALANCE_##node##_##field(self); \
85 return TREE_BALANCE_##node##_##field(r); \
[all …]
/freebsd-11-stable/crypto/heimdal/base/
HDheimqueue.h59 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \ argument
61 (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
63 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \ argument
66 #define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field) \ argument
67 if ((elm)->field.tqe_next && \
68 (elm)->field.tqe_next->field.tqe_prev != \
69 &(elm)->field.tqe_next) \
71 if (*(elm)->field.tqe_prev != (elm)) \
73 #define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) \ argument
74 if ((elm)->field.tqe_next == NULL && \
[all …]
/freebsd-11-stable/crypto/heimdal/lib/asn1/
HDasn1_queue.h59 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \ argument
61 (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
63 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \ argument
66 #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) \ argument
67 if ((elm)->field.tqe_next && \
68 (elm)->field.tqe_next->field.tqe_prev != \
69 &(elm)->field.tqe_next) \
71 if (*(elm)->field.tqe_prev != (elm)) \
73 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) \ argument
74 if ((elm)->field.tqe_next == NULL && \
[all …]
/freebsd-11-stable/sys/contrib/ck/include/
HDck_queue.h148 #define CK_SLIST_NEXT(elm, field) \ argument
149 ck_pr_load_ptr(&((elm)->field.csle_next))
151 #define CK_SLIST_FOREACH(var, head, field) \ argument
154 (var) = CK_SLIST_NEXT((var), field))
156 #define CK_SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
158 (var) && (ck_pr_fence_load(), (tvar) = CK_SLIST_NEXT(var, field), 1);\
161 #define CK_SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
164 (varp) = &(var)->field.csle_next)
171 #define CK_SLIST_INSERT_AFTER(a, b, field) do { \ argument
172 (b)->field.csle_next = (a)->field.csle_next; \
[all …]
/freebsd-11-stable/contrib/ncurses/form/
HDfrm_driver.c131 #define Position_Of_Row_In_Buffer(field,row) ((row)*(field)->dcols) argument
134 #define Address_Of_Nth_Buffer(field,N) \ argument
135 ((field)->buf + (N)*(1+Buffer_Length(field)))
138 #define Address_Of_Row_In_Nth_Buffer(field,N,row) \ argument
139 (Address_Of_Nth_Buffer(field,N) + Position_Of_Row_In_Buffer(field,row))
142 #define Address_Of_Row_In_Buffer(field,row) \ argument
143 Address_Of_Row_In_Nth_Buffer(field,0,row)
167 #define Is_Scroll_Field(field) \ argument
168 (((field)->drows > (field)->rows) || \
169 ((field)->dcols > (field)->cols))
[all …]
HDfld_link.c52 link_field(FIELD *field, int frow, int fcol) in NCURSES_EXPORT()
57 T((T_CALLED("link_field(%p,%d,%d)"), (void *)field, frow, fcol)); in NCURSES_EXPORT()
58 if (field && (frow >= 0) && (fcol >= 0) && in NCURSES_EXPORT()
67 New_Field->link = field->link; in NCURSES_EXPORT()
68 field->link = New_Field; in NCURSES_EXPORT()
70 New_Field->buf = field->buf; in NCURSES_EXPORT()
71 New_Field->rows = field->rows; in NCURSES_EXPORT()
72 New_Field->cols = field->cols; in NCURSES_EXPORT()
73 New_Field->nrow = field->nrow; in NCURSES_EXPORT()
74 New_Field->nbuf = field->nbuf; in NCURSES_EXPORT()
[all …]
/freebsd-11-stable/contrib/sendmail/include/sm/
HDtailq.h77 #define SM_TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
81 #define SM_TAILQ_PREV(elm, headname, field) \ argument
82 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
86 #define SM_TAILQ_FOREACH(var, head, field) \ argument
89 (var) = SM_TAILQ_NEXT(var, field))
91 #define SM_TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
94 (var) = SM_TAILQ_PREV(var, headname, field))
104 #define SM_TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
105 if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
106 (head)->tqh_first->field.tqe_prev = \
[all …]
/freebsd-11-stable/sys/dev/aic7xxx/
HDaic79xx.reg91 field DST_MODE 0x70
92 field SRC_MODE 0x07
105 field HWERRINT 0x80
106 field BRKADRINT 0x40
107 field SWTMINT 0x20
108 field PCIINT 0x10
109 field SCSIINT 0x08
110 field SEQINT 0x04
111 field CMDCMPLT 0x02
112 field SPLTINT 0x01
[all …]
HDaic7xxx.reg60 field TEMODE 0x80
61 field ENSELO 0x40
62 field ENSELI 0x20
63 field ENRSELI 0x10
64 field ENAUTOATNO 0x08
65 field ENAUTOATNI 0x04
66 field ENAUTOATNP 0x02
67 field SCSIRSTO 0x01
77 field DFON 0x80
78 field DFPEXP 0x40
[all …]
/freebsd-11-stable/contrib/groff/src/utils/afmtodit/
HDafmtodit.pl6091 my @field = split(' ');
6092 next if $#field < 0;
6093 if ($field[0] eq "FontName") {
6094 $psname = $field[1];
6096 elsif($field[0] eq "ItalicAngle") {
6097 $italic_angle = -$field[1];
6099 elsif ($field[0] eq "KPX") {
6100 if ($#field == 3) {
6101 push(@kern1, $field[1]);
6102 push(@kern2, $field[2]);
[all …]
/freebsd-11-stable/usr.sbin/nscd/
HDhashtable.h75 #define HASHTABLE_INIT(table, type, field, _entries_size) \ argument
82 (table)->entries[var].field.capacity = \
84 (table)->entries[var].field.size = 0; \
85 (table)->entries[var].field.values = malloc( \
88 assert((table)->entries[var].field.values != NULL);\
95 #define HASHTABLE_DESTROY(table, field) \ argument
99 free((table)->entries[var].field.values); \
117 #define HASHTABLE_ENTRY_FOREACH(entry, field, var) \ argument
118 for ((var) = &((entry)->field.values[0]); \
119 (var) < &((entry)->field.values[(entry)->field.size]); \
[all …]
/freebsd-11-stable/contrib/libxo/xolint/
HDxolint.pl345 my(@field) = @_;
346 print "checking field: [" . join("][", @field) . "]\n" if $opt_debug;
348 if ($field[0] =~ /,/) {
350 my @parts = split(/,/, $field[0]);
371 $field[4] = substr($field[0], index($field[0], ","));
372 $field[0] = $parts[0] . $new;
376 $vocabulary{$field[1]} = 1
377 if $field[1] && $field[0] !~ /[DELNPTUW\[\]]/;
388 if $last =~ /[DELNPTUVW\[\]]/ && $field[0] !~ /[DELNPTUVW\[\]]/;
395 my $cf = count_args($field[2]);
[all …]
/freebsd-11-stable/contrib/elftoolchain/common/
HD_elftc.h80 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
82 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
87 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
89 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
132 #define STAILQ_FOREACH(var, head, field) \ argument
135 (var) = ((var)->field.stqe_next))
139 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
141 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
153 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
154 if (((elm)->field.stqe_next = (head)->stqh_first) == NULL) \
[all …]
/freebsd-11-stable/sys/dev/bnxt/
HDconvert_hsi.pl189 my $field=shift;
201 …T "\tRTE_LOG(DEBUG, PMD, \" % *s = 0x%%08\"PRIX32\"\\n\", data->$field);\n",$max_field_len,$field;
204 …T "\tRTE_LOG(DEBUG, PMD, \" % *s = 0x%%04\"PRIX16\"\\n\", data->$field);\n",$max_field_len,$field;
207 …UT "\tRTE_LOG(DEBUG, PMD, \" % *s = 0x%%02\"PRIX8\"\\n\", data->$field);\n",$max_field_len,$field;
210 … "\tRTE_LOG(DEBUG, PMD, \" % *s = 0x%%016\"PRIX64\"\\n\", data->$field);\n",$max_field_len,$field;
213 if ($field =~ s/\[([0-9]+)\]//) {
214 …OUT "\tRTE_LOG(DEBUG, PMD, \" % *s = \\\"%%.$1s\\\"\\n\", data->$field);\n",$max_field_len,$field;
217 …UT "\tRTE_LOG(DEBUG, PMD, \" % *s = 0x%%02\"PRIX8\"\\n\", data->$field);\n",$max_field_len,$field;
224 my $macro_prefix = uc($name).'_'.uc($field).'_';
226 $macro_prefix =~ s/FLAGS_TYPE_$/FLAGS_/ if ($field eq 'flags_type');
[all …]
/freebsd-11-stable/sys/dev/mlx5/mlx5_ib/
HDmlx5_ib_cong.c40 #define MLX5_IB_INDEX(field) ( \ argument
41 (__offsetof(struct mlx5_ib_congestion, field) - \
43 #define MLX5_IB_FLD_MAX(type, field) ((1ULL << __mlx5_bit_sz(type, field)) - 1ULL) argument
44 #define MLX5_IB_SET_CLIPPED(type, ptr, field, var) do { \ argument
46 if ((var) > MLX5_IB_FLD_MAX(type, field)) \
47 (var) = MLX5_IB_FLD_MAX(type, field); \
49 MLX5_SET(type, ptr, field, var); \
92 mlx5_get_cc_param_val(void *field, u32 index) in mlx5_get_cc_param_val() argument
97 return MLX5_GET(cong_control_r_roce_ecn_rp, field, in mlx5_get_cc_param_val()
100 return MLX5_GET(cong_control_r_roce_ecn_rp, field, in mlx5_get_cc_param_val()
[all …]
/freebsd-11-stable/contrib/groff/tmac/
HDhyphenex.pl49 @field = split(' ');
50 if ($field[0] eq "\\1" || $field[0] eq "\\4") {
51 print " $field[2]\n";
53 elsif ($field[0] eq "\\2" || $field[0] eq "\\5") {
54 print " $field[2]\n";
56 @suffix_list = split(/,/, "$field[3]");
58 print " $field[2]$suffix\n";
61 elsif ($field[0] eq "\\3" || $field[0] eq "\\6") {
63 @suffix_list = split(/,/, "$field[3],$field[4]");
65 print " $field[2]$suffix\n";
[all …]
/freebsd-11-stable/crypto/heimdal/lib/gssapi/mech/
HDmechqueue.h60 #define HEIM_SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
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 { \ argument
66 (elm)->field.sle_next = (head)->slh_first; \
70 #define HEIM_SLIST_REMOVE_HEAD(head, field) do { \ argument
71 (head)->slh_first = (head)->slh_first->field.sle_next; \
74 #define HEIM_SLIST_REMOVE(head, elm, type, field) do { \ argument
76 HEIM_SLIST_REMOVE_HEAD((head), field); \
80 while(curelm->field.sle_next != (elm)) \
[all …]

12345678910>>...45