field 1030 dev/acpi/dsdt.c aml_lockfield(struct aml_scope *scope, struct aml_value *field)
field 1032 dev/acpi/dsdt.c if (AML_FIELD_LOCK(field->v_field.flags) == AML_FIELD_LOCK_ON) {
field 1038 dev/acpi/dsdt.c aml_unlockfield(struct aml_scope *scope, struct aml_value *field)
field 1040 dev/acpi/dsdt.c if (AML_FIELD_LOCK(field->v_field.flags) == AML_FIELD_LOCK_ON) {
field 1072 dev/acpi/dsdt.c aml_fieldio(struct aml_scope *scope, struct aml_value *field,
field 1080 dev/acpi/dsdt.c pop = field->v_field.ref1;
field 1081 dev/acpi/dsdt.c bpos = field->v_field.bitpos;
field 1082 dev/acpi/dsdt.c blen = field->v_field.bitlen;
field 1086 dev/acpi/dsdt.c aml_nodename(field->node), bpos, blen);
field 1088 dev/acpi/dsdt.c aml_lockfield(scope, field);
field 1089 dev/acpi/dsdt.c switch (field->v_field.type) {
field 1092 dev/acpi/dsdt.c memcpy(&tf, field->v_field.ref2, sizeof(struct aml_value));
field 1101 dev/acpi/dsdt.c field->v_field.ref2->v_field.bitpos,
field 1102 dev/acpi/dsdt.c field->v_field.ref2->v_field.bitlen);
field 1110 dev/acpi/dsdt.c memcpy(&tf, field->v_field.ref2, sizeof(struct aml_value));
field 1114 dev/acpi/dsdt.c aml_setvalue(scope, pop, NULL, field->v_field.ref3);
field 1119 dev/acpi/dsdt.c field->v_field.ref2->v_field.bitpos,
field 1120 dev/acpi/dsdt.c field->v_field.ref2->v_field.bitlen);
field 1132 dev/acpi/dsdt.c switch (AML_FIELD_ACCESS(field->v_field.flags)) {
field 1151 dev/acpi/dsdt.c (field->v_field.bitlen+7)>>3, NULL);
field 1156 dev/acpi/dsdt.c aligned = (bpos == field->v_field.bitpos &&
field 1157 dev/acpi/dsdt.c blen == field->v_field.bitlen);
field 1182 dev/acpi/dsdt.c field->v_field.bitpos & mask,
field 1183 dev/acpi/dsdt.c field->v_field.bitlen);
field 1187 dev/acpi/dsdt.c field->v_field.bitpos & mask,
field 1188 dev/acpi/dsdt.c field->v_field.bitlen);
field 1192 dev/acpi/dsdt.c aml_dump((field->v_field.bitlen+7)>>3, res->v_buffer);
field 1198 dev/acpi/dsdt.c switch (AML_FIELD_UPDATE(field->v_field.flags)) {
field 1210 dev/acpi/dsdt.c aml_bufcpy(iobuf, field->v_field.bitpos & mask,
field 1211 dev/acpi/dsdt.c iobuf2, 0, field->v_field.bitlen);
field 1215 dev/acpi/dsdt.c field->v_field.bitpos & mask,
field 1216 dev/acpi/dsdt.c field->v_field.bitlen);
field 1248 dev/acpi/dsdt.c aml_unlockfield(scope, field);
field 102 dev/ic/acxvar.h #define FW_TXDESC_SETFIELD_1(sc, mb, field, val) \
field 104 dev/ic/acxvar.h (mb)->tb_fwdesc_ofs + offsetof(struct acx_fw_txdesc, field), (val))
field 105 dev/ic/acxvar.h #define FW_TXDESC_SETFIELD_2(sc, mb, field, val) \
field 107 dev/ic/acxvar.h (mb)->tb_fwdesc_ofs + offsetof(struct acx_fw_txdesc, field), (val))
field 108 dev/ic/acxvar.h #define FW_TXDESC_SETFIELD_4(sc, mb, field, val) \
field 110 dev/ic/acxvar.h (mb)->tb_fwdesc_ofs + offsetof(struct acx_fw_txdesc, field), (val))
field 112 dev/ic/acxvar.h #define FW_TXDESC_GETFIELD_1(sc, mb, field) \
field 114 dev/ic/acxvar.h (mb)->tb_fwdesc_ofs + offsetof(struct acx_fw_txdesc, field))
field 100 dev/ic/s3_617.h #define SET_FIELD(reg, field) ((reg & ~(field##_MASK)) | field)
field 101 dev/ic/s3_617.h #define GET_FIELD(reg, field) (reg & ~(field##_MASK))
field 235 dev/microcode/aic7xxx/aicasm_symbol.c int field;
field 237 dev/microcode/aic7xxx/aicasm_symbol.c field = FALSE;
field 247 dev/microcode/aic7xxx/aicasm_symbol.c field = TRUE;
field 257 dev/microcode/aic7xxx/aicasm_symbol.c || (field
field 262 dev/microcode/aic7xxx/aicasm_symbol.c || (!field && (curnode->symbol->info.rinfo->address >
field 277 dev/microcode/aic7xxx/aicasm_symbol.c if ((field
field 282 dev/microcode/aic7xxx/aicasm_symbol.c || (!field
field 525 dev/pci/bktr/bktr_core.c u_int field;
field 635 dev/pci/bktr/bktr_core.c field = ( bktr_status & BT848_INT_FIELD ) ? EVEN_F : ODD_F;
field 643 dev/pci/bktr/bktr_core.c (VBI_CAPTURE|VBI_OPEN) && (field == EVEN_F)) {
field 680 dev/pci/bktr/bktr_core.c if (( field == EVEN_F ) && ( w_field == EVEN_F ))
field 682 dev/pci/bktr/bktr_core.c else if (( field == ODD_F ) && ( req_field == ODD_F ) &&
field 685 dev/pci/bktr/bktr_core.c else if (( field == ODD_F ) && ( req_field == (ODD_F|EVEN_F) ) &&
field 688 dev/pci/bktr/bktr_core.c else if (( field == ODD_F ) && ( req_field == (ODD_F|EVEN_F) ) &&
field 970 kern/subr_userconf.c userconf_add_read(char *prompt, char field, char *dev, int len, int *val)
field 995 kern/subr_userconf.c field == 'a') {
field 113 sys/queue.h #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
field 115 sys/queue.h #define SLIST_FOREACH(var, head, field) \
field 118 sys/queue.h (var) = SLIST_NEXT(var, field))
field 120 sys/queue.h #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
field 123 sys/queue.h (varp) = &SLIST_NEXT((var), field))
field 132 sys/queue.h #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
field 133 sys/queue.h (elm)->field.sle_next = (slistelm)->field.sle_next; \
field 134 sys/queue.h (slistelm)->field.sle_next = (elm); \
field 137 sys/queue.h #define SLIST_INSERT_HEAD(head, elm, field) do { \
field 138 sys/queue.h (elm)->field.sle_next = (head)->slh_first; \
field 142 sys/queue.h #define SLIST_REMOVE_NEXT(head, elm, field) do { \
field 143 sys/queue.h (elm)->field.sle_next = (elm)->field.sle_next->field.sle_next; \
field 146 sys/queue.h #define SLIST_REMOVE_HEAD(head, field) do { \
field 147 sys/queue.h (head)->slh_first = (head)->slh_first->field.sle_next; \
field 150 sys/queue.h #define SLIST_REMOVE(head, elm, type, field) do { \
field 152 sys/queue.h SLIST_REMOVE_HEAD((head), field); \
field 156 sys/queue.h while (curelm->field.sle_next != (elm)) \
field 157 sys/queue.h curelm = curelm->field.sle_next; \
field 158 sys/queue.h curelm->field.sle_next = \
field 159 sys/queue.h curelm->field.sle_next->field.sle_next; \
field 160 sys/queue.h _Q_INVALIDATE((elm)->field.sle_next); \
field 187 sys/queue.h #define LIST_NEXT(elm, field) ((elm)->field.le_next)
field 189 sys/queue.h #define LIST_FOREACH(var, head, field) \
field 192 sys/queue.h (var) = LIST_NEXT(var, field))
field 201 sys/queue.h #define LIST_INSERT_AFTER(listelm, elm, field) do { \
field 202 sys/queue.h if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
field 203 sys/queue.h (listelm)->field.le_next->field.le_prev = \
field 204 sys/queue.h &(elm)->field.le_next; \
field 205 sys/queue.h (listelm)->field.le_next = (elm); \
field 206 sys/queue.h (elm)->field.le_prev = &(listelm)->field.le_next; \
field 209 sys/queue.h #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
field 210 sys/queue.h (elm)->field.le_prev = (listelm)->field.le_prev; \
field 211 sys/queue.h (elm)->field.le_next = (listelm); \
field 212 sys/queue.h *(listelm)->field.le_prev = (elm); \
field 213 sys/queue.h (listelm)->field.le_prev = &(elm)->field.le_next; \
field 216 sys/queue.h #define LIST_INSERT_HEAD(head, elm, field) do { \
field 217 sys/queue.h if (((elm)->field.le_next = (head)->lh_first) != NULL) \
field 218 sys/queue.h (head)->lh_first->field.le_prev = &(elm)->field.le_next;\
field 220 sys/queue.h (elm)->field.le_prev = &(head)->lh_first; \
field 223 sys/queue.h #define LIST_REMOVE(elm, field) do { \
field 224 sys/queue.h if ((elm)->field.le_next != NULL) \
field 225 sys/queue.h (elm)->field.le_next->field.le_prev = \
field 226 sys/queue.h (elm)->field.le_prev; \
field 227 sys/queue.h *(elm)->field.le_prev = (elm)->field.le_next; \
field 228 sys/queue.h _Q_INVALIDATE((elm)->field.le_prev); \
field 229 sys/queue.h _Q_INVALIDATE((elm)->field.le_next); \
field 232 sys/queue.h #define LIST_REPLACE(elm, elm2, field) do { \
field 233 sys/queue.h if (((elm2)->field.le_next = (elm)->field.le_next) != NULL) \
field 234 sys/queue.h (elm2)->field.le_next->field.le_prev = \
field 235 sys/queue.h &(elm2)->field.le_next; \
field 236 sys/queue.h (elm2)->field.le_prev = (elm)->field.le_prev; \
field 237 sys/queue.h *(elm2)->field.le_prev = (elm2); \
field 238 sys/queue.h _Q_INVALIDATE((elm)->field.le_prev); \
field 239 sys/queue.h _Q_INVALIDATE((elm)->field.le_next); \
field 265 sys/queue.h #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next)
field 267 sys/queue.h #define SIMPLEQ_FOREACH(var, head, field) \
field 270 sys/queue.h (var) = SIMPLEQ_NEXT(var, field))
field 280 sys/queue.h #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \
field 281 sys/queue.h if (((elm)->field.sqe_next = (head)->sqh_first) == NULL) \
field 282 sys/queue.h (head)->sqh_last = &(elm)->field.sqe_next; \
field 286 sys/queue.h #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \
field 287 sys/queue.h (elm)->field.sqe_next = NULL; \
field 289 sys/queue.h (head)->sqh_last = &(elm)->field.sqe_next; \
field 292 sys/queue.h #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
field 293 sys/queue.h if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\
field 294 sys/queue.h (head)->sqh_last = &(elm)->field.sqe_next; \
field 295 sys/queue.h (listelm)->field.sqe_next = (elm); \
field 298 sys/queue.h #define SIMPLEQ_REMOVE_HEAD(head, field) do { \
field 299 sys/queue.h if (((head)->sqh_first = (head)->sqh_first->field.sqe_next) == NULL) \
field 326 sys/queue.h #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
field 330 sys/queue.h #define TAILQ_PREV(elm, headname, field) \
field 331 sys/queue.h (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
field 335 sys/queue.h #define TAILQ_FOREACH(var, head, field) \
field 338 sys/queue.h (var) = TAILQ_NEXT(var, field))
field 340 sys/queue.h #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
field 343 sys/queue.h (var) = TAILQ_PREV(var, headname, field))
field 353 sys/queue.h #define TAILQ_INSERT_HEAD(head, elm, field) do { \
field 354 sys/queue.h if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
field 355 sys/queue.h (head)->tqh_first->field.tqe_prev = \
field 356 sys/queue.h &(elm)->field.tqe_next; \
field 358 sys/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \
field 360 sys/queue.h (elm)->field.tqe_prev = &(head)->tqh_first; \
field 363 sys/queue.h #define TAILQ_INSERT_TAIL(head, elm, field) do { \
field 364 sys/queue.h (elm)->field.tqe_next = NULL; \
field 365 sys/queue.h (elm)->field.tqe_prev = (head)->tqh_last; \
field 367 sys/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \
field 370 sys/queue.h #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
field 371 sys/queue.h if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
field 372 sys/queue.h (elm)->field.tqe_next->field.tqe_prev = \
field 373 sys/queue.h &(elm)->field.tqe_next; \
field 375 sys/queue.h (head)->tqh_last = &(elm)->field.tqe_next; \
field 376 sys/queue.h (listelm)->field.tqe_next = (elm); \
field 377 sys/queue.h (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \
field 380 sys/queue.h #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
field 381 sys/queue.h (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
field 382 sys/queue.h (elm)->field.tqe_next = (listelm); \
field 383 sys/queue.h *(listelm)->field.tqe_prev = (elm); \
field 384 sys/queue.h (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
field 387 sys/queue.h #define TAILQ_REMOVE(head, elm, field) do { \
field 388 sys/queue.h if (((elm)->field.tqe_next) != NULL) \
field 389 sys/queue.h (elm)->field.tqe_next->field.tqe_prev = \
field 390 sys/queue.h (elm)->field.tqe_prev; \
field 392 sys/queue.h (head)->tqh_last = (elm)->field.tqe_prev; \
field 393 sys/queue.h *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
field 394 sys/queue.h _Q_INVALIDATE((elm)->field.tqe_prev); \
field 395 sys/queue.h _Q_INVALIDATE((elm)->field.tqe_next); \
field 398 sys/queue.h #define TAILQ_REPLACE(head, elm, elm2, field) do { \
field 399 sys/queue.h if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != NULL) \
field 400 sys/queue.h (elm2)->field.tqe_next->field.tqe_prev = \
field 401 sys/queue.h &(elm2)->field.tqe_next; \
field 403 sys/queue.h (head)->tqh_last = &(elm2)->field.tqe_next; \
field 404 sys/queue.h (elm2)->field.tqe_prev = (elm)->field.tqe_prev; \
field 405 sys/queue.h *(elm2)->field.tqe_prev = (elm2); \
field 406 sys/queue.h _Q_INVALIDATE((elm)->field.tqe_prev); \
field 407 sys/queue.h _Q_INVALIDATE((elm)->field.tqe_next); \
field 434 sys/queue.h #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next)
field 435 sys/queue.h #define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev)
field 439 sys/queue.h #define CIRCLEQ_FOREACH(var, head, field) \
field 442 sys/queue.h (var) = CIRCLEQ_NEXT(var, field))
field 444 sys/queue.h #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \
field 447 sys/queue.h (var) = CIRCLEQ_PREV(var, field))
field 457 sys/queue.h #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \
field 458 sys/queue.h (elm)->field.cqe_next = (listelm)->field.cqe_next; \
field 459 sys/queue.h (elm)->field.cqe_prev = (listelm); \
field 460 sys/queue.h if ((listelm)->field.cqe_next == CIRCLEQ_END(head)) \
field 463 sys/queue.h (listelm)->field.cqe_next->field.cqe_prev = (elm); \
field 464 sys/queue.h (listelm)->field.cqe_next = (elm); \
field 467 sys/queue.h #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \
field 468 sys/queue.h (elm)->field.cqe_next = (listelm); \
field 469 sys/queue.h (elm)->field.cqe_prev = (listelm)->field.cqe_prev; \
field 470 sys/queue.h if ((listelm)->field.cqe_prev == CIRCLEQ_END(head)) \
field 473 sys/queue.h (listelm)->field.cqe_prev->field.cqe_next = (elm); \
field 474 sys/queue.h (listelm)->field.cqe_prev = (elm); \
field 477 sys/queue.h #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \
field 478 sys/queue.h (elm)->field.cqe_next = (head)->cqh_first; \
field 479 sys/queue.h (elm)->field.cqe_prev = CIRCLEQ_END(head); \
field 483 sys/queue.h (head)->cqh_first->field.cqe_prev = (elm); \
field 487 sys/queue.h #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \
field 488 sys/queue.h (elm)->field.cqe_next = CIRCLEQ_END(head); \
field 489 sys/queue.h (elm)->field.cqe_prev = (head)->cqh_last; \
field 493 sys/queue.h (head)->cqh_last->field.cqe_next = (elm); \
field 497 sys/queue.h #define CIRCLEQ_REMOVE(head, elm, field) do { \
field 498 sys/queue.h if ((elm)->field.cqe_next == CIRCLEQ_END(head)) \
field 499 sys/queue.h (head)->cqh_last = (elm)->field.cqe_prev; \
field 501 sys/queue.h (elm)->field.cqe_next->field.cqe_prev = \
field 502 sys/queue.h (elm)->field.cqe_prev; \
field 503 sys/queue.h if ((elm)->field.cqe_prev == CIRCLEQ_END(head)) \
field 504 sys/queue.h (head)->cqh_first = (elm)->field.cqe_next; \
field 506 sys/queue.h (elm)->field.cqe_prev->field.cqe_next = \
field 507 sys/queue.h (elm)->field.cqe_next; \
field 508 sys/queue.h _Q_INVALIDATE((elm)->field.cqe_prev); \
field 509 sys/queue.h _Q_INVALIDATE((elm)->field.cqe_next); \
field 512 sys/queue.h #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \
field 513 sys/queue.h if (((elm2)->field.cqe_next = (elm)->field.cqe_next) == \
field 517 sys/queue.h (elm2)->field.cqe_next->field.cqe_prev = (elm2); \
field 518 sys/queue.h if (((elm2)->field.cqe_prev = (elm)->field.cqe_prev) == \
field 522 sys/queue.h (elm2)->field.cqe_prev->field.cqe_next = (elm2); \
field 523 sys/queue.h _Q_INVALIDATE((elm)->field.cqe_prev); \
field 524 sys/queue.h _Q_INVALIDATE((elm)->field.cqe_next); \
field 75 sys/tree.h #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
field 76 sys/tree.h #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
field 81 sys/tree.h #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
field 82 sys/tree.h SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
field 83 sys/tree.h SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
field 87 sys/tree.h #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
field 88 sys/tree.h SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
field 89 sys/tree.h SPLAY_LEFT(tmp, field) = (head)->sph_root; \
field 93 sys/tree.h #define SPLAY_LINKLEFT(head, tmp, field) do { \
field 94 sys/tree.h SPLAY_LEFT(tmp, field) = (head)->sph_root; \
field 96 sys/tree.h (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
field 99 sys/tree.h #define SPLAY_LINKRIGHT(head, tmp, field) do { \
field 100 sys/tree.h SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
field 102 sys/tree.h (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
field 105 sys/tree.h #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \
field 106 sys/tree.h SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
field 107 sys/tree.h SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
field 108 sys/tree.h SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
field 109 sys/tree.h SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
field 114 sys/tree.h #define SPLAY_PROTOTYPE(name, type, field, cmp) \
field 136 sys/tree.h if (SPLAY_RIGHT(elm, field) != NULL) { \
field 137 sys/tree.h elm = SPLAY_RIGHT(elm, field); \
field 138 sys/tree.h while (SPLAY_LEFT(elm, field) != NULL) { \
field 139 sys/tree.h elm = SPLAY_LEFT(elm, field); \
field 156 sys/tree.h #define SPLAY_GENERATE(name, type, field, cmp) \
field 161 sys/tree.h SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = NULL; \
field 167 sys/tree.h SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\
field 168 sys/tree.h SPLAY_RIGHT(elm, field) = (head)->sph_root; \
field 169 sys/tree.h SPLAY_LEFT((head)->sph_root, field) = NULL; \
field 171 sys/tree.h SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\
field 172 sys/tree.h SPLAY_LEFT(elm, field) = (head)->sph_root; \
field 173 sys/tree.h SPLAY_RIGHT((head)->sph_root, field) = NULL; \
field 189 sys/tree.h if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \
field 190 sys/tree.h (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
field 192 sys/tree.h __tmp = SPLAY_RIGHT((head)->sph_root, field); \
field 193 sys/tree.h (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
field 195 sys/tree.h SPLAY_RIGHT((head)->sph_root, field) = __tmp; \
field 208 sys/tree.h SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
field 213 sys/tree.h __tmp = SPLAY_LEFT((head)->sph_root, field); \
field 217 sys/tree.h SPLAY_ROTATE_RIGHT(head, __tmp, field); \
field 218 sys/tree.h if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
field 221 sys/tree.h SPLAY_LINKLEFT(head, __right, field); \
field 223 sys/tree.h __tmp = SPLAY_RIGHT((head)->sph_root, field); \
field 227 sys/tree.h SPLAY_ROTATE_LEFT(head, __tmp, field); \
field 228 sys/tree.h if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
field 231 sys/tree.h SPLAY_LINKRIGHT(head, __left, field); \
field 234 sys/tree.h SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
field 244 sys/tree.h SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
field 249 sys/tree.h __tmp = SPLAY_LEFT((head)->sph_root, field); \
field 253 sys/tree.h SPLAY_ROTATE_RIGHT(head, __tmp, field); \
field 254 sys/tree.h if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
field 257 sys/tree.h SPLAY_LINKLEFT(head, __right, field); \
field 259 sys/tree.h __tmp = SPLAY_RIGHT((head)->sph_root, field); \
field 263 sys/tree.h SPLAY_ROTATE_LEFT(head, __tmp, field); \
field 264 sys/tree.h if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
field 267 sys/tree.h SPLAY_LINKRIGHT(head, __left, field); \
field 270 sys/tree.h SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
field 313 sys/tree.h #define RB_LEFT(elm, field) (elm)->field.rbe_left
field 314 sys/tree.h #define RB_RIGHT(elm, field) (elm)->field.rbe_right
field 315 sys/tree.h #define RB_PARENT(elm, field) (elm)->field.rbe_parent
field 316 sys/tree.h #define RB_COLOR(elm, field) (elm)->field.rbe_color
field 320 sys/tree.h #define RB_SET(elm, parent, field) do { \
field 321 sys/tree.h RB_PARENT(elm, field) = parent; \
field 322 sys/tree.h RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
field 323 sys/tree.h RB_COLOR(elm, field) = RB_RED; \
field 326 sys/tree.h #define RB_SET_BLACKRED(black, red, field) do { \
field 327 sys/tree.h RB_COLOR(black, field) = RB_BLACK; \
field 328 sys/tree.h RB_COLOR(red, field) = RB_RED; \
field 335 sys/tree.h #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \
field 336 sys/tree.h (tmp) = RB_RIGHT(elm, field); \
field 337 sys/tree.h if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field))) { \
field 338 sys/tree.h RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \
field 341 sys/tree.h if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \
field 342 sys/tree.h if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
field 343 sys/tree.h RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
field 345 sys/tree.h RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
field 348 sys/tree.h RB_LEFT(tmp, field) = (elm); \
field 349 sys/tree.h RB_PARENT(elm, field) = (tmp); \
field 351 sys/tree.h if ((RB_PARENT(tmp, field))) \
field 352 sys/tree.h RB_AUGMENT(RB_PARENT(tmp, field)); \
field 355 sys/tree.h #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \
field 356 sys/tree.h (tmp) = RB_LEFT(elm, field); \
field 357 sys/tree.h if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field))) { \
field 358 sys/tree.h RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \
field 361 sys/tree.h if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \
field 362 sys/tree.h if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
field 363 sys/tree.h RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
field 365 sys/tree.h RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
field 368 sys/tree.h RB_RIGHT(tmp, field) = (elm); \
field 369 sys/tree.h RB_PARENT(elm, field) = (tmp); \
field 371 sys/tree.h if ((RB_PARENT(tmp, field))) \
field 372 sys/tree.h RB_AUGMENT(RB_PARENT(tmp, field)); \
field 376 sys/tree.h #define RB_PROTOTYPE(name, type, field, cmp) \
field 389 sys/tree.h #define RB_GENERATE(name, type, field, cmp) \
field 394 sys/tree.h while ((parent = RB_PARENT(elm, field)) && \
field 395 sys/tree.h RB_COLOR(parent, field) == RB_RED) { \
field 396 sys/tree.h gparent = RB_PARENT(parent, field); \
field 397 sys/tree.h if (parent == RB_LEFT(gparent, field)) { \
field 398 sys/tree.h tmp = RB_RIGHT(gparent, field); \
field 399 sys/tree.h if (tmp && RB_COLOR(tmp, field) == RB_RED) { \
field 400 sys/tree.h RB_COLOR(tmp, field) = RB_BLACK; \
field 401 sys/tree.h RB_SET_BLACKRED(parent, gparent, field);\
field 405 sys/tree.h if (RB_RIGHT(parent, field) == elm) { \
field 406 sys/tree.h RB_ROTATE_LEFT(head, parent, tmp, field);\
field 411 sys/tree.h RB_SET_BLACKRED(parent, gparent, field); \
field 412 sys/tree.h RB_ROTATE_RIGHT(head, gparent, tmp, field); \
field 414 sys/tree.h tmp = RB_LEFT(gparent, field); \
field 415 sys/tree.h if (tmp && RB_COLOR(tmp, field) == RB_RED) { \
field 416 sys/tree.h RB_COLOR(tmp, field) = RB_BLACK; \
field 417 sys/tree.h RB_SET_BLACKRED(parent, gparent, field);\
field 421 sys/tree.h if (RB_LEFT(parent, field) == elm) { \
field 422 sys/tree.h RB_ROTATE_RIGHT(head, parent, tmp, field);\
field 427 sys/tree.h RB_SET_BLACKRED(parent, gparent, field); \
field 428 sys/tree.h RB_ROTATE_LEFT(head, gparent, tmp, field); \
field 431 sys/tree.h RB_COLOR(head->rbh_root, field) = RB_BLACK; \
field 438 sys/tree.h while ((elm == NULL || RB_COLOR(elm, field) == RB_BLACK) && \
field 440 sys/tree.h if (RB_LEFT(parent, field) == elm) { \
field 441 sys/tree.h tmp = RB_RIGHT(parent, field); \
field 442 sys/tree.h if (RB_COLOR(tmp, field) == RB_RED) { \
field 443 sys/tree.h RB_SET_BLACKRED(tmp, parent, field); \
field 444 sys/tree.h RB_ROTATE_LEFT(head, parent, tmp, field);\
field 445 sys/tree.h tmp = RB_RIGHT(parent, field); \
field 447 sys/tree.h if ((RB_LEFT(tmp, field) == NULL || \
field 448 sys/tree.h RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
field 449 sys/tree.h (RB_RIGHT(tmp, field) == NULL || \
field 450 sys/tree.h RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
field 451 sys/tree.h RB_COLOR(tmp, field) = RB_RED; \
field 453 sys/tree.h parent = RB_PARENT(elm, field); \
field 455 sys/tree.h if (RB_RIGHT(tmp, field) == NULL || \
field 456 sys/tree.h RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK) {\
field 458 sys/tree.h if ((oleft = RB_LEFT(tmp, field)))\
field 459 sys/tree.h RB_COLOR(oleft, field) = RB_BLACK;\
field 460 sys/tree.h RB_COLOR(tmp, field) = RB_RED; \
field 461 sys/tree.h RB_ROTATE_RIGHT(head, tmp, oleft, field);\
field 462 sys/tree.h tmp = RB_RIGHT(parent, field); \
field 464 sys/tree.h RB_COLOR(tmp, field) = RB_COLOR(parent, field);\
field 465 sys/tree.h RB_COLOR(parent, field) = RB_BLACK; \
field 466 sys/tree.h if (RB_RIGHT(tmp, field)) \
field 467 sys/tree.h RB_COLOR(RB_RIGHT(tmp, field), field) = RB_BLACK;\
field 468 sys/tree.h RB_ROTATE_LEFT(head, parent, tmp, field);\
field 473 sys/tree.h tmp = RB_LEFT(parent, field); \
field 474 sys/tree.h if (RB_COLOR(tmp, field) == RB_RED) { \
field 475 sys/tree.h RB_SET_BLACKRED(tmp, parent, field); \
field 476 sys/tree.h RB_ROTATE_RIGHT(head, parent, tmp, field);\
field 477 sys/tree.h tmp = RB_LEFT(parent, field); \
field 479 sys/tree.h if ((RB_LEFT(tmp, field) == NULL || \
field 480 sys/tree.h RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
field 481 sys/tree.h (RB_RIGHT(tmp, field) == NULL || \
field 482 sys/tree.h RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
field 483 sys/tree.h RB_COLOR(tmp, field) = RB_RED; \
field 485 sys/tree.h parent = RB_PARENT(elm, field); \
field 487 sys/tree.h if (RB_LEFT(tmp, field) == NULL || \
field 488 sys/tree.h RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) {\
field 490 sys/tree.h if ((oright = RB_RIGHT(tmp, field)))\
field 491 sys/tree.h RB_COLOR(oright, field) = RB_BLACK;\
field 492 sys/tree.h RB_COLOR(tmp, field) = RB_RED; \
field 493 sys/tree.h RB_ROTATE_LEFT(head, tmp, oright, field);\
field 494 sys/tree.h tmp = RB_LEFT(parent, field); \
field 496 sys/tree.h RB_COLOR(tmp, field) = RB_COLOR(parent, field);\
field 497 sys/tree.h RB_COLOR(parent, field) = RB_BLACK; \
field 498 sys/tree.h if (RB_LEFT(tmp, field)) \
field 499 sys/tree.h RB_COLOR(RB_LEFT(tmp, field), field) = RB_BLACK;\
field 500 sys/tree.h RB_ROTATE_RIGHT(head, parent, tmp, field);\
field 507 sys/tree.h RB_COLOR(elm, field) = RB_BLACK; \
field 515 sys/tree.h if (RB_LEFT(elm, field) == NULL) \
field 516 sys/tree.h child = RB_RIGHT(elm, field); \
field 517 sys/tree.h else if (RB_RIGHT(elm, field) == NULL) \
field 518 sys/tree.h child = RB_LEFT(elm, field); \
field 521 sys/tree.h elm = RB_RIGHT(elm, field); \
field 522 sys/tree.h while ((left = RB_LEFT(elm, field))) \
field 524 sys/tree.h child = RB_RIGHT(elm, field); \
field 525 sys/tree.h parent = RB_PARENT(elm, field); \
field 526 sys/tree.h color = RB_COLOR(elm, field); \
field 528 sys/tree.h RB_PARENT(child, field) = parent; \
field 530 sys/tree.h if (RB_LEFT(parent, field) == elm) \
field 531 sys/tree.h RB_LEFT(parent, field) = child; \
field 533 sys/tree.h RB_RIGHT(parent, field) = child; \
field 537 sys/tree.h if (RB_PARENT(elm, field) == old) \
field 539 sys/tree.h (elm)->field = (old)->field; \
field 540 sys/tree.h if (RB_PARENT(old, field)) { \
field 541 sys/tree.h if (RB_LEFT(RB_PARENT(old, field), field) == old)\
field 542 sys/tree.h RB_LEFT(RB_PARENT(old, field), field) = elm;\
field 544 sys/tree.h RB_RIGHT(RB_PARENT(old, field), field) = elm;\
field 545 sys/tree.h RB_AUGMENT(RB_PARENT(old, field)); \
field 548 sys/tree.h RB_PARENT(RB_LEFT(old, field), field) = elm; \
field 549 sys/tree.h if (RB_RIGHT(old, field)) \
field 550 sys/tree.h RB_PARENT(RB_RIGHT(old, field), field) = elm; \
field 555 sys/tree.h } while ((left = RB_PARENT(left, field))); \
field 559 sys/tree.h parent = RB_PARENT(elm, field); \
field 560 sys/tree.h color = RB_COLOR(elm, field); \
field 562 sys/tree.h RB_PARENT(child, field) = parent; \
field 564 sys/tree.h if (RB_LEFT(parent, field) == elm) \
field 565 sys/tree.h RB_LEFT(parent, field) = child; \
field 567 sys/tree.h RB_RIGHT(parent, field) = child; \
field 589 sys/tree.h tmp = RB_LEFT(tmp, field); \
field 591 sys/tree.h tmp = RB_RIGHT(tmp, field); \
field 595 sys/tree.h RB_SET(elm, parent, field); \
field 598 sys/tree.h RB_LEFT(parent, field) = elm; \
field 600 sys/tree.h RB_RIGHT(parent, field) = elm; \
field 617 sys/tree.h tmp = RB_LEFT(tmp, field); \
field 619 sys/tree.h tmp = RB_RIGHT(tmp, field); \
field 629 sys/tree.h if (RB_RIGHT(elm, field)) { \
field 630 sys/tree.h elm = RB_RIGHT(elm, field); \
field 631 sys/tree.h while (RB_LEFT(elm, field)) \
field 632 sys/tree.h elm = RB_LEFT(elm, field); \
field 634 sys/tree.h if (RB_PARENT(elm, field) && \
field 635 sys/tree.h (elm == RB_LEFT(RB_PARENT(elm, field), field))) \
field 636 sys/tree.h elm = RB_PARENT(elm, field); \
field 638 sys/tree.h while (RB_PARENT(elm, field) && \
field 639 sys/tree.h (elm == RB_RIGHT(RB_PARENT(elm, field), field)))\
field 640 sys/tree.h elm = RB_PARENT(elm, field); \
field 641 sys/tree.h elm = RB_PARENT(elm, field); \
field 655 sys/tree.h tmp = RB_LEFT(tmp, field); \
field 657 sys/tree.h tmp = RB_RIGHT(tmp, field); \
field 319 sys/vnode.h #define VOPARG_OFFSET(p_type,field) \
field 320 sys/vnode.h ((int) (((char *) (&(((p_type)NULL)->field))) - ((char *) NULL)))
field 321 sys/vnode.h #define VOPARG_OFFSETOF(s_type,field) \
field 322 sys/vnode.h VOPARG_OFFSET(s_type*,field)
field 1923 ufs/ffs/ffs_alloc.c int blk, field, subfield, pos;
field 1959 ufs/ffs/ffs_alloc.c field = around[allocsiz];
field 1962 ufs/ffs/ffs_alloc.c if ((blk & field) == subfield)
field 1964 ufs/ffs/ffs_alloc.c field <<= 1;
field 99 ufs/ffs/ffs_subr.c int field, subfield;
field 107 ufs/ffs/ffs_subr.c field = around[siz];
field 110 ufs/ffs/ffs_subr.c if ((fragmap & field) == subfield) {
field 113 ufs/ffs/ffs_subr.c field <<= siz;
field 116 ufs/ffs/ffs_subr.c field <<= 1;
field 264 ufs/ufs/inode.h #define DIP(ip, field) \
field 266 ufs/ufs/inode.h (ip)->i_ffs1_##field : (ip)->i_ffs2_##field)
field 268 ufs/ufs/inode.h #define DIP_ASSIGN(ip, field, value) \
field 271 ufs/ufs/inode.h (ip)->i_ffs1_##field = (value); \
field 273 ufs/ufs/inode.h (ip)->i_ffs2_##field = (value); \
field 276 ufs/ufs/inode.h #define DIP_ADD(ip, field, value) \
field 279 ufs/ufs/inode.h (ip)->i_ffs1_##field += (value); \
field 281 ufs/ufs/inode.h (ip)->i_ffs2_##field += (value); \
field 65 xfs/xfs_queue.h #define NNPQUEUE_INSERT_HEAD(head, elm, field) do { \
field 66 xfs/xfs_queue.h if (((elm)->field.nnpq_next = (head)->nnpq_first) != NULL) \
field 67 xfs/xfs_queue.h (head)->nnpq_first->field.nnpq_prev = \
field 68 xfs/xfs_queue.h &(elm)->field.nnpq_next; \
field 70 xfs/xfs_queue.h (head)->nnpq_last = &(elm)->field.nnpq_next; \
field 72 xfs/xfs_queue.h (elm)->field.nnpq_prev = &(head)->nnpq_first; \
field 76 xfs/xfs_queue.h #define NNPQUEUE_REMOVE(elm,head,field) do { \
field 77 xfs/xfs_queue.h if (((elm)->field.nnpq_next) != NULL) \
field 78 xfs/xfs_queue.h (elm)->field.nnpq_next->field.nnpq_prev = \
field 79 xfs/xfs_queue.h (elm)->field.nnpq_prev; \
field 81 xfs/xfs_queue.h (head)->nnpq_last = (elm)->field.nnpq_prev; \
field 82 xfs/xfs_queue.h *(elm)->field.nnpq_prev = (elm)->field.nnpq_next; \
field 86 xfs/xfs_queue.h #define NNPQUEUE_FOREACH(var,head,field) \
field 89 xfs/xfs_queue.h (var) = ((var)->field.nnpq_next))