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
|
/* RTL-level loop invariant motion.
Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010
Free Software Foundation, Inc.
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/>. */
/* This implements the loop invariant motion pass. It is very simple
(no calls, no loads/stores, etc.). This should be sufficient to cleanup
things like address arithmetics -- other more complicated invariants should
be eliminated on GIMPLE either in tree-ssa-loop-im.c or in tree-ssa-pre.c.
We proceed loop by loop -- it is simpler than trying to handle things
globally and should not lose much. First we inspect all sets inside loop
and create a dependency graph on insns (saying "to move this insn, you must
also move the following insns").
We then need to determine what to move. We estimate the number of registers
used and move as many invariants as possible while we still have enough free
registers. We prefer the expensive invariants.
Then we move the selected invariants out of the loop, creating a new
temporaries for them if necessary. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "hard-reg-set.h"
#include "rtl.h"
#include "tm_p.h"
#include "obstack.h"
#include "basic-block.h"
#include "cfgloop.h"
#include "expr.h"
#include "recog.h"
#include "output.h"
#include "function.h"
#include "flags.h"
#include "df.h"
#include "hashtab.h"
#include "except.h"
#include "params.h"
#include "regs.h"
#include "ira.h"
/* The data stored for the loop. */
struct loop_data
{
struct loop *outermost_exit; /* The outermost exit of the loop. */
bool has_call; /* True if the loop contains a call. */
/* Maximal register pressure inside loop for given register class
(defined only for the pressure classes). */
int max_reg_pressure[N_REG_CLASSES];
/* Loop regs referenced and live pseudo-registers. */
bitmap_head regs_ref;
bitmap_head regs_live;
};
#define LOOP_DATA(LOOP) ((struct loop_data *) (LOOP)->aux)
/* The description of an use. */
struct use
{
rtx *pos; /* Position of the use. */
rtx insn; /* The insn in that the use occurs. */
unsigned addr_use_p; /* Whether the use occurs in an address. */
struct use *next; /* Next use in the list. */
};
/* The description of a def. */
struct def
{
struct use *uses; /* The list of uses that are uniquely reached
by it. */
unsigned n_uses; /* Number of such uses. */
unsigned n_addr_uses; /* Number of uses in addresses. */
unsigned invno; /* The corresponding invariant. */
};
/* The data stored for each invariant. */
struct invariant
{
/* The number of the invariant. */
unsigned invno;
/* The number of the invariant with the same value. */
unsigned eqto;
/* If we moved the invariant out of the loop, the register that contains its
value. */
rtx reg;
/* If we moved the invariant out of the loop, the original regno
that contained its value. */
int orig_regno;
/* The definition of the invariant. */
struct def *def;
/* The insn in that it is defined. */
rtx insn;
/* Whether it is always executed. */
bool always_executed;
/* Whether to move the invariant. */
bool move;
/* Whether the invariant is cheap when used as an address. */
bool cheap_address;
/* Cost of the invariant. */
unsigned cost;
/* The invariants it depends on. */
bitmap depends_on;
/* Used for detecting already visited invariants during determining
costs of movements. */
unsigned stamp;
};
/* Currently processed loop. */
static struct loop *curr_loop;
/* Table of invariants indexed by the df_ref uid field. */
static unsigned int invariant_table_size = 0;
static struct invariant ** invariant_table;
/* Entry for hash table of invariant expressions. */
struct invariant_expr_entry
{
/* The invariant. */
struct invariant *inv;
/* Its value. */
rtx expr;
/* Its mode. */
enum machine_mode mode;
/* Its hash. */
hashval_t hash;
};
/* The actual stamp for marking already visited invariants during determining
costs of movements. */
static unsigned actual_stamp;
typedef struct invariant *invariant_p;
DEF_VEC_P(invariant_p);
DEF_VEC_ALLOC_P(invariant_p, heap);
/* The invariants. */
static VEC(invariant_p,heap) *invariants;
/* Check the size of the invariant table and realloc if necessary. */
static void
check_invariant_table_size (void)
{
if (invariant_table_size < DF_DEFS_TABLE_SIZE())
{
unsigned int new_size = DF_DEFS_TABLE_SIZE () + (DF_DEFS_TABLE_SIZE () / 4);
invariant_table = XRESIZEVEC (struct invariant *, invariant_table, new_size);
memset (&invariant_table[invariant_table_size], 0,
(new_size - invariant_table_size) * sizeof (struct rtx_iv *));
invariant_table_size = new_size;
}
}
/* Test for possibility of invariantness of X. */
static bool
check_maybe_invariant (rtx x)
{
enum rtx_code code = GET_CODE (x);
int i, j;
const char *fmt;
switch (code)
{
case CONST_INT:
case CONST_DOUBLE:
case CONST_FIXED:
case SYMBOL_REF:
case CONST:
case LABEL_REF:
return true;
case PC:
case CC0:
case UNSPEC_VOLATILE:
case CALL:
return false;
case REG:
return true;
case MEM:
/* Load/store motion is done elsewhere. ??? Perhaps also add it here?
It should not be hard, and might be faster than "elsewhere". */
/* Just handle the most trivial case where we load from an unchanging
location (most importantly, pic tables). */
if (MEM_READONLY_P (x) && !MEM_VOLATILE_P (x))
break;
return false;
case ASM_OPERANDS:
/* Don't mess with insns declared volatile. */
if (MEM_VOLATILE_P (x))
return false;
break;
default:
break;
}
fmt = GET_RTX_FORMAT (code);
for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
{
if (fmt[i] == 'e')
{
if (!check_maybe_invariant (XEXP (x, i)))
return false;
}
else if (fmt[i] == 'E')
{
for (j = 0; j < XVECLEN (x, i); j++)
if (!check_maybe_invariant (XVECEXP (x, i, j)))
return false;
}
}
return true;
}
/* Returns the invariant definition for USE, or NULL if USE is not
invariant. */
static struct invariant *
invariant_for_use (df_ref use)
{
struct df_link *defs;
df_ref def;
basic_block bb = DF_REF_BB (use), def_bb;
if (DF_REF_FLAGS (use) & DF_REF_READ_WRITE)
return NULL;
defs = DF_REF_CHAIN (use);
if (!defs || defs->next)
return NULL;
def = defs->ref;
check_invariant_table_size ();
if (!invariant_table[DF_REF_ID(def)])
return NULL;
def_bb = DF_REF_BB (def);
if (!dominated_by_p (CDI_DOMINATORS, bb, def_bb))
return NULL;
return invariant_table[DF_REF_ID(def)];
}
/* Computes hash value for invariant expression X in INSN. */
static hashval_t
hash_invariant_expr_1 (rtx insn, rtx x)
{
enum rtx_code code = GET_CODE (x);
int i, j;
const char *fmt;
hashval_t val = code;
int do_not_record_p;
df_ref use;
struct invariant *inv;
switch (code)
{
case CONST_INT:
case CONST_DOUBLE:
case CONST_FIXED:
case SYMBOL_REF:
case CONST:
case LABEL_REF:
return hash_rtx (x, GET_MODE (x), &do_not_record_p, NULL, false);
case REG:
use = df_find_use (insn, x);
if (!use)
return hash_rtx (x, GET_MODE (x), &do_not_record_p, NULL, false);
inv = invariant_for_use (use);
if (!inv)
return hash_rtx (x, GET_MODE (x), &do_not_record_p, NULL, false);
gcc_assert (inv->eqto != ~0u);
return inv->eqto;
default:
break;
}
fmt = GET_RTX_FORMAT (code);
for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
{
if (fmt[i] == 'e')
val ^= hash_invariant_expr_1 (insn, XEXP (x, i));
else if (fmt[i] == 'E')
{
for (j = 0; j < XVECLEN (x, i); j++)
val ^= hash_invariant_expr_1 (insn, XVECEXP (x, i, j));
}
else if (fmt[i] == 'i' || fmt[i] == 'n')
val ^= XINT (x, i);
}
return val;
}
/* Returns true if the invariant expressions E1 and E2 used in insns INSN1
and INSN2 have always the same value. */
static bool
invariant_expr_equal_p (rtx insn1, rtx e1, rtx insn2, rtx e2)
{
enum rtx_code code = GET_CODE (e1);
int i, j;
const char *fmt;
df_ref use1, use2;
struct invariant *inv1 = NULL, *inv2 = NULL;
rtx sub1, sub2;
/* If mode of only one of the operands is VOIDmode, it is not equivalent to
the other one. If both are VOIDmode, we rely on the caller of this
function to verify that their modes are the same. */
if (code != GET_CODE (e2) || GET_MODE (e1) != GET_MODE (e2))
return false;
switch (code)
{
case CONST_INT:
case CONST_DOUBLE:
case CONST_FIXED:
case SYMBOL_REF:
case CONST:
case LABEL_REF:
return rtx_equal_p (e1, e2);
case REG:
use1 = df_find_use (insn1, e1);
use2 = df_find_use (insn2, e2);
if (use1)
inv1 = invariant_for_use (use1);
if (use2)
inv2 = invariant_for_use (use2);
if (!inv1 && !inv2)
return rtx_equal_p (e1, e2);
if (!inv1 || !inv2)
return false;
gcc_assert (inv1->eqto != ~0u);
gcc_assert (inv2->eqto != ~0u);
return inv1->eqto == inv2->eqto;
default:
break;
}
fmt = GET_RTX_FORMAT (code);
for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
{
if (fmt[i] == 'e')
{
sub1 = XEXP (e1, i);
sub2 = XEXP (e2, i);
if (!invariant_expr_equal_p (insn1, sub1, insn2, sub2))
return false;
}
else if (fmt[i] == 'E')
{
if (XVECLEN (e1, i) != XVECLEN (e2, i))
return false;
for (j = 0; j < XVECLEN (e1, i); j++)
{
sub1 = XVECEXP (e1, i, j);
sub2 = XVECEXP (e2, i, j);
if (!invariant_expr_equal_p (insn1, sub1, insn2, sub2))
return false;
}
}
else if (fmt[i] == 'i' || fmt[i] == 'n')
{
if (XINT (e1, i) != XINT (e2, i))
return false;
}
/* Unhandled type of subexpression, we fail conservatively. */
else
return false;
}
return true;
}
/* Returns hash value for invariant expression entry E. */
static hashval_t
hash_invariant_expr (const void *e)
{
const struct invariant_expr_entry *const entry =
(const struct invariant_expr_entry *) e;
return entry->hash;
}
/* Compares invariant expression entries E1 and E2. */
static int
eq_invariant_expr (const void *e1, const void *e2)
{
const struct invariant_expr_entry *const entry1 =
(const struct invariant_expr_entry *) e1;
const struct invariant_expr_entry *const entry2 =
(const struct invariant_expr_entry *) e2;
if (entry1->mode != entry2->mode)
return 0;
return invariant_expr_equal_p (entry1->inv->insn, entry1->expr,
entry2->inv->insn, entry2->expr);
}
/* Checks whether invariant with value EXPR in machine mode MODE is
recorded in EQ. If this is the case, return the invariant. Otherwise
insert INV to the table for this expression and return INV. */
static struct invariant *
find_or_insert_inv (htab_t eq, rtx expr, enum machine_mode mode,
struct invariant *inv)
{
hashval_t hash = hash_invariant_expr_1 (inv->insn, expr);
struct invariant_expr_entry *entry;
struct invariant_expr_entry pentry;
PTR *slot;
pentry.expr = expr;
pentry.inv = inv;
pentry.mode = mode;
slot = htab_find_slot_with_hash (eq, &pentry, hash, INSERT);
entry = (struct invariant_expr_entry *) *slot;
if (entry)
return entry->inv;
entry = XNEW (struct invariant_expr_entry);
entry->inv = inv;
entry->expr = expr;
entry->mode = mode;
entry->hash = hash;
*slot = entry;
return inv;
}
/* Finds invariants identical to INV and records the equivalence. EQ is the
hash table of the invariants. */
static void
find_identical_invariants (htab_t eq, struct invariant *inv)
{
unsigned depno;
bitmap_iterator bi;
struct invariant *dep;
rtx expr, set;
enum machine_mode mode;
if (inv->eqto != ~0u)
return;
EXECUTE_IF_SET_IN_BITMAP (inv->depends_on, 0, depno, bi)
{
dep = VEC_index (invariant_p, invariants, depno);
find_identical_invariants (eq, dep);
}
set = single_set (inv->insn);
expr = SET_SRC (set);
mode = GET_MODE (expr);
if (mode == VOIDmode)
mode = GET_MODE (SET_DEST (set));
inv->eqto = find_or_insert_inv (eq, expr, mode, inv)->invno;
if (dump_file && inv->eqto != inv->invno)
fprintf (dump_file,
"Invariant %d is equivalent to invariant %d.\n",
inv->invno, inv->eqto);
}
/* Find invariants with the same value and record the equivalences. */
static void
merge_identical_invariants (void)
{
unsigned i;
struct invariant *inv;
htab_t eq = htab_create (VEC_length (invariant_p, invariants),
hash_invariant_expr, eq_invariant_expr, free);
FOR_EACH_VEC_ELT (invariant_p, invariants, i, inv)
find_identical_invariants (eq, inv);
htab_delete (eq);
}
/* Determines the basic blocks inside LOOP that are always executed and
stores their bitmap to ALWAYS_REACHED. MAY_EXIT is a bitmap of
basic blocks that may either exit the loop, or contain the call that
does not have to return. BODY is body of the loop obtained by
get_loop_body_in_dom_order. */
static void
compute_always_reached (struct loop *loop, basic_block *body,
bitmap may_exit, bitmap always_reached)
{
unsigned i;
for (i = 0; i < loop->num_nodes; i++)
{
if (dominated_by_p (CDI_DOMINATORS, loop->latch, body[i]))
bitmap_set_bit (always_reached, i);
if (bitmap_bit_p (may_exit, i))
return;
}
}
/* Finds exits out of the LOOP with body BODY. Marks blocks in that we may
exit the loop by cfg edge to HAS_EXIT and MAY_EXIT. In MAY_EXIT
additionally mark blocks that may exit due to a call. */
static void
find_exits (struct loop *loop, basic_block *body,
bitmap may_exit, bitmap has_exit)
{
unsigned i;
edge_iterator ei;
edge e;
struct loop *outermost_exit = loop, *aexit;
bool has_call = false;
rtx insn;
for (i = 0; i < loop->num_nodes; i++)
{
if (body[i]->loop_father == loop)
{
FOR_BB_INSNS (body[i], insn)
{
if (CALL_P (insn)
&& (RTL_LOOPING_CONST_OR_PURE_CALL_P (insn)
|| !RTL_CONST_OR_PURE_CALL_P (insn)))
{
has_call = true;
bitmap_set_bit (may_exit, i);
break;
}
}
FOR_EACH_EDGE (e, ei, body[i]->succs)
{
if (flow_bb_inside_loop_p (loop, e->dest))
continue;
bitmap_set_bit (may_exit, i);
bitmap_set_bit (has_exit, i);
outermost_exit = find_common_loop (outermost_exit,
e->dest->loop_father);
}
continue;
}
/* Use the data stored for the subloop to decide whether we may exit
through it. It is sufficient to do this for header of the loop,
as other basic blocks inside it must be dominated by it. */
if (body[i]->loop_father->header != body[i])
continue;
if (LOOP_DATA (body[i]->loop_father)->has_call)
{
has_call = true;
bitmap_set_bit (may_exit, i);
}
aexit = LOOP_DATA (body[i]->loop_father)->outermost_exit;
if (aexit != loop)
{
bitmap_set_bit (may_exit, i);
bitmap_set_bit (has_exit, i);
if (flow_loop_nested_p (aexit, outermost_exit))
outermost_exit = aexit;
}
}
if (loop->aux == NULL)
{
loop->aux = xcalloc (1, sizeof (struct loop_data));
bitmap_initialize (&LOOP_DATA (loop)->regs_ref, ®_obstack);
bitmap_initialize (&LOOP_DATA (loop)->regs_live, ®_obstack);
}
LOOP_DATA (loop)->outermost_exit = outermost_exit;
LOOP_DATA (loop)->has_call = has_call;
}
/* Check whether we may assign a value to X from a register. */
static bool
may_assign_reg_p (rtx x)
{
return (GET_MODE (x) != VOIDmode
&& GET_MODE (x) != BLKmode
&& can_copy_p (GET_MODE (x))
&& (!REG_P (x)
|| !HARD_REGISTER_P (x)
|| REGNO_REG_CLASS (REGNO (x)) != NO_REGS));
}
/* Finds definitions that may correspond to invariants in LOOP with body
BODY. */
static void
find_defs (struct loop *loop, basic_block *body)
{
unsigned i;
bitmap blocks = BITMAP_ALLOC (NULL);
for (i = 0; i < loop->num_nodes; i++)
bitmap_set_bit (blocks, body[i]->index);
df_remove_problem (df_chain);
df_process_deferred_rescans ();
df_chain_add_problem (DF_UD_CHAIN);
df_set_blocks (blocks);
df_analyze ();
if (dump_file)
{
df_dump_region (dump_file);
fprintf (dump_file, "*****starting processing of loop ******\n");
print_rtl_with_bb (dump_file, get_insns ());
fprintf (dump_file, "*****ending processing of loop ******\n");
}
check_invariant_table_size ();
BITMAP_FREE (blocks);
}
/* Creates a new invariant for definition DEF in INSN, depending on invariants
in DEPENDS_ON. ALWAYS_EXECUTED is true if the insn is always executed,
unless the program ends due to a function call. The newly created invariant
is returned. */
static struct invariant *
create_new_invariant (struct def *def, rtx insn, bitmap depends_on,
bool always_executed)
{
struct invariant *inv = XNEW (struct invariant);
rtx set = single_set (insn);
bool speed = optimize_bb_for_speed_p (BLOCK_FOR_INSN (insn));
inv->def = def;
inv->always_executed = always_executed;
inv->depends_on = depends_on;
/* If the set is simple, usually by moving it we move the whole store out of
the loop. Otherwise we save only cost of the computation. */
if (def)
{
inv->cost = set_rtx_cost (set, speed);
/* ??? Try to determine cheapness of address computation. Unfortunately
the address cost is only a relative measure, we can't really compare
it with any absolute number, but only with other address costs.
But here we don't have any other addresses, so compare with a magic
number anyway. It has to be large enough to not regress PR33928
(by avoiding to move reg+8,reg+16,reg+24 invariants), but small
enough to not regress 410.bwaves either (by still moving reg+reg
invariants).
See http://gcc.gnu.org/ml/gcc-patches/2009-10/msg01210.html . */
inv->cheap_address = address_cost (SET_SRC (set), word_mode,
ADDR_SPACE_GENERIC, speed) < 3;
}
else
{
inv->cost = set_src_cost (SET_SRC (set), speed);
inv->cheap_address = false;
}
inv->move = false;
inv->reg = NULL_RTX;
inv->orig_regno = -1;
inv->stamp = 0;
inv->insn = insn;
inv->invno = VEC_length (invariant_p, invariants);
inv->eqto = ~0u;
if (def)
def->invno = inv->invno;
VEC_safe_push (invariant_p, heap, invariants, inv);
if (dump_file)
{
fprintf (dump_file,
"Set in insn %d is invariant (%d), cost %d, depends on ",
INSN_UID (insn), inv->invno, inv->cost);
dump_bitmap (dump_file, inv->depends_on);
}
return inv;
}
/* Record USE at DEF. */
static void
record_use (struct def *def, df_ref use)
{
struct use *u = XNEW (struct use);
u->pos = DF_REF_REAL_LOC (use);
u->insn = DF_REF_INSN (use);
u->addr_use_p = (DF_REF_TYPE (use) == DF_REF_REG_MEM_LOAD
|| DF_REF_TYPE (use) == DF_REF_REG_MEM_STORE);
u->next = def->uses;
def->uses = u;
def->n_uses++;
if (u->addr_use_p)
def->n_addr_uses++;
}
/* Finds the invariants USE depends on and store them to the DEPENDS_ON
bitmap. Returns true if all dependencies of USE are known to be
loop invariants, false otherwise. */
static bool
check_dependency (basic_block bb, df_ref use, bitmap depends_on)
{
df_ref def;
basic_block def_bb;
struct df_link *defs;
struct def *def_data;
struct invariant *inv;
if (DF_REF_FLAGS (use) & DF_REF_READ_WRITE)
return false;
defs = DF_REF_CHAIN (use);
if (!defs)
return true;
if (defs->next)
return false;
def = defs->ref;
check_invariant_table_size ();
inv = invariant_table[DF_REF_ID(def)];
if (!inv)
return false;
def_data = inv->def;
gcc_assert (def_data != NULL);
def_bb = DF_REF_BB (def);
/* Note that in case bb == def_bb, we know that the definition
dominates insn, because def has invariant_table[DF_REF_ID(def)]
defined and we process the insns in the basic block bb
sequentially. */
if (!dominated_by_p (CDI_DOMINATORS, bb, def_bb))
return false;
bitmap_set_bit (depends_on, def_data->invno);
return true;
}
/* Finds the invariants INSN depends on and store them to the DEPENDS_ON
bitmap. Returns true if all dependencies of INSN are known to be
loop invariants, false otherwise. */
static bool
check_dependencies (rtx insn, bitmap depends_on)
{
struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn);
df_ref *use_rec;
basic_block bb = BLOCK_FOR_INSN (insn);
for (use_rec = DF_INSN_INFO_USES (insn_info); *use_rec; use_rec++)
if (!check_dependency (bb, *use_rec, depends_on))
return false;
for (use_rec = DF_INSN_INFO_EQ_USES (insn_info); *use_rec; use_rec++)
if (!check_dependency (bb, *use_rec, depends_on))
return false;
return true;
}
/* Finds invariant in INSN. ALWAYS_REACHED is true if the insn is always
executed. ALWAYS_EXECUTED is true if the insn is always executed,
unless the program ends due to a function call. */
static void
find_invariant_insn (rtx insn, bool always_reached, bool always_executed)
{
df_ref ref;
struct def *def;
bitmap depends_on;
rtx set, dest;
bool simple = true;
struct invariant *inv;
#ifdef HAVE_cc0
/* We can't move a CC0 setter without the user. */
if (sets_cc0_p (insn))
return;
#endif
set = single_set (insn);
if (!set)
return;
dest = SET_DEST (set);
if (!REG_P (dest)
|| HARD_REGISTER_P (dest))
simple = false;
if (!may_assign_reg_p (SET_DEST (set))
|| !check_maybe_invariant (SET_SRC (set)))
return;
/* If the insn can throw exception, we cannot move it at all without changing
cfg. */
if (can_throw_internal (insn))
return;
/* We cannot make trapping insn executed, unless it was executed before. */
if (may_trap_or_fault_p (PATTERN (insn)) && !always_reached)
return;
depends_on = BITMAP_ALLOC (NULL);
if (!check_dependencies (insn, depends_on))
{
BITMAP_FREE (depends_on);
return;
}
if (simple)
def = XCNEW (struct def);
else
def = NULL;
inv = create_new_invariant (def, insn, depends_on, always_executed);
if (simple)
{
ref = df_find_def (insn, dest);
check_invariant_table_size ();
invariant_table[DF_REF_ID(ref)] = inv;
}
}
/* Record registers used in INSN that have a unique invariant definition. */
static void
record_uses (rtx insn)
{
struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn);
df_ref *use_rec;
struct invariant *inv;
for (use_rec = DF_INSN_INFO_USES (insn_info); *use_rec; use_rec++)
{
df_ref use = *use_rec;
inv = invariant_for_use (use);
if (inv)
record_use (inv->def, use);
}
for (use_rec = DF_INSN_INFO_EQ_USES (insn_info); *use_rec; use_rec++)
{
df_ref use = *use_rec;
inv = invariant_for_use (use);
if (inv)
record_use (inv->def, use);
}
}
/* Finds invariants in INSN. ALWAYS_REACHED is true if the insn is always
executed. ALWAYS_EXECUTED is true if the insn is always executed,
unless the program ends due to a function call. */
static void
find_invariants_insn (rtx insn, bool always_reached, bool always_executed)
{
find_invariant_insn (insn, always_reached, always_executed);
record_uses (insn);
}
/* Finds invariants in basic block BB. ALWAYS_REACHED is true if the
basic block is always executed. ALWAYS_EXECUTED is true if the basic
block is always executed, unless the program ends due to a function
call. */
static void
find_invariants_bb (basic_block bb, bool always_reached, bool always_executed)
{
rtx insn;
FOR_BB_INSNS (bb, insn)
{
if (!NONDEBUG_INSN_P (insn))
continue;
find_invariants_insn (insn, always_reached, always_executed);
if (always_reached
&& CALL_P (insn)
&& (RTL_LOOPING_CONST_OR_PURE_CALL_P (insn)
|| ! RTL_CONST_OR_PURE_CALL_P (insn)))
always_reached = false;
}
}
/* Finds invariants in LOOP with body BODY. ALWAYS_REACHED is the bitmap of
basic blocks in BODY that are always executed. ALWAYS_EXECUTED is the
bitmap of basic blocks in BODY that are always executed unless the program
ends due to a function call. */
static void
find_invariants_body (struct loop *loop, basic_block *body,
bitmap always_reached, bitmap always_executed)
{
unsigned i;
for (i = 0; i < loop->num_nodes; i++)
find_invariants_bb (body[i],
bitmap_bit_p (always_reached, i),
bitmap_bit_p (always_executed, i));
}
/* Finds invariants in LOOP. */
static void
find_invariants (struct loop *loop)
{
bitmap may_exit = BITMAP_ALLOC (NULL);
bitmap always_reached = BITMAP_ALLOC (NULL);
bitmap has_exit = BITMAP_ALLOC (NULL);
bitmap always_executed = BITMAP_ALLOC (NULL);
basic_block *body = get_loop_body_in_dom_order (loop);
find_exits (loop, body, may_exit, has_exit);
compute_always_reached (loop, body, may_exit, always_reached);
compute_always_reached (loop, body, has_exit, always_executed);
find_defs (loop, body);
find_invariants_body (loop, body, always_reached, always_executed);
merge_identical_invariants ();
BITMAP_FREE (always_reached);
BITMAP_FREE (always_executed);
BITMAP_FREE (may_exit);
BITMAP_FREE (has_exit);
free (body);
}
/* Frees a list of uses USE. */
static void
free_use_list (struct use *use)
{
struct use *next;
for (; use; use = next)
{
next = use->next;
free (use);
}
}
/* Return pressure class and number of hard registers (through *NREGS)
for destination of INSN. */
static enum reg_class
get_pressure_class_and_nregs (rtx insn, int *nregs)
{
rtx reg;
enum reg_class pressure_class;
rtx set = single_set (insn);
/* Considered invariant insns have only one set. */
gcc_assert (set != NULL_RTX);
reg = SET_DEST (set);
if (GET_CODE (reg) == SUBREG)
reg = SUBREG_REG (reg);
if (MEM_P (reg))
{
*nregs = 0;
pressure_class = NO_REGS;
}
else
{
if (! REG_P (reg))
reg = NULL_RTX;
if (reg == NULL_RTX)
pressure_class = GENERAL_REGS;
else
{
pressure_class = reg_allocno_class (REGNO (reg));
pressure_class = ira_pressure_class_translate[pressure_class];
}
*nregs
= ira_reg_class_max_nregs[pressure_class][GET_MODE (SET_SRC (set))];
}
return pressure_class;
}
/* Calculates cost and number of registers needed for moving invariant INV
out of the loop and stores them to *COST and *REGS_NEEDED. */
static void
get_inv_cost (struct invariant *inv, int *comp_cost, unsigned *regs_needed)
{
int i, acomp_cost;
unsigned aregs_needed[N_REG_CLASSES];
unsigned depno;
struct invariant *dep;
bitmap_iterator bi;
/* Find the representative of the class of the equivalent invariants. */
inv = VEC_index (invariant_p, invariants, inv->eqto);
*comp_cost = 0;
if (! flag_ira_loop_pressure)
regs_needed[0] = 0;
else
{
for (i = 0; i < ira_pressure_classes_num; i++)
regs_needed[ira_pressure_classes[i]] = 0;
}
if (inv->move
|| inv->stamp == actual_stamp)
return;
inv->stamp = actual_stamp;
if (! flag_ira_loop_pressure)
regs_needed[0]++;
else
{
int nregs;
enum reg_class pressure_class;
pressure_class = get_pressure_class_and_nregs (inv->insn, &nregs);
regs_needed[pressure_class] += nregs;
}
if (!inv->cheap_address
|| inv->def->n_addr_uses < inv->def->n_uses)
(*comp_cost) += inv->cost;
#ifdef STACK_REGS
{
/* Hoisting constant pool constants into stack regs may cost more than
just single register. On x87, the balance is affected both by the
small number of FP registers, and by its register stack organization,
that forces us to add compensation code in and around the loop to
shuffle the operands to the top of stack before use, and pop them
from the stack after the loop finishes.
To model this effect, we increase the number of registers needed for
stack registers by two: one register push, and one register pop.
This usually has the effect that FP constant loads from the constant
pool are not moved out of the loop.
Note that this also means that dependent invariants can not be moved.
However, the primary purpose of this pass is to move loop invariant
address arithmetic out of loops, and address arithmetic that depends
on floating point constants is unlikely to ever occur. */
rtx set = single_set (inv->insn);
if (set
&& IS_STACK_MODE (GET_MODE (SET_SRC (set)))
&& constant_pool_constant_p (SET_SRC (set)))
{
if (flag_ira_loop_pressure)
regs_needed[ira_stack_reg_pressure_class] += 2;
else
regs_needed[0] += 2;
}
}
#endif
EXECUTE_IF_SET_IN_BITMAP (inv->depends_on, 0, depno, bi)
{
bool check_p;
dep = VEC_index (invariant_p, invariants, depno);
get_inv_cost (dep, &acomp_cost, aregs_needed);
if (! flag_ira_loop_pressure)
check_p = aregs_needed[0] != 0;
else
{
for (i = 0; i < ira_pressure_classes_num; i++)
if (aregs_needed[ira_pressure_classes[i]] != 0)
break;
check_p = i < ira_pressure_classes_num;
}
if (check_p
/* We need to check always_executed, since if the original value of
the invariant may be preserved, we may need to keep it in a
separate register. TODO check whether the register has an
use outside of the loop. */
&& dep->always_executed
&& !dep->def->uses->next)
{
/* If this is a single use, after moving the dependency we will not
need a new register. */
if (! flag_ira_loop_pressure)
aregs_needed[0]--;
else
{
int nregs;
enum reg_class pressure_class;
pressure_class = get_pressure_class_and_nregs (inv->insn, &nregs);
aregs_needed[pressure_class] -= nregs;
}
}
if (! flag_ira_loop_pressure)
regs_needed[0] += aregs_needed[0];
else
{
for (i = 0; i < ira_pressure_classes_num; i++)
regs_needed[ira_pressure_classes[i]]
+= aregs_needed[ira_pressure_classes[i]];
}
(*comp_cost) += acomp_cost;
}
}
/* Calculates gain for eliminating invariant INV. REGS_USED is the number
of registers used in the loop, NEW_REGS is the number of new variables
already added due to the invariant motion. The number of registers needed
for it is stored in *REGS_NEEDED. SPEED and CALL_P are flags passed
through to estimate_reg_pressure_cost. */
static int
gain_for_invariant (struct invariant *inv, unsigned *regs_needed,
unsigned *new_regs, unsigned regs_used,
bool speed, bool call_p)
{
int comp_cost, size_cost;
actual_stamp++;
get_inv_cost (inv, &comp_cost, regs_needed);
if (! flag_ira_loop_pressure)
{
size_cost = (estimate_reg_pressure_cost (new_regs[0] + regs_needed[0],
regs_used, speed, call_p)
- estimate_reg_pressure_cost (new_regs[0],
regs_used, speed, call_p));
}
else
{
int i;
enum reg_class pressure_class;
for (i = 0; i < ira_pressure_classes_num; i++)
{
pressure_class = ira_pressure_classes[i];
if ((int) new_regs[pressure_class]
+ (int) regs_needed[pressure_class]
+ LOOP_DATA (curr_loop)->max_reg_pressure[pressure_class]
+ IRA_LOOP_RESERVED_REGS
> ira_class_hard_regs_num[pressure_class])
break;
}
if (i < ira_pressure_classes_num)
/* There will be register pressure excess and we want not to
make this loop invariant motion. All loop invariants with
non-positive gains will be rejected in function
find_invariants_to_move. Therefore we return the negative
number here.
One could think that this rejects also expensive loop
invariant motions and this will hurt code performance.
However numerous experiments with different heuristics
taking invariant cost into account did not confirm this
assumption. There are possible explanations for this
result:
o probably all expensive invariants were already moved out
of the loop by PRE and gimple invariant motion pass.
o expensive invariant execution will be hidden by insn
scheduling or OOO processor hardware because usually such
invariants have a lot of freedom to be executed
out-of-order.
Another reason for ignoring invariant cost vs spilling cost
heuristics is also in difficulties to evaluate accurately
spill cost at this stage. */
return -1;
else
size_cost = 0;
}
return comp_cost - size_cost;
}
/* Finds invariant with best gain for moving. Returns the gain, stores
the invariant in *BEST and number of registers needed for it to
*REGS_NEEDED. REGS_USED is the number of registers used in the loop.
NEW_REGS is the number of new variables already added due to invariant
motion. */
static int
best_gain_for_invariant (struct invariant **best, unsigned *regs_needed,
unsigned *new_regs, unsigned regs_used,
bool speed, bool call_p)
{
struct invariant *inv;
int i, gain = 0, again;
unsigned aregs_needed[N_REG_CLASSES], invno;
FOR_EACH_VEC_ELT (invariant_p, invariants, invno, inv)
{
if (inv->move)
continue;
/* Only consider the "representatives" of equivalent invariants. */
if (inv->eqto != inv->invno)
continue;
again = gain_for_invariant (inv, aregs_needed, new_regs, regs_used,
speed, call_p);
if (again > gain)
{
gain = again;
*best = inv;
if (! flag_ira_loop_pressure)
regs_needed[0] = aregs_needed[0];
else
{
for (i = 0; i < ira_pressure_classes_num; i++)
regs_needed[ira_pressure_classes[i]]
= aregs_needed[ira_pressure_classes[i]];
}
}
}
return gain;
}
/* Marks invariant INVNO and all its dependencies for moving. */
static void
set_move_mark (unsigned invno, int gain)
{
struct invariant *inv = VEC_index (invariant_p, invariants, invno);
bitmap_iterator bi;
/* Find the representative of the class of the equivalent invariants. */
inv = VEC_index (invariant_p, invariants, inv->eqto);
if (inv->move)
return;
inv->move = true;
if (dump_file)
{
if (gain >= 0)
fprintf (dump_file, "Decided to move invariant %d -- gain %d\n",
invno, gain);
else
fprintf (dump_file, "Decided to move dependent invariant %d\n",
invno);
};
EXECUTE_IF_SET_IN_BITMAP (inv->depends_on, 0, invno, bi)
{
set_move_mark (invno, -1);
}
}
/* Determines which invariants to move. */
static void
find_invariants_to_move (bool speed, bool call_p)
{
int gain;
unsigned i, regs_used, regs_needed[N_REG_CLASSES], new_regs[N_REG_CLASSES];
struct invariant *inv = NULL;
if (!VEC_length (invariant_p, invariants))
return;
if (flag_ira_loop_pressure)
/* REGS_USED is actually never used when the flag is on. */
regs_used = 0;
else
/* We do not really do a good job in estimating number of
registers used; we put some initial bound here to stand for
induction variables etc. that we do not detect. */
{
unsigned int n_regs = DF_REG_SIZE (df);
regs_used = 2;
for (i = 0; i < n_regs; i++)
{
if (!DF_REGNO_FIRST_DEF (i) && DF_REGNO_LAST_USE (i))
{
/* This is a value that is used but not changed inside loop. */
regs_used++;
}
}
}
if (! flag_ira_loop_pressure)
new_regs[0] = regs_needed[0] = 0;
else
{
for (i = 0; (int) i < ira_pressure_classes_num; i++)
new_regs[ira_pressure_classes[i]] = 0;
}
while ((gain = best_gain_for_invariant (&inv, regs_needed,
new_regs, regs_used,
speed, call_p)) > 0)
{
set_move_mark (inv->invno, gain);
if (! flag_ira_loop_pressure)
new_regs[0] += regs_needed[0];
else
{
for (i = 0; (int) i < ira_pressure_classes_num; i++)
new_regs[ira_pressure_classes[i]]
+= regs_needed[ira_pressure_classes[i]];
}
}
}
/* Replace the uses, reached by the definition of invariant INV, by REG.
IN_GROUP is nonzero if this is part of a group of changes that must be
performed as a group. In that case, the changes will be stored. The
function `apply_change_group' will validate and apply the changes. */
static int
replace_uses (struct invariant *inv, rtx reg, bool in_group)
{
/* Replace the uses we know to be dominated. It saves work for copy
propagation, and also it is necessary so that dependent invariants
are computed right. */
if (inv->def)
{
struct use *use;
for (use = inv->def->uses; use; use = use->next)
validate_change (use->insn, use->pos, reg, true);
/* If we aren't part of a larger group, apply the changes now. */
if (!in_group)
return apply_change_group ();
}
return 1;
}
/* Move invariant INVNO out of the LOOP. Returns true if this succeeds, false
otherwise. */
static bool
move_invariant_reg (struct loop *loop, unsigned invno)
{
struct invariant *inv = VEC_index (invariant_p, invariants, invno);
struct invariant *repr = VEC_index (invariant_p, invariants, inv->eqto);
unsigned i;
basic_block preheader = loop_preheader_edge (loop)->src;
rtx reg, set, dest, note;
bitmap_iterator bi;
int regno = -1;
if (inv->reg)
return true;
if (!repr->move)
return false;
/* If this is a representative of the class of equivalent invariants,
really move the invariant. Otherwise just replace its use with
the register used for the representative. */
if (inv == repr)
{
if (inv->depends_on)
{
EXECUTE_IF_SET_IN_BITMAP (inv->depends_on, 0, i, bi)
{
if (!move_invariant_reg (loop, i))
goto fail;
}
}
/* Move the set out of the loop. If the set is always executed (we could
omit this condition if we know that the register is unused outside of
the loop, but it does not seem worth finding out) and it has no uses
that would not be dominated by it, we may just move it (TODO).
Otherwise we need to create a temporary register. */
set = single_set (inv->insn);
reg = dest = SET_DEST (set);
if (GET_CODE (reg) == SUBREG)
reg = SUBREG_REG (reg);
if (REG_P (reg))
regno = REGNO (reg);
reg = gen_reg_rtx_and_attrs (dest);
/* Try replacing the destination by a new pseudoregister. */
validate_change (inv->insn, &SET_DEST (set), reg, true);
/* As well as all the dominated uses. */
replace_uses (inv, reg, true);
/* And validate all the changes. */
if (!apply_change_group ())
goto fail;
emit_insn_after (gen_move_insn (dest, reg), inv->insn);
reorder_insns (inv->insn, inv->insn, BB_END (preheader));
/* If there is a REG_EQUAL note on the insn we just moved, and the
insn is in a basic block that is not always executed or the note
contains something for which we don't know the invariant status,
the note may no longer be valid after we move the insn. Note that
uses in REG_EQUAL notes are taken into account in the computation
of invariants, so it is safe to retain the note even if it contains
register references for which we know the invariant status. */
if ((note = find_reg_note (inv->insn, REG_EQUAL, NULL_RTX))
&& (!inv->always_executed
|| !check_maybe_invariant (XEXP (note, 0))))
remove_note (inv->insn, note);
}
else
{
if (!move_invariant_reg (loop, repr->invno))
goto fail;
reg = repr->reg;
regno = repr->orig_regno;
if (!replace_uses (inv, reg, false))
goto fail;
set = single_set (inv->insn);
emit_insn_after (gen_move_insn (SET_DEST (set), reg), inv->insn);
delete_insn (inv->insn);
}
inv->reg = reg;
inv->orig_regno = regno;
return true;
fail:
/* If we failed, clear move flag, so that we do not try to move inv
again. */
if (dump_file)
fprintf (dump_file, "Failed to move invariant %d\n", invno);
inv->move = false;
inv->reg = NULL_RTX;
inv->orig_regno = -1;
return false;
}
/* Move selected invariant out of the LOOP. Newly created regs are marked
in TEMPORARY_REGS. */
static void
move_invariants (struct loop *loop)
{
struct invariant *inv;
unsigned i;
FOR_EACH_VEC_ELT (invariant_p, invariants, i, inv)
move_invariant_reg (loop, i);
if (flag_ira_loop_pressure && resize_reg_info ())
{
FOR_EACH_VEC_ELT (invariant_p, invariants, i, inv)
if (inv->reg != NULL_RTX)
{
if (inv->orig_regno >= 0)
setup_reg_classes (REGNO (inv->reg),
reg_preferred_class (inv->orig_regno),
reg_alternate_class (inv->orig_regno),
reg_allocno_class (inv->orig_regno));
else
setup_reg_classes (REGNO (inv->reg),
GENERAL_REGS, NO_REGS, GENERAL_REGS);
}
}
}
/* Initializes invariant motion data. */
static void
init_inv_motion_data (void)
{
actual_stamp = 1;
invariants = VEC_alloc (invariant_p, heap, 100);
}
/* Frees the data allocated by invariant motion. */
static void
free_inv_motion_data (void)
{
unsigned i;
struct def *def;
struct invariant *inv;
check_invariant_table_size ();
for (i = 0; i < DF_DEFS_TABLE_SIZE (); i++)
{
inv = invariant_table[i];
if (inv)
{
def = inv->def;
gcc_assert (def != NULL);
free_use_list (def->uses);
free (def);
invariant_table[i] = NULL;
}
}
FOR_EACH_VEC_ELT (invariant_p, invariants, i, inv)
{
BITMAP_FREE (inv->depends_on);
free (inv);
}
VEC_free (invariant_p, heap, invariants);
}
/* Move the invariants out of the LOOP. */
static void
move_single_loop_invariants (struct loop *loop)
{
init_inv_motion_data ();
find_invariants (loop);
find_invariants_to_move (optimize_loop_for_speed_p (loop),
LOOP_DATA (loop)->has_call);
move_invariants (loop);
free_inv_motion_data ();
}
/* Releases the auxiliary data for LOOP. */
static void
free_loop_data (struct loop *loop)
{
struct loop_data *data = LOOP_DATA (loop);
if (!data)
return;
bitmap_clear (&LOOP_DATA (loop)->regs_ref);
bitmap_clear (&LOOP_DATA (loop)->regs_live);
free (data);
loop->aux = NULL;
}
/* Registers currently living. */
static bitmap_head curr_regs_live;
/* Current reg pressure for each pressure class. */
static int curr_reg_pressure[N_REG_CLASSES];
/* Record all regs that are set in any one insn. Communication from
mark_reg_{store,clobber} and global_conflicts. Asm can refer to
all hard-registers. */
static rtx regs_set[(FIRST_PSEUDO_REGISTER > MAX_RECOG_OPERANDS
? FIRST_PSEUDO_REGISTER : MAX_RECOG_OPERANDS) * 2];
/* Number of regs stored in the previous array. */
static int n_regs_set;
/* Return pressure class and number of needed hard registers (through
*NREGS) of register REGNO. */
static enum reg_class
get_regno_pressure_class (int regno, int *nregs)
{
if (regno >= FIRST_PSEUDO_REGISTER)
{
enum reg_class pressure_class;
pressure_class = reg_allocno_class (regno);
pressure_class = ira_pressure_class_translate[pressure_class];
*nregs
= ira_reg_class_max_nregs[pressure_class][PSEUDO_REGNO_MODE (regno)];
return pressure_class;
}
else if (! TEST_HARD_REG_BIT (ira_no_alloc_regs, regno)
&& ! TEST_HARD_REG_BIT (eliminable_regset, regno))
{
*nregs = 1;
return ira_pressure_class_translate[REGNO_REG_CLASS (regno)];
}
else
{
*nregs = 0;
return NO_REGS;
}
}
/* Increase (if INCR_P) or decrease current register pressure for
register REGNO. */
static void
change_pressure (int regno, bool incr_p)
{
int nregs;
enum reg_class pressure_class;
pressure_class = get_regno_pressure_class (regno, &nregs);
if (! incr_p)
curr_reg_pressure[pressure_class] -= nregs;
else
{
curr_reg_pressure[pressure_class] += nregs;
if (LOOP_DATA (curr_loop)->max_reg_pressure[pressure_class]
< curr_reg_pressure[pressure_class])
LOOP_DATA (curr_loop)->max_reg_pressure[pressure_class]
= curr_reg_pressure[pressure_class];
}
}
/* Mark REGNO birth. */
static void
mark_regno_live (int regno)
{
struct loop *loop;
for (loop = curr_loop;
loop != current_loops->tree_root;
loop = loop_outer (loop))
bitmap_set_bit (&LOOP_DATA (loop)->regs_live, regno);
if (!bitmap_set_bit (&curr_regs_live, regno))
return;
change_pressure (regno, true);
}
/* Mark REGNO death. */
static void
mark_regno_death (int regno)
{
if (! bitmap_clear_bit (&curr_regs_live, regno))
return;
change_pressure (regno, false);
}
/* Mark setting register REG. */
static void
mark_reg_store (rtx reg, const_rtx setter ATTRIBUTE_UNUSED,
void *data ATTRIBUTE_UNUSED)
{
int regno;
if (GET_CODE (reg) == SUBREG)
reg = SUBREG_REG (reg);
if (! REG_P (reg))
return;
regs_set[n_regs_set++] = reg;
regno = REGNO (reg);
if (regno >= FIRST_PSEUDO_REGISTER)
mark_regno_live (regno);
else
{
int last = regno + hard_regno_nregs[regno][GET_MODE (reg)];
while (regno < last)
{
mark_regno_live (regno);
regno++;
}
}
}
/* Mark clobbering register REG. */
static void
mark_reg_clobber (rtx reg, const_rtx setter, void *data)
{
if (GET_CODE (setter) == CLOBBER)
mark_reg_store (reg, setter, data);
}
/* Mark register REG death. */
static void
mark_reg_death (rtx reg)
{
int regno = REGNO (reg);
if (regno >= FIRST_PSEUDO_REGISTER)
mark_regno_death (regno);
else
{
int last = regno + hard_regno_nregs[regno][GET_MODE (reg)];
while (regno < last)
{
mark_regno_death (regno);
regno++;
}
}
}
/* Mark occurrence of registers in X for the current loop. */
static void
mark_ref_regs (rtx x)
{
RTX_CODE code;
int i;
const char *fmt;
if (!x)
return;
code = GET_CODE (x);
if (code == REG)
{
struct loop *loop;
for (loop = curr_loop;
loop != current_loops->tree_root;
loop = loop_outer (loop))
bitmap_set_bit (&LOOP_DATA (loop)->regs_ref, REGNO (x));
return;
}
fmt = GET_RTX_FORMAT (code);
for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
if (fmt[i] == 'e')
mark_ref_regs (XEXP (x, i));
else if (fmt[i] == 'E')
{
int j;
for (j = 0; j < XVECLEN (x, i); j++)
mark_ref_regs (XVECEXP (x, i, j));
}
}
/* Calculate register pressure in the loops. */
static void
calculate_loop_reg_pressure (void)
{
int i;
unsigned int j;
bitmap_iterator bi;
basic_block bb;
rtx insn, link;
struct loop *loop, *parent;
loop_iterator li;
FOR_EACH_LOOP (li, loop, 0)
if (loop->aux == NULL)
{
loop->aux = xcalloc (1, sizeof (struct loop_data));
bitmap_initialize (&LOOP_DATA (loop)->regs_ref, ®_obstack);
bitmap_initialize (&LOOP_DATA (loop)->regs_live, ®_obstack);
}
ira_setup_eliminable_regset ();
bitmap_initialize (&curr_regs_live, ®_obstack);
FOR_EACH_BB (bb)
{
curr_loop = bb->loop_father;
if (curr_loop == current_loops->tree_root)
continue;
for (loop = curr_loop;
loop != current_loops->tree_root;
loop = loop_outer (loop))
bitmap_ior_into (&LOOP_DATA (loop)->regs_live, DF_LR_IN (bb));
bitmap_copy (&curr_regs_live, DF_LR_IN (bb));
for (i = 0; i < ira_pressure_classes_num; i++)
curr_reg_pressure[ira_pressure_classes[i]] = 0;
EXECUTE_IF_SET_IN_BITMAP (&curr_regs_live, 0, j, bi)
change_pressure (j, true);
FOR_BB_INSNS (bb, insn)
{
if (! NONDEBUG_INSN_P (insn))
continue;
mark_ref_regs (PATTERN (insn));
n_regs_set = 0;
note_stores (PATTERN (insn), mark_reg_clobber, NULL);
/* Mark any registers dead after INSN as dead now. */
for (link = REG_NOTES (insn); link; link = XEXP (link, 1))
if (REG_NOTE_KIND (link) == REG_DEAD)
mark_reg_death (XEXP (link, 0));
/* Mark any registers set in INSN as live,
and mark them as conflicting with all other live regs.
Clobbers are processed again, so they conflict with
the registers that are set. */
note_stores (PATTERN (insn), mark_reg_store, NULL);
#ifdef AUTO_INC_DEC
for (link = REG_NOTES (insn); link; link = XEXP (link, 1))
if (REG_NOTE_KIND (link) == REG_INC)
mark_reg_store (XEXP (link, 0), NULL_RTX, NULL);
#endif
while (n_regs_set-- > 0)
{
rtx note = find_regno_note (insn, REG_UNUSED,
REGNO (regs_set[n_regs_set]));
if (! note)
continue;
mark_reg_death (XEXP (note, 0));
}
}
}
bitmap_clear (&curr_regs_live);
if (flag_ira_region == IRA_REGION_MIXED
|| flag_ira_region == IRA_REGION_ALL)
FOR_EACH_LOOP (li, loop, 0)
{
EXECUTE_IF_SET_IN_BITMAP (&LOOP_DATA (loop)->regs_live, 0, j, bi)
if (! bitmap_bit_p (&LOOP_DATA (loop)->regs_ref, j))
{
enum reg_class pressure_class;
int nregs;
pressure_class = get_regno_pressure_class (j, &nregs);
LOOP_DATA (loop)->max_reg_pressure[pressure_class] -= nregs;
}
}
if (dump_file == NULL)
return;
FOR_EACH_LOOP (li, loop, 0)
{
parent = loop_outer (loop);
fprintf (dump_file, "\n Loop %d (parent %d, header bb%d, depth %d)\n",
loop->num, (parent == NULL ? -1 : parent->num),
loop->header->index, loop_depth (loop));
fprintf (dump_file, "\n ref. regnos:");
EXECUTE_IF_SET_IN_BITMAP (&LOOP_DATA (loop)->regs_ref, 0, j, bi)
fprintf (dump_file, " %d", j);
fprintf (dump_file, "\n live regnos:");
EXECUTE_IF_SET_IN_BITMAP (&LOOP_DATA (loop)->regs_live, 0, j, bi)
fprintf (dump_file, " %d", j);
fprintf (dump_file, "\n Pressure:");
for (i = 0; (int) i < ira_pressure_classes_num; i++)
{
enum reg_class pressure_class;
pressure_class = ira_pressure_classes[i];
if (LOOP_DATA (loop)->max_reg_pressure[pressure_class] == 0)
continue;
fprintf (dump_file, " %s=%d", reg_class_names[pressure_class],
LOOP_DATA (loop)->max_reg_pressure[pressure_class]);
}
fprintf (dump_file, "\n");
}
}
/* Move the invariants out of the loops. */
void
move_loop_invariants (void)
{
struct loop *loop;
loop_iterator li;
if (flag_ira_loop_pressure)
{
df_analyze ();
regstat_init_n_sets_and_refs ();
ira_set_pseudo_classes (dump_file);
calculate_loop_reg_pressure ();
regstat_free_n_sets_and_refs ();
}
df_set_flags (DF_EQ_NOTES + DF_DEFER_INSN_RESCAN);
/* Process the loops, innermost first. */
FOR_EACH_LOOP (li, loop, LI_FROM_INNERMOST)
{
curr_loop = loop;
/* move_single_loop_invariants for very large loops
is time consuming and might need a lot of memory. */
if (loop->num_nodes <= (unsigned) LOOP_INVARIANT_MAX_BBS_IN_LOOP)
move_single_loop_invariants (loop);
}
FOR_EACH_LOOP (li, loop, 0)
{
free_loop_data (loop);
}
if (flag_ira_loop_pressure)
/* There is no sense to keep this info because it was most
probably outdated by subsequent passes. */
free_reg_info ();
free (invariant_table);
invariant_table = NULL;
invariant_table_size = 0;
#ifdef ENABLE_CHECKING
verify_flow_info ();
#endif
}
|