32     s->s_top = &s->s_base[MAXSTACK];  in s_reset()
35 #define s_empty(s) ((s)->s_top == &(s)->s_base[MAXSTACK])
41     if (s->s_top == s->s_base) {  in s_push()
45     top = --s->s_top;  in s_push()
59     s->s_top++;  in s_pop()
64 #define s_pop(s) (s)->s_top++
112     err = PyNode_AddChild(s->s_top->s_parent, type, str, lineno, col_offset);  in shift()
115     s->s_top->s_state = newstate;  in shift()
124     n = s->s_top->s_parent;  in push()
129     s->s_top->s_state = newstate;  in push()
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()
270                                 [ps->p_stack.s_top->s_state],  in PyParser_AddToken()
275                              ps->p_stack.s_top->s_state));  in PyParser_AddToken()
287                     d = ps->p_stack.s_top->s_dfa;  in PyParser_AddToken()