Home
last modified time | relevance | path

Searched refs:d_nstates (Results 1 – 8 of 8) sorted by relevance

/external/python/cpython2/Parser/
Dgrammar.c42 for (j = 0; j < g->g_dfa[i].d_nstates; j++) in freegrammar()
65 d->d_nstates = 0; in adddfa()
78 sizeof(state) * (d->d_nstates + 1)); in addstate()
81 s = &d->d_state[d->d_nstates++]; in addstate()
97 assert(0 <= from && from < d->d_nstates); in addarc()
98 assert(0 <= to && to < d->d_nstates); in addarc()
Dprintgrammar.c51 for (j = 0; j < d->d_nstates; j++, s++) { in printarcs()
72 i, d->d_nstates); in printstates()
74 for (j = 0; j < d->d_nstates; j++, s++) in printstates()
92 d->d_type, d->d_name, d->d_initial, d->d_nstates, i); in printdfas()
Dacceler.c45 for (j = 0; j < d->d_nstates; j++, s++) { in PyGrammar_RemoveAccelerators()
59 for (j = 0; j < d->d_nstates; j++, s++) in fixdfa()
/external/python/cpython3/Parser/
Dgrammar.c37 for (int j = 0; j < g->g_dfa[i].d_nstates; j++) in freegrammar()
60 d->d_nstates = 0; in adddfa()
73 sizeof(state) * (d->d_nstates + 1)); in addstate()
76 s = &d->d_state[d->d_nstates++]; in addstate()
92 assert(0 <= from && from < d->d_nstates); in addarc()
93 assert(0 <= to && to < d->d_nstates); in addarc()
Dprintgrammar.c53 for (j = 0; j < d->d_nstates; j++, s++) { in printarcs()
74 i, d->d_nstates); in printstates()
76 for (j = 0; j < d->d_nstates; j++, s++) in printstates()
94 d->d_type, d->d_name, d->d_initial, d->d_nstates, i); in printdfas()
Dacceler.c45 for (j = 0; j < d->d_nstates; j++, s++) { in PyGrammar_RemoveAccelerators()
59 for (j = 0; j < d->d_nstates; j++, s++) in fixdfa()
/external/python/cpython2/Include/
Dgrammar.h54 int d_nstates; member
/external/python/cpython3/Include/
Dgrammar.h54 int d_nstates; member