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

123

/external/aac/libSBRenc/src/
H A Dresampler.h108 FIXP_BQS states[MAXNR_SECTIONS+1][2]; /*! state buffer */ member in struct:__anon263
/external/deqp/modules/gles3/functional/
H A Des3fSamplerStateQueryTests.cpp78 } states[] = local
91 for (int stateNdx = 0; stateNdx < DE_LENGTH_OF_ARRAY(states); ++stateNdx)
95 std::string() + states[stateNdx].name + getVerifierSuffix(verifier),
96 states[stateNdx].desc,
98 states[stateNdx].tester)));
H A Des3fTextureStateQueryTests.cpp90 } states[] = local
119 for (int stateNdx = 0; stateNdx < DE_LENGTH_OF_ARRAY(states); ++stateNdx)
121 if (!isLegalTesterForTarget(textureTargets[targetNdx].target, states[stateNdx].tester))
126 std::string() + textureTargets[targetNdx].name + "_" + states[stateNdx].name + getVerifierSuffix(verifier),
127 states[stateNdx].desc,
130 states[stateNdx].tester)));
/external/tcpdump/
H A Dprint-hsrp.c55 /* 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/apache-commons-math/src/main/java/org/apache/commons/math/ode/events/
H A DCombinedEventsManager.java41 /** Events states. */
42 private final List<EventState> states; field in class:CombinedEventsManager
54 states = new ArrayList<EventState>();
72 states.add(new EventState(handler, maxCheckInterval,
84 for (EventState state : states) {
95 states.clear();
99 * @return a collection of the events states
103 return states;
110 return states.isEmpty();
129 if (states
[all...]
/external/deqp/modules/gles31/functional/
H A Des31fSamplerStateQueryTests.cpp116 } states[] = local
170 for (int stateNdx = 0; stateNdx < DE_LENGTH_OF_ARRAY(states); ++stateNdx)
173 if (!states[stateNdx].newInGLES31)
176 if (isExtendedParamQuery(states[stateNdx].tester))
181 std::string() + states[stateNdx].name + verifierSuffix,
182 states[stateNdx].desc,
184 states[stateNdx].tester));
186 else if (isIsVectorQuery(states[stateNdx].tester))
190 std::string() + states[stateNdx].name + verifierSuffix,
191 states[stateNd
[all...]
H A Des31fTextureStateQueryTests.cpp134 } states[] = local
215 for (int stateNdx = 0; stateNdx < DE_LENGTH_OF_ARRAY(states); ++stateNdx)
217 if (!isLegalTesterForTarget(textureTargets[targetNdx].target, states[stateNdx].tester))
220 // for old targets, check only new states
221 if (!textureTargets[targetNdx].newInGLES31 && !states[stateNdx].newInGLES31)
224 if (isExtendedParamQuery(states[stateNdx].tester))
229 std::string() + states[stateNdx].name + verifierSuffix,
230 states[stateNdx].desc,
233 states[stateNdx].tester));
235 else if (isIsVectorQuery(states[stateNd
[all...]
/external/jmonkeyengine/engine/src/core/com/jme3/app/state/
H A DAppStateManager.java69 * 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/libxml2/
H A DtestAutomata.c37 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 Dstate.h35 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 Dstate.c44 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/jmonkeyengine/engine/src/test/jme3test/input/combomoves/
H A DComboMove.java67 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 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
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/
H A DOpenIntToDoubleHashMap.java77 private byte[] states; field in class:OpenIntToDoubleHashMap
124 states = new byte[capacity];
139 states = new byte[length];
140 System.arraycopy(source.states, 0, states, 0, length);
186 if (states[index] == FREE) {
191 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {
216 if (states[index] == FREE) {
221 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {
259 return findInsertionIndex(keys, states, ke
270 findInsertionIndex(final int[] keys, final byte[] states, final int key, final int mask) argument
[all...]
H A DOpenIntToFieldHashMap.java83 private byte[] states; field in class:OpenIntToFieldHashMap
135 states = new byte[capacity];
151 states = new byte[length];
152 System.arraycopy(source.states, 0, states, 0, length);
198 if (states[index] == FREE) {
203 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {
228 if (states[index] == FREE) {
233 for (int perturb = perturb(hash); states[index] != FREE; perturb >>= PERTURB_SHIFT) {
271 return findInsertionIndex(keys, states, ke
282 findInsertionIndex(final int[] keys, final byte[] states, final int key, final int mask) argument
[all...]
/external/apache-http/android/src/android/net/http/
H A DConnection.java50 private static final String[] states = {"SEND", "READ", "DRAIN", "DONE"}; field in class:Connection
167 states[state] + " pipe " + pipe.size());
/external/guava/guava/src/com/google/common/util/concurrent/
H A DServiceManager.java233 * invoked in the same order as the underlying service enters those states. Additionally, at most
259 * invoked in the same order as the underlying service enters those states. Additionally, at most
379 * <p>N.B. This snapshot is guaranteed to be consistent, i.e. the set of states returned will
420 final Multiset<State> states = servicesByState.keys(); field in class:ServiceManager.ServiceManagerState
451 return states.count(RUNNING) == numberOfServices
452 || states.contains(STOPPING)
453 || states.contains(TERMINATED)
454 || states.contains(FAILED);
463 return states.count(TERMINATED) + states
[all...]
/external/icu/icu4c/source/tools/toolutil/
H A Ducm.h104 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 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...]
/external/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.
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:__anon11364::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 Dnoop_state.c138 static void noop_bind_sampler(struct pipe_context *ctx, unsigned count, void **states) argument
/external/mesa3d/src/gallium/drivers/nv50/
H A Dnv50_state_validate.c332 uint32_t states; member in struct:state_validate
385 if (state_mask & validate->states)
/external/mesa3d/src/gallium/drivers/nvc0/
H A Dnvc0_state_validate.c486 uint32_t states; member in struct:state_validate
535 if (state_mask & validate->states)
/external/google-breakpad/src/testing/src/
H A Dgmock-spec-builders.cc582 StateMap& states() { return states_; } function in class:__anon5282::MockObjectRegistry
650 g_mock_object_registry.states()[mock_obj].leakable = true;
678 if (g_mock_object_registry.states().count(mock_obj) == 0) {
687 g_mock_object_registry.states()[mock_obj].function_mockers;
705 g_mock_object_registry.states()[mock_obj].function_mockers.insert(mocker);
715 MockObjectState& state = g_mock_object_registry.states()[mock_obj];
739 g_mock_object_registry.states().begin();
740 it != g_mock_object_registry.states().end(); ++it) {
745 g_mock_object_registry.states().erase(it);
757 if (g_mock_object_registry.states()
[all...]
/external/icu/icu4c/source/tools/makeconv/
H A Dmakeconv.c493 staticData->maxBytesPerChar=(int8_t)data->ucm->states.maxCharLength;
494 staticData->minBytesPerChar=(int8_t)data->ucm->states.minCharLength;
495 staticData->conversionType=data->ucm->states.conversionType;
543 if(data->ucm->states.outputType<0) {
544 data->ucm->states.outputType=(int8_t)data->ucm->states.maxCharLength-1;
587 baseStates=&data->ucm->states;
638 UCMStates *states, *baseStates; local
652 states=&data->ucm->states;
[all...]

Completed in 2676 milliseconds

123