?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
import jf505 calltipsID.patch and fix the not-found-tip
[nedit-bw.git] / sanitize-_TAG.patch
bloba21257e85e1bcc22c444f4b9e714589906b19faf
1 ---
2
3 source/interpret.c | 503 ++++++++++++++++++++++++++++++-----------------------
4 source/macro.c | 15 +
5 source/parse.y | 33 ++-
6 3 files changed, 328 insertions(+), 223 deletions(-)
7
8 diff --quilt old/source/macro.c new/source/macro.c
9 --- old/source/macro.c
10 +++ new/source/macro.c
11 @@ -110,12 +110,23 @@ static const char CVSID[] = "$Id: macro.
12 /* How long to wait (msec) before putting up Macro Command banner */
13 #define BANNER_WAIT_TIME 6000
14
15 /* The following definitions cause an exit from the macro with a message */
16 /* added if (1) to remove compiler warnings on solaris */
17 -#define M_FAILURE(s) do { *errMsg = s; if (1) return False; } while (0)
18 -#define M_STR_ALLOC_ASSERT(xDV) do { if (xDV.tag == STRING_TAG && !xDV.val.str.rep) { *errMsg = "Failed to allocate value: %s"; return(False); } } while (0)
19 +#define M_FAILURE(s) \
20 + do { \
21 + *errMsg = s; \
22 + if (1) \
23 + return False; \
24 + } while (0)
25 +#define M_STR_ALLOC_ASSERT(xDV) \
26 + do { \
27 + if (xDV.tag == STRING_TAG && !xDV.val.str.rep) { \
28 + *errMsg = "Failed to allocate value: %s"; \
29 + return(False); \
30 + } \
31 + } while (0)
32 #define M_ARRAY_INSERT_FAILURE() M_FAILURE("array element failed to insert: %s")
33
34 /* Data attached to window during shell command execution with
35 information for controling and communicating with the process */
36 typedef struct {
37 diff --quilt old/source/parse.y new/source/parse.y
38 --- old/source/parse.y
39 +++ new/source/parse.y
40 @@ -27,15 +27,38 @@
41 #ifdef HAVE_DEBUG_H
42 #include "../debug.h"
43 #endif
44
45 /* Macros to add error processing to AddOp and AddSym calls */
46 -#define ADD_OP(op) if (!AddOp(op, &ErrMsg)) return 1
47 -#define ADD_SYM(sym) if (!AddSym(sym, &ErrMsg)) return 1
48 -#define ADD_IMMED(val) if (!AddImmediate(val, &ErrMsg)) return 1
49 -#define ADD_BR_OFF(to) if (!AddBranchOffset(to, &ErrMsg)) return 1
50 -#define SET_BR_OFF(from, to) ((from)->value) = ((Inst *)(to)) - ((Inst *)(from))
51 +#define ADD_OP(op) \
52 + do { \
53 + if (!AddOp(op, &ErrMsg)) { \
54 + return 1; \
55 + } \
56 + } while (0)
57 +#define ADD_SYM(sym) \
58 + do { \
59 + if (!AddSym(sym, &ErrMsg)) { \
60 + return 1; \
61 + } \
62 + } while (0)
63 +#define ADD_IMMED(val) \
64 + do { \
65 + if (!AddImmediate(val, &ErrMsg)) { \
66 + return 1; \
67 + } \
68 + } while (0)
69 +#define ADD_BR_OFF(to) \
70 + do { \
71 + if (!AddBranchOffset(to, &ErrMsg)) { \
72 + return 1; \
73 + } \
74 + } while (0)
75 +#define SET_BR_OFF(from, to) \
76 + do { \
77 + ((from)->value) = ((Inst *)(to)) - ((Inst *)(from)); \
78 + } while (0)
79
80 /* Max. length for a string constant (... there shouldn't be a maximum) */
81 #define MAX_STRING_CONST_LEN 5000
82
83 static const char CVSID[] = "$Id: parse.y,v 1.29 2007/01/12 16:17:42 tringali Exp $";
84 diff --quilt old/source/interpret.c new/source/interpret.c
85 --- old/source/interpret.c
86 +++ new/source/interpret.c
87 @@ -66,11 +66,11 @@ static const char CVSID[] = "$Id: interp
88
89 #include <assert.h>
90
91 #define PROGRAM_SIZE 4096 /* Maximum program size */
92 #define MAX_ERR_MSG_LEN 256 /* Max. length for error messages */
93 -#define LOOP_STACK_SIZE 200 /* (Approx.) Number of break/continue stmts
94 +#define LOOP_STACK_SIZE 256 /* (Approx.) Number of break/continue stmts
95 allowed per program */
96 #define INSTRUCTION_LIMIT 100 /* Number of instructions the interpreter is
97 allowed to execute before preempting and
98 returning to allow other things to run */
99
100 @@ -209,11 +209,11 @@ static SparseArrayEntryWrapper *Allocate
101
102 /* Message strings used in macros (so they don't get repeated every time
103 the macros are used */
104 static const char *StackOverflowMsg = "macro stack overflow";
105 static const char *StackUnderflowMsg = "macro stack underflow";
106 -static const char *StringToNumberMsg = "string could not be converted to number";
107 +static const char *StringToNumberMsg = "string '%s' could not be converted to number";
108
109 /* Temporary global data for use while accumulating programs */
110 static Symbol *LocalSymList = NULL; /* symbols local to the program */
111 static Inst Prog[PROGRAM_SIZE]; /* the program */
112 static Inst *ProgP; /* next free spot for code gen. */
113 @@ -271,16 +271,43 @@ static int (*OpFns[N_OPS])() = {returnNo
114 #define FP_ARG_START_INDEX(xFrameP) (-(FP_GET_ARG_COUNT(xFrameP) + FP_TO_ARGS_DIST))
115 #define FP_GET_ARG_N(xFrameP,xN) (FP_GET_ITEM(xFrameP, xN + FP_ARG_START_INDEX(xFrameP)))
116 #define FP_GET_SYM_N(xFrameP,xN) (FP_GET_ITEM(xFrameP, xN))
117 #define FP_GET_SYM_VAL(xFrameP,xSym) (FP_GET_SYM_N(xFrameP, xSym->value.val.n))
118
119 -#define PUSH_CHECK_TOO_MUCH(n) \
120 - (StackP + (n) > &TheStack[STACK_SIZE])
121 +/* true, if you can pop n values */
122 +#define OK_TO_POP(n) \
123 + ((StackP - (n)) >= TheStack)
124 +
125 +#define POP_CHECK(n) \
126 + do { \
127 + if (!OK_TO_POP(n)) { \
128 + return execError(StackUnderflowMsg, ""); \
129 + } \
130 + } while (0)
131 +
132 +/* true, if you can push n values */
133 +#define OK_TO_PUSH(n) \
134 + (StackP + (n) <= &TheStack[STACK_SIZE])
135
136 #define PUSH_CHECK(n) \
137 - if (PUSH_CHECK_TOO_MUCH(n)) \
138 - return execError(StackOverflowMsg, "");
139 + do { \
140 + if (!OK_TO_PUSH(n)) { \
141 + return execError(StackOverflowMsg, ""); \
142 + } \
143 + } while (0)
144 +
145 +#define PEEK_CHECK(n) \
146 + do { \
147 + if (!OK_TO_POP((n) + 1)) { \
148 + return execError(StackUnderflowMsg, ""); \
149 + } \
150 + if (!OK_TO_PUSH(-(n))) { \
151 + return execError(StackOverflowMsg, ""); \
152 + } \
153 + } while (0)
154 +
155 +static const char *tagToStr(enum typeTags tag);
156
157 /*
158 ** Initialize macro language global variables. Must be called before
159 ** any macros are even parsed, because the parser uses action routine
160 ** symbols to comprehend hyphenated names.
161 @@ -491,11 +518,11 @@ int AddContinueAddr(Inst *addr)
162 return 0;
163 }
164
165 static void addLoopAddr(Inst *addr)
166 {
167 - if (LoopStackPtr > &LoopStack[LOOP_STACK_SIZE-1]) {
168 + if (LoopStackPtr >= &LoopStack[LOOP_STACK_SIZE]) {
169 fprintf(stderr, "NEdit: loop stack overflow in macro parser");
170 return;
171 }
172 *LoopStackPtr++ = addr;
173 }
174 @@ -663,11 +690,11 @@ void RunMacroAsSubrCall(Program *prog)
175 Symbol *s;
176 static DataValue noValue = {NO_TAG, {0}};
177
178 /* See subroutine "callSubroutine" for a description of the stack frame
179 for a subroutine call */
180 - /* if (PUSH_CHECK_TOO_MUCH(4)) return MACRO_ERROR; */
181 + /* if (!OK_TO_PUSH(4)) return MACRO_ERROR; */
182
183 *(StackP++) = noValue; /* cached arg array */
184
185 StackP->tag = NO_TAG;
186 StackP->val.inst = PC; /* return PC */
187 @@ -691,11 +718,11 @@ void RunMacroAsSubrCall(Program *prog)
188 StackP++;
189
190 FrameP = StackP;
191 PC = prog->code;
192 for (s = prog->localSymList; s != NULL; s = s->next) {
193 - /* if (PUSH_CHECK_TOO_MUCH(1)) return MACRO_ERROR; */
194 + /* if (!OK_TO_PUSH(1)) return MACRO_ERROR; */
195 FP_GET_SYM_VAL(FrameP, s) = noValue;
196 StackP++;
197 }
198 /* return MACRO_DONE? MACRO_PREEMPT? MACRO_TIME_LIMIT? */
199 }
200 @@ -870,14 +897,21 @@ Symbol *PromoteToGlobal(Symbol *sym)
201 break;
202 }
203 }
204 }
205
206 - s = LookupSymbol(sym->name);
207 - if (s != NULL)
208 - return s;
209 - return InstallSymbol(sym->name, GLOBAL_SYM, noValue);
210 + if (NULL != LookupSymbol(sym->name)) {
211 + fprintf(stderr,
212 + "nedit: To boldly go where no local sym has gone before: %s\n",
213 + sym->name);
214 + }
215 +
216 + sym->type = GLOBAL_SYM;
217 + sym->next = GlobalSymList;
218 + GlobalSymList = sym;
219 +
220 + return sym;
221 }
222
223 /*
224 ** Convert a long value to its decimal string representation, returned in a
225 ** static string.
226 @@ -1195,99 +1229,122 @@ static void freeSymbolTable(Symbol *symT
227 free((char *)s);
228 }
229 }
230
231 #define POP(dataVal) \
232 - if (StackP == TheStack) \
233 - return execError(StackUnderflowMsg, ""); \
234 - dataVal = *--StackP;
235 + do { \
236 + POP_CHECK(1); \
237 + dataVal = *--StackP; \
238 + } while (0)
239
240 #define PUSH(dataVal) \
241 - if (StackP >= &TheStack[STACK_SIZE]) \
242 - return execError(StackOverflowMsg, ""); \
243 - *StackP++ = dataVal;
244 + do { \
245 + PUSH_CHECK(1); \
246 + *StackP++ = dataVal; \
247 + } while (0)
248
249 #define PEEK(dataVal, peekIndex) \
250 - dataVal = *(StackP - peekIndex - 1);
251 + do { \
252 + PEEK_CHECK(peekIndex); \
253 + dataVal = *(StackP - peekIndex - 1); \
254 + } while (0)
255 +
256 +#define TO_INT(dataVal, number) \
257 + do { \
258 + int __int; \
259 + if (dataVal.tag == INT_TAG) { \
260 + __int = dataVal.val.n; \
261 + } else if (dataVal.tag == STRING_TAG) { \
262 + if (!StringToNum(dataVal.val.str.rep, &__int)) {\
263 + return execError(StringToNumberMsg, dataVal.val.str.rep); \
264 + } \
265 + } else { \
266 + return(execError("incompatible type in integer context: %s", \
267 + tagToStr(dataVal.tag))); \
268 + } \
269 + number = __int; \
270 + } while (0)
271 +
272 +#define TO_STRING(dataVal, string) \
273 + do { \
274 + char *__str; \
275 + if (dataVal.tag == STRING_TAG) { \
276 + __str = dataVal.val.str.rep; \
277 + } else if (dataVal.tag == INT_TAG) { \
278 + __str = AllocStringOfNumber(dataVal.val.n); \
279 + } else { \
280 + return(execError("incompatible type in string context: %s", \
281 + tagToStr(dataVal.tag))); \
282 + } \
283 + string = __str; \
284 + } while (0)
285
286 #define POP_INT(number) \
287 - if (StackP == TheStack) \
288 - return execError(StackUnderflowMsg, ""); \
289 - --StackP; \
290 - if (StackP->tag == STRING_TAG) { \
291 - if (!StringToNum(StackP->val.str.rep, &number)) \
292 - return execError(StringToNumberMsg, ""); \
293 - } else if (StackP->tag == INT_TAG) \
294 - number = StackP->val.n; \
295 - else \
296 - return(execError("can't convert array to integer", NULL));
297 + do { \
298 + DataValue dv; \
299 + POP(dv); \
300 + TO_INT(dv, number); \
301 + } while (0)
302
303 #define POP_STRING(string) \
304 - if (StackP == TheStack) \
305 - return execError(StackUnderflowMsg, ""); \
306 - --StackP; \
307 - if (StackP->tag == INT_TAG) { \
308 - string = AllocStringOfNumber(StackP->val.n); \
309 - } else if (StackP->tag == STRING_TAG) \
310 - string = StackP->val.str.rep; \
311 - else \
312 - return(execError("can't convert array to string", NULL));
313 -
314 -#define PEEK_STRING(string, peekIndex) \
315 - if ((StackP - peekIndex - 1)->tag == INT_TAG) { \
316 - string = AllocStringOfNumber((StackP - peekIndex - 1)->val.n); \
317 - } \
318 - else if ((StackP - peekIndex - 1)->tag == STRING_TAG) { \
319 - string = (StackP - peekIndex - 1)->val.str.rep; \
320 - } \
321 - else { \
322 - return(execError("can't convert array to string", NULL)); \
323 - }
324 + do { \
325 + DataValue dv; \
326 + POP(dv); \
327 + TO_STRING(dv, string); \
328 + } while (0)
329
330 #define PEEK_INT(number, peekIndex) \
331 - if ((StackP - peekIndex - 1)->tag == STRING_TAG) { \
332 - if (!StringToNum((StackP - peekIndex - 1)->val.str.rep, &number)) { \
333 - return execError(StringToNumberMsg, ""); \
334 - } \
335 - } else if ((StackP - peekIndex - 1)->tag == INT_TAG) { \
336 - number = (StackP - peekIndex - 1)->val.n; \
337 - } \
338 - else { \
339 - return(execError("can't convert array to string", NULL)); \
340 - }
341 + do { \
342 + DataValue dv; \
343 + PEEK(dv, peekIndex); \
344 + TO_INT(dv, number); \
345 + } while (0)
346 +
347 +#define PEEK_STRING(string, peekIndex) \
348 + do { \
349 + DataValue dv; \
350 + PEEK(dv); \
351 + TO_STRING(dv, string); \
352 + } while (0)
353
354 #define PUSH_INT(number) \
355 - if (StackP >= &TheStack[STACK_SIZE]) \
356 - return execError(StackOverflowMsg, ""); \
357 - StackP->tag = INT_TAG; \
358 - StackP->val.n = number; \
359 - StackP++;
360 -
361 + do { \
362 + DataValue dv; \
363 + dv.tag = INT_TAG; \
364 + dv.val.n = (number); \
365 + PUSH(dv); \
366 + } while (0)
367 +
368 #define PUSH_STRING(string, length) \
369 - if (StackP >= &TheStack[STACK_SIZE]) \
370 - return execError(StackOverflowMsg, ""); \
371 - StackP->tag = STRING_TAG; \
372 - StackP->val.str.rep = string; \
373 - StackP->val.str.len = length; \
374 - StackP++;
375 + do { \
376 + DataValue dv; \
377 + dv.tag = STRING_TAG; \
378 + dv.val.str.rep = string; \
379 + dv.val.str.len = length; \
380 + PUSH(dv); \
381 + } while (0)
382
383 #define BINARY_NUMERIC_OPERATION(operator) \
384 - int n1, n2; \
385 - DISASM_RT(PC-1, 1); \
386 - STACKDUMP(2, 3); \
387 - POP_INT(n2) \
388 - POP_INT(n1) \
389 - PUSH_INT(n1 operator n2) \
390 - return STAT_OK;
391 + do { \
392 + int n1, n2; \
393 + DISASM_RT(PC-1, 1); \
394 + STACKDUMP(2, 3); \
395 + POP_INT(n2); \
396 + POP_INT(n1); \
397 + PUSH_INT(n1 operator n2); \
398 + return STAT_OK; \
399 + } while (0)
400
401 #define UNARY_NUMERIC_OPERATION(operator) \
402 - int n; \
403 - DISASM_RT(PC-1, 1); \
404 - STACKDUMP(1, 3); \
405 - POP_INT(n) \
406 - PUSH_INT(operator n) \
407 - return STAT_OK;
408 + do { \
409 + int n; \
410 + DISASM_RT(PC-1, 1); \
411 + STACKDUMP(1, 3); \
412 + POP_INT(n); \
413 + PUSH_INT(operator n); \
414 + return STAT_OK; \
415 + } while (0)
416
417 /*
418 ** copy a symbol's value onto the stack
419 ** Before: Prog-> [Sym], next, ...
420 ** TheStack-> next, ...
421 @@ -1333,11 +1390,11 @@ static int pushSymVal(void)
422 return execError("reading non-variable: %s", s->name);
423 if (symVal.tag == NO_TAG && !inTypeOfMode) {
424 return execError("variable not set: %s", s->name);
425 }
426
427 - PUSH(symVal)
428 + PUSH(symVal);
429
430 return STAT_OK;
431 }
432
433 static int pushArgVal(void)
434 @@ -1345,11 +1402,11 @@ static int pushArgVal(void)
435 int nArgs, argNum;
436
437 DISASM_RT(PC-1, 1);
438 STACKDUMP(1, 3);
439
440 - POP_INT(argNum)
441 + POP_INT(argNum);
442 --argNum;
443 nArgs = FP_GET_ARG_COUNT(FrameP);
444 if (argNum >= nArgs || argNum < 0) {
445 return execError("referenced undefined argument: $args[%s]",
446 longAsStr(argNum + 1));
447 @@ -1421,17 +1478,15 @@ static int pushArraySymVal(void)
448 PC++;
449 initEmpty = PC->value;
450 PC++;
451
452 if (sym->type == LOCAL_SYM) {
453 - dataPtr = &FP_GET_SYM_VAL(FrameP, sym);
454 - }
455 - else if (sym->type == GLOBAL_SYM) {
456 - dataPtr = &sym->value;
457 - }
458 - else {
459 - return execError("assigning to non-lvalue array or non-array: %s", sym->name);
460 + dataPtr = &FP_GET_SYM_VAL(FrameP, sym);
461 + } else if (sym->type == GLOBAL_SYM) {
462 + dataPtr = &sym->value;
463 + } else {
464 + return execError("assigning to non-lvalue array or non-array: %s", sym->name);
465 }
466
467 if (initEmpty && dataPtr->tag == NO_TAG) {
468 dataPtr->tag = ARRAY_TAG;
469 dataPtr->val.arrayPtr = ArrayNew();
470 @@ -1439,11 +1494,11 @@ static int pushArraySymVal(void)
471
472 if (dataPtr->tag == NO_TAG && !inTypeOfMode) {
473 return execError("variable not set: %s", sym->name);
474 }
475
476 - PUSH(*dataPtr)
477 + PUSH(*dataPtr);
478
479 return STAT_OK;
480 }
481
482 /*
483 @@ -1465,14 +1520,14 @@ static int anonArrayOpen(void)
484 /* make an empty array */
485 dataVal.tag = ARRAY_TAG;
486 dataVal.val.arrayPtr = ArrayNew();
487
488 /* push the default next index value first */
489 - PUSH_INT(0)
490 + PUSH_INT(0);
491
492 /* and the empty array */
493 - PUSH(dataVal)
494 + PUSH(dataVal);
495
496 return STAT_OK;
497 }
498
499 /*
500 @@ -1491,19 +1546,19 @@ static int anonArraySkip(void)
501 int nextIndex;
502
503 DISASM_RT(PC-1, 1);
504 STACKDUMP(2, 3);
505
506 - POP(anonArray)
507 - POP_INT(nextIndex)
508 + POP(anonArray);
509 + POP_INT(nextIndex);
510
511 /* we need to increment the index for next time */
512 ++nextIndex;
513
514 /* push the default next index value first, then the array */
515 - PUSH_INT(nextIndex)
516 - PUSH(anonArray)
517 + PUSH_INT(nextIndex);
518 + PUSH(anonArray);
519
520 return STAT_OK;
521 }
522
523 /*
524 @@ -1523,25 +1578,25 @@ static int anonArrayNextVal(void)
525 char numString[TYPE_INT_STR_SIZE(int)];
526
527 DISASM_RT(PC-1, 1);
528 STACKDUMP(3, 3);
529
530 - POP(exprVal)
531 - POP(anonArray)
532 - POP_INT(nextIndex)
533 + POP(exprVal);
534 + POP(anonArray);
535 + POP_INT(nextIndex);
536
537 sprintf(numString, "%d", nextIndex);
538 if (!ArrayInsert(&anonArray, AllocStringCpy(numString), &exprVal)) {
539 return(execError("array insertion failure", NULL));
540 }
541
542 /* we need to increment the index for next time */
543 ++nextIndex;
544
545 /* push the default next index value first, then the array */
546 - PUSH_INT(nextIndex)
547 - PUSH(anonArray)
548 + PUSH_INT(nextIndex);
549 + PUSH(anonArray);
550
551 return STAT_OK;
552 }
553
554 /*
555 @@ -1563,20 +1618,20 @@ static int anonArrayIndexVal(void)
556 PC++;
557
558 DISASM_RT(PC-2, 2);
559 STACKDUMP(nDim+3, 3);
560
561 - POP(exprVal)
562 + POP(exprVal);
563
564 /* the next nDim stack entries form the index */
565 errNum = makeArrayKeyFromArgs(nDim, &keyString, 0);
566 if (errNum != STAT_OK) {
567 return errNum;
568 }
569
570 - POP(anonArray)
571 - POP_INT(nextIndex)
572 + POP(anonArray);
573 + POP_INT(nextIndex);
574
575 /* if our index is numeric (or can be converted to a number) we must
576 change the next index value */
577 if (nDim == 1 && StringToNum(keyString, &index)) {
578 nextIndex = index + 1;
579 @@ -1585,12 +1640,12 @@ static int anonArrayIndexVal(void)
580 if (!ArrayInsert(&anonArray, keyString, &exprVal)) {
581 return(execError("array insertion failure", NULL));
582 }
583
584 /* push the default next index value first, then the array */
585 - PUSH_INT(nextIndex)
586 - PUSH(anonArray)
587 + PUSH_INT(nextIndex);
588 + PUSH(anonArray);
589
590 return STAT_OK;
591 }
592
593 /*
594 @@ -1609,14 +1664,14 @@ static int anonArrayClose(void)
595
596 DISASM_RT(PC-1, 1);
597 STACKDUMP(2, 3);
598
599 /* remove top two elements */
600 - POP(anonArray)
601 - POP(next_index)
602 + POP(anonArray);
603 + POP(next_index);
604 /* put back the array content */
605 - PUSH(anonArray)
606 + PUSH(anonArray);
607
608 return STAT_OK;
609 }
610
611 /*
612 @@ -1655,16 +1710,17 @@ static int namedArg1orN(Boolean isFirst)
613 int errNum;
614 char *keyString = NULL;
615 DataValue exprVal, argsArray;
616 int nDim, index;
617
618 - nDim = (PC++)->value;
619 + nDim = PC->value;
620 + PC++;
621
622 DISASM_RT(PC-2, 2);
623 STACKDUMP(nDim + (isFirst ? 2 : 1), 3);
624
625 - POP(exprVal)
626 + POP(exprVal);
627
628 /* the next nDim stack entries form the index */
629 errNum = makeArrayKeyFromArgs(nDim, &keyString, 0);
630 if (errNum != STAT_OK) {
631 return errNum;
632 @@ -1681,19 +1737,19 @@ static int namedArg1orN(Boolean isFirst)
633 argsArray.tag = ARRAY_TAG;
634 argsArray.val.arrayPtr = NULL;
635 }
636 else {
637 /* use the array at the top of the stack */
638 - POP(argsArray)
639 + POP(argsArray);
640 }
641
642 if (!ArrayInsert(&argsArray, keyString, &exprVal)) {
643 return(execError("named argument insertion failure", NULL));
644 }
645
646 /* and (re)push the array */
647 - PUSH(argsArray)
648 + PUSH(argsArray);
649
650 return STAT_OK;
651 }
652
653 /*
654 @@ -1704,14 +1760,14 @@ static int swapTop2(void)
655 DataValue dv1, dv2;
656
657 DISASM_RT(PC-1, 1);
658 STACKDUMP(2, 3);
659
660 - POP(dv1)
661 - POP(dv2)
662 - PUSH(dv1)
663 - PUSH(dv2)
664 + POP(dv1);
665 + POP(dv2);
666 + PUSH(dv1);
667 + PUSH(dv2);
668
669 return STAT_OK;
670 }
671
672 /*
673 @@ -1751,11 +1807,11 @@ static int assign(void)
674 }
675 else {
676 dataPtr = &sym->value;
677 }
678
679 - POP(value)
680 + POP(value);
681
682 if (value.tag == ARRAY_TAG) {
683 ArrayCopy(dataPtr, &value);
684 }
685 else {
686 @@ -1792,11 +1848,11 @@ static int arrayIndex(void)
687
688 keyData.tag = STRING_TAG;
689 keyData.val.str.rep = keyString;
690 keyData.val.str.len = strlen(keyString);
691
692 - PUSH(keyData)
693 + PUSH(keyData);
694
695 return STAT_OK;
696 }
697
698 /*
699 @@ -1809,12 +1865,12 @@ static int dupStack(void)
700 DataValue value;
701
702 DISASM_RT(PC-1, 1);
703 STACKDUMP(1, 3);
704
705 - PEEK(value, 0)
706 - PUSH(value)
707 + PEEK(value, 0);
708 + PUSH(value);
709
710 return STAT_OK;
711 }
712
713 /*
714 @@ -1831,20 +1887,20 @@ static int add(void)
715 int n1, n2;
716
717 DISASM_RT(PC-1, 1);
718 STACKDUMP(2, 3);
719
720 - PEEK(rightVal, 0)
721 + PEEK(rightVal, 0);
722 if (rightVal.tag == ARRAY_TAG) {
723 - PEEK(leftVal, 1)
724 + PEEK(leftVal, 1);
725 if (leftVal.tag == ARRAY_TAG) {
726 SparseArrayEntry *leftIter, *rightIter;
727 resultArray.tag = ARRAY_TAG;
728 resultArray.val.arrayPtr = ArrayNew();
729
730 - POP(rightVal)
731 - POP(leftVal)
732 + POP(rightVal);
733 + POP(leftVal);
734 leftIter = arrayIterateFirst(&leftVal);
735 rightIter = arrayIterateFirst(&rightVal);
736 while (leftIter || rightIter) {
737 Boolean insertResult = True;
738
739 @@ -1874,20 +1930,20 @@ static int add(void)
740 }
741 if (!insertResult) {
742 return(execError("array insertion failure", NULL));
743 }
744 }
745 - PUSH(resultArray)
746 + PUSH(resultArray);
747 }
748 else {
749 return(execError("can't mix math with arrays and non-arrays", NULL));
750 }
751 }
752 else {
753 - POP_INT(n2)
754 - POP_INT(n1)
755 - PUSH_INT(n1 + n2)
756 + POP_INT(n2);
757 + POP_INT(n1);
758 + PUSH_INT(n1 + n2);
759 }
760 return(STAT_OK);
761 }
762
763 /*
764 @@ -1903,20 +1959,20 @@ static int subtract(void)
765 int n1, n2;
766
767 DISASM_RT(PC-1, 1);
768 STACKDUMP(2, 3);
769
770 - PEEK(rightVal, 0)
771 + PEEK(rightVal, 0);
772 if (rightVal.tag == ARRAY_TAG) {
773 - PEEK(leftVal, 1)
774 + PEEK(leftVal, 1);
775 if (leftVal.tag == ARRAY_TAG) {
776 SparseArrayEntry *leftIter, *rightIter;
777 resultArray.tag = ARRAY_TAG;
778 resultArray.val.arrayPtr = ArrayNew();
779
780 - POP(rightVal)
781 - POP(leftVal)
782 + POP(rightVal);
783 + POP(leftVal);
784 leftIter = arrayIterateFirst(&leftVal);
785 rightIter = arrayIterateFirst(&rightVal);
786 while (leftIter) {
787 Boolean insertResult = True;
788
789 @@ -1940,20 +1996,20 @@ static int subtract(void)
790 }
791 if (!insertResult) {
792 return(execError("array insertion failure", NULL));
793 }
794 }
795 - PUSH(resultArray)
796 + PUSH(resultArray);
797 }
798 else {
799 return(execError("can't mix math with arrays and non-arrays", NULL));
800 }
801 }
802 else {
803 - POP_INT(n2)
804 - POP_INT(n1)
805 - PUSH_INT(n1 - n2)
806 + POP_INT(n2);
807 + POP_INT(n1);
808 + PUSH_INT(n1 - n2);
809 }
810 return(STAT_OK);
811 }
812
813 /*
814 @@ -1965,78 +2021,78 @@ static int subtract(void)
815 ** Before: TheStack-> value, next, ...
816 ** After: TheStack-> resValue, next, ...
817 */
818 static int multiply(void)
819 {
820 - BINARY_NUMERIC_OPERATION(*)
821 + BINARY_NUMERIC_OPERATION(*);
822 }
823
824 static int divide(void)
825 {
826 int n1, n2;
827
828 DISASM_RT(PC-1, 1);
829 STACKDUMP(2, 3);
830
831 - POP_INT(n2)
832 - POP_INT(n1)
833 + POP_INT(n2);
834 + POP_INT(n1);
835 if (n2 == 0) {
836 return execError("division by zero", "");
837 }
838 - PUSH_INT(n1 / n2)
839 + PUSH_INT(n1 / n2);
840 return STAT_OK;
841 }
842
843 static int modulo(void)
844 {
845 int n1, n2;
846
847 DISASM_RT(PC-1, 1);
848 STACKDUMP(2, 3);
849
850 - POP_INT(n2)
851 - POP_INT(n1)
852 + POP_INT(n2);
853 + POP_INT(n1);
854 if (n2 == 0) {
855 return execError("modulo by zero", "");
856 }
857 - PUSH_INT(n1 % n2)
858 + PUSH_INT(n1 % n2);
859 return STAT_OK;
860 }
861
862 static int negate(void)
863 {
864 - UNARY_NUMERIC_OPERATION(-)
865 + UNARY_NUMERIC_OPERATION(-);
866 }
867
868 static int increment(void)
869 {
870 - UNARY_NUMERIC_OPERATION(++)
871 + UNARY_NUMERIC_OPERATION(++);
872 }
873
874 static int decrement(void)
875 {
876 - UNARY_NUMERIC_OPERATION(--)
877 + UNARY_NUMERIC_OPERATION(--);
878 }
879
880 static int gt(void)
881 {
882 - BINARY_NUMERIC_OPERATION(>)
883 + BINARY_NUMERIC_OPERATION(>);
884 }
885
886 static int lt(void)
887 {
888 - BINARY_NUMERIC_OPERATION(<)
889 + BINARY_NUMERIC_OPERATION(<);
890 }
891
892 static int ge(void)
893 {
894 - BINARY_NUMERIC_OPERATION(>=)
895 + BINARY_NUMERIC_OPERATION(>=);
896 }
897
898 static int le(void)
899 {
900 - BINARY_NUMERIC_OPERATION(<=)
901 + BINARY_NUMERIC_OPERATION(<=);
902 }
903
904 /*
905 ** verify that compares are between integers and/or strings only
906 ** Before: TheStack-> value1, value2, next, ...
907 @@ -2048,12 +2104,12 @@ static int eq(void)
908 DataValue v1, v2;
909
910 DISASM_RT(PC-1, 1);
911 STACKDUMP(2, 3);
912
913 - POP(v1)
914 - POP(v2)
915 + POP(v1);
916 + POP(v2);
917 if (v1.tag == INT_TAG && v2.tag == INT_TAG) {
918 v1.val.n = v1.val.n == v2.val.n;
919 }
920 else if (v1.tag == STRING_TAG && v2.tag == STRING_TAG) {
921 v1.val.n = !strcmp(v1.val.str.rep, v2.val.str.rep);
922 @@ -2078,11 +2134,11 @@ static int eq(void)
923 }
924 else {
925 return(execError("incompatible types to compare", NULL));
926 }
927 v1.tag = INT_TAG;
928 - PUSH(v1)
929 + PUSH(v1);
930 return(STAT_OK);
931 }
932
933 /* negated eq() call */
934 static int ne(void)
935 @@ -2104,20 +2160,20 @@ static int bitAnd(void)
936 int n1, n2;
937
938 DISASM_RT(PC-1, 1);
939 STACKDUMP(2, 3);
940
941 - PEEK(rightVal, 0)
942 + PEEK(rightVal, 0);
943 if (rightVal.tag == ARRAY_TAG) {
944 - PEEK(leftVal, 1)
945 + PEEK(leftVal, 1);
946 if (leftVal.tag == ARRAY_TAG) {
947 SparseArrayEntry *leftIter, *rightIter;
948 resultArray.tag = ARRAY_TAG;
949 resultArray.val.arrayPtr = ArrayNew();
950
951 - POP(rightVal)
952 - POP(leftVal)
953 + POP(rightVal);
954 + POP(leftVal);
955 leftIter = arrayIterateFirst(&leftVal);
956 rightIter = arrayIterateFirst(&rightVal);
957 while (leftIter && rightIter) {
958 Boolean insertResult = True;
959 int compareResult = arrayEntryCompare((rbTreeNode *)leftIter, (rbTreeNode *)rightIter);
960 @@ -2135,20 +2191,20 @@ static int bitAnd(void)
961 }
962 if (!insertResult) {
963 return(execError("array insertion failure", NULL));
964 }
965 }
966 - PUSH(resultArray)
967 + PUSH(resultArray);
968 }
969 else {
970 return(execError("can't mix math with arrays and non-arrays", NULL));
971 }
972 }
973 else {
974 - POP_INT(n2)
975 - POP_INT(n1)
976 - PUSH_INT(n1 & n2)
977 + POP_INT(n2);
978 + POP_INT(n1);
979 + PUSH_INT(n1 & n2);
980 }
981 return(STAT_OK);
982 }
983
984 /*
985 @@ -2164,20 +2220,20 @@ static int bitOr(void)
986 int n1, n2;
987
988 DISASM_RT(PC-1, 1);
989 STACKDUMP(2, 3);
990
991 - PEEK(rightVal, 0)
992 + PEEK(rightVal, 0);
993 if (rightVal.tag == ARRAY_TAG) {
994 - PEEK(leftVal, 1)
995 + PEEK(leftVal, 1);
996 if (leftVal.tag == ARRAY_TAG) {
997 SparseArrayEntry *leftIter, *rightIter;
998 resultArray.tag = ARRAY_TAG;
999 resultArray.val.arrayPtr = ArrayNew();
1000
1001 - POP(rightVal)
1002 - POP(leftVal)
1003 + POP(rightVal);
1004 + POP(leftVal);
1005 leftIter = arrayIterateFirst(&leftVal);
1006 rightIter = arrayIterateFirst(&rightVal);
1007 while (leftIter || rightIter) {
1008 Boolean insertResult = True;
1009
1010 @@ -2206,37 +2262,37 @@ static int bitOr(void)
1011 }
1012 if (!insertResult) {
1013 return(execError("array insertion failure", NULL));
1014 }
1015 }
1016 - PUSH(resultArray)
1017 + PUSH(resultArray);
1018 }
1019 else {
1020 return(execError("can't mix math with arrays and non-arrays", NULL));
1021 }
1022 }
1023 else {
1024 - POP_INT(n2)
1025 - POP_INT(n1)
1026 - PUSH_INT(n1 | n2)
1027 + POP_INT(n2);
1028 + POP_INT(n1);
1029 + PUSH_INT(n1 | n2);
1030 }
1031 return(STAT_OK);
1032 }
1033
1034 static int and(void)
1035 {
1036 - BINARY_NUMERIC_OPERATION(&&)
1037 + BINARY_NUMERIC_OPERATION(&&);
1038 }
1039
1040 static int or(void)
1041 {
1042 - BINARY_NUMERIC_OPERATION(||)
1043 + BINARY_NUMERIC_OPERATION(||);
1044 }
1045
1046 static int not(void)
1047 {
1048 - UNARY_NUMERIC_OPERATION(!)
1049 + UNARY_NUMERIC_OPERATION(!);
1050 }
1051
1052 /*
1053 ** raise one number to the power of another
1054 ** Before: TheStack-> raisedBy, number, next, ...
1055 @@ -2247,12 +2303,12 @@ static int power(void)
1056 int n1, n2, n3;
1057
1058 DISASM_RT(PC-1, 1);
1059 STACKDUMP(2, 3);
1060
1061 - POP_INT(n2)
1062 - POP_INT(n1)
1063 + POP_INT(n2);
1064 + POP_INT(n1);
1065 /* We need to round to deal with pow() giving results slightly above
1066 or below the real result since it deals with floating point numbers.
1067 Note: We're not really wanting rounded results, we merely
1068 want to deal with this simple issue. So, 2^-2 = .5, but we
1069 don't want to round this to 1. This is mainly intended to deal with
1070 @@ -2276,11 +2332,11 @@ static int power(void)
1071 else {
1072 /* round to nearest integer for positive values*/
1073 n3 = (int)(pow((double)n1, (double)n2) + (double)0.5);
1074 }
1075 }
1076 - PUSH_INT(n3)
1077 + PUSH_INT(n3);
1078 return errCheck("exponentiation");
1079 }
1080
1081 /*
1082 ** A helper routine used in concat(), and makeArrayKeyFromArgs().
1083 @@ -2308,11 +2364,11 @@ static int concatenateNwithSep(int nVals
1084 sepLen = strlen(sep);
1085
1086 /* evaluate total length (upper limit) */
1087 len = sepLen * (nVals - 1);
1088 for (i = nVals - 1; i >= 0; --i) {
1089 - PEEK(value, i)
1090 + PEEK(value, i);
1091 if (value.tag == INT_TAG) {
1092 len += lenLongAsStr(value.val.n);
1093 }
1094 else if (value.tag == STRING_TAG) {
1095 len += value.val.str.len;
1096 @@ -2325,11 +2381,11 @@ static int concatenateNwithSep(int nVals
1097 /* allocate the string */
1098 res = AllocString(len + 1);
1099 pos = res;
1100 /* write everything into the result */
1101 for (i = nVals - 1; i >= 0; --i) {
1102 - PEEK(value, i)
1103 + PEEK(value, i);
1104 if (value.tag == INT_TAG) {
1105 pos += strlen(strcpy(pos, longAsStr(value.val.n)));
1106 }
1107 else { /* value.tag == STRING_TAG */
1108 strcpy(pos, value.val.str.rep);
1109 @@ -2342,11 +2398,11 @@ static int concatenateNwithSep(int nVals
1110 }
1111
1112 /* remove the source expression values */
1113 if (!leaveParams) {
1114 while (nVals--) {
1115 - POP(value)
1116 + POP(value);
1117 }
1118 }
1119
1120 /* now return the results */
1121 *result = res;
1122 @@ -2376,11 +2432,11 @@ static int concat(void)
1123
1124 len = concatenateNwithSep(nExpr, "", &out, False);
1125 if (len < 0) {
1126 return(execError("can only concatenate with string or integer", NULL));
1127 }
1128 - PUSH_STRING(out, len)
1129 + PUSH_STRING(out, len);
1130 return STAT_OK;
1131 }
1132
1133 /*
1134 ** Call a subroutine or function (user defined or built-in). Args are the
1135 @@ -2425,11 +2481,11 @@ static int callSubroutineFromSymbol(Symb
1136 */
1137 if (sym->type == C_FUNCTION_SYM) {
1138 DataValue result;
1139
1140 if (!haveNamedArgs) {
1141 - PUSH(noValue) /* push dummy named arg array */
1142 + PUSH(noValue); /* push dummy named arg array */
1143 }
1144
1145 /* "pop" stack back to the first argument in the call stack */
1146 StackP -= nArgs + 1;
1147
1148 @@ -2451,11 +2507,11 @@ static int callSubroutineFromSymbol(Symb
1149 ** Push all of the required information to resume, and make space on the
1150 ** stack for local variables (and initialize them), on top of the argument
1151 ** values which are already there.
1152 */
1153 if (sym->type == MACRO_FUNCTION_SYM) {
1154 - PUSH_CHECK(3 + !haveNamedArgs)
1155 + PUSH_CHECK(3 + !haveNamedArgs);
1156
1157 prog = sym->value.val.prog;
1158
1159 if (!haveNamedArgs)
1160 *(StackP++) = noValue; /* push dummy named arg array */
1161 @@ -2482,11 +2538,11 @@ static int callSubroutineFromSymbol(Symb
1162 StackP++;
1163
1164 FrameP = StackP;
1165 PC = prog->code;
1166 for (s = prog->localSymList; s != NULL; s = s->next) {
1167 - PUSH_CHECK(1)
1168 + PUSH_CHECK(1);
1169 FP_GET_SYM_VAL(FrameP, s) = noValue;
1170 StackP++;
1171 }
1172 return STAT_OK;
1173 }
1174 @@ -2523,11 +2579,11 @@ static int callSubroutineFromSymbol(Symb
1175 key_event.display=disp;
1176 key_event.window=key_event.root=key_event.subwindow=win;
1177
1178 /* pop arguments off the stack and put them in the argument list */
1179 for (i=nArgs-1; i>=0; i--) {
1180 - POP_STRING(argList[i])
1181 + POP_STRING(argList[i]);
1182 }
1183
1184 /* Call the action routine and check for preemption */
1185 PreemptRequest = False;
1186 sym->value.val.xtproc(FocusWindow->lastFocus,
1187 @@ -2582,15 +2638,15 @@ static int callSubroutineStackedN(void)
1188 /* this is much like callSubroutine, but we get nArgs off the stack
1189 and it will always be negative since there is always an argArray */
1190
1191 sym = PC++->sym;
1192
1193 - PEEK_INT(nArgs, 0)
1194 + PEEK_INT(nArgs, 0);
1195 DISASM_RT(PC-2, 2);
1196 STACKDUMP(-nArgs + 1, 3); /* +1 for stacked nArgs */
1197
1198 - POP_INT(nArgs)
1199 + POP_INT(nArgs);
1200
1201 assert (nArgs < 0);
1202
1203 if (nArgs >= 0) {
1204 /* should never happen */
1205 @@ -2683,11 +2739,11 @@ static int unpackArrayToArgs(void)
1206 DataValue dvEntry, dvArray;
1207
1208 DISASM_RT(PC-1, 1);
1209 STACKDUMP(1, 3);
1210
1211 - POP(dvEntry)
1212 + POP(dvEntry);
1213
1214 if (dvEntry.tag != ARRAY_TAG) {
1215 return execError("argument array call made with non-array value", NULL);
1216 }
1217 res = ArrayCopy(&dvArray, &dvEntry);
1218 @@ -2700,14 +2756,14 @@ static int unpackArrayToArgs(void)
1219 char *ind = (char *)longAsStr(nArgs);
1220 if (!ArrayGet(&dvArray, ind, &dvEntry))
1221 break;
1222 /* remove them from remaining array */
1223 ArrayDelete(&dvArray, ind);
1224 - PUSH(dvEntry)
1225 + PUSH(dvEntry);
1226 }
1227 - PUSH(dvArray)
1228 - PUSH_INT(-nArgs)
1229 + PUSH(dvArray);
1230 + PUSH_INT(-nArgs);
1231 return STAT_OK;
1232 }
1233
1234 /*
1235 ** This should never be executed, returnVal checks for the presence of this
1236 @@ -2819,11 +2875,11 @@ static int branchIf(Boolean trueOrFalse)
1237 Inst *addr;
1238
1239 DISASM_RT(PC-1, 2);
1240 STACKDUMP(1, 3);
1241
1242 - POP_INT(value)
1243 + POP_INT(value);
1244 addr = PC + PC->value;
1245 PC++;
1246
1247 if (!value == !trueOrFalse)
1248 PC = addr;
1249 @@ -3118,26 +3174,26 @@ static int arrayRef(void)
1250 errNum = makeArrayKeyFromArgs(nDim, &keyString, 0);
1251 if (errNum != STAT_OK) {
1252 return(errNum);
1253 }
1254
1255 - POP(srcArray)
1256 + POP(srcArray);
1257 if (srcArray.tag == ARRAY_TAG) {
1258 if (!ArrayGet(&srcArray, keyString, &valueItem)) {
1259 return(execError("referenced array value not in array: %s", keyString));
1260 }
1261 - PUSH(valueItem)
1262 + PUSH(valueItem);
1263 return(STAT_OK);
1264 }
1265 else {
1266 return(execError("operator [] on non-array", NULL));
1267 }
1268 }
1269 else {
1270 - POP(srcArray)
1271 + POP(srcArray);
1272 if (srcArray.tag == ARRAY_TAG) {
1273 - PUSH_INT(ArraySize(&srcArray))
1274 + PUSH_INT(ArraySize(&srcArray));
1275 return(STAT_OK);
1276 }
1277 else {
1278 return(execError("operator [] on non-array", NULL));
1279 }
1280 @@ -3164,18 +3220,18 @@ static int arrayAssign(void)
1281
1282 DISASM_RT(PC-2, 1);
1283 STACKDUMP(nDim+2, 3);
1284
1285 if (nDim > 0) {
1286 - POP(srcValue)
1287 + POP(srcValue);
1288
1289 errNum = makeArrayKeyFromArgs(nDim, &keyString, 0);
1290 if (errNum != STAT_OK) {
1291 return(errNum);
1292 }
1293
1294 - POP(dstArray)
1295 + POP(dstArray);
1296
1297 if (dstArray.tag != ARRAY_TAG && dstArray.tag != NO_TAG) {
1298 return(execError("cannot assign array element of non-array", NULL));
1299 }
1300 if (srcValue.tag == ARRAY_TAG) {
1301 @@ -3219,27 +3275,27 @@ static int arrayRefAndAssignSetup(void)
1302
1303 DISASM_RT(PC-3, 3);
1304 STACKDUMP(nDim + (binaryOp ? 2 : 1), 3);
1305
1306 if (binaryOp) {
1307 - POP(moveExpr)
1308 + POP(moveExpr);
1309 }
1310
1311 if (nDim > 0) {
1312 errNum = makeArrayKeyFromArgs(nDim, &keyString, 1);
1313 if (errNum != STAT_OK) {
1314 return(errNum);
1315 }
1316
1317 - PEEK(srcArray, nDim)
1318 + PEEK(srcArray, nDim);
1319 if (srcArray.tag == ARRAY_TAG) {
1320 if (!ArrayGet(&srcArray, keyString, &valueItem)) {
1321 return(execError("referenced array value not in array: %s", keyString));
1322 }
1323 - PUSH(valueItem)
1324 + PUSH(valueItem);
1325 if (binaryOp) {
1326 - PUSH(moveExpr)
1327 + PUSH(moveExpr);
1328 }
1329 return(STAT_OK);
1330 }
1331 else {
1332 return(execError("operator [] on non-array", NULL));
1333 @@ -3272,11 +3328,11 @@ static int beginArrayIter(void)
1334 STACKDUMP(1, 3);
1335
1336 iterator = PC->sym;
1337 PC++;
1338
1339 - POP(arrayVal)
1340 + POP(arrayVal);
1341
1342 if (iterator->type == LOCAL_SYM) {
1343 iteratorValPtr = &FP_GET_SYM_VAL(FrameP, iterator);
1344 }
1345 else {
1346 @@ -3604,12 +3660,12 @@ static int beginArrayMultiIterArray(void
1347 STACKDUMP(2, 3);
1348
1349 iterator = PC->sym;
1350 PC++;
1351
1352 - POP(arrayVal)
1353 - PEEK_INT(nDims, 0)
1354 + POP(arrayVal);
1355 + PEEK_INT(nDims, 0);
1356
1357 if (iterator->type == LOCAL_SYM) {
1358 iteratorValPtr = &FP_GET_SYM_VAL(FrameP, iterator);
1359 }
1360 else {
1361 @@ -3813,33 +3869,33 @@ static int inArray(void)
1362 int inResult = 0;
1363
1364 DISASM_RT(PC-1, 1);
1365 STACKDUMP(2, 3);
1366
1367 - POP(theArray)
1368 + POP(theArray);
1369 if (theArray.tag != ARRAY_TAG) {
1370 return(execError("operator in on non-array", NULL));
1371 }
1372 - PEEK(leftArray, 0)
1373 + PEEK(leftArray, 0);
1374 if (leftArray.tag == ARRAY_TAG) {
1375 SparseArrayEntry *iter;
1376
1377 - POP(leftArray)
1378 + POP(leftArray);
1379 inResult = 1;
1380 iter = arrayIterateFirst(&leftArray);
1381 while (inResult && iter) {
1382 inResult = inResult && ArrayGet(&theArray, iter->key, &theValue);
1383 iter = arrayIterateNext(iter);
1384 }
1385 }
1386 else {
1387 - POP_STRING(keyStr)
1388 + POP_STRING(keyStr);
1389 if (ArrayGet(&theArray, keyStr, &theValue)) {
1390 inResult = 1;
1391 }
1392 }
1393 - PUSH_INT(inResult)
1394 + PUSH_INT(inResult);
1395 return(STAT_OK);
1396 }
1397
1398 /*
1399 ** remove a given key from an array unless nDim is 0, then all keys are removed
1400 @@ -3869,11 +3925,11 @@ static int deleteArrayElement(void)
1401 if (errNum != STAT_OK) {
1402 return(errNum);
1403 }
1404 }
1405
1406 - POP(theArray)
1407 + POP(theArray);
1408 if (theArray.tag == ARRAY_TAG) {
1409 if (nDim > 0) {
1410 ArrayDelete(&theArray, keyString);
1411 }
1412 else {
1413 @@ -3906,11 +3962,11 @@ static int typeOfOut(void)
1414 return(execError("I'm not in typeof-mode", NULL));
1415 }
1416
1417 inTypeOfMode = 0;
1418
1419 - POP(val)
1420 + POP(val);
1421
1422 retVal.tag = STRING_TAG;
1423 switch (val.tag) {
1424 case NO_TAG:
1425 retVal.val.str.rep = PERM_ALLOC_STR("UNDEFINED");
1426 @@ -4064,10 +4120,25 @@ int StringToNum(const char *string, int
1427 return False;
1428 }
1429 return haveDigit;
1430 }
1431
1432 +static const char *tagToStr(enum typeTags tag)
1433 +{
1434 + switch (tag) {
1435 + case INT_TAG:
1436 + return "<integer>";
1437 + case STRING_TAG:
1438 + return "<string>";
1439 + case ARRAY_TAG:
1440 + return "<array>";
1441 + case NO_TAG:
1442 + default:
1443 + return "<no value>";
1444 + }
1445 +}
1446 +
1447 #ifdef DEBUG_DISASSEMBLER /* dumping values in disassembly or stack dump */
1448 static char *printdBuffer = NULL;
1449 static int printdPos = 0;
1450 static int printdSize = 0;
1451
My NEdit quilt queue