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
|
/* RTL-level loop invariant motion.
Copyright (C) 2004, 2005, 2006 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 2, 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 COPYING. If not, write to the Free
Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA. */
/* This implements the loop invariant motion pass. It is very simple
(no calls, libcalls, etc.). This should be sufficient to cleanup things
like address arithmetics -- other more complicated invariants should be
eliminated on tree level 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 "rtl.h"
#include "tm_p.h"
#include "hard-reg-set.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"
/* 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. */
};
#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. */
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 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;
/* 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;
/* 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;
};
/* 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;
/* The dataflow object. */
static struct df *df = NULL;
/* 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 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))
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 (struct df_ref *use)
{
struct df_link *defs;
struct df_ref *def;
basic_block bb = BLOCK_FOR_INSN (use->insn), def_bb;
if (use->flags & DF_REF_READ_WRITE)
return NULL;
defs = DF_REF_CHAIN (use);
if (!defs || defs->next)
return NULL;
def = defs->ref;
if (!DF_REF_DATA (def))
return NULL;
def_bb = DF_REF_BB (def);
if (!dominated_by_p (CDI_DOMINATORS, bb, def_bb))
return NULL;
return DF_REF_DATA (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;
struct df_ref *use;
struct invariant *inv;
switch (code)
{
case CONST_INT:
case CONST_DOUBLE:
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 (df, 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;
struct 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 SYMBOL_REF:
case CONST:
case LABEL_REF:
return rtx_equal_p (e1, e2);
case REG:
use1 = df_find_use (df, insn1, e1);
use2 = df_find_use (df, 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 *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 *entry1 = e1;
const struct invariant_expr_entry *entry2 = 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 = *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 (i = 0; VEC_iterate (invariant_p, invariants, i, inv); i++)
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)
&& !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;
}
}
loop->aux = xcalloc (1, sizeof (struct loop_data));
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_set_blocks (df, blocks);
df_analyze (df);
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);
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 = rtx_cost (set, SET);
else
inv->cost = rtx_cost (SET_SRC (set), SET);
inv->move = false;
inv->reg = NULL_RTX;
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, rtx *use, rtx insn)
{
struct use *u = XNEW (struct use);
if (GET_CODE (*use) == SUBREG)
use = &SUBREG_REG (*use);
gcc_assert (REG_P (*use));
u->pos = use;
u->insn = insn;
u->next = def->uses;
def->uses = u;
def->n_uses++;
}
/* 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_link *defs;
struct df_ref *use, *def;
basic_block bb = BLOCK_FOR_INSN (insn), def_bb;
struct def *def_data;
struct invariant *inv;
for (use = DF_INSN_GET (df, insn)->uses; use; use = use->next_ref)
{
if (use->flags & DF_REF_READ_WRITE)
return false;
defs = DF_REF_CHAIN (use);
if (!defs)
continue;
if (defs->next)
return false;
def = defs->ref;
inv = DF_REF_DATA (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 DF_REF_DATA 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 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)
{
struct df_ref *ref;
struct def *def;
bitmap depends_on;
rtx set, dest;
bool simple = true;
struct invariant *inv;
/* Until we get rid of LIBCALLS. */
if (find_reg_note (insn, REG_RETVAL, NULL_RTX)
|| find_reg_note (insn, REG_LIBCALL, NULL_RTX)
|| find_reg_note (insn, REG_NO_CONFLICT, NULL_RTX))
return;
#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_after_code_motion_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 (df, insn, dest);
DF_REF_DATA (ref) = inv;
}
}
/* Record registers used in INSN that have a unique invariant definition. */
static void
record_uses (rtx insn)
{
struct df_ref *use;
struct invariant *inv;
for (use = DF_INSN_GET (df, insn)->uses; use; use = use->next_ref)
{
inv = invariant_for_use (use);
if (inv)
record_use (inv->def, DF_REF_LOC (use), DF_REF_INSN (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 (!INSN_P (insn))
continue;
find_invariants_insn (insn, always_reached, always_executed);
if (always_reached
&& CALL_P (insn)
&& !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);
}
}
/* 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 acomp_cost;
unsigned aregs_needed;
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;
*regs_needed = 0;
if (inv->move
|| inv->stamp == actual_stamp)
return;
inv->stamp = actual_stamp;
(*regs_needed)++;
(*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 organisation,
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)))
(*regs_needed) += 2;
}
#endif
EXECUTE_IF_SET_IN_BITMAP (inv->depends_on, 0, depno, bi)
{
dep = VEC_index (invariant_p, invariants, depno);
get_inv_cost (dep, &acomp_cost, &aregs_needed);
if (aregs_needed
/* 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. */
aregs_needed--;
}
(*regs_needed) += aregs_needed;
(*comp_cost) += acomp_cost;
}
}
/* Calculates gain for eliminating invariant INV. REGS_USED is the number
of registers used in the loop, N_INV_USES is the number of uses of
invariants, 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. */
static int
gain_for_invariant (struct invariant *inv, unsigned *regs_needed,
unsigned new_regs, unsigned regs_used, unsigned n_inv_uses)
{
int comp_cost, size_cost;
get_inv_cost (inv, &comp_cost, regs_needed);
actual_stamp++;
size_cost = (global_cost_for_size (new_regs + *regs_needed,
regs_used, n_inv_uses)
- global_cost_for_size (new_regs, regs_used, n_inv_uses));
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, N_INV_USES is the number of uses of invariants. 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,
unsigned n_inv_uses)
{
struct invariant *inv;
int gain = 0, again;
unsigned aregs_needed, invno;
for (invno = 0; VEC_iterate (invariant_p, invariants, invno, inv); invno++)
{
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, n_inv_uses);
if (again > gain)
{
gain = again;
*best = inv;
*regs_needed = aregs_needed;
}
}
return gain;
}
/* Marks invariant INVNO and all its dependencies for moving. */
static void
set_move_mark (unsigned invno)
{
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)
fprintf (dump_file, "Decided to move invariant %d\n", invno);
EXECUTE_IF_SET_IN_BITMAP (inv->depends_on, 0, invno, bi)
{
set_move_mark (invno);
}
}
/* Determines which invariants to move. */
static void
find_invariants_to_move (void)
{
unsigned i, regs_used, n_inv_uses, regs_needed = 0, new_regs;
struct invariant *inv = NULL;
unsigned int n_regs = DF_REG_SIZE (df);
if (!VEC_length (invariant_p, invariants))
return;
/* Now something slightly more involved. First estimate the number of used
registers. */
n_inv_uses = 0;
/* We do not really do a good job in this estimation; put some initial bound
here to stand for induction variables etc. that we do not detect. */
regs_used = 2;
for (i = 0; i < n_regs; i++)
{
if (!DF_REGNO_FIRST_DEF (df, i) && DF_REGNO_LAST_USE (df, i))
{
/* This is a value that is used but not changed inside loop. */
regs_used++;
}
}
for (i = 0; VEC_iterate (invariant_p, invariants, i, inv); i++)
{
if (inv->def)
n_inv_uses += inv->def->n_uses;
}
new_regs = 0;
while (best_gain_for_invariant (&inv, ®s_needed,
new_regs, regs_used, n_inv_uses) > 0)
{
set_move_mark (inv->invno);
new_regs += regs_needed;
}
}
/* Move invariant INVNO out of the LOOP. */
static void
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, seq, op;
struct use *use;
bitmap_iterator bi;
if (inv->reg
|| !repr->move)
return;
/* 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)
{
move_invariant_reg (loop, i);
}
}
/* 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 = gen_reg_rtx (GET_MODE (SET_DEST (set)));
emit_insn_after (gen_move_insn (SET_DEST (set), reg), inv->insn);
/* If the SET_DEST of the invariant insn is a reg, we can just move
the insn out of the loop. Otherwise, we have to use gen_move_insn
to let emit_move_insn produce a valid instruction stream. */
if (REG_P (SET_DEST (set)))
{
SET_DEST (set) = reg;
reorder_insns (inv->insn, inv->insn, BB_END (preheader));
}
else
{
start_sequence ();
op = force_operand (SET_SRC (set), reg);
if (op != reg)
emit_move_insn (reg, op);
seq = get_insns ();
end_sequence ();
emit_insn_after (seq, BB_END (preheader));
delete_insn (inv->insn);
}
}
else
{
move_invariant_reg (loop, repr->invno);
reg = repr->reg;
set = single_set (inv->insn);
emit_insn_after (gen_move_insn (SET_DEST (set), reg), inv->insn);
delete_insn (inv->insn);
}
inv->reg = reg;
/* 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)
{
for (use = inv->def->uses; use; use = use->next)
*use->pos = reg;
}
}
/* 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 (i = 0; VEC_iterate (invariant_p, invariants, i, inv); i++)
move_invariant_reg (loop, i);
}
/* 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;
for (i = 0; i < DF_DEFS_SIZE (df); i++)
{
struct df_ref * ref = DF_DEFS_GET (df, i);
if (!ref)
continue;
inv = DF_REF_DATA (ref);
if (!inv)
continue;
def = inv->def;
gcc_assert (def != NULL);
free_use_list (def->uses);
free (def);
DF_REF_DATA (ref) = NULL;
}
for (i = 0; VEC_iterate (invariant_p, invariants, i, inv); i++)
{
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 ();
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);
free (data);
loop->aux = NULL;
}
/* Move the invariants out of the LOOPS. */
void
move_loop_invariants (struct loops *loops)
{
struct loop *loop;
unsigned i;
df = df_init (DF_HARD_REGS | DF_EQUIV_NOTES);
df_chain_add_problem (df, DF_UD_CHAIN);
/* Process the loops, innermost first. */
loop = loops->tree_root;
while (loop->inner)
loop = loop->inner;
while (loop != loops->tree_root)
{
move_single_loop_invariants (loop);
if (loop->next)
{
loop = loop->next;
while (loop->inner)
loop = loop->inner;
}
else
loop = loop->outer;
}
for (i = 1; i < loops->num; i++)
if (loops->parray[i])
free_loop_data (loops->parray[i]);
df_finish (df);
df = NULL;
#ifdef ENABLE_CHECKING
verify_flow_info ();
#endif
}
|