Lines Matching full:nbstates
145 int nbstates;
463 states->nbstates = 0;
466 else if (states->maxstates <= states->nbstates) {
476 states->states[states->nbstates].step = step;
477 states->states[states->nbstates++].node = node;
689 if (states.nbstates <= 0) {
693 states.nbstates--;
694 i = states.states[states.nbstates].step;
695 node = states.states[states.nbstates].node;