Lines Matching refs:sp
31 static int sp = 0; /* Stack pointer */
69 long op_token = stack[sp - 1].value;
70 assert(sp > 0);
71 assert(stack[sp - 1].op == EXPR_OP);
73 if (stack[sp].op != EXPR_VALUE) {
78 if (stack[sp].svalue) {
84 if (sp == 1) {
85 /* top of stack: don't attempt to use sp-2! */
89 if (stack[sp].op != EXPR_VALUE) {
93 if ((!stack[sp - 2].svalue) != (!stack[sp].svalue)) {
98 if (stack[sp].svalue) {
100 switch (stack[sp - 1].value) {
102 stack[sp - 2].value = (Strcmp(stack[sp - 2].svalue, stack[sp].svalue) == 0);
103 Delete(stack[sp - 2].svalue);
104 Delete(stack[sp].svalue);
105 sp -= 2;
108 stack[sp - 2].value = (Strcmp(stack[sp - 2].svalue, stack[sp].svalue) != 0);
109 Delete(stack[sp - 2].svalue);
110 Delete(stack[sp].svalue);
111 sp -= 2;
121 stack[sp - 2].value = stack[sp - 2].value * stack[sp].value;
122 sp -= 2;
125 stack[sp - 2].value = stack[sp - 2].value == stack[sp].value;
126 sp -= 2;
129 stack[sp - 2].value = stack[sp - 2].value != stack[sp].value;
130 sp -= 2;
133 stack[sp - 2].value = stack[sp - 2].value + stack[sp].value;
134 sp -= 2;
137 stack[sp - 2].value = stack[sp - 2].value - stack[sp].value;
138 sp -= 2;
141 stack[sp - 2].value = stack[sp - 2].value & stack[sp].value;
142 sp -= 2;
145 stack[sp - 2].value = stack[sp - 2].value && stack[sp].value;
146 sp -= 2;
149 stack[sp - 2].value = stack[sp - 2].value | stack[sp].value;
150 sp -= 2;
153 stack[sp - 2].value = stack[sp - 2].value || stack[sp].value;
154 sp -= 2;
157 stack[sp - 2].value = stack[sp - 2].value ^ stack[sp].value;
158 sp -= 2;
161 stack[sp - 2].value = stack[sp - 2].value < stack[sp].value;
162 sp -= 2;
165 stack[sp - 2].value = stack[sp - 2].value > stack[sp].value;
166 sp -= 2;
169 stack[sp - 2].value = stack[sp - 2].value <= stack[sp].value;
170 sp -= 2;
173 stack[sp - 2].value = stack[sp - 2].value >= stack[sp].value;
174 sp -= 2;
177 stack[sp - 1].value = ~stack[sp].value;
178 sp--;
181 stack[sp - 1].value = !stack[sp].value;
182 sp--;
185 stack[sp - 1].value = -stack[sp].value;
186 sp--;
189 stack[sp - 2].value = stack[sp - 2].value / stack[sp].value;
190 sp -= 2;
193 stack[sp - 2].value = stack[sp - 2].value % stack[sp].value;
194 sp -= 2;
197 stack[sp - 2].value = stack[sp - 2].value << stack[sp].value;
198 sp -= 2;
201 stack[sp - 2].value = stack[sp - 2].value >> stack[sp].value;
202 sp -= 2;
210 stack[sp].op = EXPR_VALUE;
211 stack[sp].svalue = 0; /* ensure it's not a string! */
257 sp = 0;
268 stack[sp].op = EXPR_TOP;
269 stack[sp].value = 0;
273 switch (stack[sp].op) {
285 stack[sp].value = (long) strtol(c, 0, 0);
286 stack[sp].svalue = 0;
287 /* stack[sp].value = (long) atol(Char(Scanner_text(scan))); */
288 stack[sp].op = EXPR_VALUE;
293 stack[sp].value = token;
294 stack[sp++].op = EXPR_OP;
295 stack[sp].op = EXPR_TOP;
296 stack[sp].svalue = 0;
298 stack[sp++].op = EXPR_GROUP;
299 stack[sp].op = EXPR_TOP;
300 stack[sp].value = 0;
301 stack[sp].svalue = 0;
304 stack[sp].svalue = NewString(Scanner_text(scan));
305 stack[sp].op = EXPR_VALUE;
307 stack[sp].value = 0;
308 stack[sp].svalue = 0;
309 stack[sp].op = EXPR_VALUE;
318 while (sp > 0) {
319 if (stack[sp - 1].op == EXPR_OP) {
322 } else if (stack[sp - 1].op == EXPR_GROUP) {
329 return stack[sp].value;
351 if ((sp == 0) || (stack[sp - 1].op == EXPR_GROUP)) {
353 sp++;
354 stack[sp].op = EXPR_OP;
355 stack[sp].value = token;
356 sp++;
357 stack[sp].op = EXPR_TOP;
358 stack[sp].value = 0;
360 if (stack[sp - 1].op != EXPR_OP)
362 op = stack[sp - 1].value; /* Previous operator */
372 sp++;
373 stack[sp].op = EXPR_OP;
374 stack[sp].value = token;
375 sp++;
376 stack[sp].op = EXPR_TOP;
377 stack[sp].value = 0;
381 if (sp == 0)
385 while ((sp > 0) && (stack[sp - 1].op == EXPR_OP)) {
389 if ((sp == 0) || (stack[sp - 1].op != EXPR_GROUP))
391 stack[sp - 1].op = EXPR_VALUE;
392 stack[sp - 1].value = stack[sp].value;
393 sp--;