forked from illumos/gcc
-
Notifications
You must be signed in to change notification settings - Fork 1
/
bt-load.c
1573 lines (1396 loc) · 47.9 KB
/
bt-load.c
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
/* Perform branch target register load optimizations.
Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
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/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "rtl.h"
#include "hard-reg-set.h"
#include "regs.h"
#include "fibheap.h"
#include "output.h"
#include "target.h"
#include "expr.h"
#include "flags.h"
#include "insn-attr.h"
#include "function.h"
#include "except.h"
#include "tm_p.h"
#include "toplev.h"
#include "tree-pass.h"
#include "recog.h"
#include "df.h"
/* Target register optimizations - these are performed after reload. */
typedef struct btr_def_group_s
{
struct btr_def_group_s *next;
rtx src;
struct btr_def_s *members;
} *btr_def_group;
typedef struct btr_user_s
{
struct btr_user_s *next;
basic_block bb;
int luid;
rtx insn;
/* If INSN has a single use of a single branch register, then
USE points to it within INSN. If there is more than
one branch register use, or the use is in some way ambiguous,
then USE is NULL. */
rtx use;
int n_reaching_defs;
int first_reaching_def;
char other_use_this_block;
} *btr_user;
/* btr_def structs appear on three lists:
1. A list of all btr_def structures (head is
ALL_BTR_DEFS, linked by the NEXT field).
2. A list of branch reg definitions per basic block (head is
BB_BTR_DEFS[i], linked by the NEXT_THIS_BB field).
3. A list of all branch reg definitions belonging to the same
group (head is in a BTR_DEF_GROUP struct, linked by
NEXT_THIS_GROUP field). */
typedef struct btr_def_s
{
struct btr_def_s *next_this_bb;
struct btr_def_s *next_this_group;
basic_block bb;
int luid;
rtx insn;
int btr;
int cost;
/* For a branch register setting insn that has a constant
source (i.e. a label), group links together all the
insns with the same source. For other branch register
setting insns, group is NULL. */
btr_def_group group;
btr_user uses;
/* If this def has a reaching use which is not a simple use
in a branch instruction, then has_ambiguous_use will be true,
and we will not attempt to migrate this definition. */
char has_ambiguous_use;
/* live_range is an approximation to the true live range for this
def/use web, because it records the set of blocks that contain
the live range. There could be other live ranges for the same
branch register in that set of blocks, either in the block
containing the def (before the def), or in a block containing
a use (after the use). If there are such other live ranges, then
other_btr_uses_before_def or other_btr_uses_after_use must be set true
as appropriate. */
char other_btr_uses_before_def;
char other_btr_uses_after_use;
/* We set own_end when we have moved a definition into a dominator.
Thus, when a later combination removes this definition again, we know
to clear out trs_live_at_end again. */
char own_end;
bitmap live_range;
} *btr_def;
static int issue_rate;
static int basic_block_freq (const_basic_block);
static int insn_sets_btr_p (const_rtx, int, int *);
static rtx *find_btr_use (rtx);
static int btr_referenced_p (rtx, rtx *);
static int find_btr_reference (rtx *, void *);
static void find_btr_def_group (btr_def_group *, btr_def);
static btr_def add_btr_def (fibheap_t, basic_block, int, rtx,
unsigned int, int, btr_def_group *);
static btr_user new_btr_user (basic_block, int, rtx);
static void dump_hard_reg_set (HARD_REG_SET);
static void dump_btrs_live (int);
static void note_other_use_this_block (unsigned int, btr_user);
static void compute_defs_uses_and_gen (fibheap_t, btr_def *,btr_user *,
sbitmap *, sbitmap *, HARD_REG_SET *);
static void compute_kill (sbitmap *, sbitmap *, HARD_REG_SET *);
static void compute_out (sbitmap *bb_out, sbitmap *, sbitmap *, int);
static void link_btr_uses (btr_def *, btr_user *, sbitmap *, sbitmap *, int);
static void build_btr_def_use_webs (fibheap_t);
static int block_at_edge_of_live_range_p (int, btr_def);
static void clear_btr_from_live_range (btr_def def);
static void add_btr_to_live_range (btr_def, int);
static void augment_live_range (bitmap, HARD_REG_SET *, basic_block,
basic_block, int);
static int choose_btr (HARD_REG_SET);
static void combine_btr_defs (btr_def, HARD_REG_SET *);
static void btr_def_live_range (btr_def, HARD_REG_SET *);
static void move_btr_def (basic_block, int, btr_def, bitmap, HARD_REG_SET *);
static int migrate_btr_def (btr_def, int);
static void migrate_btr_defs (enum reg_class, int);
static int can_move_up (const_basic_block, const_rtx, int);
static void note_btr_set (rtx, const_rtx, void *);
/* The following code performs code motion of target load instructions
(instructions that set branch target registers), to move them
forward away from the branch instructions and out of loops (or,
more generally, from a more frequently executed place to a less
frequently executed place).
Moving target load instructions further in front of the branch
instruction that uses the target register value means that the hardware
has a better chance of preloading the instructions at the branch
target by the time the branch is reached. This avoids bubbles
when a taken branch needs to flush out the pipeline.
Moving target load instructions out of loops means they are executed
less frequently. */
/* An obstack to hold the def-use web data structures built up for
migrating branch target load instructions. */
static struct obstack migrate_btrl_obstack;
/* Array indexed by basic block number, giving the set of registers
live in that block. */
static HARD_REG_SET *btrs_live;
/* Array indexed by basic block number, giving the set of registers live at
the end of that block, including any uses by a final jump insn, if any. */
static HARD_REG_SET *btrs_live_at_end;
/* Set of all target registers that we are willing to allocate. */
static HARD_REG_SET all_btrs;
/* Provide lower and upper bounds for target register numbers, so that
we don't need to search through all the hard registers all the time. */
static int first_btr, last_btr;
/* Return an estimate of the frequency of execution of block bb. */
static int
basic_block_freq (const_basic_block bb)
{
return bb->frequency;
}
static rtx *btr_reference_found;
/* A subroutine of btr_referenced_p, called through for_each_rtx.
PREG is a pointer to an rtx that is to be excluded from the
traversal. If we find a reference to a target register anywhere
else, return 1, and put a pointer to it into btr_reference_found. */
static int
find_btr_reference (rtx *px, void *preg)
{
rtx x;
if (px == preg)
return -1;
x = *px;
if (!REG_P (x))
return 0;
if (overlaps_hard_reg_set_p (all_btrs, GET_MODE (x), REGNO (x)))
{
btr_reference_found = px;
return 1;
}
return -1;
}
/* Return nonzero if X references (sets or reads) any branch target register.
If EXCLUDEP is set, disregard any references within the rtx pointed to
by it. If returning nonzero, also set btr_reference_found as above. */
static int
btr_referenced_p (rtx x, rtx *excludep)
{
return for_each_rtx (&x, find_btr_reference, excludep);
}
/* Return true if insn is an instruction that sets a target register.
if CHECK_CONST is true, only return true if the source is constant.
If such a set is found and REGNO is nonzero, assign the register number
of the destination register to *REGNO. */
static int
insn_sets_btr_p (const_rtx insn, int check_const, int *regno)
{
rtx set;
if (NONJUMP_INSN_P (insn)
&& (set = single_set (insn)))
{
rtx dest = SET_DEST (set);
rtx src = SET_SRC (set);
if (GET_CODE (dest) == SUBREG)
dest = XEXP (dest, 0);
if (REG_P (dest)
&& TEST_HARD_REG_BIT (all_btrs, REGNO (dest)))
{
gcc_assert (!btr_referenced_p (src, NULL));
if (!check_const || CONSTANT_P (src))
{
if (regno)
*regno = REGNO (dest);
return 1;
}
}
}
return 0;
}
/* Find and return a use of a target register within an instruction INSN. */
static rtx *
find_btr_use (rtx insn)
{
return btr_referenced_p (insn, NULL) ? btr_reference_found : NULL;
}
/* Find the group that the target register definition DEF belongs
to in the list starting with *ALL_BTR_DEF_GROUPS. If no such
group exists, create one. Add def to the group. */
static void
find_btr_def_group (btr_def_group *all_btr_def_groups, btr_def def)
{
if (insn_sets_btr_p (def->insn, 1, NULL))
{
btr_def_group this_group;
rtx def_src = SET_SRC (single_set (def->insn));
/* ?? This linear search is an efficiency concern, particularly
as the search will almost always fail to find a match. */
for (this_group = *all_btr_def_groups;
this_group != NULL;
this_group = this_group->next)
if (rtx_equal_p (def_src, this_group->src))
break;
if (!this_group)
{
this_group = obstack_alloc (&migrate_btrl_obstack,
sizeof (struct btr_def_group_s));
this_group->src = def_src;
this_group->members = NULL;
this_group->next = *all_btr_def_groups;
*all_btr_def_groups = this_group;
}
def->group = this_group;
def->next_this_group = this_group->members;
this_group->members = def;
}
else
def->group = NULL;
}
/* Create a new target register definition structure, for a definition in
block BB, instruction INSN, and insert it into ALL_BTR_DEFS. Return
the new definition. */
static btr_def
add_btr_def (fibheap_t all_btr_defs, basic_block bb, int insn_luid, rtx insn,
unsigned int dest_reg, int other_btr_uses_before_def,
btr_def_group *all_btr_def_groups)
{
btr_def this
= obstack_alloc (&migrate_btrl_obstack, sizeof (struct btr_def_s));
this->bb = bb;
this->luid = insn_luid;
this->insn = insn;
this->btr = dest_reg;
this->cost = basic_block_freq (bb);
this->has_ambiguous_use = 0;
this->other_btr_uses_before_def = other_btr_uses_before_def;
this->other_btr_uses_after_use = 0;
this->next_this_bb = NULL;
this->next_this_group = NULL;
this->uses = NULL;
this->live_range = NULL;
find_btr_def_group (all_btr_def_groups, this);
fibheap_insert (all_btr_defs, -this->cost, this);
if (dump_file)
fprintf (dump_file,
"Found target reg definition: sets %u { bb %d, insn %d }%s priority %d\n",
dest_reg, bb->index, INSN_UID (insn), (this->group ? "" : ":not const"),
this->cost);
return this;
}
/* Create a new target register user structure, for a use in block BB,
instruction INSN. Return the new user. */
static btr_user
new_btr_user (basic_block bb, int insn_luid, rtx insn)
{
/* This instruction reads target registers. We need
to decide whether we can replace all target register
uses easily.
*/
rtx *usep = find_btr_use (PATTERN (insn));
rtx use;
btr_user user = NULL;
if (usep)
{
int unambiguous_single_use;
/* We want to ensure that USE is the only use of a target
register in INSN, so that we know that to rewrite INSN to use
a different target register, all we have to do is replace USE. */
unambiguous_single_use = !btr_referenced_p (PATTERN (insn), usep);
if (!unambiguous_single_use)
usep = NULL;
}
use = usep ? *usep : NULL_RTX;
user = obstack_alloc (&migrate_btrl_obstack, sizeof (struct btr_user_s));
user->bb = bb;
user->luid = insn_luid;
user->insn = insn;
user->use = use;
user->other_use_this_block = 0;
user->next = NULL;
user->n_reaching_defs = 0;
user->first_reaching_def = -1;
if (dump_file)
{
fprintf (dump_file, "Uses target reg: { bb %d, insn %d }",
bb->index, INSN_UID (insn));
if (user->use)
fprintf (dump_file, ": unambiguous use of reg %d\n",
REGNO (user->use));
}
return user;
}
/* Write the contents of S to the dump file. */
static void
dump_hard_reg_set (HARD_REG_SET s)
{
int reg;
for (reg = 0; reg < FIRST_PSEUDO_REGISTER; reg++)
if (TEST_HARD_REG_BIT (s, reg))
fprintf (dump_file, " %d", reg);
}
/* Write the set of target regs live in block BB to the dump file. */
static void
dump_btrs_live (int bb)
{
fprintf (dump_file, "BB%d live:", bb);
dump_hard_reg_set (btrs_live[bb]);
fprintf (dump_file, "\n");
}
/* REGNO is the number of a branch target register that is being used or
set. USERS_THIS_BB is a list of preceding branch target register users;
If any of them use the same register, set their other_use_this_block
flag. */
static void
note_other_use_this_block (unsigned int regno, btr_user users_this_bb)
{
btr_user user;
for (user = users_this_bb; user != NULL; user = user->next)
if (user->use && REGNO (user->use) == regno)
user->other_use_this_block = 1;
}
typedef struct {
btr_user users_this_bb;
HARD_REG_SET btrs_written_in_block;
HARD_REG_SET btrs_live_in_block;
sbitmap bb_gen;
sbitmap *btr_defset;
} defs_uses_info;
/* Called via note_stores or directly to register stores into /
clobbers of a branch target register DEST that are not recognized as
straightforward definitions. DATA points to information about the
current basic block that needs updating. */
static void
note_btr_set (rtx dest, const_rtx set ATTRIBUTE_UNUSED, void *data)
{
defs_uses_info *info = data;
int regno, end_regno;
if (!REG_P (dest))
return;
regno = REGNO (dest);
end_regno = END_HARD_REGNO (dest);
for (; regno < end_regno; regno++)
if (TEST_HARD_REG_BIT (all_btrs, regno))
{
note_other_use_this_block (regno, info->users_this_bb);
SET_HARD_REG_BIT (info->btrs_written_in_block, regno);
SET_HARD_REG_BIT (info->btrs_live_in_block, regno);
sbitmap_difference (info->bb_gen, info->bb_gen,
info->btr_defset[regno - first_btr]);
}
}
static void
compute_defs_uses_and_gen (fibheap_t all_btr_defs, btr_def *def_array,
btr_user *use_array, sbitmap *btr_defset,
sbitmap *bb_gen, HARD_REG_SET *btrs_written)
{
/* Scan the code building up the set of all defs and all uses.
For each target register, build the set of defs of that register.
For each block, calculate the set of target registers
written in that block.
Also calculate the set of btrs ever live in that block.
*/
int i;
int insn_luid = 0;
btr_def_group all_btr_def_groups = NULL;
defs_uses_info info;
sbitmap_vector_zero (bb_gen, n_basic_blocks);
for (i = NUM_FIXED_BLOCKS; i < n_basic_blocks; i++)
{
basic_block bb = BASIC_BLOCK (i);
int reg;
btr_def defs_this_bb = NULL;
rtx insn;
rtx last;
int can_throw = 0;
info.users_this_bb = NULL;
info.bb_gen = bb_gen[i];
info.btr_defset = btr_defset;
CLEAR_HARD_REG_SET (info.btrs_live_in_block);
CLEAR_HARD_REG_SET (info.btrs_written_in_block);
for (reg = first_btr; reg <= last_btr; reg++)
if (TEST_HARD_REG_BIT (all_btrs, reg)
&& REGNO_REG_SET_P (df_get_live_in (bb), reg))
SET_HARD_REG_BIT (info.btrs_live_in_block, reg);
for (insn = BB_HEAD (bb), last = NEXT_INSN (BB_END (bb));
insn != last;
insn = NEXT_INSN (insn), insn_luid++)
{
if (INSN_P (insn))
{
int regno;
int insn_uid = INSN_UID (insn);
if (insn_sets_btr_p (insn, 0, ®no))
{
btr_def def = add_btr_def (
all_btr_defs, bb, insn_luid, insn, regno,
TEST_HARD_REG_BIT (info.btrs_live_in_block, regno),
&all_btr_def_groups);
def_array[insn_uid] = def;
SET_HARD_REG_BIT (info.btrs_written_in_block, regno);
SET_HARD_REG_BIT (info.btrs_live_in_block, regno);
sbitmap_difference (bb_gen[i], bb_gen[i],
btr_defset[regno - first_btr]);
SET_BIT (bb_gen[i], insn_uid);
def->next_this_bb = defs_this_bb;
defs_this_bb = def;
SET_BIT (btr_defset[regno - first_btr], insn_uid);
note_other_use_this_block (regno, info.users_this_bb);
}
/* Check for the blockage emitted by expand_nl_goto_receiver. */
else if (current_function_has_nonlocal_label
&& GET_CODE (PATTERN (insn)) == UNSPEC_VOLATILE)
{
btr_user user;
/* Do the equivalent of calling note_other_use_this_block
for every target register. */
for (user = info.users_this_bb; user != NULL;
user = user->next)
if (user->use)
user->other_use_this_block = 1;
IOR_HARD_REG_SET (info.btrs_written_in_block, all_btrs);
IOR_HARD_REG_SET (info.btrs_live_in_block, all_btrs);
sbitmap_zero (info.bb_gen);
}
else
{
if (btr_referenced_p (PATTERN (insn), NULL))
{
btr_user user = new_btr_user (bb, insn_luid, insn);
use_array[insn_uid] = user;
if (user->use)
SET_HARD_REG_BIT (info.btrs_live_in_block,
REGNO (user->use));
else
{
int reg;
for (reg = first_btr; reg <= last_btr; reg++)
if (TEST_HARD_REG_BIT (all_btrs, reg)
&& refers_to_regno_p (reg, reg + 1, user->insn,
NULL))
{
note_other_use_this_block (reg,
info.users_this_bb);
SET_HARD_REG_BIT (info.btrs_live_in_block, reg);
}
note_stores (PATTERN (insn), note_btr_set, &info);
}
user->next = info.users_this_bb;
info.users_this_bb = user;
}
if (CALL_P (insn))
{
HARD_REG_SET *clobbered = &call_used_reg_set;
HARD_REG_SET call_saved;
rtx pat = PATTERN (insn);
int i;
/* Check for sibcall. */
if (GET_CODE (pat) == PARALLEL)
for (i = XVECLEN (pat, 0) - 1; i >= 0; i--)
if (GET_CODE (XVECEXP (pat, 0, i)) == RETURN)
{
COMPL_HARD_REG_SET (call_saved,
call_used_reg_set);
clobbered = &call_saved;
}
for (regno = first_btr; regno <= last_btr; regno++)
if (TEST_HARD_REG_BIT (*clobbered, regno))
note_btr_set (regno_reg_rtx[regno], NULL_RTX, &info);
}
}
}
}
COPY_HARD_REG_SET (btrs_live[i], info.btrs_live_in_block);
COPY_HARD_REG_SET (btrs_written[i], info.btrs_written_in_block);
REG_SET_TO_HARD_REG_SET (btrs_live_at_end[i], df_get_live_out (bb));
/* If this block ends in a jump insn, add any uses or even clobbers
of branch target registers that it might have. */
for (insn = BB_END (bb); insn != BB_HEAD (bb) && ! INSN_P (insn); )
insn = PREV_INSN (insn);
/* ??? for the fall-through edge, it would make sense to insert the
btr set on the edge, but that would require to split the block
early on so that we can distinguish between dominance from the fall
through edge - which can use the call-clobbered registers - from
dominance by the throw edge. */
if (can_throw_internal (insn))
{
HARD_REG_SET tmp;
COPY_HARD_REG_SET (tmp, call_used_reg_set);
AND_HARD_REG_SET (tmp, all_btrs);
IOR_HARD_REG_SET (btrs_live_at_end[i], tmp);
can_throw = 1;
}
if (can_throw || JUMP_P (insn))
{
int regno;
for (regno = first_btr; regno <= last_btr; regno++)
if (refers_to_regno_p (regno, regno+1, insn, NULL))
SET_HARD_REG_BIT (btrs_live_at_end[i], regno);
}
if (dump_file)
dump_btrs_live(i);
}
}
static void
compute_kill (sbitmap *bb_kill, sbitmap *btr_defset,
HARD_REG_SET *btrs_written)
{
int i;
int regno;
/* For each basic block, form the set BB_KILL - the set
of definitions that the block kills. */
sbitmap_vector_zero (bb_kill, n_basic_blocks);
for (i = NUM_FIXED_BLOCKS; i < n_basic_blocks; i++)
{
for (regno = first_btr; regno <= last_btr; regno++)
if (TEST_HARD_REG_BIT (all_btrs, regno)
&& TEST_HARD_REG_BIT (btrs_written[i], regno))
sbitmap_a_or_b (bb_kill[i], bb_kill[i],
btr_defset[regno - first_btr]);
}
}
static void
compute_out (sbitmap *bb_out, sbitmap *bb_gen, sbitmap *bb_kill, int max_uid)
{
/* Perform iterative dataflow:
Initially, for all blocks, BB_OUT = BB_GEN.
For each block,
BB_IN = union over predecessors of BB_OUT(pred)
BB_OUT = (BB_IN - BB_KILL) + BB_GEN
Iterate until the bb_out sets stop growing. */
int i;
int changed;
sbitmap bb_in = sbitmap_alloc (max_uid);
for (i = NUM_FIXED_BLOCKS; i < n_basic_blocks; i++)
sbitmap_copy (bb_out[i], bb_gen[i]);
changed = 1;
while (changed)
{
changed = 0;
for (i = NUM_FIXED_BLOCKS; i < n_basic_blocks; i++)
{
sbitmap_union_of_preds (bb_in, bb_out, i);
changed |= sbitmap_union_of_diff_cg (bb_out[i], bb_gen[i],
bb_in, bb_kill[i]);
}
}
sbitmap_free (bb_in);
}
static void
link_btr_uses (btr_def *def_array, btr_user *use_array, sbitmap *bb_out,
sbitmap *btr_defset, int max_uid)
{
int i;
sbitmap reaching_defs = sbitmap_alloc (max_uid);
/* Link uses to the uses lists of all of their reaching defs.
Count up the number of reaching defs of each use. */
for (i = NUM_FIXED_BLOCKS; i < n_basic_blocks; i++)
{
basic_block bb = BASIC_BLOCK (i);
rtx insn;
rtx last;
sbitmap_union_of_preds (reaching_defs, bb_out, i);
for (insn = BB_HEAD (bb), last = NEXT_INSN (BB_END (bb));
insn != last;
insn = NEXT_INSN (insn))
{
if (INSN_P (insn))
{
int insn_uid = INSN_UID (insn);
btr_def def = def_array[insn_uid];
btr_user user = use_array[insn_uid];
if (def != NULL)
{
/* Remove all reaching defs of regno except
for this one. */
sbitmap_difference (reaching_defs, reaching_defs,
btr_defset[def->btr - first_btr]);
SET_BIT(reaching_defs, insn_uid);
}
if (user != NULL)
{
/* Find all the reaching defs for this use. */
sbitmap reaching_defs_of_reg = sbitmap_alloc(max_uid);
unsigned int uid = 0;
sbitmap_iterator sbi;
if (user->use)
sbitmap_a_and_b (
reaching_defs_of_reg,
reaching_defs,
btr_defset[REGNO (user->use) - first_btr]);
else
{
int reg;
sbitmap_zero (reaching_defs_of_reg);
for (reg = first_btr; reg <= last_btr; reg++)
if (TEST_HARD_REG_BIT (all_btrs, reg)
&& refers_to_regno_p (reg, reg + 1, user->insn,
NULL))
sbitmap_a_or_b_and_c (reaching_defs_of_reg,
reaching_defs_of_reg,
reaching_defs,
btr_defset[reg - first_btr]);
}
EXECUTE_IF_SET_IN_SBITMAP (reaching_defs_of_reg, 0, uid, sbi)
{
btr_def def = def_array[uid];
/* We now know that def reaches user. */
if (dump_file)
fprintf (dump_file,
"Def in insn %d reaches use in insn %d\n",
uid, insn_uid);
user->n_reaching_defs++;
if (!user->use)
def->has_ambiguous_use = 1;
if (user->first_reaching_def != -1)
{ /* There is more than one reaching def. This is
a rare case, so just give up on this def/use
web when it occurs. */
def->has_ambiguous_use = 1;
def_array[user->first_reaching_def]
->has_ambiguous_use = 1;
if (dump_file)
fprintf (dump_file,
"(use %d has multiple reaching defs)\n",
insn_uid);
}
else
user->first_reaching_def = uid;
if (user->other_use_this_block)
def->other_btr_uses_after_use = 1;
user->next = def->uses;
def->uses = user;
}
sbitmap_free (reaching_defs_of_reg);
}
if (CALL_P (insn))
{
int regno;
for (regno = first_btr; regno <= last_btr; regno++)
if (TEST_HARD_REG_BIT (all_btrs, regno)
&& TEST_HARD_REG_BIT (call_used_reg_set, regno))
sbitmap_difference (reaching_defs, reaching_defs,
btr_defset[regno - first_btr]);
}
}
}
}
sbitmap_free (reaching_defs);
}
static void
build_btr_def_use_webs (fibheap_t all_btr_defs)
{
const int max_uid = get_max_uid ();
btr_def *def_array = XCNEWVEC (btr_def, max_uid);
btr_user *use_array = XCNEWVEC (btr_user, max_uid);
sbitmap *btr_defset = sbitmap_vector_alloc (
(last_btr - first_btr) + 1, max_uid);
sbitmap *bb_gen = sbitmap_vector_alloc (n_basic_blocks, max_uid);
HARD_REG_SET *btrs_written = XCNEWVEC (HARD_REG_SET, n_basic_blocks);
sbitmap *bb_kill;
sbitmap *bb_out;
sbitmap_vector_zero (btr_defset, (last_btr - first_btr) + 1);
compute_defs_uses_and_gen (all_btr_defs, def_array, use_array, btr_defset,
bb_gen, btrs_written);
bb_kill = sbitmap_vector_alloc (n_basic_blocks, max_uid);
compute_kill (bb_kill, btr_defset, btrs_written);
free (btrs_written);
bb_out = sbitmap_vector_alloc (n_basic_blocks, max_uid);
compute_out (bb_out, bb_gen, bb_kill, max_uid);
sbitmap_vector_free (bb_gen);
sbitmap_vector_free (bb_kill);
link_btr_uses (def_array, use_array, bb_out, btr_defset, max_uid);
sbitmap_vector_free (bb_out);
sbitmap_vector_free (btr_defset);
free (use_array);
free (def_array);
}
/* Return true if basic block BB contains the start or end of the
live range of the definition DEF, AND there are other live
ranges of the same target register that include BB. */
static int
block_at_edge_of_live_range_p (int bb, btr_def def)
{
if (def->other_btr_uses_before_def && BASIC_BLOCK (bb) == def->bb)
return 1;
else if (def->other_btr_uses_after_use)
{
btr_user user;
for (user = def->uses; user != NULL; user = user->next)
if (BASIC_BLOCK (bb) == user->bb)
return 1;
}
return 0;
}
/* We are removing the def/use web DEF. The target register
used in this web is therefore no longer live in the live range
of this web, so remove it from the live set of all basic blocks
in the live range of the web.
Blocks at the boundary of the live range may contain other live
ranges for the same target register, so we have to be careful
to remove the target register from the live set of these blocks
only if they do not contain other live ranges for the same register. */
static void
clear_btr_from_live_range (btr_def def)
{
unsigned bb;
bitmap_iterator bi;
EXECUTE_IF_SET_IN_BITMAP (def->live_range, 0, bb, bi)
{
if ((!def->other_btr_uses_before_def
&& !def->other_btr_uses_after_use)
|| !block_at_edge_of_live_range_p (bb, def))
{
CLEAR_HARD_REG_BIT (btrs_live[bb], def->btr);
CLEAR_HARD_REG_BIT (btrs_live_at_end[bb], def->btr);
if (dump_file)
dump_btrs_live (bb);
}
}
if (def->own_end)
CLEAR_HARD_REG_BIT (btrs_live_at_end[def->bb->index], def->btr);
}
/* We are adding the def/use web DEF. Add the target register used
in this web to the live set of all of the basic blocks that contain
the live range of the web.
If OWN_END is set, also show that the register is live from our
definitions at the end of the basic block where it is defined. */
static void
add_btr_to_live_range (btr_def def, int own_end)
{
unsigned bb;
bitmap_iterator bi;
EXECUTE_IF_SET_IN_BITMAP (def->live_range, 0, bb, bi)
{
SET_HARD_REG_BIT (btrs_live[bb], def->btr);
SET_HARD_REG_BIT (btrs_live_at_end[bb], def->btr);
if (dump_file)
dump_btrs_live (bb);
}
if (own_end)
{
SET_HARD_REG_BIT (btrs_live_at_end[def->bb->index], def->btr);
def->own_end = 1;
}
}
/* Update a live range to contain the basic block NEW_BLOCK, and all
blocks on paths between the existing live range and NEW_BLOCK.
HEAD is a block contained in the existing live range that dominates
all other blocks in the existing live range.
Also add to the set BTRS_LIVE_IN_RANGE all target registers that
are live in the blocks that we add to the live range.
If FULL_RANGE is set, include the full live range of NEW_BB;
otherwise, if NEW_BB dominates HEAD_BB, only add registers that
are life at the end of NEW_BB for NEW_BB itself.
It is a precondition that either NEW_BLOCK dominates HEAD,or
HEAD dom NEW_BLOCK. This is used to speed up the
implementation of this function. */
static void
augment_live_range (bitmap live_range, HARD_REG_SET *btrs_live_in_range,
basic_block head_bb, basic_block new_bb, int full_range)
{
basic_block *worklist, *tos;
tos = worklist = XNEWVEC (basic_block, n_basic_blocks + 1);
if (dominated_by_p (CDI_DOMINATORS, new_bb, head_bb))
{
if (new_bb == head_bb)
{
if (full_range)
IOR_HARD_REG_SET (*btrs_live_in_range, btrs_live[new_bb->index]);
free (tos);
return;
}
*tos++ = new_bb;
}
else
{
edge e;
edge_iterator ei;
int new_block = new_bb->index;
gcc_assert (dominated_by_p (CDI_DOMINATORS, head_bb, new_bb));
IOR_HARD_REG_SET (*btrs_live_in_range, btrs_live[head_bb->index]);
bitmap_set_bit (live_range, new_block);
/* A previous btr migration could have caused a register to be
live just at the end of new_block which we need in full, so
use trs_live_at_end even if full_range is set. */
IOR_HARD_REG_SET (*btrs_live_in_range, btrs_live_at_end[new_block]);
if (full_range)
IOR_HARD_REG_SET (*btrs_live_in_range, btrs_live[new_block]);
if (dump_file)
{
fprintf (dump_file,
"Adding end of block %d and rest of %d to live range\n",
new_block, head_bb->index);
fprintf (dump_file,"Now live btrs are ");
dump_hard_reg_set (*btrs_live_in_range);
fprintf (dump_file, "\n");
}
FOR_EACH_EDGE (e, ei, head_bb->preds)
*tos++ = e->src;
}
while (tos != worklist)
{
basic_block bb = *--tos;
if (!bitmap_bit_p (live_range, bb->index))
{
edge e;
edge_iterator ei;
bitmap_set_bit (live_range, bb->index);
IOR_HARD_REG_SET (*btrs_live_in_range,
btrs_live[bb->index]);
/* A previous btr migration could have caused a register to be
live just at the end of a block which we need in full. */
IOR_HARD_REG_SET (*btrs_live_in_range,
btrs_live_at_end[bb->index]);
if (dump_file)
{
fprintf (dump_file,
"Adding block %d to live range\n", bb->index);
fprintf (dump_file,"Now live btrs are ");
dump_hard_reg_set (*btrs_live_in_range);
fprintf (dump_file, "\n");
}
FOR_EACH_EDGE (e, ei, bb->preds)
{
basic_block pred = e->src;
if (!bitmap_bit_p (live_range, pred->index))
*tos++ = pred;
}
}
}
free (worklist);
}
/* Return the most desirable target register that is not in
the set USED_BTRS. */
static int
choose_btr (HARD_REG_SET used_btrs)
{
int i;
if (!hard_reg_set_subset_p (all_btrs, used_btrs))
for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
{
#ifdef REG_ALLOC_ORDER
int regno = reg_alloc_order[i];
#else
int regno = i;
#endif
if (TEST_HARD_REG_BIT (all_btrs, regno)
&& !TEST_HARD_REG_BIT (used_btrs, regno))
return regno;