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
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
|
/* Symbolic values.
Copyright (C) 2019-2024 Free Software Foundation, Inc.
Contributed by David Malcolm <dmalcolm@redhat.com>.
This file is part of GCC.
GCC 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 3, or (at your option)
any later version.
GCC 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 GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#define INCLUDE_MEMORY
#include "system.h"
#include "coretypes.h"
#include "tree.h"
#include "diagnostic-core.h"
#include "gimple-pretty-print.h"
#include "function.h"
#include "basic-block.h"
#include "gimple.h"
#include "gimple-iterator.h"
#include "diagnostic-core.h"
#include "graphviz.h"
#include "options.h"
#include "cgraph.h"
#include "tree-dfa.h"
#include "stringpool.h"
#include "convert.h"
#include "target.h"
#include "fold-const.h"
#include "tree-pretty-print.h"
#include "bitmap.h"
#include "analyzer/analyzer.h"
#include "analyzer/analyzer-logging.h"
#include "analyzer/call-string.h"
#include "analyzer/program-point.h"
#include "analyzer/store.h"
#include "analyzer/svalue.h"
#include "analyzer/region-model.h"
#include "diagnostic.h"
#include "tree-diagnostic.h"
#if ENABLE_ANALYZER
namespace ana {
static int cmp_csts_and_types (const_tree cst1, const_tree cst2);
/* class svalue and its various subclasses. */
/* class svalue. */
/* Dump a representation of this svalue to stderr. */
DEBUG_FUNCTION void
svalue::dump (bool simple) const
{
pretty_printer pp;
pp_format_decoder (&pp) = default_tree_printer;
pp_show_color (&pp) = pp_show_color (global_dc->printer);
pp.buffer->stream = stderr;
dump_to_pp (&pp, simple);
pp_newline (&pp);
pp_flush (&pp);
}
/* Generate a textual representation of this svalue for debugging purposes. */
label_text
svalue::get_desc (bool simple) const
{
pretty_printer pp;
pp_format_decoder (&pp) = default_tree_printer;
dump_to_pp (&pp, simple);
return label_text::take (xstrdup (pp_formatted_text (&pp)));
}
/* Return a new json::string describing the svalue. */
json::value *
svalue::to_json () const
{
label_text desc = get_desc (true);
json::value *sval_js = new json::string (desc.get ());
return sval_js;
}
/* Class for optionally adding open/close paren pairs within
svalue::maybe_print_for_user. */
class auto_add_parens
{
public:
auto_add_parens (pretty_printer *pp,
const svalue *outer_sval,
const svalue &inner_sval)
: m_pp (pp),
m_needs_parens (needs_parens_p (outer_sval, inner_sval))
{
if (m_needs_parens)
pp_string (m_pp, "(");
}
~auto_add_parens ()
{
if (m_needs_parens)
pp_string (m_pp, ")");
}
private:
static bool needs_parens_p (const svalue *outer_sval,
const svalue &inner_sval)
{
if (!outer_sval)
return false;
if (inner_sval.get_kind () == SK_BINOP)
return true;
return false;
}
pretty_printer *m_pp;
bool m_needs_parens;
};
/* Attempt to print a user-facing description of this svalue to PP,
using MODEL for extracting representative tree values if necessary.
Use OUTER_SVAL (which can be null) to determine if we need to wrap
this value in parentheses. */
bool
svalue::maybe_print_for_user (pretty_printer *pp,
const region_model &model,
const svalue *outer_sval) const
{
auto_add_parens p (pp, outer_sval, *this);
switch (get_kind ())
{
default:
break;
case SK_CONSTANT:
{
const constant_svalue *sval = (const constant_svalue *)this;
pp_printf (pp, "%E", sval->get_constant ());
return true;
}
case SK_INITIAL:
{
const initial_svalue *sval = (const initial_svalue *)this;
return sval->get_region ()->maybe_print_for_user (pp, model);
}
case SK_UNARYOP:
{
const unaryop_svalue *sval = (const unaryop_svalue *)this;
if (sval->get_op () == NOP_EXPR)
{
if (!sval->get_arg ()->maybe_print_for_user (pp, model, outer_sval))
return false;
return true;
}
}
break;
case SK_BINOP:
{
const binop_svalue *sval = (const binop_svalue *)this;
switch (sval->get_op ())
{
default:
break;
case PLUS_EXPR:
case MINUS_EXPR:
case MULT_EXPR:
{
if (!sval->get_arg0 ()->maybe_print_for_user (pp, model, this))
return false;
pp_printf (pp, " %s ", op_symbol_code (sval->get_op ()));
if (!sval->get_arg1 ()->maybe_print_for_user (pp, model, this))
return false;
return true;
}
}
}
break;
}
if (tree expr = model.get_representative_tree (this))
{
expr = remove_ssa_names (expr);
print_expr_for_user (pp, expr);
return true;
}
return false;
}
/* If this svalue is a constant_svalue, return the underlying tree constant.
Otherwise return NULL_TREE. */
tree
svalue::maybe_get_constant () const
{
const svalue *sval = unwrap_any_unmergeable ();
if (const constant_svalue *cst_sval = sval->dyn_cast_constant_svalue ())
return cst_sval->get_constant ();
else
return NULL_TREE;
}
/* If this svalue is a region_svalue, return the region it points to.
Otherwise return NULL. */
const region *
svalue::maybe_get_region () const
{
if (const region_svalue *region_sval = dyn_cast_region_svalue ())
return region_sval->get_pointee ();
else
return NULL;
}
/* If this svalue is a cast (i.e a unaryop NOP_EXPR or VIEW_CONVERT_EXPR),
return the underlying svalue.
Otherwise return NULL. */
const svalue *
svalue::maybe_undo_cast () const
{
if (const unaryop_svalue *unaryop_sval = dyn_cast_unaryop_svalue ())
{
enum tree_code op = unaryop_sval->get_op ();
if (op == NOP_EXPR || op == VIEW_CONVERT_EXPR)
return unaryop_sval->get_arg ();
}
return NULL;
}
/* If this svalue is an unmergeable decorator around another svalue, return
the underlying svalue.
Otherwise return this svalue. */
const svalue *
svalue::unwrap_any_unmergeable () const
{
if (const unmergeable_svalue *unmergeable = dyn_cast_unmergeable_svalue ())
return unmergeable->get_arg ();
return this;
}
/* Attempt to merge THIS with OTHER, returning the merged svalue.
Return NULL if not mergeable. */
const svalue *
svalue::can_merge_p (const svalue *other,
region_model_manager *mgr,
model_merger *merger) const
{
if (!(get_type () && other->get_type ()))
return NULL;
if (!types_compatible_p (get_type (), other->get_type ()))
return NULL;
/* Reject attempts to merge unmergeable svalues. */
if ((get_kind () == SK_UNMERGEABLE)
|| (other->get_kind () == SK_UNMERGEABLE))
return NULL;
/* Reject attempts to merge poisoned svalues with other svalues
(either non-poisoned, or other kinds of poison), so that e.g.
we identify paths in which a variable is conditionally uninitialized. */
if (get_kind () == SK_POISONED
|| other->get_kind () == SK_POISONED)
return NULL;
/* Reject attempts to merge NULL pointers with not-NULL-pointers. */
if (POINTER_TYPE_P (get_type ()))
{
bool null0 = false;
bool null1 = false;
if (tree cst0 = maybe_get_constant ())
if (zerop (cst0))
null0 = true;
if (tree cst1 = other->maybe_get_constant ())
if (zerop (cst1))
null1 = true;
if (null0 != null1)
return NULL;
}
/* Reject merging svalues that have non-purgable sm-state,
to avoid falsely reporting memory leaks by merging them
with something else. */
if (!merger->mergeable_svalue_p (this))
return NULL;
if (!merger->mergeable_svalue_p (other))
return NULL;
/* Widening. */
/* Merge: (new_cst, existing_cst) -> widen (existing, new). */
if (maybe_get_constant () && other->maybe_get_constant ())
{
return mgr->get_or_create_widening_svalue (other->get_type (),
merger->get_function_point (),
other, this);
}
/* Merger of:
this: BINOP (X, OP, CST)
other: X, where X is non-widening
to: WIDENING (other, this). */
if (const binop_svalue *binop_sval = dyn_cast_binop_svalue ())
if (binop_sval->get_arg0 () == other
&& binop_sval->get_arg1 ()->get_kind () == SK_CONSTANT
&& other->get_kind () != SK_WIDENING)
return mgr->get_or_create_widening_svalue (other->get_type (),
merger->get_function_point (),
other, this);
/* Merge: (Widen(existing_val, V), existing_val) -> Widen (existing_val, V)
and thus get a fixed point. */
if (const widening_svalue *widen_sval = dyn_cast_widening_svalue ())
{
if (other == widen_sval->get_base_svalue ())
return this;
if (other == widen_sval->get_iter_svalue ())
return this;
}
if (const binop_svalue *binop_sval = dyn_cast_binop_svalue ())
if (const widening_svalue *widen_arg0
= binop_sval->get_arg0 ()->dyn_cast_widening_svalue ())
{
if (other == binop_sval->get_arg1 ())
{
/* Merger of: (Widen(..., OTHER) BINOP X)
and : OTHER
to : (Widen(..., OTHER) BINOP X)
e.g. merge of Widen(0, 1) + 1 with 1 to the Widen(0, 1) + 1. */
return this;
}
/* Merger of : (Widen() BINOP X)
and : Widen()
to : Widen()
e.g. merge of Widen(0, 1) + 1 and Widen(0, 1) to Widen(0, 1).
However, we want to update constraints for this case, since we're
considering another iteration.
Presumably we also want to ensure that it converges; we don't want
a descending chain of constraints. */
if (other == widen_arg0)
{
merger->on_widening_reuse (widen_arg0);
return widen_arg0;
}
/* Merger of:
this: BINOP(WIDENING(BASE, BINOP(BASE, X)), X)
other: BINOP(BASE, X)
to: WIDENING(BASE, BINOP(BASE, X)). */
if (widen_arg0->get_iter_svalue () == other)
if (const binop_svalue *other_binop_sval
= other->dyn_cast_binop_svalue ())
if (other_binop_sval->get_arg0 () == widen_arg0->get_base_svalue ()
&& other_binop_sval->get_arg1 () == binop_sval->get_arg1 ())
return widen_arg0;
}
return mgr->get_or_create_unknown_svalue (get_type ());
}
/* Determine if this svalue is either within LIVE_SVALUES, or is implicitly
live with respect to LIVE_SVALUES and MODEL.
LIVE_SVALUES can be NULL, in which case determine if this svalue is
intrinsically live. */
bool
svalue::live_p (const svalue_set *live_svalues,
const region_model *model) const
{
/* Determine if SVAL is explicitly live. */
if (live_svalues)
if (const_cast<svalue_set *> (live_svalues)->contains (this))
return true;
/* Otherwise, determine if SVAL is implicitly live due to being made of
other live svalues. */
return implicitly_live_p (live_svalues, model);
}
/* Base implementation of svalue::implicitly_live_p. */
bool
svalue::implicitly_live_p (const svalue_set *, const region_model *) const
{
return false;
}
/* Comparator for imposing a deterministic order on constants that are
of the same type. */
static int
cmp_csts_same_type (const_tree cst1, const_tree cst2)
{
gcc_assert (TREE_TYPE (cst1) == TREE_TYPE (cst2));
gcc_assert (TREE_CODE (cst1) == TREE_CODE (cst2));
switch (TREE_CODE (cst1))
{
default:
gcc_unreachable ();
case INTEGER_CST:
return tree_int_cst_compare (cst1, cst2);
case STRING_CST:
return strcmp (TREE_STRING_POINTER (cst1),
TREE_STRING_POINTER (cst2));
case REAL_CST:
/* Impose an arbitrary but deterministic order. */
return memcmp (TREE_REAL_CST_PTR (cst1),
TREE_REAL_CST_PTR (cst2),
sizeof (real_value));
case COMPLEX_CST:
if (int cmp_real = cmp_csts_and_types (TREE_REALPART (cst1),
TREE_REALPART (cst2)))
return cmp_real;
return cmp_csts_and_types (TREE_IMAGPART (cst1), TREE_IMAGPART (cst2));
case VECTOR_CST:
if (int cmp_log2_npatterns
= ((int)VECTOR_CST_LOG2_NPATTERNS (cst1)
- (int)VECTOR_CST_LOG2_NPATTERNS (cst2)))
return cmp_log2_npatterns;
if (int cmp_nelts_per_pattern
= ((int)VECTOR_CST_NELTS_PER_PATTERN (cst1)
- (int)VECTOR_CST_NELTS_PER_PATTERN (cst2)))
return cmp_nelts_per_pattern;
unsigned encoded_nelts = vector_cst_encoded_nelts (cst1);
for (unsigned i = 0; i < encoded_nelts; i++)
{
const_tree elt1 = VECTOR_CST_ENCODED_ELT (cst1, i);
const_tree elt2 = VECTOR_CST_ENCODED_ELT (cst2, i);
if (int el_cmp = cmp_csts_and_types (elt1, elt2))
return el_cmp;
}
return 0;
}
}
/* Comparator for imposing a deterministic order on constants that might
not be of the same type. */
static int
cmp_csts_and_types (const_tree cst1, const_tree cst2)
{
int t1 = TYPE_UID (TREE_TYPE (cst1));
int t2 = TYPE_UID (TREE_TYPE (cst2));
if (int cmp_type = t1 - t2)
return cmp_type;
return cmp_csts_same_type (cst1, cst2);
}
/* Comparator for imposing a deterministic order on svalues. */
int
svalue::cmp_ptr (const svalue *sval1, const svalue *sval2)
{
if (sval1 == sval2)
return 0;
if (int cmp_kind = sval1->get_kind () - sval2->get_kind ())
return cmp_kind;
int t1 = sval1->get_type () ? TYPE_UID (sval1->get_type ()) : -1;
int t2 = sval2->get_type () ? TYPE_UID (sval2->get_type ()) : -1;
if (int cmp_type = t1 - t2)
return cmp_type;
switch (sval1->get_kind ())
{
default:
gcc_unreachable ();
case SK_REGION:
{
const region_svalue *region_sval1 = (const region_svalue *)sval1;
const region_svalue *region_sval2 = (const region_svalue *)sval2;
return region::cmp_ids (region_sval1->get_pointee (),
region_sval2->get_pointee ());
}
break;
case SK_CONSTANT:
{
const constant_svalue *constant_sval1 = (const constant_svalue *)sval1;
const constant_svalue *constant_sval2 = (const constant_svalue *)sval2;
const_tree cst1 = constant_sval1->get_constant ();
const_tree cst2 = constant_sval2->get_constant ();
/* The svalues have the same type, but the underlying trees
might not (for the case where both svalues are typeless). */
return cmp_csts_and_types (cst1, cst2);
}
break;
case SK_UNKNOWN:
{
gcc_assert (sval1 == sval2);
return 0;
}
break;
case SK_POISONED:
{
const poisoned_svalue *poisoned_sval1 = (const poisoned_svalue *)sval1;
const poisoned_svalue *poisoned_sval2 = (const poisoned_svalue *)sval2;
return (poisoned_sval1->get_poison_kind ()
- poisoned_sval2->get_poison_kind ());
}
break;
case SK_SETJMP:
{
const setjmp_svalue *setjmp_sval1 = (const setjmp_svalue *)sval1;
const setjmp_svalue *setjmp_sval2 = (const setjmp_svalue *)sval2;
const setjmp_record &rec1 = setjmp_sval1->get_setjmp_record ();
const setjmp_record &rec2 = setjmp_sval2->get_setjmp_record ();
return setjmp_record::cmp (rec1, rec2);
}
break;
case SK_INITIAL:
{
const initial_svalue *initial_sval1 = (const initial_svalue *)sval1;
const initial_svalue *initial_sval2 = (const initial_svalue *)sval2;
return region::cmp_ids (initial_sval1->get_region (),
initial_sval2->get_region ());
}
break;
case SK_UNARYOP:
{
const unaryop_svalue *unaryop_sval1 = (const unaryop_svalue *)sval1;
const unaryop_svalue *unaryop_sval2 = (const unaryop_svalue *)sval2;
if (int op_cmp = unaryop_sval1->get_op () - unaryop_sval2->get_op ())
return op_cmp;
return svalue::cmp_ptr (unaryop_sval1->get_arg (),
unaryop_sval2->get_arg ());
}
break;
case SK_BINOP:
{
const binop_svalue *binop_sval1 = (const binop_svalue *)sval1;
const binop_svalue *binop_sval2 = (const binop_svalue *)sval2;
if (int op_cmp = binop_sval1->get_op () - binop_sval2->get_op ())
return op_cmp;
if (int arg0_cmp = svalue::cmp_ptr (binop_sval1->get_arg0 (),
binop_sval2->get_arg0 ()))
return arg0_cmp;
return svalue::cmp_ptr (binop_sval1->get_arg1 (),
binop_sval2->get_arg1 ());
}
break;
case SK_SUB:
{
const sub_svalue *sub_sval1 = (const sub_svalue *)sval1;
const sub_svalue *sub_sval2 = (const sub_svalue *)sval2;
if (int parent_cmp = svalue::cmp_ptr (sub_sval1->get_parent (),
sub_sval2->get_parent ()))
return parent_cmp;
return region::cmp_ids (sub_sval1->get_subregion (),
sub_sval2->get_subregion ());
}
break;
case SK_REPEATED:
{
const repeated_svalue *repeated_sval1 = (const repeated_svalue *)sval1;
const repeated_svalue *repeated_sval2 = (const repeated_svalue *)sval2;
return svalue::cmp_ptr (repeated_sval1->get_inner_svalue (),
repeated_sval2->get_inner_svalue ());
}
break;
case SK_BITS_WITHIN:
{
const bits_within_svalue *bits_within_sval1
= (const bits_within_svalue *)sval1;
const bits_within_svalue *bits_within_sval2
= (const bits_within_svalue *)sval2;
if (int cmp = bit_range::cmp (bits_within_sval1->get_bits (),
bits_within_sval2->get_bits ()))
return cmp;
return svalue::cmp_ptr (bits_within_sval1->get_inner_svalue (),
bits_within_sval2->get_inner_svalue ());
}
break;
case SK_UNMERGEABLE:
{
const unmergeable_svalue *unmergeable_sval1
= (const unmergeable_svalue *)sval1;
const unmergeable_svalue *unmergeable_sval2
= (const unmergeable_svalue *)sval2;
return svalue::cmp_ptr (unmergeable_sval1->get_arg (),
unmergeable_sval2->get_arg ());
}
break;
case SK_PLACEHOLDER:
{
const placeholder_svalue *placeholder_sval1
= (const placeholder_svalue *)sval1;
const placeholder_svalue *placeholder_sval2
= (const placeholder_svalue *)sval2;
return strcmp (placeholder_sval1->get_name (),
placeholder_sval2->get_name ());
}
break;
case SK_WIDENING:
{
const widening_svalue *widening_sval1 = (const widening_svalue *)sval1;
const widening_svalue *widening_sval2 = (const widening_svalue *)sval2;
if (int point_cmp = function_point::cmp (widening_sval1->get_point (),
widening_sval2->get_point ()))
return point_cmp;
if (int base_cmp = svalue::cmp_ptr (widening_sval1->get_base_svalue (),
widening_sval2->get_base_svalue ()))
return base_cmp;
return svalue::cmp_ptr (widening_sval1->get_iter_svalue (),
widening_sval2->get_iter_svalue ());
}
break;
case SK_COMPOUND:
{
const compound_svalue *compound_sval1 = (const compound_svalue *)sval1;
const compound_svalue *compound_sval2 = (const compound_svalue *)sval2;
return binding_map::cmp (compound_sval1->get_map (),
compound_sval2->get_map ());
}
break;
case SK_CONJURED:
{
const conjured_svalue *conjured_sval1 = (const conjured_svalue *)sval1;
const conjured_svalue *conjured_sval2 = (const conjured_svalue *)sval2;
if (int stmt_cmp = (conjured_sval1->get_stmt ()->uid
- conjured_sval2->get_stmt ()->uid))
return stmt_cmp;
return region::cmp_ids (conjured_sval1->get_id_region (),
conjured_sval2->get_id_region ());
}
break;
case SK_ASM_OUTPUT:
{
const asm_output_svalue *asm_output_sval1
= (const asm_output_svalue *)sval1;
const asm_output_svalue *asm_output_sval2
= (const asm_output_svalue *)sval2;
if (int asm_string_cmp = strcmp (asm_output_sval1->get_asm_string (),
asm_output_sval2->get_asm_string ()))
return asm_string_cmp;
if (int output_idx_cmp = ((int)asm_output_sval1->get_output_idx ()
- (int)asm_output_sval2->get_output_idx ()))
return output_idx_cmp;
if (int cmp = ((int)asm_output_sval1->get_num_inputs ()
- (int)asm_output_sval2->get_num_inputs ()))
return cmp;
for (unsigned i = 0; i < asm_output_sval1->get_num_inputs (); i++)
if (int input_cmp
= svalue::cmp_ptr (asm_output_sval1->get_input (i),
asm_output_sval2->get_input (i)))
return input_cmp;
return 0;
}
break;
case SK_CONST_FN_RESULT:
{
const const_fn_result_svalue *const_fn_result_sval1
= (const const_fn_result_svalue *)sval1;
const const_fn_result_svalue *const_fn_result_sval2
= (const const_fn_result_svalue *)sval2;
int d1 = DECL_UID (const_fn_result_sval1->get_fndecl ());
int d2 = DECL_UID (const_fn_result_sval2->get_fndecl ());
if (int cmp_fndecl = d1 - d2)
return cmp_fndecl;
if (int cmp = ((int)const_fn_result_sval1->get_num_inputs ()
- (int)const_fn_result_sval2->get_num_inputs ()))
return cmp;
for (unsigned i = 0; i < const_fn_result_sval1->get_num_inputs (); i++)
if (int input_cmp
= svalue::cmp_ptr (const_fn_result_sval1->get_input (i),
const_fn_result_sval2->get_input (i)))
return input_cmp;
return 0;
}
}
}
/* Comparator for use by vec<const svalue *>::qsort. */
int
svalue::cmp_ptr_ptr (const void *p1, const void *p2)
{
const svalue *sval1 = *(const svalue * const *)p1;
const svalue *sval2 = *(const svalue * const *)p2;
return cmp_ptr (sval1, sval2);
}
/* Subclass of visitor for use in implementing svalue::involves_p. */
class involvement_visitor : public visitor
{
public:
involvement_visitor (const svalue *needle)
: m_needle (needle), m_found (false) {}
void visit_initial_svalue (const initial_svalue *candidate) final override
{
if (candidate == m_needle)
m_found = true;
}
void visit_conjured_svalue (const conjured_svalue *candidate) final override
{
if (candidate == m_needle)
m_found = true;
}
void visit_widening_svalue (const widening_svalue *candidate) final override
{
if (candidate == m_needle)
m_found = true;
}
bool found_p () const { return m_found; }
private:
const svalue *m_needle;
bool m_found;
};
/* Return true iff this svalue is defined in terms of OTHER. */
bool
svalue::involves_p (const svalue *other) const
{
/* Currently only implemented for these kinds. */
gcc_assert (other->get_kind () == SK_INITIAL
|| other->get_kind () == SK_CONJURED
|| other->get_kind () == SK_WIDENING);
involvement_visitor v (other);
accept (&v);
return v.found_p ();
}
/* Extract SUBRANGE from this value, of type TYPE. */
const svalue *
svalue::extract_bit_range (tree type,
const bit_range &subrange,
region_model_manager *mgr) const
{
return mgr->get_or_create_bits_within (type, subrange, this);
}
/* Base implementation of svalue::maybe_fold_bits_within vfunc. */
const svalue *
svalue::maybe_fold_bits_within (tree,
const bit_range &,
region_model_manager *) const
{
/* By default, don't fold. */
return NULL;
}
/* Base implementation of svalue::all_zeroes_p.
Return true if this value is known to be all zeroes. */
bool
svalue::all_zeroes_p () const
{
return false;
}
/* If this svalue is a pointer, attempt to determine the base region it points
to. Return NULL on any problems. */
const region *
svalue::maybe_get_deref_base_region () const
{
const svalue *iter = this;
while (1)
{
switch (iter->get_kind ())
{
default:
return NULL;
case SK_REGION:
{
const region_svalue *region_sval
= as_a <const region_svalue *> (iter);
return region_sval->get_pointee ()->get_base_region ();
}
case SK_BINOP:
{
const binop_svalue *binop_sval
= as_a <const binop_svalue *> (iter);
switch (binop_sval->get_op ())
{
case POINTER_PLUS_EXPR:
/* If we have a symbolic value expressing pointer arithmetic,
use the LHS. */
iter = binop_sval->get_arg0 ();
continue;
default:
return NULL;
}
return NULL;
}
}
}
}
/* class region_svalue : public svalue. */
/* Implementation of svalue::dump_to_pp vfunc for region_svalue. */
void
region_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_string (pp, "&");
m_reg->dump_to_pp (pp, simple);
}
else
{
pp_string (pp, "region_svalue(");
if (get_type ())
{
print_quoted_type (pp, get_type ());
pp_string (pp, ", ");
}
m_reg->dump_to_pp (pp, simple);
pp_string (pp, ")");
}
}
/* Implementation of svalue::accept vfunc for region_svalue. */
void
region_svalue::accept (visitor *v) const
{
m_reg->accept (v);
v->visit_region_svalue (this);
}
/* Implementation of svalue::implicitly_live_p vfunc for region_svalue. */
bool
region_svalue::implicitly_live_p (const svalue_set *,
const region_model *model) const
{
/* Pointers into clusters that have escaped should be treated as live. */
const region *base_reg = get_pointee ()->get_base_region ();
const store *store = model->get_store ();
if (const binding_cluster *c = store->get_cluster (base_reg))
if (c->escaped_p ())
return true;
return false;
}
/* Evaluate the condition LHS OP RHS.
Subroutine of region_model::eval_condition for when we have a pair of
pointers. */
tristate
region_svalue::eval_condition (const region_svalue *lhs,
enum tree_code op,
const region_svalue *rhs)
{
/* See if they point to the same region. */
const region *lhs_reg = lhs->get_pointee ();
const region *rhs_reg = rhs->get_pointee ();
bool ptr_equality = lhs_reg == rhs_reg;
switch (op)
{
default:
gcc_unreachable ();
case EQ_EXPR:
if (ptr_equality)
return tristate::TS_TRUE;
else
return tristate::TS_FALSE;
break;
case NE_EXPR:
if (ptr_equality)
return tristate::TS_FALSE;
else
return tristate::TS_TRUE;
break;
case GE_EXPR:
case LE_EXPR:
if (ptr_equality)
return tristate::TS_TRUE;
break;
case GT_EXPR:
case LT_EXPR:
if (ptr_equality)
return tristate::TS_FALSE;
break;
}
return tristate::TS_UNKNOWN;
}
/* class constant_svalue : public svalue. */
/* Implementation of svalue::dump_to_pp vfunc for constant_svalue. */
void
constant_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_string (pp, "(");
dump_tree (pp, get_type ());
pp_string (pp, ")");
dump_tree (pp, m_cst_expr);
}
else
{
pp_string (pp, "constant_svalue(");
if (get_type ())
{
print_quoted_type (pp, get_type ());
pp_string (pp, ", ");
}
dump_tree (pp, m_cst_expr);
pp_string (pp, ")");
}
}
/* Implementation of svalue::accept vfunc for constant_svalue. */
void
constant_svalue::accept (visitor *v) const
{
v->visit_constant_svalue (this);
}
/* Implementation of svalue::implicitly_live_p vfunc for constant_svalue.
Constants are implicitly live. */
bool
constant_svalue::implicitly_live_p (const svalue_set *,
const region_model *) const
{
return true;
}
/* Given EXPR, a non-NULL expression of boolean type, convert to
a tristate based on whether this is known to be true, false,
or is not known. */
static tristate
tristate_from_boolean_tree_node (tree expr)
{
gcc_assert (TREE_TYPE (expr) == boolean_type_node);
if (expr == boolean_true_node)
return tristate (tristate::TS_TRUE);
else if (expr == boolean_false_node)
return tristate (tristate::TS_FALSE);
else
return tristate (tristate::TS_UNKNOWN);
}
/* Evaluate the condition LHS OP RHS.
Subroutine of region_model::eval_condition for when we have a pair of
constants. */
tristate
constant_svalue::eval_condition (const constant_svalue *lhs,
enum tree_code op,
const constant_svalue *rhs)
{
tree lhs_const = lhs->get_constant ();
tree rhs_const = rhs->get_constant ();
gcc_assert (CONSTANT_CLASS_P (lhs_const));
gcc_assert (CONSTANT_CLASS_P (rhs_const));
if ((lhs->get_type () == NULL_TREE || rhs->get_type () == NULL_TREE)
&& TREE_CODE (lhs_const) == INTEGER_CST
&& TREE_CODE (rhs_const) == INTEGER_CST
)
{
if (tree tree_cmp = const_binop (op, boolean_type_node,
lhs_const, rhs_const))
{
tristate ts = tristate_from_boolean_tree_node (tree_cmp);
if (ts.is_known ())
return ts;
}
}
/* Check for comparable types. */
if (types_compatible_p (TREE_TYPE (lhs_const), TREE_TYPE (rhs_const)))
{
tree tree_cmp
= fold_binary (op, boolean_type_node, lhs_const, rhs_const);
tristate ts = tristate_from_boolean_tree_node (tree_cmp);
if (ts.is_known ())
return ts;
}
return tristate::TS_UNKNOWN;
}
/* Implementation of svalue::maybe_fold_bits_within vfunc
for constant_svalue. */
const svalue *
constant_svalue::maybe_fold_bits_within (tree type,
const bit_range &bits,
region_model_manager *mgr) const
{
/* Bits within an all-zero value are also all zero. */
if (zerop (m_cst_expr))
{
if (type)
return mgr->get_or_create_cast (type, this);
else
return this;
}
/* Handle the case of extracting a single bit. */
if (bits.m_size_in_bits == 1
&& TREE_CODE (m_cst_expr) == INTEGER_CST
&& type
&& INTEGRAL_TYPE_P (type)
&& tree_fits_uhwi_p (m_cst_expr))
{
unsigned HOST_WIDE_INT bit = bits.m_start_bit_offset.to_uhwi ();
unsigned HOST_WIDE_INT mask = (1 << bit);
unsigned HOST_WIDE_INT val_as_hwi = tree_to_uhwi (m_cst_expr);
unsigned HOST_WIDE_INT masked_val = val_as_hwi & mask;
int result = masked_val ? 1 : 0;
return mgr->get_or_create_int_cst (type, result);
}
/* Otherwise, don't fold. */
return NULL;
}
/* Implementation of svalue::all_zeroes_p for constant_svalue. */
bool
constant_svalue::all_zeroes_p () const
{
return zerop (m_cst_expr);
}
/* class unknown_svalue : public svalue. */
/* Implementation of svalue::dump_to_pp vfunc for unknown_svalue. */
void
unknown_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_string (pp, "UNKNOWN(");
if (get_type ())
dump_tree (pp, get_type ());
pp_character (pp, ')');
}
else
{
pp_string (pp, "unknown_svalue(");
if (get_type ())
dump_tree (pp, get_type ());
pp_character (pp, ')');
}
}
/* Implementation of svalue::accept vfunc for unknown_svalue. */
void
unknown_svalue::accept (visitor *v) const
{
v->visit_unknown_svalue (this);
}
/* Implementation of svalue::maybe_fold_bits_within vfunc
for unknown_svalue. */
const svalue *
unknown_svalue::maybe_fold_bits_within (tree type,
const bit_range &,
region_model_manager *mgr) const
{
/* Bits within an unknown_svalue are themselves unknown. */
return mgr->get_or_create_unknown_svalue (type);
}
/* Get a string for KIND for use in debug dumps. */
const char *
poison_kind_to_str (enum poison_kind kind)
{
switch (kind)
{
default:
gcc_unreachable ();
case POISON_KIND_UNINIT:
return "uninit";
case POISON_KIND_FREED:
return "freed";
case POISON_KIND_DELETED:
return "deleted";
case POISON_KIND_POPPED_STACK:
return "popped stack";
}
}
/* class poisoned_svalue : public svalue. */
/* Implementation of svalue::dump_to_pp vfunc for poisoned_svalue. */
void
poisoned_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_string (pp, "POISONED(");
print_quoted_type (pp, get_type ());
pp_printf (pp, ", %s)", poison_kind_to_str (m_kind));
}
else
{
pp_string (pp, "poisoned_svalue(");
print_quoted_type (pp, get_type ());
pp_printf (pp, ", %s)", poison_kind_to_str (m_kind));
}
}
/* Implementation of svalue::accept vfunc for poisoned_svalue. */
void
poisoned_svalue::accept (visitor *v) const
{
v->visit_poisoned_svalue (this);
}
/* Implementation of svalue::maybe_fold_bits_within vfunc
for poisoned_svalue. */
const svalue *
poisoned_svalue::maybe_fold_bits_within (tree type,
const bit_range &,
region_model_manager *mgr) const
{
/* Bits within a poisoned value are also poisoned. */
return mgr->get_or_create_poisoned_svalue (m_kind, type);
}
/* class setjmp_svalue's implementation is in engine.cc, so that it can use
the declaration of exploded_node. */
/* class initial_svalue : public svalue. */
/* Implementation of svalue::dump_to_pp vfunc for initial_svalue. */
void
initial_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_string (pp, "INIT_VAL(");
m_reg->dump_to_pp (pp, simple);
pp_string (pp, ")");
}
else
{
pp_string (pp, "initial_svalue(");
if (get_type ())
{
print_quoted_type (pp, get_type ());
pp_string (pp, ", ");
}
m_reg->dump_to_pp (pp, simple);
pp_string (pp, ")");
}
}
/* Implementation of svalue::accept vfunc for initial_svalue. */
void
initial_svalue::accept (visitor *v) const
{
m_reg->accept (v);
v->visit_initial_svalue (this);
}
/* Implementation of svalue::implicitly_live_p vfunc for initial_svalue. */
bool
initial_svalue::implicitly_live_p (const svalue_set *,
const region_model *model) const
{
/* This svalue may be implicitly live if the region still implicitly
has its initial value and is reachable. */
/* It must be a region that exists; we don't want to consider
INIT_VAL(R) as still being implicitly reachable if R is in
a popped stack frame. */
if (model->region_exists_p (m_reg))
{
const svalue *reg_sval = model->get_store_value (m_reg, NULL);
if (reg_sval == this)
return true;
}
/* Assume that the initial values of params for the top level frame
are still live, because (presumably) they're still
live in the external caller. */
if (initial_value_of_param_p ())
if (const frame_region *frame_reg = m_reg->maybe_get_frame_region ())
if (frame_reg->get_calling_frame () == NULL)
return true;
return false;
}
/* Return true if this is the initial value of a function parameter. */
bool
initial_svalue::initial_value_of_param_p () const
{
if (tree reg_decl = m_reg->maybe_get_decl ())
if (TREE_CODE (reg_decl) == SSA_NAME)
{
tree ssa_name = reg_decl;
if (SSA_NAME_IS_DEFAULT_DEF (ssa_name)
&& SSA_NAME_VAR (ssa_name)
&& TREE_CODE (SSA_NAME_VAR (ssa_name)) == PARM_DECL)
return true;
}
return false;
}
/* class unaryop_svalue : public svalue. */
/* Implementation of svalue::dump_to_pp vfunc for unaryop_svalue. */
void
unaryop_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
if (m_op == VIEW_CONVERT_EXPR || m_op == NOP_EXPR)
{
pp_string (pp, "CAST(");
dump_tree (pp, get_type ());
pp_string (pp, ", ");
m_arg->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
else
{
pp_character (pp, '(');
pp_string (pp, get_tree_code_name (m_op));
//pp_string (pp, op_symbol_code (m_op));
m_arg->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
}
else
{
pp_string (pp, "unaryop_svalue (");
pp_string (pp, get_tree_code_name (m_op));
pp_string (pp, ", ");
m_arg->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
}
/* Implementation of svalue::accept vfunc for unaryop_svalue. */
void
unaryop_svalue::accept (visitor *v) const
{
m_arg->accept (v);
v->visit_unaryop_svalue (this);
}
/* Implementation of svalue::implicitly_live_p vfunc for unaryop_svalue. */
bool
unaryop_svalue::implicitly_live_p (const svalue_set *live_svalues,
const region_model *model) const
{
return get_arg ()->live_p (live_svalues, model);
}
/* Implementation of svalue::maybe_fold_bits_within vfunc
for unaryop_svalue. */
const svalue *
unaryop_svalue::maybe_fold_bits_within (tree type,
const bit_range &,
region_model_manager *mgr) const
{
switch (m_op)
{
default:
break;
case NOP_EXPR:
/* A cast of zero is zero. */
if (tree cst = m_arg->maybe_get_constant ())
if (zerop (cst))
{
if (type)
return mgr->get_or_create_cast (type, this);
else
return this;
}
break;
}
/* Otherwise, don't fold. */
return NULL;
}
/* class binop_svalue : public svalue. */
/* Return whether OP be printed as an infix operator. */
static bool
infix_p (enum tree_code op)
{
switch (op)
{
default:
return true;
case MAX_EXPR:
case MIN_EXPR:
return false;
}
}
/* Implementation of svalue::dump_to_pp vfunc for binop_svalue. */
void
binop_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
if (infix_p (m_op))
{
/* Print "(A OP B)". */
pp_character (pp, '(');
m_arg0->dump_to_pp (pp, simple);
pp_string (pp, op_symbol_code (m_op));
m_arg1->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
else
{
/* Print "OP(A, B)". */
pp_string (pp, op_symbol_code (m_op));
pp_character (pp, '(');
m_arg0->dump_to_pp (pp, simple);
pp_string (pp, ", ");
m_arg1->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
}
else
{
pp_string (pp, "binop_svalue (");
pp_string (pp, get_tree_code_name (m_op));
pp_string (pp, ", ");
m_arg0->dump_to_pp (pp, simple);
pp_string (pp, ", ");
m_arg1->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
}
/* Implementation of svalue::accept vfunc for binop_svalue. */
void
binop_svalue::accept (visitor *v) const
{
m_arg0->accept (v);
m_arg1->accept (v);
v->visit_binop_svalue (this);
}
/* Implementation of svalue::implicitly_live_p vfunc for binop_svalue. */
bool
binop_svalue::implicitly_live_p (const svalue_set *live_svalues,
const region_model *model) const
{
return (get_arg0 ()->live_p (live_svalues, model)
&& get_arg1 ()->live_p (live_svalues, model));
}
/* class sub_svalue : public svalue. */
/* sub_svalue'c ctor. */
sub_svalue::sub_svalue (symbol::id_t id,
tree type, const svalue *parent_svalue,
const region *subregion)
: svalue (complexity::from_pair (parent_svalue->get_complexity (),
subregion->get_complexity ()),
id,
type),
m_parent_svalue (parent_svalue), m_subregion (subregion)
{
gcc_assert (parent_svalue->can_have_associated_state_p ());
}
/* Implementation of svalue::dump_to_pp vfunc for sub_svalue. */
void
sub_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_string (pp, "SUB(");
m_parent_svalue->dump_to_pp (pp, simple);
pp_string (pp, ", ");
m_subregion->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
else
{
pp_string (pp, "sub_svalue (");
pp_string (pp, ", ");
m_parent_svalue->dump_to_pp (pp, simple);
pp_string (pp, ", ");
m_subregion->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
}
/* Implementation of svalue::accept vfunc for sub_svalue. */
void
sub_svalue::accept (visitor *v) const
{
m_parent_svalue->accept (v);
m_subregion->accept (v);
v->visit_sub_svalue (this);
}
/* Implementation of svalue::implicitly_live_p vfunc for sub_svalue. */
bool
sub_svalue::implicitly_live_p (const svalue_set *live_svalues,
const region_model *model) const
{
return get_parent ()->live_p (live_svalues, model);
}
/* class repeated_svalue : public svalue. */
/* repeated_svalue'c ctor. */
repeated_svalue::repeated_svalue (symbol::id_t id,
tree type,
const svalue *outer_size,
const svalue *inner_svalue)
: svalue (complexity::from_pair (outer_size, inner_svalue), id, type),
m_outer_size (outer_size),
m_inner_svalue (inner_svalue)
{
gcc_assert (outer_size->can_have_associated_state_p ());
gcc_assert (inner_svalue->can_have_associated_state_p ());
}
/* Implementation of svalue::dump_to_pp vfunc for repeated_svalue. */
void
repeated_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_string (pp, "REPEATED(");
if (get_type ())
{
print_quoted_type (pp, get_type ());
pp_string (pp, ", ");
}
pp_string (pp, "outer_size: ");
m_outer_size->dump_to_pp (pp, simple);
pp_string (pp, ", inner_val: ");
m_inner_svalue->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
else
{
pp_string (pp, "repeated_svalue (");
if (get_type ())
{
print_quoted_type (pp, get_type ());
pp_string (pp, ", ");
}
pp_string (pp, "outer_size: ");
m_outer_size->dump_to_pp (pp, simple);
pp_string (pp, ", inner_val: ");
m_inner_svalue->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
}
/* Implementation of svalue::accept vfunc for repeated_svalue. */
void
repeated_svalue::accept (visitor *v) const
{
m_inner_svalue->accept (v);
v->visit_repeated_svalue (this);
}
/* Implementation of svalue::all_zeroes_p for repeated_svalue. */
bool
repeated_svalue::all_zeroes_p () const
{
return m_inner_svalue->all_zeroes_p ();
}
/* Implementation of svalue::maybe_fold_bits_within vfunc
for repeated_svalue. */
const svalue *
repeated_svalue::maybe_fold_bits_within (tree type,
const bit_range &bits,
region_model_manager *mgr) const
{
const svalue *innermost_sval = m_inner_svalue;
/* Fold
BITS_WITHIN (range, REPEATED_SVALUE (ZERO))
to:
REPEATED_SVALUE (ZERO). */
if (all_zeroes_p ())
{
byte_range bytes (0,0);
if (bits.as_byte_range (&bytes))
{
const svalue *byte_size
= mgr->get_or_create_int_cst (size_type_node,
bytes.m_size_in_bytes.to_uhwi ());
return mgr->get_or_create_repeated_svalue (type, byte_size,
innermost_sval);
}
}
/* Fold:
BITS_WITHIN (range, REPEATED_SVALUE (INNERMOST_SVALUE))
to:
BITS_WITHIN (range - offset, INNERMOST_SVALUE)
if range is fully within one instance of INNERMOST_SVALUE. */
if (tree innermost_type = innermost_sval->get_type ())
{
bit_size_t element_bit_size;
if (int_size_in_bits (innermost_type, &element_bit_size)
&& element_bit_size > 0)
{
HOST_WIDE_INT start_idx
= (bits.get_start_bit_offset ()
/ element_bit_size).to_shwi ();
HOST_WIDE_INT last_idx
= (bits.get_last_bit_offset ()
/ element_bit_size).to_shwi ();
if (start_idx == last_idx)
{
bit_offset_t start_of_element
= start_idx * element_bit_size;
bit_range range_within_element
(bits.m_start_bit_offset - start_of_element,
bits.m_size_in_bits);
return mgr->get_or_create_bits_within (type,
range_within_element,
innermost_sval);
}
}
}
return NULL;
}
/* class bits_within_svalue : public svalue. */
/* bits_within_svalue'c ctor. */
bits_within_svalue::bits_within_svalue (symbol::id_t id,
tree type,
const bit_range &bits,
const svalue *inner_svalue)
: svalue (complexity (inner_svalue), id, type),
m_bits (bits),
m_inner_svalue (inner_svalue)
{
gcc_assert (inner_svalue->can_have_associated_state_p ());
}
/* Implementation of svalue::dump_to_pp vfunc for bits_within_svalue. */
void
bits_within_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_string (pp, "BITS_WITHIN(");
if (get_type ())
{
print_quoted_type (pp, get_type ());
pp_string (pp, ", ");
}
m_bits.dump_to_pp (pp);
pp_string (pp, ", inner_val: ");
m_inner_svalue->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
else
{
pp_string (pp, "bits_within_svalue (");
if (get_type ())
{
print_quoted_type (pp, get_type ());
pp_string (pp, ", ");
}
m_bits.dump_to_pp (pp);
pp_string (pp, ", inner_val: ");
m_inner_svalue->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
}
/* Implementation of svalue::maybe_fold_bits_within vfunc
for bits_within_svalue. */
const svalue *
bits_within_svalue::maybe_fold_bits_within (tree type,
const bit_range &bits,
region_model_manager *mgr) const
{
/* Fold:
BITS_WITHIN (range1, BITS_WITHIN (range2, VAL))
to:
BITS_WITHIN (range1 in range 2, VAL). */
bit_range offset_bits (m_bits.get_start_bit_offset ()
+ bits.m_start_bit_offset,
bits.m_size_in_bits);
return mgr->get_or_create_bits_within (type, offset_bits, m_inner_svalue);
}
/* Implementation of svalue::accept vfunc for bits_within_svalue. */
void
bits_within_svalue::accept (visitor *v) const
{
m_inner_svalue->accept (v);
v->visit_bits_within_svalue (this);
}
/* Implementation of svalue::implicitly_live_p vfunc for bits_within_svalue. */
bool
bits_within_svalue::implicitly_live_p (const svalue_set *live_svalues,
const region_model *model) const
{
return m_inner_svalue->live_p (live_svalues, model);
}
/* class widening_svalue : public svalue. */
/* Implementation of svalue::dump_to_pp vfunc for widening_svalue. */
void
widening_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_string (pp, "WIDENING(");
pp_character (pp, '{');
m_point.print (pp, format (false));
pp_string (pp, "}, ");
m_base_sval->dump_to_pp (pp, simple);
pp_string (pp, ", ");
m_iter_sval->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
else
{
pp_string (pp, "widening_svalue (");
pp_string (pp, ", ");
pp_character (pp, '{');
m_point.print (pp, format (false));
pp_string (pp, "}, ");
m_base_sval->dump_to_pp (pp, simple);
pp_string (pp, ", ");
m_iter_sval->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
}
/* Implementation of svalue::accept vfunc for widening_svalue. */
void
widening_svalue::accept (visitor *v) const
{
m_base_sval->accept (v);
m_iter_sval->accept (v);
v->visit_widening_svalue (this);
}
/* Attempt to determine in which direction this value is changing
w.r.t. the initial value. */
enum widening_svalue::direction_t
widening_svalue::get_direction () const
{
tree base_cst = m_base_sval->maybe_get_constant ();
if (base_cst == NULL_TREE)
return DIR_UNKNOWN;
tree iter_cst = m_iter_sval->maybe_get_constant ();
if (iter_cst == NULL_TREE)
return DIR_UNKNOWN;
tree iter_gt_base = fold_binary (GT_EXPR, boolean_type_node,
iter_cst, base_cst);
if (iter_gt_base == boolean_true_node)
return DIR_ASCENDING;
tree iter_lt_base = fold_binary (LT_EXPR, boolean_type_node,
iter_cst, base_cst);
if (iter_lt_base == boolean_true_node)
return DIR_DESCENDING;
return DIR_UNKNOWN;
}
/* Compare this value against constant RHS_CST. */
tristate
widening_svalue::eval_condition_without_cm (enum tree_code op,
tree rhs_cst) const
{
tree base_cst = m_base_sval->maybe_get_constant ();
if (base_cst == NULL_TREE)
return tristate::TS_UNKNOWN;
tree iter_cst = m_iter_sval->maybe_get_constant ();
if (iter_cst == NULL_TREE)
return tristate::TS_UNKNOWN;
switch (get_direction ())
{
default:
gcc_unreachable ();
case DIR_ASCENDING:
/* LHS is in [base_cst, +ve infinity), assuming no overflow. */
switch (op)
{
case LE_EXPR:
case LT_EXPR:
{
/* [BASE, +INF) OP RHS:
This is either true or false at +ve ininity,
It can be true for points X where X OP RHS, so we have either
"false", or "unknown". */
tree base_op_rhs = fold_binary (op, boolean_type_node,
base_cst, rhs_cst);
if (base_op_rhs == boolean_true_node)
return tristate::TS_UNKNOWN;
else
return tristate::TS_FALSE;
}
case GE_EXPR:
case GT_EXPR:
{
/* [BASE, +INF) OP RHS:
This is true at +ve infinity. It will be true everywhere
in the range if BASE >= RHS. */
tree base_op_rhs = fold_binary (op, boolean_type_node,
base_cst, rhs_cst);
if (base_op_rhs == boolean_true_node)
return tristate::TS_TRUE;
else
return tristate::TS_UNKNOWN;
}
case EQ_EXPR:
{
/* [BASE, +INF) == RHS:
Could this be true at any point in the range? If so we
have "unknown", otherwise we have "false". */
tree base_le_rhs = fold_binary (LE_EXPR, boolean_type_node,
base_cst, rhs_cst);
if (base_le_rhs == boolean_true_node)
return tristate::TS_UNKNOWN;
else
return tristate::TS_FALSE;
}
case NE_EXPR:
{
/* [BASE, +INF) != RHS:
Could we have equality at any point in the range? If so we
have "unknown", otherwise we have "true". */
tree base_le_rhs = fold_binary (LE_EXPR, boolean_type_node,
base_cst, rhs_cst);
if (base_le_rhs == boolean_true_node)
return tristate::TS_UNKNOWN;
else
return tristate::TS_TRUE;
}
default:
return tristate::TS_UNKNOWN;
}
case DIR_DESCENDING:
/* LHS is in (-ve infinity, base_cst], assuming no overflow. */
return tristate::TS_UNKNOWN;
case DIR_UNKNOWN:
return tristate::TS_UNKNOWN;
}
}
/* class placeholder_svalue : public svalue. */
/* Implementation of svalue::dump_to_pp vfunc for placeholder_svalue. */
void
placeholder_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
pp_printf (pp, "PLACEHOLDER(%qs)", m_name);
else
pp_printf (pp, "placeholder_svalue (%qs)", m_name);
}
/* Implementation of svalue::accept vfunc for placeholder_svalue. */
void
placeholder_svalue::accept (visitor *v) const
{
v->visit_placeholder_svalue (this);
}
/* class unmergeable_svalue : public svalue. */
/* Implementation of svalue::dump_to_pp vfunc for unmergeable_svalue. */
void
unmergeable_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_string (pp, "UNMERGEABLE(");
m_arg->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
else
{
pp_string (pp, "unmergeable_svalue (");
m_arg->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
}
/* Implementation of svalue::accept vfunc for unmergeable_svalue. */
void
unmergeable_svalue::accept (visitor *v) const
{
m_arg->accept (v);
v->visit_unmergeable_svalue (this);
}
/* Implementation of svalue::implicitly_live_p vfunc for unmergeable_svalue. */
bool
unmergeable_svalue::implicitly_live_p (const svalue_set *live_svalues,
const region_model *model) const
{
return get_arg ()->live_p (live_svalues, model);
}
/* class compound_svalue : public svalue. */
compound_svalue::compound_svalue (symbol::id_t id,
tree type,
const binding_map &map)
: svalue (calc_complexity (map), id, type), m_map (map)
{
#if CHECKING_P
for (iterator_t iter = begin (); iter != end (); ++iter)
{
/* All keys within the underlying binding_map are required to be concrete,
not symbolic. */
const binding_key *key = (*iter).first;
gcc_assert (key->concrete_p ());
/* We don't nest compound svalues. */
const svalue *sval = (*iter).second;
gcc_assert (sval->get_kind () != SK_COMPOUND);
}
#endif
}
/* Implementation of svalue::dump_to_pp vfunc for compound_svalue. */
void
compound_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_string (pp, "COMPOUND(");
if (get_type ())
{
print_quoted_type (pp, get_type ());
pp_string (pp, ", ");
}
pp_character (pp, '{');
m_map.dump_to_pp (pp, simple, false);
pp_string (pp, "})");
}
else
{
pp_string (pp, "compound_svalue (");
if (get_type ())
{
print_quoted_type (pp, get_type ());
pp_string (pp, ", ");
}
pp_character (pp, '{');
m_map.dump_to_pp (pp, simple, false);
pp_string (pp, "})");
}
}
/* Implementation of svalue::accept vfunc for compound_svalue. */
void
compound_svalue::accept (visitor *v) const
{
for (binding_map::iterator_t iter = m_map.begin ();
iter != m_map.end (); ++iter)
{
//(*iter).first.accept (v);
(*iter).second->accept (v);
}
v->visit_compound_svalue (this);
}
/* Calculate what the complexity of a compound_svalue instance for MAP
will be, based on the svalues bound within MAP. */
complexity
compound_svalue::calc_complexity (const binding_map &map)
{
unsigned num_child_nodes = 0;
unsigned max_child_depth = 0;
for (binding_map::iterator_t iter = map.begin ();
iter != map.end (); ++iter)
{
const complexity &sval_c = (*iter).second->get_complexity ();
num_child_nodes += sval_c.m_num_nodes;
max_child_depth = MAX (max_child_depth, sval_c.m_max_depth);
}
return complexity (num_child_nodes + 1, max_child_depth + 1);
}
/* Implementation of svalue::maybe_fold_bits_within vfunc
for compound_svalue. */
const svalue *
compound_svalue::maybe_fold_bits_within (tree type,
const bit_range &bits,
region_model_manager *mgr) const
{
binding_map result_map;
for (auto iter : m_map)
{
const binding_key *key = iter.first;
if (const concrete_binding *conc_key
= key->dyn_cast_concrete_binding ())
{
/* Ignore concrete bindings outside BITS. */
if (!conc_key->get_bit_range ().intersects_p (bits))
continue;
const svalue *sval = iter.second;
/* Get the position of conc_key relative to BITS. */
bit_range result_location (conc_key->get_start_bit_offset ()
- bits.get_start_bit_offset (),
conc_key->get_size_in_bits ());
/* If conc_key starts after BITS, trim off leading bits
from the svalue and adjust binding location. */
if (result_location.m_start_bit_offset < 0)
{
bit_size_t leading_bits_to_drop
= -result_location.m_start_bit_offset;
result_location = bit_range
(0, result_location.m_size_in_bits - leading_bits_to_drop);
bit_range bits_within_sval (leading_bits_to_drop,
result_location.m_size_in_bits);
/* Trim off leading bits from iter_sval. */
sval = mgr->get_or_create_bits_within (NULL_TREE,
bits_within_sval,
sval);
}
/* If conc_key finishes after BITS, trim off trailing bits
from the svalue and adjust binding location. */
if (conc_key->get_next_bit_offset ()
> bits.get_next_bit_offset ())
{
bit_size_t trailing_bits_to_drop
= (conc_key->get_next_bit_offset ()
- bits.get_next_bit_offset ());
result_location = bit_range
(result_location.m_start_bit_offset,
result_location.m_size_in_bits - trailing_bits_to_drop);
bit_range bits_within_sval (0,
result_location.m_size_in_bits);
/* Trim off leading bits from iter_sval. */
sval = mgr->get_or_create_bits_within (NULL_TREE,
bits_within_sval,
sval);
}
const concrete_binding *offset_conc_key
= mgr->get_store_manager ()->get_concrete_binding
(result_location);
result_map.put (offset_conc_key, sval);
}
else
/* If we have any symbolic keys we can't get it as bits. */
return NULL;
}
return mgr->get_or_create_compound_svalue (type, result_map);
}
/* class conjured_svalue : public svalue. */
/* Implementation of svalue::dump_to_pp vfunc for conjured_svalue. */
void
conjured_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_string (pp, "CONJURED(");
pp_gimple_stmt_1 (pp, m_stmt, 0, (dump_flags_t)0);
pp_string (pp, ", ");
m_id_reg->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
else
{
pp_string (pp, "conjured_svalue (");
if (get_type ())
{
print_quoted_type (pp, get_type ());
pp_string (pp, ", ");
}
pp_gimple_stmt_1 (pp, m_stmt, 0, (dump_flags_t)0);
pp_string (pp, ", ");
m_id_reg->dump_to_pp (pp, simple);
pp_character (pp, ')');
}
}
/* Implementation of svalue::accept vfunc for conjured_svalue. */
void
conjured_svalue::accept (visitor *v) const
{
m_id_reg->accept (v);
v->visit_conjured_svalue (this);
}
/* Return true iff this conjured_svalue is for the LHS of the
stmt that conjured it. */
bool
conjured_svalue::lhs_value_p () const
{
if (tree decl = m_id_reg->maybe_get_decl ())
return decl == gimple_get_lhs (m_stmt);
return false;
}
/* class asm_output_svalue : public svalue. */
/* Implementation of svalue::dump_to_pp vfunc for asm_output_svalue. */
void
asm_output_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_printf (pp, "ASM_OUTPUT(%qs, %%%i, {",
get_asm_string (),
get_output_idx ());
for (unsigned i = 0; i < m_num_inputs; i++)
{
if (i > 0)
pp_string (pp, ", ");
dump_input (pp, 0, m_input_arr[i], simple);
}
pp_string (pp, "})");
}
else
{
pp_printf (pp, "asm_output_svalue (%qs, %%%i, {",
get_asm_string (),
get_output_idx ());
for (unsigned i = 0; i < m_num_inputs; i++)
{
if (i > 0)
pp_string (pp, ", ");
dump_input (pp, 0, m_input_arr[i], simple);
}
pp_string (pp, "})");
}
}
/* Subroutine of asm_output_svalue::dump_to_pp. */
void
asm_output_svalue::dump_input (pretty_printer *pp,
unsigned input_idx,
const svalue *sval,
bool simple) const
{
pp_printf (pp, "%%%i: ", input_idx_to_asm_idx (input_idx));
sval->dump_to_pp (pp, simple);
}
/* Convert INPUT_IDX from an index into the array of inputs
into the index of all operands for the asm stmt. */
unsigned
asm_output_svalue::input_idx_to_asm_idx (unsigned input_idx) const
{
return input_idx + m_num_outputs;
}
/* Implementation of svalue::accept vfunc for asm_output_svalue. */
void
asm_output_svalue::accept (visitor *v) const
{
for (unsigned i = 0; i < m_num_inputs; i++)
m_input_arr[i]->accept (v);
v->visit_asm_output_svalue (this);
}
/* class const_fn_result_svalue : public svalue. */
/* Implementation of svalue::dump_to_pp vfunc for const_fn_result_svalue. */
void
const_fn_result_svalue::dump_to_pp (pretty_printer *pp, bool simple) const
{
if (simple)
{
pp_printf (pp, "CONST_FN_RESULT(%qD, {", m_fndecl);
for (unsigned i = 0; i < m_num_inputs; i++)
{
if (i > 0)
pp_string (pp, ", ");
dump_input (pp, i, m_input_arr[i], simple);
}
pp_string (pp, "})");
}
else
{
pp_printf (pp, "CONST_FN_RESULT(%qD, {", m_fndecl);
for (unsigned i = 0; i < m_num_inputs; i++)
{
if (i > 0)
pp_string (pp, ", ");
dump_input (pp, i, m_input_arr[i], simple);
}
pp_string (pp, "})");
}
}
/* Subroutine of const_fn_result_svalue::dump_to_pp. */
void
const_fn_result_svalue::dump_input (pretty_printer *pp,
unsigned input_idx,
const svalue *sval,
bool simple) const
{
pp_printf (pp, "arg%i: ", input_idx);
sval->dump_to_pp (pp, simple);
}
/* Implementation of svalue::accept vfunc for const_fn_result_svalue. */
void
const_fn_result_svalue::accept (visitor *v) const
{
for (unsigned i = 0; i < m_num_inputs; i++)
m_input_arr[i]->accept (v);
v->visit_const_fn_result_svalue (this);
}
} // namespace ana
#endif /* #if ENABLE_ANALYZER */
|