Searched refs:s_top (Results 1 – 4 of 4) sorted by relevance
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()[all …]
19 stackentry *s_top; /* Top entry */ member