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
|
/* Consolidation of svalues and regions.
Copyright (C) 2020-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
#define INCLUDE_VECTOR
#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 "ordered-hash-map.h"
#include "options.h"
#include "analyzer/supergraph.h"
#include "sbitmap.h"
#include "analyzer/call-string.h"
#include "analyzer/program-point.h"
#include "analyzer/store.h"
#include "analyzer/region-model.h"
#include "analyzer/constraint-manager.h"
#if ENABLE_ANALYZER
namespace ana {
/* class region_model_manager. */
/* region_model_manager's ctor. */
region_model_manager::region_model_manager (logger *logger)
: m_logger (logger),
m_next_symbol_id (0),
m_empty_call_string (),
m_root_region (alloc_symbol_id ()),
m_stack_region (alloc_symbol_id (), &m_root_region),
m_heap_region (alloc_symbol_id (), &m_root_region),
m_unknown_NULL (NULL),
m_checking_feasibility (false),
m_max_complexity (0, 0),
m_code_region (alloc_symbol_id (), &m_root_region),
m_fndecls_map (), m_labels_map (),
m_globals_region (alloc_symbol_id (), &m_root_region),
m_globals_map (),
m_thread_local_region (alloc_symbol_id (), &m_root_region),
m_errno_region (alloc_symbol_id (), &m_thread_local_region),
m_store_mgr (this),
m_range_mgr (new bounded_ranges_manager ()),
m_known_fn_mgr (logger)
{
}
/* region_model_manager's dtor. Delete all of the managed svalues
and regions. */
region_model_manager::~region_model_manager ()
{
/* Delete consolidated svalues. */
for (constants_map_t::iterator iter = m_constants_map.begin ();
iter != m_constants_map.end (); ++iter)
delete (*iter).second;
for (unknowns_map_t::iterator iter = m_unknowns_map.begin ();
iter != m_unknowns_map.end (); ++iter)
delete (*iter).second;
delete m_unknown_NULL;
for (poisoned_values_map_t::iterator iter = m_poisoned_values_map.begin ();
iter != m_poisoned_values_map.end (); ++iter)
delete (*iter).second;
for (setjmp_values_map_t::iterator iter = m_setjmp_values_map.begin ();
iter != m_setjmp_values_map.end (); ++iter)
delete (*iter).second;
for (initial_values_map_t::iterator iter = m_initial_values_map.begin ();
iter != m_initial_values_map.end (); ++iter)
delete (*iter).second;
for (pointer_values_map_t::iterator iter = m_pointer_values_map.begin ();
iter != m_pointer_values_map.end (); ++iter)
delete (*iter).second;
for (unaryop_values_map_t::iterator iter = m_unaryop_values_map.begin ();
iter != m_unaryop_values_map.end (); ++iter)
delete (*iter).second;
for (binop_values_map_t::iterator iter = m_binop_values_map.begin ();
iter != m_binop_values_map.end (); ++iter)
delete (*iter).second;
for (sub_values_map_t::iterator iter = m_sub_values_map.begin ();
iter != m_sub_values_map.end (); ++iter)
delete (*iter).second;
for (auto iter : m_repeated_values_map)
delete iter.second;
for (auto iter : m_bits_within_values_map)
delete iter.second;
for (unmergeable_values_map_t::iterator iter
= m_unmergeable_values_map.begin ();
iter != m_unmergeable_values_map.end (); ++iter)
delete (*iter).second;
for (widening_values_map_t::iterator iter = m_widening_values_map.begin ();
iter != m_widening_values_map.end (); ++iter)
delete (*iter).second;
for (compound_values_map_t::iterator iter = m_compound_values_map.begin ();
iter != m_compound_values_map.end (); ++iter)
delete (*iter).second;
for (conjured_values_map_t::iterator iter = m_conjured_values_map.begin ();
iter != m_conjured_values_map.end (); ++iter)
delete (*iter).second;
for (auto iter : m_asm_output_values_map)
delete iter.second;
for (auto iter : m_const_fn_result_values_map)
delete iter.second;
/* Delete consolidated regions. */
for (fndecls_map_t::iterator iter = m_fndecls_map.begin ();
iter != m_fndecls_map.end (); ++iter)
delete (*iter).second;
for (labels_map_t::iterator iter = m_labels_map.begin ();
iter != m_labels_map.end (); ++iter)
delete (*iter).second;
for (globals_map_t::iterator iter = m_globals_map.begin ();
iter != m_globals_map.end (); ++iter)
delete (*iter).second;
for (string_map_t::iterator iter = m_string_map.begin ();
iter != m_string_map.end (); ++iter)
delete (*iter).second;
delete m_range_mgr;
}
/* Return true if C exceeds the complexity limit for svalues. */
bool
region_model_manager::too_complex_p (const complexity &c) const
{
if (c.m_max_depth > (unsigned)param_analyzer_max_svalue_depth)
return true;
return false;
}
/* If SVAL exceeds the complexity limit for svalues, delete it
and return true.
Otherwise update m_max_complexity and return false. */
bool
region_model_manager::reject_if_too_complex (svalue *sval)
{
if (m_checking_feasibility)
return false;
const complexity &c = sval->get_complexity ();
if (!too_complex_p (c))
{
if (m_max_complexity.m_num_nodes < c.m_num_nodes)
m_max_complexity.m_num_nodes = c.m_num_nodes;
if (m_max_complexity.m_max_depth < c.m_max_depth)
m_max_complexity.m_max_depth = c.m_max_depth;
return false;
}
pretty_printer pp;
pp_format_decoder (&pp) = default_tree_printer;
sval->dump_to_pp (&pp, true);
if (warning_at (input_location, OPT_Wanalyzer_symbol_too_complex,
"symbol too complicated: %qs",
pp_formatted_text (&pp)))
inform (input_location,
"max_depth %i exceeds --param=analyzer-max-svalue-depth=%i",
c.m_max_depth, param_analyzer_max_svalue_depth);
delete sval;
return true;
}
/* Macro for imposing a complexity limit on svalues, for use within
region_model_manager member functions.
If SVAL exceeds the complexity limit, delete it and return an UNKNOWN
value of the same type.
Otherwise update m_max_complexity and carry on. */
#define RETURN_UNKNOWN_IF_TOO_COMPLEX(SVAL) \
do { \
svalue *sval_ = (SVAL); \
tree type_ = sval_->get_type (); \
if (reject_if_too_complex (sval_)) \
return get_or_create_unknown_svalue (type_); \
} while (0)
/* svalue consolidation. */
/* Return the svalue * for a constant_svalue for CST_EXPR,
creating it if necessary.
The constant_svalue instances are reused, based on pointer equality
of trees */
const svalue *
region_model_manager::get_or_create_constant_svalue (tree type, tree cst_expr)
{
gcc_assert (cst_expr);
gcc_assert (CONSTANT_CLASS_P (cst_expr));
gcc_assert (type == TREE_TYPE (cst_expr) || type == NULL_TREE);
constant_svalue::key_t key (type, cst_expr);
constant_svalue **slot = m_constants_map.get (key);
if (slot)
return *slot;
constant_svalue *cst_sval
= new constant_svalue (alloc_symbol_id (), type, cst_expr);
RETURN_UNKNOWN_IF_TOO_COMPLEX (cst_sval);
m_constants_map.put (key, cst_sval);
return cst_sval;
}
const svalue *
region_model_manager::get_or_create_constant_svalue (tree cst_expr)
{
return get_or_create_constant_svalue (TREE_TYPE (cst_expr), cst_expr);
}
/* Return the svalue * for a constant_svalue for the INTEGER_CST
for VAL of type TYPE, creating it if necessary. */
const svalue *
region_model_manager::get_or_create_int_cst (tree type,
const poly_wide_int_ref &cst)
{
tree effective_type = type;
if (!type)
effective_type = ptrdiff_type_node;
gcc_assert (INTEGRAL_TYPE_P (effective_type)
|| POINTER_TYPE_P (effective_type));
tree tree_cst = wide_int_to_tree (effective_type, cst);
return get_or_create_constant_svalue (type, tree_cst);
}
/* Return the svalue * for the constant_svalue for the NULL pointer
of POINTER_TYPE, creating it if necessary. */
const svalue *
region_model_manager::get_or_create_null_ptr (tree pointer_type)
{
gcc_assert (pointer_type);
gcc_assert (POINTER_TYPE_P (pointer_type));
return get_or_create_int_cst (pointer_type, 0);
}
/* Return the svalue * for a unknown_svalue for TYPE (which can be NULL),
creating it if necessary.
The unknown_svalue instances are reused, based on pointer equality
of the types */
const svalue *
region_model_manager::get_or_create_unknown_svalue (tree type)
{
/* Don't create unknown values when doing feasibility testing;
instead, create a unique svalue. */
if (m_checking_feasibility)
return create_unique_svalue (type);
/* Special-case NULL, so that the hash_map can use NULL as the
"empty" value. */
if (type == NULL_TREE)
{
if (!m_unknown_NULL)
m_unknown_NULL = new unknown_svalue (alloc_symbol_id (), type);
return m_unknown_NULL;
}
unknown_svalue **slot = m_unknowns_map.get (type);
if (slot)
return *slot;
unknown_svalue *sval = new unknown_svalue (alloc_symbol_id (), type);
m_unknowns_map.put (type, sval);
return sval;
}
/* Return a freshly-allocated svalue of TYPE, owned by this manager. */
const svalue *
region_model_manager::create_unique_svalue (tree type)
{
svalue *sval = new placeholder_svalue (alloc_symbol_id (), type, "unique");
m_managed_dynamic_svalues.safe_push (sval);
return sval;
}
/* Return the svalue * for the initial value of REG, creating it if
necessary. */
const svalue *
region_model_manager::get_or_create_initial_value (const region *reg,
bool check_poisoned)
{
if (!reg->can_have_initial_svalue_p () && check_poisoned)
return get_or_create_poisoned_svalue (POISON_KIND_UNINIT,
reg->get_type ());
/* The initial value of a cast is a cast of the initial value. */
if (const cast_region *cast_reg = reg->dyn_cast_cast_region ())
{
const region *original_reg = cast_reg->get_original_region ();
return get_or_create_cast (cast_reg->get_type (),
get_or_create_initial_value (original_reg));
}
/* Simplify:
INIT_VAL(ELEMENT_REG(STRING_REG), CONSTANT_SVAL)
to:
CONSTANT_SVAL(STRING[N]). */
if (const element_region *element_reg = reg->dyn_cast_element_region ())
if (tree cst_idx = element_reg->get_index ()->maybe_get_constant ())
if (const string_region *string_reg
= element_reg->get_parent_region ()->dyn_cast_string_region ())
if (tree_fits_shwi_p (cst_idx))
{
HOST_WIDE_INT idx = tree_to_shwi (cst_idx);
tree string_cst = string_reg->get_string_cst ();
if (idx >= 0 && idx <= TREE_STRING_LENGTH (string_cst))
{
int ch = TREE_STRING_POINTER (string_cst)[idx];
return get_or_create_int_cst (reg->get_type (), ch);
}
}
/* INIT_VAL (*UNKNOWN_PTR) -> UNKNOWN_VAL. */
if (reg->symbolic_for_unknown_ptr_p ())
return get_or_create_unknown_svalue (reg->get_type ());
if (initial_svalue **slot = m_initial_values_map.get (reg))
return *slot;
initial_svalue *initial_sval
= new initial_svalue (alloc_symbol_id (), reg->get_type (), reg);
RETURN_UNKNOWN_IF_TOO_COMPLEX (initial_sval);
m_initial_values_map.put (reg, initial_sval);
return initial_sval;
}
/* Return the svalue * for R using type TYPE, creating it if
necessary. */
const svalue *
region_model_manager::get_or_create_setjmp_svalue (const setjmp_record &r,
tree type)
{
setjmp_svalue::key_t key (r, type);
if (setjmp_svalue **slot = m_setjmp_values_map.get (key))
return *slot;
setjmp_svalue *setjmp_sval = new setjmp_svalue (r, alloc_symbol_id (), type);
RETURN_UNKNOWN_IF_TOO_COMPLEX (setjmp_sval);
m_setjmp_values_map.put (key, setjmp_sval);
return setjmp_sval;
}
/* Return the svalue * for a poisoned value of KIND and TYPE, creating it if
necessary. */
const svalue *
region_model_manager::get_or_create_poisoned_svalue (enum poison_kind kind,
tree type)
{
poisoned_svalue::key_t key (kind, type);
if (poisoned_svalue **slot = m_poisoned_values_map.get (key))
return *slot;
poisoned_svalue *poisoned_sval
= new poisoned_svalue (kind, alloc_symbol_id (), type);
RETURN_UNKNOWN_IF_TOO_COMPLEX (poisoned_sval);
m_poisoned_values_map.put (key, poisoned_sval);
return poisoned_sval;
}
/* Return the svalue * for a pointer to POINTEE of type PTR_TYPE,
creating it if necessary. */
const svalue *
region_model_manager::get_ptr_svalue (tree ptr_type, const region *pointee)
{
/* If this is a symbolic region from dereferencing a pointer, and the types
match, then return the original pointer. */
if (const symbolic_region *sym_reg = pointee->dyn_cast_symbolic_region ())
if (ptr_type == sym_reg->get_pointer ()->get_type ())
return sym_reg->get_pointer ();
region_svalue::key_t key (ptr_type, pointee);
if (region_svalue **slot = m_pointer_values_map.get (key))
return *slot;
region_svalue *sval
= new region_svalue (alloc_symbol_id (), ptr_type, pointee);
RETURN_UNKNOWN_IF_TOO_COMPLEX (sval);
m_pointer_values_map.put (key, sval);
return sval;
}
/* Subroutine of region_model_manager::get_or_create_unaryop.
Attempt to fold the inputs and return a simpler svalue *.
Otherwise, return NULL. */
const svalue *
region_model_manager::maybe_fold_unaryop (tree type, enum tree_code op,
const svalue *arg)
{
/* Ops on "unknown" are also unknown. */
if (arg->get_kind () == SK_UNKNOWN)
return get_or_create_unknown_svalue (type);
/* Likewise for "poisoned". */
else if (const poisoned_svalue *poisoned_sval
= arg->dyn_cast_poisoned_svalue ())
return get_or_create_poisoned_svalue (poisoned_sval->get_poison_kind (),
type);
gcc_assert (arg->can_have_associated_state_p ());
switch (op)
{
default: break;
case VIEW_CONVERT_EXPR:
case NOP_EXPR:
{
if (!type)
return nullptr;
/* Handle redundant casts. */
if (arg->get_type ()
&& useless_type_conversion_p (arg->get_type (), type))
return arg;
/* Fold "cast<TYPE> (cast <INNER_TYPE> (innermost_arg))
=> "cast<TYPE> (innermost_arg)",
unless INNER_TYPE is narrower than TYPE. */
if (const svalue *innermost_arg = arg->maybe_undo_cast ())
{
if (tree inner_type = arg->get_type ())
if (TYPE_SIZE (type)
&& TYPE_SIZE (inner_type)
&& (fold_binary (LE_EXPR, boolean_type_node,
TYPE_SIZE (type), TYPE_SIZE (inner_type))
== boolean_true_node))
return maybe_fold_unaryop (type, op, innermost_arg);
}
/* Avoid creating symbolic regions for pointer casts by
simplifying (T*)(®ION) to ((T*)®ION). */
if (const region_svalue *region_sval = arg->dyn_cast_region_svalue ())
if (POINTER_TYPE_P (type)
&& region_sval->get_type ()
&& POINTER_TYPE_P (region_sval->get_type ()))
return get_ptr_svalue (type, region_sval->get_pointee ());
/* Casting all zeroes should give all zeroes. */
if (type
&& arg->all_zeroes_p ()
&& (INTEGRAL_TYPE_P (type) || POINTER_TYPE_P (type)))
return get_or_create_int_cst (type, 0);
}
break;
case TRUTH_NOT_EXPR:
{
/* Invert comparisons e.g. "!(x == y)" => "x != y". */
if (const binop_svalue *binop = arg->dyn_cast_binop_svalue ())
if (TREE_CODE_CLASS (binop->get_op ()) == tcc_comparison)
{
enum tree_code inv_op
= invert_tree_comparison (binop->get_op (),
HONOR_NANS (binop->get_type ()));
if (inv_op != ERROR_MARK)
return get_or_create_binop (binop->get_type (), inv_op,
binop->get_arg0 (),
binop->get_arg1 ());
}
}
break;
case NEGATE_EXPR:
{
/* -(-(VAL)) is VAL, for integer types. */
if (const unaryop_svalue *unaryop = arg->dyn_cast_unaryop_svalue ())
if (unaryop->get_op () == NEGATE_EXPR
&& type == unaryop->get_type ()
&& type
&& INTEGRAL_TYPE_P (type))
return unaryop->get_arg ();
}
break;
}
/* Constants. */
if (tree cst = arg->maybe_get_constant ())
if (tree result = fold_unary (op, type, cst))
{
if (CONSTANT_CLASS_P (result))
return get_or_create_constant_svalue (result);
/* fold_unary can return casts of constants; try to handle them. */
if (op != NOP_EXPR
&& type
&& TREE_CODE (result) == NOP_EXPR
&& CONSTANT_CLASS_P (TREE_OPERAND (result, 0)))
{
const svalue *inner_cst
= get_or_create_constant_svalue (TREE_OPERAND (result, 0));
return get_or_create_cast (type,
get_or_create_cast (TREE_TYPE (result),
inner_cst));
}
}
return NULL;
}
/* Return the svalue * for an unary operation OP on ARG with a result of
type TYPE, creating it if necessary. */
const svalue *
region_model_manager::get_or_create_unaryop (tree type, enum tree_code op,
const svalue *arg)
{
if (const svalue *folded = maybe_fold_unaryop (type, op, arg))
return folded;
unaryop_svalue::key_t key (type, op, arg);
if (unaryop_svalue **slot = m_unaryop_values_map.get (key))
return *slot;
unaryop_svalue *unaryop_sval
= new unaryop_svalue (alloc_symbol_id (), type, op, arg);
RETURN_UNKNOWN_IF_TOO_COMPLEX (unaryop_sval);
m_unaryop_values_map.put (key, unaryop_sval);
return unaryop_sval;
}
/* Get a tree code for a cast to DST_TYPE from SRC_TYPE.
Use NOP_EXPR if possible (e.g. to help fold_unary convert casts
of 0 to (T*) to simple pointer constants), but use FIX_TRUNC_EXPR
and VIEW_CONVERT_EXPR for cases that fold_unary would otherwise crash
on. */
static enum tree_code
get_code_for_cast (tree dst_type, tree src_type)
{
if (!dst_type)
return NOP_EXPR;
if (!src_type)
return NOP_EXPR;
if (SCALAR_FLOAT_TYPE_P (src_type))
{
if (TREE_CODE (dst_type) == INTEGER_TYPE)
return FIX_TRUNC_EXPR;
else
return VIEW_CONVERT_EXPR;
}
return NOP_EXPR;
}
/* Return the svalue * for a cast of ARG to type TYPE, creating it
if necessary. */
const svalue *
region_model_manager::get_or_create_cast (tree type, const svalue *arg)
{
/* No-op if the types are the same. */
if (type == arg->get_type ())
return arg;
/* Don't attempt to handle casts involving vector types for now. */
if (type)
if (VECTOR_TYPE_P (type)
|| (arg->get_type ()
&& VECTOR_TYPE_P (arg->get_type ())))
return get_or_create_unknown_svalue (type);
enum tree_code op = get_code_for_cast (type, arg->get_type ());
return get_or_create_unaryop (type, op, arg);
}
/* Subroutine of region_model_manager::maybe_fold_binop for handling
(TYPE)(COMPOUND_SVAL BIT_AND_EXPR CST) that may have been generated by
optimize_bit_field_compare, where CST is from ARG1.
Support masking out bits from a compound_svalue for comparing a bitfield
against a value, as generated by optimize_bit_field_compare for
BITFIELD == VALUE.
If COMPOUND_SVAL has a value for the appropriate bits, return it,
shifted accordingly.
Otherwise return NULL. */
const svalue *
region_model_manager::
maybe_undo_optimize_bit_field_compare (tree type,
const compound_svalue *compound_sval,
tree cst,
const svalue *arg1)
{
if (!type)
return nullptr;
if (!INTEGRAL_TYPE_P (type))
return NULL;
const binding_map &map = compound_sval->get_map ();
unsigned HOST_WIDE_INT mask = TREE_INT_CST_LOW (cst);
/* If "mask" is a contiguous range of set bits, see if the
compound_sval has a value for those bits. */
bit_range bits (0, 0);
if (!bit_range::from_mask (mask, &bits))
return NULL;
bit_range bound_bits (bits);
if (BYTES_BIG_ENDIAN)
bound_bits = bit_range (BITS_PER_UNIT - bits.get_next_bit_offset (),
bits.m_size_in_bits);
const concrete_binding *conc
= get_store_manager ()->get_concrete_binding (bound_bits);
const svalue *sval = map.get (conc);
if (!sval)
return NULL;
/* We have a value;
shift it by the correct number of bits. */
const svalue *lhs = get_or_create_cast (type, sval);
HOST_WIDE_INT bit_offset = bits.get_start_bit_offset ().to_shwi ();
const svalue *shift_sval = get_or_create_int_cst (type, bit_offset);
const svalue *shifted_sval = get_or_create_binop (type, LSHIFT_EXPR,
lhs, shift_sval);
/* Reapply the mask (needed for negative
signed bitfields). */
return get_or_create_binop (type, BIT_AND_EXPR,
shifted_sval, arg1);
}
/* Subroutine of region_model_manager::get_or_create_binop.
Attempt to fold the inputs and return a simpler svalue *.
Otherwise, return NULL. */
const svalue *
region_model_manager::maybe_fold_binop (tree type, enum tree_code op,
const svalue *arg0,
const svalue *arg1)
{
tree cst0 = arg0->maybe_get_constant ();
tree cst1 = arg1->maybe_get_constant ();
/* (CST OP CST). */
if (cst0 && cst1)
{
if (type)
{
if (tree result = fold_binary (op, type, cst0, cst1))
if (CONSTANT_CLASS_P (result))
return get_or_create_constant_svalue (result);
}
else
{
if (tree result = int_const_binop (op, cst0, cst1, -1))
return get_or_create_constant_svalue (NULL_TREE, result);
}
}
if ((type && FLOAT_TYPE_P (type))
|| (arg0->get_type () && FLOAT_TYPE_P (arg0->get_type ()))
|| (arg1->get_type () && FLOAT_TYPE_P (arg1->get_type ())))
return NULL;
switch (op)
{
default:
break;
case POINTER_PLUS_EXPR:
case PLUS_EXPR:
/* (VAL + 0) -> VAL. */
if (cst1 && zerop (cst1))
return get_or_create_cast (type, arg0);
break;
case MINUS_EXPR:
/* (VAL - 0) -> VAL. */
if (cst1 && zerop (cst1))
return get_or_create_cast (type, arg0);
/* (0 - VAL) -> -VAL. */
if (cst0 && zerop (cst0))
return get_or_create_unaryop (type, NEGATE_EXPR, arg1);
/* (X + Y) - X -> Y. */
if (const binop_svalue *binop = arg0->dyn_cast_binop_svalue ())
if (binop->get_op () == PLUS_EXPR)
if (binop->get_arg0 () == arg1)
return get_or_create_cast (type, binop->get_arg1 ());
break;
case MULT_EXPR:
/* (VAL * 0). */
if (cst1
&& zerop (cst1)
&& (type == NULL_TREE || INTEGRAL_TYPE_P (type)))
return get_or_create_int_cst (type, 0);
/* (VAL * 1) -> VAL. */
if (cst1 && integer_onep (cst1))
return get_or_create_cast (type, arg0);
break;
case BIT_AND_EXPR:
if (cst1)
{
if (zerop (cst1)
&& (type == NULL_TREE || INTEGRAL_TYPE_P (type)))
/* "(ARG0 & 0)" -> "0". */
return get_or_create_int_cst (type, 0);
if (const compound_svalue *compound_sval
= arg0->dyn_cast_compound_svalue ())
if (const svalue *sval
= maybe_undo_optimize_bit_field_compare (type,
compound_sval,
cst1, arg1))
return sval;
}
if (arg0->get_type () == boolean_type_node
&& arg1->get_type () == boolean_type_node)
{
/* If the LHS are both _Bool, then... */
/* ..."(1 & x) -> x". */
if (cst0 && !zerop (cst0))
return get_or_create_cast (type, arg1);
/* ..."(x & 1) -> x". */
if (cst1 && !zerop (cst1))
return get_or_create_cast (type, arg0);
/* ..."(0 & x) -> 0". */
if (cst0 && zerop (cst0))
return get_or_create_int_cst (type, 0);
/* ..."(x & 0) -> 0". */
if (cst1 && zerop (cst1))
return get_or_create_int_cst (type, 0);
}
break;
case BIT_IOR_EXPR:
if (arg0->get_type () == boolean_type_node
&& arg1->get_type () == boolean_type_node)
{
/* If the LHS are both _Bool, then... */
/* ..."(1 | x) -> 1". */
if (cst0 && !zerop (cst0))
return get_or_create_int_cst (type, 1);
/* ..."(x | 1) -> 1". */
if (cst1 && !zerop (cst1))
return get_or_create_int_cst (type, 1);
/* ..."(0 | x) -> x". */
if (cst0 && zerop (cst0))
return get_or_create_cast (type, arg1);
/* ..."(x | 0) -> x". */
if (cst1 && zerop (cst1))
return get_or_create_cast (type, arg0);
}
break;
case TRUTH_ANDIF_EXPR:
case TRUTH_AND_EXPR:
if (cst1)
{
if (zerop (cst1) && INTEGRAL_TYPE_P (type))
/* "(ARG0 && 0)" -> "0". */
return get_or_create_constant_svalue (build_int_cst (type, 0));
else
/* "(ARG0 && nonzero-cst)" -> "ARG0". */
return get_or_create_cast (type, arg0);
}
break;
case TRUTH_ORIF_EXPR:
case TRUTH_OR_EXPR:
if (cst1)
{
if (zerop (cst1))
/* "(ARG0 || 0)" -> "ARG0". */
return get_or_create_cast (type, arg0);
else
/* "(ARG0 && nonzero-cst)" -> "nonzero-cst". */
return get_or_create_cast (type, arg1);
}
break;
}
/* For associative ops, fold "(X op CST_A) op CST_B)" to
"X op (CST_A op CST_B)". */
if (cst1 && associative_tree_code (op))
if (const binop_svalue *binop = arg0->dyn_cast_binop_svalue ())
if (binop->get_op () == op
&& binop->get_arg1 ()->maybe_get_constant ())
return get_or_create_binop
(type, op, binop->get_arg0 (),
get_or_create_binop (type, op,
binop->get_arg1 (), arg1));
/* associative_tree_code is false for POINTER_PLUS_EXPR, but we
can fold:
"(PTR ptr+ CST_A) ptr+ CST_B)" to "PTR ptr+ (CST_A ptr+ CST_B)"
e.g. in data-model-1.c: test_4c. */
if (cst1 && op == POINTER_PLUS_EXPR)
if (const binop_svalue *binop = arg0->dyn_cast_binop_svalue ())
if (binop->get_op () == POINTER_PLUS_EXPR)
if (binop->get_arg1 ()->maybe_get_constant ())
return get_or_create_binop
(type, op, binop->get_arg0 (),
get_or_create_binop (size_type_node, op,
binop->get_arg1 (), arg1));
/* Distribute multiplication by a constant through addition/subtraction:
(X + Y) * CST => (X * CST) + (Y * CST). */
if (cst1 && op == MULT_EXPR)
if (const binop_svalue *binop = arg0->dyn_cast_binop_svalue ())
if (binop->get_op () == PLUS_EXPR
|| binop->get_op () == MINUS_EXPR)
{
return get_or_create_binop
(type, binop->get_op (),
get_or_create_binop (type, op,
binop->get_arg0 (), arg1),
get_or_create_binop (type, op,
binop->get_arg1 (), arg1));
}
/* Typeless operations, assumed to be effectively arbitrary sized
integers following normal arithmetic rules. */
if (!type)
switch (op)
{
default:
break;
case MINUS_EXPR:
{
/* (X - X) -> 0. */
if (arg0 == arg1)
return get_or_create_int_cst (type, 0);
/* (X + A) - (A + B) -> (A - B). */
if (const binop_svalue *binop0 = arg0->dyn_cast_binop_svalue ())
if (const binop_svalue *binop1 = arg1->dyn_cast_binop_svalue ())
if (binop0->get_op () == PLUS_EXPR
&& binop1->get_op () == PLUS_EXPR
&& binop0->get_arg0 () == binop1->get_arg0 ())
return get_or_create_binop (NULL_TREE, op,
binop0->get_arg1 (),
binop1->get_arg1 ());
}
break;
case EXACT_DIV_EXPR:
{
if (const unaryop_svalue *unaryop0 = arg0->dyn_cast_unaryop_svalue ())
{
if (unaryop0->get_op () == NOP_EXPR)
if (const svalue *sval = maybe_fold_binop (NULL_TREE, op,
unaryop0->get_arg (),
arg1))
return sval;
}
if (const binop_svalue *binop0 = arg0->dyn_cast_binop_svalue ())
{
switch (binop0->get_op ())
{
default:
break;
case PLUS_EXPR:
case MINUS_EXPR:
/* (A op B) / C -> (A / C) op (B / C). */
{
if (const svalue *op_on_a
= maybe_fold_binop (NULL_TREE, op,
binop0->get_arg0 (), arg1))
if (const svalue *op_on_b
= maybe_fold_binop (NULL_TREE, op,
binop0->get_arg1 (), arg1))
return get_or_create_binop (NULL_TREE,
binop0->get_op (),
op_on_a, op_on_b);
}
break;
case MULT_EXPR:
/* (A * B) / C -> A * (B / C) if C is a divisor of B.
In particular, this should also handle the case
(A * B) / B -> A. */
if (const svalue *b_div_c
= maybe_fold_binop (NULL_TREE, op,
binop0->get_arg1 (), arg1))
return get_or_create_binop (NULL_TREE, binop0->get_op (),
binop0->get_arg0 (), b_div_c);
}
}
}
break;
}
/* etc. */
return NULL;
}
/* Return the svalue * for an binary operation OP on ARG0 and ARG1
with a result of type TYPE, creating it if necessary. */
const svalue *
region_model_manager::get_or_create_binop (tree type, enum tree_code op,
const svalue *arg0,
const svalue *arg1)
{
/* For commutative ops, put any constant on the RHS. */
if (arg0->maybe_get_constant () && commutative_tree_code (op))
std::swap (arg0, arg1);
if (const svalue *folded = maybe_fold_binop (type, op, arg0, arg1))
return folded;
/* Ops on "unknown"/"poisoned" are unknown (unless we were able to fold
it via an identity in maybe_fold_binop). */
if (!arg0->can_have_associated_state_p ()
|| !arg1->can_have_associated_state_p ())
return get_or_create_unknown_svalue (type);
binop_svalue::key_t key (type, op, arg0, arg1);
if (binop_svalue **slot = m_binop_values_map.get (key))
return *slot;
binop_svalue *binop_sval
= new binop_svalue (alloc_symbol_id (), type, op, arg0, arg1);
RETURN_UNKNOWN_IF_TOO_COMPLEX (binop_sval);
m_binop_values_map.put (key, binop_sval);
return binop_sval;
}
/* Subroutine of region_model_manager::get_or_create_sub_svalue.
Return a folded svalue, or NULL. */
const svalue *
region_model_manager::maybe_fold_sub_svalue (tree type,
const svalue *parent_svalue,
const region *subregion)
{
/* Subvalues of "unknown"/"poisoned" are unknown. */
if (!parent_svalue->can_have_associated_state_p ())
return get_or_create_unknown_svalue (type);
/* If we have a subregion of a zero-fill, it's zero. */
if (const unaryop_svalue *unary
= parent_svalue->dyn_cast_unaryop_svalue ())
{
if (unary->get_op () == NOP_EXPR
|| unary->get_op () == VIEW_CONVERT_EXPR)
if (tree cst = unary->get_arg ()->maybe_get_constant ())
if (zerop (cst) && type)
{
const svalue *cst_sval
= get_or_create_constant_svalue (cst);
return get_or_create_cast (type, cst_sval);
}
}
/* Handle getting individual chars from a STRING_CST. */
if (tree cst = parent_svalue->maybe_get_constant ())
if (TREE_CODE (cst) == STRING_CST)
{
/* If we have a concrete 1-byte access within the parent region... */
byte_range subregion_bytes (0, 0);
if (subregion->get_relative_concrete_byte_range (&subregion_bytes)
&& subregion_bytes.m_size_in_bytes == 1
&& type)
{
/* ...then attempt to get that char from the STRING_CST. */
HOST_WIDE_INT hwi_start_byte
= subregion_bytes.m_start_byte_offset.to_shwi ();
tree cst_idx
= build_int_cst_type (size_type_node, hwi_start_byte);
if (const svalue *char_sval
= maybe_get_char_from_string_cst (cst, cst_idx))
return get_or_create_cast (type, char_sval);
}
}
if (const initial_svalue *init_sval
= parent_svalue->dyn_cast_initial_svalue ())
{
/* SUB(INIT(r)).FIELD -> INIT(r.FIELD)
i.e.
Subvalue(InitialValue(R1), FieldRegion(R2, F))
-> InitialValue(FieldRegion(R1, F)). */
if (const field_region *field_reg = subregion->dyn_cast_field_region ())
{
const region *field_reg_new
= get_field_region (init_sval->get_region (),
field_reg->get_field ());
return get_or_create_initial_value (field_reg_new);
}
/* SUB(INIT(r)[ELEMENT] -> INIT(e[ELEMENT])
i.e.
Subvalue(InitialValue(R1), ElementRegion(R2, IDX))
-> InitialValue(ElementRegion(R1, IDX)). */
if (const element_region *element_reg = subregion->dyn_cast_element_region ())
{
const region *element_reg_new
= get_element_region (init_sval->get_region (),
element_reg->get_type (),
element_reg->get_index ());
return get_or_create_initial_value (element_reg_new);
}
}
if (const repeated_svalue *repeated_sval
= parent_svalue->dyn_cast_repeated_svalue ())
if (type)
return get_or_create_cast (type, repeated_sval->get_inner_svalue ());
return NULL;
}
/* Return the svalue * for extracting a subvalue of type TYPE from
PARENT_SVALUE based on SUBREGION, creating it if necessary. */
const svalue *
region_model_manager::get_or_create_sub_svalue (tree type,
const svalue *parent_svalue,
const region *subregion)
{
if (const svalue *folded
= maybe_fold_sub_svalue (type, parent_svalue, subregion))
return folded;
sub_svalue::key_t key (type, parent_svalue, subregion);
if (sub_svalue **slot = m_sub_values_map.get (key))
return *slot;
sub_svalue *sub_sval
= new sub_svalue (alloc_symbol_id (), type, parent_svalue, subregion);
RETURN_UNKNOWN_IF_TOO_COMPLEX (sub_sval);
m_sub_values_map.put (key, sub_sval);
return sub_sval;
}
/* Subroutine of region_model_manager::get_or_create_repeated_svalue.
Return a folded svalue, or NULL. */
const svalue *
region_model_manager::maybe_fold_repeated_svalue (tree type,
const svalue *outer_size,
const svalue *inner_svalue)
{
/* Repeated "unknown"/"poisoned" is unknown. */
if (!outer_size->can_have_associated_state_p ()
|| !inner_svalue->can_have_associated_state_p ())
return get_or_create_unknown_svalue (type);
/* If INNER_SVALUE is the same size as OUTER_SIZE,
turn into simply a cast. */
if (tree cst_outer_num_bytes = outer_size->maybe_get_constant ())
{
HOST_WIDE_INT num_bytes_inner_svalue
= int_size_in_bytes (inner_svalue->get_type ());
if (num_bytes_inner_svalue != -1)
if (num_bytes_inner_svalue
== (HOST_WIDE_INT)tree_to_uhwi (cst_outer_num_bytes))
{
if (type)
return get_or_create_cast (type, inner_svalue);
else
return inner_svalue;
}
}
/* Handle zero-fill of a specific type. */
if (tree cst = inner_svalue->maybe_get_constant ())
if (zerop (cst) && type)
return get_or_create_cast (type, inner_svalue);
return NULL;
}
/* Return the svalue * of type TYPE in which INNER_SVALUE is repeated
enough times to be of size OUTER_SIZE, creating it if necessary.
e.g. for filling buffers with a constant value. */
const svalue *
region_model_manager::get_or_create_repeated_svalue (tree type,
const svalue *outer_size,
const svalue *inner_svalue)
{
if (const svalue *folded
= maybe_fold_repeated_svalue (type, outer_size, inner_svalue))
return folded;
repeated_svalue::key_t key (type, outer_size, inner_svalue);
if (repeated_svalue **slot = m_repeated_values_map.get (key))
return *slot;
repeated_svalue *repeated_sval
= new repeated_svalue (alloc_symbol_id (), type, outer_size, inner_svalue);
RETURN_UNKNOWN_IF_TOO_COMPLEX (repeated_sval);
m_repeated_values_map.put (key, repeated_sval);
return repeated_sval;
}
/* Attempt to get the bit_range for FIELD within a RECORD_TYPE.
Return true and write the result to OUT if successful.
Return false otherwise. */
static bool
get_bit_range_for_field (tree field, bit_range *out)
{
bit_size_t bit_size;
if (!int_size_in_bits (TREE_TYPE (field), &bit_size))
return false;
int field_bit_offset = int_bit_position (field);
*out = bit_range (field_bit_offset, bit_size);
return true;
}
/* Attempt to get the byte_range for FIELD within a RECORD_TYPE.
Return true and write the result to OUT if successful.
Return false otherwise. */
static bool
get_byte_range_for_field (tree field, byte_range *out)
{
bit_range field_bits (0, 0);
if (!get_bit_range_for_field (field, &field_bits))
return false;
return field_bits.as_byte_range (out);
}
/* Attempt to determine if there is a specific field within RECORD_TYPE
at BYTES. If so, return it, and write the location of BYTES relative
to the field to *OUT_RANGE_WITHIN_FIELD.
Otherwise, return NULL_TREE.
For example, given:
struct foo { uint32 a; uint32; b};
and
bytes = {bytes 6-7} (of foo)
we have bytes 3-4 of field b. */
static tree
get_field_at_byte_range (tree record_type, const byte_range &bytes,
byte_range *out_range_within_field)
{
bit_offset_t bit_offset = bytes.m_start_byte_offset * BITS_PER_UNIT;
tree field = get_field_at_bit_offset (record_type, bit_offset);
if (!field)
return NULL_TREE;
byte_range field_bytes (0,0);
if (!get_byte_range_for_field (field, &field_bytes))
return NULL_TREE;
/* Is BYTES fully within field_bytes? */
byte_range bytes_within_field (0,0);
if (!field_bytes.contains_p (bytes, &bytes_within_field))
return NULL_TREE;
*out_range_within_field = bytes_within_field;
return field;
}
/* Subroutine of region_model_manager::get_or_create_bits_within.
Return a folded svalue, or NULL. */
const svalue *
region_model_manager::maybe_fold_bits_within_svalue (tree type,
const bit_range &bits,
const svalue *inner_svalue)
{
tree inner_type = inner_svalue->get_type ();
/* Fold:
BITS_WITHIN ((0, sizeof (VAL), VAL))
to:
CAST(TYPE, VAL). */
if (bits.m_start_bit_offset == 0 && inner_type)
{
bit_size_t inner_type_size;
if (int_size_in_bits (inner_type, &inner_type_size))
if (inner_type_size == bits.m_size_in_bits)
{
if (type)
return get_or_create_cast (type, inner_svalue);
else
return inner_svalue;
}
}
/* Kind-specific folding. */
if (const svalue *sval
= inner_svalue->maybe_fold_bits_within (type, bits, this))
return sval;
byte_range bytes (0,0);
if (bits.as_byte_range (&bytes) && inner_type)
switch (TREE_CODE (inner_type))
{
default:
break;
case ARRAY_TYPE:
{
/* Fold:
BITS_WITHIN (range, KIND(REG))
to:
BITS_WITHIN (range - offsetof(ELEMENT), KIND(REG.ELEMENT))
if range1 is a byte-range fully within one ELEMENT. */
tree element_type = TREE_TYPE (inner_type);
HOST_WIDE_INT element_byte_size
= int_size_in_bytes (element_type);
if (element_byte_size > 0)
{
HOST_WIDE_INT start_idx
= (bytes.get_start_byte_offset ().to_shwi ()
/ element_byte_size);
HOST_WIDE_INT last_idx
= (bytes.get_last_byte_offset ().to_shwi ()
/ element_byte_size);
if (start_idx == last_idx)
{
if (const initial_svalue *initial_sval
= inner_svalue->dyn_cast_initial_svalue ())
{
bit_offset_t start_of_element
= start_idx * element_byte_size * BITS_PER_UNIT;
bit_range bits_within_element
(bits.m_start_bit_offset - start_of_element,
bits.m_size_in_bits);
const svalue *idx_sval
= get_or_create_int_cst (integer_type_node, start_idx);
const region *element_reg =
get_element_region (initial_sval->get_region (),
element_type, idx_sval);
const svalue *element_reg_sval
= get_or_create_initial_value (element_reg);
return get_or_create_bits_within (type,
bits_within_element,
element_reg_sval);
}
}
}
}
break;
case RECORD_TYPE:
{
/* Fold:
BYTES_WITHIN (range, KIND(REG))
to:
BYTES_WITHIN (range - offsetof(FIELD), KIND(REG.FIELD))
if range1 is fully within FIELD. */
byte_range bytes_within_field (0, 0);
if (tree field = get_field_at_byte_range (inner_type, bytes,
&bytes_within_field))
{
if (const initial_svalue *initial_sval
= inner_svalue->dyn_cast_initial_svalue ())
{
const region *field_reg =
get_field_region (initial_sval->get_region (), field);
const svalue *initial_reg_sval
= get_or_create_initial_value (field_reg);
return get_or_create_bits_within
(type,
bytes_within_field.as_bit_range (),
initial_reg_sval);
}
}
}
break;
}
return NULL;
}
/* Return the svalue * of type TYPE for extracting BITS from INNER_SVALUE,
creating it if necessary. */
const svalue *
region_model_manager::get_or_create_bits_within (tree type,
const bit_range &bits,
const svalue *inner_svalue)
{
if (const svalue *folded
= maybe_fold_bits_within_svalue (type, bits, inner_svalue))
return folded;
bits_within_svalue::key_t key (type, bits, inner_svalue);
if (bits_within_svalue **slot = m_bits_within_values_map.get (key))
return *slot;
bits_within_svalue *bits_within_sval
= new bits_within_svalue (alloc_symbol_id (), type, bits, inner_svalue);
RETURN_UNKNOWN_IF_TOO_COMPLEX (bits_within_sval);
m_bits_within_values_map.put (key, bits_within_sval);
return bits_within_sval;
}
/* Return the svalue * that decorates ARG as being unmergeable,
creating it if necessary. */
const svalue *
region_model_manager::get_or_create_unmergeable (const svalue *arg)
{
if (arg->get_kind () == SK_UNMERGEABLE)
return arg;
if (unmergeable_svalue **slot = m_unmergeable_values_map.get (arg))
return *slot;
unmergeable_svalue *unmergeable_sval
= new unmergeable_svalue (alloc_symbol_id (), arg);
RETURN_UNKNOWN_IF_TOO_COMPLEX (unmergeable_sval);
m_unmergeable_values_map.put (arg, unmergeable_sval);
return unmergeable_sval;
}
/* Return the svalue * of type TYPE for the merger of value BASE_SVAL
and ITER_SVAL at POINT, creating it if necessary. */
const svalue *
region_model_manager::
get_or_create_widening_svalue (tree type,
const function_point &point,
const svalue *base_sval,
const svalue *iter_sval)
{
gcc_assert (base_sval->get_kind () != SK_WIDENING);
gcc_assert (iter_sval->get_kind () != SK_WIDENING);
widening_svalue::key_t key (type, point, base_sval, iter_sval);
if (widening_svalue **slot = m_widening_values_map.get (key))
return *slot;
widening_svalue *widening_sval
= new widening_svalue (alloc_symbol_id (), type, point, base_sval,
iter_sval);
RETURN_UNKNOWN_IF_TOO_COMPLEX (widening_sval);
m_widening_values_map.put (key, widening_sval);
return widening_sval;
}
/* Return the svalue * of type TYPE for the compound values in MAP,
creating it if necessary. */
const svalue *
region_model_manager::get_or_create_compound_svalue (tree type,
const binding_map &map)
{
compound_svalue::key_t tmp_key (type, &map);
if (compound_svalue **slot = m_compound_values_map.get (tmp_key))
return *slot;
compound_svalue *compound_sval
= new compound_svalue (alloc_symbol_id (), type, map);
RETURN_UNKNOWN_IF_TOO_COMPLEX (compound_sval);
/* Use make_key rather than reusing the key, so that we use a
ptr to compound_sval's binding_map, rather than the MAP param. */
m_compound_values_map.put (compound_sval->make_key (), compound_sval);
return compound_sval;
}
/* class conjured_purge. */
/* Purge state relating to SVAL. */
void
conjured_purge::purge (const conjured_svalue *sval) const
{
m_model->purge_state_involving (sval, m_ctxt);
}
/* Return the svalue * of type TYPE for the value conjured for ID_REG
at STMT (using IDX for any further disambiguation),
creating it if necessary.
Use P to purge existing state from the svalue, for the case where a
conjured_svalue would be reused along an execution path. */
const svalue *
region_model_manager::get_or_create_conjured_svalue (tree type,
const gimple *stmt,
const region *id_reg,
const conjured_purge &p,
unsigned idx)
{
conjured_svalue::key_t key (type, stmt, id_reg, idx);
if (conjured_svalue **slot = m_conjured_values_map.get (key))
{
const conjured_svalue *sval = *slot;
/* We're reusing an existing conjured_svalue, perhaps from a different
state within this analysis, or perhaps from an earlier state on this
execution path. For the latter, purge any state involving the "new"
svalue from the current program_state. */
p.purge (sval);
return sval;
}
conjured_svalue *conjured_sval
= new conjured_svalue (alloc_symbol_id (), type, stmt, id_reg, idx);
RETURN_UNKNOWN_IF_TOO_COMPLEX (conjured_sval);
m_conjured_values_map.put (key, conjured_sval);
return conjured_sval;
}
/* Subroutine of region_model_manager::get_or_create_asm_output_svalue.
Return a folded svalue, or NULL. */
const svalue *
region_model_manager::
maybe_fold_asm_output_svalue (tree type,
const vec<const svalue *> &inputs)
{
/* Unknown inputs should lead to unknown results. */
for (const auto &iter : inputs)
if (iter->get_kind () == SK_UNKNOWN)
return get_or_create_unknown_svalue (type);
return NULL;
}
/* Return the svalue * of type TYPE for OUTPUT_IDX of the deterministic
asm stmt ASM_STMT, given INPUTS as inputs. */
const svalue *
region_model_manager::
get_or_create_asm_output_svalue (tree type,
const gasm *asm_stmt,
unsigned output_idx,
const vec<const svalue *> &inputs)
{
gcc_assert (inputs.length () <= asm_output_svalue::MAX_INPUTS);
if (const svalue *folded
= maybe_fold_asm_output_svalue (type, inputs))
return folded;
const char *asm_string = gimple_asm_string (asm_stmt);
const unsigned noutputs = gimple_asm_noutputs (asm_stmt);
asm_output_svalue::key_t key (type, asm_string, output_idx, inputs);
if (asm_output_svalue **slot = m_asm_output_values_map.get (key))
return *slot;
asm_output_svalue *asm_output_sval
= new asm_output_svalue (alloc_symbol_id (), type, asm_string, output_idx,
noutputs, inputs);
RETURN_UNKNOWN_IF_TOO_COMPLEX (asm_output_sval);
m_asm_output_values_map.put (key, asm_output_sval);
return asm_output_sval;
}
/* Return the svalue * of type TYPE for OUTPUT_IDX of a deterministic
asm stmt with string ASM_STRING with NUM_OUTPUTS outputs, given
INPUTS as inputs. */
const svalue *
region_model_manager::
get_or_create_asm_output_svalue (tree type,
const char *asm_string,
unsigned output_idx,
unsigned num_outputs,
const vec<const svalue *> &inputs)
{
gcc_assert (inputs.length () <= asm_output_svalue::MAX_INPUTS);
if (const svalue *folded
= maybe_fold_asm_output_svalue (type, inputs))
return folded;
asm_output_svalue::key_t key (type, asm_string, output_idx, inputs);
if (asm_output_svalue **slot = m_asm_output_values_map.get (key))
return *slot;
asm_output_svalue *asm_output_sval
= new asm_output_svalue (alloc_symbol_id (), type, asm_string, output_idx,
num_outputs, inputs);
RETURN_UNKNOWN_IF_TOO_COMPLEX (asm_output_sval);
m_asm_output_values_map.put (key, asm_output_sval);
return asm_output_sval;
}
/* Return the svalue * of type TYPE for the result of a call to FNDECL
with __attribute__((const)), given INPUTS as inputs. */
const svalue *
region_model_manager::
get_or_create_const_fn_result_svalue (tree type,
tree fndecl,
const vec<const svalue *> &inputs)
{
gcc_assert (fndecl);
gcc_assert (DECL_P (fndecl));
gcc_assert (TREE_READONLY (fndecl));
gcc_assert (inputs.length () <= const_fn_result_svalue::MAX_INPUTS);
const_fn_result_svalue::key_t key (type, fndecl, inputs);
if (const_fn_result_svalue **slot = m_const_fn_result_values_map.get (key))
return *slot;
const_fn_result_svalue *const_fn_result_sval
= new const_fn_result_svalue (alloc_symbol_id (), type, fndecl, inputs);
RETURN_UNKNOWN_IF_TOO_COMPLEX (const_fn_result_sval);
m_const_fn_result_values_map.put (key, const_fn_result_sval);
return const_fn_result_sval;
}
/* Get a tree for the size of STRING_CST, or NULL_TREE.
Note that this may be larger than TREE_STRING_LENGTH (implying
a run of trailing zero bytes from TREE_STRING_LENGTH up to this
higher limit). */
tree
get_string_cst_size (const_tree string_cst)
{
gcc_assert (TREE_CODE (string_cst) == STRING_CST);
gcc_assert (TREE_CODE (TREE_TYPE (string_cst)) == ARRAY_TYPE);
return TYPE_SIZE_UNIT (TREE_TYPE (string_cst));
}
/* Given STRING_CST, a STRING_CST and BYTE_OFFSET_CST a constant,
attempt to get the character at that offset, returning either
the svalue for the character constant, or NULL if unsuccessful. */
const svalue *
region_model_manager::maybe_get_char_from_string_cst (tree string_cst,
tree byte_offset_cst)
{
gcc_assert (TREE_CODE (string_cst) == STRING_CST);
/* Adapted from fold_read_from_constant_string. */
scalar_int_mode char_mode;
if (TREE_CODE (byte_offset_cst) == INTEGER_CST
&& is_int_mode (TYPE_MODE (TREE_TYPE (TREE_TYPE (string_cst))),
&char_mode)
&& GET_MODE_SIZE (char_mode) == 1)
{
/* If we're beyond the string_cst, the read is unsuccessful. */
if (compare_constants (byte_offset_cst,
GE_EXPR,
get_string_cst_size (string_cst)).is_true ())
return NULL;
int char_val;
if (compare_tree_int (byte_offset_cst,
TREE_STRING_LENGTH (string_cst)) < 0)
/* We're within the area defined by TREE_STRING_POINTER. */
char_val = (TREE_STRING_POINTER (string_cst)
[TREE_INT_CST_LOW (byte_offset_cst)]);
else
/* We're in the padding area of trailing zeroes. */
char_val = 0;
tree char_cst
= build_int_cst_type (TREE_TYPE (TREE_TYPE (string_cst)), char_val);
return get_or_create_constant_svalue (char_cst);
}
return NULL;
}
/* region consolidation. */
/* Return the region for FNDECL, creating it if necessary. */
const function_region *
region_model_manager::get_region_for_fndecl (tree fndecl)
{
gcc_assert (TREE_CODE (fndecl) == FUNCTION_DECL);
function_region **slot = m_fndecls_map.get (fndecl);
if (slot)
return *slot;
function_region *reg
= new function_region (alloc_symbol_id (), &m_code_region, fndecl);
m_fndecls_map.put (fndecl, reg);
return reg;
}
/* Return the region for LABEL, creating it if necessary. */
const label_region *
region_model_manager::get_region_for_label (tree label)
{
gcc_assert (TREE_CODE (label) == LABEL_DECL);
label_region **slot = m_labels_map.get (label);
if (slot)
return *slot;
tree fndecl = DECL_CONTEXT (label);
gcc_assert (fndecl && TREE_CODE (fndecl) == FUNCTION_DECL);
const function_region *func_reg = get_region_for_fndecl (fndecl);
label_region *reg
= new label_region (alloc_symbol_id (), func_reg, label);
m_labels_map.put (label, reg);
return reg;
}
/* Return the region for EXPR, creating it if necessary. */
const decl_region *
region_model_manager::get_region_for_global (tree expr)
{
gcc_assert (VAR_P (expr));
decl_region **slot = m_globals_map.get (expr);
if (slot)
return *slot;
decl_region *reg
= new decl_region (alloc_symbol_id (), &m_globals_region, expr);
m_globals_map.put (expr, reg);
return reg;
}
/* Return the region for an unknown access of type REGION_TYPE,
creating it if necessary.
This is a symbolic_region, where the pointer is an unknown_svalue
of type ®ION_TYPE. */
const region *
region_model_manager::get_unknown_symbolic_region (tree region_type)
{
tree ptr_type = region_type ? build_pointer_type (region_type) : NULL_TREE;
const svalue *unknown_ptr = get_or_create_unknown_svalue (ptr_type);
return get_symbolic_region (unknown_ptr);
}
/* Return the region that describes accessing field FIELD of PARENT,
creating it if necessary. */
const region *
region_model_manager::get_field_region (const region *parent, tree field)
{
gcc_assert (TREE_CODE (field) == FIELD_DECL);
/* (*UNKNOWN_PTR).field is (*UNKNOWN_PTR_OF_&FIELD_TYPE). */
if (parent->symbolic_for_unknown_ptr_p ())
return get_unknown_symbolic_region (TREE_TYPE (field));
field_region::key_t key (parent, field);
if (field_region *reg = m_field_regions.get (key))
return reg;
field_region *field_reg
= new field_region (alloc_symbol_id (), parent, field);
m_field_regions.put (key, field_reg);
return field_reg;
}
/* Return the region that describes accessing the element of type
ELEMENT_TYPE at index INDEX of PARENT, creating it if necessary. */
const region *
region_model_manager::get_element_region (const region *parent,
tree element_type,
const svalue *index)
{
/* (UNKNOWN_PTR[IDX]) is (UNKNOWN_PTR). */
if (parent->symbolic_for_unknown_ptr_p ())
return get_unknown_symbolic_region (element_type);
element_region::key_t key (parent, element_type, index);
if (element_region *reg = m_element_regions.get (key))
return reg;
element_region *element_reg
= new element_region (alloc_symbol_id (), parent, element_type, index);
m_element_regions.put (key, element_reg);
return element_reg;
}
/* Return the region that describes accessing the subregion of type
ELEMENT_TYPE at offset BYTE_OFFSET within PARENT, creating it if
necessary. */
const region *
region_model_manager::get_offset_region (const region *parent,
tree type,
const svalue *byte_offset)
{
/* (UNKNOWN_PTR + OFFSET) is (UNKNOWN_PTR). */
if (parent->symbolic_for_unknown_ptr_p ())
return get_unknown_symbolic_region (type);
/* If BYTE_OFFSET is zero, return PARENT. */
if (tree cst_offset = byte_offset->maybe_get_constant ())
if (zerop (cst_offset))
return get_cast_region (parent, type);
/* Fold OFFSET_REGION(OFFSET_REGION(REG, X), Y)
to OFFSET_REGION(REG, (X + Y)). */
if (const offset_region *parent_offset_reg
= parent->dyn_cast_offset_region ())
{
const svalue *sval_x = parent_offset_reg->get_byte_offset ();
const svalue *sval_sum
= get_or_create_binop (byte_offset->get_type (),
PLUS_EXPR, sval_x, byte_offset);
return get_offset_region (parent->get_parent_region (), type, sval_sum);
}
offset_region::key_t key (parent, type, byte_offset);
if (offset_region *reg = m_offset_regions.get (key))
return reg;
offset_region *offset_reg
= new offset_region (alloc_symbol_id (), parent, type, byte_offset);
m_offset_regions.put (key, offset_reg);
return offset_reg;
}
/* Return the region that describes accessing the subregion of type
TYPE of size BYTE_SIZE_SVAL within PARENT, creating it if necessary. */
const region *
region_model_manager::get_sized_region (const region *parent,
tree type,
const svalue *byte_size_sval)
{
if (parent->symbolic_for_unknown_ptr_p ())
return get_unknown_symbolic_region (type);
if (byte_size_sval->get_type () != size_type_node)
byte_size_sval = get_or_create_cast (size_type_node, byte_size_sval);
/* If PARENT is already that size, return it. */
const svalue *parent_byte_size_sval = parent->get_byte_size_sval (this);
if (tree parent_size_cst = parent_byte_size_sval->maybe_get_constant ())
if (tree size_cst = byte_size_sval->maybe_get_constant ())
{
tree comparison
= fold_binary (EQ_EXPR, boolean_type_node, parent_size_cst, size_cst);
if (comparison == boolean_true_node)
return parent;
}
sized_region::key_t key (parent, type, byte_size_sval);
if (sized_region *reg = m_sized_regions.get (key))
return reg;
sized_region *sized_reg
= new sized_region (alloc_symbol_id (), parent, type, byte_size_sval);
m_sized_regions.put (key, sized_reg);
return sized_reg;
}
/* Return the region that describes accessing PARENT_REGION as if
it were of type TYPE, creating it if necessary. */
const region *
region_model_manager::get_cast_region (const region *original_region,
tree type)
{
/* If types match, return ORIGINAL_REGION. */
if (type == original_region->get_type ())
return original_region;
if (original_region->symbolic_for_unknown_ptr_p ())
return get_unknown_symbolic_region (type);
cast_region::key_t key (original_region, type);
if (cast_region *reg = m_cast_regions.get (key))
return reg;
cast_region *cast_reg
= new cast_region (alloc_symbol_id (), original_region, type);
m_cast_regions.put (key, cast_reg);
return cast_reg;
}
/* Return the frame_region for call to FUN from CALLING_FRAME, creating it
if necessary. CALLING_FRAME may be NULL. */
const frame_region *
region_model_manager::get_frame_region (const frame_region *calling_frame,
const function &fun)
{
int index = calling_frame ? calling_frame->get_index () + 1 : 0;
frame_region::key_t key (calling_frame, fun);
if (frame_region *reg = m_frame_regions.get (key))
return reg;
frame_region *frame_reg
= new frame_region (alloc_symbol_id (), &m_stack_region, calling_frame,
fun, index);
m_frame_regions.put (key, frame_reg);
return frame_reg;
}
/* Return the region that describes dereferencing SVAL, creating it
if necessary. */
const region *
region_model_manager::get_symbolic_region (const svalue *sval)
{
symbolic_region::key_t key (&m_root_region, sval);
if (symbolic_region *reg = m_symbolic_regions.get (key))
return reg;
symbolic_region *symbolic_reg
= new symbolic_region (alloc_symbol_id (), &m_root_region, sval);
m_symbolic_regions.put (key, symbolic_reg);
return symbolic_reg;
}
/* Return the region that describes accessing STRING_CST, creating it
if necessary. */
const string_region *
region_model_manager::get_region_for_string (tree string_cst)
{
gcc_assert (TREE_CODE (string_cst) == STRING_CST);
string_region **slot = m_string_map.get (string_cst);
if (slot)
return *slot;
string_region *reg
= new string_region (alloc_symbol_id (), &m_root_region, string_cst);
m_string_map.put (string_cst, reg);
return reg;
}
/* Return the region that describes accessing BITS within PARENT as TYPE,
creating it if necessary. */
const region *
region_model_manager::get_bit_range (const region *parent, tree type,
const bit_range &bits)
{
gcc_assert (parent);
if (parent->symbolic_for_unknown_ptr_p ())
return get_unknown_symbolic_region (type);
bit_range_region::key_t key (parent, type, bits);
if (bit_range_region *reg = m_bit_range_regions.get (key))
return reg;
bit_range_region *bit_range_reg
= new bit_range_region (alloc_symbol_id (), parent, type, bits);
m_bit_range_regions.put (key, bit_range_reg);
return bit_range_reg;
}
/* Return the region that describes accessing the IDX-th variadic argument
within PARENT_FRAME, creating it if necessary. */
const var_arg_region *
region_model_manager::get_var_arg_region (const frame_region *parent_frame,
unsigned idx)
{
gcc_assert (parent_frame);
var_arg_region::key_t key (parent_frame, idx);
if (var_arg_region *reg = m_var_arg_regions.get (key))
return reg;
var_arg_region *var_arg_reg
= new var_arg_region (alloc_symbol_id (), parent_frame, idx);
m_var_arg_regions.put (key, var_arg_reg);
return var_arg_reg;
}
/* If we see a tree code we don't know how to handle, rather than
ICE or generate bogus results, create a dummy region, and notify
CTXT so that it can mark the new state as being not properly
modelled. The exploded graph can then stop exploring that path,
since any diagnostics we might issue will have questionable
validity. */
const region *
region_model_manager::
get_region_for_unexpected_tree_code (region_model_context *ctxt,
tree t,
const dump_location_t &loc)
{
tree type = TYPE_P (t) ? t : TREE_TYPE (t);
region *new_reg
= new unknown_region (alloc_symbol_id (), &m_root_region, type);
if (ctxt)
ctxt->on_unexpected_tree_code (t, loc);
return new_reg;
}
/* Return a region describing a heap-allocated block of memory.
Reuse an existing heap_allocated_region is its id is not within
BASE_REGS_IN_USE. */
const region *
region_model_manager::
get_or_create_region_for_heap_alloc (const bitmap &base_regs_in_use)
{
/* Try to reuse an existing region, if it's unreferenced in the
client state. */
for (auto existing_reg : m_managed_dynamic_regions)
if (!bitmap_bit_p (base_regs_in_use, existing_reg->get_id ()))
if (existing_reg->get_kind () == RK_HEAP_ALLOCATED)
return existing_reg;
/* All existing ones (if any) are in use; create a new one. */
region *reg
= new heap_allocated_region (alloc_symbol_id (), &m_heap_region);
m_managed_dynamic_regions.safe_push (reg);
return reg;
}
/* Return a new region describing a block of memory allocated within FRAME. */
const region *
region_model_manager::create_region_for_alloca (const frame_region *frame)
{
gcc_assert (frame);
region *reg = new alloca_region (alloc_symbol_id (), frame);
m_managed_dynamic_regions.safe_push (reg);
return reg;
}
/* Log OBJ to LOGGER. */
template <typename T>
static void
log_managed_object (logger *logger, const T *obj)
{
logger->start_log_line ();
pretty_printer *pp = logger->get_printer ();
pp_string (pp, " ");
obj->dump_to_pp (pp, true);
logger->end_log_line ();
}
/* Specialization for frame_region, which also logs the count of locals
managed by the frame_region. */
template <>
void
log_managed_object (logger *logger, const frame_region *obj)
{
logger->start_log_line ();
pretty_printer *pp = logger->get_printer ();
pp_string (pp, " ");
obj->dump_to_pp (pp, true);
pp_printf (pp, " [with %i region(s) for locals]", obj->get_num_locals ());
logger->end_log_line ();
}
/* Dump the number of objects that were managed by UNIQ_MAP to LOGGER.
If SHOW_OBJS is true, also dump the objects themselves. */
template <typename K, typename T>
static void
log_uniq_map (logger *logger, bool show_objs, const char *title,
const hash_map<K, T*> &uniq_map)
{
logger->log (" # %s: %li", title, (long)uniq_map.elements ());
if (!show_objs)
return;
auto_vec<const T *> vec_objs (uniq_map.elements ());
for (typename hash_map<K, T*>::iterator iter = uniq_map.begin ();
iter != uniq_map.end (); ++iter)
vec_objs.quick_push ((*iter).second);
vec_objs.qsort (T::cmp_ptr_ptr);
unsigned i;
const T *obj;
FOR_EACH_VEC_ELT (vec_objs, i, obj)
log_managed_object<T> (logger, obj);
}
/* Dump the number of objects that were managed by MAP to LOGGER.
If SHOW_OBJS is true, also dump the objects themselves. */
template <typename T>
static void
log_uniq_map (logger *logger, bool show_objs, const char *title,
const consolidation_map<T> &map)
{
logger->log (" # %s: %li", title, (long)map.elements ());
if (!show_objs)
return;
auto_vec<const T *> vec_objs (map.elements ());
for (typename consolidation_map<T>::iterator iter = map.begin ();
iter != map.end (); ++iter)
vec_objs.quick_push ((*iter).second);
vec_objs.qsort (T::cmp_ptr_ptr);
unsigned i;
const T *obj;
FOR_EACH_VEC_ELT (vec_objs, i, obj)
log_managed_object<T> (logger, obj);
}
/* Dump the number of objects of each class that were managed by this
manager to LOGGER.
If SHOW_OBJS is true, also dump the objects themselves. */
void
region_model_manager::log_stats (logger *logger, bool show_objs) const
{
LOG_SCOPE (logger);
logger->log ("call string consolidation");
m_empty_call_string.recursive_log (logger);
logger->log ("next symbol id: %i", m_next_symbol_id);
logger->log ("svalue consolidation");
log_uniq_map (logger, show_objs, "constant_svalue", m_constants_map);
log_uniq_map (logger, show_objs, "unknown_svalue", m_unknowns_map);
if (m_unknown_NULL)
log_managed_object (logger, m_unknown_NULL);
log_uniq_map (logger, show_objs, "poisoned_svalue", m_poisoned_values_map);
log_uniq_map (logger, show_objs, "setjmp_svalue", m_setjmp_values_map);
log_uniq_map (logger, show_objs, "initial_svalue", m_initial_values_map);
log_uniq_map (logger, show_objs, "region_svalue", m_pointer_values_map);
log_uniq_map (logger, show_objs, "unaryop_svalue", m_unaryop_values_map);
log_uniq_map (logger, show_objs, "binop_svalue", m_binop_values_map);
log_uniq_map (logger, show_objs, "sub_svalue", m_sub_values_map);
log_uniq_map (logger, show_objs, "repeated_svalue", m_repeated_values_map);
log_uniq_map (logger, show_objs, "bits_within_svalue",
m_bits_within_values_map);
log_uniq_map (logger, show_objs, "unmergeable_svalue",
m_unmergeable_values_map);
log_uniq_map (logger, show_objs, "widening_svalue", m_widening_values_map);
log_uniq_map (logger, show_objs, "compound_svalue", m_compound_values_map);
log_uniq_map (logger, show_objs, "conjured_svalue", m_conjured_values_map);
log_uniq_map (logger, show_objs, "asm_output_svalue",
m_asm_output_values_map);
log_uniq_map (logger, show_objs, "const_fn_result_svalue",
m_const_fn_result_values_map);
logger->log ("max accepted svalue num_nodes: %i",
m_max_complexity.m_num_nodes);
logger->log ("max accepted svalue max_depth: %i",
m_max_complexity.m_max_depth);
logger->log ("region consolidation");
log_uniq_map (logger, show_objs, "function_region", m_fndecls_map);
log_uniq_map (logger, show_objs, "label_region", m_labels_map);
log_uniq_map (logger, show_objs, "decl_region for globals", m_globals_map);
log_uniq_map (logger, show_objs, "field_region", m_field_regions);
log_uniq_map (logger, show_objs, "element_region", m_element_regions);
log_uniq_map (logger, show_objs, "offset_region", m_offset_regions);
log_uniq_map (logger, show_objs, "sized_region", m_sized_regions);
log_uniq_map (logger, show_objs, "cast_region", m_cast_regions);
log_uniq_map (logger, show_objs, "frame_region", m_frame_regions);
log_uniq_map (logger, show_objs, "symbolic_region", m_symbolic_regions);
log_uniq_map (logger, show_objs, "string_region", m_string_map);
log_uniq_map (logger, show_objs, "bit_range_region", m_bit_range_regions);
log_uniq_map (logger, show_objs, "var_arg_region", m_var_arg_regions);
logger->log (" # managed dynamic regions: %i",
m_managed_dynamic_regions.length ());
m_store_mgr.log_stats (logger, show_objs);
m_range_mgr->log_stats (logger, show_objs);
}
/* Dump the number of objects of each class that were managed by this
manager to LOGGER.
If SHOW_OBJS is true, also dump the objects themselves.
This is here so it can use log_uniq_map. */
void
store_manager::log_stats (logger *logger, bool show_objs) const
{
LOG_SCOPE (logger);
log_uniq_map (logger, show_objs, "concrete_binding",
m_concrete_binding_key_mgr);
log_uniq_map (logger, show_objs, "symbolic_binding",
m_symbolic_binding_key_mgr);
}
/* Emit a warning showing DECL_REG->tracked_p () for use in DejaGnu tests
(using -fdump-analyzer-untracked). */
static void
dump_untracked_region (const decl_region *decl_reg)
{
tree decl = decl_reg->get_decl ();
if (TREE_CODE (decl) != VAR_DECL)
return;
/* For now, don't emit the status of decls in the constant pool, to avoid
differences in DejaGnu test results between targets that use these vs
those that don't.
(Eventually these decls should probably be untracked and we should test
for that, but that's not stage 4 material). */
if (DECL_IN_CONSTANT_POOL (decl))
return;
warning_at (DECL_SOURCE_LOCATION (decl), 0,
"track %qD: %s",
decl, (decl_reg->tracked_p () ? "yes" : "no"));
}
/* Implementation of -fdump-analyzer-untracked. */
void
region_model_manager::dump_untracked_regions () const
{
for (auto iter : m_globals_map)
{
const decl_region *decl_reg = iter.second;
dump_untracked_region (decl_reg);
}
for (auto frame_iter : m_frame_regions)
{
const frame_region *frame_reg = frame_iter.second;
frame_reg->dump_untracked_regions ();
}
}
void
frame_region::dump_untracked_regions () const
{
for (auto iter : m_locals)
{
const decl_region *decl_reg = iter.second;
dump_untracked_region (decl_reg);
}
}
} // namespace ana
#endif /* #if ENABLE_ANALYZER */
|