Searched refs:states (Results 1 - 25 of 69) sorted by relevance

123

/freebsd-10.0-release/lib/libkse/test/
H A Dmutex_d.c162 static thread_state_t states[NUM_THREADS]; variable
288 (int) id, states[id].priority);
538 assert (states[id].status == STAT_WAITCONDVAR);
539 states[id].cmd.cmd_id = cmd;
540 states[id].cmd.mutex = NULL;
541 states[id].cmd.cond = NULL;
543 states[id].flags &= ~(FLAGS_WAS_BUSY | FLAGS_IS_BUSY);
544 assert (pthread_cond_signal (&states[id].cond_var) == 0);
553 assert (states[id].status == STAT_WAITCONDVAR);
554 states[i
[all...]
/freebsd-10.0-release/contrib/libarchive/libarchive/
H A Darchive_check_magic.c104 write_all_states(char *buff, unsigned int states) argument
111 while ((lowbit = states & (1 + ~states)) != 0) {
112 states &= ~lowbit; /* Clear the low bit. */
114 if (states != 0)
/freebsd-10.0-release/sys/dev/dpms/
H A Ddpms.c135 int error, states; local
137 error = dpms_get_supported_states(&states);
210 dpms_get_supported_states(int *states) argument
213 *states = 0;
214 return (dpms_call_bios(VBE_DPMS_GET_SUPPORTED_STATES, states));
/freebsd-10.0-release/contrib/tcpdump/
H A Dprint-hsrp.c55 /* HSRP states and associated names. */
56 static struct tok states[] = { variable in typeref:struct:tok
114 printf("state=%s ", tok2str(states, "Unknown (%d)", hp->hsrp_state));
H A Dprint-pfsync.c355 const char *states[] = PFUDPS_NAMES; local
357 printf(" %s:%s", states[src->state], states[dst->state]);
361 const char *states[] = PFOTHERS_NAMES; local
363 printf(" %s:%s", states[src->state], states[dst->state]);
/freebsd-10.0-release/sys/powerpc/cpufreq/
H A Ddfs.c144 int states; local
147 states = sc->dfs4 ? 3 : 2;
150 if (*count < states)
154 memset(sets, CPUFREQ_VAL_UNKNOWN, sizeof(*sets) * states);
160 *count = states;
/freebsd-10.0-release/gnu/usr.bin/grep/
H A Ddfa.h76 states of the DFA are those that would have
332 dfa_state *states; /* States of the dfa. */ member in struct:dfa
333 int sindex; /* Index for adding new states. */
334 int salloc; /* Number of states currently allocated. */
357 int **trans; /* Transition tables for states that can
376 #define ACCEPTING(s, r) ((r).states[s].constraint)
381 SUCCEEDS_IN_CONTEXT((dfa).states[state].constraint, \
387 #define FIRST_MATCHING_REGEXP(state, dfa) (-(dfa).states[state].first_end)
H A Ddfa.c1496 if (hash != d->states[i].hash || s->nelem != d->states[i].elems.nelem
1497 || newline != d->states[i].newline || letter != d->states[i].letter)
1501 != d->states[i].elems.elems[j].constraint
1502 || s->elems[j].index != d->states[i].elems.elems[j].index)
1509 REALLOC_IF_NECESSARY(d->states, dfa_state, d->salloc, d->sindex);
1510 d->states[i].hash = hash;
1511 MALLOC(d->states[i].elems.elems, position, s->nelem);
1512 copy(s, &d->states[
[all...]
/freebsd-10.0-release/contrib/llvm/utils/TableGen/
H A DDFAPacketizerEmitter.cpp72 // represents the possible resource states that can result from adding a L_or_M
76 // two states [0x01] and [0x10] into a DFA with a single state [0x01, 0x10].
79 // a map from inputs to new states.
103 // PossibleStates is the set of valid resource states that ensue from valid
133 // Set of states. Need to keep this sorted to emit the transition table.
135 StateSet states; member in class:__anon3660::DFA
167 DeleteContainerPointers(states);
194 // Iterate over all resource states in currentState.
258 assert(!states.count(S) && "State already exists");
259 states
[all...]
/freebsd-10.0-release/usr.sbin/bsnmpd/modules/snmp_hostres/
H A Dhostres_processor_tbl.c67 long states[MAX_CPU_SAMPLES][CPUSTATES]; member in struct:processor_entry
113 /* Sum delta for all states. */
115 delta += e->states[e->cur_sample_idx][i];
116 delta -= e->states[oldest][i];
123 usage = (double)(e->states[e->cur_sample_idx][CPUSTATES-1] -
124 e->states[oldest][CPUSTATES-1]) / delta;
144 e->states[e->cur_sample_idx][i] = cp_times[i];
/freebsd-10.0-release/contrib/libyaml/src/
H A Dparser.c375 if (!PUSH(parser, parser->states, YAML_PARSE_DOCUMENT_END_STATE))
399 if (!PUSH(parser, parser->states, YAML_PARSE_DOCUMENT_END_STATE))
452 parser->state = POP(parser, parser->states);
545 parser->state = POP(parser, parser->states);
651 parser->state = POP(parser, parser->states);
694 parser->state = POP(parser, parser->states);
749 if (!PUSH(parser, parser->states,
763 parser->state = POP(parser, parser->states);
803 if (!PUSH(parser, parser->states,
816 parser->state = POP(parser, parser->states);
[all...]
H A Demitter.c680 if (!PUSH(emitter, emitter->states, YAML_EMIT_DOCUMENT_END_STATE))
753 emitter->state = POP(emitter, emitter->states);
767 if (!PUSH(emitter, emitter->states, YAML_EMIT_FLOW_SEQUENCE_ITEM_STATE))
802 emitter->state = POP(emitter, emitter->states);
818 if (!PUSH(emitter, emitter->states,
828 if (!PUSH(emitter, emitter->states,
856 if (!PUSH(emitter, emitter->states, YAML_EMIT_FLOW_MAPPING_KEY_STATE))
879 emitter->state = POP(emitter, emitter->states);
888 if (!PUSH(emitter, emitter->states,
912 emitter->state = POP(emitter, emitter->states);
[all...]
/freebsd-10.0-release/contrib/dialog/
H A Dchecklist.c48 const char *states; member in struct:__anon797
59 const char *states,
82 states[item->state]);
111 data->states,
147 * to read the list item states back directly without putting them in the
148 * output buffer. It also provides for more than two states over which the
159 const char *states,
256 /* we need at least two states */
257 if (states == 0 || strlen(states) <
56 print_item(ALL_DATA * data, WINDOW *win, DIALOG_LISTITEM * item, const char *states, int choice, int selected) argument
152 dlg_checklist(const char *title, const char *cprompt, int height, int width, int list_height, int item_no, DIALOG_LISTITEM * items, const char *states, int flag, int *current_item) argument
[all...]
H A Dtreeview.c45 const char *states; member in struct:__anon825
55 const char *states,
79 states[item->state]);
114 data->states,
151 * to read the list item states back directly without putting them in the
162 const char *states,
213 /* we need at least two states */
214 if (states == 0 || strlen(states) < 2)
215 states
53 print_item(ALL_DATA * data, DIALOG_LISTITEM * item, const char *states, int depths, int choice, int selected) argument
155 dlg_treeview(const char *title, const char *cprompt, int height, int width, int list_height, int item_no, DIALOG_LISTITEM * items, const char *states, int *depths, int flag, int *current_item) argument
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Support/
H A Dregexec.c56 /* macros for manipulating states, small version */
57 /* FIXME: 'states' is assumed as 'long' on small version. */
59 #define states states1 macro
85 #undef states macro
105 /* macros for manipulating states, large version */
106 #define states char * macro
H A Dregengine.inc81 states st; /* current states */
82 states fresh; /* states for a fresh start */
83 states tmp; /* temporary */
84 states empty; /* empty set of states */
95 static states step(struct re_guts *, sopno, sopno, states, int, states);
[all...]
/freebsd-10.0-release/contrib/nvi/regex/
H A Dregexec.c68 /* macros for manipulating states, small version */
69 #define states int macro
96 #undef states macro
116 /* macros for manipulating states, large version */
117 #define states char * macro
H A Dengine.c83 states st; /* current states */
84 states fresh; /* states for a fresh start */
85 states tmp; /* temporary */
86 states empty; /* empty set of states */
100 static states step __P((struct re_guts *g, sopno start, sopno stop, states bef, int flag, RCHAR_T ch, states af
[all...]
/freebsd-10.0-release/lib/libc/regex/
H A Dregexec.c97 /* macros for manipulating states, small version */
98 #define states long macro
99 #define states1 states /* for later use in regexec() decision */
128 #undef states macro
150 /* macros for manipulating states, large version */
151 #define states char * macro
181 /* multibyte character & large states version */
H A Dengine.c91 states st; /* current states */
92 states fresh; /* states for a fresh start */
93 states tmp; /* temporary */
94 states empty; /* empty set of states */
109 static states step(struct re_guts *g, sopno start, sopno stop, states bef, wint_t ch, states af
[all...]
/freebsd-10.0-release/sys/dev/cxgb/ulp/iw_cxgb/
H A Diw_cxgb_cm.c89 static char *states[] = { variable
245 CTR3(KTR_IW_CXGB, "%s - %s -> %s", __FUNCTION__, states[epc->state], states[new]);
269 CTR3(KTR_IW_CXGB, "%s ep %p state %s", __FUNCTION__, epc, states[state_read(epc)]);
294 CTR4(KTR_IW_CXGB, "%s ep %p so %p state %s", __FUNCTION__, epc, epc->so, states[epc->state]);
308 CTR4(KTR_IW_CXGB, "%s ep %p so %p state %s", __FUNCTION__, epc, epc->so, states[epc->state]);
319 CTR4(KTR_IW_CXGB, "%s ep %p so %p state %s", __FUNCTION__, ep, ep->com.so, states[ep->com.state]);
445 CTR4(KTR_IW_CXGB, "%s ep %p so %p state %s", __FUNCTION__, ep, ep->com.so, states[ep->com.state]);
461 CTR4(KTR_IW_CXGB, "%s ep %p so %p state %s", __FUNCTION__, ep, ep->com.so, states[ep->com.state]);
475 CTR4(KTR_IW_CXGB, "%s ep %p so %p state %s", __FUNCTION__, ep, ep->com.so, states[e
[all...]
/freebsd-10.0-release/contrib/top/
H A Ddisplay.c431 * *_cpustates(states, names) - print the cpu state percentages
444 static char *long_tag = "CPU states: ";
463 i_cpustates(states)
465 register int *states;
493 value = *states++;
505 memcpy(lcpustates, states, num_cpustates * sizeof(int) * num_cpus);
508 u_cpustates(states)
510 register int *states;
534 if (*lp != *states)
541 value = *states;
[all...]
/freebsd-10.0-release/sbin/pfctl/
H A Dpf_print_state.c285 const char *states[] = PFUDPS_NAMES; local
287 printf(" %s:%s\n", states[src->state], states[dst->state]);
291 const char *states[] = PFOTHERS_NAMES; local
293 printf(" %s:%s\n", states[src->state], states[dst->state]);
/freebsd-10.0-release/usr.bin/bluetooth/btsockstat/
H A Dbtsockstat.c97 (((x) >= sizeof(states)/sizeof(states[0]))? "UNKNOWN" : states[(x)])
319 static char const * const states[] = { local
423 static char const * const states[] = { local
488 static char const * const states[] = { local
/freebsd-10.0-release/sys/dev/ath/ath_hal/ar5416/
H A Dar5416_misc.c621 if (check->states & dcu_chain_state) {
635 if (check->states & dcu_complete_state) {
639 if (check->states & qcu_stitch_state) {
643 if (check->states & qcu_fetch_state) {
647 if (check->states & qcu_complete_state) {
651 return (found_states == check->states);
662 .states = dcu_chain_state
669 .states = qcu_stitch_state

Completed in 291 milliseconds

123