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
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
|
/* Part of CPP library. (Macro and #define handling.)
Copyright (C) 1986, 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1998,
1999, 2000, 2001 Free Software Foundation, Inc.
Written by Per Bothner, 1994.
Based on CCCP program by Paul Rubin, June 1986
Adapted to ANSI C, Richard Stallman, Jan 1987
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, 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, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
In other words, you are welcome to use, share and improve this program.
You are forbidden to forbid anyone else to use, share and improve
what you give them. Help stamp out software-hoarding! */
#include "config.h"
#include "system.h"
#include "intl.h" /* for _("<command line>") below. */
#include "cpplib.h"
#include "cpphash.h"
struct cpp_macro
{
cpp_hashnode **params; /* Parameters, if any. */
cpp_token *expansion; /* First token of replacement list. */
const char *file; /* Defined in file name. */
unsigned int line; /* Starting line number. */
unsigned int count; /* Number of tokens in expansion. */
unsigned short paramc; /* Number of parameters. */
unsigned int fun_like : 1; /* If a function-like macro. */
unsigned int variadic : 1; /* If a variadic macro. */
unsigned int disabled : 1; /* If macro is disabled. */
unsigned int syshdr : 1; /* If macro defined in system header. */
};
typedef struct macro_arg macro_arg;
struct macro_arg
{
cpp_token *first; /* First token in unexpanded argument. */
cpp_token *expanded; /* Macro-expanded argument. */
cpp_token *stringified; /* Stringified argument. */
unsigned int count; /* # of tokens in argument. */
unsigned int expanded_count; /* # of tokens in expanded argument. */
};
/* Macro expansion. */
static void lock_pools PARAMS ((cpp_reader *));
static void unlock_pools PARAMS ((cpp_reader *));
static int enter_macro_context PARAMS ((cpp_reader *, cpp_hashnode *));
static void builtin_macro PARAMS ((cpp_reader *, cpp_token *));
static cpp_context *push_arg_context PARAMS ((cpp_reader *, macro_arg *));
static enum cpp_ttype parse_arg PARAMS ((cpp_reader *, macro_arg *, int));
static macro_arg *parse_args PARAMS ((cpp_reader *, const cpp_hashnode *));
static cpp_context *next_context PARAMS ((cpp_reader *));
static void expand_arg PARAMS ((cpp_reader *, macro_arg *));
static unsigned char *quote_string PARAMS ((unsigned char *,
const unsigned char *,
unsigned int));
static void make_string_token PARAMS ((cpp_pool *, cpp_token *,
const U_CHAR *, unsigned int));
static void make_number_token PARAMS ((cpp_reader *, cpp_token *, int));
static void stringify_arg PARAMS ((cpp_reader *, macro_arg *));
static void paste_all_tokens PARAMS ((cpp_reader *, cpp_token *));
static int paste_tokens PARAMS ((cpp_reader *, cpp_token *, cpp_token *));
static int funlike_invocation_p PARAMS ((cpp_reader *, const cpp_hashnode *,
struct toklist *));
static void replace_args PARAMS ((cpp_reader *, cpp_macro *, macro_arg *,
struct toklist *));
/* Lookaheads. */
static void save_lookahead_token PARAMS ((cpp_reader *, const cpp_token *));
static void take_lookahead_token PARAMS ((cpp_reader *, cpp_token *));
static cpp_lookahead *alloc_lookahead PARAMS ((cpp_reader *));
static void free_lookahead PARAMS ((cpp_lookahead *));
/* #define directive parsing and handling. */
static cpp_token *lex_expansion_token PARAMS ((cpp_reader *, cpp_macro *));
static int warn_of_redefinition PARAMS ((cpp_reader *, const cpp_hashnode *,
const cpp_macro *));
static int save_parameter PARAMS ((cpp_reader *, cpp_macro *, cpp_hashnode *));
static int parse_params PARAMS ((cpp_reader *, cpp_macro *));
static void check_trad_stringification PARAMS ((cpp_reader *,
const cpp_macro *,
const cpp_string *));
/* Allocates a buffer to hold a token's TEXT, and converts TOKEN to a
CPP_STRING token containing TEXT in quoted form. */
static void
make_string_token (pool, token, text, len)
cpp_pool *pool;
cpp_token *token;
const U_CHAR *text;
unsigned int len;
{
U_CHAR *buf = _cpp_pool_alloc (pool, len * 4 + 1);
token->type = CPP_STRING;
token->val.str.text = buf;
token->val.str.len = quote_string (buf, text, len) - buf;
buf[token->val.str.len] = '\0';
token->flags = 0;
}
/* Allocates and converts a temporary token to a CPP_NUMBER token,
evaluating to NUMBER. */
static void
make_number_token (pfile, token, number)
cpp_reader *pfile;
cpp_token *token;
int number;
{
unsigned char *buf = _cpp_pool_alloc (&pfile->ident_pool, 20);
sprintf ((char *) buf, "%d", number);
token->type = CPP_NUMBER;
token->val.str.text = buf;
token->val.str.len = ustrlen (buf);
token->flags = 0;
}
static const char * const monthnames[] =
{
"Jan", "Feb", "Mar", "Apr", "May", "Jun",
"Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
};
/* Handle builtin macros like __FILE__. */
static void
builtin_macro (pfile, token)
cpp_reader *pfile;
cpp_token *token;
{
unsigned char flags = ((token->flags & PREV_WHITE) | AVOID_LPASTE);
cpp_hashnode *node = token->val.node;
switch (node->value.builtin)
{
case BT_FILE:
case BT_BASE_FILE:
{
const char *name;
cpp_buffer *buffer = pfile->buffer;
if (node->value.builtin == BT_BASE_FILE)
while (buffer->prev)
buffer = buffer->prev;
name = buffer->nominal_fname;
make_string_token (&pfile->ident_pool, token,
(const unsigned char *) name, strlen (name));
}
break;
case BT_INCLUDE_LEVEL:
/* pfile->include_depth counts the primary source as level 1,
but historically __INCLUDE_DEPTH__ has called the primary
source level 0. */
make_number_token (pfile, token, pfile->include_depth - 1);
break;
case BT_SPECLINE:
/* If __LINE__ is embedded in a macro, it must expand to the
line of the macro's invocation, not its definition.
Otherwise things like assert() will not work properly. */
make_number_token (pfile, token, cpp_get_line (pfile)->line);
break;
case BT_STDC:
{
int stdc = (!CPP_IN_SYSTEM_HEADER (pfile)
|| pfile->spec_nodes.n__STRICT_ANSI__->type != NT_VOID);
make_number_token (pfile, token, stdc);
}
break;
case BT_DATE:
case BT_TIME:
if (pfile->date.type == CPP_EOF)
{
/* Allocate __DATE__ and __TIME__ from permanent storage,
and save them in pfile so we don't have to do this again.
We don't generate these strings at init time because
time() and localtime() are very slow on some systems. */
time_t tt = time (NULL);
struct tm *tb = localtime (&tt);
make_string_token (&pfile->ident_pool, &pfile->date,
DSC("Oct 11 1347"));
make_string_token (&pfile->ident_pool, &pfile->time,
DSC("12:34:56"));
sprintf ((char *) pfile->date.val.str.text, "%s %2d %4d",
monthnames[tb->tm_mon], tb->tm_mday, tb->tm_year + 1900);
sprintf ((char *) pfile->time.val.str.text, "%02d:%02d:%02d",
tb->tm_hour, tb->tm_min, tb->tm_sec);
}
*token = node->value.builtin == BT_DATE ? pfile->date: pfile->time;
break;
default:
cpp_ice (pfile, "invalid builtin macro \"%s\"", NODE_NAME (node));
break;
}
token->flags = flags;
}
/* Used by cpperror.c to obtain the correct line and column to report
in a diagnostic. */
const cpp_lexer_pos *
cpp_get_line (pfile)
cpp_reader *pfile;
{
return &pfile->lexer_pos;
}
static void
lock_pools (pfile)
cpp_reader *pfile;
{
_cpp_lock_pool (&pfile->argument_pool);
}
static void
unlock_pools (pfile)
cpp_reader *pfile;
{
_cpp_unlock_pool (&pfile->argument_pool);
}
/* Adds backslashes before all backslashes and double quotes appearing
in strings. Non-printable characters are converted to octal. */
static U_CHAR *
quote_string (dest, src, len)
U_CHAR *dest;
const U_CHAR *src;
unsigned int len;
{
while (len--)
{
U_CHAR c = *src++;
if (c == '\\' || c == '"')
{
*dest++ = '\\';
*dest++ = c;
}
else
{
if (ISPRINT (c))
*dest++ = c;
else
{
sprintf ((char *) dest, "\\%03o", c);
dest += 4;
}
}
}
return dest;
}
/* Convert a token sequence to a single string token according to the
rules of the ISO C #-operator. */
static void
stringify_arg (pfile, arg)
cpp_reader *pfile;
macro_arg *arg;
{
cpp_pool *pool = &pfile->ident_pool;
unsigned char *start = POOL_FRONT (pool);
unsigned int i, escape_it, total_len = 0, backslash_count = 0;
/* Loop, reading in the argument's tokens. */
for (i = 0; i < arg->count; i++)
{
unsigned char *dest;
const cpp_token *token = &arg->first[i];
unsigned int len = cpp_token_len (token);
escape_it = (token->type == CPP_STRING || token->type == CPP_WSTRING
|| token->type == CPP_CHAR || token->type == CPP_WCHAR);
if (escape_it)
/* Worst case is each char is octal. */
len *= 4;
len += 2; /* Room for initial space and final NUL. */
dest = &start[total_len];
if (dest + len > POOL_LIMIT (pool))
{
_cpp_next_chunk (pool, len, (unsigned char **) &start);
dest = &start[total_len];
}
/* No leading white space. */
if (token->flags & PREV_WHITE && total_len > 0)
*dest++ = ' ';
if (escape_it)
{
unsigned char *buf = (unsigned char *) xmalloc (len);
len = cpp_spell_token (pfile, token, buf) - buf;
dest = quote_string (dest, buf, len);
free (buf);
}
else
dest = cpp_spell_token (pfile, token, dest);
total_len = dest - start;
if (token->type == CPP_OTHER && token->val.c == '\\')
backslash_count++;
else
backslash_count = 0;
}
/* Ignore the final \ of invalid string literals. */
if (backslash_count & 1)
{
cpp_warning (pfile, "invalid string literal, ignoring final '\\'");
total_len--;
}
/* Null terminate, and commit the memory. */
start[total_len] = '\0';
POOL_COMMIT (pool, total_len + 1);
arg->stringified = xnew (cpp_token);
arg->stringified->flags = 0;
arg->stringified->type = CPP_STRING;
arg->stringified->val.str.text = start;
arg->stringified->val.str.len = total_len;
}
/* Try to paste two tokens. On success, the LHS becomes the pasted
token, and 0 is returned. For failure, we update the flags of the
RHS appropriately and return non-zero. */
static int
paste_tokens (pfile, lhs, rhs)
cpp_reader *pfile;
cpp_token *lhs, *rhs;
{
unsigned char flags;
int digraph = 0;
enum cpp_ttype type;
type = cpp_can_paste (pfile, lhs, rhs, &digraph);
if (type == CPP_EOF)
{
/* Mandatory warning for all apart from assembler. */
if (CPP_OPTION (pfile, lang) != CLK_ASM)
cpp_warning (pfile,
"pasting \"%s\" and \"%s\" does not give a valid preprocessing token",
cpp_token_as_text (pfile, lhs),
cpp_token_as_text (pfile, rhs));
/* The standard states that behaviour is undefined. By the
principle of least surpise, we step back before the RHS, and
mark it to prevent macro expansion. Tests in the testsuite
rely on clearing PREV_WHITE here, though you could argue we
should actually set it. Assembler can have '.' in labels and
so requires that we don't insert spaces there. Maybe we should
change this to put out a space unless it's assembler. */
rhs->flags &= ~PREV_WHITE;
rhs->flags |= NO_EXPAND;
return 1;
}
flags = lhs->flags & ~DIGRAPH;
if (digraph)
flags |= DIGRAPH;
/* Identifiers and numbers need spellings to be pasted. */
if (type == CPP_NAME || type == CPP_NUMBER)
{
unsigned int total_len = cpp_token_len (lhs) + cpp_token_len (rhs);
unsigned char *result, *end;
result = _cpp_pool_alloc (&pfile->ident_pool, total_len + 1);
/* Paste the spellings and null terminate. */
end = cpp_spell_token (pfile, rhs, cpp_spell_token (pfile, lhs, result));
*end = '\0';
total_len = end - result;
if (type == CPP_NAME)
{
lhs->val.node = cpp_lookup (pfile, result, total_len);
if (lhs->val.node->flags & NODE_OPERATOR)
{
flags |= NAMED_OP;
lhs->type = lhs->val.node->value.operator;
}
}
else
{
lhs->val.str.text = result;
lhs->val.str.len = total_len;
}
}
else if (type == CPP_WCHAR || type == CPP_WSTRING)
lhs->val.str = rhs->val.str;
/* Set type and flags after pasting spellings. */
lhs->type = type;
lhs->flags = flags;
return 0;
}
/* Handles an arbitrarily long sequence of ## operators. This
implementation is left-associative, non-recursive, and finishes a
paste before handling succeeding ones. If the paste fails, we back
up a token to just after the ## operator, with the effect that it
appears in the output stream normally. */
static void
paste_all_tokens (pfile, lhs)
cpp_reader *pfile;
cpp_token *lhs;
{
cpp_token *rhs;
unsigned char orig_flags = lhs->flags;
do
{
/* Take the token directly from the current context. We can do
this, because we are in the replacement list of either an
object-like macro, or a function-like macro with arguments
inserted. In either case, the constraints to #define
guarantee we have at least one more token. */
rhs = pfile->context->list.first++;
if (paste_tokens (pfile, lhs, rhs))
{
/* We failed. Step back so we read the RHS in next. */
pfile->context->list.first--;
break;
}
}
while (rhs->flags & PASTE_LEFT);
/* The pasted token has the PREV_WHITE flag of the LHS, is no longer
PASTE_LEFT, and is subject to macro expansion. */
lhs->flags &= ~(PREV_WHITE | PASTE_LEFT | NO_EXPAND);
lhs->flags |= orig_flags & (PREV_WHITE | AVOID_LPASTE);
}
/* Reads the unexpanded tokens of a macro argument into ARG. VAR_ARGS
is non-zero if this is a variadic macro. Returns the type of the
token that caused reading to finish. */
static enum cpp_ttype
parse_arg (pfile, arg, variadic)
cpp_reader *pfile;
struct macro_arg *arg;
int variadic;
{
enum cpp_ttype result;
unsigned int paren = 0;
unsigned int line;
arg->first = (cpp_token *) POOL_FRONT (&pfile->argument_pool);
for (;; arg->count++)
{
cpp_token *token = &arg->first[arg->count];
if ((unsigned char *) (token + 1) >= POOL_LIMIT (&pfile->argument_pool))
{
_cpp_next_chunk (&pfile->argument_pool, sizeof (cpp_token),
(unsigned char **) &arg->first);
token = &arg->first[arg->count];
}
/* Newlines in arguments are white space (6.10.3.10). */
line = pfile->lexer_pos.output_line;
cpp_get_token (pfile, token);
if (line != pfile->lexer_pos.output_line)
token->flags |= PREV_WHITE;
result = token->type;
if (result == CPP_OPEN_PAREN)
paren++;
else if (result == CPP_CLOSE_PAREN && paren-- == 0)
break;
/* Commas are not terminators within parantheses or variadic. */
else if (result == CPP_COMMA && paren == 0 && !variadic)
break;
else if (result == CPP_EOF)
break; /* Error reported by caller. */
}
/* Commit the memory used to store the arguments. */
POOL_COMMIT (&pfile->argument_pool, arg->count * sizeof (cpp_token));
return result;
}
/* Parse the arguments making up a macro invocation. */
static macro_arg *
parse_args (pfile, node)
cpp_reader *pfile;
const cpp_hashnode *node;
{
cpp_macro *macro = node->value.macro;
macro_arg *args, *cur;
enum cpp_ttype type;
int argc, error = 0;
/* Allocate room for at least one argument, and zero it out. */
argc = macro->paramc ? macro->paramc: 1;
args = xcnewvec (macro_arg, argc);
for (cur = args, argc = 0; ;)
{
argc++;
type = parse_arg (pfile, cur, argc == macro->paramc && macro->variadic);
if (type == CPP_CLOSE_PAREN || type == CPP_EOF)
break;
/* Re-use the last argument for excess arguments. */
if (argc < macro->paramc)
cur++;
}
if (type == CPP_EOF)
{
cpp_error (pfile, "unterminated argument list invoking macro \"%s\"",
NODE_NAME (node));
error = 1;
}
else if (argc < macro->paramc)
{
/* As an extension, a rest argument is allowed to not appear in
the invocation at all.
e.g. #define debug(format, args...) something
debug("string");
This is exactly the same as if there had been an empty rest
argument - debug("string", ). */
if (argc + 1 == macro->paramc && macro->variadic)
{
if (CPP_PEDANTIC (pfile) && ! macro->syshdr)
cpp_pedwarn (pfile, "ISO C99 requires rest arguments to be used");
}
else
{
cpp_error (pfile,
"macro \"%s\" requires %u arguments, but only %u given",
NODE_NAME (node), macro->paramc, argc);
error = 1;
}
}
else if (argc > macro->paramc)
{
/* Empty argument to a macro taking no arguments is OK. */
if (argc != 1 || cur->count)
{
cpp_error (pfile,
"macro \"%s\" passed %u arguments, but takes just %u",
NODE_NAME (node), argc, macro->paramc);
error = 1;
}
}
if (error)
{
free (args);
args = 0;
}
return args;
}
static int
funlike_invocation_p (pfile, node, list)
cpp_reader *pfile;
const cpp_hashnode *node;
struct toklist *list;
{
cpp_context *orig;
cpp_token maybe_paren;
macro_arg *args = 0;
cpp_lexer_pos macro_pos;
macro_pos = pfile->lexer_pos;
pfile->state.parsing_args = 1;
pfile->state.prevent_expansion++;
orig = pfile->context;
cpp_start_lookahead (pfile);
cpp_get_token (pfile, &maybe_paren);
cpp_stop_lookahead (pfile, maybe_paren.type == CPP_OPEN_PAREN);
pfile->state.parsing_args = 2;
if (maybe_paren.type == CPP_OPEN_PAREN)
args = parse_args (pfile, node);
else if (CPP_WTRADITIONAL (pfile) && ! node->value.macro->syshdr)
cpp_warning (pfile,
"function-like macro \"%s\" must be used with arguments in traditional C",
NODE_NAME (node));
/* Restore original context. */
pfile->context = orig;
pfile->state.prevent_expansion--;
pfile->state.parsing_args = 0;
/* Reset the position in case of failure. If success, the macro's
expansion appears where the name would have. */
pfile->lexer_pos = macro_pos;
if (args)
{
if (node->value.macro->paramc > 0)
{
/* Don't save tokens during pre-expansion. */
struct cpp_lookahead *la_saved = pfile->la_write;
pfile->la_write = 0;
replace_args (pfile, node->value.macro, args, list);
pfile->la_write = la_saved;
}
free (args);
}
return args != 0;
}
/* Push the context of a macro onto the context stack. TOKEN is the
macro name. If we can successfully start expanding the macro,
TOKEN is replaced with the first token of the expansion, and we
return non-zero. */
static int
enter_macro_context (pfile, node)
cpp_reader *pfile;
cpp_hashnode *node;
{
cpp_context *context;
cpp_macro *macro = node->value.macro;
struct toklist list;
/* Save the position of the outermost macro invocation. */
if (!pfile->context->prev)
lock_pools (pfile);
if (macro->fun_like && !funlike_invocation_p (pfile, node, &list))
{
if (!pfile->context->prev)
unlock_pools (pfile);
return 0;
}
if (macro->paramc == 0)
{
list.first = macro->expansion;
list.limit = macro->expansion + macro->count;
}
/* Only push a macro context for non-empty replacement lists. */
if (list.first != list.limit)
{
context = next_context (pfile);
context->list = list;
context->macro = macro;
/* Disable the macro within its expansion. */
macro->disabled = 1;
}
return 1;
}
/* Move to the next context. Create one if there is none. */
static cpp_context *
next_context (pfile)
cpp_reader *pfile;
{
cpp_context *prev = pfile->context;
cpp_context *result = prev->next;
if (result == 0)
{
result = xnew (cpp_context);
prev->next = result;
result->prev = prev;
result->next = 0;
}
pfile->context = result;
return result;
}
static void
replace_args (pfile, macro, args, list)
cpp_reader *pfile;
cpp_macro *macro;
macro_arg *args;
struct toklist *list;
{
unsigned char flags = 0;
unsigned int i, total;
const cpp_token *src, *limit;
cpp_token *dest;
macro_arg *arg;
src = macro->expansion;
limit = src + macro->count;
/* First, fully macro-expand arguments, calculating the number of
tokens in the final expansion as we go. This ensures that the
possible recursive use of argument_pool is fine. */
total = limit - src;
for (; src < limit; src++)
if (src->type == CPP_MACRO_ARG)
{
/* We have an argument. If it is not being stringified or
pasted it is macro-replaced before insertion. */
arg = &args[src->val.arg_no - 1];
if (src->flags & STRINGIFY_ARG)
{
if (!arg->stringified)
stringify_arg (pfile, arg);
}
else if ((src->flags & PASTE_LEFT)
|| (src > macro->expansion && (src[-1].flags & PASTE_LEFT)))
total += arg->count - 1;
else
{
if (!arg->expanded)
{
arg->expanded_count = 0;
if (arg->count)
expand_arg (pfile, arg);
}
total += arg->expanded_count - 1;
}
}
dest = (cpp_token *) _cpp_pool_alloc (&pfile->argument_pool,
total * sizeof (cpp_token));
list->first = dest;
for (src = macro->expansion; src < limit; src++)
if (src->type == CPP_MACRO_ARG)
{
unsigned int count;
const cpp_token *from;
arg = &args[src->val.arg_no - 1];
if (src->flags & STRINGIFY_ARG)
{
from = arg->stringified, count = 1;
/* Ugh. Maintain position of original argument. */
arg->stringified->line = src->line;
arg->stringified->col = src->col;
}
else if (src->flags & PASTE_LEFT)
count = arg->count, from = arg->first;
else if (src > macro->expansion && (src[-1].flags & PASTE_LEFT))
{
count = arg->count, from = arg->first;
if (dest != list->first)
{
/* GCC has special semantics for , ## b where b is a
varargs parameter: the comma disappears if b was
given no actual arguments (not merely if b is an
empty argument); otherwise pasting is turned off. */
if (dest[-1].type == CPP_COMMA
&& macro->variadic
&& src->val.arg_no == macro->paramc)
{
if (count == 0)
dest--;
else
dest[-1].flags &= ~PASTE_LEFT;
}
/* Count == 0 is the RHS a placemarker case. */
else if (count == 0)
dest[-1].flags &= ~PASTE_LEFT;
}
}
else
count = arg->expanded_count, from = arg->expanded;
/* Count == 0 is the LHS a placemarker case. */
if (count)
{
memcpy (dest, from, count * sizeof (cpp_token));
/* The first token gets PREV_WHITE of the CPP_MACRO_ARG. */
dest->flags &= ~PREV_WHITE;
dest->flags |= src->flags & PREV_WHITE;
dest->flags |= AVOID_LPASTE;
/* The last token gets the PASTE_LEFT of the CPP_MACRO_ARG. */
dest[count - 1].flags |= src->flags & PASTE_LEFT;
dest += count;
}
/* The token after the argument must avoid an accidental paste. */
flags = AVOID_LPASTE;
}
else
{
*dest = *src;
dest->flags |= flags;
dest++;
flags = 0;
}
list->limit = dest;
/* Free the expanded arguments. */
for (i = 0; i < macro->paramc; i++)
{
if (args[i].expanded)
free (args[i].expanded);
if (args[i].stringified)
free (args[i].stringified);
}
}
/* Subroutine of expand_arg to put the unexpanded tokens on the
context stack. */
static cpp_context *
push_arg_context (pfile, arg)
cpp_reader *pfile;
macro_arg *arg;
{
cpp_context *context = next_context (pfile);
context->macro = 0;
context->list.first = arg->first;
context->list.limit = arg->first + arg->count;
return context;
}
static void
expand_arg (pfile, arg)
cpp_reader *pfile;
macro_arg *arg;
{
cpp_token *token;
unsigned int capacity = 256;
/* Loop, reading in the arguments. */
arg->expanded = (cpp_token *) xmalloc (capacity * sizeof (cpp_token));
push_arg_context (pfile, arg);
do
{
if (arg->expanded_count >= capacity)
{
capacity *= 2;
arg->expanded = (cpp_token *)
xrealloc (arg->expanded, capacity * sizeof (cpp_token));
}
token = &arg->expanded[arg->expanded_count++];
cpp_get_token (pfile, token);
}
while (token->type != CPP_EOF);
arg->expanded_count--;
/* Pop the context we pushed. */
pfile->context = pfile->context->prev;
}
void
_cpp_pop_context (pfile)
cpp_reader *pfile;
{
cpp_context *context = pfile->context;
pfile->context = context->prev;
if (!pfile->context->prev && !pfile->state.parsing_args)
unlock_pools (pfile);
/* Re-enable a macro, temporarily if parsing_args, when leaving its
expansion. */
context->macro->disabled = 0;
}
/* Eternal routine to get a token. Also used nearly everywhere
internally, except for places where we know we can safely call
the lexer directly, such as lexing a directive name.
Macro expansions and directives are transparently handled,
including entering included files. Thus tokens are post-macro
expansion, and after any intervening directives. External callers
see CPP_EOF only at EOF. Internal callers also see it when meeting
a directive inside a macro call, when at the end of a directive and
state.in_directive is still 1, and at the end of argument
pre-expansion. */
void
cpp_get_token (pfile, token)
cpp_reader *pfile;
cpp_token *token;
{
for (;;)
{
cpp_context *context = pfile->context;
if (pfile->la_read)
take_lookahead_token (pfile, token);
/* Context->prev == 0 <=> base context. */
else if (!context->prev)
_cpp_lex_token (pfile, token);
else if (context->list.first != context->list.limit)
{
*token = *context->list.first++;
token->flags |= pfile->buffer->saved_flags;
pfile->buffer->saved_flags = 0;
/* PASTE_LEFT tokens can only appear in macro expansions. */
if (token->flags & PASTE_LEFT)
{
/* Maintains position of original token. */
paste_all_tokens (pfile, token);
pfile->buffer->saved_flags = AVOID_LPASTE;
}
}
else
{
if (context->macro)
{
/* Avoid accidental paste at the end of a macro. */
pfile->buffer->saved_flags |= AVOID_LPASTE;
_cpp_pop_context (pfile);
continue;
}
/* End of argument pre-expansion. */
token->type = CPP_EOF;
token->flags = 0;
return;
}
if (token->type != CPP_NAME)
break;
/* Handle macros and the _Pragma operator. */
if (token->val.node->type == NT_MACRO
&& !pfile->state.prevent_expansion
&& !(token->flags & NO_EXPAND))
{
cpp_hashnode *node = token->val.node;
/* Macros invalidate controlling macros. */
pfile->mi_valid = false;
if (node->flags & NODE_BUILTIN)
{
/* Maintains position of original token. */
builtin_macro (pfile, token);
pfile->buffer->saved_flags = AVOID_LPASTE;
break;
}
if (node->value.macro->disabled)
token->flags |= NO_EXPAND;
else if (enter_macro_context (pfile, node))
{
/* Pass AVOID_LPASTE and our PREV_WHITE to next token. */
pfile->buffer->saved_flags = ((token->flags & PREV_WHITE)
| AVOID_LPASTE);
continue;
}
}
/* Don't interpret _Pragma within directives. The standard is
not clear on this, but to me this makes most sense. */
if (token->val.node != pfile->spec_nodes.n__Pragma
|| pfile->state.in_directive)
break;
/* Handle it, and loop back for another token. MI is cleared
since this token came from either the lexer or a macro. */
_cpp_do__Pragma (pfile);
}
if (pfile->la_write)
save_lookahead_token (pfile, token);
}
/* Returns true if we're expanding an object-like macro that was
defined in a system header. Just checks the macro at the top of
the stack. Used for diagnostic suppression. */
int
cpp_sys_macro_p (pfile)
cpp_reader *pfile;
{
cpp_macro *macro = pfile->context->macro;
return macro && macro->syshdr;
}
/* Read each token in, until EOF. Directives are transparently
processed. */
void
cpp_scan_nooutput (pfile)
cpp_reader *pfile;
{
cpp_token token;
do
cpp_get_token (pfile, &token);
while (token.type != CPP_EOF);
}
/* Lookahead handling. */
static void
save_lookahead_token (pfile, token)
cpp_reader *pfile;
const cpp_token *token;
{
if (token->type != CPP_EOF)
{
cpp_lookahead *la = pfile->la_write;
cpp_token_with_pos *twp;
if (la->count == la->cap)
{
la->cap += la->cap + 8;
la->tokens = (cpp_token_with_pos *)
xrealloc (la->tokens, la->cap * sizeof (cpp_token_with_pos));
}
twp = &la->tokens[la->count++];
twp->token = *token;
twp->pos = *cpp_get_line (pfile);
}
}
static void
take_lookahead_token (pfile, token)
cpp_reader *pfile;
cpp_token *token;
{
cpp_lookahead *la = pfile->la_read;
cpp_token_with_pos *twp = &la->tokens[la->cur];
*token = twp->token;
pfile->lexer_pos = twp->pos;
if (++la->cur == la->count)
_cpp_release_lookahead (pfile);
}
/* Moves the lookahead at the front of the read list to the free store. */
void
_cpp_release_lookahead (pfile)
cpp_reader *pfile;
{
cpp_lookahead *la = pfile->la_read;
pfile->la_read = la->next;
la->next = pfile->la_unused;
pfile->la_unused = la;
unlock_pools (pfile);
}
/* Take a new lookahead from the free store, or allocate one if none. */
static cpp_lookahead *
alloc_lookahead (pfile)
cpp_reader *pfile;
{
cpp_lookahead *la = pfile->la_unused;
if (la)
pfile->la_unused = la->next;
else
{
la = xnew (cpp_lookahead);
la->tokens = 0;
la->cap = 0;
}
la->cur = la->count = 0;
return la;
}
/* Free memory associated with a lookahead list. */
static void
free_lookahead (la)
cpp_lookahead *la;
{
if (la->tokens)
free ((PTR) la->tokens);
free ((PTR) la);
}
/* Free all the lookaheads of a cpp_reader. */
void
_cpp_free_lookaheads (pfile)
cpp_reader *pfile;
{
cpp_lookahead *la, *lan;
if (pfile->la_read)
free_lookahead (pfile->la_read);
if (pfile->la_write)
free_lookahead (pfile->la_write);
for (la = pfile->la_unused; la; la = lan)
{
lan = la->next;
free_lookahead (la);
}
}
/* Allocate a lookahead and move it to the front of the write list. */
void
cpp_start_lookahead (pfile)
cpp_reader *pfile;
{
cpp_lookahead *la = alloc_lookahead (pfile);
la->next = pfile->la_write;
pfile->la_write = la;
la->pos = *cpp_get_line (pfile);
/* Don't allow memory pools to be re-used whilst we're reading ahead. */
lock_pools (pfile);
}
/* Stop reading ahead - either step back, or drop the read ahead. */
void
cpp_stop_lookahead (pfile, drop)
cpp_reader *pfile;
int drop;
{
cpp_lookahead *la = pfile->la_write;
pfile->la_write = la->next;
la->next = pfile->la_read;
pfile->la_read = la;
if (drop || la->count == 0)
_cpp_release_lookahead (pfile);
else
pfile->lexer_pos = la->pos;
}
/* Push a single token back to the front of the queue. Only to be
used by cpplib, and only then when necessary. POS is the position
to report for the preceding token. */
void
_cpp_push_token (pfile, token, pos)
cpp_reader *pfile;
const cpp_token *token;
const cpp_lexer_pos *pos;
{
cpp_start_lookahead (pfile);
save_lookahead_token (pfile, token);
cpp_stop_lookahead (pfile, 0);
pfile->lexer_pos = *pos;
}
/* #define directive parsing and handling. */
/* Returns non-zero if a macro redefinition warning is required. */
static int
warn_of_redefinition (pfile, node, macro2)
cpp_reader *pfile;
const cpp_hashnode *node;
const cpp_macro *macro2;
{
const cpp_macro *macro1;
unsigned int i;
/* Some redefinitions need to be warned about regardless. */
if (node->flags & NODE_WARN)
return 1;
if (! CPP_PEDANTIC (pfile))
return 0;
/* Redefinition of a macro is allowed if and only if the old and new
definitions are the same. (6.10.3 paragraph 2). */
macro1 = node->value.macro;
/* The quick failures. */
if (macro1->count != macro2->count
|| macro1->paramc != macro2->paramc
|| macro1->fun_like != macro2->fun_like
|| macro1->variadic != macro2->variadic)
return 1;
/* Check each token. */
for (i = 0; i < macro1->count; i++)
if (! _cpp_equiv_tokens (¯o1->expansion[i], ¯o2->expansion[i]))
return 1;
/* Check parameter spellings. */
for (i = 0; i < macro1->paramc; i++)
if (macro1->params[i] != macro2->params[i])
return 1;
return 0;
}
/* Free the definition of hashnode H. */
void
_cpp_free_definition (h)
cpp_hashnode *h;
{
/* Macros and assertions no longer have anything to free. */
h->type = NT_VOID;
/* Clear builtin flag in case of redefinition. */
h->flags &= ~NODE_BUILTIN;
}
static int
save_parameter (pfile, macro, node)
cpp_reader *pfile;
cpp_macro *macro;
cpp_hashnode *node;
{
cpp_hashnode **dest;
/* Constraint 6.10.3.6 - duplicate parameter names. */
if (node->arg_index)
{
cpp_error (pfile, "duplicate macro parameter \"%s\"", NODE_NAME (node));
return 1;
}
dest = ¯o->params[macro->paramc];
/* Check we have room for the parameters. */
if ((unsigned char *) (dest + 1) >= POOL_LIMIT (&pfile->macro_pool))
{
_cpp_next_chunk (&pfile->macro_pool, sizeof (cpp_hashnode *),
(unsigned char **) ¯o->params);
dest = ¯o->params[macro->paramc];
}
*dest = node;
node->arg_index = ++macro->paramc;
return 0;
}
static int
parse_params (pfile, macro)
cpp_reader *pfile;
cpp_macro *macro;
{
cpp_token token;
unsigned int prev_ident = 0;
macro->params = (cpp_hashnode **) POOL_FRONT (&pfile->macro_pool);
for (;;)
{
_cpp_lex_token (pfile, &token);
switch (token.type)
{
default:
cpp_error (pfile, "\"%s\" may not appear in macro parameter list",
cpp_token_as_text (pfile, &token));
return 0;
case CPP_NAME:
if (prev_ident)
{
cpp_error (pfile, "macro parameters must be comma-separated");
return 0;
}
prev_ident = 1;
if (save_parameter (pfile, macro, token.val.node))
return 0;
continue;
case CPP_CLOSE_PAREN:
if (prev_ident || macro->paramc == 0)
break;
/* Fall through to pick up the error. */
case CPP_COMMA:
if (!prev_ident)
{
cpp_error (pfile, "parameter name missing");
return 0;
}
prev_ident = 0;
continue;
case CPP_ELLIPSIS:
macro->variadic = 1;
if (!prev_ident)
{
save_parameter (pfile, macro, pfile->spec_nodes.n__VA_ARGS__);
pfile->state.va_args_ok = 1;
if (! CPP_OPTION (pfile, c99) && CPP_OPTION (pfile, pedantic))
cpp_pedwarn (pfile,
"anonymous variadic macros were introduced in C99");
}
else if (CPP_OPTION (pfile, pedantic))
cpp_pedwarn (pfile, "ISO C does not permit named variadic macros");
/* We're at the end, and just expect a closing parenthesis. */
_cpp_lex_token (pfile, &token);
if (token.type == CPP_CLOSE_PAREN)
break;
/* Fall through. */
case CPP_EOF:
cpp_error (pfile, "missing ')' in macro parameter list");
return 0;
}
/* Success. Commit the parameter array. */
POOL_COMMIT (&pfile->macro_pool,
macro->paramc * sizeof (cpp_hashnode *));
return 1;
}
}
/* Lex a token from a macro's replacement list. Translate it to a
CPP_MACRO_ARG if appropriate. */
static cpp_token *
lex_expansion_token (pfile, macro)
cpp_reader *pfile;
cpp_macro *macro;
{
cpp_token *token = ¯o->expansion[macro->count];
/* Check we have room for the token. */
if ((unsigned char *) (token + 1) >= POOL_LIMIT (&pfile->macro_pool))
{
_cpp_next_chunk (&pfile->macro_pool, sizeof (cpp_token),
(unsigned char **) ¯o->expansion);
token = ¯o->expansion[macro->count];
}
macro->count++;
_cpp_lex_token (pfile, token);
/* Is this an argument? */
if (token->type == CPP_NAME && token->val.node->arg_index)
{
token->type = CPP_MACRO_ARG;
token->val.arg_no = token->val.node->arg_index;
}
else if (CPP_WTRADITIONAL (pfile) && macro->paramc > 0
&& (token->type == CPP_STRING || token->type == CPP_CHAR))
check_trad_stringification (pfile, macro, &token->val.str);
return token;
}
/* Parse a macro and save its expansion. Returns non-zero on success. */
int
_cpp_create_definition (pfile, node)
cpp_reader *pfile;
cpp_hashnode *node;
{
cpp_macro *macro;
cpp_token *token;
unsigned int i, ok = 1;
macro = (cpp_macro *) _cpp_pool_alloc (&pfile->macro_pool,
sizeof (cpp_macro));
macro->file = pfile->buffer->nominal_fname;
macro->line = pfile->directive_pos.line;
macro->params = 0;
macro->paramc = 0;
macro->fun_like = 0;
macro->variadic = 0;
macro->count = 0;
macro->expansion = (cpp_token *) POOL_FRONT (&pfile->macro_pool);
/* Get the first token of the expansion (or the '(' of a
function-like macro). */
token = lex_expansion_token (pfile, macro);
if (token->type == CPP_OPEN_PAREN && !(token->flags & PREV_WHITE))
{
if (!(ok = parse_params (pfile, macro)))
goto cleanup;
macro->count = 0;
macro->fun_like = 1;
/* Some of the pool may have been used for the parameter store. */
macro->expansion = (cpp_token *) POOL_FRONT (&pfile->macro_pool);
token = lex_expansion_token (pfile, macro);
}
else if (token->type != CPP_EOF && !(token->flags & PREV_WHITE))
cpp_pedwarn (pfile, "ISO C requires whitespace after the macro name");
/* Setting it here means we don't catch leading comments. */
pfile->state.save_comments = ! CPP_OPTION (pfile, discard_comments);
for (;;)
{
/* Check the stringifying # constraint 6.10.3.2.1 of
function-like macros when lexing the subsequent token. */
if (macro->count > 1 && token[-1].type == CPP_HASH && macro->fun_like)
{
if (token->type == CPP_MACRO_ARG)
{
token->flags &= ~PREV_WHITE;
token->flags |= STRINGIFY_ARG;
token->flags |= token[-1].flags & PREV_WHITE;
token[-1] = token[0];
macro->count--;
}
/* Let assembler get away with murder. */
else if (CPP_OPTION (pfile, lang) != CLK_ASM)
{
ok = 0;
cpp_error (pfile, "'#' is not followed by a macro parameter");
goto cleanup;
}
}
if (token->type == CPP_EOF)
break;
/* Paste operator constraint 6.10.3.3.1. */
if (token->type == CPP_PASTE)
{
/* Token-paste ##, can appear in both object-like and
function-like macros, but not at the ends. */
if (--macro->count > 0)
token = lex_expansion_token (pfile, macro);
if (macro->count == 0 || token->type == CPP_EOF)
{
ok = 0;
cpp_error (pfile,
"'##' cannot appear at either end of a macro expansion");
goto cleanup;
}
token[-1].flags |= PASTE_LEFT;
/* Give it a PREV_WHITE for -dM etc. */
token->flags |= PREV_WHITE;
}
token = lex_expansion_token (pfile, macro);
}
/* Don't count the CPP_EOF. */
macro->count--;
/* Clear the whitespace flag from the leading token. */
macro->expansion[0].flags &= ~PREV_WHITE;
/* Implement the macro-defined-to-itself optimisation. */
macro->disabled = (macro->count == 1 && !macro->fun_like
&& macro->expansion[0].type == CPP_NAME
&& macro->expansion[0].val.node == node);
/* To suppress some diagnostics. */
macro->syshdr = pfile->buffer->sysp != 0;
/* Commit the memory. */
POOL_COMMIT (&pfile->macro_pool, macro->count * sizeof (cpp_token));
if (node->type != NT_VOID)
{
if (warn_of_redefinition (pfile, node, macro))
{
cpp_pedwarn_with_line (pfile, pfile->directive_pos.line,
pfile->directive_pos.col,
"\"%s\" redefined", NODE_NAME (node));
if (node->type == NT_MACRO && !(node->flags & NODE_BUILTIN))
cpp_pedwarn_with_file_and_line (pfile,
node->value.macro->file,
node->value.macro->line, 1,
"this is the location of the previous definition");
}
_cpp_free_definition (node);
}
/* Enter definition in hash table. */
node->type = NT_MACRO;
node->value.macro = macro;
if (! ustrncmp (NODE_NAME (node), DSC ("__STDC_")))
node->flags |= NODE_WARN;
cleanup:
/* Stop the lexer accepting __VA_ARGS__. */
pfile->state.va_args_ok = 0;
/* Clear the fast argument lookup indices. */
for (i = macro->paramc; i-- > 0; )
macro->params[i]->arg_index = 0;
return ok;
}
/* Warn if a token in `string' matches one of the function macro
arguments in `info'. This function assumes that the macro is a
function macro and not an object macro. */
static void
check_trad_stringification (pfile, macro, string)
cpp_reader *pfile;
const cpp_macro *macro;
const cpp_string *string;
{
unsigned int i, len;
const U_CHAR *p, *q, *limit = string->text + string->len;
/* Loop over the string. */
for (p = string->text; p < limit; p = q)
{
/* Find the start of an identifier. */
while (p < limit && !is_idstart (*p))
p++;
/* Find the end of the identifier. */
q = p;
while (q < limit && is_idchar (*q))
q++;
len = q - p;
/* Loop over the function macro arguments to see if the
identifier inside the string matches one of them. */
for (i = 0; i < macro->paramc; i++)
{
const cpp_hashnode *node = macro->params[i];
if (NODE_LEN (node) == len
&& !memcmp (p, NODE_NAME (node), len))
{
cpp_warning (pfile,
"macro argument \"%s\" would be stringified with -traditional.",
NODE_NAME (node));
break;
}
}
}
}
/* Returns the name, arguments and expansion of a macro, in a format
suitable to be read back in again, and therefore also for DWARF 2
debugging info. e.g. "PASTE(X, Y) X ## Y", or "MACNAME EXPANSION".
Caller is expected to generate the "#define" bit if needed. The
returned text is temporary, and automatically freed later. */
const unsigned char *
cpp_macro_definition (pfile, node)
cpp_reader *pfile;
const cpp_hashnode *node;
{
unsigned int i, len;
const cpp_macro *macro = node->value.macro;
unsigned char *buffer;
if (node->type != NT_MACRO || (node->flags & NODE_BUILTIN))
{
cpp_ice (pfile, "invalid hash type %d in cpp_macro_definition", node->type);
return 0;
}
/* Calculate length. */
len = NODE_LEN (node) + 1; /* ' ' */
if (macro->fun_like)
{
len += 3; /* "()" plus possible final "." of named
varargs (we have + 2 below). */
for (i = 0; i < macro->paramc; i++)
len += NODE_LEN (macro->params[i]) + 2; /* ", " */
}
for (i = 0; i < macro->count; i++)
{
cpp_token *token = ¯o->expansion[i];
if (token->type == CPP_MACRO_ARG)
len += NODE_LEN (macro->params[token->val.arg_no - 1]);
else
len += cpp_token_len (token); /* Includes room for ' '. */
if (token->flags & STRINGIFY_ARG)
len++; /* "#" */
if (token->flags & PASTE_LEFT)
len += 3; /* " ##" */
}
if (len > pfile->macro_buffer_len)
{
pfile->macro_buffer = (U_CHAR *) xrealloc (pfile->macro_buffer, len);
pfile->macro_buffer_len = len;
}
/* Fill in the buffer. Start with the macro name. */
buffer = pfile->macro_buffer;
memcpy (buffer, NODE_NAME (node), NODE_LEN (node));
buffer += NODE_LEN (node);
/* Parameter names. */
if (macro->fun_like)
{
*buffer++ = '(';
for (i = 0; i < macro->paramc; i++)
{
cpp_hashnode *param = macro->params[i];
if (param != pfile->spec_nodes.n__VA_ARGS__)
{
memcpy (buffer, NODE_NAME (param), NODE_LEN (param));
buffer += NODE_LEN (param);
}
if (i + 1 < macro->paramc)
*buffer++ = ',', *buffer++ = ' ';
else if (macro->variadic)
*buffer++ = '.', *buffer++ = '.', *buffer++ = '.';
}
*buffer++ = ')';
}
/* Expansion tokens. */
if (macro->count)
{
*buffer++ = ' ';
for (i = 0; i < macro->count; i++)
{
cpp_token *token = ¯o->expansion[i];
if (token->flags & PREV_WHITE)
*buffer++ = ' ';
if (token->flags & STRINGIFY_ARG)
*buffer++ = '#';
if (token->type == CPP_MACRO_ARG)
{
len = NODE_LEN (macro->params[token->val.arg_no - 1]);
memcpy (buffer,
NODE_NAME (macro->params[token->val.arg_no - 1]), len);
buffer += len;
}
else
buffer = cpp_spell_token (pfile, token, buffer);
if (token->flags & PASTE_LEFT)
{
*buffer++ = ' ';
*buffer++ = '#';
*buffer++ = '#';
/* Next has PREV_WHITE; see _cpp_create_definition. */
}
}
}
*buffer = '\0';
return pfile->macro_buffer;
}
|