Lines Matching defs:states
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;
167 DeleteContainerPointers(states);
194 // Iterate over all resource states in currentState.
258 assert(!states.count(S) && "State already exists");
259 states.insert(S);
283 DFA::StateSet::iterator SI = states.begin();
286 std::vector<int> StateEntry(states.size());
294 for (unsigned i = 0; i < states.size(); ++i, ++SI) {
325 for (unsigned i = 0; i < states.size(); ++i)
470 // S' = state with resource states = {S Union C}
491 assert(NewStateResources.size() && "New states must be generated");