/external/aac/libSBRenc/src/ |
H A D | resampler.h | 108 FIXP_BQS states[MAXNR_SECTIONS+1][2]; /*! state buffer */ member in struct:__anon259
|
/external/webkit/Source/WebCore/platform/android/ |
H A D | PlatformTouchEventAndroid.cpp | 41 PlatformTouchEvent::PlatformTouchEvent(const Vector<int>& ids, const Vector<IntPoint>& windowPoints, TouchEventType type, const Vector<PlatformTouchPoint::State>& states, int metaState) argument 49 m_touchPoints.append(PlatformTouchPoint(ids[c], windowPoints[c], states[c]));
|
/external/tcpdump/ |
H A D | print-hsrp.c | 55 /* 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 D | state.h | 37 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:__anon335 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 D | state.c | 46 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/hyphenation/ |
H A D | hyphen.h | 74 HyphenState *states; member in struct:_HyphenDict
|
/external/jmonkeyengine/engine/src/core/com/jme3/app/state/ |
H A D | AppStateManager.java | 69 * List holding the attached app states that are pending
71 * the running app states.
76 * Holds the active states once they are initialized.
78 private final SafeArrayList<AppState> states = new SafeArrayList<AppState>(AppState.class);
field in class:AppStateManager 81 * List holding the detached app states that are pending
87 // synchronized separately.... but always on the states list. This
99 synchronized (states){
105 synchronized (states){
111 synchronized (states){
112 return states [all...] |
/external/jmonkeyengine/engine/src/test/jme3test/input/combomoves/ |
H A D | ComboMove.java | 67 private List<ComboMoveState> states = new ArrayList<ComboMoveState>(); field in class:ComboMove 125 states.add(new ComboMoveState(pressed, unpressed, timeElapsed)); 132 return states.get(num); 136 return states.size();
|
/external/llvm/lib/Support/ |
H A D | regexec.c | 56 /* 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
|
/external/webkit/Source/WebCore/platform/chromium/ |
H A D | PlatformThemeChromiumGtk.cpp | 100 void PlatformThemeChromiumGtk::paintArrowButton(GraphicsContext* gc, const IntRect& rect, ArrowDirection direction, ControlStates states) argument 118 if (states & PressedState) { 122 } else if (states & HoverState) { 184 if (states & EnabledState && !(states & ReadOnlyState))
|
/external/icu4c/common/ |
H A D | unorm_it.c | 37 * 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 D | ucm.h | 103 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,
|
H A D | ucmstate.c | 154 /* 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...] |
/external/llvm/utils/TableGen/ |
H A D | DFAPacketizerEmitter.cpp | 72 // 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:__anon9316::DFA 167 DeleteContainerPointers(states); 194 // Iterate over all resource states in currentState. 258 assert(!states.count(S) && "State already exists"); 259 states [all...] |
/external/icu4c/tools/makeconv/ |
H A D | makeconv.c | 495 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 D | genmbcs.c | 38 /* 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/openfst/src/include/fst/ |
H A D | const-fst.h | 19 // Simple concrete immutable FST whose states and arcs are each stored 130 // Byte alignment for states and arcs in file format (version 1 only) 135 StateId nstates_; // Number of states 167 // Count # of states and arcs. 327 // before writing to compute number of states and arcs. 368 size_t pos = 0, states = 0; local 378 states++; 380 hdr.SetNumStates(states); 383 LOG(ERROR) << "Could not align file during write after writing states"; 402 LOG(ERROR) << "Inconsistent number of states observe [all...] |
H A D | rmepsilon.h | 146 slist<StateId> visited_states_; // List of visited states 255 vector<StateId> states; local 256 states.reserve(fst->NumStates()); 260 states.push_back(i); 272 states.resize(order.size()); 274 states[order[i]] = i; 289 states.push_back(j); 295 while (!states.empty()) { 296 StateId state = states.back(); 297 states [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | DecisionProbe.java | 60 * is represented internall with a DFA comprised of multiple states, each of 63 * Because of this, you need to iterate over this list of DFA states. You'll 66 * will be one of the iterated states from stateToSyntacticallyAmbiguousAltsSet. 74 /** Track all DFA states with nondeterministic alternatives. 113 /** The set of states w/o emanating edges and w/o resolving sem preds. */ 189 /** If no states are dead-ends, no alts are unreachable, there are 230 /** How many states does the DFA predictor have? */ 238 * conflict resolution or alts w/o accept states). 244 /** return set of states w/o emanating edges and w/o resolving sem preds. 245 * These states com 710 reachesState(DFAState startState, DFAState targetState, Set states) argument 772 getSampleInputSequenceUsingStateSet(State startState, State targetState, Set states, List<Label> labels) argument [all...] |
H A D | DFA.java | 54 /** Prevent explosion of DFA states during conversion. The max number 55 * of states per alt in a single decision's DFA. 79 /** A set of all uniquely-numbered DFA states. Maps hash of DFAState 81 * existing DFA states. Map<DFAState,DFAState>. Use Map so 84 * a dup of states array. 90 * states, but the states are not unique. s3 might be same as s1 so 92 * then these states will all be unique as states[i] always points 99 protected Vector<DFAState> states field in class:DFA [all...] |
/external/chromium/testing/gmock/src/ |
H A D | gmock-spec-builders.cc | 567 StateMap& states() { return states_; } function in class:__anon3128::MockObjectRegistry 634 g_mock_object_registry.states()[mock_obj].leakable = true; 662 if (g_mock_object_registry.states().count(mock_obj) == 0) { 671 g_mock_object_registry.states()[mock_obj].function_mockers; 689 g_mock_object_registry.states()[mock_obj].function_mockers.insert(mocker); 699 MockObjectState& state = g_mock_object_registry.states()[mock_obj]; 723 g_mock_object_registry.states().begin(); 724 it != g_mock_object_registry.states().end(); ++it) { 729 g_mock_object_registry.states().erase(it); 741 if (g_mock_object_registry.states() [all...] |
/external/libppp/src/ |
H A D | datalink.c | 1255 static const char * const states[] = { variable 1273 if (dl->state >= sizeof states / sizeof states[0]) 1275 return states[dl->state]; 1282 if (state < sizeof states / sizeof states[0]) { 1284 states[state]);
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | rmepsilon.h | 128 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/chromium/chrome/browser/accessibility/ |
H A D | browser_accessibility_win.cc | 125 // MSAA states that navigating to first/last child can only be from self. 441 STDMETHODIMP BrowserAccessibilityWin::get_states(AccessibleStates* states) { argument 445 if (!states) 448 *states = ia2_state_;
|
/external/libxslt/libxslt/ |
H A D | pattern.c | 80 xsltStepStatePtr states; member in struct:_xsltStepStates 478 xsltPatPushState(xsltTransformContextPtr ctxt, xsltStepStates *states, argument 480 if ((states->states == NULL) || (states->maxstates <= 0)) { 481 states->maxstates = 4; 482 states->nbstates = 0; 483 states->states = xmlMalloc(4 * sizeof(xsltStepState)); 485 else if (states 632 xsltStepStates states = {0, 0, NULL}; /* // may require backtrack */ local [all...] |