Mercurial > hg > CbC > CbC_gcc
annotate gcc/dce.c @ 131:84e7813d76e9
gcc-8.2
author | mir3636 |
---|---|
date | Thu, 25 Oct 2018 07:37:49 +0900 |
parents | 04ced10e8804 |
children | 1830386684a0 |
rev | line source |
---|---|
0 | 1 /* RTL dead code elimination. |
131 | 2 Copyright (C) 2005-2018 Free Software Foundation, Inc. |
0 | 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" | |
111 | 23 #include "backend.h" |
0 | 24 #include "rtl.h" |
25 #include "tree.h" | |
111 | 26 #include "predict.h" |
0 | 27 #include "df.h" |
111 | 28 #include "memmodel.h" |
29 #include "tm_p.h" | |
30 #include "emit-rtl.h" /* FIXME: Can go away once crtl is moved to rtl.h. */ | |
31 #include "cfgrtl.h" | |
32 #include "cfgbuild.h" | |
33 #include "cfgcleanup.h" | |
0 | 34 #include "dce.h" |
111 | 35 #include "valtrack.h" |
0 | 36 #include "tree-pass.h" |
37 #include "dbgcnt.h" | |
38 | |
39 | |
40 /* ------------------------------------------------------------------------- | |
41 Core mark/delete routines | |
42 ------------------------------------------------------------------------- */ | |
43 | |
44 /* True if we are invoked while the df engine is running; in this case, | |
45 we don't want to reenter it. */ | |
46 static bool df_in_progress = false; | |
47 | |
111 | 48 /* True if we are allowed to alter the CFG in this pass. */ |
49 static bool can_alter_cfg = false; | |
50 | |
0 | 51 /* Instructions that have been marked but whose dependencies have not |
52 yet been processed. */ | |
111 | 53 static vec<rtx_insn *> worklist; |
0 | 54 |
55 /* Bitmap of instructions marked as needed indexed by INSN_UID. */ | |
56 static sbitmap marked; | |
57 | |
58 /* Bitmap obstacks used for block processing by the fast algorithm. */ | |
59 static bitmap_obstack dce_blocks_bitmap_obstack; | |
60 static bitmap_obstack dce_tmp_bitmap_obstack; | |
61 | |
111 | 62 static bool find_call_stack_args (rtx_call_insn *, bool, bool, bitmap); |
0 | 63 |
64 /* A subroutine for which BODY is part of the instruction being tested; | |
65 either the top-level pattern, or an element of a PARALLEL. The | |
66 instruction is known not to be a bare USE or CLOBBER. */ | |
67 | |
68 static bool | |
69 deletable_insn_p_1 (rtx body) | |
70 { | |
71 switch (GET_CODE (body)) | |
72 { | |
73 case PREFETCH: | |
74 case TRAP_IF: | |
75 /* The UNSPEC case was added here because the ia-64 claims that | |
76 USEs do not work after reload and generates UNSPECS rather | |
77 than USEs. Since dce is run after reload we need to avoid | |
78 deleting these even if they are dead. If it turns out that | |
79 USEs really do work after reload, the ia-64 should be | |
80 changed, and the UNSPEC case can be removed. */ | |
81 case UNSPEC: | |
82 return false; | |
83 | |
84 default: | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
85 return !volatile_refs_p (body); |
0 | 86 } |
87 } | |
88 | |
89 | |
90 /* Return true if INSN is a normal instruction that can be deleted by | |
91 the DCE pass. */ | |
92 | |
93 static bool | |
111 | 94 deletable_insn_p (rtx_insn *insn, bool fast, bitmap arg_stores) |
0 | 95 { |
96 rtx body, x; | |
97 int i; | |
111 | 98 df_ref def; |
0 | 99 |
100 if (CALL_P (insn) | |
101 /* We cannot delete calls inside of the recursive dce because | |
102 this may cause basic blocks to be deleted and this messes up | |
103 the rest of the stack of optimization passes. */ | |
104 && (!df_in_progress) | |
105 /* We cannot delete pure or const sibling calls because it is | |
106 hard to see the result. */ | |
107 && (!SIBLING_CALL_P (insn)) | |
108 /* We can delete dead const or pure calls as long as they do not | |
109 infinite loop. */ | |
110 && (RTL_CONST_OR_PURE_CALL_P (insn) | |
111 && !RTL_LOOPING_CONST_OR_PURE_CALL_P (insn))) | |
111 | 112 return find_call_stack_args (as_a <rtx_call_insn *> (insn), false, |
113 fast, arg_stores); | |
0 | 114 |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
115 /* Don't delete jumps, notes and the like. */ |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
116 if (!NONJUMP_INSN_P (insn)) |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
117 return false; |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
118 |
111 | 119 /* Don't delete insns that may throw if we cannot do so. */ |
120 if (!(cfun->can_delete_dead_exceptions && can_alter_cfg) | |
121 && !insn_nothrow_p (insn)) | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
122 return false; |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
123 |
111 | 124 /* If INSN sets a global_reg, leave it untouched. */ |
125 FOR_EACH_INSN_DEF (def, insn) | |
126 if (HARD_REGISTER_NUM_P (DF_REF_REGNO (def)) | |
127 && global_regs[DF_REF_REGNO (def)]) | |
128 return false; | |
129 /* Initialization of pseudo PIC register should never be removed. */ | |
130 else if (DF_REF_REG (def) == pic_offset_table_rtx | |
131 && REGNO (pic_offset_table_rtx) >= FIRST_PSEUDO_REGISTER) | |
132 return false; | |
133 | |
131 | 134 /* Callee-save restores are needed. */ |
135 if (RTX_FRAME_RELATED_P (insn) | |
136 && crtl->shrink_wrapped_separate | |
137 && find_reg_note (insn, REG_CFA_RESTORE, NULL)) | |
138 return false; | |
139 | |
0 | 140 body = PATTERN (insn); |
141 switch (GET_CODE (body)) | |
142 { | |
143 case USE: | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
144 case VAR_LOCATION: |
0 | 145 return false; |
146 | |
147 case CLOBBER: | |
131 | 148 case CLOBBER_HIGH: |
0 | 149 if (fast) |
150 { | |
151 /* A CLOBBER of a dead pseudo register serves no purpose. | |
152 That is not necessarily true for hard registers until | |
153 after reload. */ | |
154 x = XEXP (body, 0); | |
155 return REG_P (x) && (!HARD_REGISTER_P (x) || reload_completed); | |
156 } | |
157 else | |
158 /* Because of the way that use-def chains are built, it is not | |
159 possible to tell if the clobber is dead because it can | |
160 never be the target of a use-def chain. */ | |
161 return false; | |
162 | |
163 case PARALLEL: | |
164 for (i = XVECLEN (body, 0) - 1; i >= 0; i--) | |
165 if (!deletable_insn_p_1 (XVECEXP (body, 0, i))) | |
166 return false; | |
167 return true; | |
168 | |
169 default: | |
170 return deletable_insn_p_1 (body); | |
171 } | |
172 } | |
173 | |
174 | |
175 /* Return true if INSN has been marked as needed. */ | |
176 | |
177 static inline int | |
111 | 178 marked_insn_p (rtx_insn *insn) |
0 | 179 { |
180 /* Artificial defs are always needed and they do not have an insn. | |
181 We should never see them here. */ | |
182 gcc_assert (insn); | |
111 | 183 return bitmap_bit_p (marked, INSN_UID (insn)); |
0 | 184 } |
185 | |
186 | |
187 /* If INSN has not yet been marked as needed, mark it now, and add it to | |
188 the worklist. */ | |
189 | |
190 static void | |
111 | 191 mark_insn (rtx_insn *insn, bool fast) |
0 | 192 { |
193 if (!marked_insn_p (insn)) | |
194 { | |
195 if (!fast) | |
111 | 196 worklist.safe_push (insn); |
197 bitmap_set_bit (marked, INSN_UID (insn)); | |
0 | 198 if (dump_file) |
199 fprintf (dump_file, " Adding insn %d to worklist\n", INSN_UID (insn)); | |
200 if (CALL_P (insn) | |
201 && !df_in_progress | |
202 && !SIBLING_CALL_P (insn) | |
203 && (RTL_CONST_OR_PURE_CALL_P (insn) | |
204 && !RTL_LOOPING_CONST_OR_PURE_CALL_P (insn))) | |
111 | 205 find_call_stack_args (as_a <rtx_call_insn *> (insn), true, fast, NULL); |
0 | 206 } |
207 } | |
208 | |
209 | |
210 /* A note_stores callback used by mark_nonreg_stores. DATA is the | |
211 instruction containing DEST. */ | |
212 | |
213 static void | |
214 mark_nonreg_stores_1 (rtx dest, const_rtx pattern, void *data) | |
215 { | |
216 if (GET_CODE (pattern) != CLOBBER && !REG_P (dest)) | |
131 | 217 { |
218 gcc_checking_assert (GET_CODE (pattern) != CLOBBER_HIGH); | |
219 mark_insn ((rtx_insn *) data, true); | |
220 } | |
0 | 221 } |
222 | |
223 | |
224 /* A note_stores callback used by mark_nonreg_stores. DATA is the | |
225 instruction containing DEST. */ | |
226 | |
227 static void | |
228 mark_nonreg_stores_2 (rtx dest, const_rtx pattern, void *data) | |
229 { | |
230 if (GET_CODE (pattern) != CLOBBER && !REG_P (dest)) | |
131 | 231 { |
232 gcc_checking_assert (GET_CODE (pattern) != CLOBBER_HIGH); | |
233 mark_insn ((rtx_insn *) data, false); | |
234 } | |
0 | 235 } |
236 | |
237 | |
238 /* Mark INSN if BODY stores to a non-register destination. */ | |
239 | |
240 static void | |
111 | 241 mark_nonreg_stores (rtx body, rtx_insn *insn, bool fast) |
0 | 242 { |
243 if (fast) | |
244 note_stores (body, mark_nonreg_stores_1, insn); | |
245 else | |
246 note_stores (body, mark_nonreg_stores_2, insn); | |
247 } | |
248 | |
249 | |
111 | 250 /* Return true if a store to SIZE bytes, starting OFF bytes from stack pointer, |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
251 is a call argument store, and clear corresponding bits from SP_BYTES |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
252 bitmap if it is. */ |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
253 |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
254 static bool |
111 | 255 check_argument_store (HOST_WIDE_INT size, HOST_WIDE_INT off, |
256 HOST_WIDE_INT min_sp_off, HOST_WIDE_INT max_sp_off, | |
257 bitmap sp_bytes) | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
258 { |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
259 HOST_WIDE_INT byte; |
111 | 260 for (byte = off; byte < off + size; byte++) |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
261 { |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
262 if (byte < min_sp_off |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
263 || byte >= max_sp_off |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
264 || !bitmap_clear_bit (sp_bytes, byte - min_sp_off)) |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
265 return false; |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
266 } |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
267 return true; |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
268 } |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
269 |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
270 |
0 | 271 /* Try to find all stack stores of CALL_INSN arguments if |
272 ACCUMULATE_OUTGOING_ARGS. If all stack stores have been found | |
273 and it is therefore safe to eliminate the call, return true, | |
274 otherwise return false. This function should be first called | |
275 with DO_MARK false, and only when the CALL_INSN is actually | |
276 going to be marked called again with DO_MARK true. */ | |
277 | |
278 static bool | |
111 | 279 find_call_stack_args (rtx_call_insn *call_insn, bool do_mark, bool fast, |
0 | 280 bitmap arg_stores) |
281 { | |
111 | 282 rtx p; |
283 rtx_insn *insn, *prev_insn; | |
0 | 284 bool ret; |
285 HOST_WIDE_INT min_sp_off, max_sp_off; | |
286 bitmap sp_bytes; | |
287 | |
288 gcc_assert (CALL_P (call_insn)); | |
289 if (!ACCUMULATE_OUTGOING_ARGS) | |
290 return true; | |
291 | |
292 if (!do_mark) | |
293 { | |
294 gcc_assert (arg_stores); | |
295 bitmap_clear (arg_stores); | |
296 } | |
297 | |
298 min_sp_off = INTTYPE_MAXIMUM (HOST_WIDE_INT); | |
299 max_sp_off = 0; | |
300 | |
301 /* First determine the minimum and maximum offset from sp for | |
302 stored arguments. */ | |
303 for (p = CALL_INSN_FUNCTION_USAGE (call_insn); p; p = XEXP (p, 1)) | |
304 if (GET_CODE (XEXP (p, 0)) == USE | |
305 && MEM_P (XEXP (XEXP (p, 0), 0))) | |
306 { | |
111 | 307 rtx mem = XEXP (XEXP (p, 0), 0), addr; |
308 HOST_WIDE_INT off = 0, size; | |
131 | 309 if (!MEM_SIZE_KNOWN_P (mem) || !MEM_SIZE (mem).is_constant (&size)) |
111 | 310 return false; |
0 | 311 addr = XEXP (mem, 0); |
312 if (GET_CODE (addr) == PLUS | |
313 && REG_P (XEXP (addr, 0)) | |
314 && CONST_INT_P (XEXP (addr, 1))) | |
315 { | |
316 off = INTVAL (XEXP (addr, 1)); | |
317 addr = XEXP (addr, 0); | |
318 } | |
319 if (addr != stack_pointer_rtx) | |
320 { | |
321 if (!REG_P (addr)) | |
322 return false; | |
323 /* If not fast, use chains to see if addr wasn't set to | |
324 sp + offset. */ | |
325 if (!fast) | |
326 { | |
111 | 327 df_ref use; |
0 | 328 struct df_link *defs; |
329 rtx set; | |
330 | |
111 | 331 FOR_EACH_INSN_USE (use, call_insn) |
332 if (rtx_equal_p (addr, DF_REF_REG (use))) | |
0 | 333 break; |
334 | |
111 | 335 if (use == NULL) |
0 | 336 return false; |
337 | |
111 | 338 for (defs = DF_REF_CHAIN (use); defs; defs = defs->next) |
0 | 339 if (! DF_REF_IS_ARTIFICIAL (defs->ref)) |
340 break; | |
341 | |
342 if (defs == NULL) | |
343 return false; | |
344 | |
345 set = single_set (DF_REF_INSN (defs->ref)); | |
346 if (!set) | |
347 return false; | |
348 | |
349 if (GET_CODE (SET_SRC (set)) != PLUS | |
350 || XEXP (SET_SRC (set), 0) != stack_pointer_rtx | |
351 || !CONST_INT_P (XEXP (SET_SRC (set), 1))) | |
352 return false; | |
353 | |
354 off += INTVAL (XEXP (SET_SRC (set), 1)); | |
355 } | |
356 else | |
357 return false; | |
358 } | |
359 min_sp_off = MIN (min_sp_off, off); | |
111 | 360 max_sp_off = MAX (max_sp_off, off + size); |
0 | 361 } |
362 | |
363 if (min_sp_off >= max_sp_off) | |
364 return true; | |
365 sp_bytes = BITMAP_ALLOC (NULL); | |
366 | |
367 /* Set bits in SP_BYTES bitmap for bytes relative to sp + min_sp_off | |
368 which contain arguments. Checking has been done in the previous | |
369 loop. */ | |
370 for (p = CALL_INSN_FUNCTION_USAGE (call_insn); p; p = XEXP (p, 1)) | |
371 if (GET_CODE (XEXP (p, 0)) == USE | |
372 && MEM_P (XEXP (XEXP (p, 0), 0))) | |
373 { | |
374 rtx mem = XEXP (XEXP (p, 0), 0), addr; | |
131 | 375 HOST_WIDE_INT off = 0, byte, size; |
376 /* Checked in the previous iteration. */ | |
377 size = MEM_SIZE (mem).to_constant (); | |
0 | 378 addr = XEXP (mem, 0); |
379 if (GET_CODE (addr) == PLUS | |
380 && REG_P (XEXP (addr, 0)) | |
381 && CONST_INT_P (XEXP (addr, 1))) | |
382 { | |
383 off = INTVAL (XEXP (addr, 1)); | |
384 addr = XEXP (addr, 0); | |
385 } | |
386 if (addr != stack_pointer_rtx) | |
387 { | |
111 | 388 df_ref use; |
0 | 389 struct df_link *defs; |
390 rtx set; | |
391 | |
111 | 392 FOR_EACH_INSN_USE (use, call_insn) |
393 if (rtx_equal_p (addr, DF_REF_REG (use))) | |
0 | 394 break; |
395 | |
111 | 396 for (defs = DF_REF_CHAIN (use); defs; defs = defs->next) |
0 | 397 if (! DF_REF_IS_ARTIFICIAL (defs->ref)) |
398 break; | |
399 | |
400 set = single_set (DF_REF_INSN (defs->ref)); | |
401 off += INTVAL (XEXP (SET_SRC (set), 1)); | |
402 } | |
131 | 403 for (byte = off; byte < off + size; byte++) |
0 | 404 { |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
405 if (!bitmap_set_bit (sp_bytes, byte - min_sp_off)) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
406 gcc_unreachable (); |
0 | 407 } |
408 } | |
409 | |
410 /* Walk backwards, looking for argument stores. The search stops | |
411 when seeing another call, sp adjustment or memory store other than | |
412 argument store. */ | |
413 ret = false; | |
414 for (insn = PREV_INSN (call_insn); insn; insn = prev_insn) | |
415 { | |
416 rtx set, mem, addr; | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
417 HOST_WIDE_INT off; |
0 | 418 |
419 if (insn == BB_HEAD (BLOCK_FOR_INSN (call_insn))) | |
111 | 420 prev_insn = NULL; |
0 | 421 else |
422 prev_insn = PREV_INSN (insn); | |
423 | |
424 if (CALL_P (insn)) | |
425 break; | |
426 | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
427 if (!NONDEBUG_INSN_P (insn)) |
0 | 428 continue; |
429 | |
430 set = single_set (insn); | |
431 if (!set || SET_DEST (set) == stack_pointer_rtx) | |
432 break; | |
433 | |
434 if (!MEM_P (SET_DEST (set))) | |
435 continue; | |
436 | |
437 mem = SET_DEST (set); | |
438 addr = XEXP (mem, 0); | |
439 off = 0; | |
440 if (GET_CODE (addr) == PLUS | |
441 && REG_P (XEXP (addr, 0)) | |
442 && CONST_INT_P (XEXP (addr, 1))) | |
443 { | |
444 off = INTVAL (XEXP (addr, 1)); | |
445 addr = XEXP (addr, 0); | |
446 } | |
447 if (addr != stack_pointer_rtx) | |
448 { | |
449 if (!REG_P (addr)) | |
450 break; | |
451 if (!fast) | |
452 { | |
111 | 453 df_ref use; |
0 | 454 struct df_link *defs; |
455 rtx set; | |
456 | |
111 | 457 FOR_EACH_INSN_USE (use, insn) |
458 if (rtx_equal_p (addr, DF_REF_REG (use))) | |
0 | 459 break; |
460 | |
111 | 461 if (use == NULL) |
0 | 462 break; |
463 | |
111 | 464 for (defs = DF_REF_CHAIN (use); defs; defs = defs->next) |
0 | 465 if (! DF_REF_IS_ARTIFICIAL (defs->ref)) |
466 break; | |
467 | |
468 if (defs == NULL) | |
469 break; | |
470 | |
471 set = single_set (DF_REF_INSN (defs->ref)); | |
472 if (!set) | |
473 break; | |
474 | |
475 if (GET_CODE (SET_SRC (set)) != PLUS | |
476 || XEXP (SET_SRC (set), 0) != stack_pointer_rtx | |
477 || !CONST_INT_P (XEXP (SET_SRC (set), 1))) | |
478 break; | |
479 | |
480 off += INTVAL (XEXP (SET_SRC (set), 1)); | |
481 } | |
482 else | |
483 break; | |
484 } | |
485 | |
131 | 486 HOST_WIDE_INT size; |
111 | 487 if (!MEM_SIZE_KNOWN_P (mem) |
131 | 488 || !MEM_SIZE (mem).is_constant (&size) |
489 || !check_argument_store (size, off, min_sp_off, | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
490 max_sp_off, sp_bytes)) |
0 | 491 break; |
492 | |
493 if (!deletable_insn_p (insn, fast, NULL)) | |
494 break; | |
495 | |
496 if (do_mark) | |
497 mark_insn (insn, fast); | |
498 else | |
499 bitmap_set_bit (arg_stores, INSN_UID (insn)); | |
500 | |
501 if (bitmap_empty_p (sp_bytes)) | |
502 { | |
503 ret = true; | |
504 break; | |
505 } | |
506 } | |
507 | |
508 BITMAP_FREE (sp_bytes); | |
509 if (!ret && arg_stores) | |
510 bitmap_clear (arg_stores); | |
511 | |
512 return ret; | |
513 } | |
514 | |
515 | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
516 /* Remove all REG_EQUAL and REG_EQUIV notes referring to the registers INSN |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
517 writes to. */ |
0 | 518 |
519 static void | |
111 | 520 remove_reg_equal_equiv_notes_for_defs (rtx_insn *insn) |
0 | 521 { |
111 | 522 df_ref def; |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
523 |
111 | 524 FOR_EACH_INSN_DEF (def, insn) |
525 remove_reg_equal_equiv_notes_for_regno (DF_REF_REGNO (def)); | |
0 | 526 } |
527 | |
111 | 528 /* Scan all BBs for debug insns and reset those that reference values |
529 defined in unmarked insns. */ | |
530 | |
531 static void | |
532 reset_unmarked_insns_debug_uses (void) | |
533 { | |
534 basic_block bb; | |
535 rtx_insn *insn, *next; | |
536 | |
537 FOR_EACH_BB_REVERSE_FN (bb, cfun) | |
538 FOR_BB_INSNS_REVERSE_SAFE (bb, insn, next) | |
539 if (DEBUG_INSN_P (insn)) | |
540 { | |
541 df_ref use; | |
542 | |
543 FOR_EACH_INSN_USE (use, insn) | |
544 { | |
545 struct df_link *defs; | |
546 for (defs = DF_REF_CHAIN (use); defs; defs = defs->next) | |
547 { | |
548 rtx_insn *ref_insn; | |
549 if (DF_REF_IS_ARTIFICIAL (defs->ref)) | |
550 continue; | |
551 ref_insn = DF_REF_INSN (defs->ref); | |
552 if (!marked_insn_p (ref_insn)) | |
553 break; | |
554 } | |
555 if (!defs) | |
556 continue; | |
557 /* ??? FIXME could we propagate the values assigned to | |
558 each of the DEFs? */ | |
559 INSN_VAR_LOCATION_LOC (insn) = gen_rtx_UNKNOWN_VAR_LOC (); | |
560 df_insn_rescan_debug_internal (insn); | |
561 break; | |
562 } | |
563 } | |
564 } | |
0 | 565 |
566 /* Delete every instruction that hasn't been marked. */ | |
567 | |
568 static void | |
569 delete_unmarked_insns (void) | |
570 { | |
571 basic_block bb; | |
111 | 572 rtx_insn *insn, *next; |
0 | 573 bool must_clean = false; |
574 | |
111 | 575 FOR_EACH_BB_REVERSE_FN (bb, cfun) |
0 | 576 FOR_BB_INSNS_REVERSE_SAFE (bb, insn, next) |
111 | 577 if (NONDEBUG_INSN_P (insn)) |
0 | 578 { |
131 | 579 rtx turn_into_use = NULL_RTX; |
580 | |
0 | 581 /* Always delete no-op moves. */ |
582 if (noop_move_p (insn)) | |
131 | 583 { |
584 if (RTX_FRAME_RELATED_P (insn)) | |
585 turn_into_use | |
586 = find_reg_note (insn, REG_CFA_RESTORE, NULL); | |
587 if (turn_into_use && REG_P (XEXP (turn_into_use, 0))) | |
588 turn_into_use = XEXP (turn_into_use, 0); | |
589 else | |
590 turn_into_use = NULL_RTX; | |
591 } | |
0 | 592 |
593 /* Otherwise rely only on the DCE algorithm. */ | |
594 else if (marked_insn_p (insn)) | |
595 continue; | |
596 | |
597 /* Beware that reaching a dbg counter limit here can result | |
598 in miscompiled file. This occurs when a group of insns | |
599 must be deleted together, typically because the kept insn | |
600 depends on the output from the deleted insn. Deleting | |
601 this insns in reverse order (both at the bb level and | |
602 when looking at the blocks) minimizes this, but does not | |
603 eliminate it, since it is possible for the using insn to | |
604 be top of a block and the producer to be at the bottom of | |
605 the block. However, in most cases this will only result | |
606 in an uninitialized use of an insn that is dead anyway. | |
607 | |
608 However, there is one rare case that will cause a | |
609 miscompile: deletion of non-looping pure and constant | |
610 calls on a machine where ACCUMULATE_OUTGOING_ARGS is true. | |
611 In this case it is possible to remove the call, but leave | |
612 the argument pushes to the stack. Because of the changes | |
613 to the stack pointer, this will almost always lead to a | |
614 miscompile. */ | |
615 if (!dbg_cnt (dce)) | |
616 continue; | |
617 | |
618 if (dump_file) | |
619 fprintf (dump_file, "DCE: Deleting insn %d\n", INSN_UID (insn)); | |
620 | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
621 /* Before we delete the insn we have to remove the REG_EQUAL notes |
0 | 622 for the destination regs in order to avoid dangling notes. */ |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
623 remove_reg_equal_equiv_notes_for_defs (insn); |
0 | 624 |
625 /* If a pure or const call is deleted, this may make the cfg | |
626 have unreachable blocks. We rememeber this and call | |
627 delete_unreachable_blocks at the end. */ | |
628 if (CALL_P (insn)) | |
629 must_clean = true; | |
630 | |
131 | 631 if (turn_into_use) |
632 { | |
633 /* Don't remove frame related noop moves if they cary | |
634 REG_CFA_RESTORE note, while we don't need to emit any code, | |
635 we need it to emit the CFI restore note. */ | |
636 PATTERN (insn) | |
637 = gen_rtx_USE (GET_MODE (turn_into_use), turn_into_use); | |
638 INSN_CODE (insn) = -1; | |
639 df_insn_rescan (insn); | |
640 } | |
641 else | |
642 /* Now delete the insn. */ | |
643 delete_insn_and_edges (insn); | |
0 | 644 } |
645 | |
646 /* Deleted a pure or const call. */ | |
647 if (must_clean) | |
648 delete_unreachable_blocks (); | |
649 } | |
650 | |
651 | |
652 /* Go through the instructions and mark those whose necessity is not | |
653 dependent on inter-instruction information. Make sure all other | |
654 instructions are not marked. */ | |
655 | |
656 static void | |
657 prescan_insns_for_dce (bool fast) | |
658 { | |
659 basic_block bb; | |
111 | 660 rtx_insn *insn, *prev; |
0 | 661 bitmap arg_stores = NULL; |
662 | |
663 if (dump_file) | |
664 fprintf (dump_file, "Finding needed instructions:\n"); | |
665 | |
666 if (!df_in_progress && ACCUMULATE_OUTGOING_ARGS) | |
667 arg_stores = BITMAP_ALLOC (NULL); | |
668 | |
111 | 669 FOR_EACH_BB_FN (bb, cfun) |
0 | 670 { |
671 FOR_BB_INSNS_REVERSE_SAFE (bb, insn, prev) | |
111 | 672 if (NONDEBUG_INSN_P (insn)) |
0 | 673 { |
674 /* Don't mark argument stores now. They will be marked | |
675 if needed when the associated CALL is marked. */ | |
676 if (arg_stores && bitmap_bit_p (arg_stores, INSN_UID (insn))) | |
677 continue; | |
678 if (deletable_insn_p (insn, fast, arg_stores)) | |
679 mark_nonreg_stores (PATTERN (insn), insn, fast); | |
680 else | |
681 mark_insn (insn, fast); | |
682 } | |
683 /* find_call_stack_args only looks at argument stores in the | |
684 same bb. */ | |
685 if (arg_stores) | |
686 bitmap_clear (arg_stores); | |
687 } | |
688 | |
689 if (arg_stores) | |
690 BITMAP_FREE (arg_stores); | |
691 | |
692 if (dump_file) | |
693 fprintf (dump_file, "Finished finding needed instructions:\n"); | |
694 } | |
695 | |
696 | |
697 /* UD-based DSE routines. */ | |
698 | |
699 /* Mark instructions that define artificially-used registers, such as | |
700 the frame pointer and the stack pointer. */ | |
701 | |
702 static void | |
703 mark_artificial_uses (void) | |
704 { | |
705 basic_block bb; | |
706 struct df_link *defs; | |
111 | 707 df_ref use; |
0 | 708 |
111 | 709 FOR_ALL_BB_FN (bb, cfun) |
710 FOR_EACH_ARTIFICIAL_USE (use, bb->index) | |
711 for (defs = DF_REF_CHAIN (use); defs; defs = defs->next) | |
712 if (!DF_REF_IS_ARTIFICIAL (defs->ref)) | |
713 mark_insn (DF_REF_INSN (defs->ref), false); | |
0 | 714 } |
715 | |
716 | |
717 /* Mark every instruction that defines a register value that INSN uses. */ | |
718 | |
719 static void | |
111 | 720 mark_reg_dependencies (rtx_insn *insn) |
0 | 721 { |
722 struct df_link *defs; | |
111 | 723 df_ref use; |
0 | 724 |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
725 if (DEBUG_INSN_P (insn)) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
726 return; |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
727 |
111 | 728 FOR_EACH_INSN_USE (use, insn) |
0 | 729 { |
730 if (dump_file) | |
731 { | |
732 fprintf (dump_file, "Processing use of "); | |
733 print_simple_rtl (dump_file, DF_REF_REG (use)); | |
734 fprintf (dump_file, " in insn %d:\n", INSN_UID (insn)); | |
735 } | |
736 for (defs = DF_REF_CHAIN (use); defs; defs = defs->next) | |
737 if (! DF_REF_IS_ARTIFICIAL (defs->ref)) | |
738 mark_insn (DF_REF_INSN (defs->ref), false); | |
739 } | |
740 } | |
741 | |
742 | |
743 /* Initialize global variables for a new DCE pass. */ | |
744 | |
745 static void | |
746 init_dce (bool fast) | |
747 { | |
748 if (!df_in_progress) | |
749 { | |
750 if (!fast) | |
111 | 751 { |
752 df_set_flags (DF_RD_PRUNE_DEAD_DEFS); | |
753 df_chain_add_problem (DF_UD_CHAIN); | |
754 } | |
0 | 755 df_analyze (); |
756 } | |
757 | |
758 if (dump_file) | |
759 df_dump (dump_file); | |
760 | |
761 if (fast) | |
762 { | |
763 bitmap_obstack_initialize (&dce_blocks_bitmap_obstack); | |
764 bitmap_obstack_initialize (&dce_tmp_bitmap_obstack); | |
111 | 765 can_alter_cfg = false; |
0 | 766 } |
111 | 767 else |
768 can_alter_cfg = true; | |
0 | 769 |
770 marked = sbitmap_alloc (get_max_uid () + 1); | |
111 | 771 bitmap_clear (marked); |
0 | 772 } |
773 | |
774 | |
775 /* Free the data allocated by init_dce. */ | |
776 | |
777 static void | |
778 fini_dce (bool fast) | |
779 { | |
780 sbitmap_free (marked); | |
781 | |
782 if (fast) | |
783 { | |
784 bitmap_obstack_release (&dce_blocks_bitmap_obstack); | |
785 bitmap_obstack_release (&dce_tmp_bitmap_obstack); | |
786 } | |
787 } | |
788 | |
789 | |
790 /* UD-chain based DCE. */ | |
791 | |
792 static unsigned int | |
793 rest_of_handle_ud_dce (void) | |
794 { | |
111 | 795 rtx_insn *insn; |
0 | 796 |
797 init_dce (false); | |
798 | |
799 prescan_insns_for_dce (false); | |
800 mark_artificial_uses (); | |
111 | 801 while (worklist.length () > 0) |
0 | 802 { |
111 | 803 insn = worklist.pop (); |
0 | 804 mark_reg_dependencies (insn); |
805 } | |
111 | 806 worklist.release (); |
807 | |
131 | 808 if (MAY_HAVE_DEBUG_BIND_INSNS) |
111 | 809 reset_unmarked_insns_debug_uses (); |
0 | 810 |
811 /* Before any insns are deleted, we must remove the chains since | |
812 they are not bidirectional. */ | |
813 df_remove_problem (df_chain); | |
814 delete_unmarked_insns (); | |
815 | |
816 fini_dce (false); | |
817 return 0; | |
818 } | |
819 | |
820 | |
111 | 821 namespace { |
822 | |
823 const pass_data pass_data_ud_rtl_dce = | |
0 | 824 { |
111 | 825 RTL_PASS, /* type */ |
826 "ud_dce", /* name */ | |
827 OPTGROUP_NONE, /* optinfo_flags */ | |
828 TV_DCE, /* tv_id */ | |
829 0, /* properties_required */ | |
830 0, /* properties_provided */ | |
831 0, /* properties_destroyed */ | |
832 0, /* todo_flags_start */ | |
833 TODO_df_finish, /* todo_flags_finish */ | |
834 }; | |
0 | 835 |
111 | 836 class pass_ud_rtl_dce : public rtl_opt_pass |
0 | 837 { |
111 | 838 public: |
839 pass_ud_rtl_dce (gcc::context *ctxt) | |
840 : rtl_opt_pass (pass_data_ud_rtl_dce, ctxt) | |
841 {} | |
842 | |
843 /* opt_pass methods: */ | |
844 virtual bool gate (function *) | |
845 { | |
846 return optimize > 1 && flag_dce && dbg_cnt (dce_ud); | |
847 } | |
848 | |
849 virtual unsigned int execute (function *) | |
850 { | |
851 return rest_of_handle_ud_dce (); | |
852 } | |
853 | |
854 }; // class pass_ud_rtl_dce | |
855 | |
856 } // anon namespace | |
857 | |
858 rtl_opt_pass * | |
859 make_pass_ud_rtl_dce (gcc::context *ctxt) | |
860 { | |
861 return new pass_ud_rtl_dce (ctxt); | |
862 } | |
0 | 863 |
864 | |
865 /* ------------------------------------------------------------------------- | |
866 Fast DCE functions | |
867 ------------------------------------------------------------------------- */ | |
868 | |
869 /* Process basic block BB. Return true if the live_in set has | |
870 changed. REDO_OUT is true if the info at the bottom of the block | |
871 needs to be recalculated before starting. AU is the proper set of | |
111 | 872 artificial uses. Track global substitution of uses of dead pseudos |
873 in debug insns using GLOBAL_DEBUG. */ | |
0 | 874 |
875 static bool | |
111 | 876 word_dce_process_block (basic_block bb, bool redo_out, |
877 struct dead_debug_global *global_debug) | |
0 | 878 { |
879 bitmap local_live = BITMAP_ALLOC (&dce_tmp_bitmap_obstack); | |
111 | 880 rtx_insn *insn; |
0 | 881 bool block_changed; |
111 | 882 struct dead_debug_local debug; |
0 | 883 |
884 if (redo_out) | |
885 { | |
886 /* Need to redo the live_out set of this block if when one of | |
887 the succs of this block has had a change in it live in | |
888 set. */ | |
889 edge e; | |
890 edge_iterator ei; | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
891 df_confluence_function_n con_fun_n = df_word_lr->problem->con_fun_n; |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
892 bitmap_clear (DF_WORD_LR_OUT (bb)); |
0 | 893 FOR_EACH_EDGE (e, ei, bb->succs) |
894 (*con_fun_n) (e); | |
895 } | |
896 | |
897 if (dump_file) | |
898 { | |
899 fprintf (dump_file, "processing block %d live out = ", bb->index); | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
900 df_print_word_regset (dump_file, DF_WORD_LR_OUT (bb)); |
0 | 901 } |
902 | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
903 bitmap_copy (local_live, DF_WORD_LR_OUT (bb)); |
111 | 904 dead_debug_local_init (&debug, NULL, global_debug); |
0 | 905 |
906 FOR_BB_INSNS_REVERSE (bb, insn) | |
111 | 907 if (DEBUG_INSN_P (insn)) |
908 { | |
909 df_ref use; | |
910 FOR_EACH_INSN_USE (use, insn) | |
911 if (DF_REF_REGNO (use) >= FIRST_PSEUDO_REGISTER | |
131 | 912 && known_eq (GET_MODE_SIZE (GET_MODE (DF_REF_REAL_REG (use))), |
913 2 * UNITS_PER_WORD) | |
111 | 914 && !bitmap_bit_p (local_live, 2 * DF_REF_REGNO (use)) |
915 && !bitmap_bit_p (local_live, 2 * DF_REF_REGNO (use) + 1)) | |
916 dead_debug_add (&debug, use, DF_REF_REGNO (use)); | |
917 } | |
918 else if (INSN_P (insn)) | |
0 | 919 { |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
920 bool any_changed; |
111 | 921 |
0 | 922 /* No matter if the instruction is needed or not, we remove |
923 any regno in the defs from the live set. */ | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
924 any_changed = df_word_lr_simulate_defs (insn, local_live); |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
925 if (any_changed) |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
926 mark_insn (insn, true); |
0 | 927 |
928 /* On the other hand, we do not allow the dead uses to set | |
929 anything in local_live. */ | |
930 if (marked_insn_p (insn)) | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
931 df_word_lr_simulate_uses (insn, local_live); |
0 | 932 |
111 | 933 /* Insert debug temps for dead REGs used in subsequent debug |
934 insns. We may have to emit a debug temp even if the insn | |
935 was marked, in case the debug use was after the point of | |
936 death. */ | |
937 if (debug.used && !bitmap_empty_p (debug.used)) | |
938 { | |
939 df_ref def; | |
940 | |
941 FOR_EACH_INSN_DEF (def, insn) | |
942 dead_debug_insert_temp (&debug, DF_REF_REGNO (def), insn, | |
943 marked_insn_p (insn) | |
944 && !control_flow_insn_p (insn) | |
945 ? DEBUG_TEMP_AFTER_WITH_REG_FORCE | |
946 : DEBUG_TEMP_BEFORE_WITH_VALUE); | |
947 } | |
948 | |
0 | 949 if (dump_file) |
950 { | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
951 fprintf (dump_file, "finished processing insn %d live out = ", |
0 | 952 INSN_UID (insn)); |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
953 df_print_word_regset (dump_file, local_live); |
0 | 954 } |
955 } | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
956 |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
957 block_changed = !bitmap_equal_p (local_live, DF_WORD_LR_IN (bb)); |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
958 if (block_changed) |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
959 bitmap_copy (DF_WORD_LR_IN (bb), local_live); |
0 | 960 |
111 | 961 dead_debug_local_finish (&debug, NULL); |
0 | 962 BITMAP_FREE (local_live); |
963 return block_changed; | |
964 } | |
965 | |
966 | |
967 /* Process basic block BB. Return true if the live_in set has | |
968 changed. REDO_OUT is true if the info at the bottom of the block | |
969 needs to be recalculated before starting. AU is the proper set of | |
111 | 970 artificial uses. Track global substitution of uses of dead pseudos |
971 in debug insns using GLOBAL_DEBUG. */ | |
0 | 972 |
973 static bool | |
111 | 974 dce_process_block (basic_block bb, bool redo_out, bitmap au, |
975 struct dead_debug_global *global_debug) | |
0 | 976 { |
977 bitmap local_live = BITMAP_ALLOC (&dce_tmp_bitmap_obstack); | |
111 | 978 rtx_insn *insn; |
0 | 979 bool block_changed; |
111 | 980 df_ref def; |
981 struct dead_debug_local debug; | |
0 | 982 |
983 if (redo_out) | |
984 { | |
985 /* Need to redo the live_out set of this block if when one of | |
986 the succs of this block has had a change in it live in | |
987 set. */ | |
988 edge e; | |
989 edge_iterator ei; | |
990 df_confluence_function_n con_fun_n = df_lr->problem->con_fun_n; | |
991 bitmap_clear (DF_LR_OUT (bb)); | |
992 FOR_EACH_EDGE (e, ei, bb->succs) | |
993 (*con_fun_n) (e); | |
994 } | |
995 | |
996 if (dump_file) | |
997 { | |
998 fprintf (dump_file, "processing block %d lr out = ", bb->index); | |
999 df_print_regset (dump_file, DF_LR_OUT (bb)); | |
1000 } | |
1001 | |
1002 bitmap_copy (local_live, DF_LR_OUT (bb)); | |
1003 | |
1004 df_simulate_initialize_backwards (bb, local_live); | |
111 | 1005 dead_debug_local_init (&debug, NULL, global_debug); |
0 | 1006 |
1007 FOR_BB_INSNS_REVERSE (bb, insn) | |
111 | 1008 if (DEBUG_INSN_P (insn)) |
1009 { | |
1010 df_ref use; | |
1011 FOR_EACH_INSN_USE (use, insn) | |
1012 if (!bitmap_bit_p (local_live, DF_REF_REGNO (use)) | |
1013 && !bitmap_bit_p (au, DF_REF_REGNO (use))) | |
1014 dead_debug_add (&debug, use, DF_REF_REGNO (use)); | |
1015 } | |
1016 else if (INSN_P (insn)) | |
0 | 1017 { |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1018 bool needed = marked_insn_p (insn); |
0 | 1019 |
1020 /* The insn is needed if there is someone who uses the output. */ | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1021 if (!needed) |
111 | 1022 FOR_EACH_INSN_DEF (def, insn) |
1023 if (bitmap_bit_p (local_live, DF_REF_REGNO (def)) | |
1024 || bitmap_bit_p (au, DF_REF_REGNO (def))) | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1025 { |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1026 needed = true; |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1027 mark_insn (insn, true); |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1028 break; |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1029 } |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1030 |
0 | 1031 /* No matter if the instruction is needed or not, we remove |
1032 any regno in the defs from the live set. */ | |
1033 df_simulate_defs (insn, local_live); | |
1034 | |
1035 /* On the other hand, we do not allow the dead uses to set | |
1036 anything in local_live. */ | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1037 if (needed) |
0 | 1038 df_simulate_uses (insn, local_live); |
111 | 1039 |
1040 /* Insert debug temps for dead REGs used in subsequent debug | |
1041 insns. We may have to emit a debug temp even if the insn | |
1042 was marked, in case the debug use was after the point of | |
1043 death. */ | |
1044 if (debug.used && !bitmap_empty_p (debug.used)) | |
1045 FOR_EACH_INSN_DEF (def, insn) | |
1046 dead_debug_insert_temp (&debug, DF_REF_REGNO (def), insn, | |
1047 needed && !control_flow_insn_p (insn) | |
1048 ? DEBUG_TEMP_AFTER_WITH_REG_FORCE | |
1049 : DEBUG_TEMP_BEFORE_WITH_VALUE); | |
0 | 1050 } |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1051 |
111 | 1052 dead_debug_local_finish (&debug, NULL); |
0 | 1053 df_simulate_finalize_backwards (bb, local_live); |
1054 | |
1055 block_changed = !bitmap_equal_p (local_live, DF_LR_IN (bb)); | |
1056 if (block_changed) | |
1057 bitmap_copy (DF_LR_IN (bb), local_live); | |
1058 | |
1059 BITMAP_FREE (local_live); | |
1060 return block_changed; | |
1061 } | |
1062 | |
1063 | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1064 /* Perform fast DCE once initialization is done. If WORD_LEVEL is |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1065 true, use the word level dce, otherwise do it at the pseudo |
0 | 1066 level. */ |
1067 | |
1068 static void | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1069 fast_dce (bool word_level) |
0 | 1070 { |
1071 int *postorder = df_get_postorder (DF_BACKWARD); | |
1072 int n_blocks = df_get_n_blocks (DF_BACKWARD); | |
1073 /* The set of blocks that have been seen on this iteration. */ | |
1074 bitmap processed = BITMAP_ALLOC (&dce_blocks_bitmap_obstack); | |
1075 /* The set of blocks that need to have the out vectors reset because | |
1076 the in of one of their successors has changed. */ | |
1077 bitmap redo_out = BITMAP_ALLOC (&dce_blocks_bitmap_obstack); | |
1078 bitmap all_blocks = BITMAP_ALLOC (&dce_blocks_bitmap_obstack); | |
1079 bool global_changed = true; | |
1080 | |
1081 /* These regs are considered always live so if they end up dying | |
1082 because of some def, we need to bring the back again. Calling | |
1083 df_simulate_fixup_sets has the disadvantage of calling | |
1084 bb_has_eh_pred once per insn, so we cache the information | |
1085 here. */ | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1086 bitmap au = &df->regular_block_artificial_uses; |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1087 bitmap au_eh = &df->eh_block_artificial_uses; |
0 | 1088 int i; |
111 | 1089 struct dead_debug_global global_debug; |
0 | 1090 |
1091 prescan_insns_for_dce (true); | |
1092 | |
1093 for (i = 0; i < n_blocks; i++) | |
1094 bitmap_set_bit (all_blocks, postorder[i]); | |
1095 | |
111 | 1096 dead_debug_global_init (&global_debug, NULL); |
1097 | |
0 | 1098 while (global_changed) |
1099 { | |
1100 global_changed = false; | |
1101 | |
1102 for (i = 0; i < n_blocks; i++) | |
1103 { | |
1104 int index = postorder[i]; | |
111 | 1105 basic_block bb = BASIC_BLOCK_FOR_FN (cfun, index); |
0 | 1106 bool local_changed; |
1107 | |
1108 if (index < NUM_FIXED_BLOCKS) | |
1109 { | |
1110 bitmap_set_bit (processed, index); | |
1111 continue; | |
1112 } | |
1113 | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1114 if (word_level) |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1115 local_changed |
111 | 1116 = word_dce_process_block (bb, bitmap_bit_p (redo_out, index), |
1117 &global_debug); | |
0 | 1118 else |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1119 local_changed |
0 | 1120 = dce_process_block (bb, bitmap_bit_p (redo_out, index), |
111 | 1121 bb_has_eh_pred (bb) ? au_eh : au, |
1122 &global_debug); | |
0 | 1123 bitmap_set_bit (processed, index); |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1124 |
0 | 1125 if (local_changed) |
1126 { | |
1127 edge e; | |
1128 edge_iterator ei; | |
1129 FOR_EACH_EDGE (e, ei, bb->preds) | |
1130 if (bitmap_bit_p (processed, e->src->index)) | |
1131 /* Be tricky about when we need to iterate the | |
1132 analysis. We only have redo the analysis if the | |
1133 bitmaps change at the top of a block that is the | |
1134 entry to a loop. */ | |
1135 global_changed = true; | |
1136 else | |
1137 bitmap_set_bit (redo_out, e->src->index); | |
1138 } | |
1139 } | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1140 |
0 | 1141 if (global_changed) |
1142 { | |
1143 /* Turn off the RUN_DCE flag to prevent recursive calls to | |
1144 dce. */ | |
1145 int old_flag = df_clear_flags (DF_LR_RUN_DCE); | |
1146 | |
1147 /* So something was deleted that requires a redo. Do it on | |
1148 the cheap. */ | |
1149 delete_unmarked_insns (); | |
111 | 1150 bitmap_clear (marked); |
0 | 1151 bitmap_clear (processed); |
1152 bitmap_clear (redo_out); | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1153 |
0 | 1154 /* We do not need to rescan any instructions. We only need |
1155 to redo the dataflow equations for the blocks that had a | |
1156 change at the top of the block. Then we need to redo the | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1157 iteration. */ |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1158 if (word_level) |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1159 df_analyze_problem (df_word_lr, all_blocks, postorder, n_blocks); |
0 | 1160 else |
1161 df_analyze_problem (df_lr, all_blocks, postorder, n_blocks); | |
1162 | |
1163 if (old_flag & DF_LR_RUN_DCE) | |
1164 df_set_flags (DF_LR_RUN_DCE); | |
1165 | |
1166 prescan_insns_for_dce (true); | |
1167 } | |
1168 } | |
1169 | |
111 | 1170 dead_debug_global_finish (&global_debug, NULL); |
1171 | |
0 | 1172 delete_unmarked_insns (); |
1173 | |
1174 BITMAP_FREE (processed); | |
1175 BITMAP_FREE (redo_out); | |
1176 BITMAP_FREE (all_blocks); | |
1177 } | |
1178 | |
1179 | |
1180 /* Fast register level DCE. */ | |
1181 | |
1182 static unsigned int | |
1183 rest_of_handle_fast_dce (void) | |
1184 { | |
1185 init_dce (true); | |
1186 fast_dce (false); | |
1187 fini_dce (true); | |
1188 return 0; | |
1189 } | |
1190 | |
1191 | |
1192 /* Fast byte level DCE. */ | |
1193 | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1194 void |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1195 run_word_dce (void) |
0 | 1196 { |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1197 int old_flags; |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1198 |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1199 if (!flag_dce) |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1200 return; |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1201 |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1202 timevar_push (TV_DCE); |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1203 old_flags = df_clear_flags (DF_DEFER_INSN_RESCAN + DF_NO_INSN_RESCAN); |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1204 df_word_lr_add_problem (); |
0 | 1205 init_dce (true); |
1206 fast_dce (true); | |
1207 fini_dce (true); | |
67
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1208 df_set_flags (old_flags); |
f6334be47118
update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents:
55
diff
changeset
|
1209 timevar_pop (TV_DCE); |
0 | 1210 } |
1211 | |
1212 | |
1213 /* This is an internal call that is used by the df live register | |
1214 problem to run fast dce as a side effect of creating the live | |
1215 information. The stack is organized so that the lr problem is run, | |
1216 this pass is run, which updates the live info and the df scanning | |
1217 info, and then returns to allow the rest of the problems to be run. | |
1218 | |
1219 This can be called by elsewhere but it will not update the bit | |
1220 vectors for any other problems than LR. */ | |
1221 | |
1222 void | |
1223 run_fast_df_dce (void) | |
1224 { | |
1225 if (flag_dce) | |
1226 { | |
1227 /* If dce is able to delete something, it has to happen | |
1228 immediately. Otherwise there will be problems handling the | |
1229 eq_notes. */ | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1230 int old_flags = |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1231 df_clear_flags (DF_DEFER_INSN_RESCAN + DF_NO_INSN_RESCAN); |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1232 |
0 | 1233 df_in_progress = true; |
1234 rest_of_handle_fast_dce (); | |
1235 df_in_progress = false; | |
1236 | |
1237 df_set_flags (old_flags); | |
1238 } | |
1239 } | |
1240 | |
1241 | |
1242 /* Run a fast DCE pass. */ | |
1243 | |
1244 void | |
1245 run_fast_dce (void) | |
1246 { | |
1247 if (flag_dce) | |
1248 rest_of_handle_fast_dce (); | |
1249 } | |
1250 | |
1251 | |
111 | 1252 namespace { |
1253 | |
1254 const pass_data pass_data_fast_rtl_dce = | |
0 | 1255 { |
111 | 1256 RTL_PASS, /* type */ |
1257 "rtl_dce", /* name */ | |
1258 OPTGROUP_NONE, /* optinfo_flags */ | |
1259 TV_DCE, /* tv_id */ | |
1260 0, /* properties_required */ | |
1261 0, /* properties_provided */ | |
1262 0, /* properties_destroyed */ | |
1263 0, /* todo_flags_start */ | |
1264 TODO_df_finish, /* todo_flags_finish */ | |
1265 }; | |
0 | 1266 |
111 | 1267 class pass_fast_rtl_dce : public rtl_opt_pass |
0 | 1268 { |
111 | 1269 public: |
1270 pass_fast_rtl_dce (gcc::context *ctxt) | |
1271 : rtl_opt_pass (pass_data_fast_rtl_dce, ctxt) | |
1272 {} | |
1273 | |
1274 /* opt_pass methods: */ | |
1275 virtual bool gate (function *) | |
1276 { | |
1277 return optimize > 0 && flag_dce && dbg_cnt (dce_fast); | |
1278 } | |
1279 | |
1280 virtual unsigned int execute (function *) | |
1281 { | |
1282 return rest_of_handle_fast_dce (); | |
1283 } | |
1284 | |
1285 }; // class pass_fast_rtl_dce | |
1286 | |
1287 } // anon namespace | |
1288 | |
1289 rtl_opt_pass * | |
1290 make_pass_fast_rtl_dce (gcc::context *ctxt) | |
1291 { | |
1292 return new pass_fast_rtl_dce (ctxt); | |
1293 } |