states 100 dev/raidframe/rf_desc.h RF_AccessState_t *states; /* Array of states to be run. */ states 613 dev/raidframe/rf_driver.c RF_AccessState_t *states states 642 dev/raidframe/rf_driver.c desc->states = states; states 741 dev/raidframe/rf_driver.c flags, cbF, cbA, raidPtr->Layout.map->states); states 145 dev/raidframe/rf_layout.h RF_AccessState_t *states; states 96 dev/raidframe/rf_states.c RF_AccessState_t current_state = desc->states[current_state_index]; states 101 dev/raidframe/rf_states.c current_state = desc->states[current_state_index]; states 1629 dev/softraid.c int states[SR_MAX_STATES]; states 1639 dev/softraid.c states[i] = 0; states 1648 dev/softraid.c states[s]++; states 1651 dev/softraid.c if (states[BIOC_SDONLINE] == nd) states 1653 dev/softraid.c else if (states[BIOC_SDONLINE] == 0) states 1655 dev/softraid.c else if (states[BIOC_SDSCRUB] != 0) states 1657 dev/softraid.c else if (states[BIOC_SDREBUILD] != 0) states 1659 dev/softraid.c else if (states[BIOC_SDOFFLINE] != 0) states 164 dev/usb/umass.c char *states[TSTATE_STATES+1] = { states 1139 dev/usb/umass.c states[sc->transfer_state], xfer, usbd_errstr(err))); states 1584 dev/usb/umass.c states[sc->transfer_state], xfer, usbd_errstr(err))); states 254 net/if_pfsync.c if (!r->max_states || r->states < r->max_states) states 283 net/if_pfsync.c r->states++; states 311 net/if_pfsync.c r->states--; states 434 net/if_pfsync.c TAILQ_FOREACH(st, &sk->states, next) { states 265 net/pf.c s->rule.ptr->states++; \ states 267 net/pf.c s->anchor.ptr->states++; \ states 269 net/pf.c s->nat_rule.ptr->states++; \ states 275 net/pf.c s->nat_rule.ptr->states--; \ states 277 net/pf.c s->anchor.ptr->states--; \ states 278 net/pf.c s->rule.ptr->states--; \ states 551 net/pf.c TAILQ_FOREACH(s, &sk->states, next) states 580 net/pf.c ret = TAILQ_FIRST(&sk->states); states 584 net/pf.c TAILQ_FOREACH(s, &sk->states, next) states 777 net/pf.c (*sn)->states >= rule->max_src_states) { states 819 net/pf.c TAILQ_FOREACH(sp, &cur->states, next) states 855 net/pf.c pf_status.states++; states 874 net/pf.c pf_purge_expired_states(1 + (pf_status.states states 894 net/pf.c u_int32_t states; states 909 net/pf.c states = state->rule.ptr->states; states 913 net/pf.c states = pf_status.states; states 915 net/pf.c if (end && states > start && start < end) { states 916 net/pf.c if (states < end) states 917 net/pf.c return (state->expire + timeout * (end - states) / states 934 net/pf.c if (cur->states <= 0 && cur->expire <= time_second) { states 943 net/pf.c if (cur->rule.ptr->states <= 0 && states 968 net/pf.c if (--s->src_node->states <= 0) { states 977 net/pf.c if (--s->nat_src_node->states <= 0) { states 1021 net/pf.c if (--cur->rule.ptr->states <= 0 && states 1025 net/pf.c if (--cur->nat_rule.ptr->states <= 0 && states 1029 net/pf.c if (--cur->anchor.ptr->states <= 0) states 1038 net/pf.c pf_status.states--; states 2799 net/pf.c TAILQ_INSERT_TAIL(&sk->states, s, next); states 2801 net/pf.c TAILQ_INSERT_HEAD(&sk->states, s, next); states 2813 net/pf.c TAILQ_REMOVE(&sk->states, s, next); states 2833 net/pf.c TAILQ_INIT(&sk->states); states 3246 net/pf.c if (r->max_states && (r->states >= r->max_states)) { states 3270 net/pf.c if (sn != NULL && sn->states == 0 && sn->expire == 0) { states 3276 net/pf.c if (nsn != sn && nsn != NULL && nsn->states == 0 && states 3356 net/pf.c s->src_node->states++; states 3361 net/pf.c s->nat_src_node->states++; states 312 net/pf_ioctl.c if (rule->states <= 0) { states 328 net/pf_ioctl.c if (rule->states > 0 || rule->src_nodes > 0 || states 1151 net/pf_ioctl.c rule->states = 0; states 1398 net/pf_ioctl.c newrule->states = 0; states 1701 net/pf_ioctl.c nr = pf_status.states; states 2852 net/pf_ioctl.c n->states = 0; states 2876 net/pf_ioctl.c if (sn->states != 0) { states 2884 net/pf_ioctl.c sn->states = 0; states 538 net/pfvar.h u_int32_t states; states 640 net/pfvar.h u_int32_t states; states 712 net/pfvar.h struct pf_statelist states; states 1206 net/pfvar.h u_int32_t states;