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
|
/* Single entry single exit control flow regions.
Copyright (C) 2008-2016 Free Software Foundation, Inc.
Contributed by Jan Sjodin <jan.sjodin@amd.com> and
Sebastian Pop <sebastian.pop@amd.com>.
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/>. */
#ifndef GCC_SESE_H
#define GCC_SESE_H
typedef hash_map<basic_block, vec<basic_block> > bb_map_t;
typedef hash_map<tree, vec<tree> > rename_map_t;
typedef struct ifsese_s *ifsese;
/* First phi is the new codegenerated phi second one is original phi. */
typedef std::pair <gphi *, gphi *> phi_rename;
/* First edge is the init edge and second is the back edge w.r.t. a loop. */
typedef std::pair<edge, edge> init_back_edge_pair_t;
/* A Single Entry, Single Exit region is a part of the CFG delimited
by two edges. */
struct sese_l
{
sese_l (edge e, edge x) : entry (e), exit (x) {}
operator bool () const { return entry && exit; }
edge entry;
edge exit;
};
/* Get the entry of an sese S. */
static inline basic_block
get_entry_bb (sese_l &s)
{
return s.entry->dest;
}
/* Get the exit of an sese S. */
static inline basic_block
get_exit_bb (sese_l &s)
{
return s.exit->src;
}
/* Returns the index of V where ELEM can be found. -1 Otherwise. */
template<typename T>
int
vec_find (const vec<T> &v, const T &elem)
{
int i;
T t;
FOR_EACH_VEC_ELT (v, i, t)
if (elem == t)
return i;
return -1;
}
/* A helper structure for bookkeeping information about a scop in graphite. */
typedef struct sese_info_t
{
/* The SESE region. */
sese_l region;
/* Parameters used within the SCOP. */
vec<tree> params;
/* Maps an old name to one or more new names. When there are several new
names, one has to select the definition corresponding to the immediate
dominator. */
rename_map_t *rename_map;
/* Loops completely contained in this SESE. */
vec<loop_p> loop_nest;
/* Basic blocks contained in this SESE. */
vec<basic_block> bbs;
/* Copied basic blocks indexed by the original bb. */
bb_map_t *copied_bb_map;
/* A vector of phi nodes to be updated when all arguments are available. The
pair contains first the old_phi and second the new_phi. */
vec<phi_rename> incomplete_phis;
/* The condition region generated for this sese. */
ifsese if_region;
} *sese_info_p;
extern sese_info_p new_sese_info (edge, edge);
extern void free_sese_info (sese_info_p);
extern void sese_insert_phis_for_liveouts (sese_info_p, basic_block, edge, edge);
extern struct loop *outermost_loop_in_sese (sese_l &, basic_block);
extern tree scalar_evolution_in_region (const sese_l &, loop_p, tree);
extern bool scev_analyzable_p (tree, sese_l &);
extern bool invariant_in_sese_p_rec (tree, const sese_l &, bool *);
/* The number of parameters in REGION. */
static inline unsigned
sese_nb_params (sese_info_p region)
{
return region->params.length ();
}
/* Checks whether BB is contained in the region delimited by ENTRY and
EXIT blocks. */
static inline bool
bb_in_region (const_basic_block bb, const_basic_block entry, const_basic_block exit)
{
/* FIXME: PR67842. */
#if 0
if (flag_checking)
{
edge e;
edge_iterator ei;
/* Check that there are no edges coming in the region: all the
predecessors of EXIT are dominated by ENTRY. */
FOR_EACH_EDGE (e, ei, exit->preds)
gcc_assert (dominated_by_p (CDI_DOMINATORS, e->src, entry));
}
#endif
return dominated_by_p (CDI_DOMINATORS, bb, entry)
&& !(dominated_by_p (CDI_DOMINATORS, bb, exit)
&& !dominated_by_p (CDI_DOMINATORS, entry, exit));
}
/* Checks whether BB is contained in the region delimited by ENTRY and
EXIT blocks. */
static inline bool
bb_in_sese_p (basic_block bb, const sese_l &r)
{
return bb_in_region (bb, r.entry->dest, r.exit->dest);
}
/* Returns true when STMT is defined in REGION. */
static inline bool
stmt_in_sese_p (gimple *stmt, const sese_l &r)
{
basic_block bb = gimple_bb (stmt);
return bb && bb_in_sese_p (bb, r);
}
/* Returns true when NAME is defined in REGION. */
static inline bool
defined_in_sese_p (tree name, const sese_l &r)
{
return stmt_in_sese_p (SSA_NAME_DEF_STMT (name), r);
}
/* Returns true when LOOP is in REGION. */
static inline bool
loop_in_sese_p (struct loop *loop, const sese_l ®ion)
{
return (bb_in_sese_p (loop->header, region)
&& bb_in_sese_p (loop->latch, region));
}
/* Returns the loop depth of LOOP in REGION. The loop depth
is the same as the normal loop depth, but limited by a region.
Example:
loop_0
loop_1
{
S0
<- region start
S1
loop_2
S2
S3
<- region end
}
loop_0 does not exist in the region -> invalid
loop_1 exists, but is not completely contained in the region -> depth 0
loop_2 is completely contained -> depth 1 */
static inline unsigned int
sese_loop_depth (sese_l ®ion, loop_p loop)
{
unsigned int depth = 0;
while (loop_in_sese_p (loop, region))
{
depth++;
loop = loop_outer (loop);
}
return depth;
}
/* A single entry single exit specialized for conditions. */
typedef struct ifsese_s {
sese_info_p region;
sese_info_p true_region;
sese_info_p false_region;
} *ifsese;
extern void if_region_set_false_region (ifsese, sese_info_p);
extern ifsese move_sese_in_condition (sese_info_p);
extern void set_ifsese_condition (ifsese, tree);
extern edge get_true_edge_from_guard_bb (basic_block);
extern edge get_false_edge_from_guard_bb (basic_block);
static inline edge
if_region_entry (ifsese if_region)
{
return if_region->region->region.entry;
}
static inline edge
if_region_exit (ifsese if_region)
{
return if_region->region->region.exit;
}
static inline basic_block
if_region_get_condition_block (ifsese if_region)
{
return if_region_entry (if_region)->dest;
}
/* Free and compute again all the dominators information. */
static inline void
recompute_all_dominators (void)
{
mark_irreducible_loops ();
free_dominance_info (CDI_DOMINATORS);
calculate_dominance_info (CDI_DOMINATORS);
free_dominance_info (CDI_POST_DOMINATORS);
calculate_dominance_info (CDI_POST_DOMINATORS);
}
typedef std::pair <gimple *, tree> scalar_use;
typedef struct gimple_poly_bb
{
basic_block bb;
struct poly_bb *pbb;
/* Lists containing the restrictions of the conditional statements
dominating this bb. This bb can only be executed, if all conditions
are true.
Example:
for (i = 0; i <= 20; i++)
{
A
if (2i <= 8)
B
}
So for B there is an additional condition (2i <= 8).
List of COND_EXPR and SWITCH_EXPR. A COND_EXPR is true only if the
corresponding element in CONDITION_CASES is not NULL_TREE. For a
SWITCH_EXPR the corresponding element in CONDITION_CASES is a
CASE_LABEL_EXPR. */
vec<gimple *> conditions;
vec<gimple *> condition_cases;
vec<data_reference_p> data_refs;
vec<scalar_use> read_scalar_refs;
vec<tree> write_scalar_refs;
} *gimple_poly_bb_p;
#define GBB_BB(GBB) (GBB)->bb
#define GBB_PBB(GBB) (GBB)->pbb
#define GBB_DATA_REFS(GBB) (GBB)->data_refs
#define GBB_CONDITIONS(GBB) (GBB)->conditions
#define GBB_CONDITION_CASES(GBB) (GBB)->condition_cases
/* Return the innermost loop that contains the basic block GBB. */
static inline struct loop *
gbb_loop (gimple_poly_bb_p gbb)
{
return GBB_BB (gbb)->loop_father;
}
/* Returns the gimple loop, that corresponds to the loop_iterator_INDEX.
If there is no corresponding gimple loop, we return NULL. */
static inline loop_p
gbb_loop_at_index (gimple_poly_bb_p gbb, sese_l ®ion, int index)
{
loop_p loop = gbb_loop (gbb);
int depth = sese_loop_depth (region, loop);
while (--depth > index)
loop = loop_outer (loop);
gcc_assert (loop_in_sese_p (loop, region));
return loop;
}
/* The number of common loops in REGION for GBB1 and GBB2. */
static inline int
nb_common_loops (sese_l ®ion, gimple_poly_bb_p gbb1, gimple_poly_bb_p gbb2)
{
loop_p l1 = gbb_loop (gbb1);
loop_p l2 = gbb_loop (gbb2);
loop_p common = find_common_loop (l1, l2);
return sese_loop_depth (region, common);
}
#endif
|