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
|
/* Function splitting pass
Copyright (C) 2010-2014 Free Software Foundation, Inc.
Contributed by Jan Hubicka <jh@suse.cz>
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/>. */
/* The purpose of this pass is to split function bodies to improve
inlining. I.e. for function of the form:
func (...)
{
if (cheap_test)
something_small
else
something_big
}
Produce:
func.part (...)
{
something_big
}
func (...)
{
if (cheap_test)
something_small
else
func.part (...);
}
When func becomes inlinable and when cheap_test is often true, inlining func,
but not fund.part leads to performance improvement similar as inlining
original func while the code size growth is smaller.
The pass is organized in three stages:
1) Collect local info about basic block into BB_INFO structure and
compute function body estimated size and time.
2) Via DFS walk find all possible basic blocks where we can split
and chose best one.
3) If split point is found, split at the specified BB by creating a clone
and updating function to call it.
The decisions what functions to split are in execute_split_functions
and consider_split.
There are several possible future improvements for this pass including:
1) Splitting to break up large functions
2) Splitting to reduce stack frame usage
3) Allow split part of function to use values computed in the header part.
The values needs to be passed to split function, perhaps via same
interface as for nested functions or as argument.
4) Support for simple rematerialization. I.e. when split part use
value computed in header from function parameter in very cheap way, we
can just recompute it.
5) Support splitting of nested functions.
6) Support non-SSA arguments.
7) There is nothing preventing us from producing multiple parts of single function
when needed or splitting also the parts. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tree.h"
#include "predict.h"
#include "vec.h"
#include "hashtab.h"
#include "hash-set.h"
#include "machmode.h"
#include "tm.h"
#include "hard-reg-set.h"
#include "input.h"
#include "function.h"
#include "dominance.h"
#include "cfg.h"
#include "cfganal.h"
#include "basic-block.h"
#include "tree-ssa-alias.h"
#include "internal-fn.h"
#include "gimple-expr.h"
#include "is-a.h"
#include "gimple.h"
#include "stringpool.h"
#include "expr.h"
#include "calls.h"
#include "gimplify.h"
#include "gimple-iterator.h"
#include "gimplify-me.h"
#include "gimple-walk.h"
#include "target.h"
#include "hash-map.h"
#include "plugin-api.h"
#include "ipa-ref.h"
#include "cgraph.h"
#include "alloc-pool.h"
#include "symbol-summary.h"
#include "ipa-prop.h"
#include "gimple-ssa.h"
#include "tree-cfg.h"
#include "tree-phinodes.h"
#include "ssa-iterators.h"
#include "stringpool.h"
#include "tree-ssanames.h"
#include "tree-into-ssa.h"
#include "tree-dfa.h"
#include "tree-pass.h"
#include "flags.h"
#include "diagnostic.h"
#include "tree-dump.h"
#include "tree-inline.h"
#include "params.h"
#include "gimple-pretty-print.h"
#include "ipa-inline.h"
#include "cfgloop.h"
#include "tree-chkp.h"
/* Per basic block info. */
typedef struct
{
unsigned int size;
unsigned int time;
} split_bb_info;
static vec<split_bb_info> bb_info_vec;
/* Description of split point. */
struct split_point
{
/* Size of the partitions. */
unsigned int header_time, header_size, split_time, split_size;
/* SSA names that need to be passed into spit function. */
bitmap ssa_names_to_pass;
/* Basic block where we split (that will become entry point of new function. */
basic_block entry_bb;
/* Basic blocks we are splitting away. */
bitmap split_bbs;
/* True when return value is computed on split part and thus it needs
to be returned. */
bool split_part_set_retval;
};
/* Best split point found. */
struct split_point best_split_point;
/* Set of basic blocks that are not allowed to dominate a split point. */
static bitmap forbidden_dominators;
static tree find_retval (basic_block return_bb);
static tree find_retbnd (basic_block return_bb);
/* Callback for walk_stmt_load_store_addr_ops. If T is non-SSA automatic
variable, check it if it is present in bitmap passed via DATA. */
static bool
test_nonssa_use (gimple, tree t, tree, void *data)
{
t = get_base_address (t);
if (!t || is_gimple_reg (t))
return false;
if (TREE_CODE (t) == PARM_DECL
|| (TREE_CODE (t) == VAR_DECL
&& auto_var_in_fn_p (t, current_function_decl))
|| TREE_CODE (t) == RESULT_DECL
/* Normal labels are part of CFG and will be handled gratefuly.
Forced labels however can be used directly by statements and
need to stay in one partition along with their uses. */
|| (TREE_CODE (t) == LABEL_DECL
&& FORCED_LABEL (t)))
return bitmap_bit_p ((bitmap)data, DECL_UID (t));
/* For DECL_BY_REFERENCE, the return value is actually a pointer. We want
to pretend that the value pointed to is actual result decl. */
if ((TREE_CODE (t) == MEM_REF || INDIRECT_REF_P (t))
&& TREE_CODE (TREE_OPERAND (t, 0)) == SSA_NAME
&& SSA_NAME_VAR (TREE_OPERAND (t, 0))
&& TREE_CODE (SSA_NAME_VAR (TREE_OPERAND (t, 0))) == RESULT_DECL
&& DECL_BY_REFERENCE (DECL_RESULT (current_function_decl)))
return
bitmap_bit_p ((bitmap)data,
DECL_UID (DECL_RESULT (current_function_decl)));
return false;
}
/* Dump split point CURRENT. */
static void
dump_split_point (FILE * file, struct split_point *current)
{
fprintf (file,
"Split point at BB %i\n"
" header time: %i header size: %i\n"
" split time: %i split size: %i\n bbs: ",
current->entry_bb->index, current->header_time,
current->header_size, current->split_time, current->split_size);
dump_bitmap (file, current->split_bbs);
fprintf (file, " SSA names to pass: ");
dump_bitmap (file, current->ssa_names_to_pass);
}
/* Look for all BBs in header that might lead to the split part and verify
that they are not defining any non-SSA var used by the split part.
Parameters are the same as for consider_split. */
static bool
verify_non_ssa_vars (struct split_point *current, bitmap non_ssa_vars,
basic_block return_bb)
{
bitmap seen = BITMAP_ALLOC (NULL);
vec<basic_block> worklist = vNULL;
edge e;
edge_iterator ei;
bool ok = true;
basic_block bb;
FOR_EACH_EDGE (e, ei, current->entry_bb->preds)
if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
&& !bitmap_bit_p (current->split_bbs, e->src->index))
{
worklist.safe_push (e->src);
bitmap_set_bit (seen, e->src->index);
}
while (!worklist.is_empty ())
{
bb = worklist.pop ();
FOR_EACH_EDGE (e, ei, bb->preds)
if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)
&& bitmap_set_bit (seen, e->src->index))
{
gcc_checking_assert (!bitmap_bit_p (current->split_bbs,
e->src->index));
worklist.safe_push (e->src);
}
for (gimple_stmt_iterator bsi = gsi_start_bb (bb); !gsi_end_p (bsi);
gsi_next (&bsi))
{
gimple stmt = gsi_stmt (bsi);
if (is_gimple_debug (stmt))
continue;
if (walk_stmt_load_store_addr_ops
(stmt, non_ssa_vars, test_nonssa_use, test_nonssa_use,
test_nonssa_use))
{
ok = false;
goto done;
}
if (glabel *label_stmt = dyn_cast <glabel *> (stmt))
if (test_nonssa_use (stmt, gimple_label_label (label_stmt),
NULL_TREE, non_ssa_vars))
{
ok = false;
goto done;
}
}
for (gphi_iterator bsi = gsi_start_phis (bb); !gsi_end_p (bsi);
gsi_next (&bsi))
{
if (walk_stmt_load_store_addr_ops
(gsi_stmt (bsi), non_ssa_vars, test_nonssa_use, test_nonssa_use,
test_nonssa_use))
{
ok = false;
goto done;
}
}
FOR_EACH_EDGE (e, ei, bb->succs)
{
if (e->dest != return_bb)
continue;
for (gphi_iterator bsi = gsi_start_phis (return_bb);
!gsi_end_p (bsi);
gsi_next (&bsi))
{
gphi *stmt = bsi.phi ();
tree op = gimple_phi_arg_def (stmt, e->dest_idx);
if (virtual_operand_p (gimple_phi_result (stmt)))
continue;
if (TREE_CODE (op) != SSA_NAME
&& test_nonssa_use (stmt, op, op, non_ssa_vars))
{
ok = false;
goto done;
}
}
}
}
/* Verify that the rest of function does not define any label
used by the split part. */
FOR_EACH_BB_FN (bb, cfun)
if (!bitmap_bit_p (current->split_bbs, bb->index)
&& !bitmap_bit_p (seen, bb->index))
{
gimple_stmt_iterator bsi;
for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
if (glabel *label_stmt = dyn_cast <glabel *> (gsi_stmt (bsi)))
{
if (test_nonssa_use (label_stmt,
gimple_label_label (label_stmt),
NULL_TREE, non_ssa_vars))
{
ok = false;
goto done;
}
}
else
break;
}
done:
BITMAP_FREE (seen);
worklist.release ();
return ok;
}
/* If STMT is a call, check the callee against a list of forbidden
predicate functions. If a match is found, look for uses of the
call result in condition statements that compare against zero.
For each such use, find the block targeted by the condition
statement for the nonzero result, and set the bit for this block
in the forbidden dominators bitmap. The purpose of this is to avoid
selecting a split point where we are likely to lose the chance
to optimize away an unused function call. */
static void
check_forbidden_calls (gimple stmt)
{
imm_use_iterator use_iter;
use_operand_p use_p;
tree lhs;
/* At the moment, __builtin_constant_p is the only forbidden
predicate function call (see PR49642). */
if (!gimple_call_builtin_p (stmt, BUILT_IN_CONSTANT_P))
return;
lhs = gimple_call_lhs (stmt);
if (!lhs || TREE_CODE (lhs) != SSA_NAME)
return;
FOR_EACH_IMM_USE_FAST (use_p, use_iter, lhs)
{
tree op1;
basic_block use_bb, forbidden_bb;
enum tree_code code;
edge true_edge, false_edge;
gcond *use_stmt;
use_stmt = dyn_cast <gcond *> (USE_STMT (use_p));
if (!use_stmt)
continue;
/* Assuming canonical form for GIMPLE_COND here, with constant
in second position. */
op1 = gimple_cond_rhs (use_stmt);
code = gimple_cond_code (use_stmt);
use_bb = gimple_bb (use_stmt);
extract_true_false_edges_from_block (use_bb, &true_edge, &false_edge);
/* We're only interested in comparisons that distinguish
unambiguously from zero. */
if (!integer_zerop (op1) || code == LE_EXPR || code == GE_EXPR)
continue;
if (code == EQ_EXPR)
forbidden_bb = false_edge->dest;
else
forbidden_bb = true_edge->dest;
bitmap_set_bit (forbidden_dominators, forbidden_bb->index);
}
}
/* If BB is dominated by any block in the forbidden dominators set,
return TRUE; else FALSE. */
static bool
dominated_by_forbidden (basic_block bb)
{
unsigned dom_bb;
bitmap_iterator bi;
EXECUTE_IF_SET_IN_BITMAP (forbidden_dominators, 1, dom_bb, bi)
{
if (dominated_by_p (CDI_DOMINATORS, bb,
BASIC_BLOCK_FOR_FN (cfun, dom_bb)))
return true;
}
return false;
}
/* For give split point CURRENT and return block RETURN_BB return 1
if ssa name VAL is set by split part and 0 otherwise. */
static bool
split_part_set_ssa_name_p (tree val, struct split_point *current,
basic_block return_bb)
{
if (TREE_CODE (val) != SSA_NAME)
return false;
return (!SSA_NAME_IS_DEFAULT_DEF (val)
&& (bitmap_bit_p (current->split_bbs,
gimple_bb (SSA_NAME_DEF_STMT (val))->index)
|| gimple_bb (SSA_NAME_DEF_STMT (val)) == return_bb));
}
/* We found an split_point CURRENT. NON_SSA_VARS is bitmap of all non ssa
variables used and RETURN_BB is return basic block.
See if we can split function here. */
static void
consider_split (struct split_point *current, bitmap non_ssa_vars,
basic_block return_bb)
{
tree parm;
unsigned int num_args = 0;
unsigned int call_overhead;
edge e;
edge_iterator ei;
gphi_iterator bsi;
unsigned int i;
int incoming_freq = 0;
tree retval;
tree retbnd;
bool back_edge = false;
if (dump_file && (dump_flags & TDF_DETAILS))
dump_split_point (dump_file, current);
FOR_EACH_EDGE (e, ei, current->entry_bb->preds)
{
if (e->flags & EDGE_DFS_BACK)
back_edge = true;
if (!bitmap_bit_p (current->split_bbs, e->src->index))
incoming_freq += EDGE_FREQUENCY (e);
}
/* Do not split when we would end up calling function anyway. */
if (incoming_freq
>= (ENTRY_BLOCK_PTR_FOR_FN (cfun)->frequency
* PARAM_VALUE (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY) / 100))
{
/* When profile is guessed, we can not expect it to give us
realistic estimate on likelyness of function taking the
complex path. As a special case, when tail of the function is
a loop, enable splitting since inlining code skipping the loop
is likely noticeable win. */
if (back_edge
&& profile_status_for_fn (cfun) != PROFILE_READ
&& incoming_freq < ENTRY_BLOCK_PTR_FOR_FN (cfun)->frequency)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" Split before loop, accepting despite low frequencies %i %i.\n",
incoming_freq,
ENTRY_BLOCK_PTR_FOR_FN (cfun)->frequency);
}
else
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" Refused: incoming frequency is too large.\n");
return;
}
}
if (!current->header_size)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, " Refused: header empty\n");
return;
}
/* Verify that PHI args on entry are either virtual or all their operands
incoming from header are the same. */
for (bsi = gsi_start_phis (current->entry_bb); !gsi_end_p (bsi); gsi_next (&bsi))
{
gphi *stmt = bsi.phi ();
tree val = NULL;
if (virtual_operand_p (gimple_phi_result (stmt)))
continue;
for (i = 0; i < gimple_phi_num_args (stmt); i++)
{
edge e = gimple_phi_arg_edge (stmt, i);
if (!bitmap_bit_p (current->split_bbs, e->src->index))
{
tree edge_val = gimple_phi_arg_def (stmt, i);
if (val && edge_val != val)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" Refused: entry BB has PHI with multiple variants\n");
return;
}
val = edge_val;
}
}
}
/* See what argument we will pass to the split function and compute
call overhead. */
call_overhead = eni_size_weights.call_cost;
for (parm = DECL_ARGUMENTS (current_function_decl); parm;
parm = DECL_CHAIN (parm))
{
if (!is_gimple_reg (parm))
{
if (bitmap_bit_p (non_ssa_vars, DECL_UID (parm)))
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" Refused: need to pass non-ssa param values\n");
return;
}
}
else
{
tree ddef = ssa_default_def (cfun, parm);
if (ddef
&& bitmap_bit_p (current->ssa_names_to_pass,
SSA_NAME_VERSION (ddef)))
{
if (!VOID_TYPE_P (TREE_TYPE (parm)))
call_overhead += estimate_move_cost (TREE_TYPE (parm), false);
num_args++;
}
}
}
if (!VOID_TYPE_P (TREE_TYPE (current_function_decl)))
call_overhead += estimate_move_cost (TREE_TYPE (current_function_decl),
false);
if (current->split_size <= call_overhead)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" Refused: split size is smaller than call overhead\n");
return;
}
if (current->header_size + call_overhead
>= (unsigned int)(DECL_DECLARED_INLINE_P (current_function_decl)
? MAX_INLINE_INSNS_SINGLE
: MAX_INLINE_INSNS_AUTO))
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" Refused: header size is too large for inline candidate\n");
return;
}
/* FIXME: we currently can pass only SSA function parameters to the split
arguments. Once parm_adjustment infrastructure is supported by cloning,
we can pass more than that. */
if (num_args != bitmap_count_bits (current->ssa_names_to_pass))
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" Refused: need to pass non-param values\n");
return;
}
/* When there are non-ssa vars used in the split region, see if they
are used in the header region. If so, reject the split.
FIXME: we can use nested function support to access both. */
if (!bitmap_empty_p (non_ssa_vars)
&& !verify_non_ssa_vars (current, non_ssa_vars, return_bb))
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" Refused: split part has non-ssa uses\n");
return;
}
/* If the split point is dominated by a forbidden block, reject
the split. */
if (!bitmap_empty_p (forbidden_dominators)
&& dominated_by_forbidden (current->entry_bb))
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" Refused: split point dominated by forbidden block\n");
return;
}
/* See if retval used by return bb is computed by header or split part.
When it is computed by split part, we need to produce return statement
in the split part and add code to header to pass it around.
This is bit tricky to test:
1) When there is no return_bb or no return value, we always pass
value around.
2) Invariants are always computed by caller.
3) For SSA we need to look if defining statement is in header or split part
4) For non-SSA we need to look where the var is computed. */
retval = find_retval (return_bb);
if (!retval)
current->split_part_set_retval = true;
else if (is_gimple_min_invariant (retval))
current->split_part_set_retval = false;
/* Special case is value returned by reference we record as if it was non-ssa
set to result_decl. */
else if (TREE_CODE (retval) == SSA_NAME
&& SSA_NAME_VAR (retval)
&& TREE_CODE (SSA_NAME_VAR (retval)) == RESULT_DECL
&& DECL_BY_REFERENCE (DECL_RESULT (current_function_decl)))
current->split_part_set_retval
= bitmap_bit_p (non_ssa_vars, DECL_UID (SSA_NAME_VAR (retval)));
else if (TREE_CODE (retval) == SSA_NAME)
current->split_part_set_retval
= split_part_set_ssa_name_p (retval, current, return_bb);
else if (TREE_CODE (retval) == PARM_DECL)
current->split_part_set_retval = false;
else if (TREE_CODE (retval) == VAR_DECL
|| TREE_CODE (retval) == RESULT_DECL)
current->split_part_set_retval
= bitmap_bit_p (non_ssa_vars, DECL_UID (retval));
else
current->split_part_set_retval = true;
/* See if retbnd used by return bb is computed by header or split part. */
retbnd = find_retbnd (return_bb);
if (retbnd)
{
bool split_part_set_retbnd
= split_part_set_ssa_name_p (retbnd, current, return_bb);
/* If we have both return value and bounds then keep their definitions
in a single function. We use SSA names to link returned bounds and
value and therefore do not handle cases when result is passed by
reference (which should not be our case anyway since bounds are
returned for pointers only). */
if ((DECL_BY_REFERENCE (DECL_RESULT (current_function_decl))
&& current->split_part_set_retval)
|| split_part_set_retbnd != current->split_part_set_retval)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" Refused: split point splits return value and bounds\n");
return;
}
}
/* split_function fixes up at most one PHI non-virtual PHI node in return_bb,
for the return value. If there are other PHIs, give up. */
if (return_bb != EXIT_BLOCK_PTR_FOR_FN (cfun))
{
gphi_iterator psi;
for (psi = gsi_start_phis (return_bb); !gsi_end_p (psi); gsi_next (&psi))
if (!virtual_operand_p (gimple_phi_result (psi.phi ()))
&& !(retval
&& current->split_part_set_retval
&& TREE_CODE (retval) == SSA_NAME
&& !DECL_BY_REFERENCE (DECL_RESULT (current_function_decl))
&& SSA_NAME_DEF_STMT (retval) == psi.phi ()))
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" Refused: return bb has extra PHIs\n");
return;
}
}
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, " Accepted!\n");
/* At the moment chose split point with lowest frequency and that leaves
out smallest size of header.
In future we might re-consider this heuristics. */
if (!best_split_point.split_bbs
|| best_split_point.entry_bb->frequency > current->entry_bb->frequency
|| (best_split_point.entry_bb->frequency == current->entry_bb->frequency
&& best_split_point.split_size < current->split_size))
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, " New best split point!\n");
if (best_split_point.ssa_names_to_pass)
{
BITMAP_FREE (best_split_point.ssa_names_to_pass);
BITMAP_FREE (best_split_point.split_bbs);
}
best_split_point = *current;
best_split_point.ssa_names_to_pass = BITMAP_ALLOC (NULL);
bitmap_copy (best_split_point.ssa_names_to_pass,
current->ssa_names_to_pass);
best_split_point.split_bbs = BITMAP_ALLOC (NULL);
bitmap_copy (best_split_point.split_bbs, current->split_bbs);
}
}
/* Return basic block containing RETURN statement. We allow basic blocks
of the form:
<retval> = tmp_var;
return <retval>
but return_bb can not be more complex than this.
If nothing is found, return the exit block.
When there are multiple RETURN statement, chose one with return value,
since that one is more likely shared by multiple code paths.
Return BB is special, because for function splitting it is the only
basic block that is duplicated in between header and split part of the
function.
TODO: We might support multiple return blocks. */
static basic_block
find_return_bb (void)
{
edge e;
basic_block return_bb = EXIT_BLOCK_PTR_FOR_FN (cfun);
gimple_stmt_iterator bsi;
bool found_return = false;
tree retval = NULL_TREE;
if (!single_pred_p (EXIT_BLOCK_PTR_FOR_FN (cfun)))
return return_bb;
e = single_pred_edge (EXIT_BLOCK_PTR_FOR_FN (cfun));
for (bsi = gsi_last_bb (e->src); !gsi_end_p (bsi); gsi_prev (&bsi))
{
gimple stmt = gsi_stmt (bsi);
if (gimple_code (stmt) == GIMPLE_LABEL
|| is_gimple_debug (stmt)
|| gimple_clobber_p (stmt))
;
else if (gimple_code (stmt) == GIMPLE_ASSIGN
&& found_return
&& gimple_assign_single_p (stmt)
&& (auto_var_in_fn_p (gimple_assign_rhs1 (stmt),
current_function_decl)
|| is_gimple_min_invariant (gimple_assign_rhs1 (stmt)))
&& retval == gimple_assign_lhs (stmt))
;
else if (greturn *return_stmt = dyn_cast <greturn *> (stmt))
{
found_return = true;
retval = gimple_return_retval (return_stmt);
}
else
break;
}
if (gsi_end_p (bsi) && found_return)
return_bb = e->src;
return return_bb;
}
/* Given return basic block RETURN_BB, see where return value is really
stored. */
static tree
find_retval (basic_block return_bb)
{
gimple_stmt_iterator bsi;
for (bsi = gsi_start_bb (return_bb); !gsi_end_p (bsi); gsi_next (&bsi))
if (greturn *return_stmt = dyn_cast <greturn *> (gsi_stmt (bsi)))
return gimple_return_retval (return_stmt);
else if (gimple_code (gsi_stmt (bsi)) == GIMPLE_ASSIGN
&& !gimple_clobber_p (gsi_stmt (bsi)))
return gimple_assign_rhs1 (gsi_stmt (bsi));
return NULL;
}
/* Given return basic block RETURN_BB, see where return bounds are really
stored. */
static tree
find_retbnd (basic_block return_bb)
{
gimple_stmt_iterator bsi;
for (bsi = gsi_last_bb (return_bb); !gsi_end_p (bsi); gsi_prev (&bsi))
if (gimple_code (gsi_stmt (bsi)) == GIMPLE_RETURN)
return gimple_return_retbnd (gsi_stmt (bsi));
return NULL;
}
/* Callback for walk_stmt_load_store_addr_ops. If T is non-SSA automatic
variable, mark it as used in bitmap passed via DATA.
Return true when access to T prevents splitting the function. */
static bool
mark_nonssa_use (gimple, tree t, tree, void *data)
{
t = get_base_address (t);
if (!t || is_gimple_reg (t))
return false;
/* At present we can't pass non-SSA arguments to split function.
FIXME: this can be relaxed by passing references to arguments. */
if (TREE_CODE (t) == PARM_DECL)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
"Cannot split: use of non-ssa function parameter.\n");
return true;
}
if ((TREE_CODE (t) == VAR_DECL
&& auto_var_in_fn_p (t, current_function_decl))
|| TREE_CODE (t) == RESULT_DECL
|| (TREE_CODE (t) == LABEL_DECL
&& FORCED_LABEL (t)))
bitmap_set_bit ((bitmap)data, DECL_UID (t));
/* For DECL_BY_REFERENCE, the return value is actually a pointer. We want
to pretend that the value pointed to is actual result decl. */
if ((TREE_CODE (t) == MEM_REF || INDIRECT_REF_P (t))
&& TREE_CODE (TREE_OPERAND (t, 0)) == SSA_NAME
&& SSA_NAME_VAR (TREE_OPERAND (t, 0))
&& TREE_CODE (SSA_NAME_VAR (TREE_OPERAND (t, 0))) == RESULT_DECL
&& DECL_BY_REFERENCE (DECL_RESULT (current_function_decl)))
return
bitmap_bit_p ((bitmap)data,
DECL_UID (DECL_RESULT (current_function_decl)));
return false;
}
/* Compute local properties of basic block BB we collect when looking for
split points. We look for ssa defs and store them in SET_SSA_NAMES,
for ssa uses and store them in USED_SSA_NAMES and for any non-SSA automatic
vars stored in NON_SSA_VARS.
When BB has edge to RETURN_BB, collect uses in RETURN_BB too.
Return false when BB contains something that prevents it from being put into
split function. */
static bool
visit_bb (basic_block bb, basic_block return_bb,
bitmap set_ssa_names, bitmap used_ssa_names,
bitmap non_ssa_vars)
{
edge e;
edge_iterator ei;
bool can_split = true;
for (gimple_stmt_iterator bsi = gsi_start_bb (bb); !gsi_end_p (bsi);
gsi_next (&bsi))
{
gimple stmt = gsi_stmt (bsi);
tree op;
ssa_op_iter iter;
tree decl;
if (is_gimple_debug (stmt))
continue;
if (gimple_clobber_p (stmt))
continue;
/* FIXME: We can split regions containing EH. We can not however
split RESX, EH_DISPATCH and EH_POINTER referring to same region
into different partitions. This would require tracking of
EH regions and checking in consider_split_point if they
are not used elsewhere. */
if (gimple_code (stmt) == GIMPLE_RESX)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Cannot split: resx.\n");
can_split = false;
}
if (gimple_code (stmt) == GIMPLE_EH_DISPATCH)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Cannot split: eh dispatch.\n");
can_split = false;
}
/* Check builtins that prevent splitting. */
if (gimple_code (stmt) == GIMPLE_CALL
&& (decl = gimple_call_fndecl (stmt)) != NULL_TREE
&& DECL_BUILT_IN (decl)
&& DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
switch (DECL_FUNCTION_CODE (decl))
{
/* FIXME: once we will allow passing non-parm values to split part,
we need to be sure to handle correct builtin_stack_save and
builtin_stack_restore. At the moment we are safe; there is no
way to store builtin_stack_save result in non-SSA variable
since all calls to those are compiler generated. */
case BUILT_IN_APPLY:
case BUILT_IN_APPLY_ARGS:
case BUILT_IN_VA_START:
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
"Cannot split: builtin_apply and va_start.\n");
can_split = false;
break;
case BUILT_IN_EH_POINTER:
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Cannot split: builtin_eh_pointer.\n");
can_split = false;
break;
default:
break;
}
FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_DEF)
bitmap_set_bit (set_ssa_names, SSA_NAME_VERSION (op));
FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_USE)
bitmap_set_bit (used_ssa_names, SSA_NAME_VERSION (op));
can_split &= !walk_stmt_load_store_addr_ops (stmt, non_ssa_vars,
mark_nonssa_use,
mark_nonssa_use,
mark_nonssa_use);
}
for (gphi_iterator bsi = gsi_start_phis (bb); !gsi_end_p (bsi);
gsi_next (&bsi))
{
gphi *stmt = bsi.phi ();
unsigned int i;
if (virtual_operand_p (gimple_phi_result (stmt)))
continue;
bitmap_set_bit (set_ssa_names,
SSA_NAME_VERSION (gimple_phi_result (stmt)));
for (i = 0; i < gimple_phi_num_args (stmt); i++)
{
tree op = gimple_phi_arg_def (stmt, i);
if (TREE_CODE (op) == SSA_NAME)
bitmap_set_bit (used_ssa_names, SSA_NAME_VERSION (op));
}
can_split &= !walk_stmt_load_store_addr_ops (stmt, non_ssa_vars,
mark_nonssa_use,
mark_nonssa_use,
mark_nonssa_use);
}
/* Record also uses coming from PHI operand in return BB. */
FOR_EACH_EDGE (e, ei, bb->succs)
if (e->dest == return_bb)
{
for (gphi_iterator bsi = gsi_start_phis (return_bb);
!gsi_end_p (bsi);
gsi_next (&bsi))
{
gphi *stmt = bsi.phi ();
tree op = gimple_phi_arg_def (stmt, e->dest_idx);
if (virtual_operand_p (gimple_phi_result (stmt)))
continue;
if (TREE_CODE (op) == SSA_NAME)
bitmap_set_bit (used_ssa_names, SSA_NAME_VERSION (op));
else
can_split &= !mark_nonssa_use (stmt, op, op, non_ssa_vars);
}
}
return can_split;
}
/* Stack entry for recursive DFS walk in find_split_point. */
typedef struct
{
/* Basic block we are examining. */
basic_block bb;
/* SSA names set and used by the BB and all BBs reachable
from it via DFS walk. */
bitmap set_ssa_names, used_ssa_names;
bitmap non_ssa_vars;
/* All BBS visited from this BB via DFS walk. */
bitmap bbs_visited;
/* Last examined edge in DFS walk. Since we walk unoriented graph,
the value is up to sum of incoming and outgoing edges of BB. */
unsigned int edge_num;
/* Stack entry index of earliest BB reachable from current BB
or any BB visited later in DFS walk. */
int earliest;
/* Overall time and size of all BBs reached from this BB in DFS walk. */
int overall_time, overall_size;
/* When false we can not split on this BB. */
bool can_split;
} stack_entry;
/* Find all articulations and call consider_split on them.
OVERALL_TIME and OVERALL_SIZE is time and size of the function.
We perform basic algorithm for finding an articulation in a graph
created from CFG by considering it to be an unoriented graph.
The articulation is discovered via DFS walk. We collect earliest
basic block on stack that is reachable via backward edge. Articulation
is any basic block such that there is no backward edge bypassing it.
To reduce stack usage we maintain heap allocated stack in STACK vector.
AUX pointer of BB is set to index it appears in the stack or -1 once
it is visited and popped off the stack.
The algorithm finds articulation after visiting the whole component
reachable by it. This makes it convenient to collect information about
the component used by consider_split. */
static void
find_split_points (int overall_time, int overall_size)
{
stack_entry first;
vec<stack_entry> stack = vNULL;
basic_block bb;
basic_block return_bb = find_return_bb ();
struct split_point current;
current.header_time = overall_time;
current.header_size = overall_size;
current.split_time = 0;
current.split_size = 0;
current.ssa_names_to_pass = BITMAP_ALLOC (NULL);
first.bb = ENTRY_BLOCK_PTR_FOR_FN (cfun);
first.edge_num = 0;
first.overall_time = 0;
first.overall_size = 0;
first.earliest = INT_MAX;
first.set_ssa_names = 0;
first.used_ssa_names = 0;
first.non_ssa_vars = 0;
first.bbs_visited = 0;
first.can_split = false;
stack.safe_push (first);
ENTRY_BLOCK_PTR_FOR_FN (cfun)->aux = (void *)(intptr_t)-1;
while (!stack.is_empty ())
{
stack_entry *entry = &stack.last ();
/* We are walking an acyclic graph, so edge_num counts
succ and pred edges together. However when considering
articulation, we want to have processed everything reachable
from articulation but nothing that reaches into it. */
if (entry->edge_num == EDGE_COUNT (entry->bb->succs)
&& entry->bb != ENTRY_BLOCK_PTR_FOR_FN (cfun))
{
int pos = stack.length ();
entry->can_split &= visit_bb (entry->bb, return_bb,
entry->set_ssa_names,
entry->used_ssa_names,
entry->non_ssa_vars);
if (pos <= entry->earliest && !entry->can_split
&& dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
"found articulation at bb %i but can not split\n",
entry->bb->index);
if (pos <= entry->earliest && entry->can_split)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "found articulation at bb %i\n",
entry->bb->index);
current.entry_bb = entry->bb;
current.ssa_names_to_pass = BITMAP_ALLOC (NULL);
bitmap_and_compl (current.ssa_names_to_pass,
entry->used_ssa_names, entry->set_ssa_names);
current.header_time = overall_time - entry->overall_time;
current.header_size = overall_size - entry->overall_size;
current.split_time = entry->overall_time;
current.split_size = entry->overall_size;
current.split_bbs = entry->bbs_visited;
consider_split (¤t, entry->non_ssa_vars, return_bb);
BITMAP_FREE (current.ssa_names_to_pass);
}
}
/* Do actual DFS walk. */
if (entry->edge_num
< (EDGE_COUNT (entry->bb->succs)
+ EDGE_COUNT (entry->bb->preds)))
{
edge e;
basic_block dest;
if (entry->edge_num < EDGE_COUNT (entry->bb->succs))
{
e = EDGE_SUCC (entry->bb, entry->edge_num);
dest = e->dest;
}
else
{
e = EDGE_PRED (entry->bb, entry->edge_num
- EDGE_COUNT (entry->bb->succs));
dest = e->src;
}
entry->edge_num++;
/* New BB to visit, push it to the stack. */
if (dest != return_bb && dest != EXIT_BLOCK_PTR_FOR_FN (cfun)
&& !dest->aux)
{
stack_entry new_entry;
new_entry.bb = dest;
new_entry.edge_num = 0;
new_entry.overall_time
= bb_info_vec[dest->index].time;
new_entry.overall_size
= bb_info_vec[dest->index].size;
new_entry.earliest = INT_MAX;
new_entry.set_ssa_names = BITMAP_ALLOC (NULL);
new_entry.used_ssa_names = BITMAP_ALLOC (NULL);
new_entry.bbs_visited = BITMAP_ALLOC (NULL);
new_entry.non_ssa_vars = BITMAP_ALLOC (NULL);
new_entry.can_split = true;
bitmap_set_bit (new_entry.bbs_visited, dest->index);
stack.safe_push (new_entry);
dest->aux = (void *)(intptr_t)stack.length ();
}
/* Back edge found, record the earliest point. */
else if ((intptr_t)dest->aux > 0
&& (intptr_t)dest->aux < entry->earliest)
entry->earliest = (intptr_t)dest->aux;
}
/* We are done with examining the edges. Pop off the value from stack
and merge stuff we accumulate during the walk. */
else if (entry->bb != ENTRY_BLOCK_PTR_FOR_FN (cfun))
{
stack_entry *prev = &stack[stack.length () - 2];
entry->bb->aux = (void *)(intptr_t)-1;
prev->can_split &= entry->can_split;
if (prev->set_ssa_names)
{
bitmap_ior_into (prev->set_ssa_names, entry->set_ssa_names);
bitmap_ior_into (prev->used_ssa_names, entry->used_ssa_names);
bitmap_ior_into (prev->bbs_visited, entry->bbs_visited);
bitmap_ior_into (prev->non_ssa_vars, entry->non_ssa_vars);
}
if (prev->earliest > entry->earliest)
prev->earliest = entry->earliest;
prev->overall_time += entry->overall_time;
prev->overall_size += entry->overall_size;
BITMAP_FREE (entry->set_ssa_names);
BITMAP_FREE (entry->used_ssa_names);
BITMAP_FREE (entry->bbs_visited);
BITMAP_FREE (entry->non_ssa_vars);
stack.pop ();
}
else
stack.pop ();
}
ENTRY_BLOCK_PTR_FOR_FN (cfun)->aux = NULL;
FOR_EACH_BB_FN (bb, cfun)
bb->aux = NULL;
stack.release ();
BITMAP_FREE (current.ssa_names_to_pass);
}
/* Build and insert initialization of returned bounds RETBND
for returned value RETVAL. Statements are inserted after
a statement pointed by GSI and GSI is modified to point to
the last inserted statement. */
static void
insert_bndret_call_after (tree retbnd, tree retval, gimple_stmt_iterator *gsi)
{
tree fndecl = targetm.builtin_chkp_function (BUILT_IN_CHKP_BNDRET);
gimple bndret = gimple_build_call (fndecl, 1, retval);
gimple_call_set_lhs (bndret, retbnd);
gsi_insert_after (gsi, bndret, GSI_CONTINUE_LINKING);
}
/* Split function at SPLIT_POINT. */
static void
split_function (struct split_point *split_point)
{
vec<tree> args_to_pass = vNULL;
bitmap args_to_skip;
tree parm;
int num = 0;
cgraph_node *node, *cur_node = cgraph_node::get (current_function_decl);
basic_block return_bb = find_return_bb ();
basic_block call_bb;
gcall *call;
edge e;
edge_iterator ei;
tree retval = NULL, real_retval = NULL, retbnd = NULL;
bool split_part_return_p = false;
bool with_bounds = chkp_function_instrumented_p (current_function_decl);
gimple last_stmt = NULL;
unsigned int i;
tree arg, ddef;
vec<tree, va_gc> **debug_args = NULL;
if (dump_file)
{
fprintf (dump_file, "\n\nSplitting function at:\n");
dump_split_point (dump_file, split_point);
}
if (cur_node->local.can_change_signature)
args_to_skip = BITMAP_ALLOC (NULL);
else
args_to_skip = NULL;
/* Collect the parameters of new function and args_to_skip bitmap. */
for (parm = DECL_ARGUMENTS (current_function_decl);
parm; parm = DECL_CHAIN (parm), num++)
if (args_to_skip
&& (!is_gimple_reg (parm)
|| (ddef = ssa_default_def (cfun, parm)) == NULL_TREE
|| !bitmap_bit_p (split_point->ssa_names_to_pass,
SSA_NAME_VERSION (ddef))))
bitmap_set_bit (args_to_skip, num);
else
{
/* This parm might not have been used up to now, but is going to be
used, hence register it. */
if (is_gimple_reg (parm))
arg = get_or_create_ssa_default_def (cfun, parm);
else
arg = parm;
if (!useless_type_conversion_p (DECL_ARG_TYPE (parm), TREE_TYPE (arg)))
arg = fold_convert (DECL_ARG_TYPE (parm), arg);
args_to_pass.safe_push (arg);
}
/* See if the split function will return. */
FOR_EACH_EDGE (e, ei, return_bb->preds)
if (bitmap_bit_p (split_point->split_bbs, e->src->index))
break;
if (e)
split_part_return_p = true;
/* Add return block to what will become the split function.
We do not return; no return block is needed. */
if (!split_part_return_p)
;
/* We have no return block, so nothing is needed. */
else if (return_bb == EXIT_BLOCK_PTR_FOR_FN (cfun))
;
/* When we do not want to return value, we need to construct
new return block with empty return statement.
FIXME: Once we are able to change return type, we should change function
to return void instead of just outputting function with undefined return
value. For structures this affects quality of codegen. */
else if (!split_point->split_part_set_retval
&& find_retval (return_bb))
{
bool redirected = true;
basic_block new_return_bb = create_basic_block (NULL, 0, return_bb);
gimple_stmt_iterator gsi = gsi_start_bb (new_return_bb);
gsi_insert_after (&gsi, gimple_build_return (NULL), GSI_NEW_STMT);
while (redirected)
{
redirected = false;
FOR_EACH_EDGE (e, ei, return_bb->preds)
if (bitmap_bit_p (split_point->split_bbs, e->src->index))
{
new_return_bb->count += e->count;
new_return_bb->frequency += EDGE_FREQUENCY (e);
redirect_edge_and_branch (e, new_return_bb);
redirected = true;
break;
}
}
e = make_edge (new_return_bb, EXIT_BLOCK_PTR_FOR_FN (cfun), 0);
e->probability = REG_BR_PROB_BASE;
e->count = new_return_bb->count;
add_bb_to_loop (new_return_bb, current_loops->tree_root);
bitmap_set_bit (split_point->split_bbs, new_return_bb->index);
}
/* When we pass around the value, use existing return block. */
else
bitmap_set_bit (split_point->split_bbs, return_bb->index);
/* If RETURN_BB has virtual operand PHIs, they must be removed and the
virtual operand marked for renaming as we change the CFG in a way that
tree-inline is not able to compensate for.
Note this can happen whether or not we have a return value. If we have
a return value, then RETURN_BB may have PHIs for real operands too. */
if (return_bb != EXIT_BLOCK_PTR_FOR_FN (cfun))
{
bool phi_p = false;
for (gphi_iterator gsi = gsi_start_phis (return_bb);
!gsi_end_p (gsi);)
{
gphi *stmt = gsi.phi ();
if (!virtual_operand_p (gimple_phi_result (stmt)))
{
gsi_next (&gsi);
continue;
}
mark_virtual_phi_result_for_renaming (stmt);
remove_phi_node (&gsi, true);
phi_p = true;
}
/* In reality we have to rename the reaching definition of the
virtual operand at return_bb as we will eventually release it
when we remove the code region we outlined.
So we have to rename all immediate virtual uses of that region
if we didn't see a PHI definition yet. */
/* ??? In real reality we want to set the reaching vdef of the
entry of the SESE region as the vuse of the call and the reaching
vdef of the exit of the SESE region as the vdef of the call. */
if (!phi_p)
for (gimple_stmt_iterator gsi = gsi_start_bb (return_bb);
!gsi_end_p (gsi);
gsi_next (&gsi))
{
gimple stmt = gsi_stmt (gsi);
if (gimple_vuse (stmt))
{
gimple_set_vuse (stmt, NULL_TREE);
update_stmt (stmt);
}
if (gimple_vdef (stmt))
break;
}
}
/* Now create the actual clone. */
cgraph_edge::rebuild_edges ();
node = cur_node->create_version_clone_with_body
(vNULL, NULL, args_to_skip, !split_part_return_p, split_point->split_bbs,
split_point->entry_bb, "part");
/* Let's take a time profile for splitted function. */
node->tp_first_run = cur_node->tp_first_run + 1;
/* For usual cloning it is enough to clear builtin only when signature
changes. For partial inlining we however can not expect the part
of builtin implementation to have same semantic as the whole. */
if (DECL_BUILT_IN (node->decl))
{
DECL_BUILT_IN_CLASS (node->decl) = NOT_BUILT_IN;
DECL_FUNCTION_CODE (node->decl) = (enum built_in_function) 0;
}
/* If the original function is instrumented then it's
part is also instrumented. */
if (with_bounds)
chkp_function_mark_instrumented (node->decl);
/* If the original function is declared inline, there is no point in issuing
a warning for the non-inlinable part. */
DECL_NO_INLINE_WARNING_P (node->decl) = 1;
cur_node->remove_callees ();
cur_node->remove_all_references ();
if (!split_part_return_p)
TREE_THIS_VOLATILE (node->decl) = 1;
if (dump_file)
dump_function_to_file (node->decl, dump_file, dump_flags);
/* Create the basic block we place call into. It is the entry basic block
split after last label. */
call_bb = split_point->entry_bb;
for (gimple_stmt_iterator gsi = gsi_start_bb (call_bb); !gsi_end_p (gsi);)
if (gimple_code (gsi_stmt (gsi)) == GIMPLE_LABEL)
{
last_stmt = gsi_stmt (gsi);
gsi_next (&gsi);
}
else
break;
e = split_block (split_point->entry_bb, last_stmt);
remove_edge (e);
/* Produce the call statement. */
gimple_stmt_iterator gsi = gsi_last_bb (call_bb);
FOR_EACH_VEC_ELT (args_to_pass, i, arg)
if (!is_gimple_val (arg))
{
arg = force_gimple_operand_gsi (&gsi, arg, true, NULL_TREE,
false, GSI_CONTINUE_LINKING);
args_to_pass[i] = arg;
}
call = gimple_build_call_vec (node->decl, args_to_pass);
gimple_call_set_with_bounds (call, with_bounds);
gimple_set_block (call, DECL_INITIAL (current_function_decl));
args_to_pass.release ();
/* For optimized away parameters, add on the caller side
before the call
DEBUG D#X => parm_Y(D)
stmts and associate D#X with parm in decl_debug_args_lookup
vector to say for debug info that if parameter parm had been passed,
it would have value parm_Y(D). */
if (args_to_skip)
for (parm = DECL_ARGUMENTS (current_function_decl), num = 0;
parm; parm = DECL_CHAIN (parm), num++)
if (bitmap_bit_p (args_to_skip, num)
&& is_gimple_reg (parm))
{
tree ddecl;
gimple def_temp;
/* This needs to be done even without MAY_HAVE_DEBUG_STMTS,
otherwise if it didn't exist before, we'd end up with
different SSA_NAME_VERSIONs between -g and -g0. */
arg = get_or_create_ssa_default_def (cfun, parm);
if (!MAY_HAVE_DEBUG_STMTS)
continue;
if (debug_args == NULL)
debug_args = decl_debug_args_insert (node->decl);
ddecl = make_node (DEBUG_EXPR_DECL);
DECL_ARTIFICIAL (ddecl) = 1;
TREE_TYPE (ddecl) = TREE_TYPE (parm);
DECL_MODE (ddecl) = DECL_MODE (parm);
vec_safe_push (*debug_args, DECL_ORIGIN (parm));
vec_safe_push (*debug_args, ddecl);
def_temp = gimple_build_debug_bind (ddecl, unshare_expr (arg),
call);
gsi_insert_after (&gsi, def_temp, GSI_NEW_STMT);
}
/* And on the callee side, add
DEBUG D#Y s=> parm
DEBUG var => D#Y
stmts to the first bb where var is a VAR_DECL created for the
optimized away parameter in DECL_INITIAL block. This hints
in the debug info that var (whole DECL_ORIGIN is the parm PARM_DECL)
is optimized away, but could be looked up at the call site
as value of D#X there. */
if (debug_args != NULL)
{
unsigned int i;
tree var, vexpr;
gimple_stmt_iterator cgsi;
gimple def_temp;
push_cfun (DECL_STRUCT_FUNCTION (node->decl));
var = BLOCK_VARS (DECL_INITIAL (node->decl));
i = vec_safe_length (*debug_args);
cgsi = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun)));
do
{
i -= 2;
while (var != NULL_TREE
&& DECL_ABSTRACT_ORIGIN (var) != (**debug_args)[i])
var = TREE_CHAIN (var);
if (var == NULL_TREE)
break;
vexpr = make_node (DEBUG_EXPR_DECL);
parm = (**debug_args)[i];
DECL_ARTIFICIAL (vexpr) = 1;
TREE_TYPE (vexpr) = TREE_TYPE (parm);
DECL_MODE (vexpr) = DECL_MODE (parm);
def_temp = gimple_build_debug_source_bind (vexpr, parm,
NULL);
gsi_insert_before (&cgsi, def_temp, GSI_SAME_STMT);
def_temp = gimple_build_debug_bind (var, vexpr, NULL);
gsi_insert_before (&cgsi, def_temp, GSI_SAME_STMT);
}
while (i);
pop_cfun ();
}
/* We avoid address being taken on any variable used by split part,
so return slot optimization is always possible. Moreover this is
required to make DECL_BY_REFERENCE work. */
if (aggregate_value_p (DECL_RESULT (current_function_decl),
TREE_TYPE (current_function_decl))
&& (!is_gimple_reg_type (TREE_TYPE (DECL_RESULT (current_function_decl)))
|| DECL_BY_REFERENCE (DECL_RESULT (current_function_decl))))
gimple_call_set_return_slot_opt (call, true);
/* Update return value. This is bit tricky. When we do not return,
do nothing. When we return we might need to update return_bb
or produce a new return statement. */
if (!split_part_return_p)
gsi_insert_after (&gsi, call, GSI_NEW_STMT);
else
{
e = make_edge (call_bb, return_bb,
return_bb == EXIT_BLOCK_PTR_FOR_FN (cfun)
? 0 : EDGE_FALLTHRU);
e->count = call_bb->count;
e->probability = REG_BR_PROB_BASE;
/* If there is return basic block, see what value we need to store
return value into and put call just before it. */
if (return_bb != EXIT_BLOCK_PTR_FOR_FN (cfun))
{
real_retval = retval = find_retval (return_bb);
retbnd = find_retbnd (return_bb);
if (real_retval && split_point->split_part_set_retval)
{
gphi_iterator psi;
/* See if we need new SSA_NAME for the result.
When DECL_BY_REFERENCE is true, retval is actually pointer to
return value and it is constant in whole function. */
if (TREE_CODE (retval) == SSA_NAME
&& !DECL_BY_REFERENCE (DECL_RESULT (current_function_decl)))
{
retval = copy_ssa_name (retval, call);
/* See if there is PHI defining return value. */
for (psi = gsi_start_phis (return_bb);
!gsi_end_p (psi); gsi_next (&psi))
if (!virtual_operand_p (gimple_phi_result (psi.phi ())))
break;
/* When there is PHI, just update its value. */
if (TREE_CODE (retval) == SSA_NAME
&& !gsi_end_p (psi))
add_phi_arg (psi.phi (), retval, e, UNKNOWN_LOCATION);
/* Otherwise update the return BB itself.
find_return_bb allows at most one assignment to return value,
so update first statement. */
else
{
gimple_stmt_iterator bsi;
for (bsi = gsi_start_bb (return_bb); !gsi_end_p (bsi);
gsi_next (&bsi))
if (greturn *return_stmt
= dyn_cast <greturn *> (gsi_stmt (bsi)))
{
gimple_return_set_retval (return_stmt, retval);
break;
}
else if (gimple_code (gsi_stmt (bsi)) == GIMPLE_ASSIGN
&& !gimple_clobber_p (gsi_stmt (bsi)))
{
gimple_assign_set_rhs1 (gsi_stmt (bsi), retval);
break;
}
update_stmt (gsi_stmt (bsi));
}
/* Replace retbnd with new one. */
if (retbnd)
{
gimple_stmt_iterator bsi;
for (bsi = gsi_last_bb (return_bb); !gsi_end_p (bsi);
gsi_prev (&bsi))
if (gimple_code (gsi_stmt (bsi)) == GIMPLE_RETURN)
{
retbnd = copy_ssa_name (retbnd, call);
gimple_return_set_retbnd (gsi_stmt (bsi), retbnd);
update_stmt (gsi_stmt (bsi));
break;
}
}
}
if (DECL_BY_REFERENCE (DECL_RESULT (current_function_decl)))
{
gimple_call_set_lhs (call, build_simple_mem_ref (retval));
gsi_insert_after (&gsi, call, GSI_NEW_STMT);
}
else
{
tree restype;
restype = TREE_TYPE (DECL_RESULT (current_function_decl));
gsi_insert_after (&gsi, call, GSI_NEW_STMT);
if (!useless_type_conversion_p (TREE_TYPE (retval), restype))
{
gimple cpy;
tree tem = create_tmp_reg (restype);
tem = make_ssa_name (tem, call);
cpy = gimple_build_assign (retval, NOP_EXPR, tem);
gsi_insert_after (&gsi, cpy, GSI_NEW_STMT);
retval = tem;
}
/* Build bndret call to obtain returned bounds. */
if (retbnd)
insert_bndret_call_after (retbnd, retval, &gsi);
gimple_call_set_lhs (call, retval);
update_stmt (call);
}
}
else
gsi_insert_after (&gsi, call, GSI_NEW_STMT);
}
/* We don't use return block (there is either no return in function or
multiple of them). So create new basic block with return statement.
*/
else
{
greturn *ret;
if (split_point->split_part_set_retval
&& !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
{
retval = DECL_RESULT (current_function_decl);
if (chkp_function_instrumented_p (current_function_decl)
&& BOUNDED_P (retval))
retbnd = create_tmp_reg (pointer_bounds_type_node);
/* We use temporary register to hold value when aggregate_value_p
is false. Similarly for DECL_BY_REFERENCE we must avoid extra
copy. */
if (!aggregate_value_p (retval, TREE_TYPE (current_function_decl))
&& !DECL_BY_REFERENCE (retval))
retval = create_tmp_reg (TREE_TYPE (retval));
if (is_gimple_reg (retval))
{
/* When returning by reference, there is only one SSA name
assigned to RESULT_DECL (that is pointer to return value).
Look it up or create new one if it is missing. */
if (DECL_BY_REFERENCE (retval))
retval = get_or_create_ssa_default_def (cfun, retval);
/* Otherwise produce new SSA name for return value. */
else
retval = make_ssa_name (retval, call);
}
if (DECL_BY_REFERENCE (DECL_RESULT (current_function_decl)))
gimple_call_set_lhs (call, build_simple_mem_ref (retval));
else
gimple_call_set_lhs (call, retval);
}
gsi_insert_after (&gsi, call, GSI_NEW_STMT);
/* Build bndret call to obtain returned bounds. */
if (retbnd)
insert_bndret_call_after (retbnd, retval, &gsi);
ret = gimple_build_return (retval);
gsi_insert_after (&gsi, ret, GSI_NEW_STMT);
}
}
free_dominance_info (CDI_DOMINATORS);
free_dominance_info (CDI_POST_DOMINATORS);
compute_inline_parameters (node, true);
}
/* Execute function splitting pass. */
static unsigned int
execute_split_functions (void)
{
gimple_stmt_iterator bsi;
basic_block bb;
int overall_time = 0, overall_size = 0;
int todo = 0;
struct cgraph_node *node = cgraph_node::get (current_function_decl);
if (flags_from_decl_or_type (current_function_decl)
& (ECF_NORETURN|ECF_MALLOC))
{
if (dump_file)
fprintf (dump_file, "Not splitting: noreturn/malloc function.\n");
return 0;
}
if (MAIN_NAME_P (DECL_NAME (current_function_decl)))
{
if (dump_file)
fprintf (dump_file, "Not splitting: main function.\n");
return 0;
}
/* This can be relaxed; function might become inlinable after splitting
away the uninlinable part. */
if (inline_edge_summary_vec.exists ()
&& !inline_summary (node)->inlinable)
{
if (dump_file)
fprintf (dump_file, "Not splitting: not inlinable.\n");
return 0;
}
if (DECL_DISREGARD_INLINE_LIMITS (node->decl))
{
if (dump_file)
fprintf (dump_file, "Not splitting: disregarding inline limits.\n");
return 0;
}
/* This can be relaxed; most of versioning tests actually prevents
a duplication. */
if (!tree_versionable_function_p (current_function_decl))
{
if (dump_file)
fprintf (dump_file, "Not splitting: not versionable.\n");
return 0;
}
/* FIXME: we could support this. */
if (DECL_STRUCT_FUNCTION (current_function_decl)->static_chain_decl)
{
if (dump_file)
fprintf (dump_file, "Not splitting: nested function.\n");
return 0;
}
/* See if it makes sense to try to split.
It makes sense to split if we inline, that is if we have direct calls to
handle or direct calls are possibly going to appear as result of indirect
inlining or LTO. Also handle -fprofile-generate as LTO to allow non-LTO
training for LTO -fprofile-use build.
Note that we are not completely conservative about disqualifying functions
called once. It is possible that the caller is called more then once and
then inlining would still benefit. */
if ((!node->callers
/* Local functions called once will be completely inlined most of time. */
|| (!node->callers->next_caller && node->local.local))
&& !node->address_taken
&& (!flag_lto || !node->externally_visible))
{
if (dump_file)
fprintf (dump_file, "Not splitting: not called directly "
"or called once.\n");
return 0;
}
/* FIXME: We can actually split if splitting reduces call overhead. */
if (!flag_inline_small_functions
&& !DECL_DECLARED_INLINE_P (current_function_decl))
{
if (dump_file)
fprintf (dump_file, "Not splitting: not autoinlining and function"
" is not inline.\n");
return 0;
}
/* We enforce splitting after loop headers when profile info is not
available. */
if (profile_status_for_fn (cfun) != PROFILE_READ)
mark_dfs_back_edges ();
/* Initialize bitmap to track forbidden calls. */
forbidden_dominators = BITMAP_ALLOC (NULL);
calculate_dominance_info (CDI_DOMINATORS);
/* Compute local info about basic blocks and determine function size/time. */
bb_info_vec.safe_grow_cleared (last_basic_block_for_fn (cfun) + 1);
memset (&best_split_point, 0, sizeof (best_split_point));
FOR_EACH_BB_FN (bb, cfun)
{
int time = 0;
int size = 0;
int freq = compute_call_stmt_bb_frequency (current_function_decl, bb);
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Basic block %i\n", bb->index);
for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
{
int this_time, this_size;
gimple stmt = gsi_stmt (bsi);
this_size = estimate_num_insns (stmt, &eni_size_weights);
this_time = estimate_num_insns (stmt, &eni_time_weights) * freq;
size += this_size;
time += this_time;
check_forbidden_calls (stmt);
if (dump_file && (dump_flags & TDF_DETAILS))
{
fprintf (dump_file, " freq:%6i size:%3i time:%3i ",
freq, this_size, this_time);
print_gimple_stmt (dump_file, stmt, 0, 0);
}
}
overall_time += time;
overall_size += size;
bb_info_vec[bb->index].time = time;
bb_info_vec[bb->index].size = size;
}
find_split_points (overall_time, overall_size);
if (best_split_point.split_bbs)
{
split_function (&best_split_point);
BITMAP_FREE (best_split_point.ssa_names_to_pass);
BITMAP_FREE (best_split_point.split_bbs);
todo = TODO_update_ssa | TODO_cleanup_cfg;
}
BITMAP_FREE (forbidden_dominators);
bb_info_vec.release ();
return todo;
}
namespace {
const pass_data pass_data_split_functions =
{
GIMPLE_PASS, /* type */
"fnsplit", /* name */
OPTGROUP_NONE, /* optinfo_flags */
TV_IPA_FNSPLIT, /* tv_id */
PROP_cfg, /* properties_required */
0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
0, /* todo_flags_finish */
};
class pass_split_functions : public gimple_opt_pass
{
public:
pass_split_functions (gcc::context *ctxt)
: gimple_opt_pass (pass_data_split_functions, ctxt)
{}
/* opt_pass methods: */
virtual bool gate (function *);
virtual unsigned int execute (function *)
{
return execute_split_functions ();
}
}; // class pass_split_functions
bool
pass_split_functions::gate (function *)
{
/* When doing profile feedback, we want to execute the pass after profiling
is read. So disable one in early optimization. */
return (flag_partial_inlining
&& !profile_arc_flag && !flag_branch_probabilities);
}
} // anon namespace
gimple_opt_pass *
make_pass_split_functions (gcc::context *ctxt)
{
return new pass_split_functions (ctxt);
}
/* Execute function splitting pass. */
static unsigned int
execute_feedback_split_functions (void)
{
unsigned int retval = execute_split_functions ();
if (retval)
retval |= TODO_rebuild_cgraph_edges;
return retval;
}
namespace {
const pass_data pass_data_feedback_split_functions =
{
GIMPLE_PASS, /* type */
"feedback_fnsplit", /* name */
OPTGROUP_NONE, /* optinfo_flags */
TV_IPA_FNSPLIT, /* tv_id */
PROP_cfg, /* properties_required */
0, /* properties_provided */
0, /* properties_destroyed */
0, /* todo_flags_start */
0, /* todo_flags_finish */
};
class pass_feedback_split_functions : public gimple_opt_pass
{
public:
pass_feedback_split_functions (gcc::context *ctxt)
: gimple_opt_pass (pass_data_feedback_split_functions, ctxt)
{}
/* opt_pass methods: */
virtual bool gate (function *);
virtual unsigned int execute (function *)
{
return execute_feedback_split_functions ();
}
}; // class pass_feedback_split_functions
bool
pass_feedback_split_functions::gate (function *)
{
/* We don't need to split when profiling at all, we are producing
lousy code anyway. */
return (flag_partial_inlining
&& flag_branch_probabilities);
}
} // anon namespace
gimple_opt_pass *
make_pass_feedback_split_functions (gcc::context *ctxt)
{
return new pass_feedback_split_functions (ctxt);
}
|