Searched refs:p_stack (Results 1 – 6 of 6) sorted by relevance
| /external/python/cpython3/Parser/ |
| D | parser.c | 90 s_reset(&ps->p_stack); in PyParser_New()
91 (void) s_push(&ps->p_stack, PyGrammar_FindDFA(g, start), ps->p_tree); in PyParser_New()
187 node *n = ps->p_stack.s_top->s_parent;
243 dfa *d = ps->p_stack.s_top->s_dfa; in PyParser_AddToken()
244 state *s = &d->d_state[ps->p_stack.s_top->s_state]; in PyParser_AddToken()
247 d->d_name, ps->p_stack.s_top->s_state)); in PyParser_AddToken()
259 if ((err = push(&ps->p_stack, nt, d1, in PyParser_AddToken()
269 if ((err = shift(&ps->p_stack, type, str, in PyParser_AddToken()
277 [ps->p_stack.s_top->s_state], in PyParser_AddToken()
282 ps->p_stack.s_top->s_state)); in PyParser_AddToken()
[all …]
|
| D | parser.h | 25 stack p_stack; /* Stack of parser states */ member
|
| /external/python/cpython2/Parser/ |
| D | parser.c | 90 s_reset(&ps->p_stack); in PyParser_New()
91 (void) s_push(&ps->p_stack, PyGrammar_FindDFA(g, start), ps->p_tree); in PyParser_New()
181 node *n = ps->p_stack.s_top->s_parent; in future_hack()
236 register dfa *d = ps->p_stack.s_top->s_dfa; in PyParser_AddToken()
237 register state *s = &d->d_state[ps->p_stack.s_top->s_state]; in PyParser_AddToken()
240 d->d_name, ps->p_stack.s_top->s_state)); in PyParser_AddToken()
252 if ((err = push(&ps->p_stack, nt, d1, in PyParser_AddToken()
262 if ((err = shift(&ps->p_stack, type, str, in PyParser_AddToken()
270 [ps->p_stack.s_top->s_state], in PyParser_AddToken()
275 ps->p_stack.s_top->s_state)); in PyParser_AddToken()
[all …]
|
| D | parser.h | 25 stack p_stack; /* Stack of parser states */ member
|
| /external/python/cpython3/Objects/ |
| D | call.c | 1348 PyObject *const **p_stack, PyObject **p_kwnames) in _PyStack_UnpackDict() argument
1360 *p_stack = args; in _PyStack_UnpackDict()
1398 *p_stack = stack; in _PyStack_UnpackDict()
|
| /external/python/cpython3/Include/ |
| D | abstract.h | 198 PyObject *const **p_stack,
|