Home
last modified time | relevance | path

Searched full:field (Results 1 – 25 of 3900) sorted by relevance

12345678910>>...156

/freebsd/sys/dev/aic7xxx/
H A Daic79xx.reg89 field DST_MODE 0x70
90 field SRC_MODE 0x07
103 field HWERRINT 0x80
104 field BRKADRINT 0x40
105 field SWTMINT 0x20
106 field PCIINT 0x10
107 field SCSIINT 0x08
108 field SEQINT 0x04
109 field CMDCMPLT 0x02
110 field SPLTINT 0x01
[all …]
H A Daic7xxx.reg58 field TEMODE 0x80
59 field ENSELO 0x40
60 field ENSELI 0x20
61 field ENRSELI 0x10
62 field ENAUTOATNO 0x08
63 field ENAUTOATNI 0x04
64 field ENAUTOATNP 0x02
65 field SCSIRSTO 0x01
75 field DFON 0x80
76 field DFPEXP 0x40
[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
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 …]
H A Dsys-queue.h205 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
207 #define SLIST_FOREACH(var, head, field) \ argument
210 (var) = SLIST_NEXT(var, field))
212 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
214 (var) && ((tvar) = SLIST_NEXT(var, field), 1); \
224 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
225 (elm)->field.sle_next = (slistelm)->field.sle_next; \
226 (slistelm)->field.sle_next = (elm); \
229 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
230 (elm)->field.sle_next = (head)->slh_first; \
[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
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/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
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/sys/sys/
H A Darb.h66 #define ARB_INIT(x, field, head, maxn) \ argument
72 ARB_ARRFOREACH_REVWCOND(x, field, head, \
73 ARB_RETURNFREE(head, x, field))
86 #define ARB_ENTRYINIT(elm, field) do { \ argument
87 (elm)->field.arbe_parent_idx = \
88 (elm)->field.arbe_left_idx = \
89 (elm)->field.arbe_right_idx = ARB_NULLIDX; \
90 (elm)->field.arbe_color = ARB_NULLCOL; \
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
[all …]
H A Dqueue.h214 #define SLIST_CONCAT(head1, head2, type, field) do { \ argument
220 while (SLIST_NEXT(curelm, field) != NULL) \
221 curelm = SLIST_NEXT(curelm, field); \
222 SLIST_NEXT(curelm, field) = SLIST_FIRST(head2); \
231 #define SLIST_FOREACH(var, head, field) \ argument
234 (var) = SLIST_NEXT((var), field))
236 #define SLIST_FOREACH_FROM(var, head, field) \ argument
239 (var) = SLIST_NEXT((var), field))
241 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
243 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
[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
99 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
100 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
104 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
105 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
106 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
110 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
111 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
[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
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/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
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/contrib/libucl/src/
H A Dtree.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/contrib/libarchive/unzip/
H A Dla_queue.h184 #define SLIST_CONCAT(head1, head2, type, field) do { \ argument
190 while (SLIST_NEXT(curelm, field) != NULL) \
191 curelm = SLIST_NEXT(curelm, field); \
192 SLIST_NEXT(curelm, field) = SLIST_FIRST(head2); \
201 #define SLIST_FOREACH(var, head, field) \ argument
204 (var) = SLIST_NEXT((var), field))
206 #define SLIST_FOREACH_FROM(var, head, field) \ argument
209 (var) = SLIST_NEXT((var), field))
211 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
213 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
[all …]
/freebsd/contrib/openbsm/compat/
H A Dqueue.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/crypto/heimdal/base/
H A Dheimqueue.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/crypto/heimdal/lib/asn1/
H A Dasn1_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/usr.sbin/bhyve/gdb/
H A Damd64.xml14 <field name="" start="22" end="31"/>
15 <field name="ID" start="21" end="21"/>
16 <field name="VIP" start="20" end="20"/>
17 <field name="VIF" start="19" end="19"/>
18 <field name="AC" start="18" end="18"/>
19 <field name="VM" start="17" end="17"/>
20 <field name="RF" start="16" end="16"/>
21 <field name="" start="15" end="15"/>
22 <field name="NT" start="14" end="14"/>
23 <field name="IOPL" start="12" end="13"/>
[all …]
/freebsd/sys/contrib/ck/include/
H A Dck_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_FROM(var, head, field) \ argument
159 (var) = CK_SLIST_NEXT((var), field))
161 #define CK_SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
163 (var) && ((tvar) = CK_SLIST_NEXT(var, field), 1); \
166 #define CK_SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
169 (varp) = &(var)->field.csle_next)
[all …]
/freebsd/contrib/ncurses/form/
H A Dllib-lformt40 FIELD **_nc_retrace_field_ptr(
41 FIELD **code)
42 { return(*(FIELD ***)0); }
45 FIELD *_nc_retrace_field(
46 FIELD *code)
47 { return(*(FIELD **)0); }
79 const FIELD *field)
86 FIELD *field,
92 const FIELD *field)
97 FIELD *field,
[all …]
H A Dllib-lform40 FIELD **_nc_retrace_field_ptr(
41 FIELD **code)
42 { return(*(FIELD ***)0); }
45 FIELD *_nc_retrace_field(
46 FIELD *code)
47 { return(*(FIELD **)0); }
79 const FIELD *field)
86 FIELD *field,
92 const FIELD *field)
97 FIELD *field,
[all …]
H A Dllib-lformtw40 FIELD **_nc_retrace_field_ptr(
41 FIELD **code)
42 { return(*(FIELD ***)0); }
45 FIELD *_nc_retrace_field(
46 FIELD *code)
47 { return(*(FIELD **)0); }
79 const FIELD *field)
86 FIELD *field,
92 const FIELD *field)
97 FIELD *field,
[all …]
H A Dllib-lformw40 FIELD **_nc_retrace_field_ptr(
41 FIELD **code)
42 { return(*(FIELD ***)0); }
45 FIELD *_nc_retrace_field(
46 FIELD *code)
47 { return(*(FIELD **)0); }
79 const FIELD *field)
86 FIELD *field,
92 const FIELD *field)
97 FIELD *field,
[all …]
H A Dform.h76 short pmin; /* index of first field on page */
77 short pmax; /* index of last field on page */
78 short smin; /* index of top leftmost field on page */
79 short smax; /* index of bottom rightmost field on page */
85 * FIELD *
98 int maxgrow; /* maximum field growth */
103 short index; /* into form -> field */
110 struct fieldnode * link; /* linked field chain */
112 struct typenode * type; /* field type */
114 FIELD_CELL * buf; /* field buffers */
[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
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/contrib/ncurses/man/
H A Dform_driver.3x78 REQ_BEG_FIELD Move to beginning of field.
80 REQ_CLR_EOF Clear to end of field from cursor.
82 REQ_CLR_FIELD Clear the entire field.
87 REQ_DOWN_CHAR Move down in field.
88 REQ_DOWN_FIELD Move down to a field.
89 REQ_END_FIELD Move to the end of field.
91 REQ_FIRST_FIELD Move to the first field.
96 REQ_LAST_FIELD Move to the last field.
97 REQ_LAST_PAGE Move to the last field.
98 REQ_LEFT_CHAR Move left in field.
[all …]

12345678910>>...156