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

12

/external/chromium/third_party/icu/source/tools/toolutil/
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...]
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,
/external/icu4c/tools/toolutil/
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, UBool ignoreSISOCheck) argument
614 compactToUnicode2(UCMStates *states, uint16_t **pUnicodeCodeUnits, _MBCSToUFallback *toUFallbacks, int32_t countToUFallbacks, UBool verbose) argument
840 findUnassigned(UCMStates *states, uint16_t *unicodeCodeUnits, _MBCSToUFallback *toUFallbacks, int32_t countToUFallbacks, int32_t state, int32_t offset, uint32_t b) argument
897 compactToUnicodeHelper(UCMStates *states, uint16_t *unicodeCodeUnits, _MBCSToUFallback *toUFallbacks, int32_t countToUFallbacks) argument
923 ucm_optimizeStates(UCMStates *states, uint16_t **pUnicodeCodeUnits, _MBCSToUFallback *toUFallbacks, int32_t countToUFallbacks, UBool verbose) argument
972 ucm_countChars(UCMStates *states, const uint8_t *bytes, int32_t length) argument
[all...]
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, UBool ignoreSISOCheck);
243 ucm_countChars(UCMStates *states,
264 /* finalize and optimize states after the toUnicode mappings are processed */
266 ucm_optimizeStates(UCMStates *states,
/external/webkit/WebCore/inspector/front-end/
H A DStatusBarButton.js31 WebInspector.StatusBarButton = function(title, className, states)
45 this.states = states;
46 if (!states)
47 this.states = 2;
49 if (states == 2)
101 if (this.states === 2) {
118 if (this.states !== 2)
119 throw("Only used toggled when there are 2 states, otherwise, use state");
125 if (this.states !
[all...]
/external/chromium/third_party/icu/source/i18n/
H A Dregexcst.pl30 $states{"pop"} = 255; # Add the "pop" to the list of defined state names.
63 if ($states{$state_name} != 0) {
66 $states{$state_name} = $num_states;
162 # We read all states first, before writing anything, so that the state numbers
163 # for the destination states are all available to be written.
185 # Check that all of the destination states have been defined
188 $states{"exit"} = 0; # Predefined state name, terminates state machine.
190 if ($states{$state_dest_state[$state]} == 0 && $state_dest_state[$state] ne "exit") {
194 if ($state_push_state[$state] ne "" && $states{$state_push_state[$state]} == 0) {
278 print " {doNOP, 0, 0, 0, TRUE}\n"; # State 0 is a dummy. Real states star
[all...]
/external/icu4c/i18n/
H A Dregexcst.pl30 $states{"pop"} = 255; # Add the "pop" to the list of defined state names.
63 if ($states{$state_name} != 0) {
66 $states{$state_name} = $num_states;
162 # We read all states first, before writing anything, so that the state numbers
163 # for the destination states are all available to be written.
185 # Check that all of the destination states have been defined
188 $states{"exit"} = 0; # Predefined state name, terminates state machine.
190 if ($states{$state_dest_state[$state]} == 0 && $state_dest_state[$state] ne "exit") {
194 if ($state_push_state[$state] ne "" && $states{$state_push_state[$state]} == 0) {
278 print " {doNOP, 0, 0, 0, TRUE}\n"; # State 0 is a dummy. Real states star
[all...]
/external/chromium/third_party/icu/source/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...]
H A Drbbicst.pl29 $states{"pop"} = 255; # Add the "pop" to the list of defined state names.
62 if ($states{$state_name} != 0) {
65 $states{$state_name} = $num_states;
161 # We read all states first, before writing anything, so that the state numbers
162 # for the destination states are all available to be written.
184 # Check that all of the destination states have been defined
187 $states{"exit"} = 0; # Predefined state name, terminates state machine.
189 if ($states{$state_dest_state[$state]} == 0 && $state_dest_state[$state] ne "exit") {
193 if ($state_push_state[$state] ne "" && $states{$state_push_state[$state]} == 0) {
302 print " $states{
[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...]
H A Drbbicst.pl29 $states{"pop"} = 255; # Add the "pop" to the list of defined state names.
62 if ($states{$state_name} != 0) {
65 $states{$state_name} = $num_states;
161 # We read all states first, before writing anything, so that the state numbers
162 # for the destination states are all available to be written.
184 # Check that all of the destination states have been defined
187 $states{"exit"} = 0; # Predefined state name, terminates state machine.
189 if ($states{$state_dest_state[$state]} == 0 && $state_dest_state[$state] ne "exit") {
193 if ($state_push_state[$state] ne "" && $states{$state_push_state[$state]} == 0) {
302 print " $states{
[all...]
/external/webkit/WebCore/platform/chromium/
H A DThemeChromiumMac.mm241 static void updateStates(NSCell* cell, ControlStates states)
247 bool pressed = states & PressedState;
253 bool enabled = states & EnabledState;
259 bool focused = states & FocusState;
265 bool indeterminate = (states & IndeterminateState);
266 bool checked = states & CheckedState;
273 bool windowInactive = (states & WindowInactiveState);
326 static NSButtonCell *checkbox(ControlStates states, const IntRect& zoomedRect, float zoomFactor)
340 // Update the various states we respond to.
341 updateStates(checkboxCell, states);
[all...]
/external/webkit/WebCore/platform/mac/
H A DThemeMac.mm95 static void updateStates(NSCell* cell, ControlStates states)
101 bool pressed = states & PressedState;
107 bool enabled = states & EnabledState;
113 bool focused = states & FocusState;
119 bool indeterminate = (states & IndeterminateState);
120 bool checked = states & CheckedState;
176 static NSButtonCell *checkbox(ControlStates states, const IntRect& zoomedRect, float zoomFactor)
190 // Update the various states we respond to.
191 updateStates(checkboxCell, states);
197 static void paintCheckbox(ControlStates states, GraphicsContex
[all...]
/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 Dlalr.c90 transitions *sp = states[s]->transitions;
124 transitions *sp = states[s]->transitions;
130 to_state[k] = sp->states[i]->number;
183 transitions *sp = states[stateno]->transitions;
241 symbol_number symbol1 = states[to_state[i]]->accessing_symbol;
249 state *s = states[from_state[i]];
383 nLA += state_look_ahead_tokens_count (states[i]);
395 int count = state_look_ahead_tokens_count (states[i]);
398 states[i]->reductions->look_ahead_tokens = pLA;
417 reductions *reds = states[
[all...]
H A Dconflicts.c302 | and flag as inconsistent the states that still have conflicts. |
319 set_conflicts (states[i], errors);
321 /* For uniformity of the code, make sure all the states have a valid
323 if (!states[i]->errs)
324 states[i]->errs = errs_new (0, 0);
411 | Output the detailed description of states with conflicts. |
421 state *s = states[i];
452 count += count_sr_conflicts (states[i]);
453 count += count_rr_conflicts (states[i], false);
484 src_total += count_sr_conflicts (states[
[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/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 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/bluetooth/glib/docs/reference/glib/
H A DMakefile.am53 mainloop-states.gif
79 mainloop-states.fig \
80 mainloop-states.png \
81 mainloop-states.eps \
/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/chromium/third_party/icu/source/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/icu4c/tools/makeconv/
H A Dmakeconv.c495 staticData->maxBytesPerChar=(int8_t)data->ucm->states.maxCharLength;
496 staticData->minBytesPerChar=(int8_t)data->ucm->states.minCharLength;
497 staticData->conversionType=data->ucm->states.conversionType;
545 if(data->ucm->states.outputType<0) {
546 data->ucm->states.outputType=(int8_t)data->ucm->states.maxCharLength-1;
589 baseStates=&data->ucm->states;
640 UCMStates *states, *baseStates; local
654 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...]

Completed in 1982 milliseconds

12