Lines Matching refs:states
167 // represents the possible resource states that can result from adding a L_or_M
171 // two states [0x01] and [0x10] into a DFA with a single state [0x01, 0x10].
174 // a map from inputs to new states.
210 // PossibleStates is the set of valid resource states that ensue from valid
247 // Set of states. Need to keep this sorted to emit the transition table.
249 StateSet states;
340 // PossibleStates is the set of valid resource states that ensue from valid
347 // Iterate over all resource states in currentState.
510 auto IterPair = states.insert(State());
537 unsigned numStates = states.size();
541 DEBUG(dbgs() << "Total states: " << numStates << "\n");
570 DFA::StateSet::iterator SI = states.begin();
608 OS << "// " << numStates << " states\n";
617 OS << " // states " << (i-10) << ":" << lastState << "\n";
624 OS << " // states " << (lastState+1) << ":" << numStates << "\n";
914 // S' = state with resource states
946 DEBUG(dbgs() << " Skipped - no new states generated\n");
