blob: a49c93e26108abfed2a21f7fb53be6eb16da81bb (
plain)
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
|
/* { dg-do compile } */
/* { dg-options "-O2 -ftree-loop-distribution" } */
struct rtx_def
{
int a;
};
typedef struct rtx_def *rtx;
struct rd {
int alternative_enabled_p[100];
rtx operand[100];
int n_operands;
};
rtx this_insn;
int n_reloads;
int n_replacements;
int n_earlyclobbers;
int replace_reloads;
int hard_regs_live_known;
short* static_reload_reg_p;
struct rd recog_data;
int
find_reloads (rtx insn, int replace, int ind_levels, int live_known,
short *reload_reg_p)
{
int i, j;
int noperands = replace;
int no_input_reloads = 0;
int n_alternatives = replace;
char this_alternative_match_win[30];
char this_alternative_win[30];
char this_alternative_earlyclobber[30];
int this_alternative_matches[30];
int goal_alternative[30];
int this_alternative_number;
char goal_alternative_match_win[30];
char goal_alternative_win[30];
int best;
int operand_mode[30];
int retval = 0;
for (this_alternative_number = 0;
this_alternative_number < n_alternatives;
this_alternative_number++)
{
int losers = 0;
int bad = 0;
if (!recog_data.alternative_enabled_p[this_alternative_number])
{
int i;
for (i = 0; i < recog_data.n_operands; i++)
;
continue;
}
for (i = 0; i < noperands; i++)
if (this_alternative_earlyclobber[i]
&& (this_alternative_win[i] || this_alternative_match_win[i]))
{
if (j != noperands)
{
losers++;
for (j = 0; j < noperands; j++)
if (this_alternative_matches[j] == i
&& this_alternative_match_win[j])
{
this_alternative_win[j] = 0;
this_alternative_match_win[j] = 0;
losers++;
}
}
}
if (losers == 0)
{
for (i = 0; i < noperands; i++)
{
goal_alternative_win[i] = 0;
goal_alternative_match_win[i] = 0;
}
goto finish;
}
if (! bad && best > losers)
{
for (i = 0; i < noperands; i++)
{
goal_alternative[i] = 0;
goal_alternative_win[i] = 0;
}
}
}
finish:
for (i = 0; i < noperands; i++)
if (! goal_alternative_win[i])
{
rtx op = recog_data.operand[i];
int mode = operand_mode[i];
if (((ix86_preferred_reload_class ((op), (goal_alternative[i])) == 2)
|| no_input_reloads)
&& mode != 0)
{}
}
return retval;
}
|
