262 static int nstate;	// Number of states in the NFA.  variable
298     nstate = 0;  in nfa_regcomp_start()
2994     if (istate >= nstate)  in alloc_state()
3424 	stack = ALLOC_MULT(Frag_T, nstate + 1);  in post2nfa()
3428 	stack_end = stack + (nstate + 1);  in post2nfa()
3455 		nstate++;  in post2nfa()
3470 		nstate++;  in post2nfa()
3485 		nstate++;  in post2nfa()
3500 		nstate++;  in post2nfa()
3514 		nstate++;  in post2nfa()
3531 		nstate++;  in post2nfa()
3565 		nstate++;  in post2nfa()
3592 		nstate += n;  in post2nfa()
3665 		nstate += pattern ? 4 : 2;  in post2nfa()
3740 		nstate += 2;  in post2nfa()
3825 		nstate += 2;  in post2nfa()
3855 		nstate += 1;  in post2nfa()
3872 		nstate++;  in post2nfa()
3887 	nstate++;  in post2nfa()
3898     if (istate >= nstate)  in post2nfa()
3933     for (i = 0; i < prog->nstate; ++i)  in nfa_postprocess()
5242     for (i = prog->nstate; --i >= 0; )  in nfa_save_listids()
5260     for (i = prog->nstate; --i >= 0; )  in nfa_restore_listids()
5390 	if (*listids == NULL || *listids_len < prog->nstate)  in recursive_regmatch()
5393 	    *listids = ALLOC_MULT(int, prog->nstate);  in recursive_regmatch()
5399 	    *listids_len = prog->nstate;  in recursive_regmatch()
5775     size = (prog->nstate + 1) * sizeof(nfa_thread_T);  in nfa_regmatch()
5778     list[0].len = prog->nstate + 1;  in nfa_regmatch()
5780     list[1].len = prog->nstate + 1;  in nfa_regmatch()
7432     nstate = 0;  in nfa_regexec_both()
7433     for (i = 0; i < prog->nstate; ++i)  in nfa_regexec_both()
7524     prog_size = sizeof(nfa_regprog_T) + sizeof(nfa_state_T) * (nstate - 1);  in nfa_regcomp()
7541     prog->nstate = nstate;  in nfa_regcomp()