1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "glk/tads/tads2/tokenizer.h"
#include "glk/tads/tads2/error.h"
#include "glk/tads/tads2/memory_cache_heap.h"
#include "glk/tads/tads2/os.h"
#include "glk/tads/os_glk.h"
namespace Glk {
namespace TADS {
namespace TADS2 {
/* special temporary buffers for <<expr>> macro expansion */
static char tokmac1[] = ",say((";
static char tokmac1s[] = "(say((";
static char tokmac2[] = "),nil),\"";
static char tokmac3[] = "),nil))";
static char tokmac4[] = ")";
/* forward definition of static functions */
static int tokdfhsh(const char *sym, int len);
/* find a #define symbol */
static tokdfdef *tok_find_define(tokcxdef *ctx, const char *sym, int len)
{
int hsh;
tokdfdef *df;
/* find the appropriate chain the hash table */
hsh = tokdfhsh(sym, len);
/* search the chain for this symbol */
for (df = ctx->tokcxdf[hsh] ; df ; df = df->nxt)
{
/* if this one matches, return it */
if (df->len == len && !memcmp(df->nm, sym, (size_t)len))
{
/* fix it up if it's the special __FILE__ or __LINE__ symbol */
if (len == 8)
{
if (!memcmp(sym, "__FILE__", (size_t)8))
{
size_t elen;
/*
* put in the opening single quote, since we want
* the expanded result to be a string
*/
df->expan[0] = '\'';
/* get the name */
linnam(ctx->tokcxlin, df->expan+1);
/* get the length, and add the closing quote */
elen = strlen(df->expan);
df->expan[elen] = '\'';
/*
* set the length of the expansion, including the
* quotes (the first quote was measured in the
* length originally, but the second quote hasn't
* been counted yet, so add one to our original
* length)
*/
df->explen = (int)elen + 1;
/* if the expansion is too long, it's an error */
if (df->explen >= OSFNMAX)
errsig(ctx->tokcxerr, ERR_LONG_FILE_MACRO);
}
else if (!memcmp(sym, "__LINE__", (size_t)8))
{
ulong l;
/* get the line number */
l = linlnum(ctx->tokcxlin);
/* convert it to a textual format for the expansion */
sprintf(df->expan, "%lu", l);
/* set the expanded value's length */
df->explen = strlen(df->expan);
/* make sure the expansion isn't too long */
if (df->explen >= 40)
errsig(ctx->tokcxerr, ERR_LONG_LINE_MACRO);
}
}
/* return it */
return df;
}
}
/* didn't find anything */
return 0;
}
/*
* Write preprocessor state to a file
*/
void tok_write_defines(tokcxdef *ctx, osfildef *fp, errcxdef *ec)
{
int i;
tokdfdef **dfp;
tokdfdef *df;
char buf[4];
/* write each element of the hash chains */
for (i = TOKDFHSHSIZ, dfp = ctx->tokcxdf ; i ; ++dfp, --i)
{
/* write each entry in this hash chain */
for (df = *dfp ; df ; df = df->nxt)
{
/* write this entry */
oswp2(buf, df->len);
oswp2(buf + 2, df->explen);
if (osfwb(fp, buf, 4)
|| osfwb(fp, df->nm, df->len)
|| (df->explen != 0 && osfwb(fp, df->expan, df->explen)))
errsig(ec, ERR_WRTGAM);
}
/* write a zero-length entry to indicate the end of this chain */
oswp2(buf, 0);
if (osfwb(fp, buf, 4)) errsig(ec, ERR_WRTGAM);
}
}
/* compute a #define symbol's hash value */
static int tokdfhsh(const char *sym, int len)
{
uint hsh;
for (hsh = 0 ; len ; ++sym, --len)
hsh = (hsh + *sym) & TOKDFHSHMASK;
return hsh;
}
/* convert a #define symbol to lower case if folding case */
static const char *tok_casefold_defsym(tokcxdef *ctx, char *outbuf,
const char *src, int len)
{
if (ctx->tokcxflg & TOKCXCASEFOLD)
{
char *dst;
int rem;
/* make a lower-case copy of the symbol */
rem = (len > TOKNAMMAX ? TOKNAMMAX : len);
for (dst = outbuf ; rem > 0 ; ++dst, ++src, --rem)
*dst = (Common::isUpper((uchar)*src) ? Common::isLower((uchar)*src) : *src);
/* use the lower-case copy instead of the original */
return outbuf;
}
else
{
/* return the original unchanged */
return src;
}
}
/*
* convert a token to lower-case if we're folding case
*/
void tok_case_fold(tokcxdef *ctx, tokdef *tok)
{
/* if we're in case-insensitive mode, convert the token to lower-case */
if (ctx->tokcxflg & TOKCXCASEFOLD)
{
char *p;
int len;
/* convert each character in the token to lower-case */
for (p = tok->toknam, len = tok->toklen ; len != 0 ; ++p, --len)
{
/* if this character is upper-case, convert it to lower-case */
if (Common::isUpper((uchar)*p))
*p = Common::isLower((uchar)*p);
}
}
}
/* add a symbol to the #define symbol table, folding case if necessary */
void tok_add_define_cvtcase(tokcxdef *ctx, const char *sym, int len,
const char *expan, int explen)
{
char mysym[TOKNAMMAX];
/* convert to lower-case if necessary */
sym = tok_casefold_defsym(ctx, mysym, sym, len);
/* add the symbol */
tok_add_define(ctx, sym, len, expan, explen);
}
/* add a symbol to the #define symbol table */
void tok_add_define(tokcxdef *ctx, const char *sym, int len,
char *expan, int explen)
{
int hsh;
tokdfdef *df;
/* if it's already defined, ignore it */
if (tok_find_define(ctx, sym, len))
return;
/* find the appropriate entry in the hash table */
hsh = tokdfhsh(sym, len);
/* allocate space for the symbol */
df = (tokdfdef *)mchalo(ctx->tokcxerr,
(sizeof(tokdfdef) + len + explen - 1),
"tok_add_define");
/* set up the new symbol */
df->nm = df->expan + explen;
df->len = len;
df->explen = explen;
memcpy(df->expan, expan, explen);
memcpy(df->nm, sym, len);
/* link it into the hash chain */
df->nxt = ctx->tokcxdf[hsh];
ctx->tokcxdf[hsh] = df;
}
/* add a #define symbol with a numeric value */
void tok_add_define_num_cvtcase(tokcxdef *ctx, char *sym, int len, int num)
{
char buf[20];
/* convert the value to a string */
sprintf(buf, "%d", num);
/* add the text value */
tok_add_define_cvtcase(ctx, sym, len, buf, strlen(buf));
}
/* undefine a #define symbol */
void tok_del_define(tokcxdef *ctx, const char *sym, int len)
{
int hsh;
tokdfdef *df;
tokdfdef *prv;
/* find the appropriate chain the hash table */
hsh = tokdfhsh(sym, len);
/* search the chain for this symbol */
for (prv = 0, df = ctx->tokcxdf[hsh] ; df ; prv = df, df = df->nxt)
{
/* if this one matches, delete it */
if (df->len == len && !memcmp(df->nm, sym, (size_t)len))
{
/* unlink it from the chain */
if (prv)
prv->nxt = df->nxt;
else
ctx->tokcxdf[hsh] = df->nxt;
/* delete this symbol, and we're done */
mchfre(df);
break;
}
}
}
/* scan a #define symbol to see how long it is */
static int tok_scan_defsym(tokcxdef *ctx, const char *p, int len)
{
int symlen;
/* make sure it's a valid symbol */
if (!(Common::isAlpha((uchar)*p) || *p == '_' || *p == '$'))
{
errlog(ctx->tokcxerr, ERR_REQSYM);
return 0;
}
/* count characters as long as we have valid symbol characters */
for (symlen = 0 ; len && TOKISSYM(*p) ; ++p, --len, ++symlen) ;
return symlen;
}
/* process a #define */
static void tokdefine(tokcxdef *ctx, const char *p, int len)
{
const char *sym;
int symlen;
const char *expan;
char mysym[TOKNAMMAX];
/* get the symbol */
sym = p;
if (!(symlen = tok_scan_defsym(ctx, p, len)))
return;
/* if it's already in the table, log an error */
if (tok_find_define(ctx, sym, symlen))
{
errlog(ctx->tokcxerr, ERR_DEFREDEF);
return;
}
/* skip whitespace following the symbol */
expan = sym + symlen;
len -= symlen;
while (len && t_isspace(*expan)) --len, ++expan;
/* if we're folding case, convert the symbol to lower case */
sym = tok_casefold_defsym(ctx, mysym, sym, symlen);
/* define the symbol */
tok_add_define(ctx, sym, symlen, expan, len);
}
/*
* Update the #if status for the current nesting. Any enclosing
* negative #if will override everything inside, so we need to look
* through the nesting from the outside in until we either determine
* that everything is affirmative or we find a negative anywhere in the
* nesting.
*/
static void tok_update_if_stat(tokcxdef *ctx)
{
int i;
/* look through nesting from the outermost level */
for (i = 0 ; i < ctx->tokcxifcnt ; ++i)
{
/* assume this level will apply to everything inside */
ctx->tokcxifcur = ctx->tokcxif[i];
/* if this level is off, everything inside is off */
switch (ctx->tokcxif[i])
{
case TOKIF_IF_NO:
case TOKIF_ELSE_NO:
/*
* this level is off, hence everything inside is off -- stop
* here with the current (negative) determination
*/
return;
default:
/* so far we're in the "on" section, so keep looking */
break;
}
}
}
/* process an #ifdef or a #ifndef */
static void tok_ifdef_ifndef(tokcxdef *ctx, const char *p, int len, int is_ifdef)
{
int symlen;
const char *sym;
int stat;
int found;
char mysym[TOKNAMMAX];
/* get the symbol */
sym = p;
if (!(symlen = tok_scan_defsym(ctx, p, len)))
return;
/* if we're folding case, convert the symbol to lower case */
sym = tok_casefold_defsym(ctx, mysym, sym, symlen);
/* see if we can find it in the table, and set the status accordingly */
found = (tok_find_define(ctx, sym, symlen) != 0);
/* invert the test if this is an ifndef */
if (!is_ifdef) found = !found;
/* set the #if status accordingly */
if (found)
stat = TOKIF_IF_YES;
else
stat = TOKIF_IF_NO;
ctx->tokcxif[ctx->tokcxifcnt] = stat;
/* allocate a new #if level (making sure we have room) */
if (ctx->tokcxifcnt >= TOKIFNEST)
{
errlog(ctx->tokcxerr, ERR_MANYPIF);
return;
}
ctx->tokcxifcnt++;
/* update the current status */
tok_update_if_stat(ctx);
}
/* process a #error */
static void tok_p_error(tokcxdef *ctx, const char *p, int len)
{
errlog1(ctx->tokcxerr, ERR_P_ERROR,
ERRTSTR, errstr(ctx->tokcxerr, p, len));
}
/* process a #ifdef */
static void tokifdef(tokcxdef *ctx, const char *p, int len)
{
tok_ifdef_ifndef(ctx, p, len, TRUE);
}
/* process a #ifndef */
static void tokifndef(tokcxdef *ctx, const char *p, int len)
{
tok_ifdef_ifndef(ctx, p, len, FALSE);
}
/* process a #if */
static void tokif(tokcxdef *ctx, const char *p, int len)
{
errsig(ctx->tokcxerr, ERR_PIF_NA);
}
/* process a #elif */
static void tokelif(tokcxdef *ctx, const char *p, int len)
{
errsig(ctx->tokcxerr, ERR_PELIF_NA);
}
/* process a #else */
static void tokelse(tokcxdef *ctx, const char *p, int len)
{
int cnt;
/* if we're not expecting #else, it's an error */
cnt = ctx->tokcxifcnt;
if (cnt == 0 || ctx->tokcxif[cnt-1] == TOKIF_ELSE_YES
|| ctx->tokcxif[cnt-1] == TOKIF_ELSE_NO)
{
errlog(ctx->tokcxerr, ERR_BADPELSE);
return;
}
/* switch to the appropriate #else state (opposite the #if state) */
if (ctx->tokcxif[cnt-1] == TOKIF_IF_YES)
ctx->tokcxif[cnt-1] = TOKIF_ELSE_NO;
else
ctx->tokcxif[cnt-1] = TOKIF_ELSE_YES;
/* update the current status */
tok_update_if_stat(ctx);
}
/* process a #endif */
static void tokendif(tokcxdef *ctx, const char *p, int len)
{
/* if we're not expecting #endif, it's an error */
if (ctx->tokcxifcnt == 0)
{
errlog(ctx->tokcxerr, ERR_BADENDIF);
return;
}
/* remove the #if level */
ctx->tokcxifcnt--;
/* update the current status */
tok_update_if_stat(ctx);
}
/* process a #undef */
static void tokundef(tokcxdef *ctx, const char *p, int len)
{
const char *sym;
int symlen;
char mysym[TOKNAMMAX];
/* get the symbol */
sym = p;
if (!(symlen = tok_scan_defsym(ctx, p, len)))
return;
/* if we're folding case, convert the symbol to lower case */
sym = tok_casefold_defsym(ctx, mysym, sym, symlen);
/* if it's not defined, log a warning */
if (!tok_find_define(ctx, sym, symlen))
{
errlog(ctx->tokcxerr, ERR_PUNDEF);
return;
}
/* undefine the symbol */
tok_del_define(ctx, sym, symlen);
}
/* process a #pragma directive */
static void tokpragma(tokcxdef *ctx, const char *p, int len)
{
/* ignore empty pragmas */
if (len == 0)
{
errlog(ctx->tokcxerr, ERR_PRAGMA);
return;
}
/* see what we have */
if (len > 1
&& (*p == 'c' || *p == 'C')
&& (*(p+1) == '+' || *(p+1) == '-' || t_isspace(*(p+1))))
{
/* skip spaces after the 'C', if any */
for (++p, --len ; len && t_isspace(*p) ; ++p, --len) ;
/* look for the + or - flag */
if (len && *p == '+')
ctx->tokcxflg |= TOKCXFCMODE;
else if (len && *p == '-')
ctx->tokcxflg &= ~TOKCXFCMODE;
else
{
errlog(ctx->tokcxerr, ERR_PRAGMA);
return;
}
}
else
{
errlog(ctx->tokcxerr, ERR_PRAGMA);
}
}
/* process a #include directive */
static void tokinclude(tokcxdef *ctx, const char *p, int len)
{
linfdef *child;
tokpdef *path;
const char *fname;
int match;
int flen;
linfdef *lin;
const char *q;
size_t flen2;
/* find the filename portion */
fname = p + 1; /* remember start of filename */
path = ctx->tokcxinc; /* start with first path entry */
if (!len)
{
errlog(ctx->tokcxerr, ERR_INCNOFN);
return;
}
switch(*p)
{
case '<':
match = '>';
if (path && path->tokpnxt) path = path->tokpnxt; /* skip 1st path */
goto find_matching_delim;
case '"':
match = '"';
find_matching_delim:
for (++p, --len ; len && *p != match ; --len, ++p) ;
if (len == 0 || *p != match) errlog(ctx->tokcxerr, ERR_INCMTCH);
break;
default:
errlog(ctx->tokcxerr, ERR_INCSYN);
return;
}
flen = p - fname; /* compute length of filename */
for (q = p, flen2 = 0 ;
q > fname && *(q-1) != OSPATHCHAR && !strchr(OSPATHALT, *(q-1)) ;
--q, ++flen2) ;
/* check to see if this file has already been included */
for (lin = ctx->tokcxhdr ; lin ; lin = (linfdef *)lin->linflin.linnxt)
{
char *p2 = lin->linfnam;
p2 += strlen(p2);
while (p2 > lin->linfnam && *(p2-1) != OSPATHCHAR
&& !strchr(OSPATHALT, *(p2-1)))
--p2;
if (strlen(p2) == flen2
&& !memicmp(p2, q, flen2))
{
errlog1(ctx->tokcxerr, ERR_INCRPT, ERRTSTR,
errstr(ctx->tokcxerr, fname, flen));
return;
}
}
/* initialize the line source */
child = linfini(ctx->tokcxmem, ctx->tokcxerr, fname, flen, path, TRUE,
(ctx->tokcxflg & TOKCXFLIN2) != 0);
/* if not found, signal an error */
if (!child) errsig1(ctx->tokcxerr, ERR_INCSEAR,
ERRTSTR, errstr(ctx->tokcxerr, fname, flen));
/* link into tokenizer list of line records */
child->linflin.linnxt = (lindef *)ctx->tokcxhdr;
ctx->tokcxhdr = child;
/* if we're tracking sources for debugging, add into the chain */
if (ctx->tokcxdbg)
{
ctx->tokcxdbg->dbgcxlin = &child->linflin;
child->linflin.linid = ctx->tokcxdbg->dbgcxfid++;
}
/* remember my C-mode setting */
if (ctx->tokcxflg & TOKCXFCMODE)
ctx->tokcxlin->linflg |= LINFCMODE;
else
ctx->tokcxlin->linflg &= ~LINFCMODE;
child->linflin.linpar = ctx->tokcxlin; /* remember parent line source */
ctx->tokcxlin = &child->linflin; /* make the child the current source */
}
/* get a new line from line source, processing '#' directives */
static int tokgetlin(tokcxdef *ctx, int dopound)
{
for (;;)
{
if (linget(ctx->tokcxlin))
{
/* at eof in current source; resume parent if there is one */
if (ctx->tokcxlin->linpar)
{
lindef *parent;
parent = ctx->tokcxlin->linpar; /* remember parent */
lincls(ctx->tokcxlin); /* close included file */
if (!ctx->tokcxdbg) /* if no debug context... */
mchfre(ctx->tokcxlin); /* free line source */
ctx->tokcxlin = parent; /* reset to parent line source */
if (parent->linflg & LINFCMODE)
ctx->tokcxflg |= TOKCXFCMODE;
else
ctx->tokcxflg &= ~TOKCXFCMODE;
continue; /* back for another attempt */
}
else
{
/* check for outstanding #if/#ifdef */
if (ctx->tokcxifcnt)
errlog(ctx->tokcxerr, ERR_NOENDIF);
/* return end-of-file indication */
return TRUE;
}
}
/* if this is a multi-segment line, copy it into our own buffer */
if (ctx->tokcxlin->linflg & LINFMORE)
{
char *p;
uint rem;
int done;
if (!ctx->tokcxbuf)
{
/* allocate 1k as a default buffer */
ctx->tokcxbuf = (char *)mchalo(ctx->tokcxerr, 1024,
"tok");
ctx->tokcxbsz = 1024;
}
ctx->tokcxlen = 0;
for (done = FALSE, p = ctx->tokcxbuf, rem = ctx->tokcxbsz ;
!done ; )
{
size_t len = ctx->tokcxlin->linlen;
/* add the current segment's length into line length */
ctx->tokcxlen += len;
/* we're done after this piece if the last fetch was all */
done = !(ctx->tokcxlin->linflg & LINFMORE);
if (len + 1 > rem)
{
char *newp;
/* increase the size of the buffer */
if (ctx->tokcxbsz > (unsigned)0x8000)
errsig(ctx->tokcxerr, ERR_LONGLIN);
rem += 4096;
ctx->tokcxbsz += 4096;
/* allocate a new buffer and copy line into it */
newp = (char *)mchalo(ctx->tokcxerr, ctx->tokcxbsz, "tok");
memcpy(newp, ctx->tokcxbuf, (size_t)(p - ctx->tokcxbuf));
/* free the original buffer, and use the new one */
p = (p - ctx->tokcxbuf) + newp;
mchfre(ctx->tokcxbuf);
ctx->tokcxbuf = newp;
}
/* add the line to the buffer */
memcpy(p, ctx->tokcxlin->linbuf, len);
p += len;
rem -= len;
/* get the next piece of the line if there is one */
if (!done)
{
if (linget(ctx->tokcxlin)) break;
}
}
/* null-terminate the buffer, and use it for input */
*p = '\0';
ctx->tokcxptr = ctx->tokcxbuf;
}
else
{
ctx->tokcxptr = ctx->tokcxlin->linbuf;
ctx->tokcxlen = ctx->tokcxlin->linlen;
}
/* check for preprocessor directives */
if (dopound && ctx->tokcxlen != 0 && ctx->tokcxptr[0] == '#'
&& !(ctx->tokcxlin->linflg & LINFNOINC))
{
const char *p;
int len;
static const struct
{
const char *nm;
int len;
int ok_in_if;
void (*fn)(tokcxdef *, const char *, int);
}
*dirp, dir[] =
{
{ "include", 7, FALSE, tokinclude },
{ "pragma", 6, FALSE, tokpragma },
{ "define", 6, FALSE, tokdefine },
{ "ifdef", 5, TRUE, tokifdef },
{ "ifndef", 6, TRUE, tokifndef },
{ "if", 2, TRUE, tokif },
{ "else", 4, TRUE, tokelse },
{ "elif", 4, TRUE, tokelif },
{ "endif", 5, TRUE, tokendif },
{ "undef", 5, FALSE, tokundef },
{ "error", 5, FALSE, tok_p_error }
};
int i;
/* scan off spaces between '#' and directive */
for (len = ctx->tokcxlen - 1, p = &ctx->tokcxptr[1] ;
len && t_isspace(*p) ; --len, ++p) ;
/* find and process the directive */
for (dirp = dir, i = sizeof(dir)/sizeof(dir[0]) ; i ; --i, ++dirp)
{
/* compare this directive; if it wins, call its function */
if (len >= dirp->len && !memcmp(p, dirp->nm, (size_t)dirp->len)
&& (len == dirp->len || t_isspace(*(p + dirp->len))))
{
int cnt;
int stat;
/*
* if we're not in a #if's false part, or if the
* directive is processed even in #if false parts,
* process the line, otherwise skip it
*/
cnt = ctx->tokcxifcnt;
if (dirp->ok_in_if || cnt == 0
|| ((stat = ctx->tokcxifcur) == TOKIF_IF_YES
|| stat == TOKIF_ELSE_YES))
{
/* skip whitespace following the directive */
for (p += dirp->len, len -= dirp->len ;
len && t_isspace(*p) ;
--len, ++p) ;
/* invoke the function to process this directive */
(*dirp->fn)(ctx, p, len);
}
/* there's no need to look at more directives */
break;
}
}
/* if we didn't find anything, flag the error */
if (i == 0)
errlog(ctx->tokcxerr, ERR_PRPDIR);
/* ignore this line */
continue;
}
else
{
/*
* Check the #if level. If we're in an #if, and we're to
* ignore lines (because of a false condition or an #else
* part for a true condition), skip this line.
*/
if (ctx->tokcxifcnt != 0)
{
switch(ctx->tokcxifcur)
{
case TOKIF_IF_NO:
case TOKIF_ELSE_NO:
/* ignore this line */
continue;
default:
/* we're in a true part - keep the line */
break;
}
}
ctx->tokcxlin->linflg &= ~LINFDBG; /* no debug record yet */
return(FALSE); /* return the line we found */
}
}
}
/* get the next token, removing it from the input stream */
int toknext(tokcxdef *ctx)
{
const char *p;
tokdef *tok = &ctx->tokcxcur;
int len;
/*
* Check for the special case that we pushed an open paren prior to
* a string containing an embedded expression. If this is the case,
* immediately return the string we previously parsed.
*/
if ((ctx->tokcxflg & TOKCXF_EMBED_PAREN_PRE) != 0)
{
/*
* convert the token to a string - note that the offset
* information for the string is already in the current token
* structure, since we set everything up for it on the previous
* call where we actually parsed the beginning of the string
*/
tok->toktyp = TOKTDSTRING;
/* clear the special flag - we've now consumed the pushed string */
ctx->tokcxflg &= ~TOKCXF_EMBED_PAREN_PRE;
/* immediately return the string */
return tok->toktyp;
}
/* set up at the current scanning position */
p = ctx->tokcxptr;
len = ctx->tokcxlen;
/* scan off whitespace and comments until we find something */
do
{
skipblanks:
/* if there's nothing on this line, get the next one */
if (len == 0)
{
/* if we're in a macro expansion, continue after it */
if (ctx->tokcxmlvl)
{
ctx->tokcxmlvl--;
p = ctx->tokcxmsav[ctx->tokcxmlvl];
len = ctx->tokcxmsvl[ctx->tokcxmlvl];
}
else
{
if (tokgetlin(ctx, TRUE))
{
tok->toktyp = TOKTEOF;
goto done;
}
p = ctx->tokcxptr;
len = ctx->tokcxlen;
}
}
while (len && t_isspace(*p)) ++p, --len; /* scan off whitespace */
/* check for comments, and remove if present */
if (len >= 2 && *p == '/' && *(p+1) == '/')
len = 0;
else if (len >= 2 && *p == '/' && *(p+1) == '*')
{
while (len < 2 || *p != '*' || *(p+1) != '/')
{
if (len != 0)
++p, --len;
if (len == 0)
{
if (ctx->tokcxmlvl != 0)
{
ctx->tokcxmlvl--;
p = ctx->tokcxmsav[ctx->tokcxmlvl];
len = ctx->tokcxmsvl[ctx->tokcxmlvl];
}
else
{
if (tokgetlin(ctx, FALSE))
{
ctx->tokcxptr = p;
tok->toktyp = TOKTEOF;
goto done;
}
p = ctx->tokcxptr;
len = ctx->tokcxlen;
}
}
}
p += 2;
len -= 2;
goto skipblanks;
}
} while (len == 0);
nexttoken:
if (Common::isAlpha((uchar)*p) || *p == '_' || *p == '$')
{
int l;
int hash;
const char *q;
char *tq;
toktdef *tab;
int found = FALSE;
uchar thischar;
tokdfdef *df;
for (hash = 0, l = 0, tq = tok->toknam ;
len != 0 && TOKISSYM(*p) && l < TOKNAMMAX ;
(thischar = ((Common::isUpper((uchar)*p)
&& (ctx->tokcxflg & TOKCXCASEFOLD))
? Common::isLower((uchar)*p) : *p)),
(hash = ((hash + thischar) & (TOKHASHSIZE - 1))),
(*tq++ = thischar), ++p, --len, ++l) ;
*tq = '\0';
if (len != 0 && TOKISSYM(*p))
{
while (len != 0 && TOKISSYM(*p)) ++p, --len;
errlog1(ctx->tokcxerr, ERR_TRUNC, ERRTSTR,
errstr(ctx->tokcxerr, tok->toknam, tok->toklen));
}
tok->toklen = l;
tok->tokhash = hash;
/*
* check for the special defined() preprocessor operator
*/
if (l == 9 && !memcmp(tok->toknam,
((ctx->tokcxflg & TOKCXCASEFOLD)
? "__defined" : "__DEFINED"),
(size_t)9)
&& len > 2 && *p == '(' && TOKISSYM(*(p+1))
&& !Common::isDigit((uchar)*(p+1)))
{
int symlen;
char mysym[TOKNAMMAX];
/* find the matching ')', allowing only symbolic characters */
++p, --len;
for (symlen = 0, q = p ; len && *p != ')' && TOKISSYM(*p) ;
++p, --len, ++symlen) ;
/* make sure we found the closing paren */
if (!len || *p != ')')
errsig(ctx->tokcxerr, ERR_BADISDEF);
++p, --len;
/* if we're folding case, convert the symbol to lower case */
q = tok_casefold_defsym(ctx, mysym, q, symlen);
/* check to see if it's defined */
tok->toktyp = TOKTNUMBER;
tok->tokval = (tok_find_define(ctx, q, symlen) != 0);
goto done;
}
/* substitute the preprocessor #define, if any */
if ((df = tok_find_define(ctx, tok->toknam, l)) != 0)
{
/* save the current parsing position */
if (ctx->tokcxmlvl >= TOKMACNEST)
errsig(ctx->tokcxerr, ERR_MACNEST);
ctx->tokcxmsav[ctx->tokcxmlvl] = p;
ctx->tokcxmsvl[ctx->tokcxmlvl] = len;
ctx->tokcxmlvl++;
/* point to the token's expansion and keep going */
p = df->expan;
len = df->explen;
goto nexttoken;
}
/* look up in symbol table(s), if any */
for (tab = ctx->tokcxstab ; tab ; tab = tab->toktnxt)
{
if ((found = (*tab->toktfsea)(tab, tok->toknam, l, hash,
&tok->toksym)) != 0)
break;
}
if (found && tok->toksym.tokstyp == TOKSTKW)
tok->toktyp = tok->toksym.toksval;
else
{
tok->toktyp = TOKTSYMBOL;
if (!found) tok->toksym.tokstyp = TOKSTUNK;
}
goto done;
}
else if (Common::isDigit((uchar)*p))
{
long acc = 0;
/* check for octal/hex */
if (*p == '0')
{
++p, --len;
if (len && (*p == 'x' || *p == 'X'))
{
/* hex */
++p, --len;
while (len && TOKISHEX(*p))
{
acc = (acc << 4) + TOKHEX2INT(*p);
++p, --len;
}
}
else
{
/* octal */
while (len && TOKISOCT(*p))
{
acc = (acc << 3) + TOKOCT2INT(*p);
++p, --len;
}
}
}
else
{
/* decimal */
while (len && Common::isDigit((uchar)*p))
{
acc = (acc << 1) + (acc << 3) + TOKDEC2INT(*p);
++p, --len;
}
}
tok->tokval = acc;
tok->toktyp = TOKTNUMBER;
goto done;
}
else if (*p == '"' || *p == '\'')
{
char delim; /* closing delimiter we're looking for */
const char *strstart; /* pointer to start of string */
int warned;
delim = *p;
--len;
strstart = ++p;
if (delim == '"' && len >= 2 && *p == '<' && *(p+1) == '<')
{
/* save the current parsing position */
if (ctx->tokcxmlvl >= TOKMACNEST)
errsig(ctx->tokcxerr, ERR_MACNEST);
ctx->tokcxmsav[ctx->tokcxmlvl] = p + 2;
ctx->tokcxmsvl[ctx->tokcxmlvl] = len - 2;
ctx->tokcxmlvl++;
/*
* read from the special "<<" expansion string - use the
* version for a "<<" at the very beginning of the string
*/
p = tokmac1s;
len = strlen(p);
ctx->tokcxflg |= TOKCXFINMAC;
goto nexttoken;
}
tok->toktyp = (delim == '"' ? TOKTDSTRING : TOKTSSTRING);
tok->tokofs = (*ctx->tokcxsst)(ctx->tokcxscx); /* start the string */
for (warned = FALSE ;; )
{
if (len >= 2 && *p == '\\')
{
if (*(p+1) == '"' || *(p+1) == '\'')
{
(*ctx->tokcxsad)(ctx->tokcxscx, strstart,
(ushort)(p - strstart));
strstart = p + 1;
}
p += 2;
len -= 2;
}
else if (len == 0 || *p == delim ||
(delim == '"' && len >= 2 && *p == '<' && *(p+1) == '<'
&& !(ctx->tokcxflg & TOKCXFINMAC)))
{
(*ctx->tokcxsad)(ctx->tokcxscx, strstart,
(ushort)(p - strstart));
if (len == 0)
{
if (ctx->tokcxmlvl)
{
ctx->tokcxmlvl--;
p = ctx->tokcxmsav[ctx->tokcxmlvl];
len = ctx->tokcxmsvl[ctx->tokcxmlvl];
}
else
(*ctx->tokcxsad)(ctx->tokcxscx, " ", (ushort)1);
while (len == 0)
{
if (tokgetlin(ctx, FALSE))
errsig(ctx->tokcxerr, ERR_STREOF);
p = ctx->tokcxptr;
len = ctx->tokcxlen;
/* warn if it looks like the end of an object */
if (!warned && len && (*p == ';' || *p == '}'))
{
errlog(ctx->tokcxerr, ERR_STREND);
warned = TRUE; /* warn only once per string */
}
/* scan past whitespace at start of line */
while (len && t_isspace(*p)) ++p, --len;
}
strstart = p;
}
else break;
}
else
++p, --len;
}
/* end the string */
(*ctx->tokcxsend)(ctx->tokcxscx);
/* check to see how it ended */
if (len != 0 && *p == delim)
{
/*
* We ended with the matching delimiter. Move past the
* closing delimiter.
*/
++p;
--len;
/*
* If we have a pending close paren we need to put in
* because of an embedded expression that occurred earlier
* in the string, parse the macro to provide the paren.
*/
if ((ctx->tokcxflg & TOKCXF_EMBED_PAREN_AFT) != 0
&& !(ctx->tokcxflg & TOKCXFINMAC))
{
/* clear the flag */
ctx->tokcxflg &= ~TOKCXF_EMBED_PAREN_AFT;
/* push the current parsing position */
if (ctx->tokcxmlvl >= TOKMACNEST)
errsig(ctx->tokcxerr, ERR_MACNEST);
ctx->tokcxmsav[ctx->tokcxmlvl] = p;
ctx->tokcxmsvl[ctx->tokcxmlvl] = len;
ctx->tokcxmlvl++;
/* parse the macro */
p = tokmac4;
len = strlen(p);
}
}
else if (len != 0 && *p == '<')
{
/* save the current parsing position */
if (ctx->tokcxmlvl >= TOKMACNEST)
errsig(ctx->tokcxerr, ERR_MACNEST);
ctx->tokcxmsav[ctx->tokcxmlvl] = p + 2;
ctx->tokcxmsvl[ctx->tokcxmlvl] = len - 2;
ctx->tokcxmlvl++;
/* read from the "<<" expansion */
p = tokmac1;
len = strlen(p);
ctx->tokcxflg |= TOKCXFINMAC;
/*
* Set the special push-a-paren flag: we'll return an open
* paren now, so that we have an open paren before the
* string, and then on the next call to toknext() we'll
* immediately return the string we've already parsed here.
* This will ensure that everything in the string is
* properly grouped together as a single indivisible
* expression.
*
* Note that we only need to do this for the first embedded
* expression in a string. Once we have a close paren
* pending, we don't need more open parens.
*/
if (!(ctx->tokcxflg & TOKCXF_EMBED_PAREN_AFT))
{
ctx->tokcxflg |= TOKCXF_EMBED_PAREN_PRE;
tok->toktyp = TOKTLPAR;
}
}
goto done;
}
else if (len >= 2 && *p == '>' && *(p+1) == '>'
&& (ctx->tokcxflg & TOKCXFINMAC) != 0)
{
/* skip the ">>" */
ctx->tokcxflg &= ~TOKCXFINMAC;
p += 2;
len -= 2;
/* save the current parsing position */
if (ctx->tokcxmlvl >= TOKMACNEST)
errsig(ctx->tokcxerr, ERR_MACNEST);
ctx->tokcxmsav[ctx->tokcxmlvl] = p;
ctx->tokcxmsvl[ctx->tokcxmlvl] = len;
ctx->tokcxmlvl++;
if (*p == '"')
{
++(ctx->tokcxmsav[ctx->tokcxmlvl - 1]);
--(ctx->tokcxmsvl[ctx->tokcxmlvl - 1]);
p = tokmac3;
/*
* we won't need an extra closing paren now, since tokmac3
* provides it
*/
ctx->tokcxflg &= ~TOKCXF_EMBED_PAREN_AFT;
}
else
{
/*
* The string is continuing. Set a flag to note that we
* need to provide a close paren after the end of the
* string, and parse the glue (tokmac2) that goes between
* the expression and the resumption of the string.
*/
ctx->tokcxflg |= TOKCXF_EMBED_PAREN_AFT;
p = tokmac2;
}
len = strlen(p);
goto nexttoken;
}
else
{
tokscdef *sc;
for (sc = ctx->tokcxsc[ctx->tokcxinx[(uchar)*p]] ; sc ;
sc = sc->tokscnxt)
{
if (toksceq(sc->tokscstr, p, sc->toksclen, len))
{
tok->toktyp = sc->toksctyp;
p += sc->toksclen;
len -= sc->toksclen;
goto done;
}
}
errsig(ctx->tokcxerr, ERR_INVTOK);
}
done:
ctx->tokcxptr = p;
ctx->tokcxlen = len;
return(tok->toktyp);
}
/* initialize a linear symbol table */
void toktlini(errcxdef *errctx, toktldef *toktab, uchar *mem, uint siz)
{
CLRSTRUCT(*toktab);
/* initialize superclass data */
toktab->toktlsc.toktfadd = toktladd; /* set add-symbol method */
toktab->toktlsc.toktfsea = toktlsea; /* set search-table method */
toktab->toktlsc.toktfeach = toktleach; /* set 'each' method */
toktab->toktlsc.toktfset = toktlset; /* set 'update' method */
toktab->toktlsc.tokterr = errctx; /* set error handling context */
/* initialize class data */
toktab->toktlptr = mem;
toktab->toktlnxt = mem;
toktab->toktlsiz = siz;
}
/* add a symbol to a linear symbol table */
void toktladd(toktdef *toktab1, char *name, int namel,
int typ, int val, int hash)
{
uint siz = sizeof(toks1def) + namel;
toksdef *sym;
toktldef *toktab = (toktldef *)toktab1;
VARUSED(hash);
if (toktab->toktlsiz < siz)
errsig(toktab->toktlsc.tokterr, ERR_NOLCLSY);
sym = (toksdef *)toktab->toktlnxt;
siz = osrndsz(siz);
toktab->toktlnxt += siz;
if (siz > toktab->toktlsiz) toktab->toktlsiz = 0;
else toktab->toktlsiz -= siz;
/* set up symbol */
sym->toksval = val;
sym->tokslen = namel;
sym->tokstyp = typ;
sym->toksfr = 0;
memcpy(sym->toksnam, name, (size_t)(namel + 1));
/* indicate there's one more symbol in the table */
++(toktab->toktlcnt);
}
/* delete all symbols from a linear symbol table */
void toktldel(toktldef *tab)
{
tab->toktlcnt = 0;
tab->toktlsiz += tab->toktlnxt - tab->toktlptr;
tab->toktlnxt = tab->toktlptr;
}
/* call a function for every symbol in a linear symbol table */
void toktleach(toktdef *tab1,
void (*cb)(void *ctx, toksdef *sym), void *ctx)
{
toksdef *p;
uint cnt;
toktldef *tab = (toktldef *)tab1;
for (p = (toksdef *)tab->toktlptr, cnt = tab->toktlcnt ; cnt ; --cnt )
{
(*cb)(ctx, p);
p = (toksdef *)(((uchar *)p)
+ osrndsz(p->tokslen + sizeof(toks1def)));
}
}
/* search a linear symbol table */
int toktlsea(toktdef *tab1, char *name, int namel, int hash, toksdef *ret)
{
toksdef *p;
uint cnt;
toktldef *tab = (toktldef *)tab1;
VARUSED(hash);
for (p = (toksdef *)tab->toktlptr, cnt = tab->toktlcnt ; cnt ; --cnt )
{
if (p->tokslen == namel && !memcmp(p->toksnam, name, (size_t)namel))
{
memcpy(ret, p, (size_t)(sizeof(toks1def) + namel));
return(TRUE);
}
p = (toksdef *)(((uchar *)p)
+ osrndsz(p->tokslen + sizeof(toks1def)));
}
/* nothing found - indicate by returning FALSE */
return(FALSE);
}
/* update a symbol in a linear symbol table */
void toktlset(toktdef *tab1, toksdef *newsym)
{
toksdef *p;
uint cnt;
toktldef *tab = (toktldef *)tab1;
for (p = (toksdef *)tab->toktlptr, cnt = tab->toktlcnt ; cnt ; --cnt )
{
if (p->tokslen == newsym->tokslen
&& !memcmp(p->toksnam, newsym->toksnam, (size_t)newsym->tokslen))
{
p->toksval = newsym->toksval;
p->tokstyp = newsym->tokstyp;
return;
}
p = (toksdef *)(((uchar *)p)
+ osrndsz(p->tokslen + sizeof(toks1def)));
}
}
tokcxdef *tokcxini(errcxdef *errctx, mcmcxdef *mcmctx, tokldef *sctab)
{
int i;
int cnt;
tokldef *p;
uchar c;
uchar index[256];
tokcxdef *ret;
tokscdef *sc;
ushort siz;
/* set up index table: finds tokcxsc entry from character value */
memset(index, 0, (size_t)sizeof(index));
for (i = cnt = 0, p = sctab ; (c = p->toklstr[0]) != 0 ; ++cnt, ++p)
if (!index[c]) index[c] = ++i;
/* allocate memory for table plus the tokscdef's */
siz = sizeof(tokcxdef) + (i * sizeof(tokscdef *))
+ ((cnt + 1) * sizeof(tokscdef));
ret = (tokcxdef *)mchalo(errctx, siz, "tokcxini");
memset(ret, 0, (size_t)siz);
/* copy the index, set up fixed part */
memcpy(ret->tokcxinx, index, sizeof(ret->tokcxinx));
ret->tokcxerr = errctx;
ret->tokcxmem = mcmctx;
/* start out without an #if */
ret->tokcxifcur = TOKIF_IF_YES;
/* force the first toknext() to read a line */
ret->tokcxptr = "\000";
/* figure where the tokscdef's go (right after sc pointer array) */
sc = (tokscdef *)&ret->tokcxsc[i+1];
/* set up the individual tokscdef entries, and link into lists */
for (p = sctab ; (c = p->toklstr[0]) != 0 ; ++p, ++sc)
{
size_t len;
sc->toksctyp = p->tokltyp;
len = sc->toksclen = strlen(p->toklstr);
memcpy(sc->tokscstr, p->toklstr, len);
sc->tokscnxt = ret->tokcxsc[index[c]];
ret->tokcxsc[index[c]] = sc;
}
return(ret);
}
/* add an include path to a tokdef */
void tokaddinc(tokcxdef *ctx, char *path, int pathlen)
{
tokpdef *newpath;
tokpdef *last;
/* find the tail of the include path list, if any */
for (last = ctx->tokcxinc ; last && last->tokpnxt ;
last = last->tokpnxt) ;
/* allocate storage for and set up a new path structure */
newpath = (tokpdef *)mchalo(ctx->tokcxerr,
(sizeof(tokpdef) + pathlen - 1),
"tokaddinc");
newpath->tokplen = pathlen;
newpath->tokpnxt = (tokpdef *)0;
memcpy(newpath->tokpdir, path, (size_t)pathlen);
/* link in at end of list (if no list yet, newpath becomes first entry) */
if (last)
last->tokpnxt = newpath;
else
ctx->tokcxinc = newpath;
}
} // End of namespace TADS2
} // End of namespace TADS
} // End of namespace Glk
|