Searched defs:states (Results 1 - 14 of 14) sorted by relevance

/external/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));
/external/bison/src/
H A Dstate.h37 state 0 and NSTATES is the number of states. (FIXME: This sentence
53 look-ahead token alone). When the states are generated, these
58 contains a vector of numbers of the states that transitions can go
59 to. The accessing_symbol fields of those states' cores say what
71 states should explicitly be errors (for implementing %nonassoc).
94 | Numbering states. |
117 state *states[1]; member in struct:__anon25
122 TRANSITIONS->states[Num]? Can be a token (amongst which the error
126 (Transitions->states[Num]->accessing_symbol)
128 /* Is the TRANSITIONS->states[Nu
[all...]
H A Dstate.c46 transitions *res = xmalloc (offsetof (transitions, states) + states_size);
48 memcpy (res->states, the_states, states_size);
66 return shifts->states[j];
254 /* Initial capacity of states hash table. */
259 /* Two states are equal if they have the same core items. */
300 | Create the states hash table. |
315 | Free the states hash table, not the states. |
355 /* All the decorated states, indexed by the state number. */
356 state **states variable
[all...]
/external/icu4c/common/
H A Dunorm_it.c37 * chars and states either use the static buffers
40 * They are parallel arrays with states[] holding the getState() values
44 uint32_t *states; member in struct:UNormIterator
49 * api.limit: one past the last valid character in chars[], but states[limit] is valid
93 uint32_t *states; local
97 states=(uint32_t *)uprv_malloc((capacity+1)*4+capacity*2);
98 if(states==NULL) {
102 chars=(UChar *)(states+(capacity+1));
113 uprv_memcpy(states+delta+start, uni->states
132 moveContentsTowardStart(UCharIterator *api, UChar chars[], uint32_t states[], int32_t delta) argument
159 moveContentsTowardEnd(UCharIterator *api, UChar chars[], uint32_t states[], int32_t delta) argument
[all...]
/external/icu4c/tools/toolutil/
H A Ducm.h103 UCMStates states; member in struct:UCMFile
175 * Check the validity of mappings against a base table's states;
237 ucm_addState(UCMStates *states, const char *s);
240 ucm_processStates(UCMStates *states);
243 ucm_countChars(UCMStates *states,
264 /* finalize and optimize states after the toUnicode mappings are processed */
266 ucm_optimizeStates(UCMStates *states,
H A Ducmstate.c154 /* adjust "final valid" states according to the state flags */
186 ucm_addState(UCMStates *states, const char *s) { argument
189 if(states->countStates==MBCS_MAX_STATE_COUNT) {
190 fprintf(stderr, "ucm error: too many states (maximum %u)\n", MBCS_MAX_STATE_COUNT);
194 error=parseState(s, states->stateTable[states->countStates],
195 &states->stateFlags[states->countStates]);
201 ++states->countStates;
207 UCMStates *states; local
332 sumUpStates(UCMStates *states) argument
424 ucm_processStates(UCMStates *states) argument
613 compactToUnicode2(UCMStates *states, uint16_t **pUnicodeCodeUnits, _MBCSToUFallback *toUFallbacks, int32_t countToUFallbacks, UBool verbose) argument
839 findUnassigned(UCMStates *states, uint16_t *unicodeCodeUnits, _MBCSToUFallback *toUFallbacks, int32_t countToUFallbacks, int32_t state, int32_t offset, uint32_t b) argument
896 compactToUnicodeHelper(UCMStates *states, uint16_t *unicodeCodeUnits, _MBCSToUFallback *toUFallbacks, int32_t countToUFallbacks) argument
922 ucm_optimizeStates(UCMStates *states, uint16_t **pUnicodeCodeUnits, _MBCSToUFallback *toUFallbacks, int32_t countToUFallbacks, UBool verbose) argument
971 ucm_countChars(UCMStates *states, const uint8_t *bytes, int32_t length) argument
[all...]
/external/icu4c/tools/makeconv/
H A Dmakeconv.c487 staticData->maxBytesPerChar=(int8_t)data->ucm->states.maxCharLength;
488 staticData->minBytesPerChar=(int8_t)data->ucm->states.minCharLength;
489 staticData->conversionType=data->ucm->states.conversionType;
537 if(data->ucm->states.outputType<0) {
538 data->ucm->states.outputType=(int8_t)data->ucm->states.maxCharLength-1;
581 baseStates=&data->ucm->states;
632 UCMStates *states, *baseStates; local
646 states=&data->ucm->states;
[all...]
H A Dgenmbcs.c38 /* toUnicode (state table in ucm->states) */
197 sum=mbcsData->ucm->states.countToUCodeUnits;
215 maxCharLength=mbcsData->ucm->states.maxCharLength;
375 if(mbcsData->ucm->states.countStates==0) {
381 if(length==2 && mbcsData->ucm->states.outputType==MBCS_OUTPUT_2_SISO) {
391 entry=mbcsData->ucm->states.stateTable[state][bytes[i++]];
452 mbcsData->ucm->states.stateTable[state][bytes[i-1]]=entry;
553 return (UBool)(1==ucm_countChars(&mbcsData->ucm->states, bytes, length));
687 maxCharLength=mbcsData->ucm->states.maxCharLength;
689 if( mbcsData->ucm->states
1326 UCMStates *states; local
[all...]
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Drmepsilon.h128 slist<StateId> visited_states_; // List of visited states
211 vector<StateId> states; local
215 states.push_back(i);
223 states.resize(order.size());
225 states[order[i]] = i;
240 states.push_back(j);
246 while (!states.empty()) {
247 StateId state = states.back();
248 states.pop_back();
281 // where V = # of states visite
[all...]
/external/opencore/protocols/systems/3g-324m_pvterminal/h223/src/
H A Dh223types.cpp350 unsigned states)
360 (states & val.second->GetState()))
369 unsigned OlcList::FindOutgoingOlcsByMtState(unsigned states, argument
378 states & val.second->GetMtState())
388 unsigned states,
400 (val.second->GetState() & states))
422 unsigned states,
432 (val.second->GetState() & states))
491 unsigned states,
503 if (states
348 HasOlcs(TPVDirection dir, PV2WayMediaType media_type, unsigned states) argument
386 FindCodecs(TPVDirection dir, PV2WayMediaType media_type, unsigned states, TPVDirection owner, Oscl_Vector<OlcFormatInfo, OsclMemAllocator>& list) argument
420 FindCodec(TPVDirection dir, PV2WayMediaType media_type, unsigned states, TPVDirection owner, OlcFormatInfo& info) argument
489 FindOlcs(TPVDirection dir, PV2WayMediaType media_type, unsigned states, Oscl_Vector<OlcParam*, OsclMemAllocator>& list) argument
[all...]
/external/libxml2/
H A Dpattern.c108 int nbState; /* number of states in the automata */
109 int maxState; /* allocated number of states */
111 int *states; /* the array of step indexes */ member in struct:_xmlStreamCtxt
147 xmlStepStatePtr states; member in struct:_xmlStepStates
460 xmlPatPushState(xmlStepStates *states, int step, xmlNodePtr node) { argument
461 if ((states->states == NULL) || (states->maxstates <= 0)) {
462 states->maxstates = 4;
463 states
497 xmlStepStates states = {0, 0, NULL}; /* // may require backtrack */ local
[all...]
H A Dxmlregexp.c227 /* knowing states ponting to us can speed things up */
255 xmlRegStatePtr *states; member in struct:_xmlAutomata
268 xmlRegStatePtr *states; member in struct:_xmlRegexp
314 * A stack of rollback states
431 ret->states = ctxt->states;
457 * 1/ counting the effective number of states left
470 if (ret->states[i] != NULL) {
478 printf("Final: %d states\n", nbstates);
557 state = ret->states[
[all...]
H A Drelaxng.c319 int nbState; /* the number of states */
372 xmlRelaxNGStatesPtr states; /* the accumulated state list */ member in struct:_xmlRelaxNGValidCtxt
374 xmlRelaxNGStatesPtr freeState; /* the pool of free valid states */
1023 xmlRngVErrMemory(ctxt, "allocating states\n");
1032 xmlRngVErrMemory(ctxt, "allocating states\n");
1042 * @states: the states container
1052 xmlRelaxNGStatesPtr states,
1058 if (states->nbState >= states
1051 xmlRelaxNGAddStatesUniq(xmlRelaxNGValidCtxtPtr ctxt, xmlRelaxNGStatesPtr states, xmlRelaxNGValidStatePtr state) argument
1089 xmlRelaxNGAddStates(xmlRelaxNGValidCtxtPtr ctxt, xmlRelaxNGStatesPtr states, xmlRelaxNGValidStatePtr state) argument
1132 xmlRelaxNGFreeStates(xmlRelaxNGValidCtxtPtr ctxt, xmlRelaxNGStatesPtr states) argument
9984 xmlRelaxNGStatesPtr states = NULL, res = NULL; local
10137 xmlRelaxNGStatesPtr states = NULL; local
10427 xmlRelaxNGStatesPtr states, res; local
[all...]
/external/iproute2/misc/
H A Dss.c101 int states; member in struct:filter
108 .states = SS_ALL & ~((1<<SS_LISTEN)|(1<<SS_CLOSE)|(1<<SS_TIME_WAIT)|(1<<SS_SYN_RECV)),
1128 if (!(f->states & (1<<state)))
1439 req.r.idiag_states = f->states;
1632 if (f->states&(1<<SS_TIME_WAIT))
1709 if (!(f->states & (1<<state)))
1878 if (!(f->states & (1<<s->state)))
2024 if (!(f->states & (1<<SS_CLOSE)))
2097 if (!(f->states & (1<<SS_CLOSE)))
2453 current_filter.states
[all...]

Completed in 217 milliseconds