Lines Matching refs:ps
60 while (ps.p_stack[ps.tos] == ifhead && tk != elselit) { in parse()
62 ps.p_stack[ps.tos] = stmt; /* apply the if(..) stmt ::= stmt in parse()
72 ps.search_brace = opt.btype_2; in parse()
74 if (ps.p_stack[ps.tos] != decl) { /* only put one declaration in parse()
78 ps.p_stack[++ps.tos] = decl; in parse()
79 ps.il[ps.tos] = ps.i_l_follow; in parse()
83 ps.ind_level = 0; in parse()
84 for (i = ps.tos - 1; i > 0; --i) in parse()
85 if (ps.p_stack[i] == decl) in parse()
86 ++ps.ind_level; /* indentation is number of in parse()
88 ps.i_l_follow = ps.ind_level; in parse()
94 if (ps.p_stack[ps.tos] == elsehead && opt.else_if) /* "else if ..." */ in parse()
100 ps.i_l_follow = ps.il[ps.tos--]; in parse()
105 ps.p_stack[++ps.tos] = tk; in parse()
106 ps.il[ps.tos] = ps.ind_level = ps.i_l_follow; in parse()
107 ++ps.i_l_follow; /* subsequent statements should be indented 1 */ in parse()
108 ps.search_brace = opt.btype_2; in parse()
113 if (ps.p_stack[ps.tos] == stmt || ps.p_stack[ps.tos] == decl in parse()
114 || ps.p_stack[ps.tos] == stmtl) in parse()
115 ++ps.i_l_follow; /* it is a random, isolated stmt group or a in parse()
122 --ps.ind_level; in parse()
126 if (ps.p_stack[ps.tos] == swstmt && opt.case_indent >= 1) in parse()
127 --ps.ind_level; in parse()
134 ps.p_stack[++ps.tos] = lbrace; in parse()
135 ps.il[ps.tos] = ps.ind_level; in parse()
136 ps.p_stack[++ps.tos] = stmt; in parse()
138 ps.il[ps.tos] = ps.i_l_follow; in parse()
142 if (ps.p_stack[ps.tos] == dohead) { in parse()
144 ps.ind_level = ps.i_l_follow = ps.il[ps.tos]; in parse()
145 ps.p_stack[++ps.tos] = whilestmt; in parse()
146 ps.il[ps.tos] = ps.ind_level = ps.i_l_follow; in parse()
149 ps.p_stack[++ps.tos] = whilestmt; in parse()
150 ps.il[ps.tos] = ps.i_l_follow; in parse()
151 ++ps.i_l_follow; in parse()
152 ps.search_brace = opt.btype_2; in parse()
159 if (ps.p_stack[ps.tos] != ifhead) in parse()
162 ps.ind_level = ps.il[ps.tos]; /* indentation for else should in parse()
164 ps.i_l_follow = ps.ind_level + 1; /* everything following should in parse()
166 ps.p_stack[ps.tos] = elsehead; in parse()
168 ps.search_brace = opt.btype_2 | opt.else_if; in parse()
174 if (ps.tos > 0 && ps.p_stack[ps.tos - 1] == lbrace) { in parse()
175 ps.ind_level = ps.i_l_follow = ps.il[--ps.tos]; in parse()
176 ps.p_stack[ps.tos] = stmt; in parse()
183 ps.p_stack[++ps.tos] = swstmt; in parse()
184 ps.cstk[ps.tos] = case_ind; in parse()
186 ps.il[ps.tos] = ps.i_l_follow; in parse()
187 case_ind = ps.i_l_follow + opt.case_indent; /* cases should be one in parse()
190 ps.i_l_follow += opt.case_indent + 1; /* statements should be two in parse()
192 ps.search_brace = opt.btype_2; in parse()
198 ps.p_stack[++ps.tos] = stmt; in parse()
199 ps.il[ps.tos] = ps.ind_level; in parse()
209 if (ps.tos >= STACKSIZE - 1) in parse()
215 for (i = 1; i <= ps.tos; ++i) in parse()
216 printf("(%d %d)", ps.p_stack[i], ps.il[i]); in parse()
270 switch (ps.p_stack[ps.tos]) { in reduce()
273 switch (ps.p_stack[ps.tos - 1]) { in reduce()
278 ps.p_stack[--ps.tos] = stmtl; in reduce()
282 ps.p_stack[--ps.tos] = dohead; in reduce()
283 ps.i_l_follow = ps.il[ps.tos]; in reduce()
288 ps.p_stack[--ps.tos] = ifhead; in reduce()
289 for (i = ps.tos - 1; in reduce()
291 ps.p_stack[i] != stmt in reduce()
293 ps.p_stack[i] != stmtl in reduce()
295 ps.p_stack[i] != lbrace in reduce()
298 ps.i_l_follow = ps.il[i]; in reduce()
308 case_ind = ps.cstk[ps.tos - 1]; in reduce()
317 ps.p_stack[--ps.tos] = stmt; in reduce()
318 ps.i_l_follow = ps.il[ps.tos]; in reduce()
328 if (ps.p_stack[ps.tos - 1] == dohead) { in reduce()
330 ps.tos -= 2; in reduce()