| /src/usr.sbin/pf/pfs/ | 
| parse.y | 55 struct pfioc_states* states; 94 states  label
 96 	| state states  { parse_init(); }
 491 		states->ps_buf = malloc(allocated * sizeof(struct pfsync_state));
 492 		if (states->ps_buf == NULL)
 496 	if (allocated == (states->ps_len / sizeof(struct pfsync_state))) {
 499 		buf = realloc(states->ps_buf, allocated * sizeof(struct pfsync_state));
 501 			free(states->ps_buf);
 504 		states->ps_buf = buf;
 
 | 
| /src/dist/pf/sbin/pfctl/ | 
| pf_print_state.c | 257 		const char *states[] = PFUDPS_NAMES;  local in function:print_state 259 		printf("   %s:%s\n", states[src->state], states[dst->state]);
 263 		const char *states[] = PFOTHERS_NAMES;  local in function:print_state
 265 		printf("   %s:%s\n", states[src->state], states[dst->state]);
 
 | 
| /src/sys/sys/ | 
| lua.h | 56 	int num_states;		/* total number of created Lua states */ 57 	struct lua_state_info *states;  member in struct:lua_info
 
 | 
| /src/lib/libc/regex/ | 
| regexec.c | 116 /* macros for manipulating states, small version */ 117 #define	states	long  macro
 118 #define	states1	states		/* for later use in regexec() decision */
 147 #undef	states
 169 /* macros for manipulating states, large version */
 170 #define	states	char *  macro
 200 /* multibyte character & large states version */
 
 | 
| /src/sys/dev/raidframe/ | 
| rf_desc.h | 75 	int     state;		/* index into states telling how far along the 77 	const RF_AccessState_t *states;	/* array of states to be run */  member in struct:RF_RaidAccessDesc_s
 
 | 
| /src/sys/external/bsd/drm2/dist/drm/ | 
| drm_blend.c | 438 	struct drm_plane_state **states;  local in function:drm_atomic_helper_crtc_normalize_zpos 446 	states = kmalloc_array(total_planes, sizeof(*states), GFP_KERNEL);
 447 	if (!states)
 451 	 * Normalization process might create new states for planes which
 461 		states[n++] = plane_state;
 467 	sort(states, n, sizeof(*states), drm_atomic_state_zpos_cmp, NULL);
 470 		plane = states[i]->plane;
 472 		states[i]->normalized_zpos = i
 [all...]
 | 
| /src/sys/modules/examples/pollpal/ | 
| pollpal.c | 100 	/* Device can have two states 1.READ_WAITING, 2.WRITE_WAITING. */ 101 	enum states {  enum in struct:pollpal_softc
 
 | 
| /src/lib/libc/citrus/modules/ | 
| citrus_big5.c | 123 	} states;  member in struct:__anon1b0dad5e0308 127 #define _CEI_TO_STATE(_cei_, _func_)	(_cei_)->states.s_##_func_
 
 | 
| citrus_dechanyu.c | 79 	} states;  member in struct:__anon6db9c9080308 83 #define _CEI_TO_STATE(_cei_, _func_)	(_cei_)->states.__CONCAT(s_,_func_)
 
 | 
| citrus_euc.c | 115 	} states;  member in struct:__anonb37b45f40308 122 #define _CEI_TO_STATE(_cei_, _func_)	(_cei_)->states.s_##_func_
 
 | 
| citrus_euctw.c | 106 	} states;  member in struct:__anon7f8b50df0308 113 #define _CEI_TO_STATE(_cei_, _func_)	(_cei_)->states.s_##_func_
 
 | 
| citrus_gbk2k.c | 80 	} states;  member in struct:__anoned9a26680208 84 #define _CEI_TO_STATE(_cei_, _func_)	(_cei_)->states.s_##_func_
 
 | 
| citrus_johab.c | 79 	} states;  member in struct:__anonf2bf42db0308 83 #define _CEI_TO_STATE(_cei_, _func_)	(_cei_)->states.s_##_func_
 
 | 
| citrus_mskanji.c | 115 	} states;  member in struct:__anon9600ef040208 119 #define _CEI_TO_STATE(_cei_, _func_)	(_cei_)->states.s_##_func_
 
 | 
| citrus_utf8.c | 119 	} states;  member in struct:__anon48263f3e0308 123 #define _CEI_TO_STATE(_ei_, _func_)	(_ei_)->states.s_##_func_
 
 | 
| citrus_zw.c | 85 	} states;  member in struct:__anon057bdd480408 89 #define _CEI_TO_STATE(_cei_, _func_)	(_cei_)->states.s_##_func_
 
 | 
| citrus_ues.c | 76 	} states;  member in struct:__anonb4944c040308 80 #define _CEI_TO_STATE(_cei_, _func_)    (_cei_)->states.s_##_func_
 
 | 
| citrus_viqr.c | 242 	} states;  member in struct:__anon49bb59390408 246 #define _CEI_TO_STATE(_cei_, _func_)	(_cei_)->states.s_##_func_
 
 | 
| /src/sys/dev/acpi/ | 
| acpi_apm.c | 133 	const int states[] = {  local in function:get_state_value 144 	return states[id];
 
 | 
| /src/sys/external/bsd/drm2/dist/drm/amd/powerplay/hwmgr/ | 
| amdgpu_hardwaremanager.c | 68 	struct phm_set_power_state_input states;  local in function:phm_set_power_state 72 	states.pcurrent_state = pcurrent_state;
 73 	states.pnew_state = pnew_power_state;
 76 		return hwmgr->hwmgr_func->power_state_set(hwmgr, &states);
 
 | 
| /src/sys/external/isc/atheros_hal/dist/ar5416/ | 
| ar5416_misc.c | 348 	int states;  member in struct:__anoncbce8b480308 366 	if (check->states & dcu_chain_state) {
 380 	if (check->states & dcu_complete_state) {
 384 	if (check->states & qcu_stitch_state) {
 388 	if (check->states & qcu_fetch_state) {
 392 	if (check->states & qcu_complete_state) {
 396 	return (found_states == check->states);
 407 		.states			= dcu_chain_state
 414 		.states			= qcu_stitch_state
 
 | 
| /src/sys/dev/usb/ | 
| umass.c | 240 const char *states[TSTATE_STATES+1] = {  variable in typeref:typename:const char * [] 1132 	 * This is done in 3 steps, states:
 1193 	 * following states:
 1200 	 * An error in any of those states will invoke
 1299 	 * The subroutine is rather long. It steps through the states given in
 1652 	 * This is done in 3 steps, states:
 1722 	 * following states:
 1726 	 * An error in any of those states will invoke
 1801 			 * Section 2.4.3.1.1 states that the bulk in endpoints
 
 | 
| /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvkm/subdev/ | 
| clk.h | 67 	struct list_head list; /* c-states */ 92 	struct list_head states;  member in struct:nvkm_clk
 
 | 
| /src/sys/modules/lua/ | 
| lua.c | 218 	/* Traverse the list of states and close them */ 293 	struct lua_state_info *states;  local in function:luaioctl
 304 		if (info->states == NULL) {
 316 			states = kmem_alloc(sizeof(*states) * n, KM_SLEEP);
 317 			if (copyin(info->states, states, sizeof(*states) * n)
 323 					strcpy(states[n].name, s->lua_name);
 324 					strcpy(states[n].desc, s->lua_desc)
 [all...]
 | 
| /src/bin/ksh/ | 
| lex.c | 109 	Lex_state states[STATE_BSIZE], *statep;  local in function:yylex 119 	states[0].ls_state = -1;
 120 	states[0].ls_info.base = (Lex_state *) 0;
 121 	statep = &states[1];
 122 	state_info.base = states;
 123 	state_info.end = &states[STATE_BSIZE];
 553 			 * the existing states ($ and \`..` should be
 619 	if (statep != &states[1])
 
 |