]>
Commit | Line | Data |
---|---|---|
e855c69d | 1 | /* Instruction scheduling pass. Selective scheduler and pipeliner. |
c02e2d5c | 2 | Copyright (C) 2006, 2007, 2008, 2009, 2010 Free Software Foundation, Inc. |
e855c69d AB |
3 | |
4 | This file is part of GCC. | |
5 | ||
6 | GCC is free software; you can redistribute it and/or modify it under | |
7 | the terms of the GNU General Public License as published by the Free | |
8 | Software Foundation; either version 3, or (at your option) any later | |
9 | version. | |
10 | ||
11 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
12 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with GCC; see the file COPYING3. If not see | |
18 | <http://www.gnu.org/licenses/>. */ | |
19 | ||
20 | #include "config.h" | |
21 | #include "system.h" | |
22 | #include "coretypes.h" | |
23 | #include "tm.h" | |
0cbd9993 | 24 | #include "rtl-error.h" |
e855c69d AB |
25 | #include "tm_p.h" |
26 | #include "hard-reg-set.h" | |
27 | #include "regs.h" | |
28 | #include "function.h" | |
29 | #include "flags.h" | |
30 | #include "insn-config.h" | |
31 | #include "insn-attr.h" | |
32 | #include "except.h" | |
e855c69d AB |
33 | #include "recog.h" |
34 | #include "params.h" | |
35 | #include "target.h" | |
36 | #include "output.h" | |
37 | #include "timevar.h" | |
38 | #include "tree-pass.h" | |
39 | #include "sched-int.h" | |
40 | #include "ggc.h" | |
41 | #include "tree.h" | |
42 | #include "vec.h" | |
43 | #include "langhooks.h" | |
44 | #include "rtlhooks-def.h" | |
45 | #include "output.h" | |
5936d944 | 46 | #include "emit-rtl.h" |
e855c69d AB |
47 | |
48 | #ifdef INSN_SCHEDULING | |
49 | #include "sel-sched-ir.h" | |
50 | #include "sel-sched-dump.h" | |
51 | #include "sel-sched.h" | |
52 | #include "dbgcnt.h" | |
53 | ||
54 | /* Implementation of selective scheduling approach. | |
55 | The below implementation follows the original approach with the following | |
56 | changes: | |
57 | ||
b8698a0f | 58 | o the scheduler works after register allocation (but can be also tuned |
e855c69d AB |
59 | to work before RA); |
60 | o some instructions are not copied or register renamed; | |
61 | o conditional jumps are not moved with code duplication; | |
62 | o several jumps in one parallel group are not supported; | |
63 | o when pipelining outer loops, code motion through inner loops | |
64 | is not supported; | |
65 | o control and data speculation are supported; | |
66 | o some improvements for better compile time/performance were made. | |
67 | ||
68 | Terminology | |
69 | =========== | |
70 | ||
b8698a0f L |
71 | A vinsn, or virtual insn, is an insn with additional data characterizing |
72 | insn pattern, such as LHS, RHS, register sets used/set/clobbered, etc. | |
73 | Vinsns also act as smart pointers to save memory by reusing them in | |
e855c69d AB |
74 | different expressions. A vinsn is described by vinsn_t type. |
75 | ||
76 | An expression is a vinsn with additional data characterizing its properties | |
b8698a0f | 77 | at some point in the control flow graph. The data may be its usefulness, |
e855c69d AB |
78 | priority, speculative status, whether it was renamed/subsituted, etc. |
79 | An expression is described by expr_t type. | |
80 | ||
b8698a0f | 81 | Availability set (av_set) is a set of expressions at a given control flow |
e855c69d | 82 | point. It is represented as av_set_t. The expressions in av sets are kept |
b8698a0f | 83 | sorted in the terms of expr_greater_p function. It allows to truncate |
e855c69d | 84 | the set while leaving the best expressions. |
b8698a0f | 85 | |
e855c69d AB |
86 | A fence is a point through which code motion is prohibited. On each step, |
87 | we gather a parallel group of insns at a fence. It is possible to have | |
88 | multiple fences. A fence is represented via fence_t. | |
89 | ||
90 | A boundary is the border between the fence group and the rest of the code. | |
91 | Currently, we never have more than one boundary per fence, as we finalize | |
b8698a0f | 92 | the fence group when a jump is scheduled. A boundary is represented |
e855c69d AB |
93 | via bnd_t. |
94 | ||
95 | High-level overview | |
96 | =================== | |
97 | ||
98 | The scheduler finds regions to schedule, schedules each one, and finalizes. | |
b8698a0f | 99 | The regions are formed starting from innermost loops, so that when the inner |
e855c69d | 100 | loop is pipelined, its prologue can be scheduled together with yet unprocessed |
b8698a0f | 101 | outer loop. The rest of acyclic regions are found using extend_rgns: |
e855c69d | 102 | the blocks that are not yet allocated to any regions are traversed in top-down |
b8698a0f | 103 | order, and a block is added to a region to which all its predecessors belong; |
e855c69d AB |
104 | otherwise, the block starts its own region. |
105 | ||
106 | The main scheduling loop (sel_sched_region_2) consists of just | |
107 | scheduling on each fence and updating fences. For each fence, | |
108 | we fill a parallel group of insns (fill_insns) until some insns can be added. | |
b8698a0f L |
109 | First, we compute available exprs (av-set) at the boundary of the current |
110 | group. Second, we choose the best expression from it. If the stall is | |
e855c69d | 111 | required to schedule any of the expressions, we advance the current cycle |
b8698a0f | 112 | appropriately. So, the final group does not exactly correspond to a VLIW |
e855c69d AB |
113 | word. Third, we move the chosen expression to the boundary (move_op) |
114 | and update the intermediate av sets and liveness sets. We quit fill_insns | |
115 | when either no insns left for scheduling or we have scheduled enough insns | |
b8698a0f | 116 | so we feel like advancing a scheduling point. |
e855c69d AB |
117 | |
118 | Computing available expressions | |
119 | =============================== | |
120 | ||
121 | The computation (compute_av_set) is a bottom-up traversal. At each insn, | |
b8698a0f L |
122 | we're moving the union of its successors' sets through it via |
123 | moveup_expr_set. The dependent expressions are removed. Local | |
124 | transformations (substitution, speculation) are applied to move more | |
e855c69d AB |
125 | exprs. Then the expr corresponding to the current insn is added. |
126 | The result is saved on each basic block header. | |
127 | ||
128 | When traversing the CFG, we're moving down for no more than max_ws insns. | |
129 | Also, we do not move down to ineligible successors (is_ineligible_successor), | |
130 | which include moving along a back-edge, moving to already scheduled code, | |
b8698a0f | 131 | and moving to another fence. The first two restrictions are lifted during |
e855c69d AB |
132 | pipelining, which allows us to move insns along a back-edge. We always have |
133 | an acyclic region for scheduling because we forbid motion through fences. | |
134 | ||
135 | Choosing the best expression | |
136 | ============================ | |
137 | ||
138 | We sort the final availability set via sel_rank_for_schedule, then we remove | |
139 | expressions which are not yet ready (tick_check_p) or which dest registers | |
b8698a0f L |
140 | cannot be used. For some of them, we choose another register via |
141 | find_best_reg. To do this, we run find_used_regs to calculate the set of | |
e855c69d AB |
142 | registers which cannot be used. The find_used_regs function performs |
143 | a traversal of code motion paths for an expr. We consider for renaming | |
b8698a0f | 144 | only registers which are from the same regclass as the original one and |
e855c69d AB |
145 | using which does not interfere with any live ranges. Finally, we convert |
146 | the resulting set to the ready list format and use max_issue and reorder* | |
147 | hooks similarly to the Haifa scheduler. | |
148 | ||
149 | Scheduling the best expression | |
150 | ============================== | |
151 | ||
b8698a0f | 152 | We run the move_op routine to perform the same type of code motion paths |
e855c69d AB |
153 | traversal as in find_used_regs. (These are working via the same driver, |
154 | code_motion_path_driver.) When moving down the CFG, we look for original | |
b8698a0f | 155 | instruction that gave birth to a chosen expression. We undo |
e855c69d | 156 | the transformations performed on an expression via the history saved in it. |
b8698a0f L |
157 | When found, we remove the instruction or leave a reg-reg copy/speculation |
158 | check if needed. On a way up, we insert bookkeeping copies at each join | |
159 | point. If a copy is not needed, it will be removed later during this | |
e855c69d AB |
160 | traversal. We update the saved av sets and liveness sets on the way up, too. |
161 | ||
162 | Finalizing the schedule | |
163 | ======================= | |
164 | ||
b8698a0f L |
165 | When pipelining, we reschedule the blocks from which insns were pipelined |
166 | to get a tighter schedule. On Itanium, we also perform bundling via | |
167 | the same routine from ia64.c. | |
e855c69d AB |
168 | |
169 | Dependence analysis changes | |
170 | =========================== | |
171 | ||
172 | We augmented the sched-deps.c with hooks that get called when a particular | |
173 | dependence is found in a particular part of an insn. Using these hooks, we | |
174 | can do several actions such as: determine whether an insn can be moved through | |
b8698a0f L |
175 | another (has_dependence_p, moveup_expr); find out whether an insn can be |
176 | scheduled on the current cycle (tick_check_p); find out registers that | |
177 | are set/used/clobbered by an insn and find out all the strange stuff that | |
178 | restrict its movement, like SCHED_GROUP_P or CANT_MOVE (done in | |
e855c69d AB |
179 | init_global_and_expr_for_insn). |
180 | ||
181 | Initialization changes | |
182 | ====================== | |
183 | ||
b8698a0f | 184 | There are parts of haifa-sched.c, sched-deps.c, and sched-rgn.c that are |
e855c69d | 185 | reused in all of the schedulers. We have split up the initialization of data |
b8698a0f | 186 | of such parts into different functions prefixed with scheduler type and |
e855c69d AB |
187 | postfixed with the type of data initialized: {,sel_,haifa_}sched_{init,finish}, |
188 | sched_rgn_init/finish, sched_deps_init/finish, sched_init_{luids/bbs}, etc. | |
b8698a0f L |
189 | The same splitting is done with current_sched_info structure: |
190 | dependence-related parts are in sched_deps_info, common part is in | |
e855c69d | 191 | common_sched_info, and haifa/sel/etc part is in current_sched_info. |
b8698a0f | 192 | |
e855c69d AB |
193 | Target contexts |
194 | =============== | |
195 | ||
196 | As we now have multiple-point scheduling, this would not work with backends | |
b8698a0f L |
197 | which save some of the scheduler state to use it in the target hooks. |
198 | For this purpose, we introduce a concept of target contexts, which | |
e855c69d AB |
199 | encapsulate such information. The backend should implement simple routines |
200 | of allocating/freeing/setting such a context. The scheduler calls these | |
201 | as target hooks and handles the target context as an opaque pointer (similar | |
202 | to the DFA state type, state_t). | |
203 | ||
204 | Various speedups | |
205 | ================ | |
206 | ||
207 | As the correct data dependence graph is not supported during scheduling (which | |
b8698a0f L |
208 | is to be changed in mid-term), we cache as much of the dependence analysis |
209 | results as possible to avoid reanalyzing. This includes: bitmap caches on | |
210 | each insn in stream of the region saying yes/no for a query with a pair of | |
e855c69d AB |
211 | UIDs; hashtables with the previously done transformations on each insn in |
212 | stream; a vector keeping a history of transformations on each expr. | |
213 | ||
214 | Also, we try to minimize the dependence context used on each fence to check | |
215 | whether the given expression is ready for scheduling by removing from it | |
b8698a0f | 216 | insns that are definitely completed the execution. The results of |
e855c69d AB |
217 | tick_check_p checks are also cached in a vector on each fence. |
218 | ||
b8698a0f | 219 | We keep a valid liveness set on each insn in a region to avoid the high |
e855c69d AB |
220 | cost of recomputation on large basic blocks. |
221 | ||
222 | Finally, we try to minimize the number of needed updates to the availability | |
b8698a0f | 223 | sets. The updates happen in two cases: when fill_insns terminates, |
e855c69d AB |
224 | we advance all fences and increase the stage number to show that the region |
225 | has changed and the sets are to be recomputed; and when the next iteration | |
226 | of a loop in fill_insns happens (but this one reuses the saved av sets | |
227 | on bb headers.) Thus, we try to break the fill_insns loop only when | |
228 | "significant" number of insns from the current scheduling window was | |
229 | scheduled. This should be made a target param. | |
b8698a0f | 230 | |
e855c69d AB |
231 | |
232 | TODO: correctly support the data dependence graph at all stages and get rid | |
233 | of all caches. This should speed up the scheduler. | |
234 | TODO: implement moving cond jumps with bookkeeping copies on both targets. | |
235 | TODO: tune the scheduler before RA so it does not create too much pseudos. | |
236 | ||
237 | ||
238 | References: | |
239 | S.-M. Moon and K. Ebcioglu. Parallelizing nonnumerical code with | |
b8698a0f L |
240 | selective scheduling and software pipelining. |
241 | ACM TOPLAS, Vol 19, No. 6, pages 853--898, Nov. 1997. | |
e855c69d | 242 | |
b8698a0f L |
243 | Andrey Belevantsev, Maxim Kuvyrkov, Vladimir Makarov, Dmitry Melnik, |
244 | and Dmitry Zhurikhin. An interblock VLIW-targeted instruction scheduler | |
e855c69d AB |
245 | for GCC. In Proceedings of GCC Developers' Summit 2006. |
246 | ||
b8698a0f | 247 | Arutyun Avetisyan, Andrey Belevantsev, and Dmitry Melnik. GCC Instruction |
e855c69d AB |
248 | Scheduler and Software Pipeliner on the Itanium Platform. EPIC-7 Workshop. |
249 | http://rogue.colorado.edu/EPIC7/. | |
b8698a0f | 250 | |
e855c69d AB |
251 | */ |
252 | ||
253 | /* True when pipelining is enabled. */ | |
254 | bool pipelining_p; | |
255 | ||
256 | /* True if bookkeeping is enabled. */ | |
257 | bool bookkeeping_p; | |
258 | ||
259 | /* Maximum number of insns that are eligible for renaming. */ | |
260 | int max_insns_to_rename; | |
261 | \f | |
262 | ||
263 | /* Definitions of local types and macros. */ | |
264 | ||
265 | /* Represents possible outcomes of moving an expression through an insn. */ | |
b8698a0f L |
266 | enum MOVEUP_EXPR_CODE |
267 | { | |
e855c69d | 268 | /* The expression is not changed. */ |
b8698a0f | 269 | MOVEUP_EXPR_SAME, |
e855c69d AB |
270 | |
271 | /* Not changed, but requires a new destination register. */ | |
b8698a0f | 272 | MOVEUP_EXPR_AS_RHS, |
e855c69d AB |
273 | |
274 | /* Cannot be moved. */ | |
b8698a0f | 275 | MOVEUP_EXPR_NULL, |
e855c69d AB |
276 | |
277 | /* Changed (substituted or speculated). */ | |
b8698a0f | 278 | MOVEUP_EXPR_CHANGED |
e855c69d AB |
279 | }; |
280 | ||
281 | /* The container to be passed into rtx search & replace functions. */ | |
282 | struct rtx_search_arg | |
283 | { | |
284 | /* What we are searching for. */ | |
285 | rtx x; | |
286 | ||
287 | /* The occurence counter. */ | |
288 | int n; | |
289 | }; | |
290 | ||
291 | typedef struct rtx_search_arg *rtx_search_arg_p; | |
292 | ||
b8698a0f | 293 | /* This struct contains precomputed hard reg sets that are needed when |
e855c69d | 294 | computing registers available for renaming. */ |
b8698a0f | 295 | struct hard_regs_data |
e855c69d | 296 | { |
b8698a0f | 297 | /* For every mode, this stores registers available for use with |
e855c69d AB |
298 | that mode. */ |
299 | HARD_REG_SET regs_for_mode[NUM_MACHINE_MODES]; | |
300 | ||
301 | /* True when regs_for_mode[mode] is initialized. */ | |
302 | bool regs_for_mode_ok[NUM_MACHINE_MODES]; | |
303 | ||
304 | /* For every register, it has regs that are ok to rename into it. | |
305 | The register in question is always set. If not, this means | |
306 | that the whole set is not computed yet. */ | |
307 | HARD_REG_SET regs_for_rename[FIRST_PSEUDO_REGISTER]; | |
308 | ||
b8698a0f | 309 | /* For every mode, this stores registers not available due to |
e855c69d AB |
310 | call clobbering. */ |
311 | HARD_REG_SET regs_for_call_clobbered[NUM_MACHINE_MODES]; | |
312 | ||
313 | /* All registers that are used or call used. */ | |
314 | HARD_REG_SET regs_ever_used; | |
315 | ||
316 | #ifdef STACK_REGS | |
317 | /* Stack registers. */ | |
318 | HARD_REG_SET stack_regs; | |
319 | #endif | |
320 | }; | |
321 | ||
322 | /* Holds the results of computation of available for renaming and | |
323 | unavailable hard registers. */ | |
324 | struct reg_rename | |
325 | { | |
326 | /* These are unavailable due to calls crossing, globalness, etc. */ | |
327 | HARD_REG_SET unavailable_hard_regs; | |
328 | ||
329 | /* These are *available* for renaming. */ | |
330 | HARD_REG_SET available_for_renaming; | |
331 | ||
332 | /* Whether this code motion path crosses a call. */ | |
333 | bool crosses_call; | |
334 | }; | |
335 | ||
b8698a0f | 336 | /* A global structure that contains the needed information about harg |
e855c69d AB |
337 | regs. */ |
338 | static struct hard_regs_data sel_hrd; | |
339 | \f | |
340 | ||
b8698a0f L |
341 | /* This structure holds local data used in code_motion_path_driver hooks on |
342 | the same or adjacent levels of recursion. Here we keep those parameters | |
343 | that are not used in code_motion_path_driver routine itself, but only in | |
344 | its hooks. Moreover, all parameters that can be modified in hooks are | |
345 | in this structure, so all other parameters passed explicitly to hooks are | |
e855c69d AB |
346 | read-only. */ |
347 | struct cmpd_local_params | |
348 | { | |
349 | /* Local params used in move_op_* functions. */ | |
350 | ||
351 | /* Edges for bookkeeping generation. */ | |
352 | edge e1, e2; | |
353 | ||
354 | /* C_EXPR merged from all successors and locally allocated temporary C_EXPR. */ | |
355 | expr_t c_expr_merged, c_expr_local; | |
356 | ||
357 | /* Local params used in fur_* functions. */ | |
358 | /* Copy of the ORIGINAL_INSN list, stores the original insns already | |
359 | found before entering the current level of code_motion_path_driver. */ | |
360 | def_list_t old_original_insns; | |
361 | ||
362 | /* Local params used in move_op_* functions. */ | |
b8698a0f | 363 | /* True when we have removed last insn in the block which was |
e855c69d AB |
364 | also a boundary. Do not update anything or create bookkeeping copies. */ |
365 | BOOL_BITFIELD removed_last_insn : 1; | |
366 | }; | |
367 | ||
368 | /* Stores the static parameters for move_op_* calls. */ | |
369 | struct moveop_static_params | |
370 | { | |
371 | /* Destination register. */ | |
372 | rtx dest; | |
373 | ||
374 | /* Current C_EXPR. */ | |
375 | expr_t c_expr; | |
376 | ||
377 | /* An UID of expr_vliw which is to be moved up. If we find other exprs, | |
378 | they are to be removed. */ | |
379 | int uid; | |
380 | ||
381 | #ifdef ENABLE_CHECKING | |
382 | /* This is initialized to the insn on which the driver stopped its traversal. */ | |
383 | insn_t failed_insn; | |
384 | #endif | |
385 | ||
386 | /* True if we scheduled an insn with different register. */ | |
387 | bool was_renamed; | |
388 | }; | |
389 | ||
390 | /* Stores the static parameters for fur_* calls. */ | |
391 | struct fur_static_params | |
392 | { | |
393 | /* Set of registers unavailable on the code motion path. */ | |
394 | regset used_regs; | |
395 | ||
396 | /* Pointer to the list of original insns definitions. */ | |
397 | def_list_t *original_insns; | |
398 | ||
399 | /* True if a code motion path contains a CALL insn. */ | |
400 | bool crosses_call; | |
401 | }; | |
402 | ||
403 | typedef struct fur_static_params *fur_static_params_p; | |
404 | typedef struct cmpd_local_params *cmpd_local_params_p; | |
405 | typedef struct moveop_static_params *moveop_static_params_p; | |
406 | ||
407 | /* Set of hooks and parameters that determine behaviour specific to | |
408 | move_op or find_used_regs functions. */ | |
409 | struct code_motion_path_driver_info_def | |
410 | { | |
411 | /* Called on enter to the basic block. */ | |
412 | int (*on_enter) (insn_t, cmpd_local_params_p, void *, bool); | |
413 | ||
414 | /* Called when original expr is found. */ | |
415 | void (*orig_expr_found) (insn_t, expr_t, cmpd_local_params_p, void *); | |
416 | ||
417 | /* Called while descending current basic block if current insn is not | |
418 | the original EXPR we're searching for. */ | |
419 | bool (*orig_expr_not_found) (insn_t, av_set_t, void *); | |
420 | ||
421 | /* Function to merge C_EXPRes from different successors. */ | |
422 | void (*merge_succs) (insn_t, insn_t, int, cmpd_local_params_p, void *); | |
423 | ||
424 | /* Function to finalize merge from different successors and possibly | |
425 | deallocate temporary data structures used for merging. */ | |
426 | void (*after_merge_succs) (cmpd_local_params_p, void *); | |
427 | ||
428 | /* Called on the backward stage of recursion to do moveup_expr. | |
429 | Used only with move_op_*. */ | |
430 | void (*ascend) (insn_t, void *); | |
431 | ||
b8698a0f | 432 | /* Called on the ascending pass, before returning from the current basic |
e855c69d AB |
433 | block or from the whole traversal. */ |
434 | void (*at_first_insn) (insn_t, cmpd_local_params_p, void *); | |
435 | ||
b8698a0f | 436 | /* When processing successors in move_op we need only descend into |
e855c69d AB |
437 | SUCCS_NORMAL successors, while in find_used_regs we need SUCCS_ALL. */ |
438 | int succ_flags; | |
439 | ||
440 | /* The routine name to print in dumps ("move_op" of "find_used_regs"). */ | |
441 | const char *routine_name; | |
442 | }; | |
443 | ||
444 | /* Global pointer to current hooks, either points to MOVE_OP_HOOKS or | |
445 | FUR_HOOKS. */ | |
446 | struct code_motion_path_driver_info_def *code_motion_path_driver_info; | |
447 | ||
448 | /* Set of hooks for performing move_op and find_used_regs routines with | |
449 | code_motion_path_driver. */ | |
c32e2175 | 450 | extern struct code_motion_path_driver_info_def move_op_hooks, fur_hooks; |
e855c69d | 451 | |
b8698a0f L |
452 | /* True if/when we want to emulate Haifa scheduler in the common code. |
453 | This is used in sched_rgn_local_init and in various places in | |
e855c69d AB |
454 | sched-deps.c. */ |
455 | int sched_emulate_haifa_p; | |
456 | ||
457 | /* GLOBAL_LEVEL is used to discard information stored in basic block headers | |
458 | av_sets. Av_set of bb header is valid if its (bb header's) level is equal | |
459 | to GLOBAL_LEVEL. And invalid if lesser. This is primarily used to advance | |
460 | scheduling window. */ | |
461 | int global_level; | |
462 | ||
463 | /* Current fences. */ | |
464 | flist_t fences; | |
465 | ||
466 | /* True when separable insns should be scheduled as RHSes. */ | |
467 | static bool enable_schedule_as_rhs_p; | |
468 | ||
469 | /* Used in verify_target_availability to assert that target reg is reported | |
470 | unavailabile by both TARGET_UNAVAILABLE and find_used_regs only if | |
b8698a0f | 471 | we haven't scheduled anything on the previous fence. |
e855c69d | 472 | if scheduled_something_on_previous_fence is true, TARGET_UNAVAILABLE can |
b8698a0f | 473 | have more conservative value than the one returned by the |
e855c69d AB |
474 | find_used_regs, thus we shouldn't assert that these values are equal. */ |
475 | static bool scheduled_something_on_previous_fence; | |
476 | ||
477 | /* All newly emitted insns will have their uids greater than this value. */ | |
478 | static int first_emitted_uid; | |
479 | ||
480 | /* Set of basic blocks that are forced to start new ebbs. This is a subset | |
481 | of all the ebb heads. */ | |
482 | static bitmap_head _forced_ebb_heads; | |
483 | bitmap_head *forced_ebb_heads = &_forced_ebb_heads; | |
484 | ||
485 | /* Blocks that need to be rescheduled after pipelining. */ | |
486 | bitmap blocks_to_reschedule = NULL; | |
487 | ||
488 | /* True when the first lv set should be ignored when updating liveness. */ | |
489 | static bool ignore_first = false; | |
490 | ||
491 | /* Number of insns max_issue has initialized data structures for. */ | |
492 | static int max_issue_size = 0; | |
493 | ||
494 | /* Whether we can issue more instructions. */ | |
495 | static int can_issue_more; | |
496 | ||
497 | /* Maximum software lookahead window size, reduced when rescheduling after | |
498 | pipelining. */ | |
499 | static int max_ws; | |
500 | ||
501 | /* Number of insns scheduled in current region. */ | |
502 | static int num_insns_scheduled; | |
503 | ||
504 | /* A vector of expressions is used to be able to sort them. */ | |
505 | DEF_VEC_P(expr_t); | |
506 | DEF_VEC_ALLOC_P(expr_t,heap); | |
507 | static VEC(expr_t, heap) *vec_av_set = NULL; | |
508 | ||
509 | /* A vector of vinsns is used to hold temporary lists of vinsns. */ | |
510 | DEF_VEC_P(vinsn_t); | |
511 | DEF_VEC_ALLOC_P(vinsn_t,heap); | |
512 | typedef VEC(vinsn_t, heap) *vinsn_vec_t; | |
513 | ||
514 | /* This vector has the exprs which may still present in av_sets, but actually | |
515 | can't be moved up due to bookkeeping created during code motion to another | |
516 | fence. See comment near the call to update_and_record_unavailable_insns | |
517 | for the detailed explanations. */ | |
518 | static vinsn_vec_t vec_bookkeeping_blocked_vinsns = NULL; | |
519 | ||
b8698a0f | 520 | /* This vector has vinsns which are scheduled with renaming on the first fence |
e855c69d AB |
521 | and then seen on the second. For expressions with such vinsns, target |
522 | availability information may be wrong. */ | |
523 | static vinsn_vec_t vec_target_unavailable_vinsns = NULL; | |
524 | ||
525 | /* Vector to store temporary nops inserted in move_op to prevent removal | |
526 | of empty bbs. */ | |
527 | DEF_VEC_P(insn_t); | |
528 | DEF_VEC_ALLOC_P(insn_t,heap); | |
529 | static VEC(insn_t, heap) *vec_temp_moveop_nops = NULL; | |
530 | ||
b8698a0f L |
531 | /* These bitmaps record original instructions scheduled on the current |
532 | iteration and bookkeeping copies created by them. */ | |
e855c69d AB |
533 | static bitmap current_originators = NULL; |
534 | static bitmap current_copies = NULL; | |
535 | ||
536 | /* This bitmap marks the blocks visited by code_motion_path_driver so we don't | |
537 | visit them afterwards. */ | |
538 | static bitmap code_motion_visited_blocks = NULL; | |
539 | ||
540 | /* Variables to accumulate different statistics. */ | |
541 | ||
542 | /* The number of bookkeeping copies created. */ | |
543 | static int stat_bookkeeping_copies; | |
544 | ||
545 | /* The number of insns that required bookkeeiping for their scheduling. */ | |
546 | static int stat_insns_needed_bookkeeping; | |
547 | ||
548 | /* The number of insns that got renamed. */ | |
549 | static int stat_renamed_scheduled; | |
550 | ||
551 | /* The number of substitutions made during scheduling. */ | |
552 | static int stat_substitutions_total; | |
553 | \f | |
554 | ||
555 | /* Forward declarations of static functions. */ | |
556 | static bool rtx_ok_for_substitution_p (rtx, rtx); | |
557 | static int sel_rank_for_schedule (const void *, const void *); | |
558 | static av_set_t find_sequential_best_exprs (bnd_t, expr_t, bool); | |
b5b8b0ac | 559 | static basic_block find_block_for_bookkeeping (edge e1, edge e2, bool lax); |
e855c69d AB |
560 | |
561 | static rtx get_dest_from_orig_ops (av_set_t); | |
562 | static basic_block generate_bookkeeping_insn (expr_t, edge, edge); | |
b8698a0f | 563 | static bool find_used_regs (insn_t, av_set_t, regset, struct reg_rename *, |
e855c69d | 564 | def_list_t *); |
72a54528 AM |
565 | static bool move_op (insn_t, av_set_t, expr_t, rtx, expr_t, bool*); |
566 | static int code_motion_path_driver (insn_t, av_set_t, ilist_t, | |
567 | cmpd_local_params_p, void *); | |
e855c69d AB |
568 | static void sel_sched_region_1 (void); |
569 | static void sel_sched_region_2 (int); | |
570 | static av_set_t compute_av_set_inside_bb (insn_t, ilist_t, int, bool); | |
571 | ||
572 | static void debug_state (state_t); | |
573 | \f | |
574 | ||
575 | /* Functions that work with fences. */ | |
576 | ||
577 | /* Advance one cycle on FENCE. */ | |
578 | static void | |
579 | advance_one_cycle (fence_t fence) | |
580 | { | |
581 | unsigned i; | |
582 | int cycle; | |
583 | rtx insn; | |
b8698a0f | 584 | |
e855c69d AB |
585 | advance_state (FENCE_STATE (fence)); |
586 | cycle = ++FENCE_CYCLE (fence); | |
587 | FENCE_ISSUED_INSNS (fence) = 0; | |
588 | FENCE_STARTS_CYCLE_P (fence) = 1; | |
589 | can_issue_more = issue_rate; | |
136e01a3 | 590 | FENCE_ISSUE_MORE (fence) = can_issue_more; |
e855c69d AB |
591 | |
592 | for (i = 0; VEC_iterate (rtx, FENCE_EXECUTING_INSNS (fence), i, insn); ) | |
593 | { | |
594 | if (INSN_READY_CYCLE (insn) < cycle) | |
595 | { | |
596 | remove_from_deps (FENCE_DC (fence), insn); | |
597 | VEC_unordered_remove (rtx, FENCE_EXECUTING_INSNS (fence), i); | |
598 | continue; | |
599 | } | |
600 | i++; | |
601 | } | |
602 | if (sched_verbose >= 2) | |
603 | { | |
604 | sel_print ("Finished a cycle. Current cycle = %d\n", FENCE_CYCLE (fence)); | |
605 | debug_state (FENCE_STATE (fence)); | |
606 | } | |
607 | } | |
608 | ||
609 | /* Returns true when SUCC in a fallthru bb of INSN, possibly | |
610 | skipping empty basic blocks. */ | |
611 | static bool | |
612 | in_fallthru_bb_p (rtx insn, rtx succ) | |
613 | { | |
614 | basic_block bb = BLOCK_FOR_INSN (insn); | |
0fd4b31d | 615 | edge e; |
e855c69d AB |
616 | |
617 | if (bb == BLOCK_FOR_INSN (succ)) | |
618 | return true; | |
619 | ||
0fd4b31d NF |
620 | e = find_fallthru_edge_from (bb); |
621 | if (e) | |
622 | bb = e->dest; | |
e855c69d AB |
623 | else |
624 | return false; | |
625 | ||
626 | while (sel_bb_empty_p (bb)) | |
627 | bb = bb->next_bb; | |
628 | ||
629 | return bb == BLOCK_FOR_INSN (succ); | |
630 | } | |
631 | ||
b8698a0f | 632 | /* Construct successor fences from OLD_FENCEs and put them in NEW_FENCES. |
e855c69d AB |
633 | When a successor will continue a ebb, transfer all parameters of a fence |
634 | to the new fence. ORIG_MAX_SEQNO is the maximal seqno before this round | |
635 | of scheduling helping to distinguish between the old and the new code. */ | |
636 | static void | |
637 | extract_new_fences_from (flist_t old_fences, flist_tail_t new_fences, | |
638 | int orig_max_seqno) | |
639 | { | |
640 | bool was_here_p = false; | |
641 | insn_t insn = NULL_RTX; | |
642 | insn_t succ; | |
643 | succ_iterator si; | |
644 | ilist_iterator ii; | |
645 | fence_t fence = FLIST_FENCE (old_fences); | |
646 | basic_block bb; | |
647 | ||
648 | /* Get the only element of FENCE_BNDS (fence). */ | |
649 | FOR_EACH_INSN (insn, ii, FENCE_BNDS (fence)) | |
650 | { | |
651 | gcc_assert (!was_here_p); | |
652 | was_here_p = true; | |
653 | } | |
654 | gcc_assert (was_here_p && insn != NULL_RTX); | |
655 | ||
b8698a0f | 656 | /* When in the "middle" of the block, just move this fence |
e855c69d AB |
657 | to the new list. */ |
658 | bb = BLOCK_FOR_INSN (insn); | |
659 | if (! sel_bb_end_p (insn) | |
b8698a0f | 660 | || (single_succ_p (bb) |
e855c69d AB |
661 | && single_pred_p (single_succ (bb)))) |
662 | { | |
663 | insn_t succ; | |
664 | ||
b8698a0f | 665 | succ = (sel_bb_end_p (insn) |
e855c69d AB |
666 | ? sel_bb_head (single_succ (bb)) |
667 | : NEXT_INSN (insn)); | |
668 | ||
b8698a0f | 669 | if (INSN_SEQNO (succ) > 0 |
e855c69d AB |
670 | && INSN_SEQNO (succ) <= orig_max_seqno |
671 | && INSN_SCHED_TIMES (succ) <= 0) | |
672 | { | |
673 | FENCE_INSN (fence) = succ; | |
674 | move_fence_to_fences (old_fences, new_fences); | |
675 | ||
676 | if (sched_verbose >= 1) | |
b8698a0f | 677 | sel_print ("Fence %d continues as %d[%d] (state continue)\n", |
e855c69d AB |
678 | INSN_UID (insn), INSN_UID (succ), BLOCK_NUM (succ)); |
679 | } | |
680 | return; | |
681 | } | |
682 | ||
683 | /* Otherwise copy fence's structures to (possibly) multiple successors. */ | |
684 | FOR_EACH_SUCC_1 (succ, si, insn, SUCCS_NORMAL | SUCCS_SKIP_TO_LOOP_EXITS) | |
685 | { | |
686 | int seqno = INSN_SEQNO (succ); | |
687 | ||
688 | if (0 < seqno && seqno <= orig_max_seqno | |
689 | && (pipelining_p || INSN_SCHED_TIMES (succ) <= 0)) | |
690 | { | |
691 | bool b = (in_same_ebb_p (insn, succ) | |
b8698a0f | 692 | || in_fallthru_bb_p (insn, succ)); |
e855c69d AB |
693 | |
694 | if (sched_verbose >= 1) | |
b8698a0f L |
695 | sel_print ("Fence %d continues as %d[%d] (state %s)\n", |
696 | INSN_UID (insn), INSN_UID (succ), | |
e855c69d AB |
697 | BLOCK_NUM (succ), b ? "continue" : "reset"); |
698 | ||
699 | if (b) | |
700 | add_dirty_fence_to_fences (new_fences, succ, fence); | |
701 | else | |
702 | { | |
703 | /* Mark block of the SUCC as head of the new ebb. */ | |
704 | bitmap_set_bit (forced_ebb_heads, BLOCK_NUM (succ)); | |
705 | add_clean_fence_to_fences (new_fences, succ, fence); | |
706 | } | |
707 | } | |
708 | } | |
709 | } | |
710 | \f | |
711 | ||
712 | /* Functions to support substitution. */ | |
713 | ||
b8698a0f L |
714 | /* Returns whether INSN with dependence status DS is eligible for |
715 | substitution, i.e. it's a copy operation x := y, and RHS that is | |
e855c69d AB |
716 | moved up through this insn should be substituted. */ |
717 | static bool | |
718 | can_substitute_through_p (insn_t insn, ds_t ds) | |
719 | { | |
720 | /* We can substitute only true dependencies. */ | |
721 | if ((ds & DEP_OUTPUT) | |
722 | || (ds & DEP_ANTI) | |
723 | || ! INSN_RHS (insn) | |
724 | || ! INSN_LHS (insn)) | |
725 | return false; | |
726 | ||
b8698a0f | 727 | /* Now we just need to make sure the INSN_RHS consists of only one |
e855c69d | 728 | simple REG rtx. */ |
b8698a0f | 729 | if (REG_P (INSN_LHS (insn)) |
e855c69d | 730 | && REG_P (INSN_RHS (insn))) |
b8698a0f | 731 | return true; |
e855c69d AB |
732 | return false; |
733 | } | |
734 | ||
b8698a0f | 735 | /* Substitute all occurences of INSN's destination in EXPR' vinsn with INSN's |
e855c69d AB |
736 | source (if INSN is eligible for substitution). Returns TRUE if |
737 | substitution was actually performed, FALSE otherwise. Substitution might | |
738 | be not performed because it's either EXPR' vinsn doesn't contain INSN's | |
b8698a0f | 739 | destination or the resulting insn is invalid for the target machine. |
e855c69d AB |
740 | When UNDO is true, perform unsubstitution instead (the difference is in |
741 | the part of rtx on which validate_replace_rtx is called). */ | |
742 | static bool | |
743 | substitute_reg_in_expr (expr_t expr, insn_t insn, bool undo) | |
744 | { | |
745 | rtx *where; | |
746 | bool new_insn_valid; | |
747 | vinsn_t *vi = &EXPR_VINSN (expr); | |
748 | bool has_rhs = VINSN_RHS (*vi) != NULL; | |
749 | rtx old, new_rtx; | |
750 | ||
751 | /* Do not try to replace in SET_DEST. Although we'll choose new | |
b8698a0f | 752 | register for the RHS, we don't want to change RHS' original reg. |
e855c69d | 753 | If the insn is not SET, we may still be able to substitute something |
b8698a0f | 754 | in it, and if we're here (don't have deps), it doesn't write INSN's |
e855c69d AB |
755 | dest. */ |
756 | where = (has_rhs | |
757 | ? &VINSN_RHS (*vi) | |
758 | : &PATTERN (VINSN_INSN_RTX (*vi))); | |
759 | old = undo ? INSN_RHS (insn) : INSN_LHS (insn); | |
760 | ||
761 | /* Substitute if INSN has a form of x:=y and LHS(INSN) occurs in *VI. */ | |
762 | if (rtx_ok_for_substitution_p (old, *where)) | |
763 | { | |
764 | rtx new_insn; | |
765 | rtx *where_replace; | |
766 | ||
767 | /* We should copy these rtxes before substitution. */ | |
768 | new_rtx = copy_rtx (undo ? INSN_LHS (insn) : INSN_RHS (insn)); | |
769 | new_insn = create_copy_of_insn_rtx (VINSN_INSN_RTX (*vi)); | |
770 | ||
b8698a0f | 771 | /* Where we'll replace. |
e855c69d AB |
772 | WHERE_REPLACE should point inside NEW_INSN, so INSN_RHS couldn't be |
773 | used instead of SET_SRC. */ | |
774 | where_replace = (has_rhs | |
775 | ? &SET_SRC (PATTERN (new_insn)) | |
776 | : &PATTERN (new_insn)); | |
777 | ||
b8698a0f L |
778 | new_insn_valid |
779 | = validate_replace_rtx_part_nosimplify (old, new_rtx, where_replace, | |
e855c69d AB |
780 | new_insn); |
781 | ||
782 | /* ??? Actually, constrain_operands result depends upon choice of | |
783 | destination register. E.g. if we allow single register to be an rhs, | |
b8698a0f | 784 | and if we try to move dx=ax(as rhs) through ax=dx, we'll result |
e855c69d AB |
785 | in invalid insn dx=dx, so we'll loose this rhs here. |
786 | Just can't come up with significant testcase for this, so just | |
787 | leaving it for now. */ | |
788 | if (new_insn_valid) | |
789 | { | |
b8698a0f | 790 | change_vinsn_in_expr (expr, |
e855c69d AB |
791 | create_vinsn_from_insn_rtx (new_insn, false)); |
792 | ||
b8698a0f | 793 | /* Do not allow clobbering the address register of speculative |
e855c69d AB |
794 | insns. */ |
795 | if ((EXPR_SPEC_DONE_DS (expr) & SPECULATIVE) | |
b8698a0f | 796 | && bitmap_bit_p (VINSN_REG_USES (EXPR_VINSN (expr)), |
e855c69d AB |
797 | expr_dest_regno (expr))) |
798 | EXPR_TARGET_AVAILABLE (expr) = false; | |
799 | ||
800 | return true; | |
801 | } | |
802 | else | |
803 | return false; | |
804 | } | |
805 | else | |
806 | return false; | |
807 | } | |
808 | ||
809 | /* Helper function for count_occurences_equiv. */ | |
b8698a0f | 810 | static int |
e855c69d AB |
811 | count_occurrences_1 (rtx *cur_rtx, void *arg) |
812 | { | |
813 | rtx_search_arg_p p = (rtx_search_arg_p) arg; | |
814 | ||
815 | /* The last param FOR_GCSE is true, because otherwise it performs excessive | |
816 | substitutions like | |
817 | r8 = r33 | |
818 | r16 = r33 | |
819 | for the last insn it presumes r33 equivalent to r8, so it changes it to | |
820 | r33. Actually, there's no change, but it spoils debugging. */ | |
821 | if (exp_equiv_p (*cur_rtx, p->x, 0, true)) | |
822 | { | |
823 | /* Bail out if we occupy more than one register. */ | |
824 | if (REG_P (*cur_rtx) | |
72a54528 | 825 | && HARD_REGISTER_P (*cur_rtx) |
e855c69d AB |
826 | && hard_regno_nregs[REGNO(*cur_rtx)][GET_MODE (*cur_rtx)] > 1) |
827 | { | |
828 | p->n = 0; | |
829 | return 1; | |
830 | } | |
831 | ||
832 | p->n++; | |
833 | ||
834 | /* Do not traverse subexprs. */ | |
835 | return -1; | |
836 | } | |
837 | ||
838 | if (GET_CODE (*cur_rtx) == SUBREG | |
839 | && REG_P (p->x) | |
5e841c82 AB |
840 | && (!REG_P (SUBREG_REG (*cur_rtx)) |
841 | || REGNO (SUBREG_REG (*cur_rtx)) == REGNO (p->x))) | |
e855c69d AB |
842 | { |
843 | /* ??? Do not support substituting regs inside subregs. In that case, | |
b8698a0f | 844 | simplify_subreg will be called by validate_replace_rtx, and |
e855c69d AB |
845 | unsubstitution will fail later. */ |
846 | p->n = 0; | |
847 | return 1; | |
848 | } | |
849 | ||
850 | /* Continue search. */ | |
851 | return 0; | |
852 | } | |
853 | ||
b8698a0f | 854 | /* Return the number of places WHAT appears within WHERE. |
e855c69d | 855 | Bail out when we found a reference occupying several hard registers. */ |
b8698a0f | 856 | static int |
e855c69d AB |
857 | count_occurrences_equiv (rtx what, rtx where) |
858 | { | |
859 | struct rtx_search_arg arg; | |
860 | ||
861 | arg.x = what; | |
862 | arg.n = 0; | |
863 | ||
864 | for_each_rtx (&where, &count_occurrences_1, (void *) &arg); | |
865 | ||
866 | return arg.n; | |
867 | } | |
868 | ||
869 | /* Returns TRUE if WHAT is found in WHERE rtx tree. */ | |
870 | static bool | |
871 | rtx_ok_for_substitution_p (rtx what, rtx where) | |
872 | { | |
873 | return (count_occurrences_equiv (what, where) > 0); | |
874 | } | |
875 | \f | |
876 | ||
877 | /* Functions to support register renaming. */ | |
878 | ||
879 | /* Substitute VI's set source with REGNO. Returns newly created pattern | |
880 | that has REGNO as its source. */ | |
881 | static rtx | |
882 | create_insn_rtx_with_rhs (vinsn_t vi, rtx rhs_rtx) | |
883 | { | |
884 | rtx lhs_rtx; | |
885 | rtx pattern; | |
886 | rtx insn_rtx; | |
887 | ||
888 | lhs_rtx = copy_rtx (VINSN_LHS (vi)); | |
889 | ||
890 | pattern = gen_rtx_SET (VOIDmode, lhs_rtx, rhs_rtx); | |
891 | insn_rtx = create_insn_rtx_from_pattern (pattern, NULL_RTX); | |
892 | ||
893 | return insn_rtx; | |
894 | } | |
895 | ||
b8698a0f | 896 | /* Returns whether INSN's src can be replaced with register number |
e855c69d AB |
897 | NEW_SRC_REG. E.g. the following insn is valid for i386: |
898 | ||
b8698a0f | 899 | (insn:HI 2205 6585 2207 727 ../../gcc/libiberty/regex.c:3337 |
e855c69d AB |
900 | (set (mem/s:QI (plus:SI (plus:SI (reg/f:SI 7 sp) |
901 | (reg:SI 0 ax [orig:770 c1 ] [770])) | |
902 | (const_int 288 [0x120])) [0 str S1 A8]) | |
903 | (const_int 0 [0x0])) 43 {*movqi_1} (nil) | |
904 | (nil)) | |
905 | ||
906 | But if we change (const_int 0 [0x0]) to (reg:QI 4 si), it will be invalid | |
b8698a0f | 907 | because of operand constraints: |
e855c69d AB |
908 | |
909 | (define_insn "*movqi_1" | |
910 | [(set (match_operand:QI 0 "nonimmediate_operand" "=q,q ,q ,r,r ,?r,m") | |
911 | (match_operand:QI 1 "general_operand" " q,qn,qm,q,rn,qm,qn") | |
912 | )] | |
b8698a0f L |
913 | |
914 | So do constrain_operands here, before choosing NEW_SRC_REG as best | |
e855c69d AB |
915 | reg for rhs. */ |
916 | ||
917 | static bool | |
918 | replace_src_with_reg_ok_p (insn_t insn, rtx new_src_reg) | |
919 | { | |
920 | vinsn_t vi = INSN_VINSN (insn); | |
921 | enum machine_mode mode; | |
922 | rtx dst_loc; | |
923 | bool res; | |
924 | ||
925 | gcc_assert (VINSN_SEPARABLE_P (vi)); | |
926 | ||
927 | get_dest_and_mode (insn, &dst_loc, &mode); | |
928 | gcc_assert (mode == GET_MODE (new_src_reg)); | |
929 | ||
930 | if (REG_P (dst_loc) && REGNO (new_src_reg) == REGNO (dst_loc)) | |
931 | return true; | |
932 | ||
933 | /* See whether SET_SRC can be replaced with this register. */ | |
934 | validate_change (insn, &SET_SRC (PATTERN (insn)), new_src_reg, 1); | |
935 | res = verify_changes (0); | |
936 | cancel_changes (0); | |
937 | ||
938 | return res; | |
939 | } | |
940 | ||
941 | /* Returns whether INSN still be valid after replacing it's DEST with | |
942 | register NEW_REG. */ | |
943 | static bool | |
944 | replace_dest_with_reg_ok_p (insn_t insn, rtx new_reg) | |
945 | { | |
946 | vinsn_t vi = INSN_VINSN (insn); | |
947 | bool res; | |
948 | ||
949 | /* We should deal here only with separable insns. */ | |
950 | gcc_assert (VINSN_SEPARABLE_P (vi)); | |
951 | gcc_assert (GET_MODE (VINSN_LHS (vi)) == GET_MODE (new_reg)); | |
952 | ||
953 | /* See whether SET_DEST can be replaced with this register. */ | |
954 | validate_change (insn, &SET_DEST (PATTERN (insn)), new_reg, 1); | |
955 | res = verify_changes (0); | |
956 | cancel_changes (0); | |
957 | ||
958 | return res; | |
959 | } | |
960 | ||
961 | /* Create a pattern with rhs of VI and lhs of LHS_RTX. */ | |
962 | static rtx | |
963 | create_insn_rtx_with_lhs (vinsn_t vi, rtx lhs_rtx) | |
964 | { | |
965 | rtx rhs_rtx; | |
966 | rtx pattern; | |
967 | rtx insn_rtx; | |
968 | ||
969 | rhs_rtx = copy_rtx (VINSN_RHS (vi)); | |
970 | ||
971 | pattern = gen_rtx_SET (VOIDmode, lhs_rtx, rhs_rtx); | |
972 | insn_rtx = create_insn_rtx_from_pattern (pattern, NULL_RTX); | |
973 | ||
974 | return insn_rtx; | |
975 | } | |
976 | ||
b8698a0f | 977 | /* Substitute lhs in the given expression EXPR for the register with number |
e855c69d AB |
978 | NEW_REGNO. SET_DEST may be arbitrary rtx, not only register. */ |
979 | static void | |
980 | replace_dest_with_reg_in_expr (expr_t expr, rtx new_reg) | |
981 | { | |
982 | rtx insn_rtx; | |
983 | vinsn_t vinsn; | |
984 | ||
985 | insn_rtx = create_insn_rtx_with_lhs (EXPR_VINSN (expr), new_reg); | |
986 | vinsn = create_vinsn_from_insn_rtx (insn_rtx, false); | |
987 | ||
988 | change_vinsn_in_expr (expr, vinsn); | |
989 | EXPR_WAS_RENAMED (expr) = 1; | |
990 | EXPR_TARGET_AVAILABLE (expr) = 1; | |
991 | } | |
992 | ||
993 | /* Returns whether VI writes either one of the USED_REGS registers or, | |
994 | if a register is a hard one, one of the UNAVAILABLE_HARD_REGS registers. */ | |
995 | static bool | |
b8698a0f | 996 | vinsn_writes_one_of_regs_p (vinsn_t vi, regset used_regs, |
e855c69d AB |
997 | HARD_REG_SET unavailable_hard_regs) |
998 | { | |
999 | unsigned regno; | |
1000 | reg_set_iterator rsi; | |
1001 | ||
1002 | EXECUTE_IF_SET_IN_REG_SET (VINSN_REG_SETS (vi), 0, regno, rsi) | |
1003 | { | |
1004 | if (REGNO_REG_SET_P (used_regs, regno)) | |
1005 | return true; | |
1006 | if (HARD_REGISTER_NUM_P (regno) | |
1007 | && TEST_HARD_REG_BIT (unavailable_hard_regs, regno)) | |
1008 | return true; | |
1009 | } | |
1010 | ||
1011 | EXECUTE_IF_SET_IN_REG_SET (VINSN_REG_CLOBBERS (vi), 0, regno, rsi) | |
1012 | { | |
1013 | if (REGNO_REG_SET_P (used_regs, regno)) | |
1014 | return true; | |
1015 | if (HARD_REGISTER_NUM_P (regno) | |
1016 | && TEST_HARD_REG_BIT (unavailable_hard_regs, regno)) | |
1017 | return true; | |
1018 | } | |
1019 | ||
1020 | return false; | |
1021 | } | |
1022 | ||
b8698a0f | 1023 | /* Returns register class of the output register in INSN. |
e855c69d AB |
1024 | Returns NO_REGS for call insns because some targets have constraints on |
1025 | destination register of a call insn. | |
b8698a0f | 1026 | |
e855c69d AB |
1027 | Code adopted from regrename.c::build_def_use. */ |
1028 | static enum reg_class | |
1029 | get_reg_class (rtx insn) | |
1030 | { | |
1031 | int alt, i, n_ops; | |
1032 | ||
1033 | extract_insn (insn); | |
1034 | if (! constrain_operands (1)) | |
1035 | fatal_insn_not_found (insn); | |
1036 | preprocess_constraints (); | |
1037 | alt = which_alternative; | |
1038 | n_ops = recog_data.n_operands; | |
1039 | ||
1040 | for (i = 0; i < n_ops; ++i) | |
1041 | { | |
1042 | int matches = recog_op_alt[i][alt].matches; | |
1043 | if (matches >= 0) | |
1044 | recog_op_alt[i][alt].cl = recog_op_alt[matches][alt].cl; | |
1045 | } | |
1046 | ||
1047 | if (asm_noperands (PATTERN (insn)) > 0) | |
1048 | { | |
1049 | for (i = 0; i < n_ops; i++) | |
1050 | if (recog_data.operand_type[i] == OP_OUT) | |
1051 | { | |
1052 | rtx *loc = recog_data.operand_loc[i]; | |
1053 | rtx op = *loc; | |
1054 | enum reg_class cl = recog_op_alt[i][alt].cl; | |
1055 | ||
1056 | if (REG_P (op) | |
1057 | && REGNO (op) == ORIGINAL_REGNO (op)) | |
1058 | continue; | |
1059 | ||
1060 | return cl; | |
1061 | } | |
1062 | } | |
1063 | else if (!CALL_P (insn)) | |
1064 | { | |
1065 | for (i = 0; i < n_ops + recog_data.n_dups; i++) | |
1066 | { | |
1067 | int opn = i < n_ops ? i : recog_data.dup_num[i - n_ops]; | |
1068 | enum reg_class cl = recog_op_alt[opn][alt].cl; | |
b8698a0f | 1069 | |
e855c69d AB |
1070 | if (recog_data.operand_type[opn] == OP_OUT || |
1071 | recog_data.operand_type[opn] == OP_INOUT) | |
1072 | return cl; | |
1073 | } | |
1074 | } | |
1075 | ||
1076 | /* Insns like | |
1077 | (insn (set (reg:CCZ 17 flags) (compare:CCZ ...))) | |
1078 | may result in returning NO_REGS, cause flags is written implicitly through | |
1079 | CMP insn, which has no OP_OUT | OP_INOUT operands. */ | |
1080 | return NO_REGS; | |
1081 | } | |
1082 | ||
1083 | #ifdef HARD_REGNO_RENAME_OK | |
1084 | /* Calculate HARD_REGNO_RENAME_OK data for REGNO. */ | |
1085 | static void | |
1086 | init_hard_regno_rename (int regno) | |
1087 | { | |
1088 | int cur_reg; | |
1089 | ||
1090 | SET_HARD_REG_BIT (sel_hrd.regs_for_rename[regno], regno); | |
1091 | ||
1092 | for (cur_reg = 0; cur_reg < FIRST_PSEUDO_REGISTER; cur_reg++) | |
1093 | { | |
1094 | /* We are not interested in renaming in other regs. */ | |
1095 | if (!TEST_HARD_REG_BIT (sel_hrd.regs_ever_used, cur_reg)) | |
1096 | continue; | |
1097 | ||
1098 | if (HARD_REGNO_RENAME_OK (regno, cur_reg)) | |
1099 | SET_HARD_REG_BIT (sel_hrd.regs_for_rename[regno], cur_reg); | |
1100 | } | |
1101 | } | |
1102 | #endif | |
1103 | ||
b8698a0f | 1104 | /* A wrapper around HARD_REGNO_RENAME_OK that will look into the hard regs |
e855c69d AB |
1105 | data first. */ |
1106 | static inline bool | |
a20d7130 | 1107 | sel_hard_regno_rename_ok (int from ATTRIBUTE_UNUSED, int to ATTRIBUTE_UNUSED) |
e855c69d AB |
1108 | { |
1109 | #ifdef HARD_REGNO_RENAME_OK | |
1110 | /* Check whether this is all calculated. */ | |
1111 | if (TEST_HARD_REG_BIT (sel_hrd.regs_for_rename[from], from)) | |
1112 | return TEST_HARD_REG_BIT (sel_hrd.regs_for_rename[from], to); | |
1113 | ||
1114 | init_hard_regno_rename (from); | |
1115 | ||
1116 | return TEST_HARD_REG_BIT (sel_hrd.regs_for_rename[from], to); | |
1117 | #else | |
1118 | return true; | |
1119 | #endif | |
1120 | } | |
1121 | ||
1122 | /* Calculate set of registers that are capable of holding MODE. */ | |
1123 | static void | |
1124 | init_regs_for_mode (enum machine_mode mode) | |
1125 | { | |
1126 | int cur_reg; | |
b8698a0f | 1127 | |
e855c69d AB |
1128 | CLEAR_HARD_REG_SET (sel_hrd.regs_for_mode[mode]); |
1129 | CLEAR_HARD_REG_SET (sel_hrd.regs_for_call_clobbered[mode]); | |
1130 | ||
1131 | for (cur_reg = 0; cur_reg < FIRST_PSEUDO_REGISTER; cur_reg++) | |
1132 | { | |
1133 | int nregs = hard_regno_nregs[cur_reg][mode]; | |
1134 | int i; | |
b8698a0f | 1135 | |
e855c69d AB |
1136 | for (i = nregs - 1; i >= 0; --i) |
1137 | if (fixed_regs[cur_reg + i] | |
1138 | || global_regs[cur_reg + i] | |
b8698a0f | 1139 | /* Can't use regs which aren't saved by |
e855c69d AB |
1140 | the prologue. */ |
1141 | || !TEST_HARD_REG_BIT (sel_hrd.regs_ever_used, cur_reg + i) | |
1142 | #ifdef LEAF_REGISTERS | |
1143 | /* We can't use a non-leaf register if we're in a | |
1144 | leaf function. */ | |
1145 | || (current_function_is_leaf | |
1146 | && !LEAF_REGISTERS[cur_reg + i]) | |
1147 | #endif | |
1148 | ) | |
1149 | break; | |
b8698a0f L |
1150 | |
1151 | if (i >= 0) | |
e855c69d | 1152 | continue; |
b8698a0f | 1153 | |
e855c69d AB |
1154 | /* See whether it accepts all modes that occur in |
1155 | original insns. */ | |
1156 | if (! HARD_REGNO_MODE_OK (cur_reg, mode)) | |
1157 | continue; | |
b8698a0f | 1158 | |
e855c69d | 1159 | if (HARD_REGNO_CALL_PART_CLOBBERED (cur_reg, mode)) |
b8698a0f | 1160 | SET_HARD_REG_BIT (sel_hrd.regs_for_call_clobbered[mode], |
e855c69d | 1161 | cur_reg); |
b8698a0f L |
1162 | |
1163 | /* If the CUR_REG passed all the checks above, | |
e855c69d AB |
1164 | then it's ok. */ |
1165 | SET_HARD_REG_BIT (sel_hrd.regs_for_mode[mode], cur_reg); | |
1166 | } | |
1167 | ||
1168 | sel_hrd.regs_for_mode_ok[mode] = true; | |
1169 | } | |
1170 | ||
1171 | /* Init all register sets gathered in HRD. */ | |
1172 | static void | |
1173 | init_hard_regs_data (void) | |
1174 | { | |
1175 | int cur_reg = 0; | |
32e8bb8e | 1176 | int cur_mode = 0; |
e855c69d AB |
1177 | |
1178 | CLEAR_HARD_REG_SET (sel_hrd.regs_ever_used); | |
1179 | for (cur_reg = 0; cur_reg < FIRST_PSEUDO_REGISTER; cur_reg++) | |
1180 | if (df_regs_ever_live_p (cur_reg) || call_used_regs[cur_reg]) | |
1181 | SET_HARD_REG_BIT (sel_hrd.regs_ever_used, cur_reg); | |
b8698a0f L |
1182 | |
1183 | /* Initialize registers that are valid based on mode when this is | |
e855c69d AB |
1184 | really needed. */ |
1185 | for (cur_mode = 0; cur_mode < NUM_MACHINE_MODES; cur_mode++) | |
1186 | sel_hrd.regs_for_mode_ok[cur_mode] = false; | |
b8698a0f | 1187 | |
e855c69d AB |
1188 | /* Mark that all HARD_REGNO_RENAME_OK is not calculated. */ |
1189 | for (cur_reg = 0; cur_reg < FIRST_PSEUDO_REGISTER; cur_reg++) | |
1190 | CLEAR_HARD_REG_SET (sel_hrd.regs_for_rename[cur_reg]); | |
1191 | ||
1192 | #ifdef STACK_REGS | |
1193 | CLEAR_HARD_REG_SET (sel_hrd.stack_regs); | |
1194 | ||
1195 | for (cur_reg = FIRST_STACK_REG; cur_reg <= LAST_STACK_REG; cur_reg++) | |
1196 | SET_HARD_REG_BIT (sel_hrd.stack_regs, cur_reg); | |
1197 | #endif | |
b8698a0f | 1198 | } |
e855c69d | 1199 | |
b8698a0f | 1200 | /* Mark hardware regs in REG_RENAME_P that are not suitable |
e855c69d AB |
1201 | for renaming rhs in INSN due to hardware restrictions (register class, |
1202 | modes compatibility etc). This doesn't affect original insn's dest reg, | |
1203 | if it isn't in USED_REGS. DEF is a definition insn of rhs for which the | |
1204 | destination register is sought. LHS (DEF->ORIG_INSN) may be REG or MEM. | |
1205 | Registers that are in used_regs are always marked in | |
1206 | unavailable_hard_regs as well. */ | |
1207 | ||
1208 | static void | |
1209 | mark_unavailable_hard_regs (def_t def, struct reg_rename *reg_rename_p, | |
1210 | regset used_regs ATTRIBUTE_UNUSED) | |
1211 | { | |
1212 | enum machine_mode mode; | |
1213 | enum reg_class cl = NO_REGS; | |
1214 | rtx orig_dest; | |
1215 | unsigned cur_reg, regno; | |
1216 | hard_reg_set_iterator hrsi; | |
1217 | ||
1218 | gcc_assert (GET_CODE (PATTERN (def->orig_insn)) == SET); | |
1219 | gcc_assert (reg_rename_p); | |
1220 | ||
1221 | orig_dest = SET_DEST (PATTERN (def->orig_insn)); | |
b8698a0f | 1222 | |
e855c69d AB |
1223 | /* We have decided not to rename 'mem = something;' insns, as 'something' |
1224 | is usually a register. */ | |
1225 | if (!REG_P (orig_dest)) | |
1226 | return; | |
1227 | ||
1228 | regno = REGNO (orig_dest); | |
1229 | ||
1230 | /* If before reload, don't try to work with pseudos. */ | |
1231 | if (!reload_completed && !HARD_REGISTER_NUM_P (regno)) | |
1232 | return; | |
1233 | ||
0c94f956 AM |
1234 | if (reload_completed) |
1235 | cl = get_reg_class (def->orig_insn); | |
e855c69d | 1236 | |
0c94f956 AM |
1237 | /* Stop if the original register is one of the fixed_regs, global_regs or |
1238 | frame pointer, or we could not discover its class. */ | |
b8698a0f | 1239 | if (fixed_regs[regno] |
e855c69d | 1240 | || global_regs[regno] |
e3339d0f | 1241 | #if !HARD_FRAME_POINTER_IS_FRAME_POINTER |
0c94f956 | 1242 | || (frame_pointer_needed && regno == HARD_FRAME_POINTER_REGNUM) |
e855c69d | 1243 | #else |
0c94f956 | 1244 | || (frame_pointer_needed && regno == FRAME_POINTER_REGNUM) |
e855c69d | 1245 | #endif |
0c94f956 | 1246 | || (reload_completed && cl == NO_REGS)) |
e855c69d AB |
1247 | { |
1248 | SET_HARD_REG_SET (reg_rename_p->unavailable_hard_regs); | |
1249 | ||
1250 | /* Give a chance for original register, if it isn't in used_regs. */ | |
1251 | if (!def->crosses_call) | |
1252 | CLEAR_HARD_REG_BIT (reg_rename_p->unavailable_hard_regs, regno); | |
1253 | ||
1254 | return; | |
1255 | } | |
1256 | ||
1257 | /* If something allocated on stack in this function, mark frame pointer | |
b8698a0f | 1258 | register unavailable, considering also modes. |
e855c69d AB |
1259 | FIXME: it is enough to do this once per all original defs. */ |
1260 | if (frame_pointer_needed) | |
1261 | { | |
1262 | int i; | |
1263 | ||
1264 | for (i = hard_regno_nregs[FRAME_POINTER_REGNUM][Pmode]; i--;) | |
b8698a0f | 1265 | SET_HARD_REG_BIT (reg_rename_p->unavailable_hard_regs, |
e855c69d AB |
1266 | FRAME_POINTER_REGNUM + i); |
1267 | ||
e3339d0f | 1268 | #if !HARD_FRAME_POINTER_IS_FRAME_POINTER |
e855c69d | 1269 | for (i = hard_regno_nregs[HARD_FRAME_POINTER_REGNUM][Pmode]; i--;) |
b8698a0f | 1270 | SET_HARD_REG_BIT (reg_rename_p->unavailable_hard_regs, |
e855c69d AB |
1271 | HARD_FRAME_POINTER_REGNUM + i); |
1272 | #endif | |
1273 | } | |
1274 | ||
1275 | #ifdef STACK_REGS | |
1276 | /* For the stack registers the presence of FIRST_STACK_REG in USED_REGS | |
1277 | is equivalent to as if all stack regs were in this set. | |
1278 | I.e. no stack register can be renamed, and even if it's an original | |
b8698a0f L |
1279 | register here we make sure it won't be lifted over it's previous def |
1280 | (it's previous def will appear as if it's a FIRST_STACK_REG def. | |
e855c69d AB |
1281 | The HARD_REGNO_RENAME_OK covers other cases in condition below. */ |
1282 | if (IN_RANGE (REGNO (orig_dest), FIRST_STACK_REG, LAST_STACK_REG) | |
b8698a0f L |
1283 | && REGNO_REG_SET_P (used_regs, FIRST_STACK_REG)) |
1284 | IOR_HARD_REG_SET (reg_rename_p->unavailable_hard_regs, | |
e855c69d | 1285 | sel_hrd.stack_regs); |
b8698a0f | 1286 | #endif |
e855c69d | 1287 | |
b8698a0f | 1288 | /* If there's a call on this path, make regs from call_used_reg_set |
e855c69d AB |
1289 | unavailable. */ |
1290 | if (def->crosses_call) | |
b8698a0f | 1291 | IOR_HARD_REG_SET (reg_rename_p->unavailable_hard_regs, |
e855c69d AB |
1292 | call_used_reg_set); |
1293 | ||
b8698a0f | 1294 | /* Stop here before reload: we need FRAME_REGS, STACK_REGS, and crosses_call, |
e855c69d AB |
1295 | but not register classes. */ |
1296 | if (!reload_completed) | |
1297 | return; | |
1298 | ||
b8698a0f | 1299 | /* Leave regs as 'available' only from the current |
e855c69d | 1300 | register class. */ |
e855c69d AB |
1301 | COPY_HARD_REG_SET (reg_rename_p->available_for_renaming, |
1302 | reg_class_contents[cl]); | |
1303 | ||
0c94f956 AM |
1304 | mode = GET_MODE (orig_dest); |
1305 | ||
e855c69d AB |
1306 | /* Leave only registers available for this mode. */ |
1307 | if (!sel_hrd.regs_for_mode_ok[mode]) | |
1308 | init_regs_for_mode (mode); | |
b8698a0f | 1309 | AND_HARD_REG_SET (reg_rename_p->available_for_renaming, |
e855c69d AB |
1310 | sel_hrd.regs_for_mode[mode]); |
1311 | ||
1312 | /* Exclude registers that are partially call clobbered. */ | |
1313 | if (def->crosses_call | |
1314 | && ! HARD_REGNO_CALL_PART_CLOBBERED (regno, mode)) | |
b8698a0f | 1315 | AND_COMPL_HARD_REG_SET (reg_rename_p->available_for_renaming, |
e855c69d AB |
1316 | sel_hrd.regs_for_call_clobbered[mode]); |
1317 | ||
1318 | /* Leave only those that are ok to rename. */ | |
1319 | EXECUTE_IF_SET_IN_HARD_REG_SET (reg_rename_p->available_for_renaming, | |
1320 | 0, cur_reg, hrsi) | |
1321 | { | |
1322 | int nregs; | |
1323 | int i; | |
1324 | ||
1325 | nregs = hard_regno_nregs[cur_reg][mode]; | |
1326 | gcc_assert (nregs > 0); | |
1327 | ||
1328 | for (i = nregs - 1; i >= 0; --i) | |
1329 | if (! sel_hard_regno_rename_ok (regno + i, cur_reg + i)) | |
1330 | break; | |
1331 | ||
b8698a0f L |
1332 | if (i >= 0) |
1333 | CLEAR_HARD_REG_BIT (reg_rename_p->available_for_renaming, | |
e855c69d AB |
1334 | cur_reg); |
1335 | } | |
1336 | ||
b8698a0f | 1337 | AND_COMPL_HARD_REG_SET (reg_rename_p->available_for_renaming, |
e855c69d AB |
1338 | reg_rename_p->unavailable_hard_regs); |
1339 | ||
1340 | /* Regno is always ok from the renaming part of view, but it really | |
1341 | could be in *unavailable_hard_regs already, so set it here instead | |
1342 | of there. */ | |
1343 | SET_HARD_REG_BIT (reg_rename_p->available_for_renaming, regno); | |
1344 | } | |
1345 | ||
1346 | /* reg_rename_tick[REG1] > reg_rename_tick[REG2] if REG1 was chosen as the | |
1347 | best register more recently than REG2. */ | |
1348 | static int reg_rename_tick[FIRST_PSEUDO_REGISTER]; | |
1349 | ||
1350 | /* Indicates the number of times renaming happened before the current one. */ | |
1351 | static int reg_rename_this_tick; | |
1352 | ||
b8698a0f | 1353 | /* Choose the register among free, that is suitable for storing |
e855c69d AB |
1354 | the rhs value. |
1355 | ||
1356 | ORIGINAL_INSNS is the list of insns where the operation (rhs) | |
b8698a0f L |
1357 | originally appears. There could be multiple original operations |
1358 | for single rhs since we moving it up and merging along different | |
e855c69d AB |
1359 | paths. |
1360 | ||
1361 | Some code is adapted from regrename.c (regrename_optimize). | |
1362 | If original register is available, function returns it. | |
1363 | Otherwise it performs the checks, so the new register should | |
1364 | comply with the following: | |
b8698a0f | 1365 | - it should not violate any live ranges (such registers are in |
e855c69d AB |
1366 | REG_RENAME_P->available_for_renaming set); |
1367 | - it should not be in the HARD_REGS_USED regset; | |
1368 | - it should be in the class compatible with original uses; | |
1369 | - it should not be clobbered through reference with different mode; | |
b8698a0f | 1370 | - if we're in the leaf function, then the new register should |
e855c69d AB |
1371 | not be in the LEAF_REGISTERS; |
1372 | - etc. | |
1373 | ||
1374 | If several registers meet the conditions, the register with smallest | |
1375 | tick is returned to achieve more even register allocation. | |
1376 | ||
1377 | If original register seems to be ok, we set *IS_ORIG_REG_P_PTR to true. | |
1378 | ||
1379 | If no register satisfies the above conditions, NULL_RTX is returned. */ | |
1380 | static rtx | |
b8698a0f L |
1381 | choose_best_reg_1 (HARD_REG_SET hard_regs_used, |
1382 | struct reg_rename *reg_rename_p, | |
e855c69d AB |
1383 | def_list_t original_insns, bool *is_orig_reg_p_ptr) |
1384 | { | |
1385 | int best_new_reg; | |
1386 | unsigned cur_reg; | |
1387 | enum machine_mode mode = VOIDmode; | |
1388 | unsigned regno, i, n; | |
1389 | hard_reg_set_iterator hrsi; | |
1390 | def_list_iterator di; | |
1391 | def_t def; | |
1392 | ||
1393 | /* If original register is available, return it. */ | |
1394 | *is_orig_reg_p_ptr = true; | |
1395 | ||
1396 | FOR_EACH_DEF (def, di, original_insns) | |
1397 | { | |
1398 | rtx orig_dest = SET_DEST (PATTERN (def->orig_insn)); | |
1399 | ||
1400 | gcc_assert (REG_P (orig_dest)); | |
1401 | ||
b8698a0f | 1402 | /* Check that all original operations have the same mode. |
e855c69d | 1403 | This is done for the next loop; if we'd return from this |
b8698a0f | 1404 | loop, we'd check only part of them, but in this case |
e855c69d AB |
1405 | it doesn't matter. */ |
1406 | if (mode == VOIDmode) | |
1407 | mode = GET_MODE (orig_dest); | |
1408 | gcc_assert (mode == GET_MODE (orig_dest)); | |
1409 | ||
1410 | regno = REGNO (orig_dest); | |
1411 | for (i = 0, n = hard_regno_nregs[regno][mode]; i < n; i++) | |
1412 | if (TEST_HARD_REG_BIT (hard_regs_used, regno + i)) | |
1413 | break; | |
1414 | ||
1415 | /* All hard registers are available. */ | |
1416 | if (i == n) | |
1417 | { | |
1418 | gcc_assert (mode != VOIDmode); | |
b8698a0f | 1419 | |
e855c69d AB |
1420 | /* Hard registers should not be shared. */ |
1421 | return gen_rtx_REG (mode, regno); | |
1422 | } | |
1423 | } | |
b8698a0f | 1424 | |
e855c69d AB |
1425 | *is_orig_reg_p_ptr = false; |
1426 | best_new_reg = -1; | |
b8698a0f L |
1427 | |
1428 | /* Among all available regs choose the register that was | |
e855c69d AB |
1429 | allocated earliest. */ |
1430 | EXECUTE_IF_SET_IN_HARD_REG_SET (reg_rename_p->available_for_renaming, | |
1431 | 0, cur_reg, hrsi) | |
1432 | if (! TEST_HARD_REG_BIT (hard_regs_used, cur_reg)) | |
1433 | { | |
a9ced68b AM |
1434 | /* Check that all hard regs for mode are available. */ |
1435 | for (i = 1, n = hard_regno_nregs[cur_reg][mode]; i < n; i++) | |
1436 | if (TEST_HARD_REG_BIT (hard_regs_used, cur_reg + i) | |
1437 | || !TEST_HARD_REG_BIT (reg_rename_p->available_for_renaming, | |
1438 | cur_reg + i)) | |
1439 | break; | |
1440 | ||
1441 | if (i < n) | |
1442 | continue; | |
1443 | ||
e855c69d AB |
1444 | /* All hard registers are available. */ |
1445 | if (best_new_reg < 0 | |
1446 | || reg_rename_tick[cur_reg] < reg_rename_tick[best_new_reg]) | |
1447 | { | |
1448 | best_new_reg = cur_reg; | |
b8698a0f | 1449 | |
e855c69d AB |
1450 | /* Return immediately when we know there's no better reg. */ |
1451 | if (! reg_rename_tick[best_new_reg]) | |
1452 | break; | |
1453 | } | |
1454 | } | |
1455 | ||
1456 | if (best_new_reg >= 0) | |
1457 | { | |
1458 | /* Use the check from the above loop. */ | |
1459 | gcc_assert (mode != VOIDmode); | |
1460 | return gen_rtx_REG (mode, best_new_reg); | |
1461 | } | |
1462 | ||
1463 | return NULL_RTX; | |
1464 | } | |
1465 | ||
1466 | /* A wrapper around choose_best_reg_1 () to verify that we make correct | |
1467 | assumptions about available registers in the function. */ | |
1468 | static rtx | |
b8698a0f | 1469 | choose_best_reg (HARD_REG_SET hard_regs_used, struct reg_rename *reg_rename_p, |
e855c69d AB |
1470 | def_list_t original_insns, bool *is_orig_reg_p_ptr) |
1471 | { | |
b8698a0f | 1472 | rtx best_reg = choose_best_reg_1 (hard_regs_used, reg_rename_p, |
e855c69d AB |
1473 | original_insns, is_orig_reg_p_ptr); |
1474 | ||
a9ced68b | 1475 | /* FIXME loop over hard_regno_nregs here. */ |
e855c69d AB |
1476 | gcc_assert (best_reg == NULL_RTX |
1477 | || TEST_HARD_REG_BIT (sel_hrd.regs_ever_used, REGNO (best_reg))); | |
1478 | ||
1479 | return best_reg; | |
1480 | } | |
1481 | ||
b8698a0f | 1482 | /* Choose the pseudo register for storing rhs value. As this is supposed |
e855c69d | 1483 | to work before reload, we return either the original register or make |
b8698a0f L |
1484 | the new one. The parameters are the same that in choose_nest_reg_1 |
1485 | functions, except that USED_REGS may contain pseudos. | |
e855c69d AB |
1486 | If we work with hard regs, check also REG_RENAME_P->UNAVAILABLE_HARD_REGS. |
1487 | ||
b8698a0f L |
1488 | TODO: take into account register pressure while doing this. Up to this |
1489 | moment, this function would never return NULL for pseudos, but we should | |
e855c69d AB |
1490 | not rely on this. */ |
1491 | static rtx | |
b8698a0f L |
1492 | choose_best_pseudo_reg (regset used_regs, |
1493 | struct reg_rename *reg_rename_p, | |
e855c69d AB |
1494 | def_list_t original_insns, bool *is_orig_reg_p_ptr) |
1495 | { | |
1496 | def_list_iterator i; | |
1497 | def_t def; | |
1498 | enum machine_mode mode = VOIDmode; | |
1499 | bool bad_hard_regs = false; | |
b8698a0f | 1500 | |
e855c69d AB |
1501 | /* We should not use this after reload. */ |
1502 | gcc_assert (!reload_completed); | |
1503 | ||
1504 | /* If original register is available, return it. */ | |
1505 | *is_orig_reg_p_ptr = true; | |
1506 | ||
1507 | FOR_EACH_DEF (def, i, original_insns) | |
1508 | { | |
1509 | rtx dest = SET_DEST (PATTERN (def->orig_insn)); | |
1510 | int orig_regno; | |
b8698a0f | 1511 | |
e855c69d | 1512 | gcc_assert (REG_P (dest)); |
b8698a0f | 1513 | |
e855c69d AB |
1514 | /* Check that all original operations have the same mode. */ |
1515 | if (mode == VOIDmode) | |
1516 | mode = GET_MODE (dest); | |
1517 | else | |
1518 | gcc_assert (mode == GET_MODE (dest)); | |
1519 | orig_regno = REGNO (dest); | |
b8698a0f | 1520 | |
e855c69d AB |
1521 | if (!REGNO_REG_SET_P (used_regs, orig_regno)) |
1522 | { | |
1523 | if (orig_regno < FIRST_PSEUDO_REGISTER) | |
1524 | { | |
1525 | gcc_assert (df_regs_ever_live_p (orig_regno)); | |
b8698a0f L |
1526 | |
1527 | /* For hard registers, we have to check hardware imposed | |
e855c69d | 1528 | limitations (frame/stack registers, calls crossed). */ |
b8698a0f | 1529 | if (!TEST_HARD_REG_BIT (reg_rename_p->unavailable_hard_regs, |
e855c69d AB |
1530 | orig_regno)) |
1531 | { | |
b8698a0f L |
1532 | /* Don't let register cross a call if it doesn't already |
1533 | cross one. This condition is written in accordance with | |
e855c69d | 1534 | that in sched-deps.c sched_analyze_reg(). */ |
b8698a0f | 1535 | if (!reg_rename_p->crosses_call |
e855c69d | 1536 | || REG_N_CALLS_CROSSED (orig_regno) > 0) |
b8698a0f | 1537 | return gen_rtx_REG (mode, orig_regno); |
e855c69d | 1538 | } |
b8698a0f | 1539 | |
e855c69d AB |
1540 | bad_hard_regs = true; |
1541 | } | |
1542 | else | |
1543 | return dest; | |
1544 | } | |
1545 | } | |
1546 | ||
1547 | *is_orig_reg_p_ptr = false; | |
b8698a0f | 1548 | |
e855c69d AB |
1549 | /* We had some original hard registers that couldn't be used. |
1550 | Those were likely special. Don't try to create a pseudo. */ | |
1551 | if (bad_hard_regs) | |
1552 | return NULL_RTX; | |
b8698a0f L |
1553 | |
1554 | /* We haven't found a register from original operations. Get a new one. | |
e855c69d AB |
1555 | FIXME: control register pressure somehow. */ |
1556 | { | |
1557 | rtx new_reg = gen_reg_rtx (mode); | |
1558 | ||
1559 | gcc_assert (mode != VOIDmode); | |
1560 | ||
1561 | max_regno = max_reg_num (); | |
1562 | maybe_extend_reg_info_p (); | |
1563 | REG_N_CALLS_CROSSED (REGNO (new_reg)) = reg_rename_p->crosses_call ? 1 : 0; | |
1564 | ||
1565 | return new_reg; | |
1566 | } | |
1567 | } | |
1568 | ||
1569 | /* True when target of EXPR is available due to EXPR_TARGET_AVAILABLE, | |
1570 | USED_REGS and REG_RENAME_P->UNAVAILABLE_HARD_REGS. */ | |
1571 | static void | |
b8698a0f | 1572 | verify_target_availability (expr_t expr, regset used_regs, |
e855c69d AB |
1573 | struct reg_rename *reg_rename_p) |
1574 | { | |
1575 | unsigned n, i, regno; | |
1576 | enum machine_mode mode; | |
1577 | bool target_available, live_available, hard_available; | |
1578 | ||
1579 | if (!REG_P (EXPR_LHS (expr)) || EXPR_TARGET_AVAILABLE (expr) < 0) | |
1580 | return; | |
b8698a0f | 1581 | |
e855c69d AB |
1582 | regno = expr_dest_regno (expr); |
1583 | mode = GET_MODE (EXPR_LHS (expr)); | |
1584 | target_available = EXPR_TARGET_AVAILABLE (expr) == 1; | |
1585 | n = reload_completed ? hard_regno_nregs[regno][mode] : 1; | |
1586 | ||
1587 | live_available = hard_available = true; | |
1588 | for (i = 0; i < n; i++) | |
1589 | { | |
1590 | if (bitmap_bit_p (used_regs, regno + i)) | |
1591 | live_available = false; | |
1592 | if (TEST_HARD_REG_BIT (reg_rename_p->unavailable_hard_regs, regno + i)) | |
1593 | hard_available = false; | |
1594 | } | |
1595 | ||
b8698a0f | 1596 | /* When target is not available, it may be due to hard register |
e855c69d AB |
1597 | restrictions, e.g. crosses calls, so we check hard_available too. */ |
1598 | if (target_available) | |
1599 | gcc_assert (live_available); | |
1600 | else | |
b8698a0f | 1601 | /* Check only if we haven't scheduled something on the previous fence, |
e855c69d AB |
1602 | cause due to MAX_SOFTWARE_LOOKAHEAD_WINDOW_SIZE issues |
1603 | and having more than one fence, we may end having targ_un in a block | |
b8698a0f | 1604 | in which successors target register is actually available. |
e855c69d AB |
1605 | |
1606 | The last condition handles the case when a dependence from a call insn | |
b8698a0f L |
1607 | was created in sched-deps.c for insns with destination registers that |
1608 | never crossed a call before, but do cross one after our code motion. | |
e855c69d | 1609 | |
b8698a0f L |
1610 | FIXME: in the latter case, we just uselessly called find_used_regs, |
1611 | because we can't move this expression with any other register | |
e855c69d | 1612 | as well. */ |
b8698a0f L |
1613 | gcc_assert (scheduled_something_on_previous_fence || !live_available |
1614 | || !hard_available | |
1615 | || (!reload_completed && reg_rename_p->crosses_call | |
e855c69d AB |
1616 | && REG_N_CALLS_CROSSED (regno) == 0)); |
1617 | } | |
1618 | ||
b8698a0f L |
1619 | /* Collect unavailable registers due to liveness for EXPR from BNDS |
1620 | into USED_REGS. Save additional information about available | |
e855c69d AB |
1621 | registers and unavailable due to hardware restriction registers |
1622 | into REG_RENAME_P structure. Save original insns into ORIGINAL_INSNS | |
1623 | list. */ | |
1624 | static void | |
1625 | collect_unavailable_regs_from_bnds (expr_t expr, blist_t bnds, regset used_regs, | |
1626 | struct reg_rename *reg_rename_p, | |
1627 | def_list_t *original_insns) | |
1628 | { | |
1629 | for (; bnds; bnds = BLIST_NEXT (bnds)) | |
1630 | { | |
1631 | bool res; | |
1632 | av_set_t orig_ops = NULL; | |
1633 | bnd_t bnd = BLIST_BND (bnds); | |
1634 | ||
1635 | /* If the chosen best expr doesn't belong to current boundary, | |
1636 | skip it. */ | |
1637 | if (!av_set_is_in_p (BND_AV1 (bnd), EXPR_VINSN (expr))) | |
1638 | continue; | |
1639 | ||
1640 | /* Put in ORIG_OPS all exprs from this boundary that became | |
1641 | RES on top. */ | |
1642 | orig_ops = find_sequential_best_exprs (bnd, expr, false); | |
1643 | ||
1644 | /* Compute used regs and OR it into the USED_REGS. */ | |
1645 | res = find_used_regs (BND_TO (bnd), orig_ops, used_regs, | |
1646 | reg_rename_p, original_insns); | |
1647 | ||
1648 | /* FIXME: the assert is true until we'd have several boundaries. */ | |
1649 | gcc_assert (res); | |
1650 | av_set_clear (&orig_ops); | |
1651 | } | |
1652 | } | |
1653 | ||
1654 | /* Return TRUE if it is possible to replace LHSes of ORIG_INSNS with BEST_REG. | |
1655 | If BEST_REG is valid, replace LHS of EXPR with it. */ | |
1656 | static bool | |
1657 | try_replace_dest_reg (ilist_t orig_insns, rtx best_reg, expr_t expr) | |
1658 | { | |
e855c69d AB |
1659 | /* Try whether we'll be able to generate the insn |
1660 | 'dest := best_reg' at the place of the original operation. */ | |
1661 | for (; orig_insns; orig_insns = ILIST_NEXT (orig_insns)) | |
1662 | { | |
1663 | insn_t orig_insn = DEF_LIST_DEF (orig_insns)->orig_insn; | |
1664 | ||
1665 | gcc_assert (EXPR_SEPARABLE_P (INSN_EXPR (orig_insn))); | |
1666 | ||
0666ff4e AB |
1667 | if (REGNO (best_reg) != REGNO (INSN_LHS (orig_insn)) |
1668 | && (! replace_src_with_reg_ok_p (orig_insn, best_reg) | |
1669 | || ! replace_dest_with_reg_ok_p (orig_insn, best_reg))) | |
e855c69d AB |
1670 | return false; |
1671 | } | |
1672 | ||
1673 | /* Make sure that EXPR has the right destination | |
1674 | register. */ | |
0666ff4e AB |
1675 | if (expr_dest_regno (expr) != REGNO (best_reg)) |
1676 | replace_dest_with_reg_in_expr (expr, best_reg); | |
1677 | else | |
1678 | EXPR_TARGET_AVAILABLE (expr) = 1; | |
1679 | ||
e855c69d AB |
1680 | return true; |
1681 | } | |
1682 | ||
b8698a0f L |
1683 | /* Select and assign best register to EXPR searching from BNDS. |
1684 | Set *IS_ORIG_REG_P to TRUE if original register was selected. | |
e855c69d AB |
1685 | Return FALSE if no register can be chosen, which could happen when: |
1686 | * EXPR_SEPARABLE_P is true but we were unable to find suitable register; | |
1687 | * EXPR_SEPARABLE_P is false but the insn sets/clobbers one of the registers | |
1688 | that are used on the moving path. */ | |
1689 | static bool | |
1690 | find_best_reg_for_expr (expr_t expr, blist_t bnds, bool *is_orig_reg_p) | |
1691 | { | |
1692 | static struct reg_rename reg_rename_data; | |
1693 | ||
1694 | regset used_regs; | |
1695 | def_list_t original_insns = NULL; | |
1696 | bool reg_ok; | |
1697 | ||
1698 | *is_orig_reg_p = false; | |
1699 | ||
1700 | /* Don't bother to do anything if this insn doesn't set any registers. */ | |
1701 | if (bitmap_empty_p (VINSN_REG_SETS (EXPR_VINSN (expr))) | |
1702 | && bitmap_empty_p (VINSN_REG_CLOBBERS (EXPR_VINSN (expr)))) | |
1703 | return true; | |
1704 | ||
1705 | used_regs = get_clear_regset_from_pool (); | |
1706 | CLEAR_HARD_REG_SET (reg_rename_data.unavailable_hard_regs); | |
1707 | ||
1708 | collect_unavailable_regs_from_bnds (expr, bnds, used_regs, ®_rename_data, | |
1709 | &original_insns); | |
1710 | ||
1711 | #ifdef ENABLE_CHECKING | |
1712 | /* If after reload, make sure we're working with hard regs here. */ | |
b8698a0f | 1713 | if (reload_completed) |
e855c69d AB |
1714 | { |
1715 | reg_set_iterator rsi; | |
1716 | unsigned i; | |
b8698a0f | 1717 | |
e855c69d AB |
1718 | EXECUTE_IF_SET_IN_REG_SET (used_regs, FIRST_PSEUDO_REGISTER, i, rsi) |
1719 | gcc_unreachable (); | |
1720 | } | |
1721 | #endif | |
1722 | ||
1723 | if (EXPR_SEPARABLE_P (expr)) | |
1724 | { | |
1725 | rtx best_reg = NULL_RTX; | |
1726 | /* Check that we have computed availability of a target register | |
1727 | correctly. */ | |
1728 | verify_target_availability (expr, used_regs, ®_rename_data); | |
1729 | ||
1730 | /* Turn everything in hard regs after reload. */ | |
1731 | if (reload_completed) | |
1732 | { | |
1733 | HARD_REG_SET hard_regs_used; | |
1734 | REG_SET_TO_HARD_REG_SET (hard_regs_used, used_regs); | |
1735 | ||
1736 | /* Join hard registers unavailable due to register class | |
1737 | restrictions and live range intersection. */ | |
1738 | IOR_HARD_REG_SET (hard_regs_used, | |
1739 | reg_rename_data.unavailable_hard_regs); | |
1740 | ||
1741 | best_reg = choose_best_reg (hard_regs_used, ®_rename_data, | |
1742 | original_insns, is_orig_reg_p); | |
1743 | } | |
1744 | else | |
1745 | best_reg = choose_best_pseudo_reg (used_regs, ®_rename_data, | |
1746 | original_insns, is_orig_reg_p); | |
1747 | ||
1748 | if (!best_reg) | |
1749 | reg_ok = false; | |
1750 | else if (*is_orig_reg_p) | |
1751 | { | |
1752 | /* In case of unification BEST_REG may be different from EXPR's LHS | |
1753 | when EXPR's LHS is unavailable, and there is another LHS among | |
1754 | ORIGINAL_INSNS. */ | |
1755 | reg_ok = try_replace_dest_reg (original_insns, best_reg, expr); | |
1756 | } | |
1757 | else | |
1758 | { | |
1759 | /* Forbid renaming of low-cost insns. */ | |
1760 | if (sel_vinsn_cost (EXPR_VINSN (expr)) < 2) | |
1761 | reg_ok = false; | |
1762 | else | |
1763 | reg_ok = try_replace_dest_reg (original_insns, best_reg, expr); | |
1764 | } | |
1765 | } | |
1766 | else | |
1767 | { | |
1768 | /* If !EXPR_SCHEDULE_AS_RHS (EXPR), just make sure INSN doesn't set | |
1769 | any of the HARD_REGS_USED set. */ | |
1770 | if (vinsn_writes_one_of_regs_p (EXPR_VINSN (expr), used_regs, | |
1771 | reg_rename_data.unavailable_hard_regs)) | |
1772 | { | |
1773 | reg_ok = false; | |
1774 | gcc_assert (EXPR_TARGET_AVAILABLE (expr) <= 0); | |
1775 | } | |
1776 | else | |
1777 | { | |
1778 | reg_ok = true; | |
1779 | gcc_assert (EXPR_TARGET_AVAILABLE (expr) != 0); | |
1780 | } | |
1781 | } | |
1782 | ||
1783 | ilist_clear (&original_insns); | |
1784 | return_regset_to_pool (used_regs); | |
1785 | ||
1786 | return reg_ok; | |
1787 | } | |
1788 | \f | |
1789 | ||
1790 | /* Return true if dependence described by DS can be overcomed. */ | |
1791 | static bool | |
1792 | can_speculate_dep_p (ds_t ds) | |
1793 | { | |
1794 | if (spec_info == NULL) | |
1795 | return false; | |
1796 | ||
1797 | /* Leave only speculative data. */ | |
1798 | ds &= SPECULATIVE; | |
1799 | ||
1800 | if (ds == 0) | |
1801 | return false; | |
1802 | ||
1803 | { | |
1804 | /* FIXME: make sched-deps.c produce only those non-hard dependencies, | |
1805 | that we can overcome. */ | |
1806 | ds_t spec_mask = spec_info->mask; | |
1807 | ||
1808 | if ((ds & spec_mask) != ds) | |
1809 | return false; | |
1810 | } | |
1811 | ||
1812 | if (ds_weak (ds) < spec_info->data_weakness_cutoff) | |
1813 | return false; | |
1814 | ||
1815 | return true; | |
1816 | } | |
1817 | ||
1818 | /* Get a speculation check instruction. | |
1819 | C_EXPR is a speculative expression, | |
1820 | CHECK_DS describes speculations that should be checked, | |
1821 | ORIG_INSN is the original non-speculative insn in the stream. */ | |
1822 | static insn_t | |
1823 | create_speculation_check (expr_t c_expr, ds_t check_ds, insn_t orig_insn) | |
1824 | { | |
1825 | rtx check_pattern; | |
1826 | rtx insn_rtx; | |
1827 | insn_t insn; | |
1828 | basic_block recovery_block; | |
1829 | rtx label; | |
1830 | ||
1831 | /* Create a recovery block if target is going to emit branchy check, or if | |
1832 | ORIG_INSN was speculative already. */ | |
388092d5 | 1833 | if (targetm.sched.needs_block_p (check_ds) |
e855c69d AB |
1834 | || EXPR_SPEC_DONE_DS (INSN_EXPR (orig_insn)) != 0) |
1835 | { | |
1836 | recovery_block = sel_create_recovery_block (orig_insn); | |
1837 | label = BB_HEAD (recovery_block); | |
1838 | } | |
1839 | else | |
1840 | { | |
1841 | recovery_block = NULL; | |
1842 | label = NULL_RTX; | |
1843 | } | |
1844 | ||
1845 | /* Get pattern of the check. */ | |
1846 | check_pattern = targetm.sched.gen_spec_check (EXPR_INSN_RTX (c_expr), label, | |
1847 | check_ds); | |
1848 | ||
1849 | gcc_assert (check_pattern != NULL); | |
1850 | ||
1851 | /* Emit check. */ | |
1852 | insn_rtx = create_insn_rtx_from_pattern (check_pattern, label); | |
1853 | ||
1854 | insn = sel_gen_insn_from_rtx_after (insn_rtx, INSN_EXPR (orig_insn), | |
1855 | INSN_SEQNO (orig_insn), orig_insn); | |
1856 | ||
1857 | /* Make check to be non-speculative. */ | |
1858 | EXPR_SPEC_DONE_DS (INSN_EXPR (insn)) = 0; | |
1859 | INSN_SPEC_CHECKED_DS (insn) = check_ds; | |
1860 | ||
1861 | /* Decrease priority of check by difference of load/check instruction | |
1862 | latencies. */ | |
1863 | EXPR_PRIORITY (INSN_EXPR (insn)) -= (sel_vinsn_cost (INSN_VINSN (orig_insn)) | |
1864 | - sel_vinsn_cost (INSN_VINSN (insn))); | |
1865 | ||
1866 | /* Emit copy of original insn (though with replaced target register, | |
1867 | if needed) to the recovery block. */ | |
1868 | if (recovery_block != NULL) | |
1869 | { | |
1870 | rtx twin_rtx; | |
e855c69d AB |
1871 | |
1872 | twin_rtx = copy_rtx (PATTERN (EXPR_INSN_RTX (c_expr))); | |
1873 | twin_rtx = create_insn_rtx_from_pattern (twin_rtx, NULL_RTX); | |
1124098b JJ |
1874 | sel_gen_recovery_insn_from_rtx_after (twin_rtx, |
1875 | INSN_EXPR (orig_insn), | |
1876 | INSN_SEQNO (insn), | |
1877 | bb_note (recovery_block)); | |
e855c69d AB |
1878 | } |
1879 | ||
1880 | /* If we've generated a data speculation check, make sure | |
1881 | that all the bookkeeping instruction we'll create during | |
1882 | this move_op () will allocate an ALAT entry so that the | |
1883 | check won't fail. | |
1884 | In case of control speculation we must convert C_EXPR to control | |
1885 | speculative mode, because failing to do so will bring us an exception | |
1886 | thrown by the non-control-speculative load. */ | |
1887 | check_ds = ds_get_max_dep_weak (check_ds); | |
1888 | speculate_expr (c_expr, check_ds); | |
b8698a0f | 1889 | |
e855c69d AB |
1890 | return insn; |
1891 | } | |
1892 | ||
1893 | /* True when INSN is a "regN = regN" copy. */ | |
1894 | static bool | |
1895 | identical_copy_p (rtx insn) | |
1896 | { | |
1897 | rtx lhs, rhs, pat; | |
1898 | ||
1899 | pat = PATTERN (insn); | |
1900 | ||
1901 | if (GET_CODE (pat) != SET) | |
1902 | return false; | |
1903 | ||
1904 | lhs = SET_DEST (pat); | |
1905 | if (!REG_P (lhs)) | |
1906 | return false; | |
1907 | ||
1908 | rhs = SET_SRC (pat); | |
1909 | if (!REG_P (rhs)) | |
1910 | return false; | |
1911 | ||
1912 | return REGNO (lhs) == REGNO (rhs); | |
1913 | } | |
1914 | ||
b8698a0f | 1915 | /* Undo all transformations on *AV_PTR that were done when |
e855c69d AB |
1916 | moving through INSN. */ |
1917 | static void | |
1918 | undo_transformations (av_set_t *av_ptr, rtx insn) | |
1919 | { | |
1920 | av_set_iterator av_iter; | |
1921 | expr_t expr; | |
1922 | av_set_t new_set = NULL; | |
1923 | ||
b8698a0f | 1924 | /* First, kill any EXPR that uses registers set by an insn. This is |
e855c69d AB |
1925 | required for correctness. */ |
1926 | FOR_EACH_EXPR_1 (expr, av_iter, av_ptr) | |
1927 | if (!sched_insns_conditions_mutex_p (insn, EXPR_INSN_RTX (expr)) | |
b8698a0f | 1928 | && bitmap_intersect_p (INSN_REG_SETS (insn), |
e855c69d AB |
1929 | VINSN_REG_USES (EXPR_VINSN (expr))) |
1930 | /* When an insn looks like 'r1 = r1', we could substitute through | |
1931 | it, but the above condition will still hold. This happened with | |
b8698a0f | 1932 | gcc.c-torture/execute/961125-1.c. */ |
e855c69d AB |
1933 | && !identical_copy_p (insn)) |
1934 | { | |
1935 | if (sched_verbose >= 6) | |
b8698a0f | 1936 | sel_print ("Expr %d removed due to use/set conflict\n", |
e855c69d AB |
1937 | INSN_UID (EXPR_INSN_RTX (expr))); |
1938 | av_set_iter_remove (&av_iter); | |
1939 | } | |
1940 | ||
1941 | /* Undo transformations looking at the history vector. */ | |
1942 | FOR_EACH_EXPR (expr, av_iter, *av_ptr) | |
1943 | { | |
1944 | int index = find_in_history_vect (EXPR_HISTORY_OF_CHANGES (expr), | |
1945 | insn, EXPR_VINSN (expr), true); | |
1946 | ||
1947 | if (index >= 0) | |
1948 | { | |
1949 | expr_history_def *phist; | |
1950 | ||
b8698a0f | 1951 | phist = VEC_index (expr_history_def, |
e855c69d AB |
1952 | EXPR_HISTORY_OF_CHANGES (expr), |
1953 | index); | |
1954 | ||
b8698a0f | 1955 | switch (phist->type) |
e855c69d AB |
1956 | { |
1957 | case TRANS_SPECULATION: | |
1958 | { | |
1959 | ds_t old_ds, new_ds; | |
b8698a0f | 1960 | |
e855c69d | 1961 | /* Compute the difference between old and new speculative |
b8698a0f | 1962 | statuses: that's what we need to check. |
e855c69d AB |
1963 | Earlier we used to assert that the status will really |
1964 | change. This no longer works because only the probability | |
1965 | bits in the status may have changed during compute_av_set, | |
b8698a0f L |
1966 | and in the case of merging different probabilities of the |
1967 | same speculative status along different paths we do not | |
e855c69d AB |
1968 | record this in the history vector. */ |
1969 | old_ds = phist->spec_ds; | |
1970 | new_ds = EXPR_SPEC_DONE_DS (expr); | |
1971 | ||
1972 | old_ds &= SPECULATIVE; | |
1973 | new_ds &= SPECULATIVE; | |
1974 | new_ds &= ~old_ds; | |
b8698a0f | 1975 | |
e855c69d AB |
1976 | EXPR_SPEC_TO_CHECK_DS (expr) |= new_ds; |
1977 | break; | |
1978 | } | |
1979 | case TRANS_SUBSTITUTION: | |
1980 | { | |
1981 | expr_def _tmp_expr, *tmp_expr = &_tmp_expr; | |
1982 | vinsn_t new_vi; | |
1983 | bool add = true; | |
b8698a0f | 1984 | |
e855c69d | 1985 | new_vi = phist->old_expr_vinsn; |
b8698a0f L |
1986 | |
1987 | gcc_assert (VINSN_SEPARABLE_P (new_vi) | |
e855c69d AB |
1988 | == EXPR_SEPARABLE_P (expr)); |
1989 | copy_expr (tmp_expr, expr); | |
1990 | ||
b8698a0f | 1991 | if (vinsn_equal_p (phist->new_expr_vinsn, |
e855c69d AB |
1992 | EXPR_VINSN (tmp_expr))) |
1993 | change_vinsn_in_expr (tmp_expr, new_vi); | |
1994 | else | |
1995 | /* This happens when we're unsubstituting on a bookkeeping | |
1996 | copy, which was in turn substituted. The history is wrong | |
1997 | in this case. Do it the hard way. */ | |
1998 | add = substitute_reg_in_expr (tmp_expr, insn, true); | |
1999 | if (add) | |
2000 | av_set_add (&new_set, tmp_expr); | |
2001 | clear_expr (tmp_expr); | |
2002 | break; | |
2003 | } | |
2004 | default: | |
2005 | gcc_unreachable (); | |
2006 | } | |
2007 | } | |
b8698a0f | 2008 | |
e855c69d AB |
2009 | } |
2010 | ||
2011 | av_set_union_and_clear (av_ptr, &new_set, NULL); | |
2012 | } | |
2013 | \f | |
2014 | ||
2015 | /* Moveup_* helpers for code motion and computing av sets. */ | |
2016 | ||
2017 | /* Propagates EXPR inside an insn group through THROUGH_INSN. | |
b8698a0f | 2018 | The difference from the below function is that only substitution is |
e855c69d AB |
2019 | performed. */ |
2020 | static enum MOVEUP_EXPR_CODE | |
2021 | moveup_expr_inside_insn_group (expr_t expr, insn_t through_insn) | |
2022 | { | |
2023 | vinsn_t vi = EXPR_VINSN (expr); | |
2024 | ds_t *has_dep_p; | |
2025 | ds_t full_ds; | |
2026 | ||
2027 | /* Do this only inside insn group. */ | |
2028 | gcc_assert (INSN_SCHED_CYCLE (through_insn) > 0); | |
2029 | ||
2030 | full_ds = has_dependence_p (expr, through_insn, &has_dep_p); | |
2031 | if (full_ds == 0) | |
2032 | return MOVEUP_EXPR_SAME; | |
2033 | ||
2034 | /* Substitution is the possible choice in this case. */ | |
2035 | if (has_dep_p[DEPS_IN_RHS]) | |
2036 | { | |
2037 | /* Can't substitute UNIQUE VINSNs. */ | |
2038 | gcc_assert (!VINSN_UNIQUE_P (vi)); | |
b8698a0f L |
2039 | |
2040 | if (can_substitute_through_p (through_insn, | |
e855c69d AB |
2041 | has_dep_p[DEPS_IN_RHS]) |
2042 | && substitute_reg_in_expr (expr, through_insn, false)) | |
2043 | { | |
2044 | EXPR_WAS_SUBSTITUTED (expr) = true; | |
2045 | return MOVEUP_EXPR_CHANGED; | |
2046 | } | |
2047 | ||
2048 | /* Don't care about this, as even true dependencies may be allowed | |
2049 | in an insn group. */ | |
2050 | return MOVEUP_EXPR_SAME; | |
2051 | } | |
2052 | ||
2053 | /* This can catch output dependencies in COND_EXECs. */ | |
2054 | if (has_dep_p[DEPS_IN_INSN]) | |
2055 | return MOVEUP_EXPR_NULL; | |
b8698a0f | 2056 | |
e855c69d AB |
2057 | /* This is either an output or an anti dependence, which usually have |
2058 | a zero latency. Allow this here, if we'd be wrong, tick_check_p | |
2059 | will fix this. */ | |
2060 | gcc_assert (has_dep_p[DEPS_IN_LHS]); | |
2061 | return MOVEUP_EXPR_AS_RHS; | |
2062 | } | |
2063 | ||
2064 | /* True when a trapping EXPR cannot be moved through THROUGH_INSN. */ | |
2065 | #define CANT_MOVE_TRAPPING(expr, through_insn) \ | |
2066 | (VINSN_MAY_TRAP_P (EXPR_VINSN (expr)) \ | |
2067 | && !sel_insn_has_single_succ_p ((through_insn), SUCCS_ALL) \ | |
2068 | && !sel_insn_is_speculation_check (through_insn)) | |
2069 | ||
2070 | /* True when a conflict on a target register was found during moveup_expr. */ | |
2071 | static bool was_target_conflict = false; | |
2072 | ||
b5b8b0ac AO |
2073 | /* Return true when moving a debug INSN across THROUGH_INSN will |
2074 | create a bookkeeping block. We don't want to create such blocks, | |
2075 | for they would cause codegen differences between compilations with | |
2076 | and without debug info. */ | |
2077 | ||
2078 | static bool | |
2079 | moving_insn_creates_bookkeeping_block_p (insn_t insn, | |
2080 | insn_t through_insn) | |
2081 | { | |
2082 | basic_block bbi, bbt; | |
2083 | edge e1, e2; | |
2084 | edge_iterator ei1, ei2; | |
2085 | ||
2086 | if (!bookkeeping_can_be_created_if_moved_through_p (through_insn)) | |
2087 | { | |
2088 | if (sched_verbose >= 9) | |
2089 | sel_print ("no bookkeeping required: "); | |
2090 | return FALSE; | |
2091 | } | |
2092 | ||
2093 | bbi = BLOCK_FOR_INSN (insn); | |
2094 | ||
2095 | if (EDGE_COUNT (bbi->preds) == 1) | |
2096 | { | |
2097 | if (sched_verbose >= 9) | |
2098 | sel_print ("only one pred edge: "); | |
2099 | return TRUE; | |
2100 | } | |
2101 | ||
2102 | bbt = BLOCK_FOR_INSN (through_insn); | |
2103 | ||
2104 | FOR_EACH_EDGE (e1, ei1, bbt->succs) | |
2105 | { | |
2106 | FOR_EACH_EDGE (e2, ei2, bbi->preds) | |
2107 | { | |
2108 | if (find_block_for_bookkeeping (e1, e2, TRUE)) | |
2109 | { | |
2110 | if (sched_verbose >= 9) | |
2111 | sel_print ("found existing block: "); | |
2112 | return FALSE; | |
2113 | } | |
2114 | } | |
2115 | } | |
2116 | ||
2117 | if (sched_verbose >= 9) | |
2118 | sel_print ("would create bookkeeping block: "); | |
2119 | ||
2120 | return TRUE; | |
2121 | } | |
2122 | ||
e855c69d | 2123 | /* Modifies EXPR so it can be moved through the THROUGH_INSN, |
b8698a0f L |
2124 | performing necessary transformations. Record the type of transformation |
2125 | made in PTRANS_TYPE, when it is not NULL. When INSIDE_INSN_GROUP, | |
e855c69d | 2126 | permit all dependencies except true ones, and try to remove those |
b8698a0f L |
2127 | too via forward substitution. All cases when a non-eliminable |
2128 | non-zero cost dependency exists inside an insn group will be fixed | |
e855c69d AB |
2129 | in tick_check_p instead. */ |
2130 | static enum MOVEUP_EXPR_CODE | |
2131 | moveup_expr (expr_t expr, insn_t through_insn, bool inside_insn_group, | |
2132 | enum local_trans_type *ptrans_type) | |
2133 | { | |
2134 | vinsn_t vi = EXPR_VINSN (expr); | |
2135 | insn_t insn = VINSN_INSN_RTX (vi); | |
2136 | bool was_changed = false; | |
2137 | bool as_rhs = false; | |
2138 | ds_t *has_dep_p; | |
2139 | ds_t full_ds; | |
2140 | ||
2141 | /* When inside_insn_group, delegate to the helper. */ | |
2142 | if (inside_insn_group) | |
2143 | return moveup_expr_inside_insn_group (expr, through_insn); | |
2144 | ||
2145 | /* Deal with unique insns and control dependencies. */ | |
2146 | if (VINSN_UNIQUE_P (vi)) | |
2147 | { | |
2148 | /* We can move jumps without side-effects or jumps that are | |
2149 | mutually exclusive with instruction THROUGH_INSN (all in cases | |
2150 | dependencies allow to do so and jump is not speculative). */ | |
2151 | if (control_flow_insn_p (insn)) | |
2152 | { | |
2153 | basic_block fallthru_bb; | |
2154 | ||
b8698a0f | 2155 | /* Do not move checks and do not move jumps through other |
e855c69d AB |
2156 | jumps. */ |
2157 | if (control_flow_insn_p (through_insn) | |
2158 | || sel_insn_is_speculation_check (insn)) | |
2159 | return MOVEUP_EXPR_NULL; | |
2160 | ||
2161 | /* Don't move jumps through CFG joins. */ | |
2162 | if (bookkeeping_can_be_created_if_moved_through_p (through_insn)) | |
2163 | return MOVEUP_EXPR_NULL; | |
2164 | ||
b8698a0f | 2165 | /* The jump should have a clear fallthru block, and |
e855c69d AB |
2166 | this block should be in the current region. */ |
2167 | if ((fallthru_bb = fallthru_bb_of_jump (insn)) == NULL | |
2168 | || ! in_current_region_p (fallthru_bb)) | |
2169 | return MOVEUP_EXPR_NULL; | |
b8698a0f L |
2170 | |
2171 | /* And it should be mutually exclusive with through_insn, or | |
e855c69d AB |
2172 | be an unconditional jump. */ |
2173 | if (! any_uncondjump_p (insn) | |
b5b8b0ac AO |
2174 | && ! sched_insns_conditions_mutex_p (insn, through_insn) |
2175 | && ! DEBUG_INSN_P (through_insn)) | |
e855c69d AB |
2176 | return MOVEUP_EXPR_NULL; |
2177 | } | |
2178 | ||
2179 | /* Don't move what we can't move. */ | |
2180 | if (EXPR_CANT_MOVE (expr) | |
2181 | && BLOCK_FOR_INSN (through_insn) != BLOCK_FOR_INSN (insn)) | |
2182 | return MOVEUP_EXPR_NULL; | |
2183 | ||
2184 | /* Don't move SCHED_GROUP instruction through anything. | |
2185 | If we don't force this, then it will be possible to start | |
2186 | scheduling a sched_group before all its dependencies are | |
2187 | resolved. | |
2188 | ??? Haifa deals with this issue by delaying the SCHED_GROUP | |
2189 | as late as possible through rank_for_schedule. */ | |
2190 | if (SCHED_GROUP_P (insn)) | |
2191 | return MOVEUP_EXPR_NULL; | |
2192 | } | |
2193 | else | |
2194 | gcc_assert (!control_flow_insn_p (insn)); | |
2195 | ||
b5b8b0ac AO |
2196 | /* Don't move debug insns if this would require bookkeeping. */ |
2197 | if (DEBUG_INSN_P (insn) | |
2198 | && BLOCK_FOR_INSN (through_insn) != BLOCK_FOR_INSN (insn) | |
2199 | && moving_insn_creates_bookkeeping_block_p (insn, through_insn)) | |
2200 | return MOVEUP_EXPR_NULL; | |
2201 | ||
e855c69d AB |
2202 | /* Deal with data dependencies. */ |
2203 | was_target_conflict = false; | |
2204 | full_ds = has_dependence_p (expr, through_insn, &has_dep_p); | |
2205 | if (full_ds == 0) | |
2206 | { | |
2207 | if (!CANT_MOVE_TRAPPING (expr, through_insn)) | |
2208 | return MOVEUP_EXPR_SAME; | |
2209 | } | |
2210 | else | |
2211 | { | |
b8698a0f | 2212 | /* We can move UNIQUE insn up only as a whole and unchanged, |
e855c69d AB |
2213 | so it shouldn't have any dependencies. */ |
2214 | if (VINSN_UNIQUE_P (vi)) | |
2215 | return MOVEUP_EXPR_NULL; | |
2216 | } | |
2217 | ||
2218 | if (full_ds != 0 && can_speculate_dep_p (full_ds)) | |
2219 | { | |
2220 | int res; | |
2221 | ||
2222 | res = speculate_expr (expr, full_ds); | |
2223 | if (res >= 0) | |
2224 | { | |
2225 | /* Speculation was successful. */ | |
2226 | full_ds = 0; | |
2227 | was_changed = (res > 0); | |
2228 | if (res == 2) | |
2229 | was_target_conflict = true; | |
2230 | if (ptrans_type) | |
2231 | *ptrans_type = TRANS_SPECULATION; | |
2232 | sel_clear_has_dependence (); | |
2233 | } | |
2234 | } | |
2235 | ||
2236 | if (has_dep_p[DEPS_IN_INSN]) | |
2237 | /* We have some dependency that cannot be discarded. */ | |
2238 | return MOVEUP_EXPR_NULL; | |
2239 | ||
2240 | if (has_dep_p[DEPS_IN_LHS]) | |
b8698a0f | 2241 | { |
e855c69d | 2242 | /* Only separable insns can be moved up with the new register. |
b8698a0f | 2243 | Anyways, we should mark that the original register is |
e855c69d AB |
2244 | unavailable. */ |
2245 | if (!enable_schedule_as_rhs_p || !EXPR_SEPARABLE_P (expr)) | |
2246 | return MOVEUP_EXPR_NULL; | |
2247 | ||
2248 | EXPR_TARGET_AVAILABLE (expr) = false; | |
2249 | was_target_conflict = true; | |
2250 | as_rhs = true; | |
2251 | } | |
2252 | ||
2253 | /* At this point we have either separable insns, that will be lifted | |
2254 | up only as RHSes, or non-separable insns with no dependency in lhs. | |
2255 | If dependency is in RHS, then try to perform substitution and move up | |
2256 | substituted RHS: | |
2257 | ||
2258 | Ex. 1: Ex.2 | |
2259 | y = x; y = x; | |
2260 | z = y*2; y = y*2; | |
2261 | ||
b8698a0f | 2262 | In Ex.1 y*2 can be substituted for x*2 and the whole operation can be |
e855c69d AB |
2263 | moved above y=x assignment as z=x*2. |
2264 | ||
b8698a0f | 2265 | In Ex.2 y*2 also can be substituted for x*2, but only the right hand |
e855c69d AB |
2266 | side can be moved because of the output dependency. The operation was |
2267 | cropped to its rhs above. */ | |
2268 | if (has_dep_p[DEPS_IN_RHS]) | |
2269 | { | |
2270 | ds_t *rhs_dsp = &has_dep_p[DEPS_IN_RHS]; | |
2271 | ||
2272 | /* Can't substitute UNIQUE VINSNs. */ | |
2273 | gcc_assert (!VINSN_UNIQUE_P (vi)); | |
2274 | ||
2275 | if (can_speculate_dep_p (*rhs_dsp)) | |
2276 | { | |
2277 | int res; | |
b8698a0f | 2278 | |
e855c69d AB |
2279 | res = speculate_expr (expr, *rhs_dsp); |
2280 | if (res >= 0) | |
2281 | { | |
2282 | /* Speculation was successful. */ | |
2283 | *rhs_dsp = 0; | |
2284 | was_changed = (res > 0); | |
2285 | if (res == 2) | |
2286 | was_target_conflict = true; | |
2287 | if (ptrans_type) | |
2288 | *ptrans_type = TRANS_SPECULATION; | |
2289 | } | |
2290 | else | |
2291 | return MOVEUP_EXPR_NULL; | |
2292 | } | |
2293 | else if (can_substitute_through_p (through_insn, | |
2294 | *rhs_dsp) | |
2295 | && substitute_reg_in_expr (expr, through_insn, false)) | |
2296 | { | |
2297 | /* ??? We cannot perform substitution AND speculation on the same | |
2298 | insn. */ | |
2299 | gcc_assert (!was_changed); | |
2300 | was_changed = true; | |
2301 | if (ptrans_type) | |
2302 | *ptrans_type = TRANS_SUBSTITUTION; | |
2303 | EXPR_WAS_SUBSTITUTED (expr) = true; | |
2304 | } | |
2305 | else | |
2306 | return MOVEUP_EXPR_NULL; | |
2307 | } | |
2308 | ||
2309 | /* Don't move trapping insns through jumps. | |
2310 | This check should be at the end to give a chance to control speculation | |
2311 | to perform its duties. */ | |
2312 | if (CANT_MOVE_TRAPPING (expr, through_insn)) | |
2313 | return MOVEUP_EXPR_NULL; | |
2314 | ||
b8698a0f L |
2315 | return (was_changed |
2316 | ? MOVEUP_EXPR_CHANGED | |
2317 | : (as_rhs | |
e855c69d AB |
2318 | ? MOVEUP_EXPR_AS_RHS |
2319 | : MOVEUP_EXPR_SAME)); | |
2320 | } | |
2321 | ||
b8698a0f | 2322 | /* Try to look at bitmap caches for EXPR and INSN pair, return true |
e855c69d AB |
2323 | if successful. When INSIDE_INSN_GROUP, also try ignore dependencies |
2324 | that can exist within a parallel group. Write to RES the resulting | |
2325 | code for moveup_expr. */ | |
b8698a0f | 2326 | static bool |
e855c69d AB |
2327 | try_bitmap_cache (expr_t expr, insn_t insn, |
2328 | bool inside_insn_group, | |
2329 | enum MOVEUP_EXPR_CODE *res) | |
2330 | { | |
2331 | int expr_uid = INSN_UID (EXPR_INSN_RTX (expr)); | |
b8698a0f | 2332 | |
e855c69d AB |
2333 | /* First check whether we've analyzed this situation already. */ |
2334 | if (bitmap_bit_p (INSN_ANALYZED_DEPS (insn), expr_uid)) | |
2335 | { | |
2336 | if (bitmap_bit_p (INSN_FOUND_DEPS (insn), expr_uid)) | |
2337 | { | |
2338 | if (sched_verbose >= 6) | |
2339 | sel_print ("removed (cached)\n"); | |
2340 | *res = MOVEUP_EXPR_NULL; | |
2341 | return true; | |
2342 | } | |
2343 | else | |
2344 | { | |
2345 | if (sched_verbose >= 6) | |
2346 | sel_print ("unchanged (cached)\n"); | |
2347 | *res = MOVEUP_EXPR_SAME; | |
2348 | return true; | |
2349 | } | |
2350 | } | |
2351 | else if (bitmap_bit_p (INSN_FOUND_DEPS (insn), expr_uid)) | |
2352 | { | |
2353 | if (inside_insn_group) | |
2354 | { | |
2355 | if (sched_verbose >= 6) | |
2356 | sel_print ("unchanged (as RHS, cached, inside insn group)\n"); | |
2357 | *res = MOVEUP_EXPR_SAME; | |
2358 | return true; | |
b8698a0f | 2359 | |
e855c69d AB |
2360 | } |
2361 | else | |
2362 | EXPR_TARGET_AVAILABLE (expr) = false; | |
2363 | ||
b8698a0f L |
2364 | /* This is the only case when propagation result can change over time, |
2365 | as we can dynamically switch off scheduling as RHS. In this case, | |
e855c69d AB |
2366 | just check the flag to reach the correct decision. */ |
2367 | if (enable_schedule_as_rhs_p) | |
2368 | { | |
2369 | if (sched_verbose >= 6) | |
2370 | sel_print ("unchanged (as RHS, cached)\n"); | |
2371 | *res = MOVEUP_EXPR_AS_RHS; | |
2372 | return true; | |
2373 | } | |
2374 | else | |
2375 | { | |
2376 | if (sched_verbose >= 6) | |
2377 | sel_print ("removed (cached as RHS, but renaming" | |
2378 | " is now disabled)\n"); | |
2379 | *res = MOVEUP_EXPR_NULL; | |
2380 | return true; | |
2381 | } | |
2382 | } | |
2383 | ||
2384 | return false; | |
2385 | } | |
2386 | ||
b8698a0f | 2387 | /* Try to look at bitmap caches for EXPR and INSN pair, return true |
e855c69d | 2388 | if successful. Write to RES the resulting code for moveup_expr. */ |
b8698a0f | 2389 | static bool |
e855c69d AB |
2390 | try_transformation_cache (expr_t expr, insn_t insn, |
2391 | enum MOVEUP_EXPR_CODE *res) | |
2392 | { | |
b8698a0f | 2393 | struct transformed_insns *pti |
e855c69d AB |
2394 | = (struct transformed_insns *) |
2395 | htab_find_with_hash (INSN_TRANSFORMED_INSNS (insn), | |
b8698a0f | 2396 | &EXPR_VINSN (expr), |
e855c69d AB |
2397 | VINSN_HASH_RTX (EXPR_VINSN (expr))); |
2398 | if (pti) | |
2399 | { | |
b8698a0f L |
2400 | /* This EXPR was already moved through this insn and was |
2401 | changed as a result. Fetch the proper data from | |
e855c69d | 2402 | the hashtable. */ |
b8698a0f L |
2403 | insert_in_history_vect (&EXPR_HISTORY_OF_CHANGES (expr), |
2404 | INSN_UID (insn), pti->type, | |
2405 | pti->vinsn_old, pti->vinsn_new, | |
e855c69d | 2406 | EXPR_SPEC_DONE_DS (expr)); |
b8698a0f | 2407 | |
e855c69d AB |
2408 | if (INSN_IN_STREAM_P (VINSN_INSN_RTX (pti->vinsn_new))) |
2409 | pti->vinsn_new = vinsn_copy (pti->vinsn_new, true); | |
2410 | change_vinsn_in_expr (expr, pti->vinsn_new); | |
2411 | if (pti->was_target_conflict) | |
2412 | EXPR_TARGET_AVAILABLE (expr) = false; | |
2413 | if (pti->type == TRANS_SPECULATION) | |
2414 | { | |
e855c69d AB |
2415 | EXPR_SPEC_DONE_DS (expr) = pti->ds; |
2416 | EXPR_NEEDS_SPEC_CHECK_P (expr) |= pti->needs_check; | |
2417 | } | |
2418 | ||
2419 | if (sched_verbose >= 6) | |
2420 | { | |
2421 | sel_print ("changed (cached): "); | |
2422 | dump_expr (expr); | |
2423 | sel_print ("\n"); | |
2424 | } | |
2425 | ||
2426 | *res = MOVEUP_EXPR_CHANGED; | |
2427 | return true; | |
2428 | } | |
2429 | ||
2430 | return false; | |
2431 | } | |
2432 | ||
2433 | /* Update bitmap caches on INSN with result RES of propagating EXPR. */ | |
2434 | static void | |
b8698a0f | 2435 | update_bitmap_cache (expr_t expr, insn_t insn, bool inside_insn_group, |
e855c69d AB |
2436 | enum MOVEUP_EXPR_CODE res) |
2437 | { | |
2438 | int expr_uid = INSN_UID (EXPR_INSN_RTX (expr)); | |
2439 | ||
b8698a0f | 2440 | /* Do not cache result of propagating jumps through an insn group, |
e855c69d AB |
2441 | as it is always true, which is not useful outside the group. */ |
2442 | if (inside_insn_group) | |
2443 | return; | |
b8698a0f | 2444 | |
e855c69d AB |
2445 | if (res == MOVEUP_EXPR_NULL) |
2446 | { | |
2447 | bitmap_set_bit (INSN_ANALYZED_DEPS (insn), expr_uid); | |
2448 | bitmap_set_bit (INSN_FOUND_DEPS (insn), expr_uid); | |
2449 | } | |
2450 | else if (res == MOVEUP_EXPR_SAME) | |
2451 | { | |
2452 | bitmap_set_bit (INSN_ANALYZED_DEPS (insn), expr_uid); | |
2453 | bitmap_clear_bit (INSN_FOUND_DEPS (insn), expr_uid); | |
2454 | } | |
2455 | else if (res == MOVEUP_EXPR_AS_RHS) | |
2456 | { | |
2457 | bitmap_clear_bit (INSN_ANALYZED_DEPS (insn), expr_uid); | |
2458 | bitmap_set_bit (INSN_FOUND_DEPS (insn), expr_uid); | |
2459 | } | |
2460 | else | |
2461 | gcc_unreachable (); | |
2462 | } | |
2463 | ||
2464 | /* Update hashtable on INSN with changed EXPR, old EXPR_OLD_VINSN | |
2465 | and transformation type TRANS_TYPE. */ | |
2466 | static void | |
b8698a0f | 2467 | update_transformation_cache (expr_t expr, insn_t insn, |
e855c69d | 2468 | bool inside_insn_group, |
b8698a0f | 2469 | enum local_trans_type trans_type, |
e855c69d AB |
2470 | vinsn_t expr_old_vinsn) |
2471 | { | |
2472 | struct transformed_insns *pti; | |
2473 | ||
2474 | if (inside_insn_group) | |
2475 | return; | |
b8698a0f | 2476 | |
e855c69d AB |
2477 | pti = XNEW (struct transformed_insns); |
2478 | pti->vinsn_old = expr_old_vinsn; | |
2479 | pti->vinsn_new = EXPR_VINSN (expr); | |
2480 | pti->type = trans_type; | |
2481 | pti->was_target_conflict = was_target_conflict; | |
2482 | pti->ds = EXPR_SPEC_DONE_DS (expr); | |
2483 | pti->needs_check = EXPR_NEEDS_SPEC_CHECK_P (expr); | |
2484 | vinsn_attach (pti->vinsn_old); | |
2485 | vinsn_attach (pti->vinsn_new); | |
b8698a0f | 2486 | *((struct transformed_insns **) |
e855c69d AB |
2487 | htab_find_slot_with_hash (INSN_TRANSFORMED_INSNS (insn), |
2488 | pti, VINSN_HASH_RTX (expr_old_vinsn), | |
2489 | INSERT)) = pti; | |
2490 | } | |
2491 | ||
b8698a0f | 2492 | /* Same as moveup_expr, but first looks up the result of |
e855c69d AB |
2493 | transformation in caches. */ |
2494 | static enum MOVEUP_EXPR_CODE | |
2495 | moveup_expr_cached (expr_t expr, insn_t insn, bool inside_insn_group) | |
2496 | { | |
2497 | enum MOVEUP_EXPR_CODE res; | |
2498 | bool got_answer = false; | |
2499 | ||
2500 | if (sched_verbose >= 6) | |
2501 | { | |
b8698a0f | 2502 | sel_print ("Moving "); |
e855c69d AB |
2503 | dump_expr (expr); |
2504 | sel_print (" through %d: ", INSN_UID (insn)); | |
2505 | } | |
2506 | ||
b5b8b0ac AO |
2507 | if (DEBUG_INSN_P (EXPR_INSN_RTX (expr)) |
2508 | && (sel_bb_head (BLOCK_FOR_INSN (EXPR_INSN_RTX (expr))) | |
2509 | == EXPR_INSN_RTX (expr))) | |
2510 | /* Don't use cached information for debug insns that are heads of | |
2511 | basic blocks. */; | |
2512 | else if (try_bitmap_cache (expr, insn, inside_insn_group, &res)) | |
e855c69d AB |
2513 | /* When inside insn group, we do not want remove stores conflicting |
2514 | with previosly issued loads. */ | |
2515 | got_answer = ! inside_insn_group || res != MOVEUP_EXPR_NULL; | |
2516 | else if (try_transformation_cache (expr, insn, &res)) | |
2517 | got_answer = true; | |
2518 | ||
2519 | if (! got_answer) | |
2520 | { | |
2521 | /* Invoke moveup_expr and record the results. */ | |
2522 | vinsn_t expr_old_vinsn = EXPR_VINSN (expr); | |
2523 | ds_t expr_old_spec_ds = EXPR_SPEC_DONE_DS (expr); | |
2524 | int expr_uid = INSN_UID (VINSN_INSN_RTX (expr_old_vinsn)); | |
2525 | bool unique_p = VINSN_UNIQUE_P (expr_old_vinsn); | |
2526 | enum local_trans_type trans_type = TRANS_SUBSTITUTION; | |
2527 | ||
b8698a0f | 2528 | /* ??? Invent something better than this. We can't allow old_vinsn |
e855c69d AB |
2529 | to go, we need it for the history vector. */ |
2530 | vinsn_attach (expr_old_vinsn); | |
2531 | ||
2532 | res = moveup_expr (expr, insn, inside_insn_group, | |
2533 | &trans_type); | |
2534 | switch (res) | |
2535 | { | |
2536 | case MOVEUP_EXPR_NULL: | |
2537 | update_bitmap_cache (expr, insn, inside_insn_group, res); | |
2538 | if (sched_verbose >= 6) | |
2539 | sel_print ("removed\n"); | |
2540 | break; | |
2541 | ||
2542 | case MOVEUP_EXPR_SAME: | |
2543 | update_bitmap_cache (expr, insn, inside_insn_group, res); | |
2544 | if (sched_verbose >= 6) | |
2545 | sel_print ("unchanged\n"); | |
2546 | break; | |
2547 | ||
2548 | case MOVEUP_EXPR_AS_RHS: | |
2549 | gcc_assert (!unique_p || inside_insn_group); | |
2550 | update_bitmap_cache (expr, insn, inside_insn_group, res); | |
2551 | if (sched_verbose >= 6) | |
2552 | sel_print ("unchanged (as RHS)\n"); | |
2553 | break; | |
2554 | ||
2555 | case MOVEUP_EXPR_CHANGED: | |
2556 | gcc_assert (INSN_UID (EXPR_INSN_RTX (expr)) != expr_uid | |
2557 | || EXPR_SPEC_DONE_DS (expr) != expr_old_spec_ds); | |
b8698a0f L |
2558 | insert_in_history_vect (&EXPR_HISTORY_OF_CHANGES (expr), |
2559 | INSN_UID (insn), trans_type, | |
2560 | expr_old_vinsn, EXPR_VINSN (expr), | |
e855c69d AB |
2561 | expr_old_spec_ds); |
2562 | update_transformation_cache (expr, insn, inside_insn_group, | |
2563 | trans_type, expr_old_vinsn); | |
2564 | if (sched_verbose >= 6) | |
2565 | { | |
2566 | sel_print ("changed: "); | |
2567 | dump_expr (expr); | |
2568 | sel_print ("\n"); | |
2569 | } | |
2570 | break; | |
2571 | default: | |
2572 | gcc_unreachable (); | |
2573 | } | |
2574 | ||
2575 | vinsn_detach (expr_old_vinsn); | |
2576 | } | |
2577 | ||
2578 | return res; | |
2579 | } | |
2580 | ||
b8698a0f | 2581 | /* Moves an av set AVP up through INSN, performing necessary |
e855c69d AB |
2582 | transformations. */ |
2583 | static void | |
2584 | moveup_set_expr (av_set_t *avp, insn_t insn, bool inside_insn_group) | |
2585 | { | |
2586 | av_set_iterator i; | |
2587 | expr_t expr; | |
2588 | ||
b8698a0f L |
2589 | FOR_EACH_EXPR_1 (expr, i, avp) |
2590 | { | |
2591 | ||
e855c69d AB |
2592 | switch (moveup_expr_cached (expr, insn, inside_insn_group)) |
2593 | { | |
2594 | case MOVEUP_EXPR_SAME: | |
2595 | case MOVEUP_EXPR_AS_RHS: | |
2596 | break; | |
2597 | ||
2598 | case MOVEUP_EXPR_NULL: | |
2599 | av_set_iter_remove (&i); | |
2600 | break; | |
2601 | ||
2602 | case MOVEUP_EXPR_CHANGED: | |
2603 | expr = merge_with_other_exprs (avp, &i, expr); | |
2604 | break; | |
b8698a0f | 2605 | |
e855c69d AB |
2606 | default: |
2607 | gcc_unreachable (); | |
2608 | } | |
2609 | } | |
2610 | } | |
2611 | ||
2612 | /* Moves AVP set along PATH. */ | |
2613 | static void | |
2614 | moveup_set_inside_insn_group (av_set_t *avp, ilist_t path) | |
2615 | { | |
2616 | int last_cycle; | |
b8698a0f | 2617 | |
e855c69d AB |
2618 | if (sched_verbose >= 6) |
2619 | sel_print ("Moving expressions up in the insn group...\n"); | |
2620 | if (! path) | |
2621 | return; | |
2622 | last_cycle = INSN_SCHED_CYCLE (ILIST_INSN (path)); | |
b8698a0f | 2623 | while (path |
e855c69d AB |
2624 | && INSN_SCHED_CYCLE (ILIST_INSN (path)) == last_cycle) |
2625 | { | |
2626 | moveup_set_expr (avp, ILIST_INSN (path), true); | |
2627 | path = ILIST_NEXT (path); | |
2628 | } | |
2629 | } | |
2630 | ||
2631 | /* Returns true if after moving EXPR along PATH it equals to EXPR_VLIW. */ | |
2632 | static bool | |
2633 | equal_after_moveup_path_p (expr_t expr, ilist_t path, expr_t expr_vliw) | |
2634 | { | |
2635 | expr_def _tmp, *tmp = &_tmp; | |
2636 | int last_cycle; | |
2637 | bool res = true; | |
2638 | ||
2639 | copy_expr_onside (tmp, expr); | |
2640 | last_cycle = path ? INSN_SCHED_CYCLE (ILIST_INSN (path)) : 0; | |
b8698a0f | 2641 | while (path |
e855c69d AB |
2642 | && res |
2643 | && INSN_SCHED_CYCLE (ILIST_INSN (path)) == last_cycle) | |
2644 | { | |
b8698a0f | 2645 | res = (moveup_expr_cached (tmp, ILIST_INSN (path), true) |
e855c69d AB |
2646 | != MOVEUP_EXPR_NULL); |
2647 | path = ILIST_NEXT (path); | |
2648 | } | |
2649 | ||
2650 | if (res) | |
2651 | { | |
2652 | vinsn_t tmp_vinsn = EXPR_VINSN (tmp); | |
2653 | vinsn_t expr_vliw_vinsn = EXPR_VINSN (expr_vliw); | |
2654 | ||
2655 | if (tmp_vinsn != expr_vliw_vinsn) | |
2656 | res = vinsn_equal_p (tmp_vinsn, expr_vliw_vinsn); | |
2657 | } | |
2658 | ||
2659 | clear_expr (tmp); | |
2660 | return res; | |
2661 | } | |
2662 | \f | |
2663 | ||
2664 | /* Functions that compute av and lv sets. */ | |
2665 | ||
b8698a0f | 2666 | /* Returns true if INSN is not a downward continuation of the given path P in |
e855c69d AB |
2667 | the current stage. */ |
2668 | static bool | |
2669 | is_ineligible_successor (insn_t insn, ilist_t p) | |
2670 | { | |
2671 | insn_t prev_insn; | |
2672 | ||
2673 | /* Check if insn is not deleted. */ | |
2674 | if (PREV_INSN (insn) && NEXT_INSN (PREV_INSN (insn)) != insn) | |
2675 | gcc_unreachable (); | |
2676 | else if (NEXT_INSN (insn) && PREV_INSN (NEXT_INSN (insn)) != insn) | |
2677 | gcc_unreachable (); | |
2678 | ||
2679 | /* If it's the first insn visited, then the successor is ok. */ | |
2680 | if (!p) | |
2681 | return false; | |
2682 | ||
2683 | prev_insn = ILIST_INSN (p); | |
2684 | ||
2685 | if (/* a backward edge. */ | |
2686 | INSN_SEQNO (insn) < INSN_SEQNO (prev_insn) | |
2687 | /* is already visited. */ | |
2688 | || (INSN_SEQNO (insn) == INSN_SEQNO (prev_insn) | |
2689 | && (ilist_is_in_p (p, insn) | |
b8698a0f L |
2690 | /* We can reach another fence here and still seqno of insn |
2691 | would be equal to seqno of prev_insn. This is possible | |
e855c69d AB |
2692 | when prev_insn is a previously created bookkeeping copy. |
2693 | In that case it'd get a seqno of insn. Thus, check here | |
2694 | whether insn is in current fence too. */ | |
2695 | || IN_CURRENT_FENCE_P (insn))) | |
2696 | /* Was already scheduled on this round. */ | |
2697 | || (INSN_SEQNO (insn) > INSN_SEQNO (prev_insn) | |
2698 | && IN_CURRENT_FENCE_P (insn)) | |
b8698a0f L |
2699 | /* An insn from another fence could also be |
2700 | scheduled earlier even if this insn is not in | |
e855c69d AB |
2701 | a fence list right now. Check INSN_SCHED_CYCLE instead. */ |
2702 | || (!pipelining_p | |
2703 | && INSN_SCHED_TIMES (insn) > 0)) | |
2704 | return true; | |
2705 | else | |
2706 | return false; | |
2707 | } | |
2708 | ||
b8698a0f L |
2709 | /* Computes the av_set below the last bb insn INSN, doing all the 'dirty work' |
2710 | of handling multiple successors and properly merging its av_sets. P is | |
2711 | the current path traversed. WS is the size of lookahead window. | |
e855c69d AB |
2712 | Return the av set computed. */ |
2713 | static av_set_t | |
2714 | compute_av_set_at_bb_end (insn_t insn, ilist_t p, int ws) | |
2715 | { | |
2716 | struct succs_info *sinfo; | |
2717 | av_set_t expr_in_all_succ_branches = NULL; | |
2718 | int is; | |
2719 | insn_t succ, zero_succ = NULL; | |
2720 | av_set_t av1 = NULL; | |
2721 | ||
2722 | gcc_assert (sel_bb_end_p (insn)); | |
2723 | ||
b8698a0f | 2724 | /* Find different kind of successors needed for correct computing of |
e855c69d AB |
2725 | SPEC and TARGET_AVAILABLE attributes. */ |
2726 | sinfo = compute_succs_info (insn, SUCCS_NORMAL); | |
2727 | ||
2728 | /* Debug output. */ | |
2729 | if (sched_verbose >= 6) | |
2730 | { | |
2731 | sel_print ("successors of bb end (%d): ", INSN_UID (insn)); | |
2732 | dump_insn_vector (sinfo->succs_ok); | |
2733 | sel_print ("\n"); | |
2734 | if (sinfo->succs_ok_n != sinfo->all_succs_n) | |
2735 | sel_print ("real successors num: %d\n", sinfo->all_succs_n); | |
2736 | } | |
2737 | ||
2738 | /* Add insn to to the tail of current path. */ | |
2739 | ilist_add (&p, insn); | |
2740 | ||
ac47786e | 2741 | FOR_EACH_VEC_ELT (rtx, sinfo->succs_ok, is, succ) |
e855c69d AB |
2742 | { |
2743 | av_set_t succ_set; | |
2744 | ||
2745 | /* We will edit SUCC_SET and EXPR_SPEC field of its elements. */ | |
2746 | succ_set = compute_av_set_inside_bb (succ, p, ws, true); | |
2747 | ||
b8698a0f L |
2748 | av_set_split_usefulness (succ_set, |
2749 | VEC_index (int, sinfo->probs_ok, is), | |
e855c69d AB |
2750 | sinfo->all_prob); |
2751 | ||
c6486552 | 2752 | if (sinfo->all_succs_n > 1) |
e855c69d | 2753 | { |
b8698a0f | 2754 | /* Find EXPR'es that came from *all* successors and save them |
e855c69d AB |
2755 | into expr_in_all_succ_branches. This set will be used later |
2756 | for calculating speculation attributes of EXPR'es. */ | |
2757 | if (is == 0) | |
2758 | { | |
2759 | expr_in_all_succ_branches = av_set_copy (succ_set); | |
2760 | ||
2761 | /* Remember the first successor for later. */ | |
2762 | zero_succ = succ; | |
2763 | } | |
2764 | else | |
2765 | { | |
2766 | av_set_iterator i; | |
2767 | expr_t expr; | |
b8698a0f | 2768 | |
e855c69d AB |
2769 | FOR_EACH_EXPR_1 (expr, i, &expr_in_all_succ_branches) |
2770 | if (!av_set_is_in_p (succ_set, EXPR_VINSN (expr))) | |
2771 | av_set_iter_remove (&i); | |
2772 | } | |
2773 | } | |
2774 | ||
2775 | /* Union the av_sets. Check liveness restrictions on target registers | |
2776 | in special case of two successors. */ | |
2777 | if (sinfo->succs_ok_n == 2 && is == 1) | |
2778 | { | |
2779 | basic_block bb0 = BLOCK_FOR_INSN (zero_succ); | |
2780 | basic_block bb1 = BLOCK_FOR_INSN (succ); | |
2781 | ||
2782 | gcc_assert (BB_LV_SET_VALID_P (bb0) && BB_LV_SET_VALID_P (bb1)); | |
b8698a0f | 2783 | av_set_union_and_live (&av1, &succ_set, |
e855c69d AB |
2784 | BB_LV_SET (bb0), |
2785 | BB_LV_SET (bb1), | |
2786 | insn); | |
2787 | } | |
2788 | else | |
2789 | av_set_union_and_clear (&av1, &succ_set, insn); | |
2790 | } | |
2791 | ||
b8698a0f | 2792 | /* Check liveness restrictions via hard way when there are more than |
e855c69d AB |
2793 | two successors. */ |
2794 | if (sinfo->succs_ok_n > 2) | |
ac47786e | 2795 | FOR_EACH_VEC_ELT (rtx, sinfo->succs_ok, is, succ) |
e855c69d AB |
2796 | { |
2797 | basic_block succ_bb = BLOCK_FOR_INSN (succ); | |
b8698a0f | 2798 | |
e855c69d | 2799 | gcc_assert (BB_LV_SET_VALID_P (succ_bb)); |
b8698a0f | 2800 | mark_unavailable_targets (av1, BB_AV_SET (succ_bb), |
e855c69d AB |
2801 | BB_LV_SET (succ_bb)); |
2802 | } | |
b8698a0f L |
2803 | |
2804 | /* Finally, check liveness restrictions on paths leaving the region. */ | |
e855c69d | 2805 | if (sinfo->all_succs_n > sinfo->succs_ok_n) |
ac47786e | 2806 | FOR_EACH_VEC_ELT (rtx, sinfo->succs_other, is, succ) |
b8698a0f | 2807 | mark_unavailable_targets |
e855c69d AB |
2808 | (av1, NULL, BB_LV_SET (BLOCK_FOR_INSN (succ))); |
2809 | ||
2810 | if (sinfo->all_succs_n > 1) | |
2811 | { | |
2812 | av_set_iterator i; | |
2813 | expr_t expr; | |
2814 | ||
b8698a0f | 2815 | /* Increase the spec attribute of all EXPR'es that didn't come |
e855c69d AB |
2816 | from all successors. */ |
2817 | FOR_EACH_EXPR (expr, i, av1) | |
2818 | if (!av_set_is_in_p (expr_in_all_succ_branches, EXPR_VINSN (expr))) | |
2819 | EXPR_SPEC (expr)++; | |
2820 | ||
2821 | av_set_clear (&expr_in_all_succ_branches); | |
b8698a0f L |
2822 | |
2823 | /* Do not move conditional branches through other | |
2824 | conditional branches. So, remove all conditional | |
e855c69d AB |
2825 | branches from av_set if current operator is a conditional |
2826 | branch. */ | |
2827 | av_set_substract_cond_branches (&av1); | |
2828 | } | |
b8698a0f | 2829 | |
e855c69d AB |
2830 | ilist_remove (&p); |
2831 | free_succs_info (sinfo); | |
2832 | ||
2833 | if (sched_verbose >= 6) | |
2834 | { | |
2835 | sel_print ("av_succs (%d): ", INSN_UID (insn)); | |
2836 | dump_av_set (av1); | |
2837 | sel_print ("\n"); | |
2838 | } | |
2839 | ||
2840 | return av1; | |
2841 | } | |
2842 | ||
b8698a0f L |
2843 | /* This function computes av_set for the FIRST_INSN by dragging valid |
2844 | av_set through all basic block insns either from the end of basic block | |
2845 | (computed using compute_av_set_at_bb_end) or from the insn on which | |
e855c69d AB |
2846 | MAX_WS was exceeded. It uses compute_av_set_at_bb_end to compute av_set |
2847 | below the basic block and handling conditional branches. | |
2848 | FIRST_INSN - the basic block head, P - path consisting of the insns | |
2849 | traversed on the way to the FIRST_INSN (the path is sparse, only bb heads | |
2850 | and bb ends are added to the path), WS - current window size, | |
2851 | NEED_COPY_P - true if we'll make a copy of av_set before returning it. */ | |
2852 | static av_set_t | |
b8698a0f | 2853 | compute_av_set_inside_bb (insn_t first_insn, ilist_t p, int ws, |
e855c69d AB |
2854 | bool need_copy_p) |
2855 | { | |
2856 | insn_t cur_insn; | |
2857 | int end_ws = ws; | |
2858 | insn_t bb_end = sel_bb_end (BLOCK_FOR_INSN (first_insn)); | |
2859 | insn_t after_bb_end = NEXT_INSN (bb_end); | |
2860 | insn_t last_insn; | |
2861 | av_set_t av = NULL; | |
2862 | basic_block cur_bb = BLOCK_FOR_INSN (first_insn); | |
2863 | ||
2864 | /* Return NULL if insn is not on the legitimate downward path. */ | |
2865 | if (is_ineligible_successor (first_insn, p)) | |
2866 | { | |
2867 | if (sched_verbose >= 6) | |
2868 | sel_print ("Insn %d is ineligible_successor\n", INSN_UID (first_insn)); | |
2869 | ||
2870 | return NULL; | |
2871 | } | |
2872 | ||
b8698a0f | 2873 | /* If insn already has valid av(insn) computed, just return it. */ |
e855c69d AB |
2874 | if (AV_SET_VALID_P (first_insn)) |
2875 | { | |
2876 | av_set_t av_set; | |
2877 | ||
2878 | if (sel_bb_head_p (first_insn)) | |
2879 | av_set = BB_AV_SET (BLOCK_FOR_INSN (first_insn)); | |
2880 | else | |
2881 | av_set = NULL; | |
2882 | ||
2883 | if (sched_verbose >= 6) | |
2884 | { | |
2885 | sel_print ("Insn %d has a valid av set: ", INSN_UID (first_insn)); | |
2886 | dump_av_set (av_set); | |
2887 | sel_print ("\n"); | |
2888 | } | |
2889 | ||
2890 | return need_copy_p ? av_set_copy (av_set) : av_set; | |
2891 | } | |
2892 | ||
2893 | ilist_add (&p, first_insn); | |
2894 | ||
2895 | /* As the result after this loop have completed, in LAST_INSN we'll | |
b8698a0f L |
2896 | have the insn which has valid av_set to start backward computation |
2897 | from: it either will be NULL because on it the window size was exceeded | |
2898 | or other valid av_set as returned by compute_av_set for the last insn | |
e855c69d AB |
2899 | of the basic block. */ |
2900 | for (last_insn = first_insn; last_insn != after_bb_end; | |
2901 | last_insn = NEXT_INSN (last_insn)) | |
2902 | { | |
2903 | /* We may encounter valid av_set not only on bb_head, but also on | |
2904 | those insns on which previously MAX_WS was exceeded. */ | |
2905 | if (AV_SET_VALID_P (last_insn)) | |
2906 | { | |
2907 | if (sched_verbose >= 6) | |
2908 | sel_print ("Insn %d has a valid empty av set\n", INSN_UID (last_insn)); | |
2909 | break; | |
2910 | } | |
2911 | ||
2912 | /* The special case: the last insn of the BB may be an | |
2913 | ineligible_successor due to its SEQ_NO that was set on | |
2914 | it as a bookkeeping. */ | |
b8698a0f | 2915 | if (last_insn != first_insn |
e855c69d AB |
2916 | && is_ineligible_successor (last_insn, p)) |
2917 | { | |
2918 | if (sched_verbose >= 6) | |
2919 | sel_print ("Insn %d is ineligible_successor\n", INSN_UID (last_insn)); | |
b8698a0f | 2920 | break; |
e855c69d AB |
2921 | } |
2922 | ||
b5b8b0ac AO |
2923 | if (DEBUG_INSN_P (last_insn)) |
2924 | continue; | |
2925 | ||
e855c69d AB |
2926 | if (end_ws > max_ws) |
2927 | { | |
b8698a0f | 2928 | /* We can reach max lookahead size at bb_header, so clean av_set |
e855c69d AB |
2929 | first. */ |
2930 | INSN_WS_LEVEL (last_insn) = global_level; | |
2931 | ||
2932 | if (sched_verbose >= 6) | |
2933 | sel_print ("Insn %d is beyond the software lookahead window size\n", | |
2934 | INSN_UID (last_insn)); | |
2935 | break; | |
2936 | } | |
2937 | ||
2938 | end_ws++; | |
2939 | } | |
2940 | ||
2941 | /* Get the valid av_set into AV above the LAST_INSN to start backward | |
2942 | computation from. It either will be empty av_set or av_set computed from | |
2943 | the successors on the last insn of the current bb. */ | |
2944 | if (last_insn != after_bb_end) | |
2945 | { | |
2946 | av = NULL; | |
2947 | ||
b8698a0f | 2948 | /* This is needed only to obtain av_sets that are identical to |
e855c69d AB |
2949 | those computed by the old compute_av_set version. */ |
2950 | if (last_insn == first_insn && !INSN_NOP_P (last_insn)) | |
2951 | av_set_add (&av, INSN_EXPR (last_insn)); | |
2952 | } | |
2953 | else | |
2954 | /* END_WS is always already increased by 1 if LAST_INSN == AFTER_BB_END. */ | |
2955 | av = compute_av_set_at_bb_end (bb_end, p, end_ws); | |
2956 | ||
2957 | /* Compute av_set in AV starting from below the LAST_INSN up to | |
2958 | location above the FIRST_INSN. */ | |
2959 | for (cur_insn = PREV_INSN (last_insn); cur_insn != PREV_INSN (first_insn); | |
b8698a0f | 2960 | cur_insn = PREV_INSN (cur_insn)) |
e855c69d AB |
2961 | if (!INSN_NOP_P (cur_insn)) |
2962 | { | |
2963 | expr_t expr; | |
b8698a0f | 2964 | |
e855c69d | 2965 | moveup_set_expr (&av, cur_insn, false); |
b8698a0f L |
2966 | |
2967 | /* If the expression for CUR_INSN is already in the set, | |
e855c69d | 2968 | replace it by the new one. */ |
b8698a0f | 2969 | expr = av_set_lookup (av, INSN_VINSN (cur_insn)); |
e855c69d AB |
2970 | if (expr != NULL) |
2971 | { | |
2972 | clear_expr (expr); | |
2973 | copy_expr (expr, INSN_EXPR (cur_insn)); | |
2974 | } | |
2975 | else | |
2976 | av_set_add (&av, INSN_EXPR (cur_insn)); | |
2977 | } | |
2978 | ||
2979 | /* Clear stale bb_av_set. */ | |
2980 | if (sel_bb_head_p (first_insn)) | |
2981 | { | |
2982 | av_set_clear (&BB_AV_SET (cur_bb)); | |
2983 | BB_AV_SET (cur_bb) = need_copy_p ? av_set_copy (av) : av; | |
2984 | BB_AV_LEVEL (cur_bb) = global_level; | |
2985 | } | |
2986 | ||
2987 | if (sched_verbose >= 6) | |
2988 | { | |
2989 | sel_print ("Computed av set for insn %d: ", INSN_UID (first_insn)); | |
2990 | dump_av_set (av); | |
2991 | sel_print ("\n"); | |
2992 | } | |
2993 | ||
2994 | ilist_remove (&p); | |
2995 | return av; | |
2996 | } | |
2997 | ||
2998 | /* Compute av set before INSN. | |
2999 | INSN - the current operation (actual rtx INSN) | |
3000 | P - the current path, which is list of insns visited so far | |
3001 | WS - software lookahead window size. | |
3002 | UNIQUE_P - TRUE, if returned av_set will be changed, hence | |
3003 | if we want to save computed av_set in s_i_d, we should make a copy of it. | |
3004 | ||
3005 | In the resulting set we will have only expressions that don't have delay | |
3006 | stalls and nonsubstitutable dependences. */ | |
3007 | static av_set_t | |
3008 | compute_av_set (insn_t insn, ilist_t p, int ws, bool unique_p) | |
3009 | { | |
3010 | return compute_av_set_inside_bb (insn, p, ws, unique_p); | |
3011 | } | |
3012 | ||
3013 | /* Propagate a liveness set LV through INSN. */ | |
3014 | static void | |
3015 | propagate_lv_set (regset lv, insn_t insn) | |
3016 | { | |
3017 | gcc_assert (INSN_P (insn)); | |
3018 | ||
3019 | if (INSN_NOP_P (insn)) | |
3020 | return; | |
3021 | ||
02b47899 | 3022 | df_simulate_one_insn_backwards (BLOCK_FOR_INSN (insn), insn, lv); |
e855c69d AB |
3023 | } |
3024 | ||
3025 | /* Return livness set at the end of BB. */ | |
3026 | static regset | |
3027 | compute_live_after_bb (basic_block bb) | |
3028 | { | |
3029 | edge e; | |
3030 | edge_iterator ei; | |
3031 | regset lv = get_clear_regset_from_pool (); | |
3032 | ||
3033 | gcc_assert (!ignore_first); | |
3034 | ||
3035 | FOR_EACH_EDGE (e, ei, bb->succs) | |
3036 | if (sel_bb_empty_p (e->dest)) | |
3037 | { | |
3038 | if (! BB_LV_SET_VALID_P (e->dest)) | |
3039 | { | |
3040 | gcc_unreachable (); | |
3041 | gcc_assert (BB_LV_SET (e->dest) == NULL); | |
3042 | BB_LV_SET (e->dest) = compute_live_after_bb (e->dest); | |
3043 | BB_LV_SET_VALID_P (e->dest) = true; | |
3044 | } | |
3045 | IOR_REG_SET (lv, BB_LV_SET (e->dest)); | |
3046 | } | |
3047 | else | |
3048 | IOR_REG_SET (lv, compute_live (sel_bb_head (e->dest))); | |
3049 | ||
3050 | return lv; | |
3051 | } | |
3052 | ||
3053 | /* Compute the set of all live registers at the point before INSN and save | |
3054 | it at INSN if INSN is bb header. */ | |
3055 | regset | |
3056 | compute_live (insn_t insn) | |
3057 | { | |
3058 | basic_block bb = BLOCK_FOR_INSN (insn); | |
3059 | insn_t final, temp; | |
3060 | regset lv; | |
3061 | ||
3062 | /* Return the valid set if we're already on it. */ | |
3063 | if (!ignore_first) | |
3064 | { | |
3065 | regset src = NULL; | |
b8698a0f | 3066 | |
e855c69d AB |
3067 | if (sel_bb_head_p (insn) && BB_LV_SET_VALID_P (bb)) |
3068 | src = BB_LV_SET (bb); | |
b8698a0f | 3069 | else |
e855c69d AB |
3070 | { |
3071 | gcc_assert (in_current_region_p (bb)); | |
3072 | if (INSN_LIVE_VALID_P (insn)) | |
3073 | src = INSN_LIVE (insn); | |
3074 | } | |
b8698a0f | 3075 | |
e855c69d AB |
3076 | if (src) |
3077 | { | |
3078 | lv = get_regset_from_pool (); | |
3079 | COPY_REG_SET (lv, src); | |
3080 | ||
3081 | if (sel_bb_head_p (insn) && ! BB_LV_SET_VALID_P (bb)) | |
3082 | { | |
3083 | COPY_REG_SET (BB_LV_SET (bb), lv); | |
3084 | BB_LV_SET_VALID_P (bb) = true; | |
3085 | } | |
b8698a0f | 3086 | |
e855c69d AB |
3087 | return_regset_to_pool (lv); |
3088 | return lv; | |
3089 | } | |
3090 | } | |
3091 | ||
3092 | /* We've skipped the wrong lv_set. Don't skip the right one. */ | |
3093 | ignore_first = false; | |
3094 | gcc_assert (in_current_region_p (bb)); | |
3095 | ||
b8698a0f L |
3096 | /* Find a valid LV set in this block or below, if needed. |
3097 | Start searching from the next insn: either ignore_first is true, or | |
e855c69d AB |
3098 | INSN doesn't have a correct live set. */ |
3099 | temp = NEXT_INSN (insn); | |
3100 | final = NEXT_INSN (BB_END (bb)); | |
3101 | while (temp != final && ! INSN_LIVE_VALID_P (temp)) | |
3102 | temp = NEXT_INSN (temp); | |
3103 | if (temp == final) | |
3104 | { | |
3105 | lv = compute_live_after_bb (bb); | |
3106 | temp = PREV_INSN (temp); | |
3107 | } | |
3108 | else | |
3109 | { | |
3110 | lv = get_regset_from_pool (); | |
3111 | COPY_REG_SET (lv, INSN_LIVE (temp)); | |
3112 | } | |
3113 | ||
3114 | /* Put correct lv sets on the insns which have bad sets. */ | |
3115 | final = PREV_INSN (insn); | |
3116 | while (temp != final) | |
3117 | { | |
3118 | propagate_lv_set (lv, temp); | |
3119 | COPY_REG_SET (INSN_LIVE (temp), lv); | |
3120 | INSN_LIVE_VALID_P (temp) = true; | |
3121 | temp = PREV_INSN (temp); | |
3122 | } | |
3123 | ||
3124 | /* Also put it in a BB. */ | |
3125 | if (sel_bb_head_p (insn)) | |
3126 | { | |
3127 | basic_block bb = BLOCK_FOR_INSN (insn); | |
b8698a0f | 3128 | |
e855c69d AB |
3129 | COPY_REG_SET (BB_LV_SET (bb), lv); |
3130 | BB_LV_SET_VALID_P (bb) = true; | |
3131 | } | |
b8698a0f | 3132 | |
e855c69d AB |
3133 | /* We return LV to the pool, but will not clear it there. Thus we can |
3134 | legimatelly use LV till the next use of regset_pool_get (). */ | |
3135 | return_regset_to_pool (lv); | |
3136 | return lv; | |
3137 | } | |
3138 | ||
3139 | /* Update liveness sets for INSN. */ | |
3140 | static inline void | |
3141 | update_liveness_on_insn (rtx insn) | |
3142 | { | |
3143 | ignore_first = true; | |
3144 | compute_live (insn); | |
3145 | } | |
3146 | ||
3147 | /* Compute liveness below INSN and write it into REGS. */ | |
3148 | static inline void | |
3149 | compute_live_below_insn (rtx insn, regset regs) | |
3150 | { | |
3151 | rtx succ; | |
3152 | succ_iterator si; | |
b8698a0f L |
3153 | |
3154 | FOR_EACH_SUCC_1 (succ, si, insn, SUCCS_ALL) | |
e855c69d AB |
3155 | IOR_REG_SET (regs, compute_live (succ)); |
3156 | } | |
3157 | ||
3158 | /* Update the data gathered in av and lv sets starting from INSN. */ | |
3159 | static void | |
3160 | update_data_sets (rtx insn) | |
3161 | { | |
3162 | update_liveness_on_insn (insn); | |
3163 | if (sel_bb_head_p (insn)) | |
3164 | { | |
3165 | gcc_assert (AV_LEVEL (insn) != 0); | |
3166 | BB_AV_LEVEL (BLOCK_FOR_INSN (insn)) = -1; | |
3167 | compute_av_set (insn, NULL, 0, 0); | |
3168 | } | |
3169 | } | |
3170 | \f | |
3171 | ||
3172 | /* Helper for move_op () and find_used_regs (). | |
3173 | Return speculation type for which a check should be created on the place | |
3174 | of INSN. EXPR is one of the original ops we are searching for. */ | |
3175 | static ds_t | |
3176 | get_spec_check_type_for_insn (insn_t insn, expr_t expr) | |
3177 | { | |
3178 | ds_t to_check_ds; | |
3179 | ds_t already_checked_ds = EXPR_SPEC_DONE_DS (INSN_EXPR (insn)); | |
3180 | ||
3181 | to_check_ds = EXPR_SPEC_TO_CHECK_DS (expr); | |
3182 | ||
3183 | if (targetm.sched.get_insn_checked_ds) | |
3184 | already_checked_ds |= targetm.sched.get_insn_checked_ds (insn); | |
3185 | ||
3186 | if (spec_info != NULL | |
3187 | && (spec_info->flags & SEL_SCHED_SPEC_DONT_CHECK_CONTROL)) | |
3188 | already_checked_ds |= BEGIN_CONTROL; | |
3189 | ||
3190 | already_checked_ds = ds_get_speculation_types (already_checked_ds); | |
3191 | ||
3192 | to_check_ds &= ~already_checked_ds; | |
3193 | ||
3194 | return to_check_ds; | |
3195 | } | |
3196 | ||
b8698a0f | 3197 | /* Find the set of registers that are unavailable for storing expres |
e855c69d AB |
3198 | while moving ORIG_OPS up on the path starting from INSN due to |
3199 | liveness (USED_REGS) or hardware restrictions (REG_RENAME_P). | |
3200 | ||
3201 | All the original operations found during the traversal are saved in the | |
3202 | ORIGINAL_INSNS list. | |
3203 | ||
3204 | REG_RENAME_P denotes the set of hardware registers that | |
3205 | can not be used with renaming due to the register class restrictions, | |
b8698a0f | 3206 | mode restrictions and other (the register we'll choose should be |
e855c69d AB |
3207 | compatible class with the original uses, shouldn't be in call_used_regs, |
3208 | should be HARD_REGNO_RENAME_OK etc). | |
3209 | ||
3210 | Returns TRUE if we've found all original insns, FALSE otherwise. | |
3211 | ||
3212 | This function utilizes code_motion_path_driver (formerly find_used_regs_1) | |
b8698a0f L |
3213 | to traverse the code motion paths. This helper function finds registers |
3214 | that are not available for storing expres while moving ORIG_OPS up on the | |
e855c69d AB |
3215 | path starting from INSN. A register considered as used on the moving path, |
3216 | if one of the following conditions is not satisfied: | |
3217 | ||
b8698a0f L |
3218 | (1) a register not set or read on any path from xi to an instance of |
3219 | the original operation, | |
3220 | (2) not among the live registers of the point immediately following the | |
e855c69d AB |
3221 | first original operation on a given downward path, except for the |
3222 | original target register of the operation, | |
b8698a0f | 3223 | (3) not live on the other path of any conditional branch that is passed |
e855c69d AB |
3224 | by the operation, in case original operations are not present on |
3225 | both paths of the conditional branch. | |
3226 | ||
3227 | All the original operations found during the traversal are saved in the | |
3228 | ORIGINAL_INSNS list. | |
3229 | ||
b8698a0f L |
3230 | REG_RENAME_P->CROSSES_CALL is true, if there is a call insn on the path |
3231 | from INSN to original insn. In this case CALL_USED_REG_SET will be added | |
e855c69d AB |
3232 | to unavailable hard regs at the point original operation is found. */ |
3233 | ||
3234 | static bool | |
3235 | find_used_regs (insn_t insn, av_set_t orig_ops, regset used_regs, | |
3236 | struct reg_rename *reg_rename_p, def_list_t *original_insns) | |
3237 | { | |
3238 | def_list_iterator i; | |
3239 | def_t def; | |
3240 | int res; | |
3241 | bool needs_spec_check_p = false; | |
3242 | expr_t expr; | |
3243 | av_set_iterator expr_iter; | |
3244 | struct fur_static_params sparams; | |
3245 | struct cmpd_local_params lparams; | |
3246 | ||
3247 | /* We haven't visited any blocks yet. */ | |
3248 | bitmap_clear (code_motion_visited_blocks); | |
3249 | ||
3250 | /* Init parameters for code_motion_path_driver. */ | |
3251 | sparams.crosses_call = false; | |
3252 | sparams.original_insns = original_insns; | |
3253 | sparams.used_regs = used_regs; | |
b8698a0f | 3254 | |
e855c69d AB |
3255 | /* Set the appropriate hooks and data. */ |
3256 | code_motion_path_driver_info = &fur_hooks; | |
b8698a0f | 3257 | |
e855c69d AB |
3258 | res = code_motion_path_driver (insn, orig_ops, NULL, &lparams, &sparams); |
3259 | ||
3260 | reg_rename_p->crosses_call |= sparams.crosses_call; | |
3261 | ||
3262 | gcc_assert (res == 1); | |
3263 | gcc_assert (original_insns && *original_insns); | |
3264 | ||
3265 | /* ??? We calculate whether an expression needs a check when computing | |
3266 | av sets. This information is not as precise as it could be due to | |
3267 | merging this bit in merge_expr. We can do better in find_used_regs, | |
b8698a0f | 3268 | but we want to avoid multiple traversals of the same code motion |
e855c69d AB |
3269 | paths. */ |
3270 | FOR_EACH_EXPR (expr, expr_iter, orig_ops) | |
3271 | needs_spec_check_p |= EXPR_NEEDS_SPEC_CHECK_P (expr); | |
3272 | ||
b8698a0f | 3273 | /* Mark hardware regs in REG_RENAME_P that are not suitable |
e855c69d AB |
3274 | for renaming expr in INSN due to hardware restrictions (register class, |
3275 | modes compatibility etc). */ | |
3276 | FOR_EACH_DEF (def, i, *original_insns) | |
3277 | { | |
3278 | vinsn_t vinsn = INSN_VINSN (def->orig_insn); | |
3279 | ||
3280 | if (VINSN_SEPARABLE_P (vinsn)) | |
3281 | mark_unavailable_hard_regs (def, reg_rename_p, used_regs); | |
3282 | ||
b8698a0f | 3283 | /* Do not allow clobbering of ld.[sa] address in case some of the |
e855c69d AB |
3284 | original operations need a check. */ |
3285 | if (needs_spec_check_p) | |
3286 | IOR_REG_SET (used_regs, VINSN_REG_USES (vinsn)); | |
3287 | } | |
3288 | ||
3289 | return true; | |
3290 | } | |
3291 | \f | |
3292 | ||
3293 | /* Functions to choose the best insn from available ones. */ | |
3294 | ||
3295 | /* Adjusts the priority for EXPR using the backend *_adjust_priority hook. */ | |
3296 | static int | |
3297 | sel_target_adjust_priority (expr_t expr) | |
3298 | { | |
3299 | int priority = EXPR_PRIORITY (expr); | |
3300 | int new_priority; | |
3301 | ||
3302 | if (targetm.sched.adjust_priority) | |
3303 | new_priority = targetm.sched.adjust_priority (EXPR_INSN_RTX (expr), priority); | |
3304 | else | |
3305 | new_priority = priority; | |
3306 | ||
3307 | /* If the priority has changed, adjust EXPR_PRIORITY_ADJ accordingly. */ | |
3308 | EXPR_PRIORITY_ADJ (expr) = new_priority - EXPR_PRIORITY (expr); | |
3309 | ||
3310 | gcc_assert (EXPR_PRIORITY_ADJ (expr) >= 0); | |
3311 | ||
136e01a3 AB |
3312 | if (sched_verbose >= 4) |
3313 | sel_print ("sel_target_adjust_priority: insn %d, %d+%d = %d.\n", | |
b8698a0f | 3314 | INSN_UID (EXPR_INSN_RTX (expr)), EXPR_PRIORITY (expr), |
e855c69d AB |
3315 | EXPR_PRIORITY_ADJ (expr), new_priority); |
3316 | ||
3317 | return new_priority; | |
3318 | } | |
3319 | ||
3320 | /* Rank two available exprs for schedule. Never return 0 here. */ | |
b8698a0f | 3321 | static int |
e855c69d AB |
3322 | sel_rank_for_schedule (const void *x, const void *y) |
3323 | { | |
3324 | expr_t tmp = *(const expr_t *) y; | |
3325 | expr_t tmp2 = *(const expr_t *) x; | |
3326 | insn_t tmp_insn, tmp2_insn; | |
3327 | vinsn_t tmp_vinsn, tmp2_vinsn; | |
3328 | int val; | |
3329 | ||
3330 | tmp_vinsn = EXPR_VINSN (tmp); | |
3331 | tmp2_vinsn = EXPR_VINSN (tmp2); | |
3332 | tmp_insn = EXPR_INSN_RTX (tmp); | |
3333 | tmp2_insn = EXPR_INSN_RTX (tmp2); | |
b8698a0f | 3334 | |
b5b8b0ac AO |
3335 | /* Schedule debug insns as early as possible. */ |
3336 | if (DEBUG_INSN_P (tmp_insn) && !DEBUG_INSN_P (tmp2_insn)) | |
3337 | return -1; | |
3338 | else if (DEBUG_INSN_P (tmp2_insn)) | |
3339 | return 1; | |
3340 | ||
e855c69d AB |
3341 | /* Prefer SCHED_GROUP_P insns to any others. */ |
3342 | if (SCHED_GROUP_P (tmp_insn) != SCHED_GROUP_P (tmp2_insn)) | |
3343 | { | |
b8698a0f | 3344 | if (VINSN_UNIQUE_P (tmp_vinsn) && VINSN_UNIQUE_P (tmp2_vinsn)) |
e855c69d AB |
3345 | return SCHED_GROUP_P (tmp2_insn) ? 1 : -1; |
3346 | ||
3347 | /* Now uniqueness means SCHED_GROUP_P is set, because schedule groups | |
3348 | cannot be cloned. */ | |
3349 | if (VINSN_UNIQUE_P (tmp2_vinsn)) | |
3350 | return 1; | |
3351 | return -1; | |
3352 | } | |
3353 | ||
3354 | /* Discourage scheduling of speculative checks. */ | |
3355 | val = (sel_insn_is_speculation_check (tmp_insn) | |
3356 | - sel_insn_is_speculation_check (tmp2_insn)); | |
3357 | if (val) | |
3358 | return val; | |
3359 | ||
3360 | /* Prefer not scheduled insn over scheduled one. */ | |
3361 | if (EXPR_SCHED_TIMES (tmp) > 0 || EXPR_SCHED_TIMES (tmp2) > 0) | |
3362 | { | |
3363 | val = EXPR_SCHED_TIMES (tmp) - EXPR_SCHED_TIMES (tmp2); | |
3364 | if (val) | |
3365 | return val; | |
3366 | } | |
3367 | ||
3368 | /* Prefer jump over non-jump instruction. */ | |
3369 | if (control_flow_insn_p (tmp_insn) && !control_flow_insn_p (tmp2_insn)) | |
3370 | return -1; | |
3371 | else if (control_flow_insn_p (tmp2_insn) && !control_flow_insn_p (tmp_insn)) | |
3372 | return 1; | |
3373 | ||
3374 | /* Prefer an expr with greater priority. */ | |
3375 | if (EXPR_USEFULNESS (tmp) != 0 && EXPR_USEFULNESS (tmp2) != 0) | |
3376 | { | |
3377 | int p2 = EXPR_PRIORITY (tmp2) + EXPR_PRIORITY_ADJ (tmp2), | |
3378 | p1 = EXPR_PRIORITY (tmp) + EXPR_PRIORITY_ADJ (tmp); | |
3379 | ||
3380 | val = p2 * EXPR_USEFULNESS (tmp2) - p1 * EXPR_USEFULNESS (tmp); | |
3381 | } | |
3382 | else | |
b8698a0f | 3383 | val = EXPR_PRIORITY (tmp2) - EXPR_PRIORITY (tmp) |
e855c69d AB |
3384 | + EXPR_PRIORITY_ADJ (tmp2) - EXPR_PRIORITY_ADJ (tmp); |
3385 | if (val) | |
3386 | return val; | |
3387 | ||
3388 | if (spec_info != NULL && spec_info->mask != 0) | |
3389 | /* This code was taken from haifa-sched.c: rank_for_schedule (). */ | |
3390 | { | |
3391 | ds_t ds1, ds2; | |
3392 | dw_t dw1, dw2; | |
3393 | int dw; | |
3394 | ||
3395 | ds1 = EXPR_SPEC_DONE_DS (tmp); | |
3396 | if (ds1) | |
3397 | dw1 = ds_weak (ds1); | |
3398 | else | |
3399 | dw1 = NO_DEP_WEAK; | |
3400 | ||
3401 | ds2 = EXPR_SPEC_DONE_DS (tmp2); | |
3402 | if (ds2) | |
3403 | dw2 = ds_weak (ds2); | |
3404 | else | |
3405 | dw2 = NO_DEP_WEAK; | |
3406 | ||
3407 | dw = dw2 - dw1; | |
3408 | if (dw > (NO_DEP_WEAK / 8) || dw < -(NO_DEP_WEAK / 8)) | |
3409 | return dw; | |
3410 | } | |
3411 | ||
e855c69d | 3412 | /* Prefer an old insn to a bookkeeping insn. */ |
b8698a0f | 3413 | if (INSN_UID (tmp_insn) < first_emitted_uid |
e855c69d AB |
3414 | && INSN_UID (tmp2_insn) >= first_emitted_uid) |
3415 | return -1; | |
b8698a0f | 3416 | if (INSN_UID (tmp_insn) >= first_emitted_uid |
e855c69d AB |
3417 | && INSN_UID (tmp2_insn) < first_emitted_uid) |
3418 | return 1; | |
3419 | ||
b8698a0f | 3420 | /* Prefer an insn with smaller UID, as a last resort. |
e855c69d AB |
3421 | We can't safely use INSN_LUID as it is defined only for those insns |
3422 | that are in the stream. */ | |
3423 | return INSN_UID (tmp_insn) - INSN_UID (tmp2_insn); | |
3424 | } | |
3425 | ||
b8698a0f | 3426 | /* Filter out expressions from av set pointed to by AV_PTR |
e855c69d AB |
3427 | that are pipelined too many times. */ |
3428 | static void | |
3429 | process_pipelined_exprs (av_set_t *av_ptr) | |
3430 | { | |
3431 | expr_t expr; | |
3432 | av_set_iterator si; | |
3433 | ||
3434 | /* Don't pipeline already pipelined code as that would increase | |
b8698a0f | 3435 | number of unnecessary register moves. */ |
e855c69d AB |
3436 | FOR_EACH_EXPR_1 (expr, si, av_ptr) |
3437 | { | |
3438 | if (EXPR_SCHED_TIMES (expr) | |
3439 | >= PARAM_VALUE (PARAM_SELSCHED_MAX_SCHED_TIMES)) | |
3440 | av_set_iter_remove (&si); | |
3441 | } | |
3442 | } | |
3443 | ||
3444 | /* Filter speculative insns from AV_PTR if we don't want them. */ | |
3445 | static void | |
3446 | process_spec_exprs (av_set_t *av_ptr) | |
3447 | { | |
3448 | bool try_data_p = true; | |
3449 | bool try_control_p = true; | |
3450 | expr_t expr; | |
3451 | av_set_iterator si; | |
3452 | ||
3453 | if (spec_info == NULL) | |
3454 | return; | |
3455 | ||
3456 | /* Scan *AV_PTR to find out if we want to consider speculative | |
3457 | instructions for scheduling. */ | |
3458 | FOR_EACH_EXPR_1 (expr, si, av_ptr) | |
3459 | { | |
3460 | ds_t ds; | |
3461 | ||
3462 | ds = EXPR_SPEC_DONE_DS (expr); | |
3463 | ||
3464 | /* The probability of a success is too low - don't speculate. */ | |
3465 | if ((ds & SPECULATIVE) | |
3466 | && (ds_weak (ds) < spec_info->data_weakness_cutoff | |
3467 | || EXPR_USEFULNESS (expr) < spec_info->control_weakness_cutoff | |
3468 | || (pipelining_p && false | |
3469 | && (ds & DATA_SPEC) | |
3470 | && (ds & CONTROL_SPEC)))) | |
3471 | { | |
3472 | av_set_iter_remove (&si); | |
3473 | continue; | |
3474 | } | |
3475 | ||
3476 | if ((spec_info->flags & PREFER_NON_DATA_SPEC) | |
3477 | && !(ds & BEGIN_DATA)) | |
3478 | try_data_p = false; | |
3479 | ||
3480 | if ((spec_info->flags & PREFER_NON_CONTROL_SPEC) | |
3481 | && !(ds & BEGIN_CONTROL)) | |
3482 | try_control_p = false; | |
3483 | } | |
3484 | ||
3485 | FOR_EACH_EXPR_1 (expr, si, av_ptr) | |
3486 | { | |
3487 | ds_t ds; | |
3488 | ||
3489 | ds = EXPR_SPEC_DONE_DS (expr); | |
3490 | ||
3491 | if (ds & SPECULATIVE) | |
3492 | { | |
3493 | if ((ds & BEGIN_DATA) && !try_data_p) | |
3494 | /* We don't want any data speculative instructions right | |
3495 | now. */ | |
3496 | av_set_iter_remove (&si); | |
3497 | ||
3498 | if ((ds & BEGIN_CONTROL) && !try_control_p) | |
3499 | /* We don't want any control speculative instructions right | |
3500 | now. */ | |
3501 | av_set_iter_remove (&si); | |
3502 | } | |
3503 | } | |
3504 | } | |
3505 | ||
b8698a0f L |
3506 | /* Search for any use-like insns in AV_PTR and decide on scheduling |
3507 | them. Return one when found, and NULL otherwise. | |
e855c69d AB |
3508 | Note that we check here whether a USE could be scheduled to avoid |
3509 | an infinite loop later. */ | |
3510 | static expr_t | |
3511 | process_use_exprs (av_set_t *av_ptr) | |
3512 | { | |
3513 | expr_t expr; | |
3514 | av_set_iterator si; | |
3515 | bool uses_present_p = false; | |
3516 | bool try_uses_p = true; | |
3517 | ||
3518 | FOR_EACH_EXPR_1 (expr, si, av_ptr) | |
3519 | { | |
3520 | /* This will also initialize INSN_CODE for later use. */ | |
3521 | if (recog_memoized (EXPR_INSN_RTX (expr)) < 0) | |
3522 | { | |
3523 | /* If we have a USE in *AV_PTR that was not scheduled yet, | |
3524 | do so because it will do good only. */ | |
3525 | if (EXPR_SCHED_TIMES (expr) <= 0) | |
3526 | { | |
3527 | if (EXPR_TARGET_AVAILABLE (expr) == 1) | |
3528 | return expr; | |
3529 | ||
3530 | av_set_iter_remove (&si); | |
3531 | } | |
3532 | else | |
3533 | { | |
3534 | gcc_assert (pipelining_p); | |
3535 | ||
3536 | uses_present_p = true; | |
3537 | } | |
3538 | } | |
3539 | else | |
3540 | try_uses_p = false; | |
3541 | } | |
3542 | ||
3543 | if (uses_present_p) | |
3544 | { | |
3545 | /* If we don't want to schedule any USEs right now and we have some | |
3546 | in *AV_PTR, remove them, else just return the first one found. */ | |
3547 | if (!try_uses_p) | |
3548 | { | |
3549 | FOR_EACH_EXPR_1 (expr, si, av_ptr) | |
3550 | if (INSN_CODE (EXPR_INSN_RTX (expr)) < 0) | |
3551 | av_set_iter_remove (&si); | |
3552 | } | |
3553 | else | |
3554 | { | |
3555 | FOR_EACH_EXPR_1 (expr, si, av_ptr) | |
3556 | { | |
3557 | gcc_assert (INSN_CODE (EXPR_INSN_RTX (expr)) < 0); | |
3558 | ||
3559 | if (EXPR_TARGET_AVAILABLE (expr) == 1) | |
3560 | return expr; | |
3561 | ||
3562 | av_set_iter_remove (&si); | |
3563 | } | |
3564 | } | |
3565 | } | |
3566 | ||
3567 | return NULL; | |
3568 | } | |
3569 | ||
3570 | /* Lookup EXPR in VINSN_VEC and return TRUE if found. */ | |
3571 | static bool | |
3572 | vinsn_vec_has_expr_p (vinsn_vec_t vinsn_vec, expr_t expr) | |
3573 | { | |
3574 | vinsn_t vinsn; | |
3575 | int n; | |
3576 | ||
ac47786e | 3577 | FOR_EACH_VEC_ELT (vinsn_t, vinsn_vec, n, vinsn) |
e855c69d AB |
3578 | if (VINSN_SEPARABLE_P (vinsn)) |
3579 | { | |
3580 | if (vinsn_equal_p (vinsn, EXPR_VINSN (expr))) | |
3581 | return true; | |
3582 | } | |
3583 | else | |
3584 | { | |
3585 | /* For non-separable instructions, the blocking insn can have | |
3586 | another pattern due to substitution, and we can't choose | |
3587 | different register as in the above case. Check all registers | |
3588 | being written instead. */ | |
b8698a0f | 3589 | if (bitmap_intersect_p (VINSN_REG_SETS (vinsn), |
e855c69d AB |
3590 | VINSN_REG_SETS (EXPR_VINSN (expr)))) |
3591 | return true; | |
3592 | } | |
3593 | ||
3594 | return false; | |
3595 | } | |
3596 | ||
3597 | #ifdef ENABLE_CHECKING | |
3598 | /* Return true if either of expressions from ORIG_OPS can be blocked | |
3599 | by previously created bookkeeping code. STATIC_PARAMS points to static | |
3600 | parameters of move_op. */ | |
3601 | static bool | |
3602 | av_set_could_be_blocked_by_bookkeeping_p (av_set_t orig_ops, void *static_params) | |
3603 | { | |
3604 | expr_t expr; | |
3605 | av_set_iterator iter; | |
3606 | moveop_static_params_p sparams; | |
3607 | ||
3608 | /* This checks that expressions in ORIG_OPS are not blocked by bookkeeping | |
3609 | created while scheduling on another fence. */ | |
3610 | FOR_EACH_EXPR (expr, iter, orig_ops) | |
3611 | if (vinsn_vec_has_expr_p (vec_bookkeeping_blocked_vinsns, expr)) | |
3612 | return true; | |
3613 | ||
3614 | gcc_assert (code_motion_path_driver_info == &move_op_hooks); | |
3615 | sparams = (moveop_static_params_p) static_params; | |
3616 | ||
3617 | /* Expressions can be also blocked by bookkeeping created during current | |
3618 | move_op. */ | |
3619 | if (bitmap_bit_p (current_copies, INSN_UID (sparams->failed_insn))) | |
3620 | FOR_EACH_EXPR (expr, iter, orig_ops) | |
3621 | if (moveup_expr_cached (expr, sparams->failed_insn, false) != MOVEUP_EXPR_NULL) | |
3622 | return true; | |
3623 | ||
3624 | /* Expressions in ORIG_OPS may have wrong destination register due to | |
3625 | renaming. Check with the right register instead. */ | |
3626 | if (sparams->dest && REG_P (sparams->dest)) | |
3627 | { | |
3628 | unsigned regno = REGNO (sparams->dest); | |
3629 | vinsn_t failed_vinsn = INSN_VINSN (sparams->failed_insn); | |
3630 | ||
3631 | if (bitmap_bit_p (VINSN_REG_SETS (failed_vinsn), regno) | |
3632 | || bitmap_bit_p (VINSN_REG_USES (failed_vinsn), regno) | |
3633 | || bitmap_bit_p (VINSN_REG_CLOBBERS (failed_vinsn), regno)) | |
3634 | return true; | |
3635 | } | |
3636 | ||
3637 | return false; | |
3638 | } | |
3639 | #endif | |
3640 | ||
3641 | /* Clear VINSN_VEC and detach vinsns. */ | |
3642 | static void | |
3643 | vinsn_vec_clear (vinsn_vec_t *vinsn_vec) | |
3644 | { | |
3645 | unsigned len = VEC_length (vinsn_t, *vinsn_vec); | |
3646 | if (len > 0) | |
3647 | { | |
3648 | vinsn_t vinsn; | |
3649 | int n; | |
b8698a0f | 3650 | |
ac47786e | 3651 | FOR_EACH_VEC_ELT (vinsn_t, *vinsn_vec, n, vinsn) |
e855c69d AB |
3652 | vinsn_detach (vinsn); |
3653 | VEC_block_remove (vinsn_t, *vinsn_vec, 0, len); | |
3654 | } | |
3655 | } | |
3656 | ||
3657 | /* Add the vinsn of EXPR to the VINSN_VEC. */ | |
3658 | static void | |
3659 | vinsn_vec_add (vinsn_vec_t *vinsn_vec, expr_t expr) | |
3660 | { | |
3661 | vinsn_attach (EXPR_VINSN (expr)); | |
3662 | VEC_safe_push (vinsn_t, heap, *vinsn_vec, EXPR_VINSN (expr)); | |
3663 | } | |
3664 | ||
b8698a0f | 3665 | /* Free the vector representing blocked expressions. */ |
e855c69d AB |
3666 | static void |
3667 | vinsn_vec_free (vinsn_vec_t *vinsn_vec) | |
3668 | { | |
3669 | if (*vinsn_vec) | |
3670 | VEC_free (vinsn_t, heap, *vinsn_vec); | |
3671 | } | |
3672 | ||
3673 | /* Increase EXPR_PRIORITY_ADJ for INSN by AMOUNT. */ | |
3674 | ||
3675 | void sel_add_to_insn_priority (rtx insn, int amount) | |
3676 | { | |
3677 | EXPR_PRIORITY_ADJ (INSN_EXPR (insn)) += amount; | |
3678 | ||
3679 | if (sched_verbose >= 2) | |
b8698a0f | 3680 | sel_print ("sel_add_to_insn_priority: insn %d, by %d (now %d+%d).\n", |
e855c69d AB |
3681 | INSN_UID (insn), amount, EXPR_PRIORITY (INSN_EXPR (insn)), |
3682 | EXPR_PRIORITY_ADJ (INSN_EXPR (insn))); | |
3683 | } | |
3684 | ||
b8698a0f | 3685 | /* Turn AV into a vector, filter inappropriate insns and sort it. Return |
e855c69d AB |
3686 | true if there is something to schedule. BNDS and FENCE are current |
3687 | boundaries and fence, respectively. If we need to stall for some cycles | |
b8698a0f | 3688 | before an expr from AV would become available, write this number to |
e855c69d AB |
3689 | *PNEED_STALL. */ |
3690 | static bool | |
3691 | fill_vec_av_set (av_set_t av, blist_t bnds, fence_t fence, | |
3692 | int *pneed_stall) | |
3693 | { | |
3694 | av_set_iterator si; | |
3695 | expr_t expr; | |
3696 | int sched_next_worked = 0, stalled, n; | |
3697 | static int av_max_prio, est_ticks_till_branch; | |
3698 | int min_need_stall = -1; | |
3699 | deps_t dc = BND_DC (BLIST_BND (bnds)); | |
3700 | ||
3701 | /* Bail out early when the ready list contained only USEs/CLOBBERs that are | |
3702 | already scheduled. */ | |
3703 | if (av == NULL) | |
3704 | return false; | |
3705 | ||
3706 | /* Empty vector from the previous stuff. */ | |
3707 | if (VEC_length (expr_t, vec_av_set) > 0) | |
3708 | VEC_block_remove (expr_t, vec_av_set, 0, VEC_length (expr_t, vec_av_set)); | |
3709 | ||
3710 | /* Turn the set into a vector for sorting and call sel_target_adjust_priority | |
3711 | for each insn. */ | |
3712 | gcc_assert (VEC_empty (expr_t, vec_av_set)); | |
3713 | FOR_EACH_EXPR (expr, si, av) | |
b8698a0f | 3714 | { |
e855c69d AB |
3715 | VEC_safe_push (expr_t, heap, vec_av_set, expr); |
3716 | ||
3717 | gcc_assert (EXPR_PRIORITY_ADJ (expr) == 0 || *pneed_stall); | |
3718 | ||
3719 | /* Adjust priority using target backend hook. */ | |
3720 | sel_target_adjust_priority (expr); | |
3721 | } | |
3722 | ||
3723 | /* Sort the vector. */ | |
5095da95 | 3724 | VEC_qsort (expr_t, vec_av_set, sel_rank_for_schedule); |
e855c69d AB |
3725 | |
3726 | /* We record maximal priority of insns in av set for current instruction | |
3727 | group. */ | |
3728 | if (FENCE_STARTS_CYCLE_P (fence)) | |
3729 | av_max_prio = est_ticks_till_branch = INT_MIN; | |
3730 | ||
3731 | /* Filter out inappropriate expressions. Loop's direction is reversed to | |
3732 | visit "best" instructions first. We assume that VEC_unordered_remove | |
3733 | moves last element in place of one being deleted. */ | |
3734 | for (n = VEC_length (expr_t, vec_av_set) - 1, stalled = 0; n >= 0; n--) | |
3735 | { | |
3736 | expr_t expr = VEC_index (expr_t, vec_av_set, n); | |
3737 | insn_t insn = EXPR_INSN_RTX (expr); | |
3738 | char target_available; | |
3739 | bool is_orig_reg_p = true; | |
3740 | int need_cycles, new_prio; | |
3741 | ||
3742 | /* Don't allow any insns other than from SCHED_GROUP if we have one. */ | |
3743 | if (FENCE_SCHED_NEXT (fence) && insn != FENCE_SCHED_NEXT (fence)) | |
3744 | { | |
3745 | VEC_unordered_remove (expr_t, vec_av_set, n); | |
3746 | continue; | |
3747 | } | |
3748 | ||
b8698a0f | 3749 | /* Set number of sched_next insns (just in case there |
e855c69d AB |
3750 | could be several). */ |
3751 | if (FENCE_SCHED_NEXT (fence)) | |
3752 | sched_next_worked++; | |
b8698a0f L |
3753 | |
3754 | /* Check all liveness requirements and try renaming. | |
e855c69d AB |
3755 | FIXME: try to minimize calls to this. */ |
3756 | target_available = EXPR_TARGET_AVAILABLE (expr); | |
3757 | ||
3758 | /* If insn was already scheduled on the current fence, | |
3759 | set TARGET_AVAILABLE to -1 no matter what expr's attribute says. */ | |
3760 | if (vinsn_vec_has_expr_p (vec_target_unavailable_vinsns, expr)) | |
3761 | target_available = -1; | |
3762 | ||
3763 | /* If the availability of the EXPR is invalidated by the insertion of | |
3764 | bookkeeping earlier, make sure that we won't choose this expr for | |
3765 | scheduling if it's not separable, and if it is separable, then | |
3766 | we have to recompute the set of available registers for it. */ | |
3767 | if (vinsn_vec_has_expr_p (vec_bookkeeping_blocked_vinsns, expr)) | |
3768 | { | |
3769 | VEC_unordered_remove (expr_t, vec_av_set, n); | |
3770 | if (sched_verbose >= 4) | |
3771 | sel_print ("Expr %d is blocked by bookkeeping inserted earlier\n", | |
3772 | INSN_UID (insn)); | |
3773 | continue; | |
3774 | } | |
b8698a0f | 3775 | |
e855c69d AB |
3776 | if (target_available == true) |
3777 | { | |
3778 | /* Do nothing -- we can use an existing register. */ | |
3779 | is_orig_reg_p = EXPR_SEPARABLE_P (expr); | |
3780 | } | |
b8698a0f | 3781 | else if (/* Non-separable instruction will never |
e855c69d AB |
3782 | get another register. */ |
3783 | (target_available == false | |
3784 | && !EXPR_SEPARABLE_P (expr)) | |
3785 | /* Don't try to find a register for low-priority expression. */ | |
3786 | || (int) VEC_length (expr_t, vec_av_set) - 1 - n >= max_insns_to_rename | |
3787 | /* ??? FIXME: Don't try to rename data speculation. */ | |
3788 | || (EXPR_SPEC_DONE_DS (expr) & BEGIN_DATA) | |
3789 | || ! find_best_reg_for_expr (expr, bnds, &is_orig_reg_p)) | |
3790 | { | |
3791 | VEC_unordered_remove (expr_t, vec_av_set, n); | |
3792 | if (sched_verbose >= 4) | |
b8698a0f | 3793 | sel_print ("Expr %d has no suitable target register\n", |
e855c69d AB |
3794 | INSN_UID (insn)); |
3795 | continue; | |
3796 | } | |
3797 | ||
3798 | /* Filter expressions that need to be renamed or speculated when | |
3799 | pipelining, because compensating register copies or speculation | |
3800 | checks are likely to be placed near the beginning of the loop, | |
3801 | causing a stall. */ | |
3802 | if (pipelining_p && EXPR_ORIG_SCHED_CYCLE (expr) > 0 | |
3803 | && (!is_orig_reg_p || EXPR_SPEC_DONE_DS (expr) != 0)) | |
3804 | { | |
3805 | /* Estimation of number of cycles until loop branch for | |
3806 | renaming/speculation to be successful. */ | |
3807 | int need_n_ticks_till_branch = sel_vinsn_cost (EXPR_VINSN (expr)); | |
3808 | ||
3809 | if ((int) current_loop_nest->ninsns < 9) | |
3810 | { | |
3811 | VEC_unordered_remove (expr_t, vec_av_set, n); | |
3812 | if (sched_verbose >= 4) | |
3813 | sel_print ("Pipelining expr %d will likely cause stall\n", | |
3814 | INSN_UID (insn)); | |
3815 | continue; | |
3816 | } | |
3817 | ||
3818 | if ((int) current_loop_nest->ninsns - num_insns_scheduled | |
3819 | < need_n_ticks_till_branch * issue_rate / 2 | |
3820 | && est_ticks_till_branch < need_n_ticks_till_branch) | |
3821 | { | |
3822 | VEC_unordered_remove (expr_t, vec_av_set, n); | |
3823 | if (sched_verbose >= 4) | |
3824 | sel_print ("Pipelining expr %d will likely cause stall\n", | |
3825 | INSN_UID (insn)); | |
3826 | continue; | |
3827 | } | |
3828 | } | |
3829 | ||
3830 | /* We want to schedule speculation checks as late as possible. Discard | |
3831 | them from av set if there are instructions with higher priority. */ | |
3832 | if (sel_insn_is_speculation_check (insn) | |
3833 | && EXPR_PRIORITY (expr) < av_max_prio) | |
3834 | { | |
3835 | stalled++; | |
3836 | min_need_stall = min_need_stall < 0 ? 1 : MIN (min_need_stall, 1); | |
3837 | VEC_unordered_remove (expr_t, vec_av_set, n); | |
3838 | if (sched_verbose >= 4) | |
3839 | sel_print ("Delaying speculation check %d until its first use\n", | |
3840 | INSN_UID (insn)); | |
3841 | continue; | |
3842 | } | |
3843 | ||
3844 | /* Ignore EXPRs available from pipelining to update AV_MAX_PRIO. */ | |
3845 | if (EXPR_ORIG_SCHED_CYCLE (expr) <= 0) | |
3846 | av_max_prio = MAX (av_max_prio, EXPR_PRIORITY (expr)); | |
3847 | ||
3848 | /* Don't allow any insns whose data is not yet ready. | |
3849 | Check first whether we've already tried them and failed. */ | |
3850 | if (INSN_UID (insn) < FENCE_READY_TICKS_SIZE (fence)) | |
3851 | { | |
3852 | need_cycles = (FENCE_READY_TICKS (fence)[INSN_UID (insn)] | |
3853 | - FENCE_CYCLE (fence)); | |
3854 | if (EXPR_ORIG_SCHED_CYCLE (expr) <= 0) | |
3855 | est_ticks_till_branch = MAX (est_ticks_till_branch, | |
3856 | EXPR_PRIORITY (expr) + need_cycles); | |
3857 | ||
3858 | if (need_cycles > 0) | |
3859 | { | |
3860 | stalled++; | |
b8698a0f | 3861 | min_need_stall = (min_need_stall < 0 |
e855c69d AB |
3862 | ? need_cycles |
3863 | : MIN (min_need_stall, need_cycles)); | |
3864 | VEC_unordered_remove (expr_t, vec_av_set, n); | |
3865 | ||
3866 | if (sched_verbose >= 4) | |
b8698a0f | 3867 | sel_print ("Expr %d is not ready until cycle %d (cached)\n", |
e855c69d AB |
3868 | INSN_UID (insn), |
3869 | FENCE_READY_TICKS (fence)[INSN_UID (insn)]); | |
3870 | continue; | |
3871 | } | |
3872 | } | |
3873 | ||
b8698a0f | 3874 | /* Now resort to dependence analysis to find whether EXPR might be |
e855c69d AB |
3875 | stalled due to dependencies from FENCE's context. */ |
3876 | need_cycles = tick_check_p (expr, dc, fence); | |
3877 | new_prio = EXPR_PRIORITY (expr) + EXPR_PRIORITY_ADJ (expr) + need_cycles; | |
3878 | ||
3879 | if (EXPR_ORIG_SCHED_CYCLE (expr) <= 0) | |
3880 | est_ticks_till_branch = MAX (est_ticks_till_branch, | |
3881 | new_prio); | |
3882 | ||
3883 | if (need_cycles > 0) | |
3884 | { | |
3885 | if (INSN_UID (insn) >= FENCE_READY_TICKS_SIZE (fence)) | |
3886 | { | |
3887 | int new_size = INSN_UID (insn) * 3 / 2; | |
b8698a0f L |
3888 | |
3889 | FENCE_READY_TICKS (fence) | |
e855c69d AB |
3890 | = (int *) xrecalloc (FENCE_READY_TICKS (fence), |
3891 | new_size, FENCE_READY_TICKS_SIZE (fence), | |
3892 | sizeof (int)); | |
3893 | } | |
b8698a0f L |
3894 | FENCE_READY_TICKS (fence)[INSN_UID (insn)] |
3895 | = FENCE_CYCLE (fence) + need_cycles; | |
3896 | ||
e855c69d | 3897 | stalled++; |
b8698a0f | 3898 | min_need_stall = (min_need_stall < 0 |
e855c69d AB |
3899 | ? need_cycles |
3900 | : MIN (min_need_stall, need_cycles)); | |
3901 | ||
3902 | VEC_unordered_remove (expr_t, vec_av_set, n); | |
b8698a0f | 3903 | |
e855c69d | 3904 | if (sched_verbose >= 4) |
b8698a0f | 3905 | sel_print ("Expr %d is not ready yet until cycle %d\n", |
e855c69d AB |
3906 | INSN_UID (insn), |
3907 | FENCE_READY_TICKS (fence)[INSN_UID (insn)]); | |
3908 | continue; | |
3909 | } | |
3910 | ||
3911 | if (sched_verbose >= 4) | |
3912 | sel_print ("Expr %d is ok\n", INSN_UID (insn)); | |
3913 | min_need_stall = 0; | |
3914 | } | |
3915 | ||
3916 | /* Clear SCHED_NEXT. */ | |
3917 | if (FENCE_SCHED_NEXT (fence)) | |
3918 | { | |
3919 | gcc_assert (sched_next_worked == 1); | |
3920 | FENCE_SCHED_NEXT (fence) = NULL_RTX; | |
3921 | } | |
3922 | ||
3923 | /* No need to stall if this variable was not initialized. */ | |
3924 | if (min_need_stall < 0) | |
3925 | min_need_stall = 0; | |
3926 | ||
3927 | if (VEC_empty (expr_t, vec_av_set)) | |
3928 | { | |
3929 | /* We need to set *pneed_stall here, because later we skip this code | |
3930 | when ready list is empty. */ | |
3931 | *pneed_stall = min_need_stall; | |
3932 | return false; | |
3933 | } | |
3934 | else | |
3935 | gcc_assert (min_need_stall == 0); | |
3936 | ||
3937 | /* Sort the vector. */ | |
5095da95 | 3938 | VEC_qsort (expr_t, vec_av_set, sel_rank_for_schedule); |
b8698a0f | 3939 | |
e855c69d AB |
3940 | if (sched_verbose >= 4) |
3941 | { | |
b8698a0f | 3942 | sel_print ("Total ready exprs: %d, stalled: %d\n", |
e855c69d AB |
3943 | VEC_length (expr_t, vec_av_set), stalled); |
3944 | sel_print ("Sorted av set (%d): ", VEC_length (expr_t, vec_av_set)); | |
ac47786e | 3945 | FOR_EACH_VEC_ELT (expr_t, vec_av_set, n, expr) |
e855c69d AB |
3946 | dump_expr (expr); |
3947 | sel_print ("\n"); | |
3948 | } | |
3949 | ||
3950 | *pneed_stall = 0; | |
3951 | return true; | |
3952 | } | |
3953 | ||
3954 | /* Convert a vectored and sorted av set to the ready list that | |
3955 | the rest of the backend wants to see. */ | |
3956 | static void | |
3957 | convert_vec_av_set_to_ready (void) | |
3958 | { | |
3959 | int n; | |
3960 | expr_t expr; | |
3961 | ||
3962 | /* Allocate and fill the ready list from the sorted vector. */ | |
3963 | ready.n_ready = VEC_length (expr_t, vec_av_set); | |
3964 | ready.first = ready.n_ready - 1; | |
b8698a0f | 3965 | |
e855c69d AB |
3966 | gcc_assert (ready.n_ready > 0); |
3967 | ||
3968 | if (ready.n_ready > max_issue_size) | |
3969 | { | |
3970 | max_issue_size = ready.n_ready; | |
3971 | sched_extend_ready_list (ready.n_ready); | |
3972 | } | |
b8698a0f | 3973 | |
ac47786e | 3974 | FOR_EACH_VEC_ELT (expr_t, vec_av_set, n, expr) |
e855c69d AB |
3975 | { |
3976 | vinsn_t vi = EXPR_VINSN (expr); | |
3977 | insn_t insn = VINSN_INSN_RTX (vi); | |
3978 | ||
3979 | ready_try[n] = 0; | |
3980 | ready.vec[n] = insn; | |
3981 | } | |
3982 | } | |
3983 | ||
3984 | /* Initialize ready list from *AV_PTR for the max_issue () call. | |
3985 | If any unrecognizable insn found in *AV_PTR, return it (and skip | |
b8698a0f L |
3986 | max_issue). BND and FENCE are current boundary and fence, |
3987 | respectively. If we need to stall for some cycles before an expr | |
e855c69d AB |
3988 | from *AV_PTR would become available, write this number to *PNEED_STALL. */ |
3989 | static expr_t | |
3990 | fill_ready_list (av_set_t *av_ptr, blist_t bnds, fence_t fence, | |
3991 | int *pneed_stall) | |
3992 | { | |
3993 | expr_t expr; | |
3994 | ||
3995 | /* We do not support multiple boundaries per fence. */ | |
3996 | gcc_assert (BLIST_NEXT (bnds) == NULL); | |
3997 | ||
b8698a0f | 3998 | /* Process expressions required special handling, i.e. pipelined, |
e855c69d AB |
3999 | speculative and recog() < 0 expressions first. */ |
4000 | process_pipelined_exprs (av_ptr); | |
4001 | process_spec_exprs (av_ptr); | |
4002 | ||
4003 | /* A USE could be scheduled immediately. */ | |
4004 | expr = process_use_exprs (av_ptr); | |
4005 | if (expr) | |
4006 | { | |
4007 | *pneed_stall = 0; | |
4008 | return expr; | |
4009 | } | |
4010 | ||
4011 | /* Turn the av set to a vector for sorting. */ | |
4012 | if (! fill_vec_av_set (*av_ptr, bnds, fence, pneed_stall)) | |
4013 | { | |
4014 | ready.n_ready = 0; | |
4015 | return NULL; | |
4016 | } | |
4017 | ||
4018 | /* Build the final ready list. */ | |
4019 | convert_vec_av_set_to_ready (); | |
4020 | return NULL; | |
4021 | } | |
4022 | ||
4023 | /* Wrapper for dfa_new_cycle (). Returns TRUE if cycle was advanced. */ | |
4024 | static bool | |
4025 | sel_dfa_new_cycle (insn_t insn, fence_t fence) | |
4026 | { | |
b8698a0f L |
4027 | int last_scheduled_cycle = FENCE_LAST_SCHEDULED_INSN (fence) |
4028 | ? INSN_SCHED_CYCLE (FENCE_LAST_SCHEDULED_INSN (fence)) | |
e855c69d AB |
4029 | : FENCE_CYCLE (fence) - 1; |
4030 | bool res = false; | |
4031 | int sort_p = 0; | |
4032 | ||
4033 | if (!targetm.sched.dfa_new_cycle) | |
4034 | return false; | |
4035 | ||
4036 | memcpy (curr_state, FENCE_STATE (fence), dfa_state_size); | |
4037 | ||
4038 | while (!sort_p && targetm.sched.dfa_new_cycle (sched_dump, sched_verbose, | |
4039 | insn, last_scheduled_cycle, | |
4040 | FENCE_CYCLE (fence), &sort_p)) | |
4041 | { | |
4042 | memcpy (FENCE_STATE (fence), curr_state, dfa_state_size); | |
4043 | advance_one_cycle (fence); | |
4044 | memcpy (curr_state, FENCE_STATE (fence), dfa_state_size); | |
4045 | res = true; | |
4046 | } | |
4047 | ||
4048 | return res; | |
4049 | } | |
4050 | ||
4051 | /* Invoke reorder* target hooks on the ready list. Return the number of insns | |
4052 | we can issue. FENCE is the current fence. */ | |
4053 | static int | |
4054 | invoke_reorder_hooks (fence_t fence) | |
4055 | { | |
4056 | int issue_more; | |
4057 | bool ran_hook = false; | |
4058 | ||
4059 | /* Call the reorder hook at the beginning of the cycle, and call | |
4060 | the reorder2 hook in the middle of the cycle. */ | |
4061 | if (FENCE_ISSUED_INSNS (fence) == 0) | |
4062 | { | |
4063 | if (targetm.sched.reorder | |
4064 | && !SCHED_GROUP_P (ready_element (&ready, 0)) | |
4065 | && ready.n_ready > 1) | |
4066 | { | |
4067 | /* Don't give reorder the most prioritized insn as it can break | |
4068 | pipelining. */ | |
4069 | if (pipelining_p) | |
4070 | --ready.n_ready; | |
4071 | ||
4072 | issue_more | |
4073 | = targetm.sched.reorder (sched_dump, sched_verbose, | |
4074 | ready_lastpos (&ready), | |
4075 | &ready.n_ready, FENCE_CYCLE (fence)); | |
4076 | ||
4077 | if (pipelining_p) | |
4078 | ++ready.n_ready; | |
4079 | ||
4080 | ran_hook = true; | |
4081 | } | |
4082 | else | |
4083 | /* Initialize can_issue_more for variable_issue. */ | |
4084 | issue_more = issue_rate; | |
4085 | } | |
4086 | else if (targetm.sched.reorder2 | |
4087 | && !SCHED_GROUP_P (ready_element (&ready, 0))) | |
4088 | { | |
4089 | if (ready.n_ready == 1) | |
b8698a0f | 4090 | issue_more = |
e855c69d AB |
4091 | targetm.sched.reorder2 (sched_dump, sched_verbose, |
4092 | ready_lastpos (&ready), | |
4093 | &ready.n_ready, FENCE_CYCLE (fence)); | |
4094 | else | |
4095 | { | |
4096 | if (pipelining_p) | |
4097 | --ready.n_ready; | |
4098 | ||
4099 | issue_more = | |
4100 | targetm.sched.reorder2 (sched_dump, sched_verbose, | |
4101 | ready.n_ready | |
4102 | ? ready_lastpos (&ready) : NULL, | |
4103 | &ready.n_ready, FENCE_CYCLE (fence)); | |
4104 | ||
4105 | if (pipelining_p) | |
4106 | ++ready.n_ready; | |
4107 | } | |
4108 | ||
4109 | ran_hook = true; | |
4110 | } | |
b8698a0f | 4111 | else |
136e01a3 | 4112 | issue_more = FENCE_ISSUE_MORE (fence); |
e855c69d AB |
4113 | |
4114 | /* Ensure that ready list and vec_av_set are in line with each other, | |
4115 | i.e. vec_av_set[i] == ready_element (&ready, i). */ | |
4116 | if (issue_more && ran_hook) | |
4117 | { | |
4118 | int i, j, n; | |
4119 | rtx *arr = ready.vec; | |
4120 | expr_t *vec = VEC_address (expr_t, vec_av_set); | |
4121 | ||
4122 | for (i = 0, n = ready.n_ready; i < n; i++) | |
4123 | if (EXPR_INSN_RTX (vec[i]) != arr[i]) | |
4124 | { | |
4125 | expr_t tmp; | |
4126 | ||
4127 | for (j = i; j < n; j++) | |
4128 | if (EXPR_INSN_RTX (vec[j]) == arr[i]) | |
4129 | break; | |
4130 | gcc_assert (j < n); | |
4131 | ||
b8698a0f | 4132 | tmp = vec[i]; |
e855c69d AB |
4133 | vec[i] = vec[j]; |
4134 | vec[j] = tmp; | |
4135 | } | |
4136 | } | |
4137 | ||
4138 | return issue_more; | |
4139 | } | |
4140 | ||
b8698a0f L |
4141 | /* Return an EXPR correponding to INDEX element of ready list, if |
4142 | FOLLOW_READY_ELEMENT is true (i.e., an expr of | |
4143 | ready_element (&ready, INDEX) will be returned), and to INDEX element of | |
e855c69d AB |
4144 | ready.vec otherwise. */ |
4145 | static inline expr_t | |
4146 | find_expr_for_ready (int index, bool follow_ready_element) | |
4147 | { | |
4148 | expr_t expr; | |
4149 | int real_index; | |
4150 | ||
4151 | real_index = follow_ready_element ? ready.first - index : index; | |
4152 | ||
4153 | expr = VEC_index (expr_t, vec_av_set, real_index); | |
4154 | gcc_assert (ready.vec[real_index] == EXPR_INSN_RTX (expr)); | |
4155 | ||
4156 | return expr; | |
4157 | } | |
4158 | ||
4159 | /* Calculate insns worth trying via lookahead_guard hook. Return a number | |
4160 | of such insns found. */ | |
4161 | static int | |
4162 | invoke_dfa_lookahead_guard (void) | |
4163 | { | |
4164 | int i, n; | |
b8698a0f | 4165 | bool have_hook |
e855c69d AB |
4166 | = targetm.sched.first_cycle_multipass_dfa_lookahead_guard != NULL; |
4167 | ||
4168 | if (sched_verbose >= 2) | |
4169 | sel_print ("ready after reorder: "); | |
4170 | ||
4171 | for (i = 0, n = 0; i < ready.n_ready; i++) | |
4172 | { | |
4173 | expr_t expr; | |
4174 | insn_t insn; | |
4175 | int r; | |
4176 | ||
b8698a0f | 4177 | /* In this loop insn is Ith element of the ready list given by |
e855c69d AB |
4178 | ready_element, not Ith element of ready.vec. */ |
4179 | insn = ready_element (&ready, i); | |
b8698a0f | 4180 | |
e855c69d AB |
4181 | if (! have_hook || i == 0) |
4182 | r = 0; | |
4183 | else | |
4184 | r = !targetm.sched.first_cycle_multipass_dfa_lookahead_guard (insn); | |
b8698a0f | 4185 | |
e855c69d | 4186 | gcc_assert (INSN_CODE (insn) >= 0); |
b8698a0f L |
4187 | |
4188 | /* Only insns with ready_try = 0 can get here | |
e855c69d AB |
4189 | from fill_ready_list. */ |
4190 | gcc_assert (ready_try [i] == 0); | |
4191 | ready_try[i] = r; | |
4192 | if (!r) | |
4193 | n++; | |
4194 | ||
4195 | expr = find_expr_for_ready (i, true); | |
b8698a0f | 4196 | |
e855c69d AB |
4197 | if (sched_verbose >= 2) |
4198 | { | |
4199 | dump_vinsn (EXPR_VINSN (expr)); | |
4200 | sel_print (":%d; ", ready_try[i]); | |
4201 | } | |
4202 | } | |
4203 | ||
4204 | if (sched_verbose >= 2) | |
4205 | sel_print ("\n"); | |
4206 | return n; | |
4207 | } | |
4208 | ||
4209 | /* Calculate the number of privileged insns and return it. */ | |
4210 | static int | |
4211 | calculate_privileged_insns (void) | |
4212 | { | |
4213 | expr_t cur_expr, min_spec_expr = NULL; | |
e855c69d AB |
4214 | int privileged_n = 0, i; |
4215 | ||
4216 | for (i = 0; i < ready.n_ready; i++) | |
4217 | { | |
4218 | if (ready_try[i]) | |
4219 | continue; | |
4220 | ||
4221 | if (! min_spec_expr) | |
1124098b | 4222 | min_spec_expr = find_expr_for_ready (i, true); |
b8698a0f | 4223 | |
e855c69d AB |
4224 | cur_expr = find_expr_for_ready (i, true); |
4225 | ||
4226 | if (EXPR_SPEC (cur_expr) > EXPR_SPEC (min_spec_expr)) | |
4227 | break; | |
4228 | ||
4229 | ++privileged_n; | |
4230 | } | |
4231 | ||
4232 | if (i == ready.n_ready) | |
4233 | privileged_n = 0; | |
4234 | ||
4235 | if (sched_verbose >= 2) | |
4236 | sel_print ("privileged_n: %d insns with SPEC %d\n", | |
4237 | privileged_n, privileged_n ? EXPR_SPEC (min_spec_expr) : -1); | |
4238 | return privileged_n; | |
4239 | } | |
4240 | ||
b8698a0f | 4241 | /* Call the rest of the hooks after the choice was made. Return |
e855c69d AB |
4242 | the number of insns that still can be issued given that the current |
4243 | number is ISSUE_MORE. FENCE and BEST_INSN are the current fence | |
4244 | and the insn chosen for scheduling, respectively. */ | |
4245 | static int | |
4246 | invoke_aftermath_hooks (fence_t fence, rtx best_insn, int issue_more) | |
4247 | { | |
4248 | gcc_assert (INSN_P (best_insn)); | |
4249 | ||
4250 | /* First, call dfa_new_cycle, and then variable_issue, if available. */ | |
4251 | sel_dfa_new_cycle (best_insn, fence); | |
b8698a0f | 4252 | |
e855c69d AB |
4253 | if (targetm.sched.variable_issue) |
4254 | { | |
4255 | memcpy (curr_state, FENCE_STATE (fence), dfa_state_size); | |
b8698a0f | 4256 | issue_more = |
e855c69d AB |
4257 | targetm.sched.variable_issue (sched_dump, sched_verbose, best_insn, |
4258 | issue_more); | |
4259 | memcpy (FENCE_STATE (fence), curr_state, dfa_state_size); | |
4260 | } | |
4261 | else if (GET_CODE (PATTERN (best_insn)) != USE | |
4262 | && GET_CODE (PATTERN (best_insn)) != CLOBBER) | |
4263 | issue_more--; | |
4264 | ||
4265 | return issue_more; | |
4266 | } | |
4267 | ||
4268 | /* Estimate the cost of issuing INSN on DFA state STATE. */ | |
4269 | static int | |
4270 | estimate_insn_cost (rtx insn, state_t state) | |
4271 | { | |
4272 | static state_t temp = NULL; | |
4273 | int cost; | |
4274 | ||
4275 | if (!temp) | |
4276 | temp = xmalloc (dfa_state_size); | |
4277 | ||
4278 | memcpy (temp, state, dfa_state_size); | |
4279 | cost = state_transition (temp, insn); | |
4280 | ||
4281 | if (cost < 0) | |
4282 | return 0; | |
4283 | else if (cost == 0) | |
4284 | return 1; | |
4285 | return cost; | |
4286 | } | |
4287 | ||
b8698a0f | 4288 | /* Return the cost of issuing EXPR on the FENCE as estimated by DFA. |
e855c69d AB |
4289 | This function properly handles ASMs, USEs etc. */ |
4290 | static int | |
4291 | get_expr_cost (expr_t expr, fence_t fence) | |
4292 | { | |
4293 | rtx insn = EXPR_INSN_RTX (expr); | |
4294 | ||
4295 | if (recog_memoized (insn) < 0) | |
4296 | { | |
b8698a0f | 4297 | if (!FENCE_STARTS_CYCLE_P (fence) |
e855c69d AB |
4298 | && INSN_ASM_P (insn)) |
4299 | /* This is asm insn which is tryed to be issued on the | |
4300 | cycle not first. Issue it on the next cycle. */ | |
4301 | return 1; | |
4302 | else | |
4303 | /* A USE insn, or something else we don't need to | |
4304 | understand. We can't pass these directly to | |
4305 | state_transition because it will trigger a | |
4306 | fatal error for unrecognizable insns. */ | |
4307 | return 0; | |
4308 | } | |
4309 | else | |
4310 | return estimate_insn_cost (insn, FENCE_STATE (fence)); | |
4311 | } | |
4312 | ||
b8698a0f | 4313 | /* Find the best insn for scheduling, either via max_issue or just take |
e855c69d AB |
4314 | the most prioritized available. */ |
4315 | static int | |
4316 | choose_best_insn (fence_t fence, int privileged_n, int *index) | |
4317 | { | |
4318 | int can_issue = 0; | |
4319 | ||
4320 | if (dfa_lookahead > 0) | |
4321 | { | |
4322 | cycle_issued_insns = FENCE_ISSUED_INSNS (fence); | |
894fd6f2 | 4323 | /* TODO: pass equivalent of first_cycle_insn_p to max_issue (). */ |
e855c69d | 4324 | can_issue = max_issue (&ready, privileged_n, |
894fd6f2 | 4325 | FENCE_STATE (fence), true, index); |
e855c69d AB |
4326 | if (sched_verbose >= 2) |
4327 | sel_print ("max_issue: we can issue %d insns, already did %d insns\n", | |
4328 | can_issue, FENCE_ISSUED_INSNS (fence)); | |
4329 | } | |
4330 | else | |
4331 | { | |
4332 | /* We can't use max_issue; just return the first available element. */ | |
4333 | int i; | |
4334 | ||
4335 | for (i = 0; i < ready.n_ready; i++) | |
4336 | { | |
4337 | expr_t expr = find_expr_for_ready (i, true); | |
4338 | ||
4339 | if (get_expr_cost (expr, fence) < 1) | |
4340 | { | |
4341 | can_issue = can_issue_more; | |
4342 | *index = i; | |
4343 | ||
4344 | if (sched_verbose >= 2) | |
4345 | sel_print ("using %dth insn from the ready list\n", i + 1); | |
4346 | ||
4347 | break; | |
4348 | } | |
4349 | } | |
4350 | ||
4351 | if (i == ready.n_ready) | |
4352 | { | |
4353 | can_issue = 0; | |
4354 | *index = -1; | |
4355 | } | |
4356 | } | |
4357 | ||
4358 | return can_issue; | |
4359 | } | |
4360 | ||
b8698a0f L |
4361 | /* Choose the best expr from *AV_VLIW_PTR and a suitable register for it. |
4362 | BNDS and FENCE are current boundaries and scheduling fence respectively. | |
4363 | Return the expr found and NULL if nothing can be issued atm. | |
4364 | Write to PNEED_STALL the number of cycles to stall if no expr was found. */ | |
e855c69d AB |
4365 | static expr_t |
4366 | find_best_expr (av_set_t *av_vliw_ptr, blist_t bnds, fence_t fence, | |
4367 | int *pneed_stall) | |
4368 | { | |
4369 | expr_t best; | |
b8698a0f | 4370 | |
e855c69d AB |
4371 | /* Choose the best insn for scheduling via: |
4372 | 1) sorting the ready list based on priority; | |
4373 | 2) calling the reorder hook; | |
4374 | 3) calling max_issue. */ | |
4375 | best = fill_ready_list (av_vliw_ptr, bnds, fence, pneed_stall); | |
4376 | if (best == NULL && ready.n_ready > 0) | |
4377 | { | |
1124098b | 4378 | int privileged_n, index; |
e855c69d AB |
4379 | |
4380 | can_issue_more = invoke_reorder_hooks (fence); | |
4381 | if (can_issue_more > 0) | |
4382 | { | |
b8698a0f | 4383 | /* Try choosing the best insn until we find one that is could be |
e855c69d AB |
4384 | scheduled due to liveness restrictions on its destination register. |
4385 | In the future, we'd like to choose once and then just probe insns | |
4386 | in the order of their priority. */ | |
1124098b | 4387 | invoke_dfa_lookahead_guard (); |
e855c69d AB |
4388 | privileged_n = calculate_privileged_insns (); |
4389 | can_issue_more = choose_best_insn (fence, privileged_n, &index); | |
4390 | if (can_issue_more) | |
4391 | best = find_expr_for_ready (index, true); | |
4392 | } | |
b8698a0f | 4393 | /* We had some available insns, so if we can't issue them, |
e855c69d AB |
4394 | we have a stall. */ |
4395 | if (can_issue_more == 0) | |
4396 | { | |
4397 | best = NULL; | |
4398 | *pneed_stall = 1; | |
4399 | } | |
4400 | } | |
4401 | ||
4402 | if (best != NULL) | |
4403 | { | |
4404 | can_issue_more = invoke_aftermath_hooks (fence, EXPR_INSN_RTX (best), | |
4405 | can_issue_more); | |
4406 | if (can_issue_more == 0) | |
4407 | *pneed_stall = 1; | |
4408 | } | |
b8698a0f | 4409 | |
e855c69d AB |
4410 | if (sched_verbose >= 2) |
4411 | { | |
4412 | if (best != NULL) | |
4413 | { | |
4414 | sel_print ("Best expression (vliw form): "); | |
4415 | dump_expr (best); | |
4416 | sel_print ("; cycle %d\n", FENCE_CYCLE (fence)); | |
4417 | } | |
4418 | else | |
4419 | sel_print ("No best expr found!\n"); | |
4420 | } | |
4421 | ||
4422 | return best; | |
4423 | } | |
4424 | \f | |
4425 | ||
4426 | /* Functions that implement the core of the scheduler. */ | |
4427 | ||
4428 | ||
b8698a0f | 4429 | /* Emit an instruction from EXPR with SEQNO and VINSN after |
e855c69d AB |
4430 | PLACE_TO_INSERT. */ |
4431 | static insn_t | |
b8698a0f | 4432 | emit_insn_from_expr_after (expr_t expr, vinsn_t vinsn, int seqno, |
e855c69d AB |
4433 | insn_t place_to_insert) |
4434 | { | |
4435 | /* This assert fails when we have identical instructions | |
4436 | one of which dominates the other. In this case move_op () | |
4437 | finds the first instruction and doesn't search for second one. | |
4438 | The solution would be to compute av_set after the first found | |
4439 | insn and, if insn present in that set, continue searching. | |
4440 | For now we workaround this issue in move_op. */ | |
4441 | gcc_assert (!INSN_IN_STREAM_P (EXPR_INSN_RTX (expr))); | |
4442 | ||
4443 | if (EXPR_WAS_RENAMED (expr)) | |
4444 | { | |
4445 | unsigned regno = expr_dest_regno (expr); | |
b8698a0f | 4446 | |
e855c69d AB |
4447 | if (HARD_REGISTER_NUM_P (regno)) |
4448 | { | |
4449 | df_set_regs_ever_live (regno, true); | |
4450 | reg_rename_tick[regno] = ++reg_rename_this_tick; | |
4451 | } | |
4452 | } | |
b8698a0f L |
4453 | |
4454 | return sel_gen_insn_from_expr_after (expr, vinsn, seqno, | |
e855c69d AB |
4455 | place_to_insert); |
4456 | } | |
4457 | ||
4458 | /* Return TRUE if BB can hold bookkeeping code. */ | |
4459 | static bool | |
4460 | block_valid_for_bookkeeping_p (basic_block bb) | |
4461 | { | |
4462 | insn_t bb_end = BB_END (bb); | |
4463 | ||
4464 | if (!in_current_region_p (bb) || EDGE_COUNT (bb->succs) > 1) | |
4465 | return false; | |
4466 | ||
4467 | if (INSN_P (bb_end)) | |
4468 | { | |
4469 | if (INSN_SCHED_TIMES (bb_end) > 0) | |
4470 | return false; | |
4471 | } | |
4472 | else | |
4473 | gcc_assert (NOTE_INSN_BASIC_BLOCK_P (bb_end)); | |
4474 | ||
4475 | return true; | |
4476 | } | |
4477 | ||
4478 | /* Attempt to find a block that can hold bookkeeping code for path(s) incoming | |
4479 | into E2->dest, except from E1->src (there may be a sequence of empty basic | |
4480 | blocks between E1->src and E2->dest). Return found block, or NULL if new | |
b5b8b0ac AO |
4481 | one must be created. If LAX holds, don't assume there is a simple path |
4482 | from E1->src to E2->dest. */ | |
e855c69d | 4483 | static basic_block |
b5b8b0ac | 4484 | find_block_for_bookkeeping (edge e1, edge e2, bool lax) |
e855c69d AB |
4485 | { |
4486 | basic_block candidate_block = NULL; | |
4487 | edge e; | |
4488 | ||
4489 | /* Loop over edges from E1 to E2, inclusive. */ | |
b5b8b0ac | 4490 | for (e = e1; !lax || e->dest != EXIT_BLOCK_PTR; e = EDGE_SUCC (e->dest, 0)) |
e855c69d AB |
4491 | { |
4492 | if (EDGE_COUNT (e->dest->preds) == 2) | |
4493 | { | |
4494 | if (candidate_block == NULL) | |
4495 | candidate_block = (EDGE_PRED (e->dest, 0) == e | |
4496 | ? EDGE_PRED (e->dest, 1)->src | |
4497 | : EDGE_PRED (e->dest, 0)->src); | |
4498 | else | |
4499 | /* Found additional edge leading to path from e1 to e2 | |
4500 | from aside. */ | |
4501 | return NULL; | |
4502 | } | |
4503 | else if (EDGE_COUNT (e->dest->preds) > 2) | |
4504 | /* Several edges leading to path from e1 to e2 from aside. */ | |
4505 | return NULL; | |
4506 | ||
4507 | if (e == e2) | |
b5b8b0ac AO |
4508 | return ((!lax || candidate_block) |
4509 | && block_valid_for_bookkeeping_p (candidate_block) | |
e855c69d AB |
4510 | ? candidate_block |
4511 | : NULL); | |
b5b8b0ac AO |
4512 | |
4513 | if (lax && EDGE_COUNT (e->dest->succs) != 1) | |
4514 | return NULL; | |
e855c69d | 4515 | } |
b5b8b0ac AO |
4516 | |
4517 | if (lax) | |
4518 | return NULL; | |
4519 | ||
e855c69d AB |
4520 | gcc_unreachable (); |
4521 | } | |
4522 | ||
4523 | /* Create new basic block for bookkeeping code for path(s) incoming into | |
4524 | E2->dest, except from E1->src. Return created block. */ | |
4525 | static basic_block | |
4526 | create_block_for_bookkeeping (edge e1, edge e2) | |
4527 | { | |
4528 | basic_block new_bb, bb = e2->dest; | |
4529 | ||
4530 | /* Check that we don't spoil the loop structure. */ | |
4531 | if (current_loop_nest) | |
4532 | { | |
4533 | basic_block latch = current_loop_nest->latch; | |
4534 | ||
4535 | /* We do not split header. */ | |
4536 | gcc_assert (e2->dest != current_loop_nest->header); | |
4537 | ||
4538 | /* We do not redirect the only edge to the latch block. */ | |
4539 | gcc_assert (e1->dest != latch | |
4540 | || !single_pred_p (latch) | |
4541 | || e1 != single_pred_edge (latch)); | |
4542 | } | |
4543 | ||
4544 | /* Split BB to insert BOOK_INSN there. */ | |
4545 | new_bb = sched_split_block (bb, NULL); | |
4546 | ||
4547 | /* Move note_list from the upper bb. */ | |
4548 | gcc_assert (BB_NOTE_LIST (new_bb) == NULL_RTX); | |
4549 | BB_NOTE_LIST (new_bb) = BB_NOTE_LIST (bb); | |
4550 | BB_NOTE_LIST (bb) = NULL_RTX; | |
4551 | ||
4552 | gcc_assert (e2->dest == bb); | |
4553 | ||
4554 | /* Skip block for bookkeeping copy when leaving E1->src. */ | |
4555 | if (e1->flags & EDGE_FALLTHRU) | |
4556 | sel_redirect_edge_and_branch_force (e1, new_bb); | |
4557 | else | |
4558 | sel_redirect_edge_and_branch (e1, new_bb); | |
4559 | ||
4560 | gcc_assert (e1->dest == new_bb); | |
4561 | gcc_assert (sel_bb_empty_p (bb)); | |
4562 | ||
b5b8b0ac AO |
4563 | /* To keep basic block numbers in sync between debug and non-debug |
4564 | compilations, we have to rotate blocks here. Consider that we | |
4565 | started from (a,b)->d, (c,d)->e, and d contained only debug | |
4566 | insns. It would have been removed before if the debug insns | |
4567 | weren't there, so we'd have split e rather than d. So what we do | |
4568 | now is to swap the block numbers of new_bb and | |
4569 | single_succ(new_bb) == e, so that the insns that were in e before | |
4570 | get the new block number. */ | |
4571 | ||
4572 | if (MAY_HAVE_DEBUG_INSNS) | |
4573 | { | |
4574 | basic_block succ; | |
4575 | insn_t insn = sel_bb_head (new_bb); | |
4576 | insn_t last; | |
4577 | ||
4578 | if (DEBUG_INSN_P (insn) | |
4579 | && single_succ_p (new_bb) | |
4580 | && (succ = single_succ (new_bb)) | |
4581 | && succ != EXIT_BLOCK_PTR | |
4582 | && DEBUG_INSN_P ((last = sel_bb_end (new_bb)))) | |
4583 | { | |
4584 | while (insn != last && (DEBUG_INSN_P (insn) || NOTE_P (insn))) | |
4585 | insn = NEXT_INSN (insn); | |
4586 | ||
4587 | if (insn == last) | |
4588 | { | |
4589 | sel_global_bb_info_def gbi; | |
4590 | sel_region_bb_info_def rbi; | |
4591 | int i; | |
4592 | ||
4593 | if (sched_verbose >= 2) | |
4594 | sel_print ("Swapping block ids %i and %i\n", | |
4595 | new_bb->index, succ->index); | |
4596 | ||
4597 | i = new_bb->index; | |
4598 | new_bb->index = succ->index; | |
4599 | succ->index = i; | |
4600 | ||
4601 | SET_BASIC_BLOCK (new_bb->index, new_bb); | |
4602 | SET_BASIC_BLOCK (succ->index, succ); | |
4603 | ||
4604 | memcpy (&gbi, SEL_GLOBAL_BB_INFO (new_bb), sizeof (gbi)); | |
4605 | memcpy (SEL_GLOBAL_BB_INFO (new_bb), SEL_GLOBAL_BB_INFO (succ), | |
4606 | sizeof (gbi)); | |
4607 | memcpy (SEL_GLOBAL_BB_INFO (succ), &gbi, sizeof (gbi)); | |
4608 | ||
4609 | memcpy (&rbi, SEL_REGION_BB_INFO (new_bb), sizeof (rbi)); | |
4610 | memcpy (SEL_REGION_BB_INFO (new_bb), SEL_REGION_BB_INFO (succ), | |
4611 | sizeof (rbi)); | |
4612 | memcpy (SEL_REGION_BB_INFO (succ), &rbi, sizeof (rbi)); | |
4613 | ||
4614 | i = BLOCK_TO_BB (new_bb->index); | |
4615 | BLOCK_TO_BB (new_bb->index) = BLOCK_TO_BB (succ->index); | |
4616 | BLOCK_TO_BB (succ->index) = i; | |
4617 | ||
4618 | i = CONTAINING_RGN (new_bb->index); | |
4619 | CONTAINING_RGN (new_bb->index) = CONTAINING_RGN (succ->index); | |
4620 | CONTAINING_RGN (succ->index) = i; | |
4621 | ||
4622 | for (i = 0; i < current_nr_blocks; i++) | |
4623 | if (BB_TO_BLOCK (i) == succ->index) | |
4624 | BB_TO_BLOCK (i) = new_bb->index; | |
4625 | else if (BB_TO_BLOCK (i) == new_bb->index) | |
4626 | BB_TO_BLOCK (i) = succ->index; | |
4627 | ||
4628 | FOR_BB_INSNS (new_bb, insn) | |
4629 | if (INSN_P (insn)) | |
4630 | EXPR_ORIG_BB_INDEX (INSN_EXPR (insn)) = new_bb->index; | |
4631 | ||
4632 | FOR_BB_INSNS (succ, insn) | |
4633 | if (INSN_P (insn)) | |
4634 | EXPR_ORIG_BB_INDEX (INSN_EXPR (insn)) = succ->index; | |
4635 | ||
fcaa4ca4 NF |
4636 | if (bitmap_clear_bit (code_motion_visited_blocks, new_bb->index)) |
4637 | bitmap_set_bit (code_motion_visited_blocks, succ->index); | |
b5b8b0ac AO |
4638 | |
4639 | gcc_assert (LABEL_P (BB_HEAD (new_bb)) | |
4640 | && LABEL_P (BB_HEAD (succ))); | |
4641 | ||
4642 | if (sched_verbose >= 4) | |
4643 | sel_print ("Swapping code labels %i and %i\n", | |
4644 | CODE_LABEL_NUMBER (BB_HEAD (new_bb)), | |
4645 | CODE_LABEL_NUMBER (BB_HEAD (succ))); | |
4646 | ||
4647 | i = CODE_LABEL_NUMBER (BB_HEAD (new_bb)); | |
4648 | CODE_LABEL_NUMBER (BB_HEAD (new_bb)) | |
4649 | = CODE_LABEL_NUMBER (BB_HEAD (succ)); | |
4650 | CODE_LABEL_NUMBER (BB_HEAD (succ)) = i; | |
4651 | } | |
4652 | } | |
4653 | } | |
4654 | ||
e855c69d AB |
4655 | return bb; |
4656 | } | |
4657 | ||
4658 | /* Return insn after which we must insert bookkeeping code for path(s) incoming | |
4659 | into E2->dest, except from E1->src. */ | |
4660 | static insn_t | |
4661 | find_place_for_bookkeeping (edge e1, edge e2) | |
4662 | { | |
4663 | insn_t place_to_insert; | |
4664 | /* Find a basic block that can hold bookkeeping. If it can be found, do not | |
4665 | create new basic block, but insert bookkeeping there. */ | |
b5b8b0ac | 4666 | basic_block book_block = find_block_for_bookkeeping (e1, e2, FALSE); |
e855c69d | 4667 | |
b5b8b0ac AO |
4668 | if (book_block) |
4669 | { | |
4670 | place_to_insert = BB_END (book_block); | |
4671 | ||
4672 | /* Don't use a block containing only debug insns for | |
4673 | bookkeeping, this causes scheduling differences between debug | |
4674 | and non-debug compilations, for the block would have been | |
4675 | removed already. */ | |
4676 | if (DEBUG_INSN_P (place_to_insert)) | |
4677 | { | |
4678 | rtx insn = sel_bb_head (book_block); | |
e855c69d | 4679 | |
b5b8b0ac AO |
4680 | while (insn != place_to_insert && |
4681 | (DEBUG_INSN_P (insn) || NOTE_P (insn))) | |
4682 | insn = NEXT_INSN (insn); | |
4683 | ||
4684 | if (insn == place_to_insert) | |
4685 | book_block = NULL; | |
4686 | } | |
4687 | } | |
4688 | ||
4689 | if (!book_block) | |
4690 | { | |
4691 | book_block = create_block_for_bookkeeping (e1, e2); | |
4692 | place_to_insert = BB_END (book_block); | |
4693 | if (sched_verbose >= 9) | |
4694 | sel_print ("New block is %i, split from bookkeeping block %i\n", | |
4695 | EDGE_SUCC (book_block, 0)->dest->index, book_block->index); | |
4696 | } | |
4697 | else | |
4698 | { | |
4699 | if (sched_verbose >= 9) | |
4700 | sel_print ("Pre-existing bookkeeping block is %i\n", book_block->index); | |
4701 | } | |
e855c69d AB |
4702 | |
4703 | /* If basic block ends with a jump, insert bookkeeping code right before it. */ | |
4704 | if (INSN_P (place_to_insert) && control_flow_insn_p (place_to_insert)) | |
4705 | place_to_insert = PREV_INSN (place_to_insert); | |
4706 | ||
4707 | return place_to_insert; | |
4708 | } | |
4709 | ||
4710 | /* Find a proper seqno for bookkeeing insn inserted at PLACE_TO_INSERT | |
4711 | for JOIN_POINT. */ | |
4712 | static int | |
4713 | find_seqno_for_bookkeeping (insn_t place_to_insert, insn_t join_point) | |
4714 | { | |
4715 | int seqno; | |
4716 | rtx next; | |
4717 | ||
4718 | /* Check if we are about to insert bookkeeping copy before a jump, and use | |
4719 | jump's seqno for the copy; otherwise, use JOIN_POINT's seqno. */ | |
4720 | next = NEXT_INSN (place_to_insert); | |
b8698a0f | 4721 | if (INSN_P (next) |
e855c69d AB |
4722 | && JUMP_P (next) |
4723 | && BLOCK_FOR_INSN (next) == BLOCK_FOR_INSN (place_to_insert)) | |
da7ba240 AB |
4724 | { |
4725 | gcc_assert (INSN_SCHED_TIMES (next) == 0); | |
4726 | seqno = INSN_SEQNO (next); | |
4727 | } | |
e855c69d AB |
4728 | else if (INSN_SEQNO (join_point) > 0) |
4729 | seqno = INSN_SEQNO (join_point); | |
4730 | else | |
da7ba240 AB |
4731 | { |
4732 | seqno = get_seqno_by_preds (place_to_insert); | |
4733 | ||
b8698a0f L |
4734 | /* Sometimes the fences can move in such a way that there will be |
4735 | no instructions with positive seqno around this bookkeeping. | |
da7ba240 AB |
4736 | This means that there will be no way to get to it by a regular |
4737 | fence movement. Never mind because we pick up such pieces for | |
4738 | rescheduling anyways, so any positive value will do for now. */ | |
4739 | if (seqno < 0) | |
4740 | { | |
4741 | gcc_assert (pipelining_p); | |
4742 | seqno = 1; | |
4743 | } | |
4744 | } | |
b8698a0f | 4745 | |
e855c69d AB |
4746 | gcc_assert (seqno > 0); |
4747 | return seqno; | |
4748 | } | |
4749 | ||
4750 | /* Insert bookkeeping copy of C_EXPS's insn after PLACE_TO_INSERT, assigning | |
4751 | NEW_SEQNO to it. Return created insn. */ | |
4752 | static insn_t | |
4753 | emit_bookkeeping_insn (insn_t place_to_insert, expr_t c_expr, int new_seqno) | |
4754 | { | |
4755 | rtx new_insn_rtx = create_copy_of_insn_rtx (EXPR_INSN_RTX (c_expr)); | |
4756 | ||
4757 | vinsn_t new_vinsn | |
4758 | = create_vinsn_from_insn_rtx (new_insn_rtx, | |
4759 | VINSN_UNIQUE_P (EXPR_VINSN (c_expr))); | |
4760 | ||
4761 | insn_t new_insn = emit_insn_from_expr_after (c_expr, new_vinsn, new_seqno, | |
4762 | place_to_insert); | |
4763 | ||
4764 | INSN_SCHED_TIMES (new_insn) = 0; | |
4765 | bitmap_set_bit (current_copies, INSN_UID (new_insn)); | |
4766 | ||
4767 | return new_insn; | |
4768 | } | |
4769 | ||
4770 | /* Generate a bookkeeping copy of C_EXPR's insn for path(s) incoming into to | |
4771 | E2->dest, except from E1->src (there may be a sequence of empty blocks | |
4772 | between E1->src and E2->dest). Return block containing the copy. | |
4773 | All scheduler data is initialized for the newly created insn. */ | |
4774 | static basic_block | |
4775 | generate_bookkeeping_insn (expr_t c_expr, edge e1, edge e2) | |
4776 | { | |
4777 | insn_t join_point, place_to_insert, new_insn; | |
4778 | int new_seqno; | |
4779 | bool need_to_exchange_data_sets; | |
4780 | ||
4781 | if (sched_verbose >= 4) | |
4782 | sel_print ("Generating bookkeeping insn (%d->%d)\n", e1->src->index, | |
4783 | e2->dest->index); | |
4784 | ||
4785 | join_point = sel_bb_head (e2->dest); | |
4786 | place_to_insert = find_place_for_bookkeeping (e1, e2); | |
b5b8b0ac AO |
4787 | if (!place_to_insert) |
4788 | return NULL; | |
e855c69d AB |
4789 | new_seqno = find_seqno_for_bookkeeping (place_to_insert, join_point); |
4790 | need_to_exchange_data_sets | |
4791 | = sel_bb_empty_p (BLOCK_FOR_INSN (place_to_insert)); | |
4792 | ||
4793 | new_insn = emit_bookkeeping_insn (place_to_insert, c_expr, new_seqno); | |
4794 | ||
4795 | /* When inserting bookkeeping insn in new block, av sets should be | |
4796 | following: old basic block (that now holds bookkeeping) data sets are | |
4797 | the same as was before generation of bookkeeping, and new basic block | |
4798 | (that now hold all other insns of old basic block) data sets are | |
4799 | invalid. So exchange data sets for these basic blocks as sel_split_block | |
4800 | mistakenly exchanges them in this case. Cannot do it earlier because | |
4801 | when single instruction is added to new basic block it should hold NULL | |
4802 | lv_set. */ | |
4803 | if (need_to_exchange_data_sets) | |
4804 | exchange_data_sets (BLOCK_FOR_INSN (new_insn), | |
4805 | BLOCK_FOR_INSN (join_point)); | |
4806 | ||
4807 | stat_bookkeeping_copies++; | |
4808 | return BLOCK_FOR_INSN (new_insn); | |
4809 | } | |
4810 | ||
b8698a0f | 4811 | /* Remove from AV_PTR all insns that may need bookkeeping when scheduling |
e855c69d AB |
4812 | on FENCE, but we are unable to copy them. */ |
4813 | static void | |
4814 | remove_insns_that_need_bookkeeping (fence_t fence, av_set_t *av_ptr) | |
4815 | { | |
4816 | expr_t expr; | |
4817 | av_set_iterator i; | |
4818 | ||
b8698a0f L |
4819 | /* An expression does not need bookkeeping if it is available on all paths |
4820 | from current block to original block and current block dominates | |
4821 | original block. We check availability on all paths by examining | |
4822 | EXPR_SPEC; this is not equivalent, because it may be positive even | |
4823 | if expr is available on all paths (but if expr is not available on | |
e855c69d AB |
4824 | any path, EXPR_SPEC will be positive). */ |
4825 | ||
4826 | FOR_EACH_EXPR_1 (expr, i, av_ptr) | |
4827 | { | |
4828 | if (!control_flow_insn_p (EXPR_INSN_RTX (expr)) | |
4829 | && (!bookkeeping_p || VINSN_UNIQUE_P (EXPR_VINSN (expr))) | |
4830 | && (EXPR_SPEC (expr) | |
4831 | || !EXPR_ORIG_BB_INDEX (expr) | |
4832 | || !dominated_by_p (CDI_DOMINATORS, | |
4833 | BASIC_BLOCK (EXPR_ORIG_BB_INDEX (expr)), | |
4834 | BLOCK_FOR_INSN (FENCE_INSN (fence))))) | |
4835 | { | |
4836 | if (sched_verbose >= 4) | |
4837 | sel_print ("Expr %d removed because it would need bookkeeping, which " | |
4838 | "cannot be created\n", INSN_UID (EXPR_INSN_RTX (expr))); | |
4839 | av_set_iter_remove (&i); | |
4840 | } | |
4841 | } | |
4842 | } | |
4843 | ||
4844 | /* Moving conditional jump through some instructions. | |
4845 | ||
4846 | Consider example: | |
4847 | ||
4848 | ... <- current scheduling point | |
4849 | NOTE BASIC BLOCK: <- bb header | |
4850 | (p8) add r14=r14+0x9;; | |
4851 | (p8) mov [r14]=r23 | |
4852 | (!p8) jump L1;; | |
4853 | NOTE BASIC BLOCK: | |
4854 | ... | |
4855 | ||
b8698a0f | 4856 | We can schedule jump one cycle earlier, than mov, because they cannot be |
e855c69d AB |
4857 | executed together as their predicates are mutually exclusive. |
4858 | ||
b8698a0f L |
4859 | This is done in this way: first, new fallthrough basic block is created |
4860 | after jump (it is always can be done, because there already should be a | |
e855c69d | 4861 | fallthrough block, where control flow goes in case of predicate being true - |
b8698a0f L |
4862 | in our example; otherwise there should be a dependence between those |
4863 | instructions and jump and we cannot schedule jump right now); | |
4864 | next, all instructions between jump and current scheduling point are moved | |
e855c69d AB |
4865 | to this new block. And the result is this: |
4866 | ||
4867 | NOTE BASIC BLOCK: | |
4868 | (!p8) jump L1 <- current scheduling point | |
4869 | NOTE BASIC BLOCK: <- bb header | |
4870 | (p8) add r14=r14+0x9;; | |
4871 | (p8) mov [r14]=r23 | |
4872 | NOTE BASIC BLOCK: | |
4873 | ... | |
4874 | */ | |
4875 | static void | |
4876 | move_cond_jump (rtx insn, bnd_t bnd) | |
4877 | { | |
4878 | edge ft_edge; | |
324d3f45 AM |
4879 | basic_block block_from, block_next, block_new, block_bnd, bb; |
4880 | rtx next, prev, link, head; | |
e855c69d | 4881 | |
e855c69d | 4882 | block_from = BLOCK_FOR_INSN (insn); |
324d3f45 AM |
4883 | block_bnd = BLOCK_FOR_INSN (BND_TO (bnd)); |
4884 | prev = BND_TO (bnd); | |
e855c69d | 4885 | |
324d3f45 AM |
4886 | #ifdef ENABLE_CHECKING |
4887 | /* Moving of jump should not cross any other jumps or beginnings of new | |
4888 | basic blocks. The only exception is when we move a jump through | |
4889 | mutually exclusive insns along fallthru edges. */ | |
4890 | if (block_from != block_bnd) | |
4891 | { | |
4892 | bb = block_from; | |
4893 | for (link = PREV_INSN (insn); link != PREV_INSN (prev); | |
4894 | link = PREV_INSN (link)) | |
4895 | { | |
4896 | if (INSN_P (link)) | |
4897 | gcc_assert (sched_insns_conditions_mutex_p (insn, link)); | |
4898 | if (BLOCK_FOR_INSN (link) && BLOCK_FOR_INSN (link) != bb) | |
4899 | { | |
4900 | gcc_assert (single_pred (bb) == BLOCK_FOR_INSN (link)); | |
4901 | bb = BLOCK_FOR_INSN (link); | |
4902 | } | |
4903 | } | |
4904 | } | |
4905 | #endif | |
e855c69d AB |
4906 | |
4907 | /* Jump is moved to the boundary. */ | |
e855c69d AB |
4908 | next = PREV_INSN (insn); |
4909 | BND_TO (bnd) = insn; | |
4910 | ||
0fd4b31d | 4911 | ft_edge = find_fallthru_edge_from (block_from); |
e855c69d AB |
4912 | block_next = ft_edge->dest; |
4913 | /* There must be a fallthrough block (or where should go | |
4914 | control flow in case of false jump predicate otherwise?). */ | |
4915 | gcc_assert (block_next); | |
4916 | ||
4917 | /* Create new empty basic block after source block. */ | |
4918 | block_new = sel_split_edge (ft_edge); | |
4919 | gcc_assert (block_new->next_bb == block_next | |
4920 | && block_from->next_bb == block_new); | |
4921 | ||
324d3f45 AM |
4922 | /* Move all instructions except INSN to BLOCK_NEW. */ |
4923 | bb = block_bnd; | |
4924 | head = BB_HEAD (block_new); | |
4925 | while (bb != block_from->next_bb) | |
e855c69d | 4926 | { |
324d3f45 AM |
4927 | rtx from, to; |
4928 | from = bb == block_bnd ? prev : sel_bb_head (bb); | |
4929 | to = bb == block_from ? next : sel_bb_end (bb); | |
e855c69d | 4930 | |
324d3f45 AM |
4931 | /* The jump being moved can be the first insn in the block. |
4932 | In this case we don't have to move anything in this block. */ | |
4933 | if (NEXT_INSN (to) != from) | |
4934 | { | |
4935 | reorder_insns (from, to, head); | |
4936 | ||
4937 | for (link = to; link != head; link = PREV_INSN (link)) | |
4938 | EXPR_ORIG_BB_INDEX (INSN_EXPR (link)) = block_new->index; | |
4939 | head = to; | |
4940 | } | |
e855c69d | 4941 | |
324d3f45 AM |
4942 | /* Cleanup possibly empty blocks left. */ |
4943 | block_next = bb->next_bb; | |
4944 | if (bb != block_from) | |
65592aad | 4945 | tidy_control_flow (bb, false); |
324d3f45 AM |
4946 | bb = block_next; |
4947 | } | |
e855c69d AB |
4948 | |
4949 | /* Assert there is no jump to BLOCK_NEW, only fallthrough edge. */ | |
4950 | gcc_assert (NOTE_INSN_BASIC_BLOCK_P (BB_HEAD (block_new))); | |
e855c69d AB |
4951 | |
4952 | gcc_assert (!sel_bb_empty_p (block_from) | |
4953 | && !sel_bb_empty_p (block_new)); | |
4954 | ||
4955 | /* Update data sets for BLOCK_NEW to represent that INSN and | |
4956 | instructions from the other branch of INSN is no longer | |
4957 | available at BLOCK_NEW. */ | |
4958 | BB_AV_LEVEL (block_new) = global_level; | |
4959 | gcc_assert (BB_LV_SET (block_new) == NULL); | |
4960 | BB_LV_SET (block_new) = get_clear_regset_from_pool (); | |
4961 | update_data_sets (sel_bb_head (block_new)); | |
4962 | ||
4963 | /* INSN is a new basic block header - so prepare its data | |
4964 | structures and update availability and liveness sets. */ | |
4965 | update_data_sets (insn); | |
4966 | ||
4967 | if (sched_verbose >= 4) | |
4968 | sel_print ("Moving jump %d\n", INSN_UID (insn)); | |
4969 | } | |
4970 | ||
4971 | /* Remove nops generated during move_op for preventing removal of empty | |
4972 | basic blocks. */ | |
4973 | static void | |
b5b8b0ac | 4974 | remove_temp_moveop_nops (bool full_tidying) |
e855c69d AB |
4975 | { |
4976 | int i; | |
4977 | insn_t insn; | |
b8698a0f | 4978 | |
ac47786e | 4979 | FOR_EACH_VEC_ELT (insn_t, vec_temp_moveop_nops, i, insn) |
e855c69d AB |
4980 | { |
4981 | gcc_assert (INSN_NOP_P (insn)); | |
b5b8b0ac | 4982 | return_nop_to_pool (insn, full_tidying); |
e855c69d AB |
4983 | } |
4984 | ||
4985 | /* Empty the vector. */ | |
4986 | if (VEC_length (insn_t, vec_temp_moveop_nops) > 0) | |
b8698a0f | 4987 | VEC_block_remove (insn_t, vec_temp_moveop_nops, 0, |
e855c69d AB |
4988 | VEC_length (insn_t, vec_temp_moveop_nops)); |
4989 | } | |
4990 | ||
4991 | /* Records the maximal UID before moving up an instruction. Used for | |
4992 | distinguishing between bookkeeping copies and original insns. */ | |
4993 | static int max_uid_before_move_op = 0; | |
4994 | ||
4995 | /* Remove from AV_VLIW_P all instructions but next when debug counter | |
4996 | tells us so. Next instruction is fetched from BNDS. */ | |
4997 | static void | |
4998 | remove_insns_for_debug (blist_t bnds, av_set_t *av_vliw_p) | |
4999 | { | |
5000 | if (! dbg_cnt (sel_sched_insn_cnt)) | |
5001 | /* Leave only the next insn in av_vliw. */ | |
5002 | { | |
5003 | av_set_iterator av_it; | |
5004 | expr_t expr; | |
5005 | bnd_t bnd = BLIST_BND (bnds); | |
5006 | insn_t next = BND_TO (bnd); | |
5007 | ||
5008 | gcc_assert (BLIST_NEXT (bnds) == NULL); | |
5009 | ||
5010 | FOR_EACH_EXPR_1 (expr, av_it, av_vliw_p) | |
5011 | if (EXPR_INSN_RTX (expr) != next) | |
5012 | av_set_iter_remove (&av_it); | |
5013 | } | |
5014 | } | |
5015 | ||
b8698a0f | 5016 | /* Compute available instructions on BNDS. FENCE is the current fence. Write |
e855c69d AB |
5017 | the computed set to *AV_VLIW_P. */ |
5018 | static void | |
5019 | compute_av_set_on_boundaries (fence_t fence, blist_t bnds, av_set_t *av_vliw_p) | |
5020 | { | |
5021 | if (sched_verbose >= 2) | |
5022 | { | |
5023 | sel_print ("Boundaries: "); | |
5024 | dump_blist (bnds); | |
5025 | sel_print ("\n"); | |
5026 | } | |
5027 | ||
5028 | for (; bnds; bnds = BLIST_NEXT (bnds)) | |
5029 | { | |
5030 | bnd_t bnd = BLIST_BND (bnds); | |
5031 | av_set_t av1_copy; | |
5032 | insn_t bnd_to = BND_TO (bnd); | |
5033 | ||
5034 | /* Rewind BND->TO to the basic block header in case some bookkeeping | |
5035 | instructions were inserted before BND->TO and it needs to be | |
5036 | adjusted. */ | |
5037 | if (sel_bb_head_p (bnd_to)) | |
5038 | gcc_assert (INSN_SCHED_TIMES (bnd_to) == 0); | |
5039 | else | |
5040 | while (INSN_SCHED_TIMES (PREV_INSN (bnd_to)) == 0) | |
5041 | { | |
5042 | bnd_to = PREV_INSN (bnd_to); | |
5043 | if (sel_bb_head_p (bnd_to)) | |
5044 | break; | |
5045 | } | |
5046 | ||
5047 | if (BND_TO (bnd) != bnd_to) | |
5048 | { | |
5049 | gcc_assert (FENCE_INSN (fence) == BND_TO (bnd)); | |
5050 | FENCE_INSN (fence) = bnd_to; | |
5051 | BND_TO (bnd) = bnd_to; | |
5052 | } | |
5053 | ||
5054 | av_set_clear (&BND_AV (bnd)); | |
5055 | BND_AV (bnd) = compute_av_set (BND_TO (bnd), NULL, 0, true); | |
5056 | ||
5057 | av_set_clear (&BND_AV1 (bnd)); | |
5058 | BND_AV1 (bnd) = av_set_copy (BND_AV (bnd)); | |
5059 | ||
5060 | moveup_set_inside_insn_group (&BND_AV1 (bnd), NULL); | |
b8698a0f | 5061 | |
e855c69d AB |
5062 | av1_copy = av_set_copy (BND_AV1 (bnd)); |
5063 | av_set_union_and_clear (av_vliw_p, &av1_copy, NULL); | |
5064 | } | |
5065 | ||
5066 | if (sched_verbose >= 2) | |
5067 | { | |
5068 | sel_print ("Available exprs (vliw form): "); | |
5069 | dump_av_set (*av_vliw_p); | |
5070 | sel_print ("\n"); | |
5071 | } | |
5072 | } | |
5073 | ||
b8698a0f L |
5074 | /* Calculate the sequential av set on BND corresponding to the EXPR_VLIW |
5075 | expression. When FOR_MOVEOP is true, also replace the register of | |
e855c69d AB |
5076 | expressions found with the register from EXPR_VLIW. */ |
5077 | static av_set_t | |
5078 | find_sequential_best_exprs (bnd_t bnd, expr_t expr_vliw, bool for_moveop) | |
5079 | { | |
5080 | av_set_t expr_seq = NULL; | |
5081 | expr_t expr; | |
5082 | av_set_iterator i; | |
b8698a0f | 5083 | |
e855c69d AB |
5084 | FOR_EACH_EXPR (expr, i, BND_AV (bnd)) |
5085 | { | |
5086 | if (equal_after_moveup_path_p (expr, NULL, expr_vliw)) | |
5087 | { | |
5088 | if (for_moveop) | |
5089 | { | |
b8698a0f L |
5090 | /* The sequential expression has the right form to pass |
5091 | to move_op except when renaming happened. Put the | |
e855c69d AB |
5092 | correct register in EXPR then. */ |
5093 | if (EXPR_SEPARABLE_P (expr) && REG_P (EXPR_LHS (expr))) | |
5094 | { | |
5095 | if (expr_dest_regno (expr) != expr_dest_regno (expr_vliw)) | |
5096 | { | |
5097 | replace_dest_with_reg_in_expr (expr, EXPR_LHS (expr_vliw)); | |
5098 | stat_renamed_scheduled++; | |
5099 | } | |
b8698a0f L |
5100 | /* Also put the correct TARGET_AVAILABLE bit on the expr. |
5101 | This is needed when renaming came up with original | |
e855c69d | 5102 | register. */ |
b8698a0f | 5103 | else if (EXPR_TARGET_AVAILABLE (expr) |
e855c69d AB |
5104 | != EXPR_TARGET_AVAILABLE (expr_vliw)) |
5105 | { | |
5106 | gcc_assert (EXPR_TARGET_AVAILABLE (expr_vliw) == 1); | |
5107 | EXPR_TARGET_AVAILABLE (expr) = 1; | |
5108 | } | |
5109 | } | |
5110 | if (EXPR_WAS_SUBSTITUTED (expr)) | |
5111 | stat_substitutions_total++; | |
5112 | } | |
5113 | ||
5114 | av_set_add (&expr_seq, expr); | |
b8698a0f L |
5115 | |
5116 | /* With substitution inside insn group, it is possible | |
5117 | that more than one expression in expr_seq will correspond | |
5118 | to expr_vliw. In this case, choose one as the attempt to | |
e855c69d AB |
5119 | move both leads to miscompiles. */ |
5120 | break; | |
5121 | } | |
5122 | } | |
5123 | ||
5124 | if (for_moveop && sched_verbose >= 2) | |
5125 | { | |
5126 | sel_print ("Best expression(s) (sequential form): "); | |
5127 | dump_av_set (expr_seq); | |
5128 | sel_print ("\n"); | |
5129 | } | |
b8698a0f | 5130 | |
e855c69d AB |
5131 | return expr_seq; |
5132 | } | |
5133 | ||
5134 | ||
5135 | /* Move nop to previous block. */ | |
5136 | static void ATTRIBUTE_UNUSED | |
5137 | move_nop_to_previous_block (insn_t nop, basic_block prev_bb) | |
5138 | { | |
5139 | insn_t prev_insn, next_insn, note; | |
5140 | ||
b8698a0f | 5141 | gcc_assert (sel_bb_head_p (nop) |
e855c69d AB |
5142 | && prev_bb == BLOCK_FOR_INSN (nop)->prev_bb); |
5143 | note = bb_note (BLOCK_FOR_INSN (nop)); | |
5144 | prev_insn = sel_bb_end (prev_bb); | |
5145 | next_insn = NEXT_INSN (nop); | |
5146 | gcc_assert (prev_insn != NULL_RTX | |
5147 | && PREV_INSN (note) == prev_insn); | |
5148 | ||
5149 | NEXT_INSN (prev_insn) = nop; | |
5150 | PREV_INSN (nop) = prev_insn; | |
5151 | ||
5152 | PREV_INSN (note) = nop; | |
5153 | NEXT_INSN (note) = next_insn; | |
5154 | ||
5155 | NEXT_INSN (nop) = note; | |
5156 | PREV_INSN (next_insn) = note; | |
5157 | ||
5158 | BB_END (prev_bb) = nop; | |
5159 | BLOCK_FOR_INSN (nop) = prev_bb; | |
5160 | } | |
5161 | ||
5162 | /* Prepare a place to insert the chosen expression on BND. */ | |
5163 | static insn_t | |
5164 | prepare_place_to_insert (bnd_t bnd) | |
5165 | { | |
5166 | insn_t place_to_insert; | |
5167 | ||
5168 | /* Init place_to_insert before calling move_op, as the later | |
5169 | can possibly remove BND_TO (bnd). */ | |
5170 | if (/* If this is not the first insn scheduled. */ | |
5171 | BND_PTR (bnd)) | |
5172 | { | |
5173 | /* Add it after last scheduled. */ | |
5174 | place_to_insert = ILIST_INSN (BND_PTR (bnd)); | |
b5b8b0ac AO |
5175 | if (DEBUG_INSN_P (place_to_insert)) |
5176 | { | |
5177 | ilist_t l = BND_PTR (bnd); | |
5178 | while ((l = ILIST_NEXT (l)) && | |
5179 | DEBUG_INSN_P (ILIST_INSN (l))) | |
5180 | ; | |
5181 | if (!l) | |
5182 | place_to_insert = NULL; | |
5183 | } | |
e855c69d AB |
5184 | } |
5185 | else | |
b5b8b0ac AO |
5186 | place_to_insert = NULL; |
5187 | ||
5188 | if (!place_to_insert) | |
e855c69d AB |
5189 | { |
5190 | /* Add it before BND_TO. The difference is in the | |
5191 | basic block, where INSN will be added. */ | |
5192 | place_to_insert = get_nop_from_pool (BND_TO (bnd)); | |
5193 | gcc_assert (BLOCK_FOR_INSN (place_to_insert) | |
5194 | == BLOCK_FOR_INSN (BND_TO (bnd))); | |
5195 | } | |
5196 | ||
5197 | return place_to_insert; | |
5198 | } | |
5199 | ||
b8698a0f | 5200 | /* Find original instructions for EXPR_SEQ and move it to BND boundary. |
e855c69d | 5201 | Return the expression to emit in C_EXPR. */ |
72a54528 | 5202 | static bool |
b8698a0f | 5203 | move_exprs_to_boundary (bnd_t bnd, expr_t expr_vliw, |
e855c69d AB |
5204 | av_set_t expr_seq, expr_t c_expr) |
5205 | { | |
72a54528 | 5206 | bool b, should_move; |
e855c69d AB |
5207 | unsigned book_uid; |
5208 | bitmap_iterator bi; | |
5209 | int n_bookkeeping_copies_before_moveop; | |
5210 | ||
5211 | /* Make a move. This call will remove the original operation, | |
5212 | insert all necessary bookkeeping instructions and update the | |
5213 | data sets. After that all we have to do is add the operation | |
5214 | at before BND_TO (BND). */ | |
5215 | n_bookkeeping_copies_before_moveop = stat_bookkeeping_copies; | |
5216 | max_uid_before_move_op = get_max_uid (); | |
5217 | bitmap_clear (current_copies); | |
5218 | bitmap_clear (current_originators); | |
5219 | ||
b8698a0f | 5220 | b = move_op (BND_TO (bnd), expr_seq, expr_vliw, |
72a54528 | 5221 | get_dest_from_orig_ops (expr_seq), c_expr, &should_move); |
e855c69d | 5222 | |
b8698a0f | 5223 | /* We should be able to find the expression we've chosen for |
e855c69d | 5224 | scheduling. */ |
72a54528 | 5225 | gcc_assert (b); |
b8698a0f | 5226 | |
e855c69d AB |
5227 | if (stat_bookkeeping_copies > n_bookkeeping_copies_before_moveop) |
5228 | stat_insns_needed_bookkeeping++; | |
b8698a0f | 5229 | |
e855c69d AB |
5230 | EXECUTE_IF_SET_IN_BITMAP (current_copies, 0, book_uid, bi) |
5231 | { | |
14f30b87 AM |
5232 | unsigned uid; |
5233 | bitmap_iterator bi; | |
5234 | ||
e855c69d AB |
5235 | /* We allocate these bitmaps lazily. */ |
5236 | if (! INSN_ORIGINATORS_BY_UID (book_uid)) | |
5237 | INSN_ORIGINATORS_BY_UID (book_uid) = BITMAP_ALLOC (NULL); | |
b8698a0f L |
5238 | |
5239 | bitmap_copy (INSN_ORIGINATORS_BY_UID (book_uid), | |
e855c69d | 5240 | current_originators); |
14f30b87 AM |
5241 | |
5242 | /* Transitively add all originators' originators. */ | |
5243 | EXECUTE_IF_SET_IN_BITMAP (current_originators, 0, uid, bi) | |
5244 | if (INSN_ORIGINATORS_BY_UID (uid)) | |
5245 | bitmap_ior_into (INSN_ORIGINATORS_BY_UID (book_uid), | |
5246 | INSN_ORIGINATORS_BY_UID (uid)); | |
e855c69d | 5247 | } |
72a54528 AM |
5248 | |
5249 | return should_move; | |
e855c69d AB |
5250 | } |
5251 | ||
5252 | ||
5253 | /* Debug a DFA state as an array of bytes. */ | |
5254 | static void | |
5255 | debug_state (state_t state) | |
5256 | { | |
5257 | unsigned char *p; | |
5258 | unsigned int i, size = dfa_state_size; | |
5259 | ||
5260 | sel_print ("state (%u):", size); | |
5261 | for (i = 0, p = (unsigned char *) state; i < size; i++) | |
5262 | sel_print (" %d", p[i]); | |
5263 | sel_print ("\n"); | |
5264 | } | |
5265 | ||
b8698a0f | 5266 | /* Advance state on FENCE with INSN. Return true if INSN is |
e855c69d AB |
5267 | an ASM, and we should advance state once more. */ |
5268 | static bool | |
5269 | advance_state_on_fence (fence_t fence, insn_t insn) | |
5270 | { | |
5271 | bool asm_p; | |
5272 | ||
5273 | if (recog_memoized (insn) >= 0) | |
5274 | { | |
5275 | int res; | |
5276 | state_t temp_state = alloca (dfa_state_size); | |
b8698a0f | 5277 | |
e855c69d AB |
5278 | gcc_assert (!INSN_ASM_P (insn)); |
5279 | asm_p = false; | |
5280 | ||
5281 | memcpy (temp_state, FENCE_STATE (fence), dfa_state_size); | |
5282 | res = state_transition (FENCE_STATE (fence), insn); | |
5283 | gcc_assert (res < 0); | |
5284 | ||
5285 | if (memcmp (temp_state, FENCE_STATE (fence), dfa_state_size)) | |
5286 | { | |
5287 | FENCE_ISSUED_INSNS (fence)++; | |
5288 | ||
5289 | /* We should never issue more than issue_rate insns. */ | |
5290 | if (FENCE_ISSUED_INSNS (fence) > issue_rate) | |
5291 | gcc_unreachable (); | |
5292 | } | |
b8698a0f | 5293 | } |
e855c69d AB |
5294 | else |
5295 | { | |
b8698a0f | 5296 | /* This could be an ASM insn which we'd like to schedule |
e855c69d AB |
5297 | on the next cycle. */ |
5298 | asm_p = INSN_ASM_P (insn); | |
5299 | if (!FENCE_STARTS_CYCLE_P (fence) && asm_p) | |
5300 | advance_one_cycle (fence); | |
5301 | } | |
5302 | ||
5303 | if (sched_verbose >= 2) | |
5304 | debug_state (FENCE_STATE (fence)); | |
b5b8b0ac AO |
5305 | if (!DEBUG_INSN_P (insn)) |
5306 | FENCE_STARTS_CYCLE_P (fence) = 0; | |
136e01a3 | 5307 | FENCE_ISSUE_MORE (fence) = can_issue_more; |
e855c69d AB |
5308 | return asm_p; |
5309 | } | |
5310 | ||
5311 | /* Update FENCE on which INSN was scheduled and this INSN, too. NEED_STALL | |
5312 | is nonzero if we need to stall after issuing INSN. */ | |
5313 | static void | |
5314 | update_fence_and_insn (fence_t fence, insn_t insn, int need_stall) | |
5315 | { | |
5316 | bool asm_p; | |
b8698a0f | 5317 | |
e855c69d AB |
5318 | /* First, reflect that something is scheduled on this fence. */ |
5319 | asm_p = advance_state_on_fence (fence, insn); | |
5320 | FENCE_LAST_SCHEDULED_INSN (fence) = insn; | |
5321 | VEC_safe_push (rtx, gc, FENCE_EXECUTING_INSNS (fence), insn); | |
5322 | if (SCHED_GROUP_P (insn)) | |
5323 | { | |
5324 | FENCE_SCHED_NEXT (fence) = INSN_SCHED_NEXT (insn); | |
5325 | SCHED_GROUP_P (insn) = 0; | |
5326 | } | |
5327 | else | |
5328 | FENCE_SCHED_NEXT (fence) = NULL_RTX; | |
5329 | if (INSN_UID (insn) < FENCE_READY_TICKS_SIZE (fence)) | |
5330 | FENCE_READY_TICKS (fence) [INSN_UID (insn)] = 0; | |
5331 | ||
5332 | /* Set instruction scheduling info. This will be used in bundling, | |
5333 | pipelining, tick computations etc. */ | |
5334 | ++INSN_SCHED_TIMES (insn); | |
5335 | EXPR_TARGET_AVAILABLE (INSN_EXPR (insn)) = true; | |
5336 | EXPR_ORIG_SCHED_CYCLE (INSN_EXPR (insn)) = FENCE_CYCLE (fence); | |
5337 | INSN_AFTER_STALL_P (insn) = FENCE_AFTER_STALL_P (fence); | |
5338 | INSN_SCHED_CYCLE (insn) = FENCE_CYCLE (fence); | |
5339 | ||
5340 | /* This does not account for adjust_cost hooks, just add the biggest | |
b8698a0f | 5341 | constant the hook may add to the latency. TODO: make this |
e855c69d | 5342 | a target dependent constant. */ |
b8698a0f L |
5343 | INSN_READY_CYCLE (insn) |
5344 | = INSN_SCHED_CYCLE (insn) + (INSN_CODE (insn) < 0 | |
e855c69d AB |
5345 | ? 1 |
5346 | : maximal_insn_latency (insn) + 1); | |
5347 | ||
5348 | /* Change these fields last, as they're used above. */ | |
5349 | FENCE_AFTER_STALL_P (fence) = 0; | |
5350 | if (asm_p || need_stall) | |
5351 | advance_one_cycle (fence); | |
b8698a0f | 5352 | |
e855c69d AB |
5353 | /* Indicate that we've scheduled something on this fence. */ |
5354 | FENCE_SCHEDULED_P (fence) = true; | |
5355 | scheduled_something_on_previous_fence = true; | |
5356 | ||
5357 | /* Print debug information when insn's fields are updated. */ | |
5358 | if (sched_verbose >= 2) | |
5359 | { | |
5360 | sel_print ("Scheduling insn: "); | |
5361 | dump_insn_1 (insn, 1); | |
5362 | sel_print ("\n"); | |
5363 | } | |
5364 | } | |
5365 | ||
b5b8b0ac AO |
5366 | /* Update boundary BND (and, if needed, FENCE) with INSN, remove the |
5367 | old boundary from BNDSP, add new boundaries to BNDS_TAIL_P and | |
5368 | return it. */ | |
e855c69d | 5369 | static blist_t * |
b5b8b0ac | 5370 | update_boundaries (fence_t fence, bnd_t bnd, insn_t insn, blist_t *bndsp, |
e855c69d AB |
5371 | blist_t *bnds_tailp) |
5372 | { | |
5373 | succ_iterator si; | |
5374 | insn_t succ; | |
5375 | ||
5376 | advance_deps_context (BND_DC (bnd), insn); | |
b8698a0f | 5377 | FOR_EACH_SUCC_1 (succ, si, insn, |
e855c69d AB |
5378 | SUCCS_NORMAL | SUCCS_SKIP_TO_LOOP_EXITS) |
5379 | { | |
5380 | ilist_t ptr = ilist_copy (BND_PTR (bnd)); | |
b8698a0f | 5381 | |
e855c69d | 5382 | ilist_add (&ptr, insn); |
b5b8b0ac AO |
5383 | |
5384 | if (DEBUG_INSN_P (insn) && sel_bb_end_p (insn) | |
5385 | && is_ineligible_successor (succ, ptr)) | |
5386 | { | |
5387 | ilist_clear (&ptr); | |
5388 | continue; | |
5389 | } | |
5390 | ||
5391 | if (FENCE_INSN (fence) == insn && !sel_bb_end_p (insn)) | |
5392 | { | |
5393 | if (sched_verbose >= 9) | |
5394 | sel_print ("Updating fence insn from %i to %i\n", | |
5395 | INSN_UID (insn), INSN_UID (succ)); | |
5396 | FENCE_INSN (fence) = succ; | |
5397 | } | |
e855c69d AB |
5398 | blist_add (bnds_tailp, succ, ptr, BND_DC (bnd)); |
5399 | bnds_tailp = &BLIST_NEXT (*bnds_tailp); | |
5400 | } | |
b8698a0f | 5401 | |
e855c69d AB |
5402 | blist_remove (bndsp); |
5403 | return bnds_tailp; | |
5404 | } | |
5405 | ||
5406 | /* Schedule EXPR_VLIW on BND. Return the insn emitted. */ | |
5407 | static insn_t | |
5408 | schedule_expr_on_boundary (bnd_t bnd, expr_t expr_vliw, int seqno) | |
5409 | { | |
5410 | av_set_t expr_seq; | |
5411 | expr_t c_expr = XALLOCA (expr_def); | |
5412 | insn_t place_to_insert; | |
5413 | insn_t insn; | |
72a54528 | 5414 | bool should_move; |
e855c69d AB |
5415 | |
5416 | expr_seq = find_sequential_best_exprs (bnd, expr_vliw, true); | |
5417 | ||
5418 | /* In case of scheduling a jump skipping some other instructions, | |
b8698a0f | 5419 | prepare CFG. After this, jump is at the boundary and can be |
e855c69d AB |
5420 | scheduled as usual insn by MOVE_OP. */ |
5421 | if (vinsn_cond_branch_p (EXPR_VINSN (expr_vliw))) | |
5422 | { | |
5423 | insn = EXPR_INSN_RTX (expr_vliw); | |
b8698a0f | 5424 | |
e855c69d | 5425 | /* Speculative jumps are not handled. */ |
b8698a0f | 5426 | if (insn != BND_TO (bnd) |
e855c69d AB |
5427 | && !sel_insn_is_speculation_check (insn)) |
5428 | move_cond_jump (insn, bnd); | |
5429 | } | |
5430 | ||
e855c69d AB |
5431 | /* Find a place for C_EXPR to schedule. */ |
5432 | place_to_insert = prepare_place_to_insert (bnd); | |
72a54528 | 5433 | should_move = move_exprs_to_boundary (bnd, expr_vliw, expr_seq, c_expr); |
e855c69d | 5434 | clear_expr (c_expr); |
b8698a0f L |
5435 | |
5436 | /* Add the instruction. The corner case to care about is when | |
5437 | the expr_seq set has more than one expr, and we chose the one that | |
5438 | is not equal to expr_vliw. Then expr_vliw may be insn in stream, and | |
e855c69d AB |
5439 | we can't use it. Generate the new vinsn. */ |
5440 | if (INSN_IN_STREAM_P (EXPR_INSN_RTX (expr_vliw))) | |
5441 | { | |
5442 | vinsn_t vinsn_new; | |
b8698a0f | 5443 | |
e855c69d AB |
5444 | vinsn_new = vinsn_copy (EXPR_VINSN (expr_vliw), false); |
5445 | change_vinsn_in_expr (expr_vliw, vinsn_new); | |
72a54528 | 5446 | should_move = false; |
e855c69d | 5447 | } |
72a54528 AM |
5448 | if (should_move) |
5449 | insn = sel_move_insn (expr_vliw, seqno, place_to_insert); | |
5450 | else | |
b8698a0f | 5451 | insn = emit_insn_from_expr_after (expr_vliw, NULL, seqno, |
e855c69d | 5452 | place_to_insert); |
e855c69d AB |
5453 | |
5454 | /* Return the nops generated for preserving of data sets back | |
5455 | into pool. */ | |
5456 | if (INSN_NOP_P (place_to_insert)) | |
b5b8b0ac AO |
5457 | return_nop_to_pool (place_to_insert, !DEBUG_INSN_P (insn)); |
5458 | remove_temp_moveop_nops (!DEBUG_INSN_P (insn)); | |
e855c69d AB |
5459 | |
5460 | av_set_clear (&expr_seq); | |
b8698a0f L |
5461 | |
5462 | /* Save the expression scheduled so to reset target availability if we'll | |
e855c69d AB |
5463 | meet it later on the same fence. */ |
5464 | if (EXPR_WAS_RENAMED (expr_vliw)) | |
5465 | vinsn_vec_add (&vec_target_unavailable_vinsns, INSN_EXPR (insn)); | |
5466 | ||
5467 | /* Check that the recent movement didn't destroyed loop | |
5468 | structure. */ | |
5469 | gcc_assert (!pipelining_p | |
5470 | || current_loop_nest == NULL | |
5471 | || loop_latch_edge (current_loop_nest)); | |
5472 | return insn; | |
5473 | } | |
5474 | ||
5475 | /* Stall for N cycles on FENCE. */ | |
5476 | static void | |
5477 | stall_for_cycles (fence_t fence, int n) | |
5478 | { | |
5479 | int could_more; | |
b8698a0f | 5480 | |
e855c69d AB |
5481 | could_more = n > 1 || FENCE_ISSUED_INSNS (fence) < issue_rate; |
5482 | while (n--) | |
5483 | advance_one_cycle (fence); | |
5484 | if (could_more) | |
5485 | FENCE_AFTER_STALL_P (fence) = 1; | |
5486 | } | |
5487 | ||
b8698a0f L |
5488 | /* Gather a parallel group of insns at FENCE and assign their seqno |
5489 | to SEQNO. All scheduled insns are gathered in SCHEDULED_INSNS_TAILPP | |
e855c69d AB |
5490 | list for later recalculation of seqnos. */ |
5491 | static void | |
5492 | fill_insns (fence_t fence, int seqno, ilist_t **scheduled_insns_tailpp) | |
5493 | { | |
5494 | blist_t bnds = NULL, *bnds_tailp; | |
5495 | av_set_t av_vliw = NULL; | |
5496 | insn_t insn = FENCE_INSN (fence); | |
5497 | ||
5498 | if (sched_verbose >= 2) | |
b8698a0f | 5499 | sel_print ("Starting fill_insns for insn %d, cycle %d\n", |
e855c69d AB |
5500 | INSN_UID (insn), FENCE_CYCLE (fence)); |
5501 | ||
5502 | blist_add (&bnds, insn, NULL, FENCE_DC (fence)); | |
5503 | bnds_tailp = &BLIST_NEXT (bnds); | |
5504 | set_target_context (FENCE_TC (fence)); | |
136e01a3 | 5505 | can_issue_more = FENCE_ISSUE_MORE (fence); |
e855c69d AB |
5506 | target_bb = INSN_BB (insn); |
5507 | ||
5508 | /* Do while we can add any operation to the current group. */ | |
5509 | do | |
5510 | { | |
5511 | blist_t *bnds_tailp1, *bndsp; | |
5512 | expr_t expr_vliw; | |
5513 | int need_stall; | |
5514 | int was_stall = 0, scheduled_insns = 0, stall_iterations = 0; | |
5515 | int max_insns = pipelining_p ? issue_rate : 2 * issue_rate; | |
5516 | int max_stall = pipelining_p ? 1 : 3; | |
b5b8b0ac AO |
5517 | bool last_insn_was_debug = false; |
5518 | bool was_debug_bb_end_p = false; | |
5519 | ||
e855c69d AB |
5520 | compute_av_set_on_boundaries (fence, bnds, &av_vliw); |
5521 | remove_insns_that_need_bookkeeping (fence, &av_vliw); | |
5522 | remove_insns_for_debug (bnds, &av_vliw); | |
5523 | ||
5524 | /* Return early if we have nothing to schedule. */ | |
5525 | if (av_vliw == NULL) | |
5526 | break; | |
5527 | ||
5528 | /* Choose the best expression and, if needed, destination register | |
5529 | for it. */ | |
5530 | do | |
5531 | { | |
5532 | expr_vliw = find_best_expr (&av_vliw, bnds, fence, &need_stall); | |
5533 | if (!expr_vliw && need_stall) | |
5534 | { | |
5535 | /* All expressions required a stall. Do not recompute av sets | |
5536 | as we'll get the same answer (modulo the insns between | |
5537 | the fence and its boundary, which will not be available for | |
5538 | pipelining). */ | |
5539 | gcc_assert (! expr_vliw && stall_iterations < 2); | |
5540 | was_stall++; | |
5541 | /* If we are going to stall for too long, break to recompute av | |
5542 | sets and bring more insns for pipelining. */ | |
5543 | if (need_stall <= 3) | |
5544 | stall_for_cycles (fence, need_stall); | |
5545 | else | |
5546 | { | |
5547 | stall_for_cycles (fence, 1); | |
5548 | break; | |
5549 | } | |
5550 | } | |
5551 | } | |
5552 | while (! expr_vliw && need_stall); | |
b8698a0f | 5553 | |
e855c69d AB |
5554 | /* Now either we've selected expr_vliw or we have nothing to schedule. */ |
5555 | if (!expr_vliw) | |
5556 | { | |
5557 | av_set_clear (&av_vliw); | |
5558 | break; | |
5559 | } | |
5560 | ||
5561 | bndsp = &bnds; | |
5562 | bnds_tailp1 = bnds_tailp; | |
5563 | ||
5564 | do | |
b8698a0f | 5565 | /* This code will be executed only once until we'd have several |
e855c69d AB |
5566 | boundaries per fence. */ |
5567 | { | |
5568 | bnd_t bnd = BLIST_BND (*bndsp); | |
5569 | ||
5570 | if (!av_set_is_in_p (BND_AV1 (bnd), EXPR_VINSN (expr_vliw))) | |
5571 | { | |
5572 | bndsp = &BLIST_NEXT (*bndsp); | |
5573 | continue; | |
5574 | } | |
b8698a0f | 5575 | |
e855c69d | 5576 | insn = schedule_expr_on_boundary (bnd, expr_vliw, seqno); |
b5b8b0ac AO |
5577 | last_insn_was_debug = DEBUG_INSN_P (insn); |
5578 | if (last_insn_was_debug) | |
5579 | was_debug_bb_end_p = (insn == BND_TO (bnd) && sel_bb_end_p (insn)); | |
e855c69d | 5580 | update_fence_and_insn (fence, insn, need_stall); |
b5b8b0ac | 5581 | bnds_tailp = update_boundaries (fence, bnd, insn, bndsp, bnds_tailp); |
e855c69d AB |
5582 | |
5583 | /* Add insn to the list of scheduled on this cycle instructions. */ | |
5584 | ilist_add (*scheduled_insns_tailpp, insn); | |
5585 | *scheduled_insns_tailpp = &ILIST_NEXT (**scheduled_insns_tailpp); | |
5586 | } | |
5587 | while (*bndsp != *bnds_tailp1); | |
5588 | ||
5589 | av_set_clear (&av_vliw); | |
b5b8b0ac AO |
5590 | if (!last_insn_was_debug) |
5591 | scheduled_insns++; | |
e855c69d AB |
5592 | |
5593 | /* We currently support information about candidate blocks only for | |
5594 | one 'target_bb' block. Hence we can't schedule after jump insn, | |
5595 | as this will bring two boundaries and, hence, necessity to handle | |
5596 | information for two or more blocks concurrently. */ | |
b5b8b0ac | 5597 | if ((last_insn_was_debug ? was_debug_bb_end_p : sel_bb_end_p (insn)) |
b8698a0f L |
5598 | || (was_stall |
5599 | && (was_stall >= max_stall | |
e855c69d AB |
5600 | || scheduled_insns >= max_insns))) |
5601 | break; | |
5602 | } | |
5603 | while (bnds); | |
5604 | ||
5605 | gcc_assert (!FENCE_BNDS (fence)); | |
b8698a0f | 5606 | |
e855c69d AB |
5607 | /* Update boundaries of the FENCE. */ |
5608 | while (bnds) | |
5609 | { | |
5610 | ilist_t ptr = BND_PTR (BLIST_BND (bnds)); | |
5611 | ||
5612 | if (ptr) | |
5613 | { | |
5614 | insn = ILIST_INSN (ptr); | |
5615 | ||
5616 | if (!ilist_is_in_p (FENCE_BNDS (fence), insn)) | |
5617 | ilist_add (&FENCE_BNDS (fence), insn); | |
5618 | } | |
b8698a0f | 5619 | |
e855c69d AB |
5620 | blist_remove (&bnds); |
5621 | } | |
5622 | ||
5623 | /* Update target context on the fence. */ | |
5624 | reset_target_context (FENCE_TC (fence), false); | |
5625 | } | |
5626 | ||
5627 | /* All exprs in ORIG_OPS must have the same destination register or memory. | |
5628 | Return that destination. */ | |
5629 | static rtx | |
5630 | get_dest_from_orig_ops (av_set_t orig_ops) | |
5631 | { | |
5632 | rtx dest = NULL_RTX; | |
5633 | av_set_iterator av_it; | |
5634 | expr_t expr; | |
5635 | bool first_p = true; | |
5636 | ||
5637 | FOR_EACH_EXPR (expr, av_it, orig_ops) | |
5638 | { | |
5639 | rtx x = EXPR_LHS (expr); | |
5640 | ||
5641 | if (first_p) | |
5642 | { | |
5643 | first_p = false; | |
5644 | dest = x; | |
5645 | } | |
5646 | else | |
5647 | gcc_assert (dest == x | |
5648 | || (dest != NULL_RTX && x != NULL_RTX | |
5649 | && rtx_equal_p (dest, x))); | |
5650 | } | |
5651 | ||
5652 | return dest; | |
5653 | } | |
5654 | ||
5655 | /* Update data sets for the bookkeeping block and record those expressions | |
5656 | which become no longer available after inserting this bookkeeping. */ | |
5657 | static void | |
5658 | update_and_record_unavailable_insns (basic_block book_block) | |
5659 | { | |
5660 | av_set_iterator i; | |
5661 | av_set_t old_av_set = NULL; | |
5662 | expr_t cur_expr; | |
5663 | rtx bb_end = sel_bb_end (book_block); | |
5664 | ||
b8698a0f | 5665 | /* First, get correct liveness in the bookkeeping block. The problem is |
e855c69d AB |
5666 | the range between the bookeeping insn and the end of block. */ |
5667 | update_liveness_on_insn (bb_end); | |
5668 | if (control_flow_insn_p (bb_end)) | |
5669 | update_liveness_on_insn (PREV_INSN (bb_end)); | |
5670 | ||
5671 | /* If there's valid av_set on BOOK_BLOCK, then there might exist another | |
5672 | fence above, where we may choose to schedule an insn which is | |
5673 | actually blocked from moving up with the bookkeeping we create here. */ | |
5674 | if (AV_SET_VALID_P (sel_bb_head (book_block))) | |
5675 | { | |
5676 | old_av_set = av_set_copy (BB_AV_SET (book_block)); | |
5677 | update_data_sets (sel_bb_head (book_block)); | |
b8698a0f | 5678 | |
e855c69d AB |
5679 | /* Traverse all the expressions in the old av_set and check whether |
5680 | CUR_EXPR is in new AV_SET. */ | |
5681 | FOR_EACH_EXPR (cur_expr, i, old_av_set) | |
5682 | { | |
b8698a0f | 5683 | expr_t new_expr = av_set_lookup (BB_AV_SET (book_block), |
e855c69d AB |
5684 | EXPR_VINSN (cur_expr)); |
5685 | ||
b8698a0f L |
5686 | if (! new_expr |
5687 | /* In this case, we can just turn off the E_T_A bit, but we can't | |
e855c69d | 5688 | represent this information with the current vector. */ |
b8698a0f | 5689 | || EXPR_TARGET_AVAILABLE (new_expr) |
e855c69d AB |
5690 | != EXPR_TARGET_AVAILABLE (cur_expr)) |
5691 | /* Unfortunately, the below code could be also fired up on | |
5692 | separable insns. | |
5693 | FIXME: add an example of how this could happen. */ | |
5694 | vinsn_vec_add (&vec_bookkeeping_blocked_vinsns, cur_expr); | |
5695 | } | |
5696 | ||
5697 | av_set_clear (&old_av_set); | |
5698 | } | |
5699 | } | |
5700 | ||
b8698a0f | 5701 | /* The main effect of this function is that sparams->c_expr is merged |
e855c69d AB |
5702 | with (or copied to) lparams->c_expr_merged. If there's only one successor, |
5703 | we avoid merging anything by copying sparams->c_expr to lparams->c_expr_merged. | |
b8698a0f L |
5704 | lparams->c_expr_merged is copied back to sparams->c_expr after all |
5705 | successors has been traversed. lparams->c_expr_local is an expr allocated | |
5706 | on stack in the caller function, and is used if there is more than one | |
5707 | successor. | |
e855c69d AB |
5708 | |
5709 | SUCC is one of the SUCCS_NORMAL successors of INSN, | |
5710 | MOVEOP_DRV_CALL_RES is the result of call code_motion_path_driver on succ, | |
5711 | LPARAMS and STATIC_PARAMS contain the parameters described above. */ | |
5712 | static void | |
b8698a0f L |
5713 | move_op_merge_succs (insn_t insn ATTRIBUTE_UNUSED, |
5714 | insn_t succ ATTRIBUTE_UNUSED, | |
5715 | int moveop_drv_call_res, | |
e855c69d AB |
5716 | cmpd_local_params_p lparams, void *static_params) |
5717 | { | |
5718 | moveop_static_params_p sparams = (moveop_static_params_p) static_params; | |
5719 | ||
5720 | /* Nothing to do, if original expr wasn't found below. */ | |
5721 | if (moveop_drv_call_res != 1) | |
5722 | return; | |
5723 | ||
5724 | /* If this is a first successor. */ | |
5725 | if (!lparams->c_expr_merged) | |
5726 | { | |
5727 | lparams->c_expr_merged = sparams->c_expr; | |
5728 | sparams->c_expr = lparams->c_expr_local; | |
5729 | } | |
5730 | else | |
5731 | { | |
5732 | /* We must merge all found expressions to get reasonable | |
5733 | EXPR_SPEC_DONE_DS for the resulting insn. If we don't | |
5734 | do so then we can first find the expr with epsilon | |
5735 | speculation success probability and only then with the | |
5736 | good probability. As a result the insn will get epsilon | |
5737 | probability and will never be scheduled because of | |
5738 | weakness_cutoff in find_best_expr. | |
5739 | ||
b8698a0f | 5740 | We call merge_expr_data here instead of merge_expr |
e855c69d AB |
5741 | because due to speculation C_EXPR and X may have the |
5742 | same insns with different speculation types. And as of | |
b8698a0f | 5743 | now such insns are considered non-equal. |
e855c69d | 5744 | |
b8698a0f L |
5745 | However, EXPR_SCHED_TIMES is different -- we must get |
5746 | SCHED_TIMES from a real insn, not a bookkeeping copy. | |
e855c69d | 5747 | We force this here. Instead, we may consider merging |
b8698a0f | 5748 | SCHED_TIMES to the maximum instead of minimum in the |
e855c69d AB |
5749 | below function. */ |
5750 | int old_times = EXPR_SCHED_TIMES (lparams->c_expr_merged); | |
5751 | ||
5752 | merge_expr_data (lparams->c_expr_merged, sparams->c_expr, NULL); | |
5753 | if (EXPR_SCHED_TIMES (sparams->c_expr) == 0) | |
5754 | EXPR_SCHED_TIMES (lparams->c_expr_merged) = old_times; | |
5755 | ||
5756 | clear_expr (sparams->c_expr); | |
5757 | } | |
5758 | } | |
5759 | ||
5760 | /* Add used regs for the successor SUCC into SPARAMS->USED_REGS. | |
5761 | ||
5762 | SUCC is one of the SUCCS_NORMAL successors of INSN, | |
5763 | MOVEOP_DRV_CALL_RES is the result of call code_motion_path_driver on succ or 0, | |
5764 | if SUCC is one of SUCCS_BACK or SUCCS_OUT. | |
5765 | STATIC_PARAMS contain USED_REGS set. */ | |
5766 | static void | |
b8698a0f L |
5767 | fur_merge_succs (insn_t insn ATTRIBUTE_UNUSED, insn_t succ, |
5768 | int moveop_drv_call_res, | |
5769 | cmpd_local_params_p lparams ATTRIBUTE_UNUSED, | |
e855c69d AB |
5770 | void *static_params) |
5771 | { | |
5772 | regset succ_live; | |
5773 | fur_static_params_p sparams = (fur_static_params_p) static_params; | |
5774 | ||
5775 | /* Here we compute live regsets only for branches that do not lie | |
b8698a0f | 5776 | on the code motion paths. These branches correspond to value |
e855c69d AB |
5777 | MOVEOP_DRV_CALL_RES==0 and include SUCCS_BACK and SUCCS_OUT, though |
5778 | for such branches code_motion_path_driver is not called. */ | |
5779 | if (moveop_drv_call_res != 0) | |
5780 | return; | |
5781 | ||
5782 | /* Mark all registers that do not meet the following condition: | |
5783 | (3) not live on the other path of any conditional branch | |
5784 | that is passed by the operation, in case original | |
5785 | operations are not present on both paths of the | |
5786 | conditional branch. */ | |
5787 | succ_live = compute_live (succ); | |
5788 | IOR_REG_SET (sparams->used_regs, succ_live); | |
5789 | } | |
5790 | ||
5791 | /* This function is called after the last successor. Copies LP->C_EXPR_MERGED | |
5792 | into SP->CEXPR. */ | |
5793 | static void | |
5794 | move_op_after_merge_succs (cmpd_local_params_p lp, void *sparams) | |
b8698a0f | 5795 | { |
e855c69d AB |
5796 | moveop_static_params_p sp = (moveop_static_params_p) sparams; |
5797 | ||
5798 | sp->c_expr = lp->c_expr_merged; | |
5799 | } | |
5800 | ||
5801 | /* Track bookkeeping copies created, insns scheduled, and blocks for | |
5802 | rescheduling when INSN is found by move_op. */ | |
5803 | static void | |
5804 | track_scheduled_insns_and_blocks (rtx insn) | |
5805 | { | |
5806 | /* Even if this insn can be a copy that will be removed during current move_op, | |
5807 | we still need to count it as an originator. */ | |
5808 | bitmap_set_bit (current_originators, INSN_UID (insn)); | |
5809 | ||
fcaa4ca4 | 5810 | if (!bitmap_clear_bit (current_copies, INSN_UID (insn))) |
e855c69d AB |
5811 | { |
5812 | /* Note that original block needs to be rescheduled, as we pulled an | |
5813 | instruction out of it. */ | |
5814 | if (INSN_SCHED_TIMES (insn) > 0) | |
5815 | bitmap_set_bit (blocks_to_reschedule, BLOCK_FOR_INSN (insn)->index); | |
b5b8b0ac | 5816 | else if (INSN_UID (insn) < first_emitted_uid && !DEBUG_INSN_P (insn)) |
e855c69d AB |
5817 | num_insns_scheduled++; |
5818 | } | |
e855c69d AB |
5819 | |
5820 | /* For instructions we must immediately remove insn from the | |
5821 | stream, so subsequent update_data_sets () won't include this | |
5822 | insn into av_set. | |
5823 | For expr we must make insn look like "INSN_REG (insn) := c_expr". */ | |
5824 | if (INSN_UID (insn) > max_uid_before_move_op) | |
5825 | stat_bookkeeping_copies--; | |
5826 | } | |
5827 | ||
b8698a0f | 5828 | /* Emit a register-register copy for INSN if needed. Return true if |
e855c69d AB |
5829 | emitted one. PARAMS is the move_op static parameters. */ |
5830 | static bool | |
b8698a0f | 5831 | maybe_emit_renaming_copy (rtx insn, |
e855c69d AB |
5832 | moveop_static_params_p params) |
5833 | { | |
5834 | bool insn_emitted = false; | |
f07013eb | 5835 | rtx cur_reg; |
e855c69d | 5836 | |
f07013eb AM |
5837 | /* Bail out early when expression can not be renamed at all. */ |
5838 | if (!EXPR_SEPARABLE_P (params->c_expr)) | |
5839 | return false; | |
5840 | ||
5841 | cur_reg = expr_dest_reg (params->c_expr); | |
5842 | gcc_assert (cur_reg && params->dest && REG_P (params->dest)); | |
e855c69d AB |
5843 | |
5844 | /* If original operation has expr and the register chosen for | |
5845 | that expr is not original operation's dest reg, substitute | |
5846 | operation's right hand side with the register chosen. */ | |
f07013eb | 5847 | if (REGNO (params->dest) != REGNO (cur_reg)) |
e855c69d AB |
5848 | { |
5849 | insn_t reg_move_insn, reg_move_insn_rtx; | |
b8698a0f L |
5850 | |
5851 | reg_move_insn_rtx = create_insn_rtx_with_rhs (INSN_VINSN (insn), | |
e855c69d | 5852 | params->dest); |
b8698a0f L |
5853 | reg_move_insn = sel_gen_insn_from_rtx_after (reg_move_insn_rtx, |
5854 | INSN_EXPR (insn), | |
5855 | INSN_SEQNO (insn), | |
e855c69d AB |
5856 | insn); |
5857 | EXPR_SPEC_DONE_DS (INSN_EXPR (reg_move_insn)) = 0; | |
5858 | replace_dest_with_reg_in_expr (params->c_expr, params->dest); | |
b8698a0f | 5859 | |
e855c69d AB |
5860 | insn_emitted = true; |
5861 | params->was_renamed = true; | |
5862 | } | |
b8698a0f | 5863 | |
e855c69d AB |
5864 | return insn_emitted; |
5865 | } | |
5866 | ||
b8698a0f L |
5867 | /* Emit a speculative check for INSN speculated as EXPR if needed. |
5868 | Return true if we've emitted one. PARAMS is the move_op static | |
e855c69d AB |
5869 | parameters. */ |
5870 | static bool | |
5871 | maybe_emit_speculative_check (rtx insn, expr_t expr, | |
5872 | moveop_static_params_p params) | |
5873 | { | |
5874 | bool insn_emitted = false; | |
5875 | insn_t x; | |
5876 | ds_t check_ds; | |
5877 | ||
5878 | check_ds = get_spec_check_type_for_insn (insn, expr); | |
5879 | if (check_ds != 0) | |
5880 | { | |
5881 | /* A speculation check should be inserted. */ | |
5882 | x = create_speculation_check (params->c_expr, check_ds, insn); | |
5883 | insn_emitted = true; | |
5884 | } | |
5885 | else | |
5886 | { | |
5887 | EXPR_SPEC_DONE_DS (INSN_EXPR (insn)) = 0; | |
5888 | x = insn; | |
5889 | } | |
b8698a0f | 5890 | |
e855c69d AB |
5891 | gcc_assert (EXPR_SPEC_DONE_DS (INSN_EXPR (x)) == 0 |
5892 | && EXPR_SPEC_TO_CHECK_DS (INSN_EXPR (x)) == 0); | |
5893 | return insn_emitted; | |
5894 | } | |
5895 | ||
b8698a0f L |
5896 | /* Handle transformations that leave an insn in place of original |
5897 | insn such as renaming/speculation. Return true if one of such | |
e855c69d AB |
5898 | transformations actually happened, and we have emitted this insn. */ |
5899 | static bool | |
b8698a0f | 5900 | handle_emitting_transformations (rtx insn, expr_t expr, |
e855c69d AB |
5901 | moveop_static_params_p params) |
5902 | { | |
5903 | bool insn_emitted = false; | |
5904 | ||
5905 | insn_emitted = maybe_emit_renaming_copy (insn, params); | |
5906 | insn_emitted |= maybe_emit_speculative_check (insn, expr, params); | |
5907 | ||
5908 | return insn_emitted; | |
b8698a0f | 5909 | } |
e855c69d | 5910 | |
b5b8b0ac AO |
5911 | /* If INSN is the only insn in the basic block (not counting JUMP, |
5912 | which may be a jump to next insn, and DEBUG_INSNs), we want to | |
5913 | leave a NOP there till the return to fill_insns. */ | |
5914 | ||
5915 | static bool | |
5916 | need_nop_to_preserve_insn_bb (rtx insn) | |
e855c69d | 5917 | { |
b5b8b0ac | 5918 | insn_t bb_head, bb_end, bb_next, in_next; |
e855c69d AB |
5919 | basic_block bb = BLOCK_FOR_INSN (insn); |
5920 | ||
e855c69d AB |
5921 | bb_head = sel_bb_head (bb); |
5922 | bb_end = sel_bb_end (bb); | |
e855c69d | 5923 | |
b5b8b0ac AO |
5924 | if (bb_head == bb_end) |
5925 | return true; | |
5926 | ||
5927 | while (bb_head != bb_end && DEBUG_INSN_P (bb_head)) | |
5928 | bb_head = NEXT_INSN (bb_head); | |
5929 | ||
5930 | if (bb_head == bb_end) | |
5931 | return true; | |
5932 | ||
5933 | while (bb_head != bb_end && DEBUG_INSN_P (bb_end)) | |
5934 | bb_end = PREV_INSN (bb_end); | |
5935 | ||
5936 | if (bb_head == bb_end) | |
5937 | return true; | |
5938 | ||
5939 | bb_next = NEXT_INSN (bb_head); | |
5940 | while (bb_next != bb_end && DEBUG_INSN_P (bb_next)) | |
5941 | bb_next = NEXT_INSN (bb_next); | |
5942 | ||
5943 | if (bb_next == bb_end && JUMP_P (bb_end)) | |
5944 | return true; | |
5945 | ||
5946 | in_next = NEXT_INSN (insn); | |
5947 | while (DEBUG_INSN_P (in_next)) | |
5948 | in_next = NEXT_INSN (in_next); | |
5949 | ||
5950 | if (IN_CURRENT_FENCE_P (in_next)) | |
5951 | return true; | |
5952 | ||
5953 | return false; | |
5954 | } | |
5955 | ||
5956 | /* Remove INSN from stream. When ONLY_DISCONNECT is true, its data | |
5957 | is not removed but reused when INSN is re-emitted. */ | |
5958 | static void | |
5959 | remove_insn_from_stream (rtx insn, bool only_disconnect) | |
5960 | { | |
e855c69d AB |
5961 | /* If there's only one insn in the BB, make sure that a nop is |
5962 | inserted into it, so the basic block won't disappear when we'll | |
5963 | delete INSN below with sel_remove_insn. It should also survive | |
b8698a0f | 5964 | till the return to fill_insns. */ |
b5b8b0ac | 5965 | if (need_nop_to_preserve_insn_bb (insn)) |
e855c69d | 5966 | { |
b5b8b0ac | 5967 | insn_t nop = get_nop_from_pool (insn); |
e855c69d AB |
5968 | gcc_assert (INSN_NOP_P (nop)); |
5969 | VEC_safe_push (insn_t, heap, vec_temp_moveop_nops, nop); | |
5970 | } | |
5971 | ||
5972 | sel_remove_insn (insn, only_disconnect, false); | |
5973 | } | |
5974 | ||
5975 | /* This function is called when original expr is found. | |
b8698a0f | 5976 | INSN - current insn traversed, EXPR - the corresponding expr found. |
e855c69d AB |
5977 | LPARAMS is the local parameters of code modion driver, STATIC_PARAMS |
5978 | is static parameters of move_op. */ | |
5979 | static void | |
b8698a0f L |
5980 | move_op_orig_expr_found (insn_t insn, expr_t expr, |
5981 | cmpd_local_params_p lparams ATTRIBUTE_UNUSED, | |
e855c69d AB |
5982 | void *static_params) |
5983 | { | |
5984 | bool only_disconnect, insn_emitted; | |
5985 | moveop_static_params_p params = (moveop_static_params_p) static_params; | |
b8698a0f | 5986 | |
e855c69d AB |
5987 | copy_expr_onside (params->c_expr, INSN_EXPR (insn)); |
5988 | track_scheduled_insns_and_blocks (insn); | |
5989 | insn_emitted = handle_emitting_transformations (insn, expr, params); | |
5990 | only_disconnect = (params->uid == INSN_UID (insn) | |
5991 | && ! insn_emitted && ! EXPR_WAS_CHANGED (expr)); | |
72a54528 AM |
5992 | |
5993 | /* Mark that we've disconnected an insn. */ | |
5994 | if (only_disconnect) | |
5995 | params->uid = -1; | |
e855c69d AB |
5996 | remove_insn_from_stream (insn, only_disconnect); |
5997 | } | |
5998 | ||
5999 | /* The function is called when original expr is found. | |
6000 | INSN - current insn traversed, EXPR - the corresponding expr found, | |
6001 | crosses_call and original_insns in STATIC_PARAMS are updated. */ | |
6002 | static void | |
6003 | fur_orig_expr_found (insn_t insn, expr_t expr ATTRIBUTE_UNUSED, | |
6004 | cmpd_local_params_p lparams ATTRIBUTE_UNUSED, | |
6005 | void *static_params) | |
6006 | { | |
6007 | fur_static_params_p params = (fur_static_params_p) static_params; | |
6008 | regset tmp; | |
6009 | ||
6010 | if (CALL_P (insn)) | |
6011 | params->crosses_call = true; | |
6012 | ||
6013 | def_list_add (params->original_insns, insn, params->crosses_call); | |
6014 | ||
6015 | /* Mark the registers that do not meet the following condition: | |
b8698a0f L |
6016 | (2) not among the live registers of the point |
6017 | immediately following the first original operation on | |
e855c69d AB |
6018 | a given downward path, except for the original target |
6019 | register of the operation. */ | |
6020 | tmp = get_clear_regset_from_pool (); | |
6021 | compute_live_below_insn (insn, tmp); | |
6022 | AND_COMPL_REG_SET (tmp, INSN_REG_SETS (insn)); | |
6023 | AND_COMPL_REG_SET (tmp, INSN_REG_CLOBBERS (insn)); | |
6024 | IOR_REG_SET (params->used_regs, tmp); | |
6025 | return_regset_to_pool (tmp); | |
6026 | ||
6027 | /* (*1) We need to add to USED_REGS registers that are read by | |
6028 | INSN's lhs. This may lead to choosing wrong src register. | |
6029 | E.g. (scheduling const expr enabled): | |
6030 | ||
6031 | 429: ax=0x0 <- Can't use AX for this expr (0x0) | |
6032 | 433: dx=[bp-0x18] | |
6033 | 427: [ax+dx+0x1]=ax | |
6034 | REG_DEAD: ax | |
6035 | 168: di=dx | |
6036 | REG_DEAD: dx | |
6037 | */ | |
b8698a0f | 6038 | /* FIXME: see comment above and enable MEM_P |
e855c69d AB |
6039 | in vinsn_separable_p. */ |
6040 | gcc_assert (!VINSN_SEPARABLE_P (INSN_VINSN (insn)) | |
6041 | || !MEM_P (INSN_LHS (insn))); | |
6042 | } | |
6043 | ||
6044 | /* This function is called on the ascending pass, before returning from | |
6045 | current basic block. */ | |
6046 | static void | |
b8698a0f | 6047 | move_op_at_first_insn (insn_t insn, cmpd_local_params_p lparams, |
e855c69d AB |
6048 | void *static_params) |
6049 | { | |
6050 | moveop_static_params_p sparams = (moveop_static_params_p) static_params; | |
6051 | basic_block book_block = NULL; | |
6052 | ||
b8698a0f | 6053 | /* When we have removed the boundary insn for scheduling, which also |
e855c69d | 6054 | happened to be the end insn in its bb, we don't need to update sets. */ |
b8698a0f | 6055 | if (!lparams->removed_last_insn |
e855c69d AB |
6056 | && lparams->e1 |
6057 | && sel_bb_head_p (insn)) | |
6058 | { | |
6059 | /* We should generate bookkeeping code only if we are not at the | |
6060 | top level of the move_op. */ | |
6061 | if (sel_num_cfg_preds_gt_1 (insn)) | |
6062 | book_block = generate_bookkeeping_insn (sparams->c_expr, | |
6063 | lparams->e1, lparams->e2); | |
6064 | /* Update data sets for the current insn. */ | |
6065 | update_data_sets (insn); | |
6066 | } | |
b8698a0f | 6067 | |
e855c69d | 6068 | /* If bookkeeping code was inserted, we need to update av sets of basic |
b8698a0f | 6069 | block that received bookkeeping. After generation of bookkeeping insn, |
e855c69d | 6070 | bookkeeping block does not contain valid av set because we are not following |
b8698a0f | 6071 | the original algorithm in every detail with regards to e.g. renaming |
e855c69d | 6072 | simple reg-reg copies. Consider example: |
b8698a0f | 6073 | |
e855c69d AB |
6074 | bookkeeping block scheduling fence |
6075 | \ / | |
6076 | \ join / | |
6077 | ---------- | |
6078 | | | | |
6079 | ---------- | |
6080 | / \ | |
6081 | / \ | |
6082 | r1 := r2 r1 := r3 | |
6083 | ||
b8698a0f | 6084 | We try to schedule insn "r1 := r3" on the current |
e855c69d AB |
6085 | scheduling fence. Also, note that av set of bookkeeping block |
6086 | contain both insns "r1 := r2" and "r1 := r3". When the insn has | |
6087 | been scheduled, the CFG is as follows: | |
6088 | ||
6089 | r1 := r3 r1 := r3 | |
6090 | bookkeeping block scheduling fence | |
6091 | \ / | |
6092 | \ join / | |
6093 | ---------- | |
6094 | | | | |
6095 | ---------- | |
6096 | / \ | |
6097 | / \ | |
6098 | r1 := r2 | |
6099 | ||
6100 | Here, insn "r1 := r3" was scheduled at the current scheduling point | |
6101 | and bookkeeping code was generated at the bookeeping block. This | |
6102 | way insn "r1 := r2" is no longer available as a whole instruction | |
6103 | (but only as expr) ahead of insn "r1 := r3" in bookkeeping block. | |
b8698a0f | 6104 | This situation is handled by calling update_data_sets. |
e855c69d AB |
6105 | |
6106 | Since update_data_sets is called only on the bookkeeping block, and | |
b8698a0f | 6107 | it also may have predecessors with av_sets, containing instructions that |
e855c69d AB |
6108 | are no longer available, we save all such expressions that become |
6109 | unavailable during data sets update on the bookkeeping block in | |
b8698a0f L |
6110 | VEC_BOOKKEEPING_BLOCKED_VINSNS. Later we avoid selecting such |
6111 | expressions for scheduling. This allows us to avoid recomputation of | |
e855c69d | 6112 | av_sets outside the code motion path. */ |
b8698a0f | 6113 | |
e855c69d AB |
6114 | if (book_block) |
6115 | update_and_record_unavailable_insns (book_block); | |
6116 | ||
6117 | /* If INSN was previously marked for deletion, it's time to do it. */ | |
6118 | if (lparams->removed_last_insn) | |
6119 | insn = PREV_INSN (insn); | |
b8698a0f | 6120 | |
e855c69d AB |
6121 | /* Do not tidy control flow at the topmost moveop, as we can erroneously |
6122 | kill a block with a single nop in which the insn should be emitted. */ | |
6123 | if (lparams->e1) | |
6124 | tidy_control_flow (BLOCK_FOR_INSN (insn), true); | |
6125 | } | |
6126 | ||
6127 | /* This function is called on the ascending pass, before returning from the | |
6128 | current basic block. */ | |
6129 | static void | |
b8698a0f L |
6130 | fur_at_first_insn (insn_t insn, |
6131 | cmpd_local_params_p lparams ATTRIBUTE_UNUSED, | |
e855c69d AB |
6132 | void *static_params ATTRIBUTE_UNUSED) |
6133 | { | |
6134 | gcc_assert (!sel_bb_head_p (insn) || AV_SET_VALID_P (insn) | |
6135 | || AV_LEVEL (insn) == -1); | |
6136 | } | |
6137 | ||
6138 | /* Called on the backward stage of recursion to call moveup_expr for insn | |
6139 | and sparams->c_expr. */ | |
6140 | static void | |
6141 | move_op_ascend (insn_t insn, void *static_params) | |
6142 | { | |
6143 | enum MOVEUP_EXPR_CODE res; | |
6144 | moveop_static_params_p sparams = (moveop_static_params_p) static_params; | |
6145 | ||
6146 | if (! INSN_NOP_P (insn)) | |
6147 | { | |
6148 | res = moveup_expr_cached (sparams->c_expr, insn, false); | |
6149 | gcc_assert (res != MOVEUP_EXPR_NULL); | |
6150 | } | |
6151 | ||
6152 | /* Update liveness for this insn as it was invalidated. */ | |
6153 | update_liveness_on_insn (insn); | |
6154 | } | |
6155 | ||
b8698a0f L |
6156 | /* This function is called on enter to the basic block. |
6157 | Returns TRUE if this block already have been visited and | |
e855c69d AB |
6158 | code_motion_path_driver should return 1, FALSE otherwise. */ |
6159 | static int | |
b8698a0f | 6160 | fur_on_enter (insn_t insn ATTRIBUTE_UNUSED, cmpd_local_params_p local_params, |
e855c69d AB |
6161 | void *static_params, bool visited_p) |
6162 | { | |
6163 | fur_static_params_p sparams = (fur_static_params_p) static_params; | |
6164 | ||
6165 | if (visited_p) | |
6166 | { | |
6167 | /* If we have found something below this block, there should be at | |
6168 | least one insn in ORIGINAL_INSNS. */ | |
6169 | gcc_assert (*sparams->original_insns); | |
6170 | ||
6171 | /* Adjust CROSSES_CALL, since we may have come to this block along | |
6172 | different path. */ | |
6173 | DEF_LIST_DEF (*sparams->original_insns)->crosses_call | |
6174 | |= sparams->crosses_call; | |
6175 | } | |
6176 | else | |
6177 | local_params->old_original_insns = *sparams->original_insns; | |
6178 | ||
6179 | return 1; | |
6180 | } | |
6181 | ||
6182 | /* Same as above but for move_op. */ | |
6183 | static int | |
b8698a0f L |
6184 | move_op_on_enter (insn_t insn ATTRIBUTE_UNUSED, |
6185 | cmpd_local_params_p local_params ATTRIBUTE_UNUSED, | |
e855c69d AB |
6186 | void *static_params ATTRIBUTE_UNUSED, bool visited_p) |
6187 | { | |
6188 | if (visited_p) | |
6189 | return -1; | |
6190 | return 1; | |
6191 | } | |
6192 | ||
b8698a0f | 6193 | /* This function is called while descending current basic block if current |
e855c69d AB |
6194 | insn is not the original EXPR we're searching for. |
6195 | ||
b8698a0f | 6196 | Return value: FALSE, if code_motion_path_driver should perform a local |
e855c69d AB |
6197 | cleanup and return 0 itself; |
6198 | TRUE, if code_motion_path_driver should continue. */ | |
6199 | static bool | |
6200 | move_op_orig_expr_not_found (insn_t insn, av_set_t orig_ops ATTRIBUTE_UNUSED, | |
6201 | void *static_params) | |
6202 | { | |
6203 | moveop_static_params_p sparams = (moveop_static_params_p) static_params; | |
6204 | ||
6205 | #ifdef ENABLE_CHECKING | |
6206 | sparams->failed_insn = insn; | |
6207 | #endif | |
6208 | ||
6209 | /* If we're scheduling separate expr, in order to generate correct code | |
b8698a0f | 6210 | we need to stop the search at bookkeeping code generated with the |
e855c69d AB |
6211 | same destination register or memory. */ |
6212 | if (lhs_of_insn_equals_to_dest_p (insn, sparams->dest)) | |
6213 | return false; | |
6214 | return true; | |
6215 | } | |
6216 | ||
b8698a0f | 6217 | /* This function is called while descending current basic block if current |
e855c69d AB |
6218 | insn is not the original EXPR we're searching for. |
6219 | ||
6220 | Return value: TRUE (code_motion_path_driver should continue). */ | |
6221 | static bool | |
6222 | fur_orig_expr_not_found (insn_t insn, av_set_t orig_ops, void *static_params) | |
6223 | { | |
6224 | bool mutexed; | |
6225 | expr_t r; | |
6226 | av_set_iterator avi; | |
6227 | fur_static_params_p sparams = (fur_static_params_p) static_params; | |
6228 | ||
6229 | if (CALL_P (insn)) | |
6230 | sparams->crosses_call = true; | |
b5b8b0ac AO |
6231 | else if (DEBUG_INSN_P (insn)) |
6232 | return true; | |
e855c69d AB |
6233 | |
6234 | /* If current insn we are looking at cannot be executed together | |
6235 | with original insn, then we can skip it safely. | |
6236 | ||
6237 | Example: ORIG_OPS = { (p6) r14 = sign_extend (r15); } | |
6238 | INSN = (!p6) r14 = r14 + 1; | |
6239 | ||
6240 | Here we can schedule ORIG_OP with lhs = r14, though only | |
6241 | looking at the set of used and set registers of INSN we must | |
6242 | forbid it. So, add set/used in INSN registers to the | |
6243 | untouchable set only if there is an insn in ORIG_OPS that can | |
6244 | affect INSN. */ | |
6245 | mutexed = true; | |
6246 | FOR_EACH_EXPR (r, avi, orig_ops) | |
6247 | if (!sched_insns_conditions_mutex_p (insn, EXPR_INSN_RTX (r))) | |
6248 | { | |
6249 | mutexed = false; | |
6250 | break; | |
6251 | } | |
6252 | ||
6253 | /* Mark all registers that do not meet the following condition: | |
6254 | (1) Not set or read on any path from xi to an instance of the | |
6255 | original operation. */ | |
6256 | if (!mutexed) | |
6257 | { | |
6258 | IOR_REG_SET (sparams->used_regs, INSN_REG_SETS (insn)); | |
6259 | IOR_REG_SET (sparams->used_regs, INSN_REG_USES (insn)); | |
6260 | IOR_REG_SET (sparams->used_regs, INSN_REG_CLOBBERS (insn)); | |
6261 | } | |
6262 | ||
6263 | return true; | |
6264 | } | |
6265 | ||
6266 | /* Hooks and data to perform move_op operations with code_motion_path_driver. */ | |
6267 | struct code_motion_path_driver_info_def move_op_hooks = { | |
6268 | move_op_on_enter, | |
6269 | move_op_orig_expr_found, | |
6270 | move_op_orig_expr_not_found, | |
6271 | move_op_merge_succs, | |
6272 | move_op_after_merge_succs, | |
6273 | move_op_ascend, | |
6274 | move_op_at_first_insn, | |
6275 | SUCCS_NORMAL, | |
6276 | "move_op" | |
6277 | }; | |
6278 | ||
b8698a0f | 6279 | /* Hooks and data to perform find_used_regs operations |
e855c69d AB |
6280 | with code_motion_path_driver. */ |
6281 | struct code_motion_path_driver_info_def fur_hooks = { | |
6282 | fur_on_enter, | |
6283 | fur_orig_expr_found, | |
6284 | fur_orig_expr_not_found, | |
6285 | fur_merge_succs, | |
6286 | NULL, /* fur_after_merge_succs */ | |
6287 | NULL, /* fur_ascend */ | |
6288 | fur_at_first_insn, | |
6289 | SUCCS_ALL, | |
6290 | "find_used_regs" | |
6291 | }; | |
6292 | ||
6293 | /* Traverse all successors of INSN. For each successor that is SUCCS_NORMAL | |
b8698a0f L |
6294 | code_motion_path_driver is called recursively. Original operation |
6295 | was found at least on one path that is starting with one of INSN's | |
e855c69d AB |
6296 | successors (this fact is asserted). ORIG_OPS is expressions we're looking |
6297 | for, PATH is the path we've traversed, STATIC_PARAMS is the parameters | |
b8698a0f | 6298 | of either move_op or find_used_regs depending on the caller. |
e855c69d AB |
6299 | |
6300 | Return 0 if we haven't found expression, 1 if we found it, -1 if we don't | |
6301 | know for sure at this point. */ | |
6302 | static int | |
b8698a0f | 6303 | code_motion_process_successors (insn_t insn, av_set_t orig_ops, |
e855c69d AB |
6304 | ilist_t path, void *static_params) |
6305 | { | |
6306 | int res = 0; | |
6307 | succ_iterator succ_i; | |
6308 | rtx succ; | |
6309 | basic_block bb; | |
6310 | int old_index; | |
6311 | unsigned old_succs; | |
6312 | ||
6313 | struct cmpd_local_params lparams; | |
6314 | expr_def _x; | |
6315 | ||
6316 | lparams.c_expr_local = &_x; | |
6317 | lparams.c_expr_merged = NULL; | |
6318 | ||
6319 | /* We need to process only NORMAL succs for move_op, and collect live | |
b8698a0f L |
6320 | registers from ALL branches (including those leading out of the |
6321 | region) for find_used_regs. | |
e855c69d AB |
6322 | |
6323 | In move_op, there can be a case when insn's bb number has changed | |
b8698a0f L |
6324 | due to created bookkeeping. This happens very rare, as we need to |
6325 | move expression from the beginning to the end of the same block. | |
6326 | Rescan successors in this case. */ | |
e855c69d AB |
6327 | |
6328 | rescan: | |
6329 | bb = BLOCK_FOR_INSN (insn); | |
b8698a0f | 6330 | old_index = bb->index; |
e855c69d | 6331 | old_succs = EDGE_COUNT (bb->succs); |
b8698a0f | 6332 | |
e855c69d AB |
6333 | FOR_EACH_SUCC_1 (succ, succ_i, insn, code_motion_path_driver_info->succ_flags) |
6334 | { | |
6335 | int b; | |
6336 | ||
6337 | lparams.e1 = succ_i.e1; | |
6338 | lparams.e2 = succ_i.e2; | |
6339 | ||
6340 | /* Go deep into recursion only for NORMAL edges (non-backedges within the | |
6341 | current region). */ | |
6342 | if (succ_i.current_flags == SUCCS_NORMAL) | |
b8698a0f | 6343 | b = code_motion_path_driver (succ, orig_ops, path, &lparams, |
e855c69d AB |
6344 | static_params); |
6345 | else | |
6346 | b = 0; | |
6347 | ||
6348 | /* Merge c_expres found or unify live register sets from different | |
6349 | successors. */ | |
6350 | code_motion_path_driver_info->merge_succs (insn, succ, b, &lparams, | |
6351 | static_params); | |
6352 | if (b == 1) | |
6353 | res = b; | |
6354 | else if (b == -1 && res != 1) | |
6355 | res = b; | |
6356 | ||
6357 | /* We have simplified the control flow below this point. In this case, | |
6358 | the iterator becomes invalid. We need to try again. */ | |
6359 | if (BLOCK_FOR_INSN (insn)->index != old_index | |
6360 | || EDGE_COUNT (bb->succs) != old_succs) | |
6361 | goto rescan; | |
6362 | } | |
6363 | ||
cefb375a | 6364 | #ifdef ENABLE_CHECKING |
b8698a0f | 6365 | /* Here, RES==1 if original expr was found at least for one of the |
e855c69d | 6366 | successors. After the loop, RES may happen to have zero value |
b8698a0f L |
6367 | only if at some point the expr searched is present in av_set, but is |
6368 | not found below. In most cases, this situation is an error. | |
e855c69d AB |
6369 | The exception is when the original operation is blocked by |
6370 | bookkeeping generated for another fence or for another path in current | |
6371 | move_op. */ | |
cefb375a NF |
6372 | gcc_assert (res == 1 |
6373 | || (res == 0 | |
6374 | && av_set_could_be_blocked_by_bookkeeping_p (orig_ops, | |
6375 | static_params)) | |
6376 | || res == -1); | |
6377 | #endif | |
b8698a0f | 6378 | |
e855c69d | 6379 | /* Merge data, clean up, etc. */ |
72a54528 | 6380 | if (res != -1 && code_motion_path_driver_info->after_merge_succs) |
e855c69d AB |
6381 | code_motion_path_driver_info->after_merge_succs (&lparams, static_params); |
6382 | ||
6383 | return res; | |
6384 | } | |
6385 | ||
6386 | ||
b8698a0f L |
6387 | /* Perform a cleanup when the driver is about to terminate. ORIG_OPS_P |
6388 | is the pointer to the av set with expressions we were looking for, | |
e855c69d AB |
6389 | PATH_P is the pointer to the traversed path. */ |
6390 | static inline void | |
6391 | code_motion_path_driver_cleanup (av_set_t *orig_ops_p, ilist_t *path_p) | |
6392 | { | |
6393 | ilist_remove (path_p); | |
6394 | av_set_clear (orig_ops_p); | |
6395 | } | |
6396 | ||
b8698a0f L |
6397 | /* The driver function that implements move_op or find_used_regs |
6398 | functionality dependent whether code_motion_path_driver_INFO is set to | |
6399 | &MOVE_OP_HOOKS or &FUR_HOOKS. This function implements the common parts | |
e855c69d AB |
6400 | of code (CFG traversal etc) that are shared among both functions. INSN |
6401 | is the insn we're starting the search from, ORIG_OPS are the expressions | |
6402 | we're searching for, PATH is traversed path, LOCAL_PARAMS_IN are local | |
6403 | parameters of the driver, and STATIC_PARAMS are static parameters of | |
b8698a0f | 6404 | the caller. |
e855c69d AB |
6405 | |
6406 | Returns whether original instructions were found. Note that top-level | |
6407 | code_motion_path_driver always returns true. */ | |
72a54528 | 6408 | static int |
b8698a0f L |
6409 | code_motion_path_driver (insn_t insn, av_set_t orig_ops, ilist_t path, |
6410 | cmpd_local_params_p local_params_in, | |
e855c69d AB |
6411 | void *static_params) |
6412 | { | |
6413 | expr_t expr = NULL; | |
6414 | basic_block bb = BLOCK_FOR_INSN (insn); | |
6415 | insn_t first_insn, bb_tail, before_first; | |
6416 | bool removed_last_insn = false; | |
6417 | ||
6418 | if (sched_verbose >= 6) | |
6419 | { | |
6420 | sel_print ("%s (", code_motion_path_driver_info->routine_name); | |
6421 | dump_insn (insn); | |
6422 | sel_print (","); | |
6423 | dump_av_set (orig_ops); | |
6424 | sel_print (")\n"); | |
6425 | } | |
6426 | ||
6427 | gcc_assert (orig_ops); | |
6428 | ||
6429 | /* If no original operations exist below this insn, return immediately. */ | |
6430 | if (is_ineligible_successor (insn, path)) | |
6431 | { | |
6432 | if (sched_verbose >= 6) | |
6433 | sel_print ("Insn %d is ineligible successor\n", INSN_UID (insn)); | |
6434 | return false; | |
6435 | } | |
b8698a0f | 6436 | |
e855c69d AB |
6437 | /* The block can have invalid av set, in which case it was created earlier |
6438 | during move_op. Return immediately. */ | |
6439 | if (sel_bb_head_p (insn)) | |
6440 | { | |
6441 | if (! AV_SET_VALID_P (insn)) | |
6442 | { | |
6443 | if (sched_verbose >= 6) | |
6444 | sel_print ("Returned from block %d as it had invalid av set\n", | |
6445 | bb->index); | |
6446 | return false; | |
6447 | } | |
6448 | ||
6449 | if (bitmap_bit_p (code_motion_visited_blocks, bb->index)) | |
6450 | { | |
6451 | /* We have already found an original operation on this branch, do not | |
6452 | go any further and just return TRUE here. If we don't stop here, | |
b8698a0f | 6453 | function can have exponential behaviour even on the small code |
e855c69d AB |
6454 | with many different paths (e.g. with data speculation and |
6455 | recovery blocks). */ | |
6456 | if (sched_verbose >= 6) | |
6457 | sel_print ("Block %d already visited in this traversal\n", bb->index); | |
6458 | if (code_motion_path_driver_info->on_enter) | |
b8698a0f | 6459 | return code_motion_path_driver_info->on_enter (insn, |
e855c69d | 6460 | local_params_in, |
b8698a0f | 6461 | static_params, |
e855c69d AB |
6462 | true); |
6463 | } | |
6464 | } | |
b8698a0f | 6465 | |
e855c69d AB |
6466 | if (code_motion_path_driver_info->on_enter) |
6467 | code_motion_path_driver_info->on_enter (insn, local_params_in, | |
6468 | static_params, false); | |
6469 | orig_ops = av_set_copy (orig_ops); | |
6470 | ||
6471 | /* Filter the orig_ops set. */ | |
6472 | if (AV_SET_VALID_P (insn)) | |
6473 | av_set_intersect (&orig_ops, AV_SET (insn)); | |
6474 | ||
6475 | /* If no more original ops, return immediately. */ | |
6476 | if (!orig_ops) | |
6477 | { | |
6478 | if (sched_verbose >= 6) | |
6479 | sel_print ("No intersection with av set of block %d\n", bb->index); | |
6480 | return false; | |
6481 | } | |
6482 | ||
6483 | /* For non-speculative insns we have to leave only one form of the | |
b8698a0f | 6484 | original operation, because if we don't, we may end up with |
e855c69d AB |
6485 | different C_EXPRes and, consequently, with bookkeepings for different |
6486 | expression forms along the same code motion path. That may lead to | |
b8698a0f L |
6487 | generation of incorrect code. So for each code motion we stick to |
6488 | the single form of the instruction, except for speculative insns | |
6489 | which we need to keep in different forms with all speculation | |
e855c69d AB |
6490 | types. */ |
6491 | av_set_leave_one_nonspec (&orig_ops); | |
6492 | ||
6493 | /* It is not possible that all ORIG_OPS are filtered out. */ | |
6494 | gcc_assert (orig_ops); | |
6495 | ||
6496 | /* It is enough to place only heads and tails of visited basic blocks into | |
6497 | the PATH. */ | |
6498 | ilist_add (&path, insn); | |
6499 | first_insn = insn; | |
6500 | bb_tail = sel_bb_end (bb); | |
6501 | ||
6502 | /* Descend the basic block in search of the original expr; this part | |
b8698a0f | 6503 | corresponds to the part of the original move_op procedure executed |
e855c69d AB |
6504 | before the recursive call. */ |
6505 | for (;;) | |
6506 | { | |
6507 | /* Look at the insn and decide if it could be an ancestor of currently | |
6508 | scheduling operation. If it is so, then the insn "dest = op" could | |
6509 | either be replaced with "dest = reg", because REG now holds the result | |
6510 | of OP, or just removed, if we've scheduled the insn as a whole. | |
6511 | ||
6512 | If this insn doesn't contain currently scheduling OP, then proceed | |
6513 | with searching and look at its successors. Operations we're searching | |
b8698a0f | 6514 | for could have changed when moving up through this insn via |
e855c69d AB |
6515 | substituting. In this case, perform unsubstitution on them first. |
6516 | ||
6517 | When traversing the DAG below this insn is finished, insert | |
6518 | bookkeeping code, if the insn is a joint point, and remove | |
6519 | leftovers. */ | |
6520 | ||
6521 | expr = av_set_lookup (orig_ops, INSN_VINSN (insn)); | |
6522 | if (expr) | |
6523 | { | |
6524 | insn_t last_insn = PREV_INSN (insn); | |
6525 | ||
6526 | /* We have found the original operation. */ | |
6527 | if (sched_verbose >= 6) | |
6528 | sel_print ("Found original operation at insn %d\n", INSN_UID (insn)); | |
6529 | ||
b8698a0f | 6530 | code_motion_path_driver_info->orig_expr_found |
e855c69d AB |
6531 | (insn, expr, local_params_in, static_params); |
6532 | ||
6533 | /* Step back, so on the way back we'll start traversing from the | |
b8698a0f | 6534 | previous insn (or we'll see that it's bb_note and skip that |
e855c69d AB |
6535 | loop). */ |
6536 | if (insn == first_insn) | |
6537 | { | |
6538 | first_insn = NEXT_INSN (last_insn); | |
6539 | removed_last_insn = sel_bb_end_p (last_insn); | |
6540 | } | |
6541 | insn = last_insn; | |
6542 | break; | |
6543 | } | |
6544 | else | |
6545 | { | |
6546 | /* We haven't found the original expr, continue descending the basic | |
6547 | block. */ | |
b8698a0f | 6548 | if (code_motion_path_driver_info->orig_expr_not_found |
e855c69d AB |
6549 | (insn, orig_ops, static_params)) |
6550 | { | |
b8698a0f | 6551 | /* Av set ops could have been changed when moving through this |
e855c69d AB |
6552 | insn. To find them below it, we have to un-substitute them. */ |
6553 | undo_transformations (&orig_ops, insn); | |
6554 | } | |
6555 | else | |
6556 | { | |
6557 | /* Clean up and return, if the hook tells us to do so. It may | |
b8698a0f | 6558 | happen if we've encountered the previously created |
e855c69d AB |
6559 | bookkeeping. */ |
6560 | code_motion_path_driver_cleanup (&orig_ops, &path); | |
6561 | return -1; | |
6562 | } | |
6563 | ||
6564 | gcc_assert (orig_ops); | |
6565 | } | |
6566 | ||
6567 | /* Stop at insn if we got to the end of BB. */ | |
6568 | if (insn == bb_tail) | |
6569 | break; | |
6570 | ||
6571 | insn = NEXT_INSN (insn); | |
6572 | } | |
6573 | ||
b8698a0f | 6574 | /* Here INSN either points to the insn before the original insn (may be |
e855c69d AB |
6575 | bb_note, if original insn was a bb_head) or to the bb_end. */ |
6576 | if (!expr) | |
6577 | { | |
6578 | int res; | |
6579 | ||
6580 | gcc_assert (insn == sel_bb_end (bb)); | |
6581 | ||
6582 | /* Add bb tail to PATH (but it doesn't make any sense if it's a bb_head - | |
6583 | it's already in PATH then). */ | |
6584 | if (insn != first_insn) | |
6585 | ilist_add (&path, insn); | |
6586 | ||
b8698a0f L |
6587 | /* Process_successors should be able to find at least one |
6588 | successor for which code_motion_path_driver returns TRUE. */ | |
6589 | res = code_motion_process_successors (insn, orig_ops, | |
e855c69d AB |
6590 | path, static_params); |
6591 | ||
6592 | /* Remove bb tail from path. */ | |
6593 | if (insn != first_insn) | |
6594 | ilist_remove (&path); | |
6595 | ||
6596 | if (res != 1) | |
6597 | { | |
6598 | /* This is the case when one of the original expr is no longer available | |
b8698a0f | 6599 | due to bookkeeping created on this branch with the same register. |
e855c69d | 6600 | In the original algorithm, which doesn't have update_data_sets call |
b8698a0f L |
6601 | on a bookkeeping block, it would simply result in returning |
6602 | FALSE when we've encountered a previously generated bookkeeping | |
e855c69d AB |
6603 | insn in moveop_orig_expr_not_found. */ |
6604 | code_motion_path_driver_cleanup (&orig_ops, &path); | |
6605 | return res; | |
6606 | } | |
6607 | } | |
6608 | ||
6609 | /* Don't need it any more. */ | |
6610 | av_set_clear (&orig_ops); | |
6611 | ||
b8698a0f | 6612 | /* Backward pass: now, when we have C_EXPR computed, we'll drag it to |
e855c69d AB |
6613 | the beginning of the basic block. */ |
6614 | before_first = PREV_INSN (first_insn); | |
6615 | while (insn != before_first) | |
b8698a0f | 6616 | { |
e855c69d AB |
6617 | if (code_motion_path_driver_info->ascend) |
6618 | code_motion_path_driver_info->ascend (insn, static_params); | |
6619 | ||
6620 | insn = PREV_INSN (insn); | |
6621 | } | |
b8698a0f | 6622 | |
e855c69d AB |
6623 | /* Now we're at the bb head. */ |
6624 | insn = first_insn; | |
6625 | ilist_remove (&path); | |
6626 | local_params_in->removed_last_insn = removed_last_insn; | |
6627 | code_motion_path_driver_info->at_first_insn (insn, local_params_in, static_params); | |
b8698a0f | 6628 | |
e855c69d AB |
6629 | /* This should be the very last operation as at bb head we could change |
6630 | the numbering by creating bookkeeping blocks. */ | |
6631 | if (removed_last_insn) | |
6632 | insn = PREV_INSN (insn); | |
6633 | bitmap_set_bit (code_motion_visited_blocks, BLOCK_FOR_INSN (insn)->index); | |
6634 | return true; | |
6635 | } | |
6636 | ||
b8698a0f | 6637 | /* Move up the operations from ORIG_OPS set traversing the dag starting |
e855c69d AB |
6638 | from INSN. PATH represents the edges traversed so far. |
6639 | DEST is the register chosen for scheduling the current expr. Insert | |
6640 | bookkeeping code in the join points. EXPR_VLIW is the chosen expression, | |
b8698a0f | 6641 | C_EXPR is how it looks like at the given cfg point. |
72a54528 AM |
6642 | Set *SHOULD_MOVE to indicate whether we have only disconnected |
6643 | one of the insns found. | |
e855c69d | 6644 | |
b8698a0f | 6645 | Returns whether original instructions were found, which is asserted |
e855c69d AB |
6646 | to be true in the caller. */ |
6647 | static bool | |
6648 | move_op (insn_t insn, av_set_t orig_ops, expr_t expr_vliw, | |
72a54528 | 6649 | rtx dest, expr_t c_expr, bool *should_move) |
e855c69d AB |
6650 | { |
6651 | struct moveop_static_params sparams; | |
6652 | struct cmpd_local_params lparams; | |
6653 | bool res; | |
6654 | ||
b8698a0f | 6655 | /* Init params for code_motion_path_driver. */ |
e855c69d AB |
6656 | sparams.dest = dest; |
6657 | sparams.c_expr = c_expr; | |
6658 | sparams.uid = INSN_UID (EXPR_INSN_RTX (expr_vliw)); | |
6659 | #ifdef ENABLE_CHECKING | |
6660 | sparams.failed_insn = NULL; | |
6661 | #endif | |
6662 | sparams.was_renamed = false; | |
6663 | lparams.e1 = NULL; | |
6664 | ||
6665 | /* We haven't visited any blocks yet. */ | |
6666 | bitmap_clear (code_motion_visited_blocks); | |
b8698a0f | 6667 | |
e855c69d AB |
6668 | /* Set appropriate hooks and data. */ |
6669 | code_motion_path_driver_info = &move_op_hooks; | |
6670 | res = code_motion_path_driver (insn, orig_ops, NULL, &lparams, &sparams); | |
6671 | ||
6672 | if (sparams.was_renamed) | |
6673 | EXPR_WAS_RENAMED (expr_vliw) = true; | |
6674 | ||
72a54528 AM |
6675 | *should_move = (sparams.uid == -1); |
6676 | ||
e855c69d AB |
6677 | return res; |
6678 | } | |
6679 | \f | |
6680 | ||
6681 | /* Functions that work with regions. */ | |
6682 | ||
6683 | /* Current number of seqno used in init_seqno and init_seqno_1. */ | |
6684 | static int cur_seqno; | |
6685 | ||
b8698a0f L |
6686 | /* A helper for init_seqno. Traverse the region starting from BB and |
6687 | compute seqnos for visited insns, marking visited bbs in VISITED_BBS. | |
e855c69d AB |
6688 | Clear visited blocks from BLOCKS_TO_RESCHEDULE. */ |
6689 | static void | |
6690 | init_seqno_1 (basic_block bb, sbitmap visited_bbs, bitmap blocks_to_reschedule) | |
6691 | { | |
6692 | int bbi = BLOCK_TO_BB (bb->index); | |
6693 | insn_t insn, note = bb_note (bb); | |
6694 | insn_t succ_insn; | |
6695 | succ_iterator si; | |
6696 | ||
6697 | SET_BIT (visited_bbs, bbi); | |
6698 | if (blocks_to_reschedule) | |
6699 | bitmap_clear_bit (blocks_to_reschedule, bb->index); | |
6700 | ||
b8698a0f | 6701 | FOR_EACH_SUCC_1 (succ_insn, si, BB_END (bb), |
e855c69d AB |
6702 | SUCCS_NORMAL | SUCCS_SKIP_TO_LOOP_EXITS) |
6703 | { | |
6704 | basic_block succ = BLOCK_FOR_INSN (succ_insn); | |
6705 | int succ_bbi = BLOCK_TO_BB (succ->index); | |
6706 | ||
6707 | gcc_assert (in_current_region_p (succ)); | |
6708 | ||
6709 | if (!TEST_BIT (visited_bbs, succ_bbi)) | |
6710 | { | |
6711 | gcc_assert (succ_bbi > bbi); | |
6712 | ||
6713 | init_seqno_1 (succ, visited_bbs, blocks_to_reschedule); | |
6714 | } | |
6715 | } | |
6716 | ||
6717 | for (insn = BB_END (bb); insn != note; insn = PREV_INSN (insn)) | |
6718 | INSN_SEQNO (insn) = cur_seqno--; | |
6719 | } | |
6720 | ||
6721 | /* Initialize seqnos for the current region. NUMBER_OF_INSNS is the number | |
b8698a0f | 6722 | of instructions in the region, BLOCKS_TO_RESCHEDULE contains blocks on |
e855c69d AB |
6723 | which we're rescheduling when pipelining, FROM is the block where |
6724 | traversing region begins (it may not be the head of the region when | |
b8698a0f | 6725 | pipelining, but the head of the loop instead). |
e855c69d AB |
6726 | |
6727 | Returns the maximal seqno found. */ | |
6728 | static int | |
6729 | init_seqno (int number_of_insns, bitmap blocks_to_reschedule, basic_block from) | |
6730 | { | |
6731 | sbitmap visited_bbs; | |
6732 | bitmap_iterator bi; | |
6733 | unsigned bbi; | |
6734 | ||
6735 | visited_bbs = sbitmap_alloc (current_nr_blocks); | |
6736 | ||
6737 | if (blocks_to_reschedule) | |
6738 | { | |
6739 | sbitmap_ones (visited_bbs); | |
6740 | EXECUTE_IF_SET_IN_BITMAP (blocks_to_reschedule, 0, bbi, bi) | |
6741 | { | |
6742 | gcc_assert (BLOCK_TO_BB (bbi) < current_nr_blocks); | |
6743 | RESET_BIT (visited_bbs, BLOCK_TO_BB (bbi)); | |
6744 | } | |
6745 | } | |
6746 | else | |
6747 | { | |
6748 | sbitmap_zero (visited_bbs); | |
6749 | from = EBB_FIRST_BB (0); | |
6750 | } | |
6751 | ||
6752 | cur_seqno = number_of_insns > 0 ? number_of_insns : sched_max_luid - 1; | |
6753 | init_seqno_1 (from, visited_bbs, blocks_to_reschedule); | |
6754 | gcc_assert (cur_seqno == 0 || number_of_insns == 0); | |
6755 | ||
6756 | sbitmap_free (visited_bbs); | |
6757 | return sched_max_luid - 1; | |
6758 | } | |
6759 | ||
6760 | /* Initialize scheduling parameters for current region. */ | |
6761 | static void | |
6762 | sel_setup_region_sched_flags (void) | |
6763 | { | |
6764 | enable_schedule_as_rhs_p = 1; | |
6765 | bookkeeping_p = 1; | |
b8698a0f | 6766 | pipelining_p = (bookkeeping_p |
e855c69d AB |
6767 | && (flag_sel_sched_pipelining != 0) |
6768 | && current_loop_nest != NULL); | |
6769 | max_insns_to_rename = PARAM_VALUE (PARAM_SELSCHED_INSNS_TO_RENAME); | |
6770 | max_ws = MAX_WS; | |
6771 | } | |
6772 | ||
6773 | /* Return true if all basic blocks of current region are empty. */ | |
6774 | static bool | |
6775 | current_region_empty_p (void) | |
6776 | { | |
6777 | int i; | |
6778 | for (i = 0; i < current_nr_blocks; i++) | |
6779 | if (! sel_bb_empty_p (BASIC_BLOCK (BB_TO_BLOCK (i)))) | |
6780 | return false; | |
6781 | ||
6782 | return true; | |
6783 | } | |
6784 | ||
6785 | /* Prepare and verify loop nest for pipelining. */ | |
6786 | static void | |
6787 | setup_current_loop_nest (int rgn) | |
6788 | { | |
6789 | current_loop_nest = get_loop_nest_for_rgn (rgn); | |
6790 | ||
6791 | if (!current_loop_nest) | |
6792 | return; | |
6793 | ||
6794 | /* If this loop has any saved loop preheaders from nested loops, | |
6795 | add these basic blocks to the current region. */ | |
6796 | sel_add_loop_preheaders (); | |
6797 | ||
6798 | /* Check that we're starting with a valid information. */ | |
6799 | gcc_assert (loop_latch_edge (current_loop_nest)); | |
6800 | gcc_assert (LOOP_MARKED_FOR_PIPELINING_P (current_loop_nest)); | |
6801 | } | |
6802 | ||
e855c69d AB |
6803 | /* Compute instruction priorities for current region. */ |
6804 | static void | |
6805 | sel_compute_priorities (int rgn) | |
6806 | { | |
6807 | sched_rgn_compute_dependencies (rgn); | |
6808 | ||
6809 | /* Compute insn priorities in haifa style. Then free haifa style | |
6810 | dependencies that we've calculated for this. */ | |
6811 | compute_priorities (); | |
6812 | ||
6813 | if (sched_verbose >= 5) | |
6814 | debug_rgn_dependencies (0); | |
6815 | ||
6816 | free_rgn_deps (); | |
6817 | } | |
6818 | ||
6819 | /* Init scheduling data for RGN. Returns true when this region should not | |
6820 | be scheduled. */ | |
6821 | static bool | |
6822 | sel_region_init (int rgn) | |
6823 | { | |
6824 | int i; | |
6825 | bb_vec_t bbs; | |
6826 | ||
6827 | rgn_setup_region (rgn); | |
6828 | ||
b8698a0f | 6829 | /* Even if sched_is_disabled_for_current_region_p() is true, we still |
e855c69d AB |
6830 | do region initialization here so the region can be bundled correctly, |
6831 | but we'll skip the scheduling in sel_sched_region (). */ | |
6832 | if (current_region_empty_p ()) | |
6833 | return true; | |
6834 | ||
6835 | if (flag_sel_sched_pipelining) | |
6836 | setup_current_loop_nest (rgn); | |
6837 | ||
6838 | sel_setup_region_sched_flags (); | |
6839 | ||
6840 | bbs = VEC_alloc (basic_block, heap, current_nr_blocks); | |
6841 | ||
6842 | for (i = 0; i < current_nr_blocks; i++) | |
6843 | VEC_quick_push (basic_block, bbs, BASIC_BLOCK (BB_TO_BLOCK (i))); | |
6844 | ||
6845 | sel_init_bbs (bbs, NULL); | |
6846 | ||
6847 | /* Initialize luids and dependence analysis which both sel-sched and haifa | |
6848 | need. */ | |
6849 | sched_init_luids (bbs, NULL, NULL, NULL); | |
6850 | sched_deps_init (false); | |
6851 | ||
6852 | /* Initialize haifa data. */ | |
6853 | rgn_setup_sched_infos (); | |
6854 | sel_set_sched_flags (); | |
6855 | haifa_init_h_i_d (bbs, NULL, NULL, NULL); | |
6856 | ||
6857 | sel_compute_priorities (rgn); | |
6858 | init_deps_global (); | |
6859 | ||
6860 | /* Main initialization. */ | |
6861 | sel_setup_sched_infos (); | |
6862 | sel_init_global_and_expr (bbs); | |
6863 | ||
6864 | VEC_free (basic_block, heap, bbs); | |
6865 | ||
6866 | blocks_to_reschedule = BITMAP_ALLOC (NULL); | |
6867 | ||
6868 | /* Init correct liveness sets on each instruction of a single-block loop. | |
6869 | This is the only situation when we can't update liveness when calling | |
6870 | compute_live for the first insn of the loop. */ | |
6871 | if (current_loop_nest) | |
6872 | { | |
6873 | int header = (sel_is_loop_preheader_p (BASIC_BLOCK (BB_TO_BLOCK (0))) | |
6874 | ? 1 | |
6875 | : 0); | |
6876 | ||
6877 | if (current_nr_blocks == header + 1) | |
b8698a0f | 6878 | update_liveness_on_insn |
e855c69d AB |
6879 | (sel_bb_head (BASIC_BLOCK (BB_TO_BLOCK (header)))); |
6880 | } | |
b8698a0f | 6881 | |
e855c69d AB |
6882 | /* Set hooks so that no newly generated insn will go out unnoticed. */ |
6883 | sel_register_cfg_hooks (); | |
6884 | ||
38f8b050 JR |
6885 | /* !!! We call target.sched.init () for the whole region, but we invoke |
6886 | targetm.sched.finish () for every ebb. */ | |
6887 | if (targetm.sched.init) | |
e855c69d | 6888 | /* None of the arguments are actually used in any target. */ |
38f8b050 | 6889 | targetm.sched.init (sched_dump, sched_verbose, -1); |
e855c69d AB |
6890 | |
6891 | first_emitted_uid = get_max_uid () + 1; | |
6892 | preheader_removed = false; | |
6893 | ||
6894 | /* Reset register allocation ticks array. */ | |
6895 | memset (reg_rename_tick, 0, sizeof reg_rename_tick); | |
6896 | reg_rename_this_tick = 0; | |
6897 | ||
6898 | bitmap_initialize (forced_ebb_heads, 0); | |
6899 | bitmap_clear (forced_ebb_heads); | |
6900 | ||
6901 | setup_nop_vinsn (); | |
6902 | current_copies = BITMAP_ALLOC (NULL); | |
6903 | current_originators = BITMAP_ALLOC (NULL); | |
6904 | code_motion_visited_blocks = BITMAP_ALLOC (NULL); | |
6905 | ||
6906 | return false; | |
6907 | } | |
6908 | ||
6909 | /* Simplify insns after the scheduling. */ | |
6910 | static void | |
6911 | simplify_changed_insns (void) | |
6912 | { | |
6913 | int i; | |
6914 | ||
6915 | for (i = 0; i < current_nr_blocks; i++) | |
6916 | { | |
6917 | basic_block bb = BASIC_BLOCK (BB_TO_BLOCK (i)); | |
6918 | rtx insn; | |
6919 | ||
6920 | FOR_BB_INSNS (bb, insn) | |
6921 | if (INSN_P (insn)) | |
6922 | { | |
6923 | expr_t expr = INSN_EXPR (insn); | |
6924 | ||
b8698a0f | 6925 | if (EXPR_WAS_SUBSTITUTED (expr)) |
e855c69d AB |
6926 | validate_simplify_insn (insn); |
6927 | } | |
6928 | } | |
6929 | } | |
6930 | ||
6931 | /* Find boundaries of the EBB starting from basic block BB, marking blocks of | |
6932 | this EBB in SCHEDULED_BLOCKS and appropriately filling in HEAD, TAIL, | |
6933 | PREV_HEAD, and NEXT_TAIL fields of CURRENT_SCHED_INFO structure. */ | |
6934 | static void | |
6935 | find_ebb_boundaries (basic_block bb, bitmap scheduled_blocks) | |
6936 | { | |
6937 | insn_t head, tail; | |
6938 | basic_block bb1 = bb; | |
6939 | if (sched_verbose >= 2) | |
6940 | sel_print ("Finishing schedule in bbs: "); | |
6941 | ||
6942 | do | |
6943 | { | |
6944 | bitmap_set_bit (scheduled_blocks, BLOCK_TO_BB (bb1->index)); | |
6945 | ||
6946 | if (sched_verbose >= 2) | |
6947 | sel_print ("%d; ", bb1->index); | |
6948 | } | |
6949 | while (!bb_ends_ebb_p (bb1) && (bb1 = bb_next_bb (bb1))); | |
6950 | ||
6951 | if (sched_verbose >= 2) | |
6952 | sel_print ("\n"); | |
6953 | ||
6954 | get_ebb_head_tail (bb, bb1, &head, &tail); | |
6955 | ||
6956 | current_sched_info->head = head; | |
6957 | current_sched_info->tail = tail; | |
6958 | current_sched_info->prev_head = PREV_INSN (head); | |
6959 | current_sched_info->next_tail = NEXT_INSN (tail); | |
6960 | } | |
6961 | ||
6962 | /* Regenerate INSN_SCHED_CYCLEs for insns of current EBB. */ | |
6963 | static void | |
6964 | reset_sched_cycles_in_current_ebb (void) | |
6965 | { | |
6966 | int last_clock = 0; | |
6967 | int haifa_last_clock = -1; | |
6968 | int haifa_clock = 0; | |
6969 | insn_t insn; | |
6970 | ||
38f8b050 | 6971 | if (targetm.sched.init) |
e855c69d AB |
6972 | { |
6973 | /* None of the arguments are actually used in any target. | |
6974 | NB: We should have md_reset () hook for cases like this. */ | |
38f8b050 | 6975 | targetm.sched.init (sched_dump, sched_verbose, -1); |
e855c69d AB |
6976 | } |
6977 | ||
6978 | state_reset (curr_state); | |
6979 | advance_state (curr_state); | |
b8698a0f | 6980 | |
e855c69d AB |
6981 | for (insn = current_sched_info->head; |
6982 | insn != current_sched_info->next_tail; | |
6983 | insn = NEXT_INSN (insn)) | |
6984 | { | |
6985 | int cost, haifa_cost; | |
6986 | int sort_p; | |
6987 | bool asm_p, real_insn, after_stall; | |
6988 | int clock; | |
6989 | ||
6990 | if (!INSN_P (insn)) | |
6991 | continue; | |
6992 | ||
6993 | asm_p = false; | |
6994 | real_insn = recog_memoized (insn) >= 0; | |
6995 | clock = INSN_SCHED_CYCLE (insn); | |
6996 | ||
6997 | cost = clock - last_clock; | |
6998 | ||
6999 | /* Initialize HAIFA_COST. */ | |
7000 | if (! real_insn) | |
7001 | { | |
7002 | asm_p = INSN_ASM_P (insn); | |
7003 | ||
7004 | if (asm_p) | |
7005 | /* This is asm insn which *had* to be scheduled first | |
7006 | on the cycle. */ | |
7007 | haifa_cost = 1; | |
7008 | else | |
b8698a0f | 7009 | /* This is a use/clobber insn. It should not change |
e855c69d AB |
7010 | cost. */ |
7011 | haifa_cost = 0; | |
7012 | } | |
7013 | else | |
7014 | haifa_cost = estimate_insn_cost (insn, curr_state); | |
7015 | ||
7016 | /* Stall for whatever cycles we've stalled before. */ | |
7017 | after_stall = 0; | |
7018 | if (INSN_AFTER_STALL_P (insn) && cost > haifa_cost) | |
7019 | { | |
7020 | haifa_cost = cost; | |
7021 | after_stall = 1; | |
7022 | } | |
7023 | ||
7024 | if (haifa_cost > 0) | |
7025 | { | |
7026 | int i = 0; | |
7027 | ||
7028 | while (haifa_cost--) | |
7029 | { | |
7030 | advance_state (curr_state); | |
7031 | i++; | |
7032 | ||
7033 | if (sched_verbose >= 2) | |
7034 | { | |
7035 | sel_print ("advance_state (state_transition)\n"); | |
7036 | debug_state (curr_state); | |
7037 | } | |
7038 | ||
b8698a0f L |
7039 | /* The DFA may report that e.g. insn requires 2 cycles to be |
7040 | issued, but on the next cycle it says that insn is ready | |
e855c69d AB |
7041 | to go. Check this here. */ |
7042 | if (!after_stall | |
b8698a0f | 7043 | && real_insn |
e855c69d AB |
7044 | && haifa_cost > 0 |
7045 | && estimate_insn_cost (insn, curr_state) == 0) | |
7046 | break; | |
7047 | } | |
7048 | ||
7049 | haifa_clock += i; | |
7050 | } | |
7051 | else | |
7052 | gcc_assert (haifa_cost == 0); | |
7053 | ||
7054 | if (sched_verbose >= 2) | |
7055 | sel_print ("Haifa cost for insn %d: %d\n", INSN_UID (insn), haifa_cost); | |
7056 | ||
7057 | if (targetm.sched.dfa_new_cycle) | |
7058 | while (targetm.sched.dfa_new_cycle (sched_dump, sched_verbose, insn, | |
7059 | haifa_last_clock, haifa_clock, | |
7060 | &sort_p)) | |
7061 | { | |
7062 | advance_state (curr_state); | |
7063 | haifa_clock++; | |
7064 | if (sched_verbose >= 2) | |
7065 | { | |
7066 | sel_print ("advance_state (dfa_new_cycle)\n"); | |
7067 | debug_state (curr_state); | |
7068 | } | |
7069 | } | |
7070 | ||
7071 | if (real_insn) | |
7072 | { | |
7073 | cost = state_transition (curr_state, insn); | |
7074 | ||
7075 | if (sched_verbose >= 2) | |
7076 | debug_state (curr_state); | |
7077 | ||
7078 | gcc_assert (cost < 0); | |
7079 | } | |
7080 | ||
7081 | if (targetm.sched.variable_issue) | |
7082 | targetm.sched.variable_issue (sched_dump, sched_verbose, insn, 0); | |
7083 | ||
7084 | INSN_SCHED_CYCLE (insn) = haifa_clock; | |
7085 | ||
7086 | last_clock = clock; | |
7087 | haifa_last_clock = haifa_clock; | |
7088 | } | |
7089 | } | |
7090 | ||
7091 | /* Put TImode markers on insns starting a new issue group. */ | |
7092 | static void | |
7093 | put_TImodes (void) | |
7094 | { | |
7095 | int last_clock = -1; | |
7096 | insn_t insn; | |
7097 | ||
7098 | for (insn = current_sched_info->head; insn != current_sched_info->next_tail; | |
7099 | insn = NEXT_INSN (insn)) | |
7100 | { | |
7101 | int cost, clock; | |
7102 | ||
7103 | if (!INSN_P (insn)) | |
7104 | continue; | |
7105 | ||
7106 | clock = INSN_SCHED_CYCLE (insn); | |
7107 | cost = (last_clock == -1) ? 1 : clock - last_clock; | |
7108 | ||
7109 | gcc_assert (cost >= 0); | |
7110 | ||
7111 | if (issue_rate > 1 | |
7112 | && GET_CODE (PATTERN (insn)) != USE | |
7113 | && GET_CODE (PATTERN (insn)) != CLOBBER) | |
7114 | { | |
7115 | if (reload_completed && cost > 0) | |
7116 | PUT_MODE (insn, TImode); | |
7117 | ||
7118 | last_clock = clock; | |
7119 | } | |
7120 | ||
7121 | if (sched_verbose >= 2) | |
7122 | sel_print ("Cost for insn %d is %d\n", INSN_UID (insn), cost); | |
7123 | } | |
7124 | } | |
7125 | ||
b8698a0f | 7126 | /* Perform MD_FINISH on EBBs comprising current region. When |
e855c69d AB |
7127 | RESET_SCHED_CYCLES_P is true, run a pass emulating the scheduler |
7128 | to produce correct sched cycles on insns. */ | |
7129 | static void | |
7130 | sel_region_target_finish (bool reset_sched_cycles_p) | |
7131 | { | |
7132 | int i; | |
7133 | bitmap scheduled_blocks = BITMAP_ALLOC (NULL); | |
7134 | ||
7135 | for (i = 0; i < current_nr_blocks; i++) | |
7136 | { | |
7137 | if (bitmap_bit_p (scheduled_blocks, i)) | |
7138 | continue; | |
7139 | ||
7140 | /* While pipelining outer loops, skip bundling for loop | |
7141 | preheaders. Those will be rescheduled in the outer loop. */ | |
7142 | if (sel_is_loop_preheader_p (EBB_FIRST_BB (i))) | |
7143 | continue; | |
7144 | ||
7145 | find_ebb_boundaries (EBB_FIRST_BB (i), scheduled_blocks); | |
7146 | ||
7147 | if (no_real_insns_p (current_sched_info->head, current_sched_info->tail)) | |
7148 | continue; | |
7149 | ||
7150 | if (reset_sched_cycles_p) | |
7151 | reset_sched_cycles_in_current_ebb (); | |
7152 | ||
38f8b050 JR |
7153 | if (targetm.sched.init) |
7154 | targetm.sched.init (sched_dump, sched_verbose, -1); | |
e855c69d AB |
7155 | |
7156 | put_TImodes (); | |
7157 | ||
38f8b050 | 7158 | if (targetm.sched.finish) |
e855c69d | 7159 | { |
38f8b050 | 7160 | targetm.sched.finish (sched_dump, sched_verbose); |
e855c69d AB |
7161 | |
7162 | /* Extend luids so that insns generated by the target will | |
7163 | get zero luid. */ | |
7164 | sched_init_luids (NULL, NULL, NULL, NULL); | |
7165 | } | |
7166 | } | |
7167 | ||
7168 | BITMAP_FREE (scheduled_blocks); | |
7169 | } | |
7170 | ||
7171 | /* Free the scheduling data for the current region. When RESET_SCHED_CYCLES_P | |
b8698a0f | 7172 | is true, make an additional pass emulating scheduler to get correct insn |
e855c69d AB |
7173 | cycles for md_finish calls. */ |
7174 | static void | |
7175 | sel_region_finish (bool reset_sched_cycles_p) | |
7176 | { | |
7177 | simplify_changed_insns (); | |
7178 | sched_finish_ready_list (); | |
7179 | free_nop_pool (); | |
7180 | ||
7181 | /* Free the vectors. */ | |
7182 | if (vec_av_set) | |
7183 | VEC_free (expr_t, heap, vec_av_set); | |
7184 | BITMAP_FREE (current_copies); | |
7185 | BITMAP_FREE (current_originators); | |
7186 | BITMAP_FREE (code_motion_visited_blocks); | |
7187 | vinsn_vec_free (&vec_bookkeeping_blocked_vinsns); | |
7188 | vinsn_vec_free (&vec_target_unavailable_vinsns); | |
7189 | ||
7190 | /* If LV_SET of the region head should be updated, do it now because | |
7191 | there will be no other chance. */ | |
7192 | { | |
7193 | succ_iterator si; | |
7194 | insn_t insn; | |
7195 | ||
7196 | FOR_EACH_SUCC_1 (insn, si, bb_note (EBB_FIRST_BB (0)), | |
7197 | SUCCS_NORMAL | SUCCS_SKIP_TO_LOOP_EXITS) | |
7198 | { | |
7199 | basic_block bb = BLOCK_FOR_INSN (insn); | |
7200 | ||
7201 | if (!BB_LV_SET_VALID_P (bb)) | |
7202 | compute_live (insn); | |
7203 | } | |
7204 | } | |
7205 | ||
7206 | /* Emulate the Haifa scheduler for bundling. */ | |
7207 | if (reload_completed) | |
7208 | sel_region_target_finish (reset_sched_cycles_p); | |
7209 | ||
7210 | sel_finish_global_and_expr (); | |
7211 | ||
7212 | bitmap_clear (forced_ebb_heads); | |
7213 | ||
7214 | free_nop_vinsn (); | |
7215 | ||
7216 | finish_deps_global (); | |
7217 | sched_finish_luids (); | |
7218 | ||
7219 | sel_finish_bbs (); | |
7220 | BITMAP_FREE (blocks_to_reschedule); | |
7221 | ||
7222 | sel_unregister_cfg_hooks (); | |
7223 | ||
7224 | max_issue_size = 0; | |
7225 | } | |
7226 | \f | |
7227 | ||
7228 | /* Functions that implement the scheduler driver. */ | |
7229 | ||
7230 | /* Schedule a parallel instruction group on each of FENCES. MAX_SEQNO | |
7231 | is the current maximum seqno. SCHEDULED_INSNS_TAILPP is the list | |
7232 | of insns scheduled -- these would be postprocessed later. */ | |
7233 | static void | |
7234 | schedule_on_fences (flist_t fences, int max_seqno, | |
7235 | ilist_t **scheduled_insns_tailpp) | |
7236 | { | |
7237 | flist_t old_fences = fences; | |
7238 | ||
7239 | if (sched_verbose >= 1) | |
7240 | { | |
7241 | sel_print ("\nScheduling on fences: "); | |
7242 | dump_flist (fences); | |
7243 | sel_print ("\n"); | |
7244 | } | |
7245 | ||
7246 | scheduled_something_on_previous_fence = false; | |
7247 | for (; fences; fences = FLIST_NEXT (fences)) | |
7248 | { | |
7249 | fence_t fence = NULL; | |
7250 | int seqno = 0; | |
7251 | flist_t fences2; | |
7252 | bool first_p = true; | |
b8698a0f | 7253 | |
e855c69d AB |
7254 | /* Choose the next fence group to schedule. |
7255 | The fact that insn can be scheduled only once | |
7256 | on the cycle is guaranteed by two properties: | |
7257 | 1. seqnos of parallel groups decrease with each iteration. | |
7258 | 2. If is_ineligible_successor () sees the larger seqno, it | |
7259 | checks if candidate insn is_in_current_fence_p (). */ | |
7260 | for (fences2 = old_fences; fences2; fences2 = FLIST_NEXT (fences2)) | |
7261 | { | |
7262 | fence_t f = FLIST_FENCE (fences2); | |
7263 | ||
7264 | if (!FENCE_PROCESSED_P (f)) | |
7265 | { | |
7266 | int i = INSN_SEQNO (FENCE_INSN (f)); | |
7267 | ||
7268 | if (first_p || i > seqno) | |
7269 | { | |
7270 | seqno = i; | |
7271 | fence = f; | |
7272 | first_p = false; | |
7273 | } | |
7274 | else | |
7275 | /* ??? Seqnos of different groups should be different. */ | |
7276 | gcc_assert (1 || i != seqno); | |
7277 | } | |
7278 | } | |
7279 | ||
7280 | gcc_assert (fence); | |
7281 | ||
7282 | /* As FENCE is nonnull, SEQNO is initialized. */ | |
7283 | seqno -= max_seqno + 1; | |
7284 | fill_insns (fence, seqno, scheduled_insns_tailpp); | |
7285 | FENCE_PROCESSED_P (fence) = true; | |
7286 | } | |
7287 | ||
7288 | /* All av_sets are invalidated by GLOBAL_LEVEL increase, thus we | |
b8698a0f | 7289 | don't need to keep bookkeeping-invalidated and target-unavailable |
e855c69d AB |
7290 | vinsns any more. */ |
7291 | vinsn_vec_clear (&vec_bookkeeping_blocked_vinsns); | |
7292 | vinsn_vec_clear (&vec_target_unavailable_vinsns); | |
7293 | } | |
7294 | ||
7295 | /* Calculate MIN_SEQNO and MAX_SEQNO. */ | |
7296 | static void | |
7297 | find_min_max_seqno (flist_t fences, int *min_seqno, int *max_seqno) | |
7298 | { | |
7299 | *min_seqno = *max_seqno = INSN_SEQNO (FENCE_INSN (FLIST_FENCE (fences))); | |
7300 | ||
7301 | /* The first element is already processed. */ | |
7302 | while ((fences = FLIST_NEXT (fences))) | |
7303 | { | |
7304 | int seqno = INSN_SEQNO (FENCE_INSN (FLIST_FENCE (fences))); | |
b8698a0f | 7305 | |
e855c69d AB |
7306 | if (*min_seqno > seqno) |
7307 | *min_seqno = seqno; | |
7308 | else if (*max_seqno < seqno) | |
7309 | *max_seqno = seqno; | |
7310 | } | |
7311 | } | |
7312 | ||
7313 | /* Calculate new fences from FENCES. */ | |
b8698a0f | 7314 | static flist_t |
e855c69d AB |
7315 | calculate_new_fences (flist_t fences, int orig_max_seqno) |
7316 | { | |
7317 | flist_t old_fences = fences; | |
7318 | struct flist_tail_def _new_fences, *new_fences = &_new_fences; | |
7319 | ||
7320 | flist_tail_init (new_fences); | |
7321 | for (; fences; fences = FLIST_NEXT (fences)) | |
7322 | { | |
7323 | fence_t fence = FLIST_FENCE (fences); | |
7324 | insn_t insn; | |
b8698a0f | 7325 | |
e855c69d AB |
7326 | if (!FENCE_BNDS (fence)) |
7327 | { | |
7328 | /* This fence doesn't have any successors. */ | |
7329 | if (!FENCE_SCHEDULED_P (fence)) | |
7330 | { | |
7331 | /* Nothing was scheduled on this fence. */ | |
7332 | int seqno; | |
7333 | ||
7334 | insn = FENCE_INSN (fence); | |
7335 | seqno = INSN_SEQNO (insn); | |
7336 | gcc_assert (seqno > 0 && seqno <= orig_max_seqno); | |
7337 | ||
7338 | if (sched_verbose >= 1) | |
b8698a0f | 7339 | sel_print ("Fence %d[%d] has not changed\n", |
e855c69d AB |
7340 | INSN_UID (insn), |
7341 | BLOCK_NUM (insn)); | |
7342 | move_fence_to_fences (fences, new_fences); | |
7343 | } | |
7344 | } | |
7345 | else | |
7346 | extract_new_fences_from (fences, new_fences, orig_max_seqno); | |
7347 | } | |
7348 | ||
7349 | flist_clear (&old_fences); | |
7350 | return FLIST_TAIL_HEAD (new_fences); | |
7351 | } | |
7352 | ||
7353 | /* Update seqnos of insns given by PSCHEDULED_INSNS. MIN_SEQNO and MAX_SEQNO | |
7354 | are the miminum and maximum seqnos of the group, HIGHEST_SEQNO_IN_USE is | |
7355 | the highest seqno used in a region. Return the updated highest seqno. */ | |
7356 | static int | |
b8698a0f L |
7357 | update_seqnos_and_stage (int min_seqno, int max_seqno, |
7358 | int highest_seqno_in_use, | |
e855c69d AB |
7359 | ilist_t *pscheduled_insns) |
7360 | { | |
7361 | int new_hs; | |
7362 | ilist_iterator ii; | |
7363 | insn_t insn; | |
b8698a0f | 7364 | |
e855c69d AB |
7365 | /* Actually, new_hs is the seqno of the instruction, that was |
7366 | scheduled first (i.e. it is the first one in SCHEDULED_INSNS). */ | |
7367 | if (*pscheduled_insns) | |
7368 | { | |
7369 | new_hs = (INSN_SEQNO (ILIST_INSN (*pscheduled_insns)) | |
7370 | + highest_seqno_in_use + max_seqno - min_seqno + 2); | |
7371 | gcc_assert (new_hs > highest_seqno_in_use); | |
7372 | } | |
7373 | else | |
7374 | new_hs = highest_seqno_in_use; | |
7375 | ||
7376 | FOR_EACH_INSN (insn, ii, *pscheduled_insns) | |
7377 | { | |
7378 | gcc_assert (INSN_SEQNO (insn) < 0); | |
7379 | INSN_SEQNO (insn) += highest_seqno_in_use + max_seqno - min_seqno + 2; | |
7380 | gcc_assert (INSN_SEQNO (insn) <= new_hs); | |
bcf33775 AB |
7381 | |
7382 | /* When not pipelining, purge unneeded insn info on the scheduled insns. | |
7383 | For example, having reg_last array of INSN_DEPS_CONTEXT in memory may | |
7384 | require > 1GB of memory e.g. on limit-fnargs.c. */ | |
7385 | if (! pipelining_p) | |
7386 | free_data_for_scheduled_insn (insn); | |
e855c69d AB |
7387 | } |
7388 | ||
7389 | ilist_clear (pscheduled_insns); | |
7390 | global_level++; | |
7391 | ||
7392 | return new_hs; | |
7393 | } | |
7394 | ||
b8698a0f L |
7395 | /* The main driver for scheduling a region. This function is responsible |
7396 | for correct propagation of fences (i.e. scheduling points) and creating | |
7397 | a group of parallel insns at each of them. It also supports | |
e855c69d AB |
7398 | pipelining. ORIG_MAX_SEQNO is the maximal seqno before this pass |
7399 | of scheduling. */ | |
7400 | static void | |
7401 | sel_sched_region_2 (int orig_max_seqno) | |
7402 | { | |
7403 | int highest_seqno_in_use = orig_max_seqno; | |
7404 | ||
7405 | stat_bookkeeping_copies = 0; | |
7406 | stat_insns_needed_bookkeeping = 0; | |
7407 | stat_renamed_scheduled = 0; | |
7408 | stat_substitutions_total = 0; | |
7409 | num_insns_scheduled = 0; | |
7410 | ||
7411 | while (fences) | |
7412 | { | |
7413 | int min_seqno, max_seqno; | |
7414 | ilist_t scheduled_insns = NULL; | |
7415 | ilist_t *scheduled_insns_tailp = &scheduled_insns; | |
7416 | ||
7417 | find_min_max_seqno (fences, &min_seqno, &max_seqno); | |
7418 | schedule_on_fences (fences, max_seqno, &scheduled_insns_tailp); | |
7419 | fences = calculate_new_fences (fences, orig_max_seqno); | |
7420 | highest_seqno_in_use = update_seqnos_and_stage (min_seqno, max_seqno, | |
7421 | highest_seqno_in_use, | |
7422 | &scheduled_insns); | |
7423 | } | |
7424 | ||
7425 | if (sched_verbose >= 1) | |
7426 | sel_print ("Scheduled %d bookkeeping copies, %d insns needed " | |
7427 | "bookkeeping, %d insns renamed, %d insns substituted\n", | |
7428 | stat_bookkeeping_copies, | |
7429 | stat_insns_needed_bookkeeping, | |
7430 | stat_renamed_scheduled, | |
7431 | stat_substitutions_total); | |
7432 | } | |
7433 | ||
b8698a0f L |
7434 | /* Schedule a region. When pipelining, search for possibly never scheduled |
7435 | bookkeeping code and schedule it. Reschedule pipelined code without | |
e855c69d AB |
7436 | pipelining after. */ |
7437 | static void | |
7438 | sel_sched_region_1 (void) | |
7439 | { | |
7440 | int number_of_insns; | |
7441 | int orig_max_seqno; | |
7442 | ||
b8698a0f | 7443 | /* Remove empty blocks that might be in the region from the beginning. |
e855c69d | 7444 | We need to do save sched_max_luid before that, as it actually shows |
b8698a0f | 7445 | the number of insns in the region, and purge_empty_blocks can |
e855c69d AB |
7446 | alter it. */ |
7447 | number_of_insns = sched_max_luid - 1; | |
7448 | purge_empty_blocks (); | |
7449 | ||
7450 | orig_max_seqno = init_seqno (number_of_insns, NULL, NULL); | |
7451 | gcc_assert (orig_max_seqno >= 1); | |
7452 | ||
7453 | /* When pipelining outer loops, create fences on the loop header, | |
7454 | not preheader. */ | |
7455 | fences = NULL; | |
7456 | if (current_loop_nest) | |
7457 | init_fences (BB_END (EBB_FIRST_BB (0))); | |
7458 | else | |
7459 | init_fences (bb_note (EBB_FIRST_BB (0))); | |
7460 | global_level = 1; | |
7461 | ||
7462 | sel_sched_region_2 (orig_max_seqno); | |
7463 | ||
7464 | gcc_assert (fences == NULL); | |
7465 | ||
7466 | if (pipelining_p) | |
7467 | { | |
7468 | int i; | |
7469 | basic_block bb; | |
7470 | struct flist_tail_def _new_fences; | |
7471 | flist_tail_t new_fences = &_new_fences; | |
7472 | bool do_p = true; | |
7473 | ||
7474 | pipelining_p = false; | |
7475 | max_ws = MIN (max_ws, issue_rate * 3 / 2); | |
7476 | bookkeeping_p = false; | |
7477 | enable_schedule_as_rhs_p = false; | |
7478 | ||
7479 | /* Schedule newly created code, that has not been scheduled yet. */ | |
7480 | do_p = true; | |
7481 | ||
7482 | while (do_p) | |
7483 | { | |
7484 | do_p = false; | |
7485 | ||
7486 | for (i = 0; i < current_nr_blocks; i++) | |
7487 | { | |
7488 | basic_block bb = EBB_FIRST_BB (i); | |
7489 | ||
7490 | if (sel_bb_empty_p (bb)) | |
7491 | { | |
7492 | bitmap_clear_bit (blocks_to_reschedule, bb->index); | |
7493 | continue; | |
7494 | } | |
7495 | ||
7496 | if (bitmap_bit_p (blocks_to_reschedule, bb->index)) | |
7497 | { | |
7498 | clear_outdated_rtx_info (bb); | |
7499 | if (sel_insn_is_speculation_check (BB_END (bb)) | |
7500 | && JUMP_P (BB_END (bb))) | |
7501 | bitmap_set_bit (blocks_to_reschedule, | |
7502 | BRANCH_EDGE (bb)->dest->index); | |
7503 | } | |
7504 | else if (INSN_SCHED_TIMES (sel_bb_head (bb)) <= 0) | |
7505 | bitmap_set_bit (blocks_to_reschedule, bb->index); | |
7506 | } | |
7507 | ||
7508 | for (i = 0; i < current_nr_blocks; i++) | |
7509 | { | |
7510 | bb = EBB_FIRST_BB (i); | |
7511 | ||
b8698a0f | 7512 | /* While pipelining outer loops, skip bundling for loop |
e855c69d AB |
7513 | preheaders. Those will be rescheduled in the outer |
7514 | loop. */ | |
7515 | if (sel_is_loop_preheader_p (bb)) | |
7516 | { | |
7517 | clear_outdated_rtx_info (bb); | |
7518 | continue; | |
7519 | } | |
b8698a0f | 7520 | |
fcaa4ca4 | 7521 | if (bitmap_clear_bit (blocks_to_reschedule, bb->index)) |
e855c69d AB |
7522 | { |
7523 | flist_tail_init (new_fences); | |
7524 | ||
7525 | orig_max_seqno = init_seqno (0, blocks_to_reschedule, bb); | |
7526 | ||
7527 | /* Mark BB as head of the new ebb. */ | |
7528 | bitmap_set_bit (forced_ebb_heads, bb->index); | |
7529 | ||
e855c69d AB |
7530 | gcc_assert (fences == NULL); |
7531 | ||
7532 | init_fences (bb_note (bb)); | |
b8698a0f | 7533 | |
e855c69d | 7534 | sel_sched_region_2 (orig_max_seqno); |
b8698a0f | 7535 | |
e855c69d AB |
7536 | do_p = true; |
7537 | break; | |
7538 | } | |
7539 | } | |
7540 | } | |
7541 | } | |
7542 | } | |
7543 | ||
7544 | /* Schedule the RGN region. */ | |
7545 | void | |
7546 | sel_sched_region (int rgn) | |
7547 | { | |
7548 | bool schedule_p; | |
7549 | bool reset_sched_cycles_p; | |
7550 | ||
7551 | if (sel_region_init (rgn)) | |
7552 | return; | |
7553 | ||
7554 | if (sched_verbose >= 1) | |
7555 | sel_print ("Scheduling region %d\n", rgn); | |
7556 | ||
7557 | schedule_p = (!sched_is_disabled_for_current_region_p () | |
7558 | && dbg_cnt (sel_sched_region_cnt)); | |
7559 | reset_sched_cycles_p = pipelining_p; | |
7560 | if (schedule_p) | |
7561 | sel_sched_region_1 (); | |
7562 | else | |
7563 | /* Force initialization of INSN_SCHED_CYCLEs for correct bundling. */ | |
7564 | reset_sched_cycles_p = true; | |
b8698a0f | 7565 | |
e855c69d AB |
7566 | sel_region_finish (reset_sched_cycles_p); |
7567 | } | |
7568 | ||
7569 | /* Perform global init for the scheduler. */ | |
7570 | static void | |
7571 | sel_global_init (void) | |
7572 | { | |
7573 | calculate_dominance_info (CDI_DOMINATORS); | |
7574 | alloc_sched_pools (); | |
7575 | ||
7576 | /* Setup the infos for sched_init. */ | |
7577 | sel_setup_sched_infos (); | |
7578 | setup_sched_dump (); | |
7579 | ||
7580 | sched_rgn_init (false); | |
7581 | sched_init (); | |
7582 | ||
7583 | sched_init_bbs (); | |
7584 | /* Reset AFTER_RECOVERY if it has been set by the 1st scheduler pass. */ | |
7585 | after_recovery = 0; | |
b8698a0f | 7586 | can_issue_more = issue_rate; |
e855c69d AB |
7587 | |
7588 | sched_extend_target (); | |
7589 | sched_deps_init (true); | |
7590 | setup_nop_and_exit_insns (); | |
7591 | sel_extend_global_bb_info (); | |
7592 | init_lv_sets (); | |
7593 | init_hard_regs_data (); | |
7594 | } | |
7595 | ||
7596 | /* Free the global data of the scheduler. */ | |
7597 | static void | |
7598 | sel_global_finish (void) | |
7599 | { | |
7600 | free_bb_note_pool (); | |
7601 | free_lv_sets (); | |
7602 | sel_finish_global_bb_info (); | |
7603 | ||
7604 | free_regset_pool (); | |
7605 | free_nop_and_exit_insns (); | |
7606 | ||
7607 | sched_rgn_finish (); | |
7608 | sched_deps_finish (); | |
7609 | sched_finish (); | |
7610 | ||
7611 | if (current_loops) | |
7612 | sel_finish_pipelining (); | |
7613 | ||
7614 | free_sched_pools (); | |
7615 | free_dominance_info (CDI_DOMINATORS); | |
7616 | } | |
7617 | ||
7618 | /* Return true when we need to skip selective scheduling. Used for debugging. */ | |
7619 | bool | |
7620 | maybe_skip_selective_scheduling (void) | |
7621 | { | |
7622 | return ! dbg_cnt (sel_sched_cnt); | |
7623 | } | |
7624 | ||
7625 | /* The entry point. */ | |
7626 | void | |
7627 | run_selective_scheduling (void) | |
7628 | { | |
7629 | int rgn; | |
7630 | ||
7631 | if (n_basic_blocks == NUM_FIXED_BLOCKS) | |
7632 | return; | |
7633 | ||
7634 | sel_global_init (); | |
7635 | ||
7636 | for (rgn = 0; rgn < nr_regions; rgn++) | |
7637 | sel_sched_region (rgn); | |
7638 | ||
7639 | sel_global_finish (); | |
7640 | } | |
7641 | ||
7642 | #endif |