/external/aac/libSBRenc/src/ |
H A D | resampler.h | 108 FIXP_BQS states[MAXNR_SECTIONS+1][2]; /*! state buffer */ member in struct:__anon263
|
/external/chromium_org/components/invalidation/ |
H A D | fake_invalidation_state_tracker.cc | 41 const UnackedInvalidationsMap& states) { 42 unacked_invalidations_map_ = states; 40 SetSavedInvalidations( const UnackedInvalidationsMap& states) argument
|
/external/chromium_org/sync/tools/ |
H A D | null_invalidation_state_tracker.cc | 50 const UnackedInvalidationsMap& states) { 49 SetSavedInvalidations( const UnackedInvalidationsMap& states) argument
|
/external/tcpdump/ |
H A D | print-hsrp.c | 55 /* HSRP states and associated names. */ 56 static const struct tok states[] = { variable in typeref:struct:tok 114 printf("state=%s ", tok2str(states, "Unknown (%d)", hp->hsrp_state));
|
/external/chromium_org/chrome/browser/extensions/ |
H A D | blacklist_unittest.cc | 163 // Test getting different blacklist states from Blacklist. 211 // states, sending fake requests and parsing the responses. 235 Blacklist::BlacklistStateMap states; local 237 Set(a, b, c), base::Bind(&Assign<Blacklist::BlacklistStateMap>, &states)); 244 EXPECT_EQ(BLACKLISTED_CWS_POLICY_VIOLATION, states[a]); 245 EXPECT_EQ(BLACKLISTED_POTENTIALLY_UNWANTED, states[b]); 246 EXPECT_EQ(0U, states.count(c));
|
/external/chromium_org/third_party/libxml/src/ |
H A D | testAutomata.c | 37 xmlAutomataStatePtr states[1000]; local 42 states[i] = NULL; 58 states[0] = xmlAutomataGetInitState(am); 59 if (states[0] == NULL) { 88 if (states[from] == NULL) 89 states[from] = xmlAutomataNewState(am); 97 if (states[to] == NULL) 98 states[to] = xmlAutomataNewState(am); 100 xmlAutomataNewTransition(am, states[from], states[t [all...] |
/external/bison/src/ |
H A D | state.h | 35 state 0 and NSTATES is the number of states. (FIXME: This sentence 51 lookahead token alone). When the states are generated, these 56 contains a vector of numbers of the states that transitions can go 57 to. The accessing_symbol fields of those states' cores say what 68 states should explicitly be errors (for implementing %nonassoc). 91 | Numbering states. | 114 state *states[1]; member in struct:__anon385 119 TRANSITIONS->states[Num]? Can be a token (amongst which the error 123 (Transitions->states[Num]->accessing_symbol) 125 /* Is the TRANSITIONS->states[Nu [all...] |
H A D | state.c | 44 transitions *res = xmalloc (offsetof (transitions, states) + states_size); 46 memcpy (res->states, the_states, states_size); 64 return shifts->states[j]; 169 transitions_new (s->transitions->num, s->transitions->states); 303 /* Initial capacity of states hash table. */ 308 /* Two states are equal if they have the same core items. */ 349 | Create the states hash table. | 364 | Free the states hash table, not the states. | 407 | Record S and all states reachabl 452 state **states = NULL; variable [all...] |
/external/chromium_org/third_party/cython/src/Cython/Plex/ |
H A D | Machines.py | 17 states = None # [Node] variable in class:Machine 22 self.states = [] 27 for state in self.states: 36 self.states.append(s) 53 file.write(" Initial states:\n") 56 for s in self.states: 128 states = None # [state] variable in class:FastMachine 138 self.states = [] 141 for old_state in old_machine.states: 146 for old_state in old_machine.states [all...] |
/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/chromium_org/chrome/browser/signin/ |
H A D | easy_unlock_screenlock_state_handler_unittest.cc | 344 std::vector<EasyUnlockScreenlockStateHandler::State> states; local 345 states.push_back(EasyUnlockScreenlockStateHandler::STATE_NO_BLUETOOTH); 346 states.push_back(EasyUnlockScreenlockStateHandler::STATE_NO_PHONE); 347 states.push_back(EasyUnlockScreenlockStateHandler::STATE_PHONE_UNSUPPORTED); 348 states.push_back(EasyUnlockScreenlockStateHandler::STATE_PHONE_UNLOCKABLE); 349 states.push_back( 351 states.push_back(EasyUnlockScreenlockStateHandler::STATE_PHONE_LOCKED); 353 for (size_t i = 0; i < states.size(); ++i) { 354 state_handler_->ChangeState(states[i]); 358 << "State: " << states[ 384 std::vector<EasyUnlockScreenlockStateHandler::State> states; local 510 std::vector<EasyUnlockScreenlockStateHandler::State> states; local 755 std::vector<EasyUnlockScreenlockStateHandler::State> states; local [all...] |
/external/chromium_org/components/autofill/content/renderer/ |
H A D | form_cache.cc | 48 void RemoveOldElements(const WebFrame& frame, std::map<const K, V>* states) { argument 50 for (typename std::map<const K, V>::const_iterator it = states->begin(); 51 it != states->end(); ++it) { 64 states->erase(*it);
|
/external/chromium_org/content/browser/accessibility/ |
H A D | accessibility_tree_formatter_win.cc | 28 "states", 81 // Avoid flakiness: these states depend on whether the window is focused 88 base::ListValue* states = new base::ListValue; local 92 states->AppendString(base::UTF16ToUTF8(*it)); 94 dict->Set("states", states);
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | unorm_it.c | 38 * chars and states either use the static buffers 41 * They are parallel arrays with states[] holding the getState() values 45 uint32_t *states; member in struct:UNormIterator 50 * api.limit: one past the last valid character in chars[], but states[limit] is valid 94 uint32_t *states; local 98 states=(uint32_t *)uprv_malloc((capacity+1)*4+capacity*2); 99 if(states==NULL) { 103 chars=(UChar *)(states+(capacity+1)); 114 uprv_memcpy(states+delta+start, uni->states 133 moveContentsTowardStart(UCharIterator *api, UChar chars[], uint32_t states[], int32_t delta) argument 160 moveContentsTowardEnd(UCharIterator *api, UChar chars[], uint32_t states[], int32_t delta) argument [all...] |
/external/chromium_org/third_party/icu/source/tools/toolutil/ |
H A D | ucm.h | 104 UCMStates states; member in struct:UCMFile 176 * Check the validity of mappings against a base table's states; 238 ucm_addState(UCMStates *states, const char *s); 241 ucm_processStates(UCMStates *states, UBool ignoreSISOCheck); 244 ucm_countChars(UCMStates *states, 265 /* finalize and optimize states after the toUnicode mappings are processed */ 267 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/chromium_org/third_party/mesa/src/src/gallium/drivers/noop/ |
H A D | noop_state.c | 138 static void noop_bind_sampler(struct pipe_context *ctx, unsigned count, void **states) argument
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/ |
H A D | nv50_state_validate.c | 332 uint32_t states; member in struct:state_validate 385 if (state_mask & validate->states)
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nvc0/ |
H A D | nvc0_state_validate.c | 486 uint32_t states; member in struct:state_validate 535 if (state_mask & validate->states)
|
/external/chromium_org/tools/gyp/tools/emacs/ |
H A D | gyp.el | 95 (defun gyp-invalidate-parse-states-after (target-point) 186 (gyp-invalidate-parse-states-after (point))
|
/external/icu/icu4c/source/tools/toolutil/ |
H A D | ucm.h | 104 UCMStates states; member in struct:UCMFile 176 * Check the validity of mappings against a base table's states; 238 ucm_addState(UCMStates *states, const char *s); 241 ucm_processStates(UCMStates *states, UBool ignoreSISOCheck); 244 ucm_countChars(UCMStates *states, 265 /* finalize and optimize states after the toUnicode mappings are processed */ 267 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. 104 // 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:__anon26587::DFA 184 // Iterate over all resource states in currentState. 242 auto IterPair = states.insert(State()); 268 DFA::StateSet::iterator SI = states.begin(); 271 std::vector<int> StateEntry(states [all...] |
/external/mesa3d/src/gallium/drivers/noop/ |
H A D | noop_state.c | 138 static void noop_bind_sampler(struct pipe_context *ctx, unsigned count, void **states) argument
|
/external/mesa3d/src/gallium/drivers/nv50/ |
H A D | nv50_state_validate.c | 332 uint32_t states; member in struct:state_validate 385 if (state_mask & validate->states)
|