Searched refs:s_top (Results 1 – 7 of 7) 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
104 p.s_top[p.s_nr] = p.ns_base[0]; in ddr_region_usage_parse()124 p.s_top[p.s_nr] = p.ns_base[i + 1]; in ddr_region_usage_parse()126 p.s_top[p.s_nr] = p.boundary; in ddr_region_usage_parse()
36 uint64_t s_top[DDR_REGION_NR_MAX]; member
110 RG_MAP_SECURE(usg.s_top[i], usg.s_base[i])); in sgrf_init()