Annotation of freem/src/expr.c, revision 1.11
1.1 snw 1: /*
1.11 ! snw 2: * $Id: expr.c,v 1.10 2025/03/24 04:13:11 snw Exp $
1.1 snw 3: * expression parser
4: *
5: *
1.4 snw 6: * Author: Serena Willis <snw@coherent-logic.com>
1.1 snw 7: * Copyright (C) 1998 MUG Deutschland
1.5 snw 8: * Copyright (C) 2020, 2023, 2025 Coherent Logic Development LLC
1.1 snw 9: *
10: *
11: * This file is part of FreeM.
12: *
13: * FreeM is free software: you can redistribute it and/or modify
14: * it under the terms of the GNU Affero Public License as published by
15: * the Free Software Foundation, either version 3 of the License, or
16: * (at your option) any later version.
17: *
18: * FreeM is distributed in the hope that it will be useful,
19: * but WITHOUT ANY WARRANTY; without even the implied warranty of
20: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21: * GNU Affero Public License for more details.
22: *
23: * You should have received a copy of the GNU Affero Public License
24: * along with FreeM. If not, see <https://www.gnu.org/licenses/>.
25: *
1.6 snw 26: * $Log: expr.c,v $
1.11 ! snw 27: * Revision 1.10 2025/03/24 04:13:11 snw
! 28: * Replace action macro dat with fra_dat to avoid symbol conflict on OS/2
! 29: *
1.10 snw 30: * Revision 1.9 2025/03/24 01:32:22 snw
31: * Guard declaration of time function in expr.c for portability
32: *
1.9 snw 33: * Revision 1.8 2025/03/22 04:47:18 snw
34: * Silently truncate long names in STRING exprs when evaluates to an obsolete MDC standard
35: *
1.8 snw 36: * Revision 1.7 2025/03/22 03:39:23 snw
37: * Fix reverse query polyfill call-in from C side and make NAME exprs silently truncate long names in obsolete MDC dialects
38: *
1.7 snw 39: * Revision 1.6 2025/03/22 03:05:19 snw
40: * Comply with X11-96/13 portable length of names
41: *
1.6 snw 42: * Revision 1.5 2025/03/09 19:14:24 snw
43: * First phase of REUSE compliance and header reformat
44: *
1.5 snw 45: *
46: * SPDX-FileCopyrightText: (C) 2025 Coherent Logic Development LLC
47: * SPDX-License-Identifier: AGPL-3.0-or-later
1.1 snw 48: **/
49:
50: #if !defined(__osf__)
51: #include <sys/types.h>
52: #endif
53: #if !defined(__OpenBSD__) && !defined(__FreeBSD__)
54: # include <sys/timeb.h>
55: #endif
56: #include <stdlib.h>
57: #include <string.h>
58: #include <ctype.h>
59:
60: /* mumps expression evaluator */
61:
62: #include "mpsdef.h"
63: #include "transact.h"
64: #include "merr.h"
65: #include "mtok.h"
66: #include "version.h"
67: #if defined(HAVE_STDINT_H)
68: # include <stdint.h>
69: #endif
70: #if !defined(__osf__) && !defined(_AIX)
71: # define _XOPEN_SOURCE
72: #endif
73:
74: #if defined(USE_SYS_TIME_H) && !defined(MSDOS) && !defined(__osf__)
75: # include <sys/time.h>
76: #else
77: # include <time.h>
78: #endif
79:
80: #if defined(MSDOS) || defined(__linux__)
81: # include <time.h>
82: char *strptime(const char *restrict s, const char *restrict format, struct tm *restrict tm);
83: #endif
84:
85: #include "mref.h"
86: #include "journal.h"
87: #include "datatypes.h"
88: #include "objects.h"
89:
90: #define OPERAND 1
91: #define ARRAY 2
92: #define FNUMBER 3
93: #define REVERSE 4
94: #define TRANSLATE 5
95: #define QLENGTH 6
96: #define QSUBSCRIPT 7
97: #define TYPE 31
98: #define INSTANCEOF 32
99:
100: #define ZCRC 8
101: #define ZDATA 9
102: #define ZLSD 11
103: #define ZNEXT 12
104: #define ZPREVIOUS 17
105: #define ZTRAP 18
106:
107: #define SVNsystem 19
108: #define SVNtimezone 20
109: #define SVNtlevel 22
110: #define SVNtrollback 23
111: #define SVNecode 24
112: #define SVNestack 25
113: #define SVNetrap 26
114: #define SVNstack 27
115: #define SVNpdisplay 28
116: #define SVNdialect 29
117: #define SVNzut 30
118:
119: #define OR '!'
120: #define MODULO '#'
121: #define DIVIDE '/'
122: #define AND '&'
123: #define NOT '\''
124: #define XOR '~'
125: #define MULTIPLY '*'
126: #define POWER ' '
127: #define PLUS '+'
128: #define MINUS '-'
129: #define LESS '<'
130: #define EQUAL '='
131: #define GREATER '>'
132: #define PATTERN '?'
133: #define INDIRECT '@'
134: #define CONTAINS '['
135: #define INTDIVIDE '\\'
136: #define FOLLOWS ']'
137: #define CONCATENATE '_'
138: #define SORTSAFTER '.'
139: #define EQFOLLOWS ','
140: #define EQSORTS ';'
141: #define MAXOP ':'
142: #define MINOP '%'
143:
144: #define GET 'Y'
145: #define GETX ':'
146:
1.9 snw 147: #if !defined(__OpenBSD__) && !defined(_AIX) && !defined(__osf__) && !defined(MSDOS) && !defined(__vax__) && !defined(__OS2__)
1.1 snw 148: long time ();
149: #endif
1.2 snw 150: void cond_round (char *a, int digits);
151: void zkey (char *a, long type);
152: int levenshtein (char *word1, char *word2);
1.1 snw 153: time_t horolog_to_unix (char *horo);
154: extern int xecline(int typ);
155: short rbuf_slot_from_name(char *);
156:
157:
158: short obj_field = FALSE;
159: char object_instance[50];
160: char object_class[50];
161:
162:
163: /*
164: * expr(): expression parser
165: * extyp: type of expression; one of:
166: * STRING
167: * NAME
168: * LABEL
169: * OFFSET
170: * ARGIND
171: */
172: void expr (short extyp)
173: {
174: char op_stck[PARDEPTH + 1]; /* operator/operandflag stack */
175: short spx; /* stack pointer: */
176: short zexflag; /* z 'intrinsic' function flag */
177: int atyp, btyp; /* DM/EUR currency types */
178: char *a; /* pointer to current (left) argument */
179: char *b; /* pointer to right hand argument */
180: char tmp[256];
181: int refsx; /* zref/zloc stack_counter */
182: char *refsav[PARDEPTH]; /* zref/zloc stack */
183:
184:
185: register int i = 0;
186: register int j = 0;
187: register int f = 0;
188: volatile int ch = 0;
189:
190: short group; /* flag to scan grouped patterns */
1.6 snw 191:
192: int max_namlen = 255;
193:
194: if ((rtn_dialect () == D_MDS) || (rtn_dialect () == D_M5) || (rtn_dialect () == D_FREEM)) {
195: max_namlen = 255;
196: }
197: else {
198: max_namlen = 8;
199: }
1.1 snw 200:
201: #ifdef DEBUG_NEWPTR
202: int loop;
203: #endif
204:
205: refsx = 0;
206:
207: if (extyp == NAME) {
208:
209: f = *codptr;
210: varnam[0] = f;
211:
212: if ((f >= 'A' && f <= 'Z') || (f >= 'a' && f <= 'z') || f == '^' || f == '$' || f == '%') {
213:
214: i = 1;
215:
216: while (((ch = *++codptr) >= 'A' && ch <= 'Z') ||
217: (ch >= 'a' && ch <= 'z') ||
218: (ch >= '0' && ch <= '9' && (i > 1 || f != '^')) ||
219: f == '^' &&
220: (((ch == '%' || ch == '$') && i == 1) ||
221: (ch == '|') ||
222: (standard == 0 &&
223: (ch == '.' ||
224: (ch == '/' && i == 1) ||
225: (((ch == '/' && varnam[i - 1] != '/') ||
226: (ch == '%' && varnam[i - 1] == '/')) &&
227: (varnam[1] == '.' || varnam[1] == '/'))))) || (f != '^') && (ch == '.')) {
228:
1.6 snw 229: if ((i + 1) <= max_namlen) {
230: varnam[i++] = ch;
231: }
232: else {
1.7 snw 233: if ((rtn_dialect () == D_M77) ||
234: (rtn_dialect () == D_M84) ||
235: (rtn_dialect () == D_M90) ||
236: (rtn_dialect () == D_M95)) {
237: /* silently truncate... yeah, the standard is stupid af */
238: continue;
239: }
240: else {
241: merr_raise (M56);
242: return;
243: }
1.6 snw 244: }
1.1 snw 245:
246: }
247:
1.7 snw 248: varnam[i] = EOL;
249:
250: #if 0
251: {
252: char gooby[256];
253: stcpy (gooby, varnam);
254: stcnv_m2c (gooby);
255: printf ("name = '%s'\r\n", gooby);
256: }
257: #endif
1.1 snw 258:
259: if (ch == '(') { /* it's an array */
260:
261: op_stck[0] = 0;
262: op_stck[1] = ARRAY;
263: spx = 1;
264: a = argptr;
265:
266: if ((argstck[1] = a) >= s) {
267:
268: char *bak;
269:
270: bak = partition;
271:
272: if (getpmore () == 0) {
273: merr_raise (STKOV);
274: return;
275: }
276:
277: a = a - bak + partition;
278: b = b - bak + partition;
279:
280: }
281:
282: a += stcpy (a, varnam) + 1;
283:
284: arg = 1;
285: codptr++;
286:
287: goto nextchr;
288: }
289:
290: codptr--;
291:
292: if (i == 1 && f == '^') {
293: merr_raise (INVEXPR);
294: }
295:
296: return;
297:
298: }
299:
300: if (f != '@') {
301: merr_raise (INVREF);
302: return;
303: }
304:
305: } /* end if (extyp ==NAME) */
306:
307: arg = 0;
308: spx = 0; /* initialisation */
309: op_stck[0] = 0;
310: a = argptr;
311:
312: nextchr:
313: ch = *codptr;
314:
315: if ((ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z') || ch == '%') {
316:
317:
318: scan_name:
319:
320: varnam[0] = ch;
321: i = 1;
322:
323: if (ch == '^') { /* global variable name */
324:
325: int vb_ct;
326: int qt_ct;
327: char lastch;
328: char nextch;
329:
330: vb_ct = 0;
331: qt_ct = 0;
332:
333: lastch = ' ';
334:
335: while (((ch = *++codptr) >= 'A' && ch <= 'Z') ||
336: (ch >= 'a' && ch <= 'z') ||
337: (ch >= '0' && ch <= '9' && i > 1) ||
338: (ch == '|') || (ch == '%') || (ch == '\"') ||
339: (((ch == '%' || ch == '$') && i == 1) ||
340: (standard == 0 &&
341: (ch == '.' ||
342: (ch == '/' && i == 1) ||
343: (((ch == '/' && varnam[i - 1] != '/') ||
344: (ch == '%' && varnam[i - 1] == '/')) &&
345: (varnam[1] == '.' || varnam[1] == '/')))))) {
346:
347: nextch = *(codptr + 1);
348:
349: if (ch == '|') vb_ct++;
350:
351: if (ch == '\"') {
352: qt_ct++;
353:
354: if ((lastch != '|') && (nextch != '|')) {
355: merr_raise (INVEXPR);
356: return;
357: }
358:
359: }
360:
361: if ((ch == '|') && ((nextch != '\"') && (lastch != '\"'))) {
362:
363: if ((qt_ct == 1) && (vb_ct == 2)) {
364: merr_raise (QUOTER);
365: return;
366: }
367: else if ((vb_ct == 2) && (qt_ct == 1)){
368: merr_raise (INVEXPR);
369: return;
370: }
371:
372: }
373:
374: if (vb_ct > 2) {
375: merr_raise (INVEXPR);
376: return;
377: }
1.8 snw 378:
379: if ((i + 1) <= max_namlen) {
380: varnam[i++] = ch;
381: }
382: else {
383: if ((rtn_dialect () == D_M77) ||
384: (rtn_dialect () == D_M84) ||
385: (rtn_dialect () == D_M90) ||
386: (rtn_dialect () == D_M95)) {
387: /* silently truncate... yeah, the standard is stupid af */
388: continue;
389: }
390: else {
391: merr_raise (M56);
392: return;
393: }
394: }
1.1 snw 395:
396: lastch = ch;
397: }
398:
399: varnam[i] = EOL;
400:
401: if (i == 1 && ch != '(') {
402: merr_raise (INVEXPR);
403: return;
404: }
405:
406: }
407: else { /* local variable name */
408:
409: while (isalnum (ch = *++codptr)) {
1.8 snw 410:
411: if ((i + 1) <= max_namlen) {
412: varnam[i++] = ch;
413: }
414: else {
415: if ((rtn_dialect () == D_M77) ||
416: (rtn_dialect () == D_M84) ||
417: (rtn_dialect () == D_M90) ||
418: (rtn_dialect () == D_M95)) {
419: /* silently truncate... yeah, the standard is stupid af */
420: continue;
421: }
422: else {
423: merr_raise (M56);
424: return;
425: }
426: }
427:
1.1 snw 428: }
429:
430: varnam[i] = EOL;
431:
432:
433: if (*codptr == '.') {
434: if (*(codptr + 1) == '$') {
435: codptr++;
436:
437: obj_field = TRUE;
438: stcpy (object_instance, varnam);
439: stcnv_m2c (object_instance);
440: obj_get_attribute (object_instance, "CLASS", object_class);
441:
442: stcnv_m2c (object_instance);
443: stcnv_c2m (object_class);
444:
445: expr (STRING);
446: return;
447: }
448: else {
449: merr_raise (INVEXPR);
450: return;
451: }
452: }
453:
454: }
455:
456: if (ch == '(') { /* it's an array */
457:
458: if (extyp == LABEL) {
459: codptr--;
460: return;
461: }
462:
463: if (++spx >= PARDEPTH) {
464: merr_raise (STKOV);
465: return;
466: }
467:
468: op_stck[spx] = ARRAY;
469:
470: if ((argstck[++arg] = a) >= s) {
471:
472: char *bak;
473: bak = partition;
474:
475: if (getpmore () == 0) {
476: merr_raise (STKOV);
477: return;
478: }
479:
480: a = a - bak + partition;
481: b = b - bak + partition;
482:
483: }
484:
485: a += stcpy (a, varnam) + 1;
486: codptr++;
487:
488: goto nextchr;
489:
490: }
491:
492: if (spx == 0) {
493:
494: if (extyp != STRING && extyp != ARGIND && extyp != OFFSET) {
495: codptr--;
496: return;
497: }
498:
499: if (varnam[0] != '^') {
500: symtab (get_sym, varnam, a);
501: }
502: else if (varnam[1] != '$') {
503: global (get_sym, varnam, a);
504: }
505: else {
506: ssvn (get_sym, varnam, a);
507: }
508:
509: if (merr () != OK) {
510:
511: stcpy (varerr, varnam);
512:
513: if (merr () == UNDEF || merr () == M6 || merr () == M7) {
514: arg = 1;
515: codptr--;
516:
517: goto undefglvn;
518: }
519:
520: }
521:
522: if (ch == EOL || ch == SP || (extyp == ARGIND) || ch == ',' || ch == ':' || ch == ')' || ch == '@' || (merr () > OK)) {
523: return;
524: }
525:
526: arg = 1;
527: argstck[1] = a;
528: f = OPERAND;
529: op_stck[1] = f;
530: spx = 2;
531:
532: goto op10; /* shortcut: following char is garbage or operator */
533:
534: }
535:
536: codptr--;
537:
538: if ((argstck[++arg] = a) >= s) {
539:
540: char *bak;
541: bak = partition;
542:
543: if (getpmore () == 0) {
544: merr_raise (STKOV);
545: return;
546: }
547:
548: a = a - bak + partition;
549: b = b - bak + partition;
550:
551: }
552:
553: /* evaluate glvn or $_(glvn) */
554:
555: var1:
556:
557: if (op_stck[spx] == '$') {
558:
559: f = op_stck[spx - 1];
560:
561:
562: switch (f) {
563:
564:
565: case 'd': /* $DATA */
566:
1.10 snw 567: ch = fra_dat;
1.1 snw 568:
569: glv_fcn:
570:
571: if (varnam[0] != '^') {
572: symtab (ch, varnam, a);
573: }
574: else if (varnam[1] != '$'){
575: global (ch, varnam, a);
576: }
577: else {
578: ssvn (ch, varnam, a);
579: }
580:
581: d_o_n:
582:
583: if (*++codptr != ')') merr_raise (INVEXPR);
584:
585: if (merr () > OK) {
586: stcpy (varerr, varnam);
587: return;
588: }
589:
590: spx -= 2;
591:
592: goto nxt_operator;
593:
594:
595: case 'o': /* $ORDER */
596:
597: if (rtn_dialect () == D_M77) {
598: merr_raise (NOSTAND);
599: return;
600: }
601:
602: ch = fra_order;
603: ordercnt = 1L;
604:
605: if (*(codptr + 1) != ',') {
606: ordercounter = 0;
607: goto glv_fcn;
608: }
609:
610: if (++spx > PARDEPTH) {
611: merr_raise (STKOV);
612: return;
613: }
614:
615: stcpy (a, varnam);
616:
617: op_stck[spx] = OPERAND;
618: codptr++;
619:
620: goto nextchr;
621:
622:
623: case 'n': /* $NEXT */
624:
625: ordercnt = 1L;
626: ordercounter = 0;
627:
628: if (varnam[0] != '^') {
629: symtab (fra_order, varnam, a);
630: }
631: else if (varnam[1] != '$') {
632: global (fra_order, varnam, a);
633: }
634: else {
635: ssvn (fra_order, varnam, a);
636: }
637:
638: if (a[0] == EOL) {
639: a[0] = '-';
640: a[1] = '1';
641: a[2] = EOL;
642: }
643:
644: goto d_o_n;
645:
646:
647: case 'q': /* $QUERY */
648: case 'O': /* $ZORDER */
649:
650: ch = fra_query;
651: ordercnt = 1L;
652:
653: if (*(codptr + 1) != ',') goto glv_fcn;
654:
655: if (++spx > PARDEPTH) {
656: merr_raise (STKOV);
657: return;
658: }
659:
660: stcpy (a, varnam);
661:
662: op_stck[spx] = OPERAND;
663: codptr++;
664:
665: goto nextchr;
666:
667:
668: case ZNEXT: /* $ZNEXT */
669:
670: ordercnt = 1L;
671:
672: if (varnam[0] != '^') {
673: symtab (fra_query, varnam, a);
674: }
675: else if (varnam[1] != '$') {
676: global (fra_query, varnam, a);
677: }
678: else {
679: ssvn (fra_query, varnam, a);
680: }
681:
682: if (a[0] == EOL) {
683: a[0] = '-';
684: a[1] = '1';
685: a[2] = EOL;
686: }
687:
688: goto d_o_n;
689:
690:
691: case 'N': /* $NAME */
692:
693: /* resolve naked reference */
694: if (varnam[0] == '^' && varnam[1] == DELIM) {
695:
696: stcpy (a, zref);
697: ch = stlen (a);
698:
699: while (a[ch--] != DELIM) {
700:
701: if (ch <= 0) {
702: merr_raise (NAKED);
703: return;
704: }
705:
706: }
707:
708: stcpy (&a[++ch], &varnam[1]);
709: stcpy (varnam, a);
710:
711: }
712:
713: if (*(codptr + 1) != ',') {
714: zname (a, varnam);
715: goto d_o_n;
716: }
717:
718: if (++spx > PARDEPTH) {
719: merr_raise (STKOV);
720: return;
721: }
722:
723: stcpy (a, varnam);
724:
725: op_stck[spx] = OPERAND;
726: codptr++;
727:
728: goto nextchr;
729:
730:
731: case ZPREVIOUS: /* $ZPREVIOUS */
732:
733: ordercnt = (-1L);
734: ordercounter = 0;
735: ch = fra_order;
736:
737: goto glv_fcn;
738:
739:
740: case ZDATA: /* $ZDATA */
741:
742: ch = zdata;
743: goto glv_fcn;
744:
745:
746: case 'g': /* $GET */
747:
748: if (varnam[0] != '^') {
749: symtab (get_sym, varnam, a);
750: }
751: else if (varnam[1] != '$') {
752: global (get_sym, varnam, a);
753: }
754: else {
755: ssvn (get_sym, varnam, a);
756: }
757:
758: if (merr () == M7 || merr () == M6) merr_raise (UNDEF);
759:
760: if (merr () > OK) {
761:
762: stcpy (varerr, varnam);
763:
764: if (merr () != UNDEF) return;
765: }
766:
767: if (merr () == UNDEF) {
768:
769: //smw 15 nov 2023 merr_raise (ierr < 0 ? OK - CTRLB : OK);
770: merr_clear ();
771:
772: if (*++codptr == ',') {
773:
774: if (standard) {
775: merr_raise (NOSTAND);
776: return;
777: }
778:
779: op_stck[spx - 1] = GET; /* dummy function for $GET */
780: arg--;
781: codptr++;
782:
783: goto nextchr;
784:
785: }
786: else {
787:
788: if (*codptr != ')') {
789: merr_raise (INVEXPR);
790: return;
791: }
792:
793: *a = EOL;
794:
795: }
796:
797: }
798: else { /* glvn was defined */
799:
800: if (*++codptr == ',') { /* skip second argument */
801:
802: i = 0; /* quote flag */
803: f = 0; /* bracket counter */
804:
805: for (;;) {
806:
807: ch = *++codptr;
808:
809: if (ch == EOL) {
810: merr_raise (INVEXPR);
811: return;
812: }
813:
814: if (ch == '"') {
815: i = !i;
816: continue;
817: }
818:
819: if (i) continue;
820:
821: if (ch == '(') {
822: f++;
823: continue;
824: }
825:
826: if (ch == ')') {
827: if (--f < 0) break;
828: }
829:
830: }
831:
832: }
833: else if (*codptr != ')') {
834: merr_raise (INVEXPR);
835: return;
836: }
837:
838: }
839:
840: spx -= 2;
841: goto nxt_operator;
842:
843: case 'i': /* $INCREMENT */
844:
845: if (varnam[0] != '^') {
846: symtab (getinc, varnam, a);
847: }
848: else {
849:
850: int setopsav;
851:
852: setopsav = setop;
853: setop = '+';
854: a[0] = '1';
855: a[1] = EOL;
856:
857: if (varnam[1] != '$') {
858: global (set_sym, varnam, a);
859: }
860: else {
861: ssvn (set_sym, varnam, a);
862: }
863:
864: setop = setopsav;
865:
866: }
867:
868: goto d_o_n;
869:
870:
871: case OPERAND: /* three arguments $TEXT */
872:
873: if (spx >= 6 && op_stck[spx - 5] == 't' && op_stck[spx - 4] == '$' && op_stck[spx - 2] == '$') {
874:
875: stcpy (a, &varnam[varnam[0]=='^']); /* third argument */
876:
877: if (++spx > PARDEPTH) {
878: merr_raise (STKOV);
879: return;
880: }
881:
882: op_stck[spx] = OPERAND;
883: codptr++;
884:
885: goto nextchr;
886:
887: }
888:
889: } /* end switch */
890: }
891:
892: /* retrieve look-up */
893:
894: if (varnam[0] != '^') {
895: symtab (get_sym, varnam, a);
896: }
897: else if (varnam[1] != '$') {
898: global (get_sym, varnam, a);
899: }
900: else {
901: ssvn (get_sym, varnam, a);
902: }
903:
904:
905: undefglvn:
906:
907:
908: if (merr ()) stcpy (varerr, varnam);
909:
910: if ((merr () == M6) || (merr () == M7) || (merr () == UNDEF)) {
911:
912: stcpy (tmp, codptr + 1);
913:
914: if (varnam[0] == '^') { /* is there a default expression?? */
915:
916: if (gvndefault[0] == EOL) return;
917:
918: stcpy (&code[1], gvndefault);
919:
920: }
921: else {
922:
923: if (lvndefault[0] == EOL) return;
924:
925: stcpy (&code[1], lvndefault);
926:
927: }
928:
929: /* simulate a $GET function */
930: code[0] = SP;
931:
932: stcat (code, ")\201");
933: stcat (code, tmp);
934:
935: codptr = &code[1];
936:
937: if (((++spx) + 1) > PARDEPTH) {
938: merr_raise (STKOV);
939: return;
940: }
941:
942: op_stck[spx] = GETX; /* dummy function for $GET */
943: op_stck[++spx] = '$';
944:
945: /* stack $ZREFERENCE and $ZLOCAL */
946: if ((refsav[refsx] = calloc (1, 2 * 256)) == NULL) {
947: merr_raise (STKOV);
948: return;
949: } /* could not allocate stuff... */
950:
951: stcpy (refsav[refsx], zref);
952: stcpy (refsav[refsx++] + 256, zloc);
953:
954: ierr -= M7; //smw TODO HUH??
955: arg--;
956:
957: goto nextchr;
958:
959: }
960:
961: if (merr () > OK) return;
962:
963: if (spx == 0) {
964:
965: if ((ch = *++codptr) == EOL || ch == SP || ch == ',' || ch == ':') return;
966:
967: if (++spx > PARDEPTH) {
968: merr_raise (STKOV);
969: return;
970: }
971:
972: op_stck[spx] = OPERAND;
973:
974: goto next10;
975:
976: }
977:
978: f = op_stck[spx];
979:
980: if (f == ARRAY || f == '(') {
981:
982: if (++spx > PARDEPTH) {
983: merr_raise (STKOV);
984: return;
985: }
986:
987: op_stck[spx] = OPERAND;
988: codptr++;
989:
990: goto nextchr;
991:
992: }
993:
994: if (f == INDIRECT && (extyp == STRING || extyp == ARGIND || extyp == OFFSET)) {
995: spx--;
996: goto indirect; /* VARIABLE indirection */
997: }
998:
999: goto nxt_expr;
1000:
1001: }
1002:
1003: if (ch >= '0' && ch <= '9') {
1004:
1005: if (extyp == LABEL) goto scan_name; /* scan_label */
1006:
1007: /* scan number */
1008: i = 0; /* point flag */
1009: j = 0; /* exp flag */
1010: f = ch; /* first character */
1011:
1012: if ((argstck[++arg] = a) >= s) {
1013:
1014: char *bak;
1015: bak = partition;
1016:
1017: if (getpmore () == 0) {
1018: merr_raise (STKOV);
1019: return;
1020: }
1021:
1022: a = a - bak + partition;
1023:
1024: }
1025:
1026: b = a;
1027:
1028: p_entry: /* entry point if first character was a point */
1029:
1030: for (;;) {
1031:
1032: if (ch < '0') {
1033:
1034: if (ch != '.' || i || j) break;
1035:
1036: i++;
1037:
1038: }
1039: else if (ch > '9') {
1040:
1041: if (j) break;
1042: if (ch != 'E' && (lowerflag == FALSE || ch != 'e')) break;
1043:
1044: if (ch == 'E') {
1045: if ((*(codptr + 1) == 'U') && (*(codptr + 2) == 'R')) break;
1046: if ((*(codptr + 1) == 'S') && (*(codptr + 2) == 'P')) break;
1047: }
1048:
1049: j++;
1050:
1051: do {
1052:
1053: *b++ = ch;
1054: ch = *++codptr;
1055:
1056: } while (ch == '+' || ch == '-');
1057:
1058: }
1059:
1060: *b++ = ch;
1061: ch = *++codptr;
1062:
1063: }
1064:
1065: #ifdef EUR2DEM
1066:
1067: switch (ch) {
1068:
1069: case 'E':
1070:
1071: if ((*(codptr + 1) == 'U') && (*(codptr + 2) == 'R')) {
1072: *b++ = ch;
1073: *b++ = *++codptr;
1074: *b++ = *++codptr;
1075: ch = *++codptr;
1076: j = 1;
1077:
1078: break;
1079: }
1080:
1081: if ((*(codptr + 1) == 'S') && (*(codptr + 2) == 'P')) {
1082: *b++ = ch;
1083: *b++ = *++codptr;
1084: *b++ = *++codptr;
1085: ch = *++codptr;
1086: j = 1;
1087: }
1088:
1089: break;
1090:
1091:
1092: case 'D':
1093:
1094: if (*(codptr + 1) == 'M') {
1095: *b++ = ch;
1096: *b++ = *++codptr;
1097: ch = *++codptr;
1098: j = 1;
1099:
1100: break;
1101: }
1102:
1103: if (*(codptr + 1) == 'E' && *(codptr + 2) == 'M') {
1104: *b++ = ch;
1105: *b++ = *++codptr;
1106: *b++ = *++codptr;
1107: ch = *++codptr;
1108: j = 1;
1109: }
1110:
1111: break;
1112:
1113:
1114: case 'A':
1115:
1116: if (*(codptr + 1) == 'T' && *(codptr + 2) == 'S') {
1117: *b++ = ch;
1118: *b++ = *++codptr;
1119: *b++ = *++codptr;
1120: ch = *++codptr;
1121: j = 1;
1122: }
1123:
1124: break;
1125:
1126:
1127: case 'B':
1128:
1129: if (*(codptr + 1) == 'F' && *(codptr + 2) == 'R') {
1130: *b++ = ch;
1131: *b++ = *++codptr;
1132: *b++ = *++codptr;
1133: ch = *++codptr;
1134: j = 1;
1135: }
1136:
1137: break;
1138:
1139:
1140: case 'F':
1141:
1142: if (*(codptr + 1) == 'F') {
1143: *b++ = ch;
1144: *b++ = *++codptr;
1145: ch = *++codptr;
1146: j = 1;
1147:
1148: break;
1149: }
1150:
1151: if (*(codptr + 1) == 'M' && *(codptr + 2) == 'K') {
1152: *b++ = ch;
1153: *b++ = *++codptr;
1154: *b++ = *++codptr;
1155: ch = *++codptr;
1156: j = 1;
1157:
1158: break;
1159: }
1160:
1161: if (*(codptr + 1) == 'R' && *(codptr + 2) == 'F') {
1162: *b++ = ch;
1163: *b++ = *++codptr;
1164: *b++ = *++codptr;
1165: ch = *++codptr;
1166: j = 1;
1167: }
1168:
1169: break;
1170:
1171:
1172: case 'I':
1173:
1174: if (*(codptr + 1) == 'E' && *(codptr + 2) == 'P') {
1175: *b++ = ch;
1176: *b++ = *++codptr;
1177: *b++ = *++codptr;
1178: ch = *++codptr;
1179: j = 1;
1180:
1181: break;
1182: }
1183:
1184: if (*(codptr + 1) == 'T' && *(codptr + 2) == 'L') {
1185: *b++ = ch;
1186: *b++ = *++codptr;
1187: *b++ = *++codptr;
1188: ch = *++codptr;
1189: j = 1;
1190: }
1191:
1192: break;
1193:
1194:
1195: case 'N':
1196:
1197: if (*(codptr + 1) == 'L' && *(codptr + 2) == 'G') {
1198: *b++ = ch;
1199: *b++ = *++codptr;
1200: *b++ = *++codptr;
1201: ch = *++codptr;
1202: j = 1;
1203: }
1204:
1205: break;
1206:
1207:
1208: case 'P':
1209:
1210: if (*(codptr + 1) == 'T' && *(codptr + 2) == 'E') {
1211: *b++ = ch;
1212: *b++ = *++codptr;
1213: *b++ = *++codptr;
1214: ch = *++codptr;
1215: j = 1;
1216: }
1217:
1218:
1219: }
1220:
1221: #endif /* EUR2DEM */
1222:
1223: *b = EOL;
1224:
1225: if (j || f == '0' || (i && ((*(b - 1)) < '1'))) { /* <'1' eqiv. to '.' || '0' */
1226: atyp = numlit (a);
1227: if (atyp) stcat (a, WHR[atyp]);
1228: }
1229:
1230:
1231: if (spx) {
1232: codptr--;
1233: goto exec;
1234: }
1235:
1236: if (ch == EOL || ch == SP || ch == ',' || ch == ':' || (ch == '^' && extyp == OFFSET)) return;
1237:
1238: spx = 1;
1239: op_stck[1] = OPERAND;
1240:
1241: }
1242:
1243: if (ch != '"') goto next10;
1244:
1245: /* scan string */
1246: if ((argstck[++arg] = a) >= s) {
1247:
1248: char *bak;
1249:
1250: bak = partition;
1251:
1252: if (getpmore () == 0) {
1253: merr_raise (STKOV);
1254: return;
1255: }
1256:
1257: a = a - bak + partition;
1258: b = b - bak + partition;
1259:
1260: }
1261:
1262: i = 0;
1263:
1264: for (;;) {
1265:
1266: while ((ch = *++codptr) > '"') {
1267: a[i++] = ch;
1268: }
1269:
1270: /* we make use of the fact that */
1271: /* EOL < "any ASCII character" */
1272: if (ch == '"' && (ch = *++codptr) != '"') {
1273:
1274: if (ch == '_' && *(codptr + 1) == '"') {
1275: codptr++;
1276: continue;
1277: }
1278:
1279: a[i] = EOL;
1280:
1281: if (spx) {
1282: codptr--;
1283: goto exec;
1284: }
1285:
1286: if (ch == EOL || ch == SP || ch == ',' || ch == ':') return;
1287:
1288: spx = 1;
1289: op_stck[1] = OPERAND;
1290:
1291: goto next10;
1292:
1293: }
1294:
1295: if (ch == EOL) {
1296: merr_raise (QUOTER);
1297: return;
1298: }
1299:
1300: a[i++] = ch;
1301:
1302: }
1303:
1304: next05:
1305:
1306: ch = *(++codptr);
1307:
1308: next10:
1309:
1310: switch (ch) {
1311:
1312:
1313: case EOL:
1314: case SP:
1315:
1316: if (op_stck[1] == OPERAND && spx == 1) return;
1317:
1318: merr_raise (INVEXPR);
1319: return;
1320:
1321:
1322: case ',':
1323:
1324: if (spx == 0) {
1325: merr_raise (ARGER);
1326: return;
1327: }
1328:
1329:
1330: comma:
1331:
1332: f = op_stck[spx - 1];
1333:
1334: /* f= (spx>0 ? op_stck[spx-1] : 0);
1335: * if (f) */
1336: switch (f) {
1337:
1338: case '$': /* first arg of $function */
1339:
1340: if (op_stck[spx - 2] == 's') { /* we already have one valid arg */
1341:
1342: i = 0; /* quote *//* and skip rest of select */
1343: j = 0; /* bracket */
1344:
1345: for (;;) {
1346:
1347: ch = *++codptr;
1348:
1349: if (ch == '"') {
1350: toggle (i);
1351: continue;
1352: }
1353:
1354: if (i) {
1355: if (ch != EOL) continue;
1356:
1357: merr_raise (QUOTER);
1358: return;
1359: }
1360:
1361: if (ch == ')') {
1362:
1363: if (j--) continue;
1364:
1365: spx -= 3;
1366:
1367: goto nxt_operator;
1368: }
1369:
1370: if (ch == '(') {
1371: j++;
1372: continue;
1373: }
1374:
1375: if (ch == EOL) {
1376: merr_raise (SELER);
1377: return;
1378: }
1379: }
1380:
1381: }
1382:
1383: /* function argument */
1384: /* put comma on the stack */
1385: if (++spx > PARDEPTH) {
1386: merr_raise (STKOV);
1387: return;
1388: }
1389:
1390: op_stck[spx] = f; /* '$' */
1391:
1392: /* a+=stlen(a)+1; */
1393:
1394: while (*a++ != EOL);
1395:
1396: codptr++;
1397:
1398: goto nextchr;
1399:
1400:
1401: case ARRAY: /* array subscript */
1402:
1403: *(a - 1) = DELIM;
1404: arg--;
1405: spx--;
1406:
1407: while (*a++ != EOL) ;
1408:
1409: codptr++;
1410:
1411: goto nextchr;
1412:
1413:
1414: default:
1415:
1416: if ((extyp == NAME) || (spx > 1)) {
1417: merr_raise (INVEXPR);
1418: return;
1419: }
1420:
1421: return;
1422:
1423: }
1424:
1425: case '^':
1426:
1427: if (extyp == LABEL || extyp == OFFSET) break;
1428:
1429: uparrow:
1430:
1431: if (spx >= 5) { /* take care of $TEXT with three args */
1432:
1433: if (op_stck[spx - 4] == 't' && op_stck[spx - 3] == '$' && op_stck[spx - 1] == '$') {
1434:
1435: if (++spx > PARDEPTH) {
1436: merr_raise (STKOV);
1437: return;
1438: }
1439:
1440: op_stck[spx] = '$';
1441:
1442: while (*a++ != EOL);
1443:
1444: if (*(codptr+1)=='@') goto next05;
1445:
1446: }
1447:
1448: }
1449:
1450: goto scan_name;
1451:
1452:
1453: case '.':
1454:
1455: if ((ch = *++codptr) < '0' || ch > '9') {
1456: merr_raise (INVEXPR);
1457: return;
1458: }
1459:
1460: if ((argstck[++arg] = a) >= s) {
1461:
1462: char *bak;
1463: bak = partition;
1464:
1465: if (getpmore () == 0) {
1466: merr_raise (STKOV);
1467: return;
1468: }
1469:
1470: a = a - bak + partition;
1471: b = b - bak + partition;
1472:
1473: }
1474:
1475: i = 1; /* point flag */
1476: j = 0; /* exp flag */
1477: f = '.'; /* first character */
1478: b = a;
1479: *b++ = f;
1480:
1481: goto p_entry;
1482:
1483:
1484: case ')':
1485:
1486: if (spx <= 1) {
1487:
1488: if (setpiece) return;
1489:
1490: if (spx == 0) {
1491: merr_raise (BRAER);
1492: return;
1493: }
1494:
1495: }
1496:
1497: if (op_stck[spx] != OPERAND) {
1498: merr_raise (INVEXPR);
1499: return;
1500: }
1501:
1502: if ((f = op_stck[spx - 1]) == ARRAY) { /* array return */
1503:
1504: *--a = DELIM;
1505: stcpy (varnam, a = argstck[--arg]);
1506:
1507: if ((spx -= 2) <= 0 && extyp != STRING && extyp != ARGIND) return;
1508:
1509: goto var1;
1510:
1511: }
1512:
1513: /* precedence close parenthesis */
1514: if (f == '(') {
1515: spx -= 2;
1516: goto nxt_operator;
1517: }
1518:
1519: if (spx <= 2) {
1520: merr_raise (BRAER);
1521: return;
1522: } /* unmatched ')' */
1523:
1524:
1525: /**
1526: * *********** function evaluation ******************************************
1527: *
1528: * Note: Input for function() is found in 'partition':
1529: * There are 'f' arguments to be found at 'a'
1530: * The arguments are separated by an EOL character.
1531: * There is a list of the addresses of the arguments
1532: * in 'a==argstck[arg], argstck[arg+1], argstck[arg+f-1]'
1533: * Result is returned at a==argstck[arg]
1534: *
1535: */
1536: f = 1; /* f == number of arguments */
1537: if (op_stck[spx -= 2] == OPERAND) {
1538:
1539: do {
1540: f++;
1541: arg--;
1542: } while (op_stck[spx -= 2] == OPERAND);
1543:
1544: a = argstck[arg];
1545:
1546: }
1547:
1548: i = op_stck[spx--];
1549:
1550: switch (i) { /* function select */
1551:
1552:
1553: case 'e': /* $EXTRACT */
1554:
1555: switch (f) {
1556:
1557:
1558: case 1:
1559:
1560: a[1] = EOL;
1561: goto nxt_operator;
1562:
1563:
1564: case 2:
1565:
1566: b = argstck[arg + 1];
1567: i = intexpr (b) - 1; /* numeric value of 2nd argument */
1568:
1569: /*set_io (UNIX);
1570: printf ("i = %d a = '%s'\n", i, a[i]);
1571: set_io (MUMPS);*/
1572:
1573: if (merr () == MXNUM) {
1574: merr_raise (OK);
1575: if (i >= 0) i = 256;
1576: }
1577:
1578: f = b - a - 1; /* length of first argument */
1579:
1580: if (i > f || i < 0) {
1581: if (i > f) {
1582: a[0] = EOL;
1583: goto nxt_operator;
1584: }
1585: if (i < 0) {
1586: if (en_revstrf && !standard) {
1587: a[0] = a[f - (abs(i) - 1)];
1588: a[1] = EOL;
1589: }
1590: else {
1591: a[0] = EOL;
1592: }
1593: }
1594: }
1595: else {
1596: /* out of range */
1597: a[0] = a[i];
1598: a[1] = EOL;
1599: } /* get character */
1600:
1601: goto nxt_operator;
1602:
1603:
1604: case 3:
1605:
1606: {
1607: char tstr[STRLEN];
1608: long int e_length;
1609: long int e_start;
1610: long int e_end;
1611:
1612: stcpy (tstr, a);
1613:
1614: e_start = intexpr (argstck[arg + 1]) - 1;
1615: e_end = intexpr (argstck[arg + 2]);
1616: e_length = stlen(tstr);
1617:
1618: if (e_start < 0) {
1619:
1620: if (en_revstrf && !standard) {
1621: e_start = e_length - abs(e_start) + 1;
1622: }
1623: else {
1624: a[0] = EOL;
1625: goto nxt_operator;
1626: }
1627:
1628: }
1629:
1630: if (e_end < 0) {
1631:
1632: if (en_revstrf && !standard) {
1633: e_end = e_length - abs(e_end) + 1;
1634: }
1635: else {
1636: a[0] = EOL;
1637: goto nxt_operator;
1638: }
1639:
1640: }
1641:
1642: tstr[e_end] = EOL;
1643: stcpy (a, &(tstr[e_start]));
1644:
1645: goto nxt_operator;
1646:
1647: }
1648:
1649: default:
1650: merr_raise (FUNARG);
1651:
1652: {
1653: return;
1654: }
1655:
1656: }
1657:
1658: case 'a': /* $ASCII */
1659:
1660: if (f == 1) {
1661: intstr (a, (*a != EOL ? UNSIGN ((int) *a) : -1));
1662: goto nxt_operator;
1663: }
1664:
1665: if (f > 2) {
1666: merr_raise (FUNARG);
1667: return;
1668: }
1669:
1670: b = argstck[arg + 1];
1671: i = intexpr (b);
1672:
1673: /* ascii number of selected character or -1 if out of range */
1674: intstr (a, (i >= (b - a)) || i <= 0 ? -1 : UNSIGN ((int) a[i - 1]));
1675:
1676: goto nxt_operator;
1677:
1678:
1679: case 'c': /* $CHARACTER */
1680:
1.11 ! snw 1681: {
! 1682: char chrtmp[256];
! 1683: long pnum;
1.1 snw 1684: short l, l1, m, n;
1685:
1686: l1 = f;
1687: i = 0;
1688: f = 0;
1689: j = 0;
1690: m = 0;
1691: n = 1;
1692: l = 0;
1693:
1.11 ! snw 1694: stcpy (chrtmp, a);
! 1695: stcnv_m2c (chrtmp);
! 1696: pnum = atol (chrtmp);
! 1697:
! 1698: if (pnum > 127) {
! 1699: merr_raise (MXNUM);
! 1700: return;
! 1701: }
! 1702:
1.1 snw 1703: for (;;) {
1704:
1705: if ((ch = a[i++]) == EOL) {
1706:
1707: if (m == 0) {
1708:
1709: if (j > DEL) {
1710:
1711: if (standard) {
1712: merr_raise (NOSTAND);
1713: return;
1714: }
1715:
1716: if (eightbit) {
1717: j &= 0377;
1718: if ((((char) j) == EOL) || (((char) j) == DELIM)) j = NUL;
1719: }
1720: else {
1721: j &= 0177;
1722: }
1723:
1724: }
1725:
1726: if (f >= STRLEN) {
1727: a[f] = EOL;
1728: merr_raise (M75);
1729:
1730: return;
1731: }
1732:
1733: a[f++] = j;
1734:
1735: }
1736:
1737: if (++l >= l1) break;
1738:
1739: j = 0;
1740: m = 0;
1741: n = 1;
1742:
1743: continue;
1744:
1745: }
1746:
1747: if (n == 0) continue;
1748:
1749: if (ch >= '0' && ch <= '9') {
1750: j *= 10;
1751: j += ch - '0';
1752:
1753: continue;
1754: }
1755:
1756: if (ch == '-') {
1757: m |= 01;
1758: continue;
1759: }
1760:
1761: if (ch != '+') n = 0;
1762:
1763: }
1764:
1765: a[f] = EOL;
1766:
1767: }
1768:
1769: goto nxt_operator;
1770:
1771:
1772: case 'p': /* $PIECE */
1773:
1774: {
1775: long l, l1, m, n;
1776:
1777: b = argstck[arg + 1];
1778: l1 = b - a - 1; /* length of 1st argument */
1779:
1780: switch (f) {
1781:
1782:
1783: case 2:
1784:
1785: f = 1;
1786: l = 1;
1787:
1788: break;
1789:
1790:
1791: case 3:
1792:
1793: f = intexpr (argstck[arg + 2]);
1794:
1795: if (merr () == MXNUM) {
1796: merr_raise (OK);
1797: if (j >= 0) f = 256;
1798: }
1799:
1800: if (f <= 0) {
1801: a[0] = EOL;
1802: goto nxt_operator;
1803: }
1804:
1805: l = f;
1806:
1807: break;
1808:
1809:
1810: case 4:
1811:
1812: l = intexpr (argstck[arg + 3]);
1813:
1814: if (merr () == MXNUM) {
1815: merr_raise (OK);
1816: if (l >= 0) l = 256;
1817: }
1818:
1819: if ((f = intexpr (argstck[arg + 2])) <= 0) f = 1;
1820:
1821: if (merr () == MXNUM) {
1822: merr_raise (OK);
1823: if (f >= 0) f = 256;
1824: }
1825:
1826: if (f > l) {
1827: a[0] = EOL;
1828: goto nxt_operator;
1829: }
1830:
1831: break;
1832:
1833:
1834: default:
1835:
1836: merr_raise (FUNARG);
1837: return;
1838: }
1839:
1840: i = 0;
1841: m = 0;
1842: ch = 0;
1843:
1844: while (b[ch] != EOL) ch++; /* $l of 2nd arg */
1845:
1846: if (ch == 1) {
1847:
1848: ch = b[0];
1849: j = 1;
1850:
1851: if (f > 1) {
1852:
1853: while (i < l1) { /* scan 1st string ... */
1854:
1855: if (a[i++] != ch) continue; /* ... for occurence of 2nd */
1856:
1857: if (++j == f) {
1858: m = i;
1859: goto p10;
1860: }
1861:
1862: }
1863:
1864: a[0] = EOL;
1865: goto nxt_operator;
1866:
1867: }
1868:
1869: p10:
1870: for (; i < l1; i++) {
1871:
1872: if (a[i] != ch) continue;
1873:
1874: if (j == l) {
1875: a[i] = EOL;
1876: break;
1877: }
1878:
1879: j++;
1880:
1881: }
1882:
1883: if (m > 0) stcpy (a, &a[m]);
1884:
1885: goto nxt_operator;
1886:
1887: }
1888:
1889: if (ch == 0) {
1890: a[0] = EOL;
1891: goto nxt_operator;
1892: } /* 2nd arg is empty */
1893:
1894: /* else (ch>1) */
1895: n = 1;
1896:
1897: if (f > 1) {
1898:
1899: while (i < l1) { /* scan 1st string ... */
1900: j = 0;
1901:
1902: p20:
1903:
1904: if (a[i + j] != b[j]) {
1905: i++;
1906: continue;
1907: } /* ... for occurence of 2nd */
1908:
1909: if (++j < ch) goto p20;
1910:
1911: i += ch; /* skip delimiter */
1912:
1913: if (++n == f) {
1914: m = i;
1915: goto p30;
1916: }
1917: }
1918:
1919: a[0] = EOL;
1920:
1921: goto nxt_operator;
1922:
1923: }
1924: p30:
1925: while (i < l1) {
1926: j = 0;
1927:
1928: p40:
1929:
1930: if (a[i + j] != b[j]) {
1931: i++;
1932: continue;
1933: }
1934:
1935: if (++j < ch) goto p40;
1936:
1937: if (n == l) {
1938: a[i] = EOL;
1939: break;
1940: } /* last $piece: done! */
1941:
1942: i += ch;
1943: n++;
1944:
1945: }
1946:
1947: if (m > 0) stcpy (a, &a[m]);
1948:
1949: goto nxt_operator;
1950:
1951: }
1952:
1953: case 'l': /* $LENGTH */
1954:
1955: if (f == 1) {
1956: lintstr (a, stlen (a));
1957: goto nxt_operator;
1958: }
1959:
1960: if (f > 2) {
1961: merr_raise (FUNARG);
1962: return;
1963: }
1964:
1965: i = 0;
1966: j = 0;
1967: ch = 0;
1968: b = argstck[arg + 1];
1969:
1970: if ((f = stlen (b))) {
1971:
1972: f--;
1973:
1974: while ((i = find (&a[ch], b)) > 0) {
1975: j++;
1976: ch += i + f;
1977: }
1978:
1979: j++;
1980:
1981: }
1982:
1983: intstr (a, j);
1984:
1985: goto nxt_operator;
1986:
1987: case 'f': /* $FIND */
1988:
1989: {
1990: short l1;
1991:
1992: if (f < 2 || f > 3) {
1993: merr_raise (FUNARG);
1994: return;
1995: }
1996:
1997: if (f == 3) {
1998:
1999: i = intexpr (argstck[arg + 2]);
2000:
2001: if (merr () == MXNUM) {
2002:
2003: if (i > 0) i = 256;
2004:
2005: merr_raise (OK);
2006:
2007: /* important special case:
2008: * $FIND("","",number) ::= $S(number<1:1,1:integer(number))
2009: * needs special treatment so that it does not yield wrong
2010: * results on large values of number.
2011: */
2012: if ((argstck[arg + 1][0] == EOL) && (i > 0)) {
2013:
2014: numlit (argstck[arg + 2]);
2015:
2016: i = 0;
2017:
2018: while ((a[i] = argstck[arg + 2][i]) != EOL) {
2019:
2020: if (a[i] == '.') {
2021: a[i] = EOL;
2022: break;
2023: }
2024:
2025: i++;
2026:
2027: }
2028:
2029: goto nxt_operator;
2030:
2031: }
2032: }
2033:
2034: i--;
2035:
2036: if (i < 0) i = 0;
2037:
2038: }
2039: else {
2040: i = 0;
2041: }
2042:
2043: b = argstck[arg + 1];
2044: j = b - a - 1; /* length of first argument */
2045:
2046: if ((l1 = stlen (b)) == 0) {
2047: i++;
2048: goto f20;
2049: }
2050:
2051: for (f = i; f < j; f++) {
2052:
2053: for (ch = 0; ch < l1; ch++) {
2054: if (a[f + ch] != b[ch]) goto f10;
2055: }
2056:
2057: i = (++f) + l1;
2058:
2059: goto f20;
2060:
2061: f10:
2062: ; /* null statement to avoid compiler error
2063: due to having a label at the end of a
2064: block */
2065:
2066: }
2067:
2068: i = 0;
2069:
2070: f20:
2071:
2072: lintstr (a, i);
2073:
2074: }
2075:
2076: goto nxt_operator;
2077:
2078:
2079: case 'j': /* $JUSTIFY */
2080:
2081: if (f < 2 || f > 3) {
2082: merr_raise (FUNARG);
2083: return;
2084: }
2085:
2086: {
2087: long l, l1;
2088:
2089: l = intexpr (b = argstck[arg + 1]); /* 2nd arg */
2090: if (merr () == MXNUM) return; /* $J() arg number overflow */
2091:
2092: if (l > STRLEN) {
2093: /* $J() width string too long */
2094: merr_raise (M75);
2095: return;
2096: }
2097:
2098: if (f == 2) {
2099: f = b - a - 1;
2100: }
2101: else {
2102:
2103: f = intexpr (argstck[arg + 2]); /* 3rd arg */
2104:
2105: if (merr () == MXNUM) return; /* $J() arg number overflow */
2106:
2107: if (f > (STRLEN - 2)) {
2108: /* $J() .precision too long */
2109: merr_raise (M75);
2110: return;
2111: }
2112:
2113: numlit (a);
2114:
2115: if (f < 0) {
2116: merr_raise (ARGER);
2117: return;
2118: }
2119:
2120: /* s j=$l(a),i=$f(a,".")-1 */
2121: j = (a[0] == '-');
2122:
2123: if (a[j] == '.') { /* insert leading zero */
2124:
2125: i = j;
2126:
2127: while (a[i++] != EOL);
2128:
2129: while (i > j) {
2130: a[i] = a[i - 1];
2131: i--;
2132: }
2133:
2134: a[j] = '0';
2135:
2136: }
2137:
2138: i = (-1);
2139: j = 0;
2140:
2141: while (a[j] != EOL) {
2142: if (a[j] == '.') i = j;
2143: j++;
2144: }
2145:
2146: if (i < 0) {
2147: a[i = j] = '.';
2148: a[j + 1] = EOL;
2149: }
2150: else {
2151: j--;
2152: }
2153:
2154: if (j - i > f) { /* rounding required */
2155:
2156: if ((l1 = f + i + 1) > STRLEN) {
2157: merr_raise (M75);
2158: return;
2159: }
2160:
2161: if (a[l1] > '4') {
2162:
2163: do {
2164:
2165: if (a[--l1] == '.') l1--;
2166:
2167: if (l1 < (a[0] == '-')) {
2168:
2169: for (l1 = f + i + 1; l1 > 0; l1--) a[l1] = a[l1 - 1];
2170:
2171: a[a[0] == '-'] = '1';
2172: i++;
2173:
2174: break;
2175:
2176: }
2177:
2178: a[l1]++;
2179:
2180: if (a[l1] == ':') a[l1] = '0';
2181:
2182: } while (a[l1] == '0');
2183:
2184: }
2185:
2186: a[f + i + 1] = EOL;
2187:
2188: if (a[0] == '-' && a[1] == '0') {
2189:
2190: l1 = 2;
2191:
2192: while (a[l1] != EOL) {
2193:
2194: if (a[l1] >= '1' && a[l1] <= '9') {
2195: l1 = 0;
2196: break;
2197: }
2198:
2199: l1++;
2200:
2201: }
2202:
2203: if (l1) {
2204:
2205: i--;
2206: l1 = 0;
2207:
2208: while ((a[l1] = a[l1 + 1]) != EOL) l1++;
2209:
2210: }
2211: }
2212:
2213: }
2214: else { /* rounding not required */
2215:
2216: if (f + i + 1 > STRLEN) {
2217: merr_raise (M75);
2218: return;
2219: }
2220:
2221: while (j < f + i) a[++j] = '0';
2222:
2223: a[++j] = EOL;
2224:
2225: }
2226:
2227: if (f == 0) a[i] = EOL;
2228:
2229: } /* end of 3 arg-form */
2230:
2231: if (f < l) {
2232:
2233: i = stlen (a) + 1;
2234:
2235: if (++l <= i) goto nxt_operator;
2236:
2237: while (i >= 0) a[l--] = a[i--];
2238: while (l >= 0) a[l--] = SP;
2239:
2240: }
2241:
2242: }
2243:
2244: goto nxt_operator;
2245:
2246:
2247: /* case 'd': *//* $DATA */
2248: /* case 'g': *//* $GET */
2249: /* case 'i': *//* $INCREMENT */
2250: /* case 'n': *//* $NEXT */
2251: /* case ZNEXT: *//* $ZNEXT */
2252: /* case ZPREVIOUS: *//* $ZPREVIOUS */
2253: case 'o': /* $ORDER */
2254:
2255: if (f > 2) {
2256: merr_raise (FUNARG);
2257: return;
2258: }
2259:
2260: stcpy (varnam, argstck[arg]);
2261: ordercnt = intexpr (argstck[arg + 1]);
2262: ordercounter = 0;
2263:
2264: if (varnam[0] != '^') {
2265: symtab (fra_order, varnam, a);
2266: }
2267: else if (varnam[1] != '$') {
2268: global (fra_order, varnam, a);
2269: }
2270: else {
2271: ssvn (fra_order, varnam, a);
2272: }
2273:
2274: goto nxt_operator;
2275:
2276:
2277: case 'q': /* $QUERY */
2278:
2279: if (f > 2) {
2280: merr_raise (FUNARG);
2281: return;
2282: }
2283:
2284: stcpy (varnam, argstck[arg]);
2285: ordercnt = intexpr (argstck[arg + 1]);
2286:
2287: if (varnam[0] == '^' && varnam[1] == '$') {
2288: ssvn (fra_query, varnam, a);
2289: }
2290: else if (ordercnt == 1) {
2291: if (varnam[0] != '^') {
2292: symtab (fra_query, varnam, a);
2293: }
2294: else {
2295: global (fra_query, varnam, a);
2296: }
2297: }
2298: else {
2299: char qryarg_ext[256];
2300:
2301: freem_ref_t *revq_ref = (freem_ref_t *) malloc (sizeof (freem_ref_t));
2302:
2303: /* convert the $QUERY argument from internal to external format */
2304: mref_init (revq_ref, MREF_RT_GLOBAL, "scratch");
2305: internal_to_mref (revq_ref, varnam);
2306: mref_to_external (revq_ref, qryarg_ext);
2307:
2308: stcnv_c2m (qryarg_ext);
2309:
2310: /* put the $QUERY argument into the local variable %INT.REVQ */
1.7 snw 2311: symtab (set_sym, "%INTREVQ\201\201", qryarg_ext);
1.1 snw 2312:
2313: /* set up for calling into polyfill wrapper */
2314: code[0] = '\201';
2315: stcpy (code, "$^%ZREVQRY\201");
2316:
2317: codptr = code;
2318:
2319: f = '$';
2320:
2321: zexflag = TRUE;
2322:
2323: /* run the polyfill wrapper */
2324: goto extra_fun;
2325: }
2326:
2327: goto nxt_operator;
2328:
2329:
2330: case 'N': /* $NAME */
2331:
2332: if (f > 2) {
2333: merr_raise (FUNARG);
2334: return;
2335: }
2336:
2337: f = intexpr (argstck[arg + 1]);
2338:
2339: if (f < 0) {
2340: merr_raise (ARGER);
2341: return;
2342: }
2343:
2344: i = 0;
2345:
2346: while (a[++i] != EOL) {
2347: if (a[i] == DELIM && --f < 0) {
2348: break;
2349: }
2350: }
2351:
2352: a[i] = EOL;
2353:
2354: stcpy (varnam, a);
2355: zname (a, varnam);
2356:
2357: goto nxt_operator;
2358:
2359:
2360: case QLENGTH: /* $QLENGTH */
2361:
2362: if (f != 1) {
2363: merr_raise (FUNARG);
2364: return;
2365: }
2366:
2367: f = 0;
2368: i = 0;
2369:
2370: {
2371: int ch, quote;
2372:
2373: quote = 0;
2374:
2375: while ((ch = a[i++]) != EOL) {
2376:
2377: if (ch == '"') quote = !quote;
2378: if (quote) continue;
2379: if (ch == '(' && f == 0) f = 1;
2380: if (ch == ',') f++;
2381:
2382: }
2383:
2384: }
2385:
2386: intstr (a, f);
2387:
2388: goto nxt_operator;
2389:
2390:
2391: case QSUBSCRIPT: /* $QSUBSCRIPT */
2392:
2393: if (f != 2) {
2394: merr_raise (FUNARG);
2395: return;
2396: }
2397:
2398: if ((f = intexpr (argstck[arg+1])) < -1) {
2399: merr_raise (ARGER);
2400: return;
2401: }
2402:
2403: {
2404: int ch, env, quote, count, startsub;
2405:
2406: if (f == -1) { /* get environment */
2407:
2408: quote = 0;
2409: env = FALSE;
2410: count = 0;
2411: startsub = 0;
2412: i = 0;
2413:
2414: while ((ch = a[i++]) != EOL) {
2415:
2416: if (ch == '"') quote= !quote;
2417: if (quote) continue;
2418:
2419: if (ch == '|') {
2420:
2421: if (env) {
2422: a[i-1] = EOL;
2423: stcpy (a, &a[startsub]);
2424:
2425: break;
2426:
2427: }
2428: else {
2429: startsub = i;
2430: env = TRUE;
2431: }
2432:
2433: }
2434:
2435: }
2436:
2437: if (!env) *a= EOL;
2438:
2439: }
2440: else {
2441:
2442: quote = 0;
2443: env = FALSE;
2444: count = 0;
2445: startsub = 0;
2446: i = 0;
2447:
2448: while ((ch=a[i++])!=EOL) {
2449:
2450: if (ch == '"') quote = !quote;
2451: if (quote) continue;
2452:
2453: if (ch == '|' && count == 0) {
2454:
2455: if (env) {
2456:
2457: if (*a == '^') a[--i] = '^';
2458:
2459: startsub = i;
2460:
2461: }
2462: else {
2463: env = TRUE;
2464: }
2465:
2466: }
2467:
2468: if (ch == '(' || ch == ',' || ch == ')') {
2469:
2470: if (count == f) {
2471: a[i-1] = EOL;
2472: break;
2473: }
2474:
2475: count++;
2476: startsub = i;
2477:
2478: }
2479:
2480: }
2481:
2482: if (startsub) stcpy (a, &a[startsub]);
2483:
2484: if (count < f) *a = EOL;
2485:
2486: }
2487: if (a[0] == '"') { /* un-quote */
2488:
2489: quote = 1;
2490: i = 1;
2491: f = 0;
2492:
2493: while ((ch = a[i++]) != EOL) {
2494:
2495: if (ch == '"') quote = !quote;
2496:
2497: if (quote) a[f++] = ch;
2498:
2499: }
2500:
2501: a[f] = EOL;
2502:
2503: }
2504:
2505: }
2506:
2507: /* goto nxt_operator; */
2508:
2509:
2510: case 's': /* $SELECT */
2511:
2512: goto nxt_operator;
2513:
2514:
2515: case SVNstack: /* $STACK() */
2516:
2517: if (f > 2) {
2518: merr_raise (FUNARG);
2519: return;
2520: }
2521:
2522: if (f == 1) {
2523:
2524: char iex_buf[256];
2525: int iexp;
2526:
2527: stcpy (iex_buf, argstck[arg]);
2528: iexp = atoi (iex_buf);
2529:
2530: /*set_io (UNIX);
2531: printf ("iexp = %d\n", iexp);
2532: set_io (MUMPS);
2533: */
2534:
2535: if (iexp == -1) {
2536: intstr (a, merr_topstk);
2537: }
2538: else if (iexp == 0) {
2539: stcpy (a, stack0);
2540: }
2541: else if (iexp > 0 && iexp <= merr_topstk) {
2542:
2543: if (merr_topstk > nstx) {
2544: stcpy (a, merr_stack[merr_topstk].ECODE);
2545: }
2546: else {
2547: if (nestc[iexp] == '$') {
2548: stcpy (a, "$$\201");
2549: }
2550: else {
2551: if ((mtok_token_to_command (a, nestc[iexp])) != 1) {
2552: stcpy (a, "???");
2553: }
2554: }
2555: }
2556:
2557: }
2558: else {
2559: merr_raise (FUNARG);
2560: return;
2561: }
2562:
2563: }
2564:
2565: if (f == 2) {
2566:
2567: int stkidx;
2568: char sub[255];
2569: char indst[255];
2570: stcpy (indst, argstck[arg]);
2571: stcnv_m2c (indst);
2572:
2573: stkidx = atoi (indst);
2574:
2575: if (stkidx > NESTLEVLS || stkidx < 0) {
2576: merr_raise (FUNARG);
2577: return;
2578: }
2579:
2580: stcpy (sub, argstck[2]);
2581: stcnv_m2c (sub);
2582:
2583: if (strcmp (sub, "MCODE") == 0) {
2584: strcpy (a, merr_stack[stkidx].MCODE);
2585: }
2586: else if (strcmp (sub, "ECODE") == 0) {
2587: strcpy (a, merr_stack[stkidx].ECODE);
2588: }
2589: else if (strcmp (sub, "PLACE") == 0) {
2590: strcpy (a, merr_stack[stkidx].PLACE);
2591: }
2592: else {
2593: merr_raise (SYNTERR);
2594: return;
2595: }
2596:
2597: stcnv_c2m (a);
2598:
2599: }
2600:
2601:
2602: goto nxt_operator;
2603:
2604:
2605: case FNUMBER: /* $FNUMBER */
2606:
2607: if (f < 2 || f > 3) {
2608: merr_raise (FUNARG);
2609: return;
2610: }
2611:
2612: {
2613:
2614: short l1;
2615: short Pflag;
2616: short Tflag;
2617: short commaflag;
2618: short plusflag;
2619: short minusflag;
2620: short EuroFlag;
2621: short IsZero;
2622:
2623: Pflag = FALSE,
2624: Tflag = FALSE,
2625: commaflag = FALSE,
2626: plusflag = FALSE,
2627: minusflag = FALSE,
2628: EuroFlag = FALSE,
2629: IsZero = FALSE;
2630:
2631: b = argstck[arg + 1];
2632:
2633: while ((i = *b++) != EOL) { /* evaluate options */
2634:
2635: switch (i) {
2636:
2637:
2638: case 'P':
2639:
2640: Pflag = TRUE;
2641: continue;
2642:
2643:
2644: case 'p':
2645:
2646: if (lowerflag) Pflag = TRUE;
2647: continue;
2648:
2649:
2650: case 'T':
2651:
2652: Tflag = TRUE;
2653: continue;
2654:
2655:
2656: case 't':
2657:
2658: if (lowerflag) Tflag = TRUE;
2659: continue;
2660:
2661:
2662: case ',':
2663:
2664: commaflag = TRUE;
2665: continue;
2666:
2667:
2668: case '.':
2669:
2670: EuroFlag = TRUE;
2671: continue;
2672:
2673:
2674: case '+':
2675:
2676: plusflag = TRUE;
2677: continue;
2678:
2679:
2680: case '-':
2681:
2682: minusflag = TRUE;
2683:
2684:
2685: }
2686: }
2687:
2688: if (Pflag && (Tflag || plusflag || minusflag)) {
2689: merr_raise (ARGER);
2690: return;
2691: }
2692:
2693: if (f == 3) j = intexpr (argstck[arg + 2]); /* 3rd arg */
2694:
2695: if (merr () == MXNUM) {
2696:
2697: if (j >= 0) j = 256;
2698:
2699: merr_raise (OK);
2700:
2701: }
2702:
2703: numlit (a);
2704: IsZero = (a[0] == '0');
2705:
2706: if (f == 3) {
2707:
2708: f = j;
2709:
2710: if (f < 0) {
2711: merr_raise (ARGER);
2712: return;
2713: }
2714:
2715: if (f > STRLEN) {
2716: merr_raise (M75);
2717: return;
2718: }
2719:
2720: /* s j=$l(a),i=$f(a,".")-1 */
2721: j = (a[0] == '-');
2722:
2723: if (a[j] == '.') { /* insert leading zero */
2724:
2725: i = j;
2726:
2727: while (a[i++] != EOL);
2728:
2729: while (i > j) {
2730: a[i] = a[i - 1];
2731: i--;
2732: }
2733:
2734: a[j] = '0';
2735:
2736: }
2737:
2738: i = (-1);
2739: j = 0;
2740:
2741: while (a[j] != EOL) {
2742:
2743: if (a[j] == '.') i = j;
2744:
2745: j++;
2746:
2747: }
2748:
2749: if (i < 0) {
2750: a[i = j] = '.';
2751: a[j + 1] = EOL;
2752: }
2753: else {
2754: j--;
2755: }
2756:
2757: if (j - i > f) { /* rounding required */
2758:
2759: l1 = f + i + 1;
2760:
2761: if (a[l1] > '4') {
2762:
2763: do {
2764:
2765: if (a[--l1] == '.') l1--;
2766:
2767: if (l1 < 0) {
2768:
2769: for (l1 = f + i + 1; l1 > 0; l1--) {
2770: a[l1] = a[l1 - 1];
2771: }
2772:
2773: a[0] = '1';
2774: i++;
2775:
2776: break;
2777:
2778: }
2779:
2780: a[l1]++;
2781:
2782: if (a[l1] == ':') a[l1] = '0';
2783:
2784: } while (a[l1] == '0');
2785:
2786: }
2787:
2788: a[f + i + 1] = EOL;
2789:
2790: if (a[0] == '-' && a[1] == '0') {
2791:
2792: l1 = 2;
2793:
2794: while (a[l1] != EOL) {
2795:
2796: if (a[l1] >= '1' && a[l1] <= '9') {
2797: l1 = 0;
2798: break;
2799: }
2800:
2801: l1++;
2802:
2803: }
2804:
2805: if (l1) {
2806:
2807: i--;
2808: l1 = 0;
2809:
2810: while ((a[l1] = a[l1 + 1]) != EOL) l1++;
2811:
2812: }
2813:
2814: }
2815:
2816: }
2817: else {
2818:
2819: if (f + i > STRLEN) {
2820: merr_raise (M75);
2821: return;
2822: }
2823:
2824: while (j < f + i) a[++j] = '0';
2825:
2826: a[++j] = EOL;
2827: }
2828:
2829: if (f == 0) a[i] = EOL;
2830:
2831: } /* end of 3 arg-form */
2832:
2833: if (commaflag) {
2834:
2835: i = 0;
2836:
2837: while ((f = a[i]) != '.' && f != EOL) i++;
2838:
2839: if (a[0] == '-') {
2840:
2841: f = (i + 1) % 3;
2842: j = 1;
2843: i = 1;
2844: tmp[0] = '-';
2845:
2846: }
2847: else {
2848:
2849: f = (i + 2) % 3;
2850: j = 0;
2851: i = 0;
2852:
2853: }
2854:
2855: while ((tmp[j++] = a[i]) != EOL) {
2856:
2857: if (j >= STRLEN) {
2858: merr_raise (M75);
2859: return;
2860: }
2861:
2862: if (a[i++] == '.') f = -1; /* do not insert comma after point */
2863:
2864: if (f-- == 0 && a[i] != EOL && a[i] != '.') {
2865: f = 2;
2866: tmp[j++] = ',';
2867: }
2868:
2869: }
2870:
2871: stcpy (a, tmp);
2872:
2873: }
2874:
2875: if (EuroFlag && !standard) { /* exchange point and comma */
2876:
2877: i = 0;
2878:
2879: while ((f = a[i]) != EOL) {
2880:
2881: if (f == '.') a[i] = ',';
2882: if (f == ',') a[i] = '.';
2883:
2884: i++;
2885:
2886: }
2887:
2888: }
2889:
2890: if (Tflag) {
2891:
2892: i = stcpy (tmp, a);
2893:
2894: if (plusflag && tmp[0] != '-' && !IsZero) {
2895:
2896: tmp[i] = '+';
2897: tmp[++i] = EOL;
2898: stcpy (a, tmp);
2899:
2900: }
2901: else if (tmp[0] == '-') {
2902:
2903: tmp[i] = minusflag ? SP : '-';
2904: tmp[++i] = EOL;
2905: stcpy (a, &tmp[1]);
2906:
2907: }
2908: else {
2909:
2910: tmp[i] = SP;
2911: tmp[++i] = EOL;
2912: stcpy (a, tmp);
2913:
2914: }
2915:
2916: goto nxt_operator;
2917:
2918: }
2919:
2920: if (Pflag) {
2921:
2922: i = stcpy (&tmp[1], a);
2923:
2924: if (a[0] == '-') {
2925:
2926: a[0] = '(';
2927: a[i] = ')';
2928: a[++i] = EOL;
2929:
2930: }
2931: else {
2932:
2933: tmp[0] = SP;
2934: tmp[++i] = SP;
2935: tmp[++i] = EOL;
2936:
2937: stcpy (a, tmp);
2938: }
2939:
2940: goto nxt_operator;
2941:
2942: }
2943:
2944: if (plusflag && a[0] != '-' && !IsZero) {
2945: stcpy (tmp, a);
2946: a[0] = '+';
2947: stcpy (&a[1], tmp);
2948: }
2949:
2950: if (minusflag && a[0] == '-') {
2951: stcpy (tmp, &a[1]);
2952: stcpy (a, tmp);
2953: }
2954:
2955: }
2956:
2957: goto nxt_operator;
2958:
2959:
2960: case REVERSE: /* $REVERSE */
2961:
2962: if (f != 1) {
2963: merr_raise (FUNARG);
2964: return;
2965: }
2966:
2967: i = stlen (a) - 1;
2968: j = i / 2;
2969: i = i - j;
2970:
2971: while (j >= 0) {
2972: f = a[j];
2973: a[j--] = a[i];
2974: a[i++] = f;
2975: }
2976:
2977: goto nxt_operator;
2978:
2979:
2980: case 't': /* $TEXT */
2981:
2982: {
2983: long l1, rouoldc;
2984: short reload = FALSE;
2985:
2986: if (f > 3) {
2987: merr_raise (FUNARG);
2988: return;
2989: }
2990:
2991: i = 0;
2992:
2993: if (f > 1) {
2994: stcpy (tmp, argstck[arg + 1]);
2995: i = intexpr (tmp);
2996: }
2997:
2998: if (a[0] == EOL) {
2999:
3000: if (i < 0) {
3001: merr_raise (ARGER);
3002: return;
3003: }
3004:
3005: /* $T(+0) returns routine name */
3006: if (i == 0) {
3007:
3008: if (f != 3) {
3009: stcpy (a, rou_name);
3010: }
3011: else {
3012: stcpy (a, argstck[arg + 2]);
3013: }
3014:
3015: goto nxt_operator;
3016:
3017: }
3018:
3019: }
3020:
3021: if (f == 3) {
3022:
3023: reload = TRUE; /* load routine; */
3024: f = mcmnd;
3025: mcmnd = 'd'; /* make load use standard-path */
3026:
3027: stcpy (tmp, argstck[arg + 2]);
3028:
3029: rouoldc = roucur - rouptr;
3030:
3031: zload (tmp);
3032:
3033: mcmnd = f;
3034:
3035: if (merr () > OK) {
3036:
3037: zload (rou_name);
3038:
3039: if (merr () == NOPGM) {
3040: ierr -= NOPGM; /* smw 15 nov 2023 TODO HUH?? */
3041: *a = EOL;
3042:
3043: goto nxt_operator;
3044: }
3045:
3046: return;
3047:
3048: }
3049:
3050: }
3051:
3052: j = 0;
3053: f = 1;
3054:
3055: if (a[0] != EOL) { /* 1st arg == label */
3056:
3057: for (;;) {
3058:
3059: if (j >= (rouend - rouptr)) {
3060: a[0] = EOL;
3061: goto t_end;
3062: }
3063:
3064: l1 = j;
3065: f = 0;
3066:
3067: while (*(rouptr + (++l1)) == a[f++]);
3068:
3069: if (a[--f] == EOL && (*(rouptr + l1) == TAB || *(rouptr + l1) == SP || *(rouptr + l1) == '(')) break;
3070:
3071: j += (UNSIGN (*(rouptr + j)) + 2); /* skip line */
3072:
3073: }
3074:
3075: f = 0;
3076:
3077: }
3078:
3079: if (i > 0) {
3080:
3081: while (f < i) {
3082:
3083: if ((j = j + (UNSIGN (*(rouptr + j))) + 2) >= (rouend - rouptr)) {
3084: a[0] = EOL;
3085: goto t_end;
3086: }
3087:
3088: f++;
3089:
3090: }
3091:
3092: }
3093:
3094: if (i < 0) {
3095:
3096: j--;
3097:
3098: while (f != i) {
3099:
3100: while (*(rouptr + (--j)) != EOL && j >= 0);
3101:
3102: if (--f != i && j < 1) {
3103: a[0] = EOL;
3104: goto t_end;
3105: }
3106:
3107: }
3108:
3109: j++;
3110:
3111: }
3112:
3113: f = (-1);
3114: j++;
3115:
3116: while ((a[++f] = (*(rouptr + (j++)))) != EOL) {
3117: if (a[f] == TAB || a[f] == SP)
3118: break;
3119: }
3120:
3121: if (j >= (rouend - rouptr - 1)) {
3122: a[0] = EOL;
3123: }
3124: else {
3125:
3126: a[f] = SP;
3127:
3128: while ((*(rouptr + j)) == TAB || (*(rouptr + j)) == SP) {
3129: j++;
3130: a[++f] = SP;
3131: }
3132:
3133: stcpy (&a[++f], rouptr + j);
3134:
3135: }
3136:
3137: t_end:
3138: if (reload) {
3139: zload (rou_name);
3140: roucur = rouptr + rouoldc;
3141: } /* reload routine; */
3142:
3143: }
3144:
3145: goto nxt_operator;
3146:
3147:
3148: case TRANSLATE: /* $TRANSLATE */
3149:
3150: if (f > 3 || f < 2) {
3151: merr_raise (FUNARG);
3152: return;
3153: }
3154:
3155: {
3156: short l1, m;
3157: char *c;
3158:
3159: b = argstck[arg + 1];
3160: c = argstck[arg + 2];
3161:
3162: if (f == 2) {
3163: l1 = 0;
3164: }
3165: else {
3166: l1 = stlen (c); /* $l of 3rd arg */
3167: }
3168:
3169: m = 0;
3170: f = 0;
3171:
3172: while ((ch = a[f++]) != EOL) {
3173:
3174: j = 0;
3175:
3176: while (b[j] != EOL) {
3177:
3178: if (ch == b[j]) {
3179:
3180: if (j < l1) {
3181: ch = c[j];
3182: }
3183: else {
3184: ch = EOL;
3185: }
3186:
3187: break;
3188:
3189: }
3190:
3191: j++;
3192:
3193: }
3194:
3195: if (ch != EOL) a[m++] = ch;
3196:
3197: }
3198:
3199: a[m] = EOL;
3200:
3201: }
3202:
3203: goto nxt_operator;
3204:
3205: case TYPE:
3206: {
3207: char piv[255];
3208:
3209: if (f != 1) {
3210: merr_raise (FUNARG);
3211: return;
3212: }
3213:
3214: stcpy (piv, argstck[arg]);
3215: stcnv_m2c (piv);
3216:
3217: obj_get_attribute (piv, "CLASS", a);
3218: stcnv_c2m (a);
3219:
3220: goto nxt_operator;
3221: }
3222:
3223: case INSTANCEOF:
3224: {
3225: char io_inst[255];
3226: char io_cls[255];
3227: short io_res;
3228:
3229: if (f != 2) {
3230: merr_raise (FUNARG);
3231: return;
3232: }
3233:
3234: stcpy (io_inst, argstck[arg]);
3235: stcpy (io_cls, argstck[arg + 1]);
3236:
3237: stcnv_m2c (io_inst);
3238: stcnv_m2c (io_cls);
3239:
3240: io_res = obj_instance_of (io_inst, io_cls);
3241:
3242: intstr (a, (int) io_res);
3243:
3244: goto nxt_operator;
3245: }
3246: case 'r': /* $RANDOM */
3247:
3248: if (f != 1) {
3249: merr_raise (FUNARG);
3250: return;
3251: }
3252:
3253: {
3254: long ilong;
3255:
3256: nrandom = (ran_a * nrandom + ran_b) % ran_c;
3257:
3258: if ((i = intexpr (a)) < 1) {
3259: merr_raise (ARGER);
3260: return;
3261: }
3262:
3263: ilong = (nrandom * i) / ran_c;
3264:
3265: if (ilong < 0) ilong += i;
3266:
3267: lintstr (a, ilong);
3268:
3269: }
3270:
3271: goto nxt_operator;
3272:
3273:
3274: /* $VIEW */
3275: case 'v':
3276:
3277: view_fun (f, a);
3278:
3279: if (merr () > 0) return;
3280:
3281: goto nxt_operator;
3282:
3283:
3284: /* $ZBOOLEAN */
3285: case 'B':
3286:
3287: if (f != 3) {
3288: merr_raise (FUNARG);
3289: return;
3290: }
3291:
3292: i = 0;
3293: ch = intexpr (argstck[arg + 2]) % 16;
3294: b = argstck[arg + 1];
3295:
3296: if (*b == EOL) {
3297: *b = 0;
3298: b[1] = 0;
3299: }
3300:
3301: f = 0;
3302:
3303: switch (ch) {
3304:
3305:
3306: /* 1: A AND B */
3307: case 1:
3308:
3309: while (a[i] != EOL) {
3310:
3311: a[i] &= b[f];
3312: i++;
3313:
3314: if (b[++f] == EOL) f = 0;
3315:
3316: }
3317:
3318: break;
3319:
3320:
3321: /* 7: A OR B */
3322: case 7:
3323:
3324: while (a[i] != EOL) {
3325:
3326: a[i] |= b[f];
3327: i++;
3328:
3329: if (b[++f] == EOL) f = 0;
3330:
3331: }
3332:
3333: break;
3334:
3335:
3336: /* 6: A XOR B */
3337: case 6:
3338:
3339: while (a[i] != EOL) {
3340:
3341: a[i] = (a[i] ^ b[f]) & (eightbit ? 0377 : 0177);
3342: i++;
3343:
3344: if (b[++f] == EOL) f = 0;
3345:
3346: }
3347:
3348: break;
3349:
3350:
3351: /* 14: A NAND B */
3352: case 14:
3353:
3354: while (a[i] != EOL) {
3355:
3356: a[i] = ~(a[i] & b[f]) & (eightbit ? 0377 : 0177);
3357: i++;
3358:
3359: if (b[++f] == EOL) f = 0;
3360:
3361: }
3362:
3363: break;
3364:
3365:
3366: /* 8: A NOR B */
3367: case 8:
3368:
3369: while (a[i] != EOL) {
3370:
3371: a[i] = ~(a[i] | b[f]) & (eightbit ? 0377 : 0177);
3372: i++;
3373:
3374: if (b[++f] == EOL) f = 0;
3375:
3376: }
3377:
3378: break;
3379:
3380:
3381: /* 9: A EQUALS B */
3382: case 9:
3383:
3384: while (a[i] != EOL) {
3385:
3386: a[i] = ~(a[i] ^ b[f]) & (eightbit ? 0377 : 0177);
3387: i++;
3388:
3389: if (b[++f] == EOL) f = 0;
3390:
3391: }
3392:
3393: break;
3394:
3395:
3396: /* 2: A AND NOT B */
3397: case 2:
3398:
3399: while (a[i] != EOL) {
3400:
3401: a[i] &= ~b[f];
3402: i++;
3403:
3404: if (b[++f] == EOL) f = 0;
3405:
3406: }
3407:
3408: break;
3409:
3410:
3411: /* 11: A OR NOT B */
3412: case 11:
3413:
3414: while (a[i] != EOL) {
3415:
3416: a[i] = (a[i] | ~b[f]) & (eightbit ? 0377 : 0177);
3417: i++;
3418:
3419: if (b[++f] == EOL) f = 0;
3420:
3421: }
3422:
3423: break;
3424:
3425:
3426: /* 13: NOT A OR B */
3427: case 13:
3428:
3429: while (a[i] != EOL) {
3430:
3431: a[i] = (~a[i] | b[f]) & (eightbit ? 0377 : 0177);
3432: i++;
3433:
3434: if (b[++f] == EOL) f = 0;
3435:
3436: }
3437:
3438: break;
3439:
3440:
3441: /* 4: NOT A AND B */
3442: case 4:
3443:
3444: while (a[i] != EOL) {
3445:
3446: a[i] = ~a[i] & b[f];
3447: i++;
3448:
3449: if (b[++f] == EOL) f = 0;
3450:
3451: }
3452:
3453: break;
3454:
3455:
3456: /* 5: B */
3457: case 5:
3458:
3459: while (a[i] != EOL) {
3460:
3461: a[i++] = b[f];
3462:
3463: if (b[++f] == EOL) f = 0;
3464:
3465: }
3466:
3467: break;
3468:
3469:
3470: /* 10: NOT B */
3471: case 10:
3472:
3473: while (a[i] != EOL) {
3474:
3475: a[i++] = ~b[f] & 0177;
3476:
3477: if (b[++f] == EOL) f = 0;
3478:
3479: }
3480:
3481: break;
3482:
3483:
3484: /* 12: NOT A */
3485: case 12:
3486:
3487: while (a[i] != EOL) {
3488:
3489: a[i] = ~a[i] & 0177;
3490: i++;
3491:
3492: if (b[++f] == EOL) f = 0;
3493:
3494: }
3495:
3496: break;
3497:
3498:
3499: /* 0: always FALSE */
3500: case 0:
3501:
3502: while (a[i] != EOL)
3503: a[i++] = 0;
3504: break;
3505:
3506:
3507: /* 15: always TRUE */
3508: case 15:
3509:
3510: ch = (char) 0177;
3511: while (a[i] != EOL)
3512: a[i++] = ch;
3513: /* 3: A */
3514:
3515: }
3516:
3517: goto nxt_operator;
3518:
3519:
3520: /* ZCRC "cyclic redundancy check" check sums */
3521: case ZCRC:
3522:
3523: if (f == 1) {
3524: f = 0; /* missing 2nd arg defaults to "0" */
3525: }
3526: else {
3527:
3528: if (f != 2) {
3529: merr_raise (FUNARG);
3530: return;
3531: }
3532:
3533: if ((f = intexpr (argstck[arg + 1])) != 0 && f != 1) {
3534: merr_raise (ARGER);
3535: return;
3536: }
3537:
3538: }
3539:
3540: i = 0;
3541:
3542: if (f == 0) { /* XORing */
3543:
3544: f = 0;
3545:
3546: while (a[i] != EOL) f ^= a[i++];
3547:
3548: f = f & 0377;
3549:
3550: }
3551: else { /* ASCII sum */
3552:
3553: f = 0;
3554:
3555: while (a[i] != EOL) f += a[i++];
3556:
3557: }
3558:
3559: intstr (a, f);
3560:
3561: goto nxt_operator;
3562:
3563:
3564: /* $ZFUNCTIONKEY */
3565: case 'F':
3566:
3567: if (f != 1) {
3568: merr_raise (FUNARG);
3569: return;
3570: }
3571:
3572: if ((i = intexpr (a)) < 1 || i > 44) {
3573: merr_raise (FUNARG);
3574: return;
3575: }
3576:
3577: stcpy (a, zfunkey[i - 1]);
3578:
3579: goto nxt_operator;
3580:
3581:
3582: case 'P': /* $ZPIECE */
3583:
3584: /* Similar to $PIECE */
3585: /* The difference is, that stuff within quotes is not */
3586: /* counted as delimiter. nor is stuff within brackets */
3587:
3588: {
3589: short l, l1, m, n;
3590: short quo = 0; /* quotes */
3591: short bra = 0; /* brackets */
3592: char ch0;
3593:
3594: b = argstck[arg + 1];
3595: l1 = b - a - 1; /* length of 1st argument */
3596:
3597: switch (f) {
3598:
3599:
3600: case 2:
3601:
3602: f = 1;
3603: l = 1;
3604:
3605: break;
3606:
3607:
3608: case 3:
3609:
3610: if ((f = intexpr (argstck[arg + 2])) <= 0) {
3611: a[0] = EOL;
3612: goto nxt_operator;
3613: }
3614:
3615: if (merr () == MXNUM) {
3616: if (f >= 0) f = 256;
3617: merr_raise (OK);
3618: }
3619:
3620: l = f;
3621: break;
3622:
3623:
3624: case 4:
3625:
3626: l = intexpr (argstck[arg + 3]);
3627:
3628: if (merr () == MXNUM) {
3629:
3630: if (l >= 0) l = 256;
3631:
3632: merr_raise (OK);
3633:
3634: }
3635:
3636: if ((f = intexpr (argstck[arg + 2])) <= 0) f = 1;
3637:
3638: if (merr () == MXNUM) {
3639:
3640: if (f >= 0) f = 256;
3641:
3642: merr_raise (OK);
3643:
3644: }
3645:
3646: if (f > l) {
3647: a[0] = EOL;
3648: goto nxt_operator;
3649: }
3650:
3651: break;
3652:
3653:
3654: default:
3655:
3656: merr_raise (FUNARG);
3657: return;
3658:
3659: }
3660:
3661: i = 0;
3662: m = 0;
3663: ch = 0;
3664:
3665: while (b[ch] != EOL) ch++; /* $l of 2nd arg */
3666:
3667: if (ch == 1) {
3668:
3669: ch = b[0];
3670: j = 1;
3671:
3672: if (f > 1) {
3673:
3674: while (i < l1) { /* scan 1st string ... */
3675:
3676: ch0 = a[i++];
3677:
3678: if (ch != '"') {
3679:
3680: if (ch0 == '"') {
3681: toggle (quo);
3682: continue;
3683: }
3684:
3685: if (quo) continue;
3686:
3687: }
3688:
3689: if (ch0 == '(') bra++;
3690: if (ch0 == ')') bra--;
3691:
3692: if (ch0 != ch) continue;
3693: if (bra > 1) continue;
3694: if ((ch0 != '(') && bra) continue;
3695:
3696: if (++j == f) {
3697: m = i;
3698: goto zp10;
3699: }
3700:
3701: }
3702:
3703: /* if(j<f) */
3704: a[0] = EOL;
3705:
3706: goto nxt_operator;
3707:
3708: }
3709:
3710: zp10:
3711:
3712: for (; i < l1; i++) {
3713:
3714: ch0 = a[i];
3715:
3716: if (ch != '"') {
3717:
3718: if (ch0 == '"') {
3719: toggle (quo);
3720: continue;
3721: }
3722:
3723: if (quo) continue;
3724:
3725: }
3726:
3727: if (ch0 == '(') bra++;
3728: if (ch0 == ')') bra--;
3729: if (ch0 != ch) continue;
3730: if (bra > 1) continue;
3731: if ((ch0 != '(') && bra) continue;
3732:
3733: if (j == l) {
3734: a[i] = EOL;
3735: break;
3736: }
3737:
3738: j++;
3739:
3740: }
3741:
3742: if (m > 0) stcpy (a, &a[m]);
3743:
3744: goto nxt_operator;
3745:
3746: }
3747:
3748: if (ch == 0) {
3749: a[0] = EOL;
3750: goto nxt_operator;
3751: } /* 2nd arg is empty */
3752:
3753: /* else (ch>1) $Length of Delimiter>1 */
3754: n = 1;
3755:
3756: if (f > 1) {
3757:
3758: while (i < l1) { /* scan 1st string ... */
3759:
3760: j = 0;
3761:
3762: if ((ch0 = a[i]) == '"') {
3763: toggle (quo);
3764: i++;
3765:
3766: continue;
3767: }
3768:
3769: if (quo) {
3770: i++;
3771: continue;
3772: }
3773:
3774: if (ch0 == '(') {
3775: bra++;
3776: i++;
3777:
3778: continue;
3779: }
3780:
3781: if (ch0 == ')') {
3782: bra--;
3783: i++;
3784:
3785: continue;
3786: }
3787:
3788: if (bra) {
3789: i++;
3790: continue;
3791: }
3792:
3793: zp20:
3794: if (a[i + j] != b[j]) {
3795: i++;
3796: continue;
3797: } /* ... for occurence of 2nd */
3798:
3799: if (++j < ch) goto zp20;
3800:
3801: i += ch; /* skip delimiter */
3802:
3803: if (++n == f) {
3804: m = i;
3805: goto zp30;
3806: }
3807: }
3808:
3809: /* if(n<f) */ a[0] = EOL;
3810:
3811: goto nxt_operator;
3812: }
3813:
3814: zp30:
3815:
3816: while (i < l1) {
3817:
3818: j = 0;
3819:
3820: if ((ch0 = a[i]) == '"') {
3821: toggle (quo);
3822: i++;
3823:
3824: continue;
3825: }
3826:
3827: if (quo) {
3828: i++;
3829: continue;
3830: }
3831:
3832: if (ch0 == '(') {
3833: bra++;
3834: i++;
3835:
3836: continue;
3837: }
3838:
3839: if (ch0 == ')') {
3840: bra--;
3841: i++;
3842:
3843: continue;
3844: }
3845:
3846: if (bra) {
3847: i++;
3848: continue;
3849: }
3850:
3851: zp40:
3852: if (a[i + j] != b[j]) {
3853: i++;
3854: continue;
3855: }
3856:
3857: if (++j < ch) goto zp40;
3858:
3859: if (n == l) {
3860: a[i] = EOL;
3861: break;
3862: } /* last $zpiece: done! */
3863:
3864: i += ch;
3865: n++;
3866:
3867: }
3868:
3869: if (m > 0) stcpy (a, &a[m]);
3870:
3871: goto nxt_operator;
3872:
3873: }
3874:
3875: case 'L': /* $ZLENGTH */
3876:
3877: /* Similar to $LENGTH with two arguments */
3878: /* The difference is, that stuff within quotes is not */
3879: /* counted as delimiter. nor is stuff within brackets */
3880:
3881: if (f != 2) {
3882: merr_raise (FUNARG);
3883: return;
3884: }
3885:
3886: i = 0;
3887: j = 0;
3888:
3889: b = argstck[arg + 1];
3890:
3891: if ((f = stlen (b))) {
3892: int quo,
3893: bra,
3894: ch0;
3895:
3896: quo = 0;
3897: bra = 0;
3898:
3899: if (f == 1) { /* length of delimiter =1 char */
3900:
3901: ch = b[0];
3902: j = 0;
3903:
3904: for (;;) {
3905:
3906: ch0 = a[i++];
3907:
3908: if (ch0 == EOL) break;
3909:
3910: if (ch != '"') {
3911:
3912: if (ch0 == '"') {
3913: toggle (quo);
3914: continue;
3915: }
3916:
3917: if (quo) continue;
3918:
3919: }
3920:
3921: if (ch0 == '(') bra++;
3922: if (ch0 == ')') bra--;
3923: if (ch0 != ch) continue;
3924: if (bra > 1) continue;
3925: if ((ch0 != '(') && bra) continue;
3926:
3927: j++;
3928: }
3929:
3930:
3931: j++;
3932:
3933: }
3934: else {
3935:
3936: int n;
3937:
3938: j = 1;
3939:
3940: for (;;) {
3941:
3942: n = 0;
3943:
3944: if ((ch0 = a[i]) == '"') {
3945: toggle (quo);
3946: i++;
3947:
3948: continue;
3949: }
3950:
3951: if (ch0 == EOL) break;
3952:
3953: if (quo) {
3954: i++;
3955: continue;
3956: }
3957:
3958: if (ch0 == '(') {
3959: bra++;
3960: i++;
3961:
3962: continue;
3963: }
3964:
3965: if (ch0 == ')') {
3966: bra--;
3967: i++;
3968:
3969: continue;
3970: }
3971:
3972: if (bra) {
3973: i++;
3974: continue;
3975: }
3976:
3977: zl10:
3978:
3979: if (a[i + n] != b[n]) {
3980: i++;
3981: continue;
3982: }
3983:
3984: if (++n < f) goto zl10;
3985:
3986: i += f; /* skip delimiter */
3987: j++;
3988:
3989: }
3990: }
3991: }
3992:
3993: intstr (a, j);
3994: goto nxt_operator;
3995:
3996: case ZLSD: /* $ZLSD levenshtein function */
3997:
3998: if (f != 2) {
3999: merr_raise (FUNARG);
4000: return;
4001: }
4002:
4003: f = levenshtein (a, argstck[arg + 1]);
4004: intstr (a, f);
4005:
4006: goto nxt_operator;
4007:
4008:
4009: /* $ZKEY */
4010: /* transform a string to be used as a key in an array so */
4011: /* the result string will collate in the desired way */
4012: /* according to the production rule specified by VIEW 93 */
4013: case 'K':
4014:
4015: if (f == 2) {
4016: zkey (a, intexpr (argstck[arg + 1]));
4017: }
4018: else if (f == 1) {
4019: zkey (a, v93);
4020: }
4021: else {
4022: merr_raise (FUNARG);
4023: }
4024:
4025: if (merr () > OK) return;
4026:
4027: goto nxt_operator;
4028:
4029:
4030: /* $ZREPLACE */
4031: /* Replace in first argument non overlapping occurences */
4032: /* of the second argument by the third argument. */
4033: /* if the third argument is missing, assume it to be empty */
4034: case 'R':
4035:
4036: if (f == 3) {
4037: zreplace (a, argstck[arg + 1], argstck[arg + 2]);
4038: }
4039: else if (f == 2) {
4040: zreplace (a, argstck[arg + 1], "\201");
4041: }
4042: else {
4043: merr_raise (FUNARG);
4044: }
4045:
4046: if (merr () > OK) return;
4047:
4048: goto nxt_operator;
4049:
4050:
4051: /* $ZSYNTAX */
4052:
4053: case 'S':
4054:
4055: if (f != 1) {
4056: merr_raise (FUNARG);
4057: return;
4058: }
4059:
4060: zsyntax (a);
4061:
4062: if (merr () > OK) return;
4063:
4064: goto nxt_operator;
4065:
4066:
4067: /* $ZTIME()/$ZDATE() */
4068: case 'T':
4069: case 'D':
4070:
4071: {
4072: time_t unix_epoch;
4073: char *horo_time = a;
4074: char fmt_string[120];
4075: struct tm *zdate_time;
4076:
4077: if (f > 2) {
4078: merr_raise (FUNARG);
4079: return;
4080: }
4081:
4082: if (!is_horolog (horo_time)) {
4083: merr_raise (ZINVHORO);
4084: return;
4085: }
4086:
4087: if (f == 2) {
4088: stcpy (fmt_string, argstck[arg + 1]);
4089: }
4090: else if (f == 1) {
4091: char zdf_key[50];
4092:
4093: switch (i) {
4094:
4095: case 'D':
4096: sprintf (zdf_key, "^$JOB\202%d\202ZDATE_FORMAT\201", pid);
4097: break;
4098:
4099: case 'T':
4100: sprintf (zdf_key, "^$JOB\202%d\202ZTIME_FORMAT\201", pid);
4101: break;
4102:
4103: }
4104:
4105: ssvn (get_sym, zdf_key, fmt_string);
4106: }
4107:
4108: stcnv_m2c (fmt_string);
4109:
4110: unix_epoch = horolog_to_unix (horo_time);
4111: zdate_time = localtime (&unix_epoch);
4112:
4113: strftime (a, 255, fmt_string, zdate_time);
4114:
4115: stcnv_c2m (a);
4116:
4117: goto nxt_operator;
4118: }
4119:
4120:
4121: /* $ZHOROLOG() */
4122: /* convert string date to $H format */
4123: case 'H':
4124: {
4125: char *time_str = a;
4126: char *fmt_string = argstck[arg + 1];
4127: struct tm zhoro_tm;
4128: unsigned long ilong;
4129: unsigned long ilong1;
4130:
4131: if (f != 2) {
4132: merr_raise (FUNARG);
4133: return;
4134: }
4135:
4136: strptime (time_str, fmt_string, &zhoro_tm);
4137:
4138: ilong1 = mktime (&zhoro_tm) + tzoffset;
4139: ilong = ilong1 / 86400;
4140:
4141: lintstr (a, ilong + 47117);
4142: i = stlen (a);
4143:
4144: a[i++] = ',';
4145: ilong = ilong1 - (ilong * 86400) + 43200;
4146:
4147: lintstr (&a[i], ilong);
4148:
4149: goto nxt_operator;
4150:
4151: }
4152:
4153:
4154: case GETX: /* dummy function for implicit $GET */
4155:
4156: /* un-stack $ZREFERENCE and $ZLOCAL */
4157: stcpy (zref, refsav[--refsx]);
4158: stcpy (zloc, refsav[refsx] + 256);
4159:
4160: free (refsav[refsx]);
4161:
4162:
4163: case GET: /* dummy function for $GET with two args */
4164:
4165: goto nxt_operator;
4166:
4167:
4168: case 'E': /* ZEDIT */
4169:
4170: if (f > 4) {
4171: merr_raise (FUNARG);
4172: return;
4173: }
4174:
4175: {
4176:
4177: int k, l, rev, esc;
4178:
4179: if (f == 1) {
4180: rev = TRUE;
4181: goto reverse;
4182: }
4183:
4184: j = (f == 4 ? intexpr (argstck[arg + 3]) : 1); /* type of action */
4185:
4186: if ((rev = j < 0)) j = (-j);
4187: if ((esc = j / 10) == 1 || esc == 2) j = j % 10;
4188:
4189: if (j < 1 || j > 3) {
4190: merr_raise (ARGER);
4191: return;
4192: }
4193:
4194: f = (f >= 3 ? intexpr (argstck[arg + 2]) : 0); /* target length */
4195:
4196: if (f > 255) merr_raise (ARGER);
4197:
4198: if (merr () > OK) return;
4199:
4200: if (esc == 1) { /* remove ESC-Sequences */
4201:
4202: stcpy (tmp, a);
4203:
4204: i = 0;
4205: k = 0;
4206: l = 1;
4207: esc = 0;
4208:
4209: while ((a[k] = tmp[i++]) != EOL) {
4210:
4211: if (l) {
4212: if (a[k] != ESC) {
4213: k++;
4214: continue;
4215: }
4216:
4217: if ((a[k] = tmp[i++]) != '[') continue;
4218:
4219: l = 0;
4220:
4221: continue;
4222: }
4223:
4224: if (a[k] >= '@') l = 1;
4225:
4226: }
4227:
4228: }
4229:
4230: /* anything to be done ??? */
4231: if (argstck[arg + 1][0] == EOL) goto reverse;
4232:
4233: stcpy (tmp, argstck[arg + 1]);
4234:
4235: if (j != 1) { /* remove leading characters */
4236:
4237: i = 0;
4238: k = 0;
4239:
4240: while (a[i] != EOL) {
4241:
4242: if (a[i] == tmp[k]) {
4243: i++;
4244: k = 0;
4245:
4246: continue;
4247: }
4248:
4249: if (tmp[k++] == EOL) break;
4250:
4251: }
4252:
4253: if (i) stcpy (a, &a[i]);
4254:
4255: }
4256:
4257: if (j != 3) { /* remove trailing characters */
4258:
4259: i = stlen (a) - 1;
4260: k = 0;
4261:
4262: while (i >= 0) {
4263:
4264: if (a[i] == tmp[k]) {
4265: i--;
4266: k = 0;
4267:
4268: continue;
4269: }
4270:
4271: if (tmp[k++] == EOL) break;
4272:
4273: }
4274:
4275: a[i + 1] = EOL;
4276:
4277: }
4278:
4279: i = stlen (a);
4280:
4281: if ((f -= i) > 0) { /* characters to append */
4282:
4283: if (esc == 2) { /* ignore ESC-Sequences */
4284:
4285: k = 0;
4286: l = 1;
4287:
4288: while (a[k] != EOL) {
4289:
4290: if (l) {
4291:
4292: if (a[k++] == ESC) {
4293:
4294: f += 2;
4295:
4296: if (a[k++] == '[') l = 0;
4297:
4298: }
4299: }
4300: else {
4301:
4302: f++;
4303:
4304: if (a[k++] >= '@') l = 1;
4305:
4306: }
4307:
4308: }
4309:
4310: }
4311:
4312: k = 0;
4313:
4314: if (j == 1) {
4315: k = f;
4316: f = 0;
4317: }
4318:
4319: if (j == 2) {
4320: k = f - f / 2;
4321: f -= k;
4322: }
4323:
4324: l = stlen (tmp);
4325:
4326: if (k) { /* append on right side */
4327:
4328: a[k += i] = EOL;
4329: j = l;
4330:
4331: while (--k >= i) {
4332:
4333: a[k] = tmp[--j];
4334:
4335: if (j <= 0) j = l;
4336:
4337: }
4338:
4339: }
4340:
4341: if (f) { /* append on left side */
4342:
4343: i = 0;
4344:
4345: while (l < f) tmp[l++] = tmp[i++];
4346:
4347: stcpy (&tmp[l], a);
4348: stcpy (a, tmp);
4349:
4350: }
4351:
4352: }
4353:
4354: reverse:
4355:
4356: if (rev) {
4357:
4358: i = stlen (a) - 1;
4359: j = 0;
4360: f = i / 2;
4361:
4362: while (j <= f) {
4363: k = a[j];
4364: a[j++] = a[i];
4365: a[i--] = k;
4366: }
4367:
4368: }
4369:
4370: }
4371:
4372: goto nxt_operator;
4373:
4374: default:
4375: merr_raise (ILLFUN);
4376: return;
4377:
4378:
4379: }
4380:
4381: /* end of function evaluation section */
4382:
4383: nxt_operator:
4384:
4385: if (spx > 0 && (f = op_stck[spx]) != ARRAY && f != '(') {
4386: goto nxt_expr;
4387: }
4388: /* push answer */
4389:
4390: op_stck[++spx] = OPERAND;
4391: codptr++;
4392:
4393: goto nextchr;
4394:
4395:
4396: case '$': /* scan function name convert upper to lower */
4397:
4398: if (op_stck[spx] == OPERAND) goto m_operator;
4399: if ((f = *++codptr) >= 'A' && f <= 'Z') f += 32;
4400:
4401: if (f == 'z' && standard) {
4402: merr_raise (NOSTAND);
4403: return;
4404: }
4405:
4406: if (f == '$' || f == '%') { /* extrinsic function/extrinsic variable */
4407:
4408: zexflag = FALSE;
4409:
4410: extra_fun:
4411:
4412:
4413: {
4414: short savmcmnd, savsetp; /* stuff to be saved */
4415: char savarnam[256];
4416: char *savdofr;
4417: long savlen;
4418: short savtest;
4419: short savop;
4420: char *savargs = NULL;
4421: int savarg;
4422: char *savastck;
4423: char *savpart;
4424: char *b;
4425: char *namold;
4426: long rouoldc;
4427: char label[255],
4428: routine[255];
4429: short errex; /* FLAG: error exit */
4430: short libcall;
4431: libcall = FALSE;
4432:
4433: for (i = 0; i < 255; i++) {
4434: routine[i] = '\201';
4435: }
4436:
4437: if (f == '%') libcall = TRUE;
4438:
4439: savmcmnd = mcmnd;
4440: savsetp = setpiece;
4441: savop = setop;
4442: savtest = test;
4443: stcpy (savarnam, varnam);
4444: savdofr = dofram0;
4445: errex = FALSE;
4446:
4447: if ((argstck[++arg] = a) >= s) {
4448:
4449: char *bak;
4450: bak = partition;
4451:
4452: if (getpmore () == 0) {
4453: merr_raise (STKOV);
4454: return;
4455: }
4456:
4457: a = a - bak + partition;
4458: b = b - bak + partition;
4459:
4460: }
4461:
4462: savlen = a - argptr;
4463: savpart = partition;
4464:
4465: if (spx > 0) {
4466:
4467: if ((savargs = calloc ((unsigned) (savlen + 256L), 1)) == NULL) {
4468: merr_raise (STKOV);
4469: return;
4470: } /* could not allocate stuff... */
4471:
4472: stcpy0 (savargs, argptr, savlen + 256L);
4473: argptr = partition;
4474:
4475: }
4476:
4477: savarg = arg;
4478:
4479: if ((savastck = calloc ((unsigned) (arg + 1), sizeof (char *))) == NULL) {
4480: merr_raise (STKOV);
4481: return;
4482: } /* could not allocate stuff... */
4483:
4484: stcpy0 (savastck, (char *) argstck, (long) ((arg + 1) * sizeof (char *)));
4485:
4486: b = label; /* parse label */
4487:
4488: if ((ch = *++codptr) == '%') {
4489: *b++ = ch;
4490: codptr++;
4491: }
4492:
4493: while (((ch = *codptr) >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z') || (ch >= '0' && ch <= '9')) {
4494: *b++ = ch;
4495: codptr++;
4496: }
4497:
4498: *b = EOL;
4499: b = routine;
4500:
4501:
4502: if (obj_field) {
4503: strcpy (b, &(object_class[1]));
4504: stcnv_c2m (b);
4505: b += strlen (object_class) - 1;
4506: *++b = EOL;
4507: }
4508:
4509:
4510:
4511: if (ch == '^') { /* parse routine name */
4512:
4513:
4514:
4515: if (((ch = *++codptr) >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z') || ch == '%') {
4516: *b++ = ch;
4517: }
4518:
4519: while (((ch = *++codptr) >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z') || (ch >= '0' && ch <= '9')) {
4520: *b++ = ch;
4521: }
4522:
4523: if (libcall) {
4524: char newnam[255];
4525:
4526: for (i = 0; i < stlen (routine); i++) {
4527: routine[i] = tolower (routine[i]);
4528: }
4529:
4530: newnam[0] = '%';
4531: newnam[1] = 'u';
4532: newnam[2] = 'l';
4533: newnam[3] = '\201';
4534:
4535: stcat (newnam, routine);
4536:
4537: routine[0] = EOL;
4538: stcpy (routine, newnam);
4539:
4540: b = b + 3;
4541: }
4542:
4543:
4544: if (routine[0] == EOL) {
4545: merr_raise (ILLFUN);
4546: errex = TRUE;
4547:
4548: goto errexfun;
4549: }
4550:
4551: }
4552:
4553:
4554:
4555: {
4556: char nrou[255];
4557: char ntag[255];
4558: char nbuf[255];
4559:
4560: stcpy (nrou, routine);
4561: stcpy (ntag, label);
4562:
4563: stcnv_m2c (nrou);
4564: stcnv_m2c (ntag);
4565:
4566:
4567: if (rtn_resolve (nrou, ntag, nbuf) != NULL) {
4568: strcpy (routine, nbuf);
4569: stcnv_c2m (routine);
4570: }
4571: else {
4572: merr_raise (LBLUNDEF);
4573: return;
4574: }
4575: }
4576:
4577:
4578: *b = EOL;
4579:
4580: /* something must be specified */
4581: if (label[0] == EOL && routine[0] == EOL) {
4582: merr_raise (ILLFUN);
4583: errex = TRUE;
4584:
4585: goto errexfun;
4586: }
4587:
4588:
4589: if (obj_field) {
4590: char t_objf[255];
4591:
4592: snprintf (t_objf, 254, "%s\201", object_instance);
4593:
4594: dofram0 = dofrmptr;
4595: *dofrmptr++ = DELIM;
4596: dofrmptr += stcpy (dofrmptr, t_objf) + 1;
4597: }
4598:
4599:
4600: if (*codptr == '(' && *(codptr + 1) != ')') {
4601:
4602:
4603: if (!obj_field) dofram0 = dofrmptr;
4604: obj_field = FALSE;
4605:
4606:
4607: //dofram0 = dofrmptr;
4608:
4609: i = 0;
4610: codptr++;
4611:
4612: for (;;) {
4613:
4614: setpiece = TRUE; /* to avoid error on closing bracket */
4615:
4616: if (*codptr == '.' && (*(codptr + 1) < '0' || *(codptr + 1) > '9')) {
4617:
4618: codptr++;
4619:
4620: expr (NAME);
4621: codptr++;
4622: *dofrmptr++ = DELIM; /* to indicate call by name */
4623: dofrmptr += stcpy (dofrmptr, varnam) + 1;
4624:
4625: }
4626: else {
4627: expr (STRING);
4628: dofrmptr += stcpy (dofrmptr, argptr) + 1;
4629: }
4630:
4631: setpiece = FALSE;
4632: i++;
4633:
4634: if (merr () > OK) {
4635: dofrmptr = dofram0;
4636: errex = TRUE;
4637:
4638: goto errexfun;
4639: }
4640:
4641: ch = *codptr++;
4642:
4643: if (ch == ',') continue;
4644:
4645: if (ch != ')') {
4646: merr_raise (COMMAER);
4647: dofrmptr = dofram0;
4648: errex = TRUE;
4649:
4650: goto errexfun;
4651: }
4652:
4653: ch = *codptr;
4654:
4655: break;
4656:
4657: }
4658:
4659: }
4660: else {
4661:
4662:
4663: if (!obj_field) {
4664: dofram0 = 0;
4665: }
4666:
4667: obj_field = FALSE;
4668:
4669: //dofram0 = 0;
4670: if (*codptr == '(') codptr += 2;
4671:
4672: }
4673:
4674: rouoldc = roucur - rouptr;
4675: namold = 0;
4676:
4677: if (routine[0] != EOL) { /* load routine */
4678:
4679: dosave[0] = EOL;
4680: loadsw = TRUE;
4681:
4682: while ((*(namptr++)) != EOL);
4683:
4684: namold = namptr;
4685:
4686: stcpy (namptr, rou_name);
4687: zload (routine);
4688:
4689: if (merr () > OK) {
4690: errex = TRUE;
4691: goto errexfun;
4692: }
4693:
4694: }
4695:
4696: {
4697:
4698: char *reg, *reg1;
4699:
4700: reg1 = rouptr;
4701: reg = reg1;
4702:
4703: if (label[0] != EOL) {
4704:
4705: while (reg < rouend) {
4706:
4707: reg++;
4708: j = 0;
4709:
4710: while (*reg == label[j]) {
4711: reg++;
4712: j++;
4713: }
4714:
4715: if (label[j] == EOL) {
4716:
4717: if (*reg == ':') {
4718: char return_type[255];
4719: short ret_type;
4720: register int typei;
4721:
4722: /* we got a return type. parse it. */
4723: reg++; /* skip over the colon */
4724:
4725: typei = 0;
4726:
4727: while (isalpha ((ch = *reg++))) {
4728: return_type[typei++] = toupper (ch);
4729: }
4730:
4731: reg--; /* back up to the previous char so that parsing of the entry point can resume later */
4732: return_type[typei] = '\0';
4733:
4734: ret_type = dt_get_type (return_type);
4735: if (ret_type == DT_INVALID) {
4736: merr_raise (INVTYPE);
4737: errex = TRUE;
4738:
4739: goto errexfun;
4740: }
4741:
4742: /* save off the return type to be checked by QUIT code */
4743: extr_types[nstx + 1] = ret_type;
4744:
4745: //printf ("return_type = '%s' *reg = '%c'\r\n", return_type, *reg);
4746: }
4747:
4748: if (*reg == TAB || *reg == SP) goto off;
4749: /* call of procedure without specifying a parameter list */
4750:
4751: if (*reg == '(') {
4752:
4753: if (dofram0 == 0) dofram0 = dofrmptr;
4754:
4755: goto off;
4756:
4757: }
4758:
4759: }
4760:
4761: reg = (reg1 = reg1 + UNSIGN (*reg1) + 2);
4762:
4763: }
4764:
4765: {
4766:
4767: merr_raise (LBLUNDEF);
4768: stcpy (varerr, label); /* to be included in error message */
4769:
4770: if (dofram0) dofrmptr = dofram0; /* reset frame pointer */
4771:
4772: zload (rou_name);
4773:
4774: errex = TRUE;
4775:
4776: goto errexfun;
4777:
4778: }
4779: }
4780:
4781: off:
4782:
4783: roucu0 = reg1;
4784:
4785: }
4786:
4787: if (roucu0 >= rouend) {
4788:
4789: merr_raise (LBLUNDEF);
4790: stcpy (varerr, label); /* to be included in error message */
4791:
4792: if (dofram0) dofrmptr = dofram0; /* reset frame pointer */
4793:
4794: zload (rou_name);
4795: errex = TRUE;
4796:
4797: goto errexfun;
4798:
4799: }
4800:
4801: if (routine[0] != EOL) stcpy (rou_name, routine);
4802:
4803: roucu0++;
4804: forsw = FALSE;
4805:
4806: #ifdef DEBUG_NEWSTACK
4807: printf("Stack PUSH in expr.c!\r\n");
4808: #endif
4809:
4810: if (++nstx > NESTLEVLS) {
4811: nstx--;
4812: merr_raise (STKOV);
4813: errex = TRUE;
4814:
4815: goto errexfun;
4816: }
4817: else {
4818: estack++;
4819: }
4820:
4821: nestc[nstx] = '$';
4822:
4823: #ifdef DEBUG_NEWSTACK
4824: if(!cmdptr) printf("CMDPTR is ZERO!\r\n");
4825: #endif
4826:
4827: nestp[nstx] = cmdptr;
4828: nestn[nstx] = namold;
4829: nestr[nstx] = rouoldc;
4830: nestnew[nstx] = 0;
4831: nestlt[nstx] = level;
4832: level = 0; /* push level ; clr level */
4833: ztrap[nstx][0] = EOL;
4834:
4835: cmdptr += stcpy (cmdptr, codptr - 1) + 1;
4836: roucur = roucu0;
4837:
4838: if (dofram0) {
4839:
4840: char *reg, *reg1;
4841:
4842: reg = roucu0;
4843: reg1 = dofram0;
4844:
4845: while ((ch = (*reg++)) != '(') {
4846:
4847: if (ch == SP || ch == TAB || ch == EOL) {
4848: break;
4849: }
4850:
4851: }
4852:
4853: if (ch != '(') {
4854:
4855: merr_raise (TOOPARA);
4856: dofrmptr = dofram0;
4857: errex = TRUE;
4858:
4859: #ifdef DEBUG_NEWSTACK
4860: printf("Cheesy Stack POP in expr.c\r\n");
4861: #endif
4862:
4863:
4864:
4865: nstx--;
4866: estack--;
4867:
4868: goto errexfun;
4869:
4870: }
4871:
4872: j = 0;
4873:
4874: if (*reg == ')') {
4875: reg++;
4876: }
4877: else {
4878: /* PARSE FORMALLIST */
4879: short fl_type;
4880: short fl_mandatory;
4881: short fl_byref;
4882: char fl_typestr[255];
4883: char fl_mand;
4884: short dtcheck_result;
4885: register short typei;
4886: short lastparm;
4887: short gotparm;
4888: int paramct;
4889:
4890: fl_type = DT_AUTO;
4891: fl_mandatory = TRUE;
4892: fl_byref = FALSE;
4893: dtcheck_result = FALSE;
4894: lastparm = FALSE;
4895: gotparm = FALSE;
4896: paramct = 0;
4897:
4898: while ((ch = (*reg++)) != EOL) {
4899:
4900: gotparm = FALSE;
4901:
4902: if ((ch == ':') && j) {
4903:
4904: /* we have a type specification */
4905: typei = 0;
4906:
4907: while ((ch = (*reg++)) != EOL) {
4908: /* parse it */
4909: if (isalpha (ch)) {
4910: fl_typestr[typei++] = ch;
4911: }
4912: else if (ch == ':') {
4913: /* we have an "optional" part */
4914: fl_typestr[typei] = '\0';
4915: fl_mand = *(reg + 1);
4916:
4917: if ((fl_mand == 'o') || (fl_mand == 'O')) {
4918: fl_mandatory = FALSE;
4919: }
4920: else {
4921: merr_raise (INVLIBOPT);
4922: dofrmptr = dofram0;
4923:
4924: errex = TRUE;
4925:
4926: nstx--;
4927: estack--;
4928:
4929: goto errexfun;
4930: }
4931: }
4932: else if ((ch == ',') || (ch == ')')) {
4933:
4934: if (ch == ')') {
4935: lastparm = TRUE;
4936: }
4937:
4938: gotparm = TRUE;
4939: paramct++;
4940:
4941: fl_typestr[typei] = '\0';
4942: fl_type = dt_get_type (fl_typestr);
4943:
4944: if (fl_type == DT_INVALID) {
4945:
4946: merr_raise (INVTYPE);
4947: dofrmptr = dofram0; /* reset frame pointer */
4948: errex = TRUE;
4949:
4950: nstx--;
4951: estack--;
4952:
4953: goto errexfun;
4954:
4955: }
4956:
4957: break;
4958: }
4959: }
4960: }
4961:
4962: if (gotparm == TRUE) {
4963:
4964: if (reg1[0] == DELIM) {
4965: dtcheck_result = dt_check (fl_type, reg1 + 1, paramct);
4966: }
4967: else {
4968: dtcheck_result = dt_check (fl_type, reg1, paramct);
4969: }
4970:
4971: if (dtcheck_result == FALSE) {
4972: merr_raise (TYPMISMATCH);
4973: dofrmptr = dofram0; // reset frame pointer
4974:
4975: errex = TRUE;
4976:
4977: nstx--;
4978: estack--;
4979:
4980: goto errexfun;
4981: }
4982: }
4983:
4984: if ((ch == ',' || ch == ')') && j) {
4985:
4986: varnam[j] = EOL;
4987:
4988: #if 0
4989: printf("01 [nstx] nstx is (%d) in expr.c\r\n",nstx);
4990: printf("[nestnew[nstx]] is (%d) in expr.c\r\n",nestnew[nstx]);
4991: printf("[newptr] newptr is [");
4992: for(loop=0; loop<50; loop++)
4993: printf("%c", (newptr[loop] == EOL) ? '!' : newptr[loop]);
4994: printf("] in expr.c\r\n");
4995: #endif
4996:
4997: if (nestnew[nstx] == 0) nestnew[nstx] = newptr;
4998:
4999: if (reg1 < dofrmptr) {
5000:
5001: if (*reg1 == DELIM) { /* call by reference */
5002:
5003: if (stcmp (reg1 + 1, varnam)) { /* are they different?? */
5004: symtab (new_sym, varnam, "");
5005: symtab (m_alias, varnam, reg1 + 1);
5006: }
5007:
5008: }
5009: else {
5010: symtab (new_sym, varnam, ""); /* call by value */
5011: symtab (set_sym, varnam, reg1);
5012: }
5013:
5014: reg1 += stlen (reg1) + 1;
5015:
5016: }
5017: else {
5018: symtab (new_sym, varnam, "");
5019: }
5020:
5021: if (ch == ')') break;
5022:
5023: j = 0;
5024: continue;
5025: }
5026:
5027: if ((ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z') || (ch >= '0' && ch <= '9' && j) || (ch == '%' && j == 0)) {
5028: varnam[j++] = ch;
5029: continue;
5030: }
5031:
5032: merr_raise (ARGLIST);
5033: dofrmptr = dofram0; /* reset frame pointer */
5034: errex = TRUE;
5035:
5036: nstx--;
5037: estack--;
5038:
5039: goto errexfun;
5040:
5041: }
5042:
5043: }
5044:
5045: if (reg1 < dofrmptr) {
5046: merr_raise (TOOPARA);
5047: dofrmptr = dofram0; /* reset frame pointer */
5048: errex = TRUE;
5049: nstx--;
5050: estack--;
5051:
5052: goto errexfun;
5053: }
5054:
5055: dofrmptr = dofram0;
5056:
5057: }
5058:
5059: xecline (0);
5060:
5061: if (repQUIT) { /* repeat QUIT */
5062:
5063: stcpy (code, " V 26:\201");
5064:
5065: #ifdef DEBUG_NEWSTACK
5066: printf("Trying to get at nstx in expr.c (2)\r\n");
5067: #endif
5068:
5069: intstr (&code[6], nstx - repQUIT);
5070: repQUIT = 0;
5071: codptr = code;
5072:
5073: return;
5074:
5075: }
5076:
5077: stcpy (tmp, argptr);
5078:
5079: errexfun:
5080:
5081: mcmnd = savmcmnd;
5082: setpiece = savsetp;
5083: setop = savop;
5084: test = savtest;
5085:
5086: stcpy (varnam, savarnam);
5087:
5088: dofram0 = savdofr;
5089: argptr = partition;
5090: a = argptr;
5091:
5092: if (spx > 0) {
5093: stcpy0 (argptr, savargs, savlen + 256L);
5094: free (savargs);
5095: }
5096:
5097: arg = savarg;
5098: stcpy0 ((char *) argstck, savastck, (long) ((arg + 1) * sizeof (char *)));
5099:
5100: free (savastck);
5101: a = savlen + argptr;
5102:
5103: if (savpart != partition) { /* autoadjust may have changed that */
5104:
5105: f = 0;
5106:
5107: while (f <= arg) {
5108:
5109: if (argstck[f]) argstck[f] = argstck[f] - savpart + partition;
5110:
5111: f++;
5112:
5113: }
5114:
5115: }
5116:
5117: if (errex) {
5118:
5119: if (zexflag && (merr () == NOPGM || merr () == LBLUNDEF)) merr_raise (ILLFUN);
5120: return;
5121:
5122: }
5123:
5124: if (merr () != OK) return;
5125: /* if (ierr != OK && ierr != (OK - CTRLB)) return;*/
5126:
5127: stcpy (a, tmp);
5128:
5129: goto exec;
5130:
5131: } /* end of extrinsic function/variable section */
5132:
5133: }
5134: else if (((ch = *++codptr) >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z')) {
5135:
5136: if (ch < 'a') ch += 32;
5137:
5138: tmp[0] = SP;
5139: tmp[1] = f;
5140: tmp[2] = ch;
5141: b = &tmp[3];
5142:
5143: while (((ch = *++codptr) >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z')) *b++ = ch | 0140;
5144:
5145: *b++ = SP;
5146: *b = EOL;
5147:
5148: if (ch == '(') { /* function */
5149:
5150: if (f != 'z') { /* standard instrinsic functions */
5151:
5152: if (find (" ascii char data extract find fn fnumber get increment ins instanceof justify length na name next order piece \
5153: query qlength ql qsubscript qs random re reverse select st stack text tr translate ty type view ", tmp) == FALSE) {
5154: merr_raise (ILLFUN);
5155: return;
5156: }
5157:
5158: if (f == 'f' && tmp[2] == 'n') f = FNUMBER;
5159: else if (f == 'q' && tmp[2] == 'l') f = QLENGTH;
5160: else if (f == 'q' && tmp[2] == 's') f = QSUBSCRIPT;
5161: else if (f == 'r' && tmp[2] == 'e') f = REVERSE;
5162: else if (f == 's' && tmp[2] == 't') f = SVNstack;
5163: else if (f == 't' && tmp[2] == 'r') f = TRANSLATE;
5164: else if (f == 'n' && tmp[2] == 'a') f = 'N';
5165: else if (f == 't' && tmp[2] == 'y') f = TYPE;
5166: else if (f == 'i' && tmp[3] == 's') f = INSTANCEOF;
5167:
5168: }
5169: else {
5170:
5171: /* userdefined intrinsic: process as extrinsic */
5172: if ((find (zfunctions, tmp) == FALSE) && (tmp[2] != 'f' || tmp[3] != SP)) {
5173:
5174: f = stlen (tmp) - 1;
5175: stcpy (&tmp[f], codptr);
5176:
5177: code[0] = '$';
5178: code[1] = '^';
5179: code[2] = '%';
5180: code[3] = 'Z';
5181:
5182: stcpy (&code[4], &tmp[2]);
5183:
5184: codptr = code;
5185: f = '$';
5186: zexflag = TRUE;
5187:
5188: goto extra_fun;
5189:
5190: }
5191:
5192: f = tmp[2] - 32;
5193:
5194: if (tmp[3] == SP) {
5195:
5196: if (f == 'S' && s_fun_flag == FALSE) f = 'o'; /* ZSORT(=$ORDER) instead of ZSYNTAX */
5197: if (f == 'P' && p_fun_flag == FALSE) f = ZPREVIOUS; /* ZPREVIOUS instead of ZPIECE */
5198: if (f == 'D' && d_fun_flag == FALSE) f = ZDATA; /* ZDATA instead of ZDATE */
5199: if (f == 'N' && n_fun_flag == FALSE) f = ZNEXT; /* ZNEXT instead of ZNAME */
5200:
5201: }
5202: else {
5203:
5204: switch (f) {
5205:
5206:
5207: case 'C':
5208: if ((stcmp (" zcrc \201", tmp) == 0) ||
5209: (stcmp (" zcr \201", tmp) == 0))
5210: f = ZCRC;
5211: break;
5212:
5213:
5214: case 'D':
5215: if (stcmp (" zdata \201", tmp) == 0)
5216: f = ZDATA;
5217: break;
5218:
5219:
5220: case 'L':
5221: if (stcmp (" zlsd \201", tmp) == 0)
5222: f = ZLSD;
5223: break;
5224:
5225:
5226: case 'N':
5227: if (stcmp (" znext \201", tmp) == 0)
5228: f = ZNEXT;
5229: break;
5230:
5231:
5232: case 'P':
5233: if (stcmp (" zprevious \201", tmp) == 0)
5234: f = ZPREVIOUS;
5235: break;
5236:
5237: case 'S':
5238: if (stcmp (" zsort \201", tmp) == 0)
5239: f = 'o'; /* process $ZSORT as $ORDER */
5240: break;
5241:
5242:
5243: }
5244:
5245: }
5246: }
5247: }
5248: else { /* special variable */
5249:
5250: if (f != 'z') {
5251:
5252: if (find (" di dialect ec ecode es estack et etrap device horolog io job key pd pdisplay principal quit reference st stack storage sy system test ti timezone tl tlevel tr trollback wi with ", tmp) == FALSE) {
5253: merr_raise (ILLFUN);
5254: return;
5255: }
5256:
5257: if (f == 's') {
5258:
5259: if (tmp[2] == 'y') f = SVNsystem;
5260: if (tmp[2] == 't') f = SVNstack;
5261:
5262: }
5263:
5264: if (f == 'd') {
5265: f = SVNdialect;
5266: }
5267:
5268: if (f == 'e') {
5269:
5270: if (tmp[2] == 'c') f = SVNecode;
5271: if (tmp[2] == 's') f = SVNestack;
5272: if (tmp[2] == 't') f = SVNetrap;
5273:
5274: }
5275:
5276: if (f == 'p' && tmp[2] == 'd') f = SVNpdisplay;
5277:
5278: if (f == 't') {
5279:
5280: if (tmp[2] == 'i') f = SVNtimezone;
5281: if (tmp[2] == 'l') f = SVNtlevel;
5282: if (tmp[2] == 'r') f = SVNtrollback;
5283:
5284: }
5285:
5286: }
5287: else {
5288:
5289: if (find (zsvn, tmp) == FALSE) {
5290: *(--b) = EOL; /* there's a SPace we don't need */
5291: f = ' '; /* user defined svn */
5292: }
5293: else {
5294:
5295: f = tmp[2] - 32;
5296:
5297: if (f == 'T' && tmp[3] == 'r' && (tmp[4] == SP || (stcmp (" ztrap \201", tmp) == 0))) f = ZTRAP;
5298:
5299: if (f == 'M') { /* loadable match */
5300:
5301: if ((f = tmp[3]) >= 'a' && f <= 'z') f -= 32;
5302:
5303: f -= 64;
5304:
5305: }
5306:
5307: if (f == 'U' && tmp[3] == 't') f = SVNzut;
5308:
5309: }
5310: }
5311: }
5312: }
5313:
5314: if (ch != '(') { /* 'special variable' */
5315:
5316: codptr--;
5317:
5318: if (extyp != STRING && extyp != ARGIND && spx == 0) {
5319: return;
5320: }
5321:
5322: if ((argstck[++arg] = a) >= s) {
5323:
5324: char *bak;
5325: bak = partition;
5326:
5327: if (getpmore () == 0) {
5328: merr_raise (STKOV);
5329: return;
5330: }
5331:
5332: a = a - bak + partition;
5333: b = b - bak + partition;
5334:
5335: }
5336:
5337: /************* special variable evaluation ************************************/
5338: switch (f) {
5339:
5340:
5341: /* $ZUUID */
5342: case 'U':
5343:
5344: uuid_v4 (a);
5345: stcnv_c2m (a);
5346:
5347: goto exec;
5348:
5349: #if !defined(__osf__)
5350: case SVNzut:
5351: {
5352: unsigned long long res;
5353:
5354: struct timeval tv;
5355: gettimeofday(&tv, NULL);
5356:
5357: res = tv.tv_sec * 1000000 + tv.tv_usec;
5358:
5359: sprintf (a, "%llu\201", res);
5360:
5361: goto exec;
5362: }
5363: #endif
5364:
5365: /* $JOB */
5366: case 'j':
5367:
5368: lintstr (a, pid);
5369:
5370: goto exec;
5371:
5372:
5373: /* $IO */
5374: case 'i':
5375:
5376: intstr (a, io);
5377: i = stlen (a);
5378: a[i++] = ':';
5379: a[i++] = '"';
5380: i += stcpy (&a[i], dev[io]);
5381: a[i++] = '"';
5382: a[i] = EOL;
5383:
5384: goto exec;
5385:
5386: case SVNdialect:
5387: {
5388: short rb_slot;
5389: rb_slot = rbuf_slot_from_name (rou_name);
5390:
5391: switch (rbuf_flags[rb_slot].dialect) {
5392:
5393: case D_FREEM:
5394: sprintf (a, "FREEM\201");
5395: break;
5396:
5397: case D_MDS:
5398: sprintf (a, "MDS\201");
5399: break;
5400:
5401: case D_M77:
5402: sprintf (a, "M77\201");
5403: break;
5404:
5405: case D_M84:
5406: sprintf (a, "M84\201");
5407: break;
5408:
5409: case D_M90:
5410: sprintf (a, "M90\201");
5411: break;
5412:
5413: case D_M95:
5414: sprintf (a, "M95\201");
5415: break;
5416:
5417: case D_M5:
5418: sprintf (a, "M5\201");
5419: break;
5420: }
5421:
5422: goto exec;
5423:
5424: }
5425:
5426: /* $PDISPLAY */
5427: case SVNpdisplay:
5428:
5429: if (getenv ("DISPLAY") != NULL) {
5430: char *mwapi_display;
5431: char disp_temp[255];
5432:
5433: mwapi_display = getenv ("DISPLAY");
5434: strncpy (disp_temp, mwapi_display, 255);
5435: stcnv_c2m (disp_temp);
5436: stcpy (a, disp_temp);
5437: }
5438: else {
5439: intstr (a, 0);
5440: }
5441: goto exec;
5442:
5443: /* $PRINCIPAL */
5444: case 'p':
5445:
5446: a[0] = '0';
5447: a[1] = ':';
5448: a[2] = '"';
5449: i = 3 + stcpy (&a[3], dev[HOME]);
5450: a[i++] = '"';
5451: a[i] = EOL;
5452:
5453: goto exec;
5454:
5455:
5456: /* $QUIT */
5457: case 'q':
5458:
5459: a[0] = '0' | (nestc[nstx] == '$');
5460:
5461:
5462:
5463: a[1] = EOL;
5464:
5465: goto exec;
5466:
5467:
5468: /* $TEST */
5469: case 't':
5470:
5471: a[0] = '0' | test;
5472: a[1] = EOL;
5473:
5474: goto exec;
5475:
5476:
5477: /* $HOROLOG */
5478: case 'h':
5479:
5480: {
5481:
5482: unsigned long ilong, ilong1;
5483:
5484: ilong1 = time (0L) + tzoffset; /* make $H local time */
5485: ilong = ilong1 / 86400;
5486:
5487: lintstr (a, ilong + 47117);
5488: i = stlen (a);
5489:
5490: a[i++] = ',';
5491: ilong = ilong1 - (ilong * 86400);
5492:
5493: lintstr (&a[i], ilong);
5494:
5495: // printf ("unix epoch = %d\r\n", horolog_to_unix (a));
5496:
5497: goto exec;
5498:
5499: }
5500:
5501:
5502: /* $ZHOROLOG() */
5503: case 'H':
5504: {
5505:
5506: unsigned long ilong, ilong1;
5507:
5508: #if defined(USE_GETTIMEOFDAY) && !defined(__osf__)
5509:
5510: struct timeval timebuffer;
5511: gettimeofday (&timebuffer, NULL);
5512:
5513: ilong1 = timebuffer.tv_sec + tzoffset; /* make $ZH local time */
5514:
5515: #else
5516:
5517: struct timeb timebuffer;
5518: ftime (&timebuffer);
5519: ilong1 = timebuffer.time + tzoffset; /* make $ZH local time */
5520:
5521: #endif
5522:
5523: ilong = ilong1 / 86400;
5524: lintstr (a, ilong + 47117);
5525: i = stlen (a);
5526: a[i++] = ',';
5527: ilong = ilong1 - (ilong * 86400);
5528: lintstr (&a[i], ilong);
5529:
5530: #if defined(USE_GETTIMEOFDAY) && !defined(__osf__)
5531: if ((ilong = timebuffer.tv_usec))
5532: #else
5533: if ((ilong = timebuffer.millitm))
5534: #endif
5535: {
5536: char doggie_bag[50];
5537:
5538: snprintf (doggie_bag, 49, ".%ld\201", ilong);
5539: stcat (a, doggie_bag);
5540: }
5541: }
5542: goto exec;
5543:
5544:
5545: case SVNsystem:
5546:
5547: snprintf (a, 512, "%d,\"%s\"\201", MDC_VENDOR_ID, jour_hostid);
5548: goto exec;
5549:
5550:
5551: case SVNtimezone:
5552:
5553: lintstr (a, tzoffset);
5554: goto exec;
5555:
5556:
5557: case SVNtlevel:
5558:
5559: snprintf (a, 255, "%d\201", tp_level);
5560: goto exec;
5561:
5562:
5563: case SVNtrollback:
5564:
5565: a[0] = '0';
5566: a[1] = EOL;
5567: goto exec;
5568:
5569:
5570: case SVNecode:
5571:
5572: //write_m ("in SVNecode\r\n\201");
5573:
5574: if (stlen (user_ecode)) {
5575: stcpy (a, user_ecode);
5576: }
5577: else {
5578: stcpy (a, ecode);
5579: }
5580:
5581: goto exec;
5582:
5583:
5584: case SVNestack:
5585: {
5586: char esbuf[256];
5587: snprintf (esbuf, 255, "%d\201", estack);
5588:
5589: stcpy (a, esbuf);
5590: goto exec;
5591:
5592: }
5593:
5594:
5595: case SVNetrap:
5596: // write_m ("in SVNetrap\r\n\201");
5597: stcpy (a, etrap);
5598: goto exec;
5599:
5600:
5601: case SVNstack:
5602:
5603: intstr (a, nstx);
5604:
5605: goto exec;
5606:
5607:
5608: /* $KEY */
5609: case 'k':
5610:
5611: stcpy (a, zb);
5612: if (*a >= SP && *a < DEL) *a = EOL;
5613:
5614: goto exec;
5615:
5616:
5617: /* $DEVICE */
5618: case 'd':
5619: if (devstat[io].mdc_err == 0) {
5620: snprintf (a, 3, "0\201\0");
5621: }
5622: else {
5623: snprintf (a, 120, "%d,%d,%s\201\0", devstat[io].mdc_err, devstat[io].frm_err, devstat[io].err_txt);
5624: }
5625:
5626: goto exec;
5627:
5628: /* $STORAGE */
5629: case 's':
1.3 snw 5630: snprintf (a, 255 , "%ld\201", DEFPSIZE);
1.1 snw 5631: goto exec;
5632:
5633: /* $WITH */
5634: case 'w':
5635: stcpy (a, i_with);
5636: goto exec;
5637:
5638: /* $X */
5639: case 'x':
5640:
5641: intstr (a, xpos[io]);
5642: goto exec;
5643:
5644:
5645: /* $Y */
5646: case 'y':
5647:
5648: intstr (a, ypos[io]);
5649: goto exec;
5650:
5651:
5652: /* non-standard special variables */
5653:
5654: /* $ZA - on HOME device dummy, else byte offset to begin of file */
5655: case 'A':
5656: if (io == HOME) {
5657: a[0] = '0';
5658: a[1] = EOL;
5659: }
5660: else {
5661: lintstr (a, ftell (opnfile[io]));
5662: }
5663: goto exec;
5664:
5665:
5666: /* $ZB - last keystroke */
5667: case 'B':
5668: stcpy (a, zb);
5669: goto exec;
5670:
5671:
5672: /* $ZCONTROLC flag */
5673: case 'C':
5674: a[0] = '0' | zcc;
5675: zcc = FALSE;
5676: a[1] = EOL;
5677: goto exec;
5678:
5679:
5680: ///* $ZX (number of columns) */
5681: //case 'X':
5682: //intstr (a, n_columns);
5683: // goto exec;
5684:
5685: ///* $ZY (number of rows) */
5686: //case 'Y':
5687: //intstr (a, n_lines);
5688: //goto exec;
5689:
5690: /* $ZERROR */
5691: case 'E':
5692: stcpy (a, zerror);
5693: goto exec;
5694:
5695:
5696: /* $ZTRAP */
5697: case ZTRAP:
5698:
5699: stcpy (a, ztrap[nstx]);
5700:
5701: goto exec;
5702:
5703:
5704: /* $ZPRECISION */
5705: case 'P':
5706: intstr (a, zprecise);
5707: goto exec;
5708:
5709:
5710: /* $ZSYSTEM */
5711: case 'S':
5712: intstr (a, zsystem);
5713: goto exec;
5714:
5715:
5716: /* $ZVERSION */
5717: case 'V':
5718: stcpy (&a[stcpy (a, "FreeM \201")], FREEM_VERSION_STR);
5719: goto exec;
5720:
5721:
5722: /* $ZNAME */
5723: case 'N':
5724: /*
5725: i = 0;
5726: while ((a[i] = rou_name[i]) != EOL) {
5727: if (rou_name[i] == '.') break;
5728: i++;
5729: }
5730: a[i] = EOL;
5731: */
5732: stcpy (a, rou_name);
5733: goto exec;
5734:
5735:
5736: /* $ZI, INTERRUPT ENABLE/DISABLE */
5737: case 'I':
5738: a[0] = '0' | breakon;
5739: a[1] = EOL;
5740: goto exec;
5741:
5742:
5743: /* $ZDATE */
5744: case 'D':
5745: {
5746: time_t ilong;
5747: struct tm *zdate_time;
5748: char zdf_key[50];
5749: char fmt_string[128];
5750:
5751: snprintf (zdf_key, 49, "^$JOB\202%d\202ZDATE_FORMAT\201", pid);
5752: ssvn (get_sym, zdf_key, fmt_string);
5753: stcnv_c2m (fmt_string);
5754:
5755: ilong = time (0L);
5756:
5757: zdate_time = localtime (&ilong);
5758:
5759: strftime (a, 255, fmt_string, zdate_time);
5760: stcnv_c2m (a);
5761: }
5762:
5763: goto exec;
5764:
5765:
5766: /* $ZTIME */
5767: case 'T':
5768: {
5769: time_t ilong;
5770: struct tm *zdate_time;
5771:
5772: ilong = time (0L);
5773:
5774: zdate_time = localtime (&ilong);
5775:
5776: strftime (a, 255, "%X", zdate_time);
5777: stcnv_c2m (a);
5778: }
5779:
5780: goto exec;
5781:
5782:
5783: /* $ZJOB - value of JOB number (of father process) */
5784: case 'J':
5785: if (father) {
5786: lintstr (a, father);
5787: }
5788: else {
5789: stcpy (a, "\201");
5790: }
5791:
5792: goto exec;
5793:
5794:
5795: /* $ZORDER - value of physically next global reference @$ZO(@$ZR) */
5796: case 'O':
5797: global (getnext, tmp, a);
5798:
5799: if (merr () > 0) return;
5800:
5801: goto exec;
5802:
5803:
5804: /* $ZLOCAL - last local reference */
5805: case 'L':
5806: zname (a, zloc);
5807: if (merr () > OK) return;
5808:
5809: goto exec;
5810:
5811:
5812: /* $(Z)REFERENCE - last global reference */
5813: case 'r':
5814: case 'R':
5815: zname (a, zref);
5816: if (merr () > OK) return;
5817:
5818: goto exec;
5819:
5820:
5821: case 'C' - 64:
5822: stcpy (a, zmc);
5823: goto exec; /* loadable match 'controls' */
5824:
5825:
5826: case 'N' - 64:
5827: stcpy (a, zmn);
5828: goto exec; /* loadable match 'numerics' */
5829:
5830:
5831: case 'P' - 64:
5832: stcpy (a, zmp);
5833: goto exec; /* loadable match 'punctuation' */
5834:
5835:
5836: case 'A' - 64:
5837: stcpy (a, zmu);
5838: stcat (a, zml);
5839: goto exec; /* loadable match 'alphabetic' */
5840:
5841:
5842: case 'L' - 64:
5843: stcpy (a, zml);
5844: goto exec; /* loadable match 'lowercase' */
5845:
5846:
5847: case 'U' - 64:
5848: stcpy (a, zmu);
5849: goto exec; /* loadable match 'uppercase' */
5850:
5851:
5852: case 'E' - 64:
5853: for (i = NUL; i <= DEL; i++) a[i] = i;
5854: a[i] = EOL;
5855: goto exec; /* 'loadable' match 'everything' */
5856:
5857:
5858: case ' ': /* user defined special variable */
5859:
5860: udfsvn (get_sym, &tmp[2], a);
5861:
5862: if (ierr <= OK) goto exec;
5863:
5864: merr_raise (OK);
5865:
5866: /* if not found in special variable table, process as extrinsic svn */
5867: /* $$^%Z... all uppercase */
5868:
5869: f = 2;
5870:
5871: while ((ch = tmp[f]) != EOL) {
5872:
5873: if (ch >= 'a' && ch <= 'z') ch -= 32;
5874:
5875: tmp[f++] = ch;
5876:
5877: }
5878:
5879: stcat (tmp, ++codptr);
5880:
5881: code[0] = '$';
5882: code[1] = '^';
5883: code[2] = '%';
5884: code[3] = 'Z';
5885:
5886: stcpy (&code[4], &tmp[2]);
5887:
5888: codptr = code;
5889: f = '$';
5890: zexflag = TRUE;
5891: arg--;
5892:
5893: goto extra_fun;
5894:
5895: default:
5896: merr_raise (ILLFUN);
5897: return;
5898: }
5899: /* end of specialvariable evaluation */
5900: /******************************************************************************/
5901: }
5902: if (++spx >= PARDEPTH) {
5903: merr_raise (STKOV);
5904: return;
5905: }
5906: op_stck[spx] = f;
5907: op_stck[++spx] = '$';
5908:
5909:
5910: text:
5911: if (*(codptr + 1) != '@') {
5912: f = op_stck[spx - 1];
5913: /* f= (spx>0 ? op_stck[spx-1] : 0);
5914: * if (f) */
5915:
5916: switch (f) {
5917: case 't': /* $TEXT is special */
5918:
5919: if ((argstck[++arg] = a) >= s) {
5920: char *bak;
5921:
5922: bak = partition;
5923: if (getpmore () == 0) {
5924: merr_raise (STKOV);
5925: return;
5926: }
5927:
5928: a = a - bak + partition;
5929: b = b - bak + partition;
5930:
5931: }
5932:
5933: i = 0;
5934:
5935: while ((ch = *++codptr) != EOL) {
5936:
5937: if (ch == ')') break;
5938:
5939: if (ch == '+') {
5940:
5941: a[i] = EOL;
5942:
5943: if (++spx > PARDEPTH) {
5944: merr_raise (STKOV);
5945: return;
5946: }
5947:
5948: op_stck[spx] = OPERAND;
5949: goto comma;
5950:
5951: }
5952:
5953: if (ch == '^') {
5954:
5955: a[i] = EOL;
5956:
5957: if (++spx > PARDEPTH) {
5958: merr_raise (STKOV);
5959: return;
5960: }
5961:
5962: op_stck[spx] = OPERAND;
5963: a += i + 1;
5964:
5965: if (i == 0) {
5966: a[0] = '1';
5967: a[1] = EOL;
5968: }
5969: else {
5970: /* just routine name: */
5971: /* return first line */
5972:
5973: a[0] = EOL;
5974:
5975: }
5976:
5977: if ((argstck[++arg] = a) >= s) {
5978: char *bak;
5979:
5980: bak = partition;
5981:
5982: if (getpmore () == 0) {
5983: merr_raise (STKOV);
5984: return;
5985: }
5986:
5987: a = a - bak + partition;
5988: b = b - bak + partition;
5989:
5990: }
5991:
5992: if ((spx + 2) > PARDEPTH) {
5993: merr_raise (STKOV);
5994: return;
5995: }
5996:
5997: op_stck[++spx] = '$';
5998: op_stck[++spx] = OPERAND;
5999:
6000: goto uparrow;
6001: }
6002:
6003: if ((ch < '0' && ch != '%') /* illegal character in $TEXT */
6004: ||ch > 'z' ||
6005: (ch < 'A' && ch > '9') ||
6006: (ch < 'a' && ch > 'Z')) {
6007:
6008: merr_raise (INVREF);
6009: return;
6010:
6011: }
6012:
6013: a[i++] = ch;
6014:
6015: }
6016:
6017: a[i] = EOL;
6018: codptr--;
6019:
6020: goto exec;
6021:
6022: case 'd': /* $data() */
6023: case 'o': /* $order() */
6024: case 'g': /* $get() */
6025: case 'n': /* $next() */
6026: case 'q': /* $query() */
6027: case 'O': /* $zorder() */
6028: case 'N': /* $zname() */
6029: case ZNEXT: /* $znext() */
6030: case ZPREVIOUS: /* $zprevious() */
6031: {
6032:
6033: if ((ch = *++codptr) >= 'A' && ch <= 'Z')
6034: goto scan_name;
6035:
6036: if (ch >= 'a' && ch <= 'z')
6037: goto scan_name;
6038:
6039: if (ch == '%' || ch == '^')
6040: goto scan_name;
6041:
6042: merr_raise (INVEXPR);
6043:
6044: return;
6045: }
6046: }
6047: }
6048:
6049: codptr++;
6050: goto nextchr;
6051:
6052:
6053: case ':':
6054: /* colon: $select or delimiter */
6055: if (spx < 2 || op_stck[spx - 2] != 's') {
6056:
6057: if (op_stck[1] == OPERAND && spx == 1)
6058: return;
6059:
6060: merr_raise (INVEXPR);
6061:
6062: return;
6063:
6064: }
6065:
6066: arg--;
6067: spx--;
6068:
6069: if (tvexpr (a) == FALSE) { /* skip next expr */
6070:
6071: i = 0; /* quote */
6072: j = 0; /* bracket */
6073:
6074: for (;;) {
6075:
6076: ch = *++codptr;
6077:
6078: if (ch == '"') {
6079: toggle (i);
6080: continue;
6081: }
6082:
6083: if (i) {
6084:
6085: if (ch != EOL)
6086: continue;
6087:
6088: merr_raise (QUOTER);
6089: return;
6090:
6091: }
6092:
6093: if (ch == ',' && !j) {
6094: codptr++;
6095: goto nextchr;
6096: }
6097:
6098: if (ch == '(') {
6099: j++;
6100: continue;
6101: }
6102:
6103: if (ch == ')') {
6104:
6105: if (j--)
6106: continue;
6107:
6108: merr_raise (SELER);
6109: return;
6110:
6111: }
6112:
6113: if (ch == EOL) {
6114: merr_raise (SELER);
6115: return;
6116: }
6117:
6118: }
6119: }
6120:
6121: codptr++;
6122: goto nextchr;
6123:
6124: }
6125:
6126: m_operator:
6127:
6128: if (extyp == ARGIND && spx == 1 /* && op_stck[2]!='(' */ )
6129: return;
6130:
6131: f = op_stck[spx];
6132:
6133: if (++spx > PARDEPTH) {
6134: merr_raise (STKOV);
6135: return;
6136: }
6137:
6138:
6139: op10: /* entry for shortcut if first operator */
6140:
6141: /* check for NOT_OPERATOR */
6142: if (ch == NOT) {
6143: if (((ch = *++codptr) == '=' || ch == '<' || ch == '>' || ch == '?' || ch == '&' || ch == '!' || ch == '[' || ch == ']')) {
6144: if (ch == ']' && *(codptr + 1) == ch) {
6145: codptr++;
6146: ch = SORTSAFTER;
6147: if (*(codptr+1)=='=') {
6148: codptr++;
6149: ch=EQSORTS;
6150: }
6151: }
6152: if (ch == ']' && *(codptr + 1) == '=') {
6153: codptr++;
6154: ch = EQFOLLOWS;
6155: }
6156: if (ch == '!' && *(codptr + 1) == ch) {
6157: codptr++;
6158: ch = XOR;
6159: }
6160:
6161: op_stck[spx] = SETBIT (ch);
6162: if (ch == '?')
6163: goto scan_pattern;
6164: /* a+=stlen(a)+1; */
6165: /* djw: does the while loop do the same as the commented out line above? */
6166: /* we should decide yes or no and get rid of the other code... */
6167:
6168: while (*a++ != EOL);
6169:
6170: codptr++;
6171: goto nextchr;
6172:
6173: }
6174: else {
6175: op_stck[spx] = NOT;
6176: goto nextchr;
6177: }
6178: }
6179:
6180: if (ch == '*' && *(codptr + 1) == ch) {
6181: codptr++;
6182: ch = POWER;
6183: }
6184:
6185: if (ch == ']' && *(codptr + 1) == ch) {
6186: codptr++;
6187: ch = SORTSAFTER;
6188: }
6189:
6190: if (ch == '<' && *(codptr + 1) == '=') {
6191: codptr++;
6192: ch = SETBIT ('>');
6193: }
6194:
6195: if (ch == '>' && *(codptr + 1) == '=') {
6196: codptr++;
6197: ch = SETBIT ('<');
6198: }
6199:
6200: if (ch == ']' && *(codptr + 1) == '=') {
6201: codptr++;
6202: ch = EQFOLLOWS;
6203: }
6204:
6205: if (ch == SORTSAFTER && *(codptr + 1) == '=') {
6206: codptr++;
6207: ch = EQSORTS;
6208: }
6209:
6210: if (ch == '$')
6211: ch = MAXOP;
6212:
6213: if (ch == '^') {
6214: codptr--;
6215: return;
6216: }
6217:
6218: if ((op_stck[spx] = ch) != PATTERN) {
6219:
6220: if (f == OPERAND) while (*a++ != EOL); /* binary operator */
6221:
6222: codptr++;
6223: goto nextchr;
6224: }
6225:
6226: scan_pattern:
6227: if ((ch = *++codptr) == INDIRECT) { /* a+=stlen(a)+1; */
6228: while (*a++ != EOL) ;
6229: goto m_operator;
6230: }
6231:
6232: if ((ch > '9' || ch < '0') && (ch != '.')) {
6233: merr_raise (INVEXPR);
6234: return;
6235: }
6236:
6237: tmp[0] = ch;
6238: i = 1;
6239: f = '1'; /* 'previous' character */
6240: j = 0; /* point flag */
6241: group = 0; /* grouped pattern match */
6242:
6243: while ((ch = *++codptr) != EOL) {
6244:
6245: if ((ch >= '0') && (ch <= '9')) {
6246:
6247: tmp[i++] = ch;
6248: f = '1';
6249:
6250: continue;
6251:
6252: }
6253:
6254: if (ch == '.') {
6255:
6256: if (j) {
6257: merr_raise (INVEXPR);
6258: return;
6259: }
6260:
6261: j++;
6262: tmp[i++] = ch;
6263: f = '1';
6264:
6265: continue;
6266: }
6267:
6268: j = 0;
6269: if (ch == NOT) { /* negation of pattern class ? */
6270:
6271: ch = *(codptr + 1);
6272:
6273: if ((ch == '"') || (ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z')) {
6274: tmp[i++] = NOT;
6275: }
6276: else {
6277: ch = NOT;
6278: }
6279:
6280: }
6281:
6282: if (ch == '"') {
6283:
6284: if (f != '1' && f != 'A') {
6285: merr_raise (INVEXPR);
6286: return;
6287: }
6288:
6289: for (;;) {
6290:
6291: tmp[i++] = ch;
6292:
6293: if ((ch = *++codptr) == EOL) {
6294: merr_raise (QUOTER);
6295: return;
6296: }
6297:
6298: if (ch == '"') {
6299:
6300: if ((f = *(codptr + 1)) != '"') {
6301: ch = DELIM;
6302: break;
6303: }
6304:
6305: codptr++;
6306: }
6307: }
6308:
6309: tmp[i++] = ch;
6310: f = '"';
6311:
6312: continue;
6313:
6314: }
6315:
6316: if (ch == '(') {
6317:
6318: if (f != '1') {
6319: merr_raise (INVEXPR);
6320: return;
6321: }
6322:
6323: group++;
6324: f = '(';
6325: tmp[i++] = ch;
6326:
6327: continue;
6328:
6329: }
6330:
6331: if (group && (ch == ',' || ch == ')')) {
6332:
6333: if ((f == '1') || (f == '(')) {
6334: merr_raise (INVEXPR);
6335: return;
6336: }
6337:
6338: if (ch == ',') {
6339:
6340: f = '(';
6341: tmp[i++] = ch;
6342:
6343: continue;
6344:
6345: }
6346:
6347: if (ch == ')') {
6348: group--;
6349: tmp[i++] = ch;
6350:
6351: continue;
6352: }
6353:
6354: } /* ??? formatting ??? */
6355:
6356: if (ch >= 'A' && ch <= 'Z') ch += 32; /* lower case conversion */
6357:
6358: if (ch == 'z') { /* loadable match, store as uppercase chars */
6359:
6360: if (standard) {
6361: merr_raise (NOSTAND);
6362: return;
6363: }
6364:
6365: ch = *++codptr;
6366:
6367: if (ch == '"') {
6368:
6369: if (f != '1') {
6370: merr_raise (INVEXPR);
6371: return;
6372: }
6373:
6374: codptr--;
6375: tmp[i++] = 'z';
6376:
6377: continue;
6378:
6379: }
6380:
6381: if (ch == '(') {
6382:
6383: if (f != '1') {
6384: merr_raise (INVEXPR);
6385: return;
6386: }
6387:
6388: codptr--;
6389: continue;
6390: }
6391:
6392: if (ch >= 'A' && ch <= 'Z') ch += 32; /* lower case conversion */
6393:
6394: if (ch != 'e')
6395: j = 1; /* process 'ze' as 'e' */
6396: }
6397:
6398: if (ch != 'c' && ch != 'n' && ch != 'p' && ch != 'a' && ch != 'l' && ch != 'u' && ch != 'e') break;
6399:
6400: if ((f != '1') && (f != 'A')) {
6401: merr_raise (INVEXPR);
6402: return;
6403: }
6404:
6405: if (j) {
6406: ch -= 32;
6407: j = 0;
6408: }
6409:
6410: tmp[i++] = ch;
6411: f = 'A';
6412:
6413: }
6414:
6415: if ((f == '1') || group) {
6416: merr_raise (INVEXPR);
6417: return;
6418: }
6419:
6420: tmp[i] = EOL;
6421:
6422: if ((*a = pattern (a, tmp)) > '1') {
6423: merr_raise (INVEXPR);
6424: return;
6425: }
6426:
6427: if (UNSIGN (op_stck[spx--]) & 0200) toggle (*a);
6428:
6429: *(a + 1) = EOL;
6430:
6431: goto next10;
6432:
6433: /* process values on stack */
6434:
6435:
6436: exec:
6437:
6438: if (spx == 0) {
6439:
6440: if ((ch = *++codptr) == EOL || ch == SP || ch == ',' || ch == ':' || (ch == '^' && (extyp == LABEL || extyp == OFFSET))) return;
6441:
6442: op_stck[++spx] = OPERAND;
6443:
6444: goto next10;
6445:
6446: }
6447:
6448: f = op_stck[spx];
6449:
6450: if (f == ARRAY || f == '(') {
6451:
6452: if (++spx > PARDEPTH) {
6453: merr_raise (STKOV);
6454: return;
6455: }
6456:
6457: op_stck[spx] = OPERAND;
6458: codptr++;
6459:
6460: goto nextchr;
6461:
6462: }
6463:
6464: /* process operators */
6465:
6466: nxt_expr:
6467:
6468: if (f == '$') { /* push 'OPERAND' on stack */
6469:
6470: op_stck[++spx] = OPERAND;
6471: codptr++;
6472:
6473: goto nextchr;
6474:
6475: }
6476:
6477: if (f == OPERAND) {
6478: merr_raise (MISSOP);
6479: return;
6480: }
6481:
6482: if (op_stck[--spx] == OPERAND) { /* binary operators */
6483:
6484: b = a;
6485: a = argstck[--arg];
6486:
6487: switch (f & 0177) { /* binary operators, NOT OMITTED */
6488:
6489: case PLUS:
6490:
6491: stcpy (tmp, b);
6492:
6493: plus01:
6494:
6495: atyp = numlit (a);
6496: btyp = numlit (tmp);
6497:
6498: #ifdef EUR2DEM
6499:
6500: if (atyp != btyp) {
6501:
6502: char tmp2[256];
6503:
6504: if ((atyp == 0) && (a[0] == '0')) atyp = btyp; /* zero is any currency */
6505: if ((btyp == 0) && (tmp[0] == '0')) btyp = atyp; /* zero is any currency */
6506:
6507: if (atyp && btyp) {
6508:
6509: if (atyp > 1) {
6510: stcpy (tmp2, EUR2WHR[atyp]);
6511: mul (tmp, tmp2);
6512: }
6513:
6514: if (btyp > 1) {
6515: zprecise += 4;
6516: stcpy (tmp2, EUR2WHR[btyp]);
6517: mdiv (tmp, tmp2, '/');
6518: zprecise -= 4;
6519: }
6520:
6521: }
6522: else if (atyp != btyp && typemmflag) {
6523: merr_raise (TYPEMISMATCH);
6524: return;
6525: }
6526:
6527: }
6528:
6529: #endif /* EUR2DEM */
6530:
6531: add (a, tmp);
6532: plus02:
6533:
6534: #ifdef EUR2DEM
6535:
6536: if (atyp == 0) goto next05;
6537: if (atyp != btyp) cond_round (a, zprecise + 2);
6538:
6539: stcat (a, WHR[atyp]);
6540:
6541: #endif /* EUR2EUR */
6542:
6543: goto next05;
6544:
6545:
6546: case MINUS:
6547:
6548: tmp[0] = '-';
6549: stcpy (&tmp[1], b);
6550: goto plus01;
6551:
6552:
6553: case MULTIPLY:
6554:
6555: stcpy (tmp, b);
6556: atyp = numlit (a);
6557: btyp = numlit (tmp);
6558: #ifdef EUR2DEM
6559: if (btyp && (atyp == 0)) {
6560: atyp = btyp;
6561: btyp = 0;
6562: }
6563:
6564: if (atyp && btyp) {
6565:
6566: if (typemmflag) {
6567: merr_raise (TYPEMISMATCH);
6568: return;
6569: }
6570:
6571: atyp = btyp = 0;
6572:
6573: }
6574:
6575: #endif /* EUR2DEM */
6576:
6577: mul (a, tmp);
6578:
6579: #ifdef EUR2DEM
6580:
6581: if (atyp == 0) goto next05;
6582:
6583: cond_round (a, zprecise + 2);
6584: stcat (a, WHR[atyp]);
6585:
6586: #endif /* EUR2DEM */
6587:
6588: goto next05;
6589:
6590:
6591: case DIVIDE:
6592: case INTDIVIDE:
6593: case MODULO:
6594:
6595: stcpy (tmp, b);
6596: atyp = numlit (a);
6597: btyp = numlit (tmp);
6598:
6599: #ifdef EUR2DEM
6600: if (atyp != btyp) {
6601: char tmp2[256];
6602:
6603: if (atyp && btyp) {
6604:
6605: if (f == MODULO) {
6606:
6607: if (atyp > 1) {
6608: stcpy (tmp2, EUR2WHR[atyp]);
6609: mul (tmp, tmp2);
6610: }
6611:
6612: if (btyp > 1) {
6613: stcpy (tmp2, EUR2WHR[btyp]);
6614: mdiv (tmp, tmp2, '/');
6615: }
6616:
6617: }
6618: else {
6619:
6620: if (atyp > 1) {
6621: stcpy (tmp2, EUR2WHR[atyp]);
6622: mul (tmp, tmp2);
6623: }
6624:
6625: if (btyp > 1) {
6626: stcpy (tmp2, EUR2WHR[btyp]);
6627: mul (a, tmp2);
6628: }
6629:
6630: atyp = btyp = 0;
6631:
6632: }
6633:
6634: } else if (btyp && typemmflag && (*a != '0' || f == MODULO)) {
6635: merr_raise (TYPEMISMATCH);
6636: return;
6637: }
6638: }
6639: else if (f != MODULO) {
6640: atyp = 0;
6641: }
6642:
6643: #endif /* EUR2DEM */
6644:
6645: if (tmp[0] == '0') {
6646: merr_raise (M9);
6647: return;
6648: }
6649:
6650: if (atyp != btyp) zprecise += 4;
6651:
6652: mdiv (a, tmp, f);
6653:
6654: if (atyp != btyp) zprecise -= 4;
6655:
6656: goto plus02;
6657:
6658:
6659: case CONCATENATE:
6660:
6661: if (stcat (a, b)) goto next05;
6662:
6663: merr_raise (M75);
6664: return;
6665:
6666:
6667: case EQUAL:
6668:
6669: if (stcmp (a, b)) {
6670: *a = '0';
6671: }
6672: else {
6673: *a = '1';
6674: }
6675:
6676: /* common entry point to reverse the logical value */
6677: /* of current expression */
6678:
6679:
6680: notop:
6681: if (f & 0200) toggle (*a); /* NOT_OPERAND */
6682:
6683: a[1] = EOL;
6684:
6685: goto next05;
6686:
6687:
6688: case GREATER:
6689:
6690: stcpy (tmp, b);
6691: atyp = numlit (a);
6692: btyp = numlit (tmp);
6693:
6694: #ifdef EUR2DEM
6695: if (atyp != btyp) {
6696: char tmp2[256];
6697:
6698: if ((atyp == 0) && (a[0] == '0')) atyp = btyp; /* zero is any currency */
6699: if ((btyp == 0) && (tmp[0] == '0')) btyp = atyp; /* zero is any currency */
6700:
6701: if (atyp && btyp) {
6702:
6703: if (atyp > 1) {
6704: stcpy (tmp2, EUR2WHR[atyp]);
6705: mul (tmp, tmp2);
6706: }
6707:
6708: if (btyp > 1) {
6709: stcpy (tmp2, EUR2WHR[btyp]);
6710: mul (a, tmp2);
6711: }
6712:
6713: cond_round (a, zprecise + 2);
6714: cond_round (tmp, zprecise + 2);
6715:
6716: }
6717: else if (atyp != btyp && typemmflag) {
6718: merr_raise (TYPEMISMATCH);
6719: return;
6720: }
6721: }
6722: #endif /* EUR2DEM */
6723:
6724: if (comp (tmp, a)) {
6725: *a = '1';
6726: }
6727: else {
6728: *a = '0';
6729: }
6730:
6731: goto notop;
6732:
6733:
6734: case LESS:
6735:
6736: stcpy (tmp, b);
6737: atyp = numlit (a);
6738: btyp = numlit (tmp);
6739:
6740: #ifdef EUR2DEM
6741: if (atyp != btyp) {
6742: char tmp2[256];
6743:
6744: if ((atyp == 0) && (a[0] == '0')) atyp = btyp; /* zero is any currency */
6745: if ((btyp == 0) && (tmp[0] == '0')) btyp = atyp; /* zero is any currency */
6746:
6747: if (atyp && btyp) {
6748:
6749: if (atyp > 1) {
6750: stcpy (tmp2, EUR2WHR[atyp]);
6751: mul (tmp, tmp2);
6752: }
6753:
6754: if (btyp > 1) {
6755: stcpy (tmp2, EUR2WHR[btyp]);
6756: mul (a, tmp2);
6757: }
6758:
6759: cond_round (a, zprecise + 2);
6760: cond_round (tmp, zprecise + 2);
6761:
6762: }
6763: else if (atyp != btyp && typemmflag) {
6764: merr_raise (TYPEMISMATCH);
6765: return;
6766: }
6767:
6768: }
6769:
6770: #endif /* EUR2DEM */
6771: if (comp (a, tmp)) {
6772: *a = '1';
6773: }
6774: else {
6775: *a = '0';
6776: }
6777:
6778: goto notop;
6779:
6780:
6781: case AND:
6782:
6783: if (tvexpr (a)) {
6784: tvexpr (b);
6785: *a = *b;
6786: }
6787:
6788: goto notop;
6789:
6790:
6791: case OR:
6792:
6793: ch = tvexpr (b); /* beware case of a="" */
6794:
6795: if (tvexpr (a) == FALSE && ch) *a = '1';
6796:
6797: goto notop;
6798:
6799:
6800: case XOR:
6801:
6802: ch = tvexpr (b); /* beware case of a="" */
6803: *a = (tvexpr(a) == ch) ? '0' : '1';
6804:
6805: goto notop;
6806:
6807:
6808: case CONTAINS:
6809:
6810: if (*b == EOL || find (a, b)) {
6811: *a = '1';
6812: }
6813: else {
6814: *a = '0';
6815: }
6816:
6817: goto notop;
6818:
6819:
6820: case EQFOLLOWS:
6821:
6822: if (stcmp (a, b) == 0) {
6823: a[0] = '1';
6824: goto notop;
6825: }
6826:
6827:
6828: case FOLLOWS:
6829:
6830: if (*b == EOL) {
6831:
6832: if (*a == EOL) {
6833: *a = '0';
6834: }
6835: else {
6836: *a = '1';
6837: }
6838:
6839: }
6840: else if (stcmp (a, b) <= 0) { /* frequent special case */
6841: *a = '0';
6842: }
6843: else {
6844: *a = '1';
6845: }
6846:
6847: goto notop;
6848:
6849:
6850: case POWER:
6851:
6852: stcpy (tmp, b);
6853: numlit (a);
6854: numlit (tmp);
6855: power (a, tmp);
6856: goto next05;
6857:
6858:
6859: case EQSORTS:
6860:
6861: if (stcmp (a, b) == 0) {
6862: a[0] = '1';
6863: goto notop;
6864: }
6865:
6866:
6867: case SORTSAFTER:
6868:
6869: if (collate (b, a)) {
6870: *a = '1';
6871: }
6872: else {
6873: *a = '0';
6874: }
6875:
6876: goto notop;
6877:
6878:
6879: case MAXOP:
6880:
6881: #ifdef NOSCRAMBL
6882: if (standard) {
6883: merr_raise (NOSTAND);
6884: return;
6885: }
6886: #endif /* NOSCRAMBL */
6887:
6888: stcpy (tmp, b);
6889: numlit (tmp);
6890: numlit (a);
6891:
6892: if (comp (a, tmp)) stcpy (a, tmp);
6893:
6894: goto next05;
6895:
6896:
6897: case MINOP:
6898:
6899: #ifdef NOSCRAMBL
6900: if (standard) {
6901: merr_raise (NOSTAND);
6902: return;
6903: }
6904: #endif /* NOSCRAMBL */
6905:
6906: stcpy (tmp, b);
6907: numlit (tmp);
6908: numlit (a);
6909:
6910: if (comp (a, tmp) == 0) stcpy (a, tmp);
6911:
6912: goto next05;
6913:
6914:
6915: default:
6916: merr_raise (ILLOP);
6917: return;
6918:
6919: }
6920: } /* end binary operators */
6921:
6922: switch (f) {
6923:
6924: case INDIRECT:
6925:
6926:
6927: indirect:
6928:
6929: if (*++codptr == '@' && *(codptr + 1) == '(') {
6930:
6931: if (a[stlen (a) - 1] == ')') {
6932: codptr += 2;
6933: a[stlen (a) - 1] = ',';
6934: }
6935: else {
6936: codptr++;
6937: }
6938:
6939: }
6940:
6941: stcpy (a + stlen (a), codptr);
6942: stcpy (&code[1], a);
6943: codptr = code;
6944: *codptr = SP;
6945: arg--;
6946:
6947: if (spx <= 0) {
6948: op_stck[0] = 0;
6949: codptr++;
6950:
6951: goto nextchr;
6952: }
6953:
6954: if ((op_stck[spx] & 0177) != PATTERN) goto text;
6955:
6956: a = argstck[arg];
6957: goto scan_pattern;
6958:
6959:
6960: case MINUS: /* unary minus */
6961:
6962: b = a + stlen (a) + 1;
6963:
6964: while (b > a) {
6965: *b = *(b - 1);
6966: b--;
6967: }
6968:
6969: *a = '-';
6970:
6971:
6972: case PLUS: /* unary plus */
6973:
6974: atyp = numlit (a);
6975:
6976: #ifdef EUR2DEM
6977: if (atyp) {
6978: stcat (a, WHR[atyp]);
6979: }
6980: #endif /* EUR2DEM */
6981: goto nxt_operator;
6982:
6983:
6984: case NOT: /* unary not */
6985:
6986: tvexpr (a);
6987: toggle (*a);
6988:
6989: goto nxt_operator;
6990:
6991:
6992: default:
6993: merr_raise (MISSOPD);
6994: return;
6995:
6996: } /* end unary operators */
6997:
6998:
6999: } /* end expr() */
7000:
7001:
7002: /******************************************************************************/
7003: /* $ZSYNTAX */
7004: /* a simple syntax check. */
7005: /* $ZSYNTAX expects one argument. If it finds no fault, it */
7006: /* returns an empty string. Otherwise it returns a pair of */
7007: /* integers separated by a comma. The first number indicates */
7008: /* the position where the error has been found. The second */
7009: /* number returns an error code (same meaning as in $ZE) */
7010: /* only the most frequent errors are searched for: */
7011: /* - illegal commands */
7012: /* - not matching brackets */
7013: /* - not matching quotes */
7014: /* - missing or surplus arguments */
7015: /* - surplus commata */
7016:
7017: void zsyntax(char *a)
7018: {
7019: register int i;
7020: register int j;
7021: register int f;
7022: register int ch;
7023:
7024: char tmp[256];
7025: char *b;
7026: short cmnd;
7027: short forline; /* flag: FOR encountered */
7028:
7029: b = a;
7030: forline = FALSE;
7031: while ((ch = *b) == '.' || ch == SP)
7032: b++; /* level points for blockstr. */
7033: while ((ch = *b++) != EOL) { /* scan command */
7034: if (ch == ';' || ch == '!')
7035: break; /* comment or unix_call */
7036: if (ch >= 'A' && ch <= 'Z')
7037: ch += 32; /* uppercase to lowercase */
7038: f = ch;
7039: cmnd = f;
7040: if (ch < 'b' || ch > 'z' || /* illegal char in cmmd position */
7041: ch == 'm' || ch == 't' || ch == 'y') {
7042: j = CMMND;
7043:
7044:
7045: zserr:
7046:
7047: intstr (a, b - a);
7048: a[i = stlen (a)] = ',';
7049:
7050: merr_num_to_code (j, &a[++i]);
7051: stcnv_c2m (a);
7052:
7053: return;
7054: }
7055: i = 1;
7056: while (((tmp[++i] = ch = *b++) != EOL) && /* check full command name */
7057: ((ch >= 'A' && ch <= 'Z') ||
7058: (ch >= 'a' && ch <= 'z')))
7059: if (ch < 'a')
7060: tmp[i] = ch + 32;
7061: if (f != 'z') {
7062: if (i > 2) {
7063: tmp[0] = SP;
7064: tmp[1] = f;
7065: tmp[i] = SP;
7066: tmp[++i] = EOL;
7067: if (find (
7068: " break close do else for goto hang halt if job kill lock new open quit read set use view write xecute "
7069: ,tmp) == FALSE) {
7070: j = CMMND;
7071: goto zserr;
7072: }
7073: }
7074: }
7075: i = 0; /* quote */
7076: j = 0; /* bracket */
7077: if (ch == ':') { /* scan postcond */
7078: while ((ch = *b++) != EOL) {
7079: if (ch == '*' && *b == ch)
7080: b++; /* exponentiation */
7081: if (ch == '!' && *b == ch)
7082: b++; /* XOR */
7083: if (ch == ']') {
7084: if (*b == ch)
7085: b++; /* SORTSAFTER */
7086: if (*b == '=')
7087: b++; /* EQFOLLOWS or EQSORTS */
7088: }
7089: if (ch == '"') {
7090: toggle (i);
7091: continue;
7092: }
7093: if (i)
7094: continue;
7095: if (ch == SP)
7096: break;
7097: if (ch == '$') {
7098: ch = *b++;
7099: if (ch >= 'A' && ch <= 'Z')
7100: ch += 32;
7101: if ((ch < 'a' || ch > 'z' || ch == 'b' ||
7102: ch == 'm' || ch == 'u' || ch == 'w') && ch != '$') {
7103: j = ILLFUN;
7104: goto zserr;
7105: }
7106: if (ch == 's') { /* $SELECT */
7107: int xch,
7108: xi,
7109: xj;
7110: char *xb;
7111: int sfl;
7112:
7113: xi = 0; /* quotes */
7114: xj = 0; /* brackets */
7115: xb = b; /* do not change old 'b' pointer */
7116: sfl = TRUE; /* first ':' expected */
7117: for (;;)
7118: {
7119: if ((xch = *xb++) == EOL ||
7120: ((xch == SP || xch == ',') && xj == 0)) {
7121: if (xj == 0)
7122: break; /* $STORAGE */
7123: j = SELER;
7124: b = xb;
7125: goto zserr;
7126: }
7127: if (xch == '"') {
7128: toggle (xi);
7129: continue;
7130: }
7131: if (xi)
7132: continue;
7133: if (xch == ':') {
7134: if (xj > 1)
7135: continue;
7136: if (sfl) {
7137: sfl = FALSE;
7138: continue;
7139: }
7140: j = SELER;
7141: b = xb;
7142: goto zserr;
7143: }
7144: if (xch == ',') {
7145: if (xj > 1)
7146: continue;
7147: if (!sfl) {
7148: sfl = TRUE;
7149: continue;
7150: }
7151: j = SELER;
7152: b = xb;
7153: goto zserr;
7154: }
7155: if (xch == '(') {
7156: xj++;
7157: continue;
7158: }
7159: if (xch == ')') {
7160: if ((xj--) > 1)
7161: continue;
7162: if (sfl) {
7163: j = SELER;
7164: b = xb;
7165: goto zserr;
7166: }
7167: break;
7168: }
7169: }
7170: }
7171: /* end select check */
7172: else if (ch == 'd' || /* $DATA */
7173: ch == 'g' || /* $GET */
7174: ch == 'o' || /* $ORDER */
7175: ch == 'n' || /* $NEXT */
7176: ch == 'q' || /* $QUERY */
7177: ch == 'i') { /* $INCREMENT */
7178: int xch,
7179: xi,
7180: xj;
7181: char *xb;
7182:
7183: xb = b; /* do not change old 'b' pointer */
7184: /* skip name */
7185: while (((xch = (*xb)) >= 'A' && xch <= 'Z') ||
7186: (xch >= 'a' && xch <= 'z'))
7187: xb++;
7188: if (xch == '(') {
7189: if ((xch = (*++xb)) == '^' || xch == '%' ||
7190: (xch >= 'A' && xch <= 'Z') ||
7191: (xch >= 'a' && xch <= 'z')) {
7192: xi = xch;
7193: if (xch == '^' && *(xb + 1) == '%')
7194: xb++;
7195: while
7196: (((xch = (*++xb)) >= 'A' && xch <= 'Z') ||
7197: (xch >= 'a' && xch <= 'z') ||
7198: (xch >= '0' && xch <= '9') ||
7199: (xch == '.') ||
7200: (xch == '/' && xi <= '^') ||
7201: (xch == '%' && *(xb - 1) == '/')) ;
7202: } else {
7203: if (xch == '@')
7204: continue;
7205: j = INVEXPR;
7206: b = xb;
7207: goto zserr;
7208: }
7209: xi = 0; /* quotes */
7210: xj = 0; /* brackets */
7211: for (;;)
7212: {
7213: xch = *xb++;
7214: if (xch == '"' && xj) {
7215: toggle (xi);
7216: continue;
7217: }
7218: if (xi && (xch != EOL))
7219: continue;
7220: if (xch == '(') {
7221: xj++;
7222: continue;
7223: }
7224: if (xch == ')') {
7225: if (xj-- > 0)
7226: continue;
7227: break;
7228: }
7229: if (xj && xch != EOL)
7230: continue;
7231: if (xch == ',' &&
7232: (ch == 'g' || ch == 'q' || ch == 'o'))
7233: break;
7234: j = INVEXPR;
7235: b = xb;
7236: goto zserr;
7237: }
7238: }
7239: } /* end data/order/query check */
7240: if (ch == 'e' || /* $EXTRACT */
7241: ch == 'p' || /* $PIECE */
7242: ch == 'a' || /* $ASCII */
7243: ch == 'g' || /* $GET */
7244: ch == 'j' || /* $JUSTIFY */
7245: ch == 'l' || /* $LENGTH */
7246: ch == 'r' || /* $RANDOM/REVERSE */
7247: ch == 't' || /* $TEXT/TRANSLATE */
7248: ch == 'f') { /* $FIND/FNUMBER */
7249: int xch,
7250: xi,
7251: xj,
7252: xa;
7253: char *xb;
7254:
7255: xb = b; /* do not change old 'b' pointer */
7256: /* skip name */
7257: while (((xch = (*xb)) >= 'A' && xch <= 'Z') ||
7258: (xch >= 'a' && xch <= 'z'))
7259: xb++;
7260: if (xch == '(') {
7261: xi = 0; /* quotes */
7262: xj = 0; /* brackets */
7263: xa = 1;
7264: for (;;)
7265: {
7266: xch = (*++xb);
7267: if (xch == EOL)
7268: break;
7269: if (xch == '"') {
7270: toggle (xi);
7271: continue;
7272: }
7273: if (xi)
7274: continue;
7275: if (xch == '(') {
7276: xj++;
7277: continue;
7278: }
7279: if (xch == ')') {
7280: if (xj-- > 0)
7281: continue;
7282: break;
7283: }
7284: if (xj == 0 && xch == ',') {
7285: xa++;
7286: continue;
7287: }
7288: }
7289: if ((ch == 'e' && (xa > 3)) || /* $EXTRACT */
7290: (ch == 'p' && (xa < 2 || xa > 4)) || /* $PIECE */
7291: (ch == 'a' && (xa > 2)) || /* $ASCII */
7292: (ch == 'g' && (xa > 2)) || /* $GET */
7293: (ch == 'j' && (xa < 2 || xa > 3)) || /* $JUSTIFY */
7294: (ch == 'l' && (xa > 2)) || /* $LENGTH */
7295: (ch == 'r' && (xa > 1)) || /* $RANDON/$REVERSE */
7296: (ch == 't' && (xa > 3)) || /* $TEXT/TRANSLATE */
7297: (ch == 'f' && (xa < 2 || xa > 3))) { /* $FIND/FNUMBER */
7298: j = FUNARG;
7299: b = xb;
7300: goto zserr;
7301: }
7302: }
7303: } /* end number of args check */
7304: continue;
7305: }
7306: if (ch == '(') {
7307: j++;
7308: continue;
7309: }
7310: if (ch == ')') {
7311: if (j--)
7312: continue;
7313: break;
7314: }
7315: if (ch == ',') {
7316: if ((ch = *b) == SP || ch == EOL || ch == ',') {
7317: j = ARGLIST;
7318: goto zserr;
7319: }
7320: }
7321: }
7322: if (i)
7323: j = QUOTER;
7324: else if (j)
7325: j = j < 0 ? INVEXPR : BRAER;
7326: if (j == OK && ch != EOL && ch != SP)
7327: j = SPACER;
7328: if (j)
7329: goto zserr;
7330: } /* end postcond */
7331: if (ch == SP)
7332: ch = *b;
7333: else if (ch != EOL) {
7334: j = SPACER;
7335: goto zserr;
7336: }
7337: if ((ch == SP || ch == EOL) && /* never argumentless */
7338: (f == 'j' || f == 'o' || f == 'r' ||
7339: f == 's' || f == 'u' || f == 'x' ||
7340: f == 'g')) {
7341: j = ARGLIST;
7342: goto zserr;
7343: }
7344: /* or.. always argumentless */
7345: if ((ch != SP && ch != EOL) && (f == 'e' || (f == 'q' && forline))) {
7346: j = SPACER;
7347: goto zserr;
7348: }
7349: if (f == 'f')
7350: forline = TRUE;
7351: if (ch == EOL)
7352: break;
7353: /* scan argument */
7354: i = 0; /* quotes */
7355: j = 0; /* brackets */
7356: ch = SP; /* init: previous character */
7357: for (;;) /* scan argument */
7358: {
7359: f = ch; /* f=previous character */
7360: if ((ch = *b++) == EOL)
7361: break;
7362: if (ch == '*' && *b == ch)
7363: b++; /* exponentiation */
7364: if (ch == '!' && *b == ch)
7365: b++; /* XOR */
7366: if (ch == ']') {
7367: if (*b == ch)
7368: b++; /* SORTSAFTER */
7369: if (*b == '=')
7370: b++; /* EQFOLLOWS or EQSORTS */
7371: }
7372: if (ch == '"') {
7373: toggle (i);
7374: continue;
7375: }
7376: if (i)
7377: continue;
7378: if (ch == '$') {
7379: ch = *b++;
7380: if (ch >= 'A' && ch <= 'Z')
7381: ch += 32;
7382: if ((ch < 'a' || ch > 'z' || ch == 'b' ||
7383: ch == 'm' || ch == 'u' || ch == 'w') && ch != '$') {
7384: j = ILLFUN;
7385: goto zserr;
7386: }
7387: if (ch == 's') { /* $SELECT */
7388: int xch,
7389: xi,
7390: xj;
7391: char *xb;
7392: int sfl;
7393:
7394: xi = 0; /* quotes */
7395: xj = 0; /* brackets */
7396: xb = b; /* do not change old 'b' pointer */
7397: sfl = TRUE; /* first ':' expected */
7398: for (;;)
7399: {
7400: if ((xch = *xb++) == EOL ||
7401: ((xch == SP || xch == ',') && xj == 0)) {
7402: if (xj == 0)
7403: break; /* $STORAGE */
7404: j = SELER;
7405: b = xb;
7406: goto zserr;
7407: }
7408: if (xch == '"') {
7409: toggle (xi);
7410: continue;
7411: }
7412: if (xi)
7413: continue;
7414: if (xch == ':') {
7415: if (xj > 1)
7416: continue;
7417: if (sfl) {
7418: sfl = FALSE;
7419: continue;
7420: }
7421: j = SELER;
7422: b = xb;
7423: goto zserr;
7424: }
7425: if (xch == ',') {
7426: if (xj > 1)
7427: continue;
7428: if (!sfl) {
7429: sfl = TRUE;
7430: continue;
7431: }
7432: j = SELER;
7433: b = xb;
7434: goto zserr;
7435: }
7436: if (xch == '(') {
7437: xj++;
7438: continue;
7439: }
7440: if (xch == ')') {
7441: if ((xj--) > 1)
7442: continue;
7443: if (sfl) {
7444: j = SELER;
7445: b = xb;
7446: goto zserr;
7447: }
7448: break;
7449: }
7450: }
7451: }
7452: /* end select check */
7453: else if (ch == 'd' || /* $DATA */
7454: ch == 'g' || /* $GET */
7455: ch == 'o' || /* $ORDER */
7456: ch == 'n' || /* $NEXT */
7457: ch == 'q') { /* $QUERY */
7458: int xch,
7459: xi,
7460: xj;
7461: char *xb;
7462:
7463: xb = b; /* do not change old 'b' pointer */
7464: /* skip name */
7465: while (((xch = (*xb)) >= 'A' && xch <= 'Z') ||
7466: (xch >= 'a' && xch <= 'z'))
7467: xb++;
7468: if (xch == '(') {
7469: if ((xch = (*++xb)) == '^' || xch == '%' ||
7470: (xch >= 'A' && xch <= 'Z') ||
7471: (xch >= 'a' && xch <= 'z')) {
7472: xi = xch;
7473: if (xch == '^' && *(xb + 1) == '%')
7474: xb++;
7475: while
7476: (((xch = (*++xb)) >= 'A' && xch <= 'Z') ||
7477: (xch >= 'a' && xch <= 'z') ||
7478: (xch >= '0' && xch <= '9') ||
7479: (xch == '.') ||
7480: (xch == '/' && xi <= '^') ||
7481: (xch == '%' && *(xb - 1) == '/')) ;
7482:
7483: } else {
7484: if (xch == '@')
7485: continue;
7486: j = INVEXPR;
7487: b = xb;
7488: goto zserr;
7489: }
7490: xi = 0; /* quotes */
7491: xj = 0; /* brackets */
7492: for (;;)
7493: {
7494: xch = *xb++;
7495: if (xch == '"' && xj) {
7496: toggle (xi);
7497: continue;
7498: }
7499: if (xi && (xch != EOL))
7500: continue;
7501: if (xch == '(') {
7502: xj++;
7503: continue;
7504: }
7505: if (xch == ')') {
7506: if (xj-- > 0)
7507: continue;
7508: break;
7509: }
7510: if (xj && xch != EOL)
7511: continue;
7512: if (xch == ',' &&
7513: (ch == 'g' || ch == 'q' || ch == 'o'))
7514: break;
7515: j = INVEXPR;
7516: b = xb;
7517: goto zserr;
7518: }
7519: }
7520: } /* end data/order/query check */
7521: if (ch == 'e' || /* $EXTRACT */
7522: ch == 'p' || /* $PIECE */
7523: ch == 'a' || /* $ASCII */
7524: ch == 'g' || /* $GET */
7525: ch == 'j' || /* $JUSTIFY */
7526: ch == 'l' || /* $LENGTH */
7527: ch == 'r' || /* $RANDON/$REVERSE */
7528: ch == 't' || /* $TEXT/TRANSLATE */
7529: ch == 'f') { /* $FIND/FNUMBER */
7530: int xch,
7531: xi,
7532: xj,
7533: xa;
7534: char *xb;
7535:
7536: xb = b; /* do not change old 'b' pointer */
7537: /* skip name */
7538: while (((xch = (*xb)) >= 'A' && xch <= 'Z') ||
7539: (xch >= 'a' && xch <= 'z'))
7540: xb++;
7541: if (xch == '(') {
7542: xi = 0; /* quotes */
7543: xj = 0; /* brackets */
7544: xa = 1;
7545: for (;;)
7546: {
7547: xch = (*++xb);
7548: if (xch == EOL)
7549: break;
7550: if (xch == '"') {
7551: toggle (xi);
7552: continue;
7553: }
7554: if (xi)
7555: continue;
7556: if (xch == '(') {
7557: xj++;
7558: continue;
7559: }
7560: if (xch == ')') {
7561: if (xj-- > 0)
7562: continue;
7563: break;
7564: }
7565: if (xj == 0 && xch == ',') {
7566: xa++;
7567: continue;
7568: }
7569: }
7570: if ((ch == 'e' && (xa > 3)) || /* $EXTRACT */
7571: (ch == 'p' && (xa < 2 || xa > 4)) || /* $PIECE */
7572: (ch == 'a' && (xa > 2)) || /* $ASCII */
7573: (ch == 'o' && (xa > 2)) || /* $ORDER */
7574: (ch == 'q' && (xa > 2)) || /* $QUERY */
7575: (ch == 'g' && (xa > 2)) || /* $GET */
7576: (ch == 'j' && (xa < 2 || xa > 3)) || /* $JUSTIFY */
7577: (ch == 'l' && (xa > 2)) || /* $LENGTH */
7578: (ch == 't' && (xa > 3)) || /* $TEXT/TRANSLATE */
7579: (ch == 'f' && (xa < 2 || xa > 3))) { /* $FIND/FNUMBER */
7580: j = FUNARG;
7581: b = xb;
7582: goto zserr;
7583: }
7584: }
7585: } /* end number of args check */
7586: continue;
7587: }
7588: if (ch == '(') {
7589: if (f == ')' || f == '"') {
7590: j = ARGLIST;
7591: goto zserr;
7592: }
7593: j++;
7594: continue;
7595: }
7596: if (ch == ')') {
7597: tmp[0] = f;
7598: tmp[1] = EOL;
7599: if (find (" !#&'(*+,-/:<=>?@[\\]_\201", tmp)) {
7600: j = MISSOPD;
7601: goto zserr;
7602: }
7603: if (j--)
7604: continue;
7605: break;
7606: }
7607: if (ch == SP)
7608: break;
7609: tmp[0] = ch;
7610: tmp[1] = EOL;
7611: if (ch == '/' && (cmnd == 'r' || cmnd == 'w') && (f == SP || f == ',')) {
7612: int xch,
7613: xi,
7614: xj;
7615: char *xb;
7616:
7617: xi = 0; /* quotes */
7618: xj = 0; /* brackets */
7619: xb = b; /* do not change old 'b' pointer */
7620: while ((xch = *xb++) != EOL) {
7621: if (xch == '"') {
7622: toggle (xi);
7623: continue;
7624: }
7625: if (xi)
7626: continue;
7627: if (xch == '(') {
7628: xj++;
7629: continue;
7630: }
7631: if (xch == ')') {
7632: if ((xj--) > 1)
7633: continue;
7634: xch = *xb++;
7635: break;
7636: }
7637: if (xj)
7638: continue;
7639: if ((xch < 'A' || xch > 'Z') &&
7640: (xch < '1' || xch > '3'))
7641: break;
7642: }
7643: if (xch != ',' && xch != SP && xch != EOL) {
7644: b = xb;
7645: j = SPACER;
7646: goto zserr;
7647: }
7648: if (--xb == b) {
7649: j = ARGLIST;
7650: goto zserr;
7651: }
7652: }
7653: if (f == '?' && cmnd != 'r' && cmnd != 'w' &&
7654: find ("@1234567890.\201", tmp) == 0) { /* pattern match */
7655: j = MISSOPD;
7656: goto zserr;
7657: }
7658: /* note: write/read may have !?*#/ not as binary op */
7659: if (find ("&<=>[\\]_\201", tmp) || /* binary operator */
7660: (find ("!?*#/\201", tmp) && cmnd != 'r' && cmnd != 'w'))
7661: /* some may be negated */
7662: {
7663: if (find ("#*/\\_\201", tmp) || f != NOT) {
7664: tmp[0] = f;
7665: if (find (" &'(+-<=>[\\]_\201", tmp) ||
7666: (find ("!?*#/\201", tmp) && cmnd != 'r' && cmnd != 'w')) {
7667: j = MISSOPD;
7668: goto zserr;
7669: }
7670: }
7671: continue;
7672: }
7673: if (ch == '+' || ch == '-') {
7674: if (f == NOT) {
7675: j = MISSOPD;
7676: goto zserr;
7677: }
7678: continue;
7679: }
7680: if (ch == ':') {
7681: if (f == ',') {
7682: j = MISSOPD;
7683: goto zserr;
7684: }
7685: continue;
7686: }
7687: if (ch == '`' || ch == ';' || ch == '{' || ch == '|' ||
7688: ch == '}' || ch == '~') { /* illegal characters */
7689: j = ILLOP;
7690: goto zserr;
7691: }
7692: if (ch == '$') { /* check function */
7693: if (((f = *b | 0140) < 'a' || f > 'z') && f != '$') {
7694: j = ILLFUN;
7695: goto zserr;
7696: }
7697: continue;
7698: }
7699: if (ch == ',') { /* comma is a delimiter! */
7700: if (*(b - 2) == SP || (f = *b) == SP || f == EOL || f == ',') {
7701: j = ARGLIST;
7702: goto zserr;
7703: }
7704: }
7705: }
7706: if (i)
7707: j = QUOTER;
7708: else if (j)
7709: j = j > 0 ? INVEXPR : BRAER;
7710: if (j)
7711: goto zserr;
7712: if (ch == EOL)
7713: break;
7714: /* skip spaces before next command */
7715: while (ch == SP || ch == TAB)
7716: ch = *b++;
7717: b--;
7718: }
7719: *a = EOL; /* no error found */
7720: return;
7721: } /* end zsyntax() */
7722:
7723: time_t horolog_to_unix (char *horo)
7724: {
7725:
7726: char *ptr = horo;
7727: register char ch;
7728: register short i;
7729:
7730: char horo_days[10];
7731: char horo_seconds[10];
7732:
7733: time_t seconds;
7734:
7735: i = 0;
7736:
7737: while ((ch = *(ptr++)) != ',') {
7738: horo_days[i++] = ch;
7739: }
7740: horo_days[i] = '\0';
7741:
7742: i = 0;
7743: while ((ch = *(ptr++)) != EOL) {
7744: horo_seconds[i++] = ch;
7745: }
7746: horo_seconds[i] = '\0';
7747:
7748: seconds = (((atol (horo_days) - 47117L) * 86400L) + 43200 + atol (horo_seconds) + tzoffset);
7749:
7750: return (time_t) seconds;
7751:
7752: }
7753:
7754:
7755: /* a = result string
7756: * type = type of transform
7757: */
7758: void zkey (char *a, long type)
7759: {
7760:
7761: char del0;
7762: char del1;
7763: char del2;
7764: char del3;
7765: char del4;
7766:
7767: int f;
7768: char prod_rule[256];
7769: int i;
7770: int ncs; /* flag: non_collating_substring */
7771:
7772: if (type == 0) type = (-v93); /* zero is reverse of default type */
7773: if ((f = (type < 0))) type = (-type);
7774:
7775: if (type-- > NO_V93) {
7776: merr_raise (ARGER);
7777: return;
7778: }
7779:
7780: del2 = v93a[type][0]; /* delimiter between primary/seconary key */
7781: del0 = v93a[type][1]; /* delimiter between 'from' and 'to' substring */
7782: del3 = '('; /* introducer for 'non-collating' substrings */
7783: del4 = ')'; /* terminator for 'non-collating' substring */
7784: ncs = FALSE; /* non_collating_substring flag */
7785:
7786: if (del0 == EOL) return; /* no rule under of this type */
7787:
7788: del1 = v93a[type][2]; /* delimiter between different from/to pairs */
7789: /* production rule, stripped from delimiter declaration */
7790: /* with an added separator character at both ends */
7791:
7792: i = stcpy (prod_rule, &v93a[type][2]);
7793: prod_rule[i] = del1;
7794: prod_rule[++i] = EOL;
7795:
7796: if (f) goto backw; /* negative is backward transform */
7797:
7798: /* forward transform */
7799: i = stlen (a);
7800:
7801: if (i == 0) return; /* string empty - nothing to do */
7802:
7803: {
7804: char ct0[256];
7805: char ct1[256];
7806: int ch = 0;
7807: int d = 0;
7808: int i1 = 0;
7809: int j = 0;
7810: int n0 = 0;
7811: int n1 = 0;
7812: int pos = 0;
7813: char c;
7814:
7815: i = 0;
7816: n0 = 0;
7817: n1 = 0;
7818:
7819: while ((c = a[i]) != EOL) { /* non-collating substring? */
7820:
7821: if (c == del3) { /* introducer valid only with matching terminator! */
7822:
7823: j = i;
7824:
7825: while ((ch = a[++j]) != EOL) {
7826: if (ch == del4) break;
7827: }
7828:
7829: if (ch == del4) {
7830:
7831: while (i <= j) ct1[n1++] = a[i++];
7832: continue;
7833:
7834: }
7835:
7836: }
7837:
7838: j = 0;
7839: d = 0;
7840:
7841: /* search for longest matching string */
7842: while ((ch = prod_rule[j++]) != EOL) {
7843:
7844: if (ch == del1) {
7845:
7846: if (prod_rule[j] != c) continue;
7847:
7848: i1 = i;
7849:
7850: while ((ch = prod_rule[j++]) != del0 && ch == a[i1++]) ;
7851:
7852: if (ch != del0) continue;
7853:
7854: if ((ch = i1 - i) > d) {
7855: d = ch;
7856: pos = j;
7857: }
7858:
7859: }
7860:
7861: }
7862:
7863: if (n0 > STRLEN) {
7864: merr_raise (M75);
7865: return;
7866: } /* string too long */
7867:
7868: if (d == 0) {
7869:
7870: ct0[n0++] = c;
7871: ct1[n1++] = '0';
7872: i++;
7873:
7874: continue;
7875:
7876: }
7877:
7878: j = 0;
7879: c = prod_rule[pos];
7880: ch = '0';
7881:
7882: if (c == del1) {
7883:
7884: ct1[n1++] = ' ';
7885:
7886: while (j <= pos) {
7887:
7888: if (prod_rule[j] == del0) ch++;
7889:
7890: j++;
7891:
7892: }
7893:
7894: }
7895: else {
7896:
7897: while (j <= pos) {
7898:
7899: if (prod_rule[j] == del0 && prod_rule[j + 1] == c) ch++;
7900:
7901: j++;
7902:
7903: }
7904:
7905: }
7906:
7907: j = 0;
7908: i += d;
7909: ct1[n1++] = ch;
7910:
7911: while ((ct0[n0++] = prod_rule[pos++]) != del1) {
7912:
7913: if (n1 > STRLEN) {
7914: merr_raise (M75);
7915: return;
7916: } /* string too long */
7917:
7918: }
7919:
7920: n0--;
7921:
7922: }
7923:
7924: ct0[n0++] = del2;
7925: ct0[n0] = EOL;
7926: ct1[n1] = EOL;
7927:
7928: /* purge trailing zeroes */
7929: while (ct1[--n1] == '0') {
7930:
7931: ct1[n1] = EOL;
7932:
7933: if (n1 == 0) {
7934: n0--;
7935: break;
7936: }
7937:
7938: }
7939:
7940: if (n0 + n1 > STRLEN) {
7941: merr_raise (M75);
7942: return;
7943: } /* string too long */
7944:
7945: stcpy (a, ct0);
7946: stcpy (&a[n0], ct1);
7947:
7948: }
7949:
7950: return;
7951:
7952:
7953: /* backward transform */
7954: backw:
7955:
7956: i = stlen (a);
7957:
7958: if (i == 0) return; /* string empty */
7959:
7960: {
7961: int c;
7962: int ch;
7963: int d;
7964: int n0;
7965: int n1;
7966: int n2;
7967: int j;
7968: char z[256];
7969:
7970: stcpy (z, a);
7971: n0 = 0;
7972: n1 = 0;
7973: n2 = 0;
7974:
7975: while ((d = z[n1++]) != EOL && (d != del2)) ;
7976:
7977: if (d == EOL) return; /* nothing to change */
7978:
7979: for (;;) {
7980:
7981: c = z[n0];
7982: d = z[n1];
7983:
7984: if (c == del2 && d == EOL) break;
7985:
7986: if (d == EOL) {
7987: d = '0';
7988: }
7989: else {
7990: n1++;
7991: }
7992:
7993:
7994: if (d == del3) {
7995:
7996: a[n2++] = d;
7997: ncs = TRUE;
7998:
7999: continue;
8000:
8001: }
8002:
8003: if (ncs) {
8004:
8005: a[n2++] = d;
8006:
8007: if (d == del4) ncs = FALSE;
8008:
8009: continue;
8010:
8011: }
8012:
8013: if (d == ' ') { /* replacement with no chars */
8014:
8015: d = z[n1++] - '0';
8016: j = 1;
8017:
8018: while ((ch = prod_rule[j++]) != EOL) {
8019: if (ch == del0 && (--d) == 0) break;
8020: }
8021:
8022: }
8023: else {
8024:
8025: if ((d -= '0') == 0) {
8026:
8027: a[n2++] = c;
8028: n0++;
8029:
8030: continue;
8031:
8032: }
8033:
8034: j = 1;
8035:
8036: while ((ch = prod_rule[j++]) != EOL) {
8037: if (ch == del0 && prod_rule[j] == c && (--d) == 0) break;
8038: }
8039:
8040: }
8041:
8042: d = j;
8043:
8044: while ((ch = prod_rule[j++]) != EOL) {
8045:
8046: if (ch == del1) break;
8047:
8048: n0++;
8049:
8050: }
8051:
8052: d--;
8053:
8054: while (prod_rule[d--] != del1) ;
8055:
8056: if (prod_rule[d + 2] == EOL) {
8057: merr_raise (ARGER);
8058: return;
8059: } /* string is not of proper format */
8060:
8061: d++;
8062:
8063: while ((ch = prod_rule[++d]) != del0) a[n2++] = ch;
8064:
8065: }
8066:
8067: a[n2] = EOL;
8068:
8069: }
8070:
8071: return;
8072: } /* end zkey() */
8073:
8074: int levenshtein (char *word1, char *word2)
8075: {
8076: int l1 = 0;
8077: int l2 = 0;
8078: int i = 0;
8079: int j = 0;
8080: int m = 0;
8081: int t = 0;
8082: int x = 0;
8083: char d[2][256];
8084:
8085: l1 = stlen (word1);
8086: word1--;
8087:
8088: l2 = stlen (word2);
8089: word2--;
8090:
8091: if (l1 == 0) return (l2);
8092: if (l2 == 0) return (l1);
8093:
8094: t = 0;
8095:
8096: for (i = 0; i <= l1; i++) d[0][i] = i;
8097:
8098: for (j = 1; j <= l2; j++) {
8099:
8100: t ^= 1;
8101: d[t][0] = j;
8102:
8103: for (i = 1; i <= l1; i++) {
8104:
8105: m = d[t ^ 1][i - 1];
8106: if (word1[i] != word2[j]) m++;
8107:
8108: x = d[t ^ 1][i];
8109: if (++x < m) m = x;
8110:
8111: x = d[t][i - 1];
8112: if (++x < m) m = x;
8113:
8114: d[t][i] = m;
8115:
8116: }
8117:
8118: }
8119:
8120: return (m);
8121: }
8122:
8123: /* conditional rounding */
8124: /* 'a' is assumed to be a 'canonic' numeric string */
8125: /* it is rounded to 'digits' fractional digits provided that */
8126: /* the canonic result has at most (digits-2) frac.digits */
8127: void cond_round (char *a, int digits)
8128: {
8129: int ch;
8130: int i;
8131: int point;
8132: int lena;
8133:
8134: point = -1;
8135:
8136: i = 0;
8137: i = 0;
8138:
8139: while (a[i] != EOL) {
8140:
8141: if (a[i] == '.') point = i;
8142: i++;
8143:
8144: }
8145:
8146: lena = i;
8147:
8148: if (point < 0) point = i;
8149: if ((point + digits + 1) >= i) return; /* nothing to round */
8150:
8151: i = point + digits + 1;
8152:
8153: if (a[i] < '5') {
8154:
8155: if ((a[i - 1] != '0') || (a[i - 2] != '0')) return; /* condition! */
8156:
8157: a[i] = EOL;
8158:
8159: while (a[--i] == '0') a[i] = EOL;
8160:
8161: if (a[i] == '.') {
8162:
8163: a[i] = EOL;
8164:
8165: if (i == 0 || (i == 1 && a[0] == '-')) a[0] = '0';
8166:
8167: }
8168:
8169: return;
8170:
8171: }
8172:
8173: if (a[i - 1] != '9' || a[i - 2] != '9') return; /* condition */
8174:
8175: for (;;) {
8176:
8177: if (i >= point) {
8178: a[i] = EOL;
8179: }
8180: else {
8181: a[i] = '0';
8182: }
8183:
8184: if (--i < (a[0] == '-')) {
8185:
8186: for (i = lena; i >= 0; i--) a[i + 1] = a[i];
8187:
8188: a[a[0] == '-'] = '1';
8189:
8190: break;
8191:
8192: }
8193:
8194: if ((ch = a[i]) == '.') continue;
8195:
8196: if (a[i] < '9' && ch >= '0') {
8197: a[i] = ++ch;
8198: break;
8199: }
8200:
8201: }
8202:
8203: return;
8204:
8205: } /* end cond_round */
8206:
8207: short is_horolog(char *s)
8208: {
8209:
8210: register int i;
8211: char ch;
8212: int commata = 0;
8213: int digits = 0;
8214:
8215: if (!isdigit (s[0])) return FALSE;
8216:
8217: for (i = 0; i < stlen (s); i++) {
8218:
8219: ch = s[i];
8220:
8221: if (isdigit (ch)) {
8222: digits++;
8223: }
8224: else if (ch == ',' && commata == 0) {
8225: commata++;
8226: }
8227: else if (ch == ',' && commata > 0) {
8228: return FALSE;
8229: }
8230: else {
8231: return FALSE;
8232: }
8233:
8234: }
8235:
8236: if (commata != 1) {
8237: return FALSE;
8238: }
8239: else {
8240: return TRUE;
8241: }
8242:
8243: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to expr.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Coherent Logic Development] / freem / src