Mercurial > hg > CbC > CbC_gcc
annotate gcc/jump.c @ 63:b7f97abdc517 gcc-4.6-20100522
update gcc from gcc-4.5.0 to gcc-4.6
author | ryoma <e075725@ie.u-ryukyu.ac.jp> |
---|---|
date | Mon, 24 May 2010 12:47:05 +0900 |
parents | 77e2b8dfacca |
children | f6334be47118 |
rev | line source |
---|---|
0 | 1 /* Optimize jump instructions, for GNU compiler. |
2 Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997 | |
3 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009 | |
4 Free Software Foundation, Inc. | |
5 | |
6 This file is part of GCC. | |
7 | |
8 GCC is free software; you can redistribute it and/or modify it under | |
9 the terms of the GNU General Public License as published by the Free | |
10 Software Foundation; either version 3, or (at your option) any later | |
11 version. | |
12 | |
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 for more details. | |
17 | |
18 You should have received a copy of the GNU General Public License | |
19 along with GCC; see the file COPYING3. If not see | |
20 <http://www.gnu.org/licenses/>. */ | |
21 | |
22 /* This is the pathetic reminder of old fame of the jump-optimization pass | |
23 of the compiler. Now it contains basically a set of utility functions to | |
24 operate with jumps. | |
25 | |
26 Each CODE_LABEL has a count of the times it is used | |
27 stored in the LABEL_NUSES internal field, and each JUMP_INSN | |
28 has one label that it refers to stored in the | |
29 JUMP_LABEL internal field. With this we can detect labels that | |
30 become unused because of the deletion of all the jumps that | |
31 formerly used them. The JUMP_LABEL info is sometimes looked | |
32 at by later passes. | |
33 | |
34 The subroutines redirect_jump and invert_jump are used | |
35 from other passes as well. */ | |
36 | |
37 #include "config.h" | |
38 #include "system.h" | |
39 #include "coretypes.h" | |
40 #include "tm.h" | |
41 #include "rtl.h" | |
42 #include "tm_p.h" | |
43 #include "flags.h" | |
44 #include "hard-reg-set.h" | |
45 #include "regs.h" | |
46 #include "insn-config.h" | |
47 #include "insn-attr.h" | |
48 #include "recog.h" | |
49 #include "function.h" | |
50 #include "expr.h" | |
51 #include "except.h" | |
52 #include "diagnostic.h" | |
53 #include "toplev.h" | |
54 #include "reload.h" | |
55 #include "predict.h" | |
56 #include "timevar.h" | |
57 #include "tree-pass.h" | |
58 #include "target.h" | |
59 | |
60 /* Optimize jump y; x: ... y: jumpif... x? | |
61 Don't know if it is worth bothering with. */ | |
62 /* Optimize two cases of conditional jump to conditional jump? | |
63 This can never delete any instruction or make anything dead, | |
64 or even change what is live at any point. | |
65 So perhaps let combiner do it. */ | |
66 | |
67 static void init_label_info (rtx); | |
68 static void mark_all_labels (rtx); | |
69 static void mark_jump_label_1 (rtx, rtx, bool, bool); | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
70 static void mark_jump_label_asm (rtx, rtx); |
0 | 71 static void redirect_exp_1 (rtx *, rtx, rtx, rtx); |
72 static int invert_exp_1 (rtx, rtx); | |
73 static int returnjump_p_1 (rtx *, void *); | |
74 | |
75 /* This function rebuilds the JUMP_LABEL field and REG_LABEL_TARGET | |
76 notes in jumping insns and REG_LABEL_OPERAND notes in non-jumping | |
77 instructions and jumping insns that have labels as operands | |
78 (e.g. cbranchsi4). */ | |
79 void | |
80 rebuild_jump_labels (rtx f) | |
81 { | |
82 rtx insn; | |
83 | |
84 timevar_push (TV_REBUILD_JUMP); | |
85 init_label_info (f); | |
86 mark_all_labels (f); | |
87 | |
88 /* Keep track of labels used from static data; we don't track them | |
89 closely enough to delete them here, so make sure their reference | |
90 count doesn't drop to zero. */ | |
91 | |
92 for (insn = forced_labels; insn; insn = XEXP (insn, 1)) | |
93 if (LABEL_P (XEXP (insn, 0))) | |
94 LABEL_NUSES (XEXP (insn, 0))++; | |
95 timevar_pop (TV_REBUILD_JUMP); | |
96 } | |
97 | |
98 /* Some old code expects exactly one BARRIER as the NEXT_INSN of a | |
99 non-fallthru insn. This is not generally true, as multiple barriers | |
100 may have crept in, or the BARRIER may be separated from the last | |
101 real insn by one or more NOTEs. | |
102 | |
103 This simple pass moves barriers and removes duplicates so that the | |
104 old code is happy. | |
105 */ | |
106 unsigned int | |
107 cleanup_barriers (void) | |
108 { | |
109 rtx insn, next, prev; | |
110 for (insn = get_insns (); insn; insn = next) | |
111 { | |
112 next = NEXT_INSN (insn); | |
113 if (BARRIER_P (insn)) | |
114 { | |
115 prev = prev_nonnote_insn (insn); | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
116 if (!prev) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
117 continue; |
0 | 118 if (BARRIER_P (prev)) |
119 delete_insn (insn); | |
120 else if (prev != PREV_INSN (insn)) | |
121 reorder_insns (insn, insn, prev); | |
122 } | |
123 } | |
124 return 0; | |
125 } | |
126 | |
127 struct rtl_opt_pass pass_cleanup_barriers = | |
128 { | |
129 { | |
130 RTL_PASS, | |
131 "barriers", /* name */ | |
132 NULL, /* gate */ | |
133 cleanup_barriers, /* execute */ | |
134 NULL, /* sub */ | |
135 NULL, /* next */ | |
136 0, /* static_pass_number */ | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
137 TV_NONE, /* tv_id */ |
0 | 138 0, /* properties_required */ |
139 0, /* properties_provided */ | |
140 0, /* properties_destroyed */ | |
141 0, /* todo_flags_start */ | |
142 TODO_dump_func /* todo_flags_finish */ | |
143 } | |
144 }; | |
145 | |
146 | |
147 /* Initialize LABEL_NUSES and JUMP_LABEL fields, add REG_LABEL_TARGET | |
148 for remaining targets for JUMP_P. Delete any REG_LABEL_OPERAND | |
149 notes whose labels don't occur in the insn any more. */ | |
150 | |
151 static void | |
152 init_label_info (rtx f) | |
153 { | |
154 rtx insn; | |
155 | |
156 for (insn = f; insn; insn = NEXT_INSN (insn)) | |
157 { | |
158 if (LABEL_P (insn)) | |
159 LABEL_NUSES (insn) = (LABEL_PRESERVE_P (insn) != 0); | |
160 | |
161 /* REG_LABEL_TARGET notes (including the JUMP_LABEL field) are | |
162 sticky and not reset here; that way we won't lose association | |
163 with a label when e.g. the source for a target register | |
164 disappears out of reach for targets that may use jump-target | |
165 registers. Jump transformations are supposed to transform | |
166 any REG_LABEL_TARGET notes. The target label reference in a | |
167 branch may disappear from the branch (and from the | |
168 instruction before it) for other reasons, like register | |
169 allocation. */ | |
170 | |
171 if (INSN_P (insn)) | |
172 { | |
173 rtx note, next; | |
174 | |
175 for (note = REG_NOTES (insn); note; note = next) | |
176 { | |
177 next = XEXP (note, 1); | |
178 if (REG_NOTE_KIND (note) == REG_LABEL_OPERAND | |
179 && ! reg_mentioned_p (XEXP (note, 0), PATTERN (insn))) | |
180 remove_note (insn, note); | |
181 } | |
182 } | |
183 } | |
184 } | |
185 | |
186 /* Mark the label each jump jumps to. | |
187 Combine consecutive labels, and count uses of labels. */ | |
188 | |
189 static void | |
190 mark_all_labels (rtx f) | |
191 { | |
192 rtx insn; | |
193 rtx prev_nonjump_insn = NULL; | |
194 | |
195 for (insn = f; insn; insn = NEXT_INSN (insn)) | |
196 if (INSN_P (insn)) | |
197 { | |
198 mark_jump_label (PATTERN (insn), insn, 0); | |
199 | |
200 /* If the previous non-jump insn sets something to a label, | |
201 something that this jump insn uses, make that label the primary | |
202 target of this insn if we don't yet have any. That previous | |
203 insn must be a single_set and not refer to more than one label. | |
204 The jump insn must not refer to other labels as jump targets | |
205 and must be a plain (set (pc) ...), maybe in a parallel, and | |
206 may refer to the item being set only directly or as one of the | |
207 arms in an IF_THEN_ELSE. */ | |
208 if (! INSN_DELETED_P (insn) | |
209 && JUMP_P (insn) | |
210 && JUMP_LABEL (insn) == NULL) | |
211 { | |
212 rtx label_note = NULL; | |
213 rtx pc = pc_set (insn); | |
214 rtx pc_src = pc != NULL ? SET_SRC (pc) : NULL; | |
215 | |
216 if (prev_nonjump_insn != NULL) | |
217 label_note | |
218 = find_reg_note (prev_nonjump_insn, REG_LABEL_OPERAND, NULL); | |
219 | |
220 if (label_note != NULL && pc_src != NULL) | |
221 { | |
222 rtx label_set = single_set (prev_nonjump_insn); | |
223 rtx label_dest | |
224 = label_set != NULL ? SET_DEST (label_set) : NULL; | |
225 | |
226 if (label_set != NULL | |
227 /* The source must be the direct LABEL_REF, not a | |
228 PLUS, UNSPEC, IF_THEN_ELSE etc. */ | |
229 && GET_CODE (SET_SRC (label_set)) == LABEL_REF | |
230 && (rtx_equal_p (label_dest, pc_src) | |
231 || (GET_CODE (pc_src) == IF_THEN_ELSE | |
232 && (rtx_equal_p (label_dest, XEXP (pc_src, 1)) | |
233 || rtx_equal_p (label_dest, | |
234 XEXP (pc_src, 2)))))) | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
235 |
0 | 236 { |
237 /* The CODE_LABEL referred to in the note must be the | |
238 CODE_LABEL in the LABEL_REF of the "set". We can | |
239 conveniently use it for the marker function, which | |
240 requires a LABEL_REF wrapping. */ | |
241 gcc_assert (XEXP (label_note, 0) | |
242 == XEXP (SET_SRC (label_set), 0)); | |
243 | |
244 mark_jump_label_1 (label_set, insn, false, true); | |
245 gcc_assert (JUMP_LABEL (insn) | |
246 == XEXP (SET_SRC (label_set), 0)); | |
247 } | |
248 } | |
249 } | |
250 else if (! INSN_DELETED_P (insn)) | |
251 prev_nonjump_insn = insn; | |
252 } | |
253 else if (LABEL_P (insn)) | |
254 prev_nonjump_insn = NULL; | |
255 | |
256 /* If we are in cfglayout mode, there may be non-insns between the | |
257 basic blocks. If those non-insns represent tablejump data, they | |
258 contain label references that we must record. */ | |
259 if (current_ir_type () == IR_RTL_CFGLAYOUT) | |
260 { | |
261 basic_block bb; | |
262 rtx insn; | |
263 FOR_EACH_BB (bb) | |
264 { | |
265 for (insn = bb->il.rtl->header; insn; insn = NEXT_INSN (insn)) | |
266 if (INSN_P (insn)) | |
267 { | |
268 gcc_assert (JUMP_TABLE_DATA_P (insn)); | |
269 mark_jump_label (PATTERN (insn), insn, 0); | |
270 } | |
271 | |
272 for (insn = bb->il.rtl->footer; insn; insn = NEXT_INSN (insn)) | |
273 if (INSN_P (insn)) | |
274 { | |
275 gcc_assert (JUMP_TABLE_DATA_P (insn)); | |
276 mark_jump_label (PATTERN (insn), insn, 0); | |
277 } | |
278 } | |
279 } | |
280 } | |
281 | |
282 /* Given a comparison (CODE ARG0 ARG1), inside an insn, INSN, return a code | |
283 of reversed comparison if it is possible to do so. Otherwise return UNKNOWN. | |
284 UNKNOWN may be returned in case we are having CC_MODE compare and we don't | |
285 know whether it's source is floating point or integer comparison. Machine | |
286 description should define REVERSIBLE_CC_MODE and REVERSE_CONDITION macros | |
287 to help this function avoid overhead in these cases. */ | |
288 enum rtx_code | |
289 reversed_comparison_code_parts (enum rtx_code code, const_rtx arg0, | |
290 const_rtx arg1, const_rtx insn) | |
291 { | |
292 enum machine_mode mode; | |
293 | |
294 /* If this is not actually a comparison, we can't reverse it. */ | |
295 if (GET_RTX_CLASS (code) != RTX_COMPARE | |
296 && GET_RTX_CLASS (code) != RTX_COMM_COMPARE) | |
297 return UNKNOWN; | |
298 | |
299 mode = GET_MODE (arg0); | |
300 if (mode == VOIDmode) | |
301 mode = GET_MODE (arg1); | |
302 | |
303 /* First see if machine description supplies us way to reverse the | |
304 comparison. Give it priority over everything else to allow | |
305 machine description to do tricks. */ | |
306 if (GET_MODE_CLASS (mode) == MODE_CC | |
307 && REVERSIBLE_CC_MODE (mode)) | |
308 { | |
309 #ifdef REVERSE_CONDITION | |
310 return REVERSE_CONDITION (code, mode); | |
311 #endif | |
312 return reverse_condition (code); | |
313 } | |
314 | |
315 /* Try a few special cases based on the comparison code. */ | |
316 switch (code) | |
317 { | |
318 case GEU: | |
319 case GTU: | |
320 case LEU: | |
321 case LTU: | |
322 case NE: | |
323 case EQ: | |
324 /* It is always safe to reverse EQ and NE, even for the floating | |
325 point. Similarly the unsigned comparisons are never used for | |
326 floating point so we can reverse them in the default way. */ | |
327 return reverse_condition (code); | |
328 case ORDERED: | |
329 case UNORDERED: | |
330 case LTGT: | |
331 case UNEQ: | |
332 /* In case we already see unordered comparison, we can be sure to | |
333 be dealing with floating point so we don't need any more tests. */ | |
334 return reverse_condition_maybe_unordered (code); | |
335 case UNLT: | |
336 case UNLE: | |
337 case UNGT: | |
338 case UNGE: | |
339 /* We don't have safe way to reverse these yet. */ | |
340 return UNKNOWN; | |
341 default: | |
342 break; | |
343 } | |
344 | |
345 if (GET_MODE_CLASS (mode) == MODE_CC || CC0_P (arg0)) | |
346 { | |
347 const_rtx prev; | |
348 /* Try to search for the comparison to determine the real mode. | |
349 This code is expensive, but with sane machine description it | |
350 will be never used, since REVERSIBLE_CC_MODE will return true | |
351 in all cases. */ | |
352 if (! insn) | |
353 return UNKNOWN; | |
354 | |
355 /* These CONST_CAST's are okay because prev_nonnote_insn just | |
356 returns its argument and we assign it to a const_rtx | |
357 variable. */ | |
358 for (prev = prev_nonnote_insn (CONST_CAST_RTX(insn)); | |
359 prev != 0 && !LABEL_P (prev); | |
360 prev = prev_nonnote_insn (CONST_CAST_RTX(prev))) | |
361 { | |
362 const_rtx set = set_of (arg0, prev); | |
363 if (set && GET_CODE (set) == SET | |
364 && rtx_equal_p (SET_DEST (set), arg0)) | |
365 { | |
366 rtx src = SET_SRC (set); | |
367 | |
368 if (GET_CODE (src) == COMPARE) | |
369 { | |
370 rtx comparison = src; | |
371 arg0 = XEXP (src, 0); | |
372 mode = GET_MODE (arg0); | |
373 if (mode == VOIDmode) | |
374 mode = GET_MODE (XEXP (comparison, 1)); | |
375 break; | |
376 } | |
377 /* We can get past reg-reg moves. This may be useful for model | |
378 of i387 comparisons that first move flag registers around. */ | |
379 if (REG_P (src)) | |
380 { | |
381 arg0 = src; | |
382 continue; | |
383 } | |
384 } | |
385 /* If register is clobbered in some ununderstandable way, | |
386 give up. */ | |
387 if (set) | |
388 return UNKNOWN; | |
389 } | |
390 } | |
391 | |
392 /* Test for an integer condition, or a floating-point comparison | |
393 in which NaNs can be ignored. */ | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
394 if (CONST_INT_P (arg0) |
0 | 395 || (GET_MODE (arg0) != VOIDmode |
396 && GET_MODE_CLASS (mode) != MODE_CC | |
397 && !HONOR_NANS (mode))) | |
398 return reverse_condition (code); | |
399 | |
400 return UNKNOWN; | |
401 } | |
402 | |
403 /* A wrapper around the previous function to take COMPARISON as rtx | |
404 expression. This simplifies many callers. */ | |
405 enum rtx_code | |
406 reversed_comparison_code (const_rtx comparison, const_rtx insn) | |
407 { | |
408 if (!COMPARISON_P (comparison)) | |
409 return UNKNOWN; | |
410 return reversed_comparison_code_parts (GET_CODE (comparison), | |
411 XEXP (comparison, 0), | |
412 XEXP (comparison, 1), insn); | |
413 } | |
414 | |
415 /* Return comparison with reversed code of EXP. | |
416 Return NULL_RTX in case we fail to do the reversal. */ | |
417 rtx | |
418 reversed_comparison (const_rtx exp, enum machine_mode mode) | |
419 { | |
420 enum rtx_code reversed_code = reversed_comparison_code (exp, NULL_RTX); | |
421 if (reversed_code == UNKNOWN) | |
422 return NULL_RTX; | |
423 else | |
424 return simplify_gen_relational (reversed_code, mode, VOIDmode, | |
425 XEXP (exp, 0), XEXP (exp, 1)); | |
426 } | |
427 | |
428 | |
429 /* Given an rtx-code for a comparison, return the code for the negated | |
430 comparison. If no such code exists, return UNKNOWN. | |
431 | |
432 WATCH OUT! reverse_condition is not safe to use on a jump that might | |
433 be acting on the results of an IEEE floating point comparison, because | |
434 of the special treatment of non-signaling nans in comparisons. | |
435 Use reversed_comparison_code instead. */ | |
436 | |
437 enum rtx_code | |
438 reverse_condition (enum rtx_code code) | |
439 { | |
440 switch (code) | |
441 { | |
442 case EQ: | |
443 return NE; | |
444 case NE: | |
445 return EQ; | |
446 case GT: | |
447 return LE; | |
448 case GE: | |
449 return LT; | |
450 case LT: | |
451 return GE; | |
452 case LE: | |
453 return GT; | |
454 case GTU: | |
455 return LEU; | |
456 case GEU: | |
457 return LTU; | |
458 case LTU: | |
459 return GEU; | |
460 case LEU: | |
461 return GTU; | |
462 case UNORDERED: | |
463 return ORDERED; | |
464 case ORDERED: | |
465 return UNORDERED; | |
466 | |
467 case UNLT: | |
468 case UNLE: | |
469 case UNGT: | |
470 case UNGE: | |
471 case UNEQ: | |
472 case LTGT: | |
473 return UNKNOWN; | |
474 | |
475 default: | |
476 gcc_unreachable (); | |
477 } | |
478 } | |
479 | |
480 /* Similar, but we're allowed to generate unordered comparisons, which | |
481 makes it safe for IEEE floating-point. Of course, we have to recognize | |
482 that the target will support them too... */ | |
483 | |
484 enum rtx_code | |
485 reverse_condition_maybe_unordered (enum rtx_code code) | |
486 { | |
487 switch (code) | |
488 { | |
489 case EQ: | |
490 return NE; | |
491 case NE: | |
492 return EQ; | |
493 case GT: | |
494 return UNLE; | |
495 case GE: | |
496 return UNLT; | |
497 case LT: | |
498 return UNGE; | |
499 case LE: | |
500 return UNGT; | |
501 case LTGT: | |
502 return UNEQ; | |
503 case UNORDERED: | |
504 return ORDERED; | |
505 case ORDERED: | |
506 return UNORDERED; | |
507 case UNLT: | |
508 return GE; | |
509 case UNLE: | |
510 return GT; | |
511 case UNGT: | |
512 return LE; | |
513 case UNGE: | |
514 return LT; | |
515 case UNEQ: | |
516 return LTGT; | |
517 | |
518 default: | |
519 gcc_unreachable (); | |
520 } | |
521 } | |
522 | |
523 /* Similar, but return the code when two operands of a comparison are swapped. | |
524 This IS safe for IEEE floating-point. */ | |
525 | |
526 enum rtx_code | |
527 swap_condition (enum rtx_code code) | |
528 { | |
529 switch (code) | |
530 { | |
531 case EQ: | |
532 case NE: | |
533 case UNORDERED: | |
534 case ORDERED: | |
535 case UNEQ: | |
536 case LTGT: | |
537 return code; | |
538 | |
539 case GT: | |
540 return LT; | |
541 case GE: | |
542 return LE; | |
543 case LT: | |
544 return GT; | |
545 case LE: | |
546 return GE; | |
547 case GTU: | |
548 return LTU; | |
549 case GEU: | |
550 return LEU; | |
551 case LTU: | |
552 return GTU; | |
553 case LEU: | |
554 return GEU; | |
555 case UNLT: | |
556 return UNGT; | |
557 case UNLE: | |
558 return UNGE; | |
559 case UNGT: | |
560 return UNLT; | |
561 case UNGE: | |
562 return UNLE; | |
563 | |
564 default: | |
565 gcc_unreachable (); | |
566 } | |
567 } | |
568 | |
569 /* Given a comparison CODE, return the corresponding unsigned comparison. | |
570 If CODE is an equality comparison or already an unsigned comparison, | |
571 CODE is returned. */ | |
572 | |
573 enum rtx_code | |
574 unsigned_condition (enum rtx_code code) | |
575 { | |
576 switch (code) | |
577 { | |
578 case EQ: | |
579 case NE: | |
580 case GTU: | |
581 case GEU: | |
582 case LTU: | |
583 case LEU: | |
584 return code; | |
585 | |
586 case GT: | |
587 return GTU; | |
588 case GE: | |
589 return GEU; | |
590 case LT: | |
591 return LTU; | |
592 case LE: | |
593 return LEU; | |
594 | |
595 default: | |
596 gcc_unreachable (); | |
597 } | |
598 } | |
599 | |
600 /* Similarly, return the signed version of a comparison. */ | |
601 | |
602 enum rtx_code | |
603 signed_condition (enum rtx_code code) | |
604 { | |
605 switch (code) | |
606 { | |
607 case EQ: | |
608 case NE: | |
609 case GT: | |
610 case GE: | |
611 case LT: | |
612 case LE: | |
613 return code; | |
614 | |
615 case GTU: | |
616 return GT; | |
617 case GEU: | |
618 return GE; | |
619 case LTU: | |
620 return LT; | |
621 case LEU: | |
622 return LE; | |
623 | |
624 default: | |
625 gcc_unreachable (); | |
626 } | |
627 } | |
628 | |
629 /* Return nonzero if CODE1 is more strict than CODE2, i.e., if the | |
630 truth of CODE1 implies the truth of CODE2. */ | |
631 | |
632 int | |
633 comparison_dominates_p (enum rtx_code code1, enum rtx_code code2) | |
634 { | |
635 /* UNKNOWN comparison codes can happen as a result of trying to revert | |
636 comparison codes. | |
637 They can't match anything, so we have to reject them here. */ | |
638 if (code1 == UNKNOWN || code2 == UNKNOWN) | |
639 return 0; | |
640 | |
641 if (code1 == code2) | |
642 return 1; | |
643 | |
644 switch (code1) | |
645 { | |
646 case UNEQ: | |
647 if (code2 == UNLE || code2 == UNGE) | |
648 return 1; | |
649 break; | |
650 | |
651 case EQ: | |
652 if (code2 == LE || code2 == LEU || code2 == GE || code2 == GEU | |
653 || code2 == ORDERED) | |
654 return 1; | |
655 break; | |
656 | |
657 case UNLT: | |
658 if (code2 == UNLE || code2 == NE) | |
659 return 1; | |
660 break; | |
661 | |
662 case LT: | |
663 if (code2 == LE || code2 == NE || code2 == ORDERED || code2 == LTGT) | |
664 return 1; | |
665 break; | |
666 | |
667 case UNGT: | |
668 if (code2 == UNGE || code2 == NE) | |
669 return 1; | |
670 break; | |
671 | |
672 case GT: | |
673 if (code2 == GE || code2 == NE || code2 == ORDERED || code2 == LTGT) | |
674 return 1; | |
675 break; | |
676 | |
677 case GE: | |
678 case LE: | |
679 if (code2 == ORDERED) | |
680 return 1; | |
681 break; | |
682 | |
683 case LTGT: | |
684 if (code2 == NE || code2 == ORDERED) | |
685 return 1; | |
686 break; | |
687 | |
688 case LTU: | |
689 if (code2 == LEU || code2 == NE) | |
690 return 1; | |
691 break; | |
692 | |
693 case GTU: | |
694 if (code2 == GEU || code2 == NE) | |
695 return 1; | |
696 break; | |
697 | |
698 case UNORDERED: | |
699 if (code2 == NE || code2 == UNEQ || code2 == UNLE || code2 == UNLT | |
700 || code2 == UNGE || code2 == UNGT) | |
701 return 1; | |
702 break; | |
703 | |
704 default: | |
705 break; | |
706 } | |
707 | |
708 return 0; | |
709 } | |
710 | |
711 /* Return 1 if INSN is an unconditional jump and nothing else. */ | |
712 | |
713 int | |
714 simplejump_p (const_rtx insn) | |
715 { | |
716 return (JUMP_P (insn) | |
717 && GET_CODE (PATTERN (insn)) == SET | |
718 && GET_CODE (SET_DEST (PATTERN (insn))) == PC | |
719 && GET_CODE (SET_SRC (PATTERN (insn))) == LABEL_REF); | |
720 } | |
721 | |
722 /* Return nonzero if INSN is a (possibly) conditional jump | |
723 and nothing more. | |
724 | |
725 Use of this function is deprecated, since we need to support combined | |
726 branch and compare insns. Use any_condjump_p instead whenever possible. */ | |
727 | |
728 int | |
729 condjump_p (const_rtx insn) | |
730 { | |
731 const_rtx x = PATTERN (insn); | |
732 | |
733 if (GET_CODE (x) != SET | |
734 || GET_CODE (SET_DEST (x)) != PC) | |
735 return 0; | |
736 | |
737 x = SET_SRC (x); | |
738 if (GET_CODE (x) == LABEL_REF) | |
739 return 1; | |
740 else | |
741 return (GET_CODE (x) == IF_THEN_ELSE | |
742 && ((GET_CODE (XEXP (x, 2)) == PC | |
743 && (GET_CODE (XEXP (x, 1)) == LABEL_REF | |
744 || GET_CODE (XEXP (x, 1)) == RETURN)) | |
745 || (GET_CODE (XEXP (x, 1)) == PC | |
746 && (GET_CODE (XEXP (x, 2)) == LABEL_REF | |
747 || GET_CODE (XEXP (x, 2)) == RETURN)))); | |
748 } | |
749 | |
750 /* Return nonzero if INSN is a (possibly) conditional jump inside a | |
751 PARALLEL. | |
752 | |
753 Use this function is deprecated, since we need to support combined | |
754 branch and compare insns. Use any_condjump_p instead whenever possible. */ | |
755 | |
756 int | |
757 condjump_in_parallel_p (const_rtx insn) | |
758 { | |
759 const_rtx x = PATTERN (insn); | |
760 | |
761 if (GET_CODE (x) != PARALLEL) | |
762 return 0; | |
763 else | |
764 x = XVECEXP (x, 0, 0); | |
765 | |
766 if (GET_CODE (x) != SET) | |
767 return 0; | |
768 if (GET_CODE (SET_DEST (x)) != PC) | |
769 return 0; | |
770 if (GET_CODE (SET_SRC (x)) == LABEL_REF) | |
771 return 1; | |
772 if (GET_CODE (SET_SRC (x)) != IF_THEN_ELSE) | |
773 return 0; | |
774 if (XEXP (SET_SRC (x), 2) == pc_rtx | |
775 && (GET_CODE (XEXP (SET_SRC (x), 1)) == LABEL_REF | |
776 || GET_CODE (XEXP (SET_SRC (x), 1)) == RETURN)) | |
777 return 1; | |
778 if (XEXP (SET_SRC (x), 1) == pc_rtx | |
779 && (GET_CODE (XEXP (SET_SRC (x), 2)) == LABEL_REF | |
780 || GET_CODE (XEXP (SET_SRC (x), 2)) == RETURN)) | |
781 return 1; | |
782 return 0; | |
783 } | |
784 | |
785 /* Return set of PC, otherwise NULL. */ | |
786 | |
787 rtx | |
788 pc_set (const_rtx insn) | |
789 { | |
790 rtx pat; | |
791 if (!JUMP_P (insn)) | |
792 return NULL_RTX; | |
793 pat = PATTERN (insn); | |
794 | |
795 /* The set is allowed to appear either as the insn pattern or | |
796 the first set in a PARALLEL. */ | |
797 if (GET_CODE (pat) == PARALLEL) | |
798 pat = XVECEXP (pat, 0, 0); | |
799 if (GET_CODE (pat) == SET && GET_CODE (SET_DEST (pat)) == PC) | |
800 return pat; | |
801 | |
802 return NULL_RTX; | |
803 } | |
804 | |
805 /* Return true when insn is an unconditional direct jump, | |
806 possibly bundled inside a PARALLEL. */ | |
807 | |
808 int | |
809 any_uncondjump_p (const_rtx insn) | |
810 { | |
811 const_rtx x = pc_set (insn); | |
812 if (!x) | |
813 return 0; | |
814 if (GET_CODE (SET_SRC (x)) != LABEL_REF) | |
815 return 0; | |
816 if (find_reg_note (insn, REG_NON_LOCAL_GOTO, NULL_RTX)) | |
817 return 0; | |
818 return 1; | |
819 } | |
820 | |
821 /* Return true when insn is a conditional jump. This function works for | |
822 instructions containing PC sets in PARALLELs. The instruction may have | |
823 various other effects so before removing the jump you must verify | |
824 onlyjump_p. | |
825 | |
826 Note that unlike condjump_p it returns false for unconditional jumps. */ | |
827 | |
828 int | |
829 any_condjump_p (const_rtx insn) | |
830 { | |
831 const_rtx x = pc_set (insn); | |
832 enum rtx_code a, b; | |
833 | |
834 if (!x) | |
835 return 0; | |
836 if (GET_CODE (SET_SRC (x)) != IF_THEN_ELSE) | |
837 return 0; | |
838 | |
839 a = GET_CODE (XEXP (SET_SRC (x), 1)); | |
840 b = GET_CODE (XEXP (SET_SRC (x), 2)); | |
841 | |
842 return ((b == PC && (a == LABEL_REF || a == RETURN)) | |
843 || (a == PC && (b == LABEL_REF || b == RETURN))); | |
844 } | |
845 | |
846 /* Return the label of a conditional jump. */ | |
847 | |
848 rtx | |
849 condjump_label (const_rtx insn) | |
850 { | |
851 rtx x = pc_set (insn); | |
852 | |
853 if (!x) | |
854 return NULL_RTX; | |
855 x = SET_SRC (x); | |
856 if (GET_CODE (x) == LABEL_REF) | |
857 return x; | |
858 if (GET_CODE (x) != IF_THEN_ELSE) | |
859 return NULL_RTX; | |
860 if (XEXP (x, 2) == pc_rtx && GET_CODE (XEXP (x, 1)) == LABEL_REF) | |
861 return XEXP (x, 1); | |
862 if (XEXP (x, 1) == pc_rtx && GET_CODE (XEXP (x, 2)) == LABEL_REF) | |
863 return XEXP (x, 2); | |
864 return NULL_RTX; | |
865 } | |
866 | |
867 /* Return true if INSN is a (possibly conditional) return insn. */ | |
868 | |
869 static int | |
870 returnjump_p_1 (rtx *loc, void *data ATTRIBUTE_UNUSED) | |
871 { | |
872 rtx x = *loc; | |
873 | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
874 if (x == NULL) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
875 return false; |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
876 |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
877 switch (GET_CODE (x)) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
878 { |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
879 case RETURN: |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
880 case EH_RETURN: |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
881 return true; |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
882 |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
883 case SET: |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
884 return SET_IS_RETURN_P (x); |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
885 |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
886 default: |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
887 return false; |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
888 } |
0 | 889 } |
890 | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
891 /* Return TRUE if INSN is a return jump. */ |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
892 |
0 | 893 int |
894 returnjump_p (rtx insn) | |
895 { | |
896 if (!JUMP_P (insn)) | |
897 return 0; | |
898 return for_each_rtx (&PATTERN (insn), returnjump_p_1, NULL); | |
899 } | |
900 | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
901 /* Return true if INSN is a (possibly conditional) return insn. */ |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
902 |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
903 static int |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
904 eh_returnjump_p_1 (rtx *loc, void *data ATTRIBUTE_UNUSED) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
905 { |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
906 return *loc && GET_CODE (*loc) == EH_RETURN; |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
907 } |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
908 |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
909 int |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
910 eh_returnjump_p (rtx insn) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
911 { |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
912 if (!JUMP_P (insn)) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
913 return 0; |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
914 return for_each_rtx (&PATTERN (insn), eh_returnjump_p_1, NULL); |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
915 } |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
916 |
0 | 917 /* Return true if INSN is a jump that only transfers control and |
918 nothing more. */ | |
919 | |
920 int | |
921 onlyjump_p (const_rtx insn) | |
922 { | |
923 rtx set; | |
924 | |
925 if (!JUMP_P (insn)) | |
926 return 0; | |
927 | |
928 set = single_set (insn); | |
929 if (set == NULL) | |
930 return 0; | |
931 if (GET_CODE (SET_DEST (set)) != PC) | |
932 return 0; | |
933 if (side_effects_p (SET_SRC (set))) | |
934 return 0; | |
935 | |
936 return 1; | |
937 } | |
938 | |
939 #ifdef HAVE_cc0 | |
940 | |
941 /* Return nonzero if X is an RTX that only sets the condition codes | |
942 and has no side effects. */ | |
943 | |
944 int | |
945 only_sets_cc0_p (const_rtx x) | |
946 { | |
947 if (! x) | |
948 return 0; | |
949 | |
950 if (INSN_P (x)) | |
951 x = PATTERN (x); | |
952 | |
953 return sets_cc0_p (x) == 1 && ! side_effects_p (x); | |
954 } | |
955 | |
956 /* Return 1 if X is an RTX that does nothing but set the condition codes | |
957 and CLOBBER or USE registers. | |
958 Return -1 if X does explicitly set the condition codes, | |
959 but also does other things. */ | |
960 | |
961 int | |
962 sets_cc0_p (const_rtx x) | |
963 { | |
964 if (! x) | |
965 return 0; | |
966 | |
967 if (INSN_P (x)) | |
968 x = PATTERN (x); | |
969 | |
970 if (GET_CODE (x) == SET && SET_DEST (x) == cc0_rtx) | |
971 return 1; | |
972 if (GET_CODE (x) == PARALLEL) | |
973 { | |
974 int i; | |
975 int sets_cc0 = 0; | |
976 int other_things = 0; | |
977 for (i = XVECLEN (x, 0) - 1; i >= 0; i--) | |
978 { | |
979 if (GET_CODE (XVECEXP (x, 0, i)) == SET | |
980 && SET_DEST (XVECEXP (x, 0, i)) == cc0_rtx) | |
981 sets_cc0 = 1; | |
982 else if (GET_CODE (XVECEXP (x, 0, i)) == SET) | |
983 other_things = 1; | |
984 } | |
985 return ! sets_cc0 ? 0 : other_things ? -1 : 1; | |
986 } | |
987 return 0; | |
988 } | |
989 #endif | |
990 | |
991 /* Find all CODE_LABELs referred to in X, and increment their use | |
992 counts. If INSN is a JUMP_INSN and there is at least one | |
993 CODE_LABEL referenced in INSN as a jump target, then store the last | |
994 one in JUMP_LABEL (INSN). For a tablejump, this must be the label | |
995 for the ADDR_VEC. Store any other jump targets as REG_LABEL_TARGET | |
996 notes. If INSN is an INSN or a CALL_INSN or non-target operands of | |
997 a JUMP_INSN, and there is at least one CODE_LABEL referenced in | |
998 INSN, add a REG_LABEL_OPERAND note containing that label to INSN. | |
999 | |
1000 Note that two labels separated by a loop-beginning note | |
1001 must be kept distinct if we have not yet done loop-optimization, | |
1002 because the gap between them is where loop-optimize | |
1003 will want to move invariant code to. CROSS_JUMP tells us | |
1004 that loop-optimization is done with. */ | |
1005 | |
1006 void | |
1007 mark_jump_label (rtx x, rtx insn, int in_mem) | |
1008 { | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1009 rtx asmop = extract_asm_operands (x); |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1010 if (asmop) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1011 mark_jump_label_asm (asmop, insn); |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1012 else |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1013 mark_jump_label_1 (x, insn, in_mem != 0, |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1014 (insn != NULL && x == PATTERN (insn) && JUMP_P (insn))); |
0 | 1015 } |
1016 | |
1017 /* Worker function for mark_jump_label. IN_MEM is TRUE when X occurs | |
1018 within a (MEM ...). IS_TARGET is TRUE when X is to be treated as a | |
1019 jump-target; when the JUMP_LABEL field of INSN should be set or a | |
1020 REG_LABEL_TARGET note should be added, not a REG_LABEL_OPERAND | |
1021 note. */ | |
1022 | |
1023 static void | |
1024 mark_jump_label_1 (rtx x, rtx insn, bool in_mem, bool is_target) | |
1025 { | |
1026 RTX_CODE code = GET_CODE (x); | |
1027 int i; | |
1028 const char *fmt; | |
1029 | |
1030 switch (code) | |
1031 { | |
1032 case PC: | |
1033 case CC0: | |
1034 case REG: | |
1035 case CONST_INT: | |
1036 case CONST_DOUBLE: | |
1037 case CLOBBER: | |
1038 case CALL: | |
1039 return; | |
1040 | |
1041 case MEM: | |
1042 in_mem = true; | |
1043 break; | |
1044 | |
1045 case SEQUENCE: | |
1046 for (i = 0; i < XVECLEN (x, 0); i++) | |
1047 mark_jump_label (PATTERN (XVECEXP (x, 0, i)), | |
1048 XVECEXP (x, 0, i), 0); | |
1049 return; | |
1050 | |
1051 case SYMBOL_REF: | |
1052 if (!in_mem) | |
1053 return; | |
1054 | |
1055 /* If this is a constant-pool reference, see if it is a label. */ | |
1056 if (CONSTANT_POOL_ADDRESS_P (x)) | |
1057 mark_jump_label_1 (get_pool_constant (x), insn, in_mem, is_target); | |
1058 break; | |
1059 | |
1060 /* Handle operands in the condition of an if-then-else as for a | |
1061 non-jump insn. */ | |
1062 case IF_THEN_ELSE: | |
1063 if (!is_target) | |
1064 break; | |
1065 mark_jump_label_1 (XEXP (x, 0), insn, in_mem, false); | |
1066 mark_jump_label_1 (XEXP (x, 1), insn, in_mem, true); | |
1067 mark_jump_label_1 (XEXP (x, 2), insn, in_mem, true); | |
1068 return; | |
1069 | |
1070 case LABEL_REF: | |
1071 { | |
1072 rtx label = XEXP (x, 0); | |
1073 | |
1074 /* Ignore remaining references to unreachable labels that | |
1075 have been deleted. */ | |
1076 if (NOTE_P (label) | |
1077 && NOTE_KIND (label) == NOTE_INSN_DELETED_LABEL) | |
1078 break; | |
1079 | |
1080 gcc_assert (LABEL_P (label)); | |
1081 | |
1082 /* Ignore references to labels of containing functions. */ | |
1083 if (LABEL_REF_NONLOCAL_P (x)) | |
1084 break; | |
1085 | |
1086 XEXP (x, 0) = label; | |
1087 if (! insn || ! INSN_DELETED_P (insn)) | |
1088 ++LABEL_NUSES (label); | |
1089 | |
1090 if (insn) | |
1091 { | |
1092 if (is_target | |
1093 /* Do not change a previous setting of JUMP_LABEL. If the | |
1094 JUMP_LABEL slot is occupied by a different label, | |
1095 create a note for this label. */ | |
1096 && (JUMP_LABEL (insn) == NULL || JUMP_LABEL (insn) == label)) | |
1097 JUMP_LABEL (insn) = label; | |
1098 else | |
1099 { | |
1100 enum reg_note kind | |
1101 = is_target ? REG_LABEL_TARGET : REG_LABEL_OPERAND; | |
1102 | |
1103 /* Add a REG_LABEL_OPERAND or REG_LABEL_TARGET note | |
1104 for LABEL unless there already is one. All uses of | |
1105 a label, except for the primary target of a jump, | |
1106 must have such a note. */ | |
1107 if (! find_reg_note (insn, kind, label)) | |
1108 add_reg_note (insn, kind, label); | |
1109 } | |
1110 } | |
1111 return; | |
1112 } | |
1113 | |
1114 /* Do walk the labels in a vector, but not the first operand of an | |
1115 ADDR_DIFF_VEC. Don't set the JUMP_LABEL of a vector. */ | |
1116 case ADDR_VEC: | |
1117 case ADDR_DIFF_VEC: | |
1118 if (! INSN_DELETED_P (insn)) | |
1119 { | |
1120 int eltnum = code == ADDR_DIFF_VEC ? 1 : 0; | |
1121 | |
1122 for (i = 0; i < XVECLEN (x, eltnum); i++) | |
1123 mark_jump_label_1 (XVECEXP (x, eltnum, i), NULL_RTX, in_mem, | |
1124 is_target); | |
1125 } | |
1126 return; | |
1127 | |
1128 default: | |
1129 break; | |
1130 } | |
1131 | |
1132 fmt = GET_RTX_FORMAT (code); | |
1133 | |
1134 /* The primary target of a tablejump is the label of the ADDR_VEC, | |
1135 which is canonically mentioned *last* in the insn. To get it | |
1136 marked as JUMP_LABEL, we iterate over items in reverse order. */ | |
1137 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
1138 { | |
1139 if (fmt[i] == 'e') | |
1140 mark_jump_label_1 (XEXP (x, i), insn, in_mem, is_target); | |
1141 else if (fmt[i] == 'E') | |
1142 { | |
1143 int j; | |
1144 | |
1145 for (j = XVECLEN (x, i) - 1; j >= 0; j--) | |
1146 mark_jump_label_1 (XVECEXP (x, i, j), insn, in_mem, | |
1147 is_target); | |
1148 } | |
1149 } | |
1150 } | |
1151 | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1152 /* Worker function for mark_jump_label. Handle asm insns specially. |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1153 In particular, output operands need not be considered so we can |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1154 avoid re-scanning the replicated asm_operand. Also, the asm_labels |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1155 need to be considered targets. */ |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1156 |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1157 static void |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1158 mark_jump_label_asm (rtx asmop, rtx insn) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1159 { |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1160 int i; |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1161 |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1162 for (i = ASM_OPERANDS_INPUT_LENGTH (asmop) - 1; i >= 0; --i) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1163 mark_jump_label_1 (ASM_OPERANDS_INPUT (asmop, i), insn, false, false); |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1164 |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1165 for (i = ASM_OPERANDS_LABEL_LENGTH (asmop) - 1; i >= 0; --i) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1166 mark_jump_label_1 (ASM_OPERANDS_LABEL (asmop, i), insn, false, true); |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1167 } |
0 | 1168 |
1169 /* Delete insn INSN from the chain of insns and update label ref counts | |
1170 and delete insns now unreachable. | |
1171 | |
1172 Returns the first insn after INSN that was not deleted. | |
1173 | |
1174 Usage of this instruction is deprecated. Use delete_insn instead and | |
1175 subsequent cfg_cleanup pass to delete unreachable code if needed. */ | |
1176 | |
1177 rtx | |
1178 delete_related_insns (rtx insn) | |
1179 { | |
1180 int was_code_label = (LABEL_P (insn)); | |
1181 rtx note; | |
1182 rtx next = NEXT_INSN (insn), prev = PREV_INSN (insn); | |
1183 | |
1184 while (next && INSN_DELETED_P (next)) | |
1185 next = NEXT_INSN (next); | |
1186 | |
1187 /* This insn is already deleted => return first following nondeleted. */ | |
1188 if (INSN_DELETED_P (insn)) | |
1189 return next; | |
1190 | |
1191 delete_insn (insn); | |
1192 | |
1193 /* If instruction is followed by a barrier, | |
1194 delete the barrier too. */ | |
1195 | |
1196 if (next != 0 && BARRIER_P (next)) | |
1197 delete_insn (next); | |
1198 | |
1199 /* If deleting a jump, decrement the count of the label, | |
1200 and delete the label if it is now unused. */ | |
1201 | |
1202 if (JUMP_P (insn) && JUMP_LABEL (insn)) | |
1203 { | |
1204 rtx lab = JUMP_LABEL (insn), lab_next; | |
1205 | |
1206 if (LABEL_NUSES (lab) == 0) | |
1207 /* This can delete NEXT or PREV, | |
1208 either directly if NEXT is JUMP_LABEL (INSN), | |
1209 or indirectly through more levels of jumps. */ | |
1210 delete_related_insns (lab); | |
1211 else if (tablejump_p (insn, NULL, &lab_next)) | |
1212 { | |
1213 /* If we're deleting the tablejump, delete the dispatch table. | |
1214 We may not be able to kill the label immediately preceding | |
1215 just yet, as it might be referenced in code leading up to | |
1216 the tablejump. */ | |
1217 delete_related_insns (lab_next); | |
1218 } | |
1219 } | |
1220 | |
1221 /* Likewise if we're deleting a dispatch table. */ | |
1222 | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1223 if (JUMP_TABLE_DATA_P (insn)) |
0 | 1224 { |
1225 rtx pat = PATTERN (insn); | |
1226 int i, diff_vec_p = GET_CODE (pat) == ADDR_DIFF_VEC; | |
1227 int len = XVECLEN (pat, diff_vec_p); | |
1228 | |
1229 for (i = 0; i < len; i++) | |
1230 if (LABEL_NUSES (XEXP (XVECEXP (pat, diff_vec_p, i), 0)) == 0) | |
1231 delete_related_insns (XEXP (XVECEXP (pat, diff_vec_p, i), 0)); | |
1232 while (next && INSN_DELETED_P (next)) | |
1233 next = NEXT_INSN (next); | |
1234 return next; | |
1235 } | |
1236 | |
1237 /* Likewise for any JUMP_P / INSN / CALL_INSN with a | |
1238 REG_LABEL_OPERAND or REG_LABEL_TARGET note. */ | |
1239 if (INSN_P (insn)) | |
1240 for (note = REG_NOTES (insn); note; note = XEXP (note, 1)) | |
1241 if ((REG_NOTE_KIND (note) == REG_LABEL_OPERAND | |
1242 || REG_NOTE_KIND (note) == REG_LABEL_TARGET) | |
1243 /* This could also be a NOTE_INSN_DELETED_LABEL note. */ | |
1244 && LABEL_P (XEXP (note, 0))) | |
1245 if (LABEL_NUSES (XEXP (note, 0)) == 0) | |
1246 delete_related_insns (XEXP (note, 0)); | |
1247 | |
1248 while (prev && (INSN_DELETED_P (prev) || NOTE_P (prev))) | |
1249 prev = PREV_INSN (prev); | |
1250 | |
1251 /* If INSN was a label and a dispatch table follows it, | |
1252 delete the dispatch table. The tablejump must have gone already. | |
1253 It isn't useful to fall through into a table. */ | |
1254 | |
1255 if (was_code_label | |
1256 && NEXT_INSN (insn) != 0 | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1257 && JUMP_TABLE_DATA_P (NEXT_INSN (insn))) |
0 | 1258 next = delete_related_insns (NEXT_INSN (insn)); |
1259 | |
1260 /* If INSN was a label, delete insns following it if now unreachable. */ | |
1261 | |
1262 if (was_code_label && prev && BARRIER_P (prev)) | |
1263 { | |
1264 enum rtx_code code; | |
1265 while (next) | |
1266 { | |
1267 code = GET_CODE (next); | |
1268 if (code == NOTE) | |
1269 next = NEXT_INSN (next); | |
1270 /* Keep going past other deleted labels to delete what follows. */ | |
1271 else if (code == CODE_LABEL && INSN_DELETED_P (next)) | |
1272 next = NEXT_INSN (next); | |
1273 else if (code == BARRIER || INSN_P (next)) | |
1274 /* Note: if this deletes a jump, it can cause more | |
1275 deletion of unreachable code, after a different label. | |
1276 As long as the value from this recursive call is correct, | |
1277 this invocation functions correctly. */ | |
1278 next = delete_related_insns (next); | |
1279 else | |
1280 break; | |
1281 } | |
1282 } | |
1283 | |
1284 /* I feel a little doubtful about this loop, | |
1285 but I see no clean and sure alternative way | |
1286 to find the first insn after INSN that is not now deleted. | |
1287 I hope this works. */ | |
1288 while (next && INSN_DELETED_P (next)) | |
1289 next = NEXT_INSN (next); | |
1290 return next; | |
1291 } | |
1292 | |
1293 /* Delete a range of insns from FROM to TO, inclusive. | |
1294 This is for the sake of peephole optimization, so assume | |
1295 that whatever these insns do will still be done by a new | |
1296 peephole insn that will replace them. */ | |
1297 | |
1298 void | |
1299 delete_for_peephole (rtx from, rtx to) | |
1300 { | |
1301 rtx insn = from; | |
1302 | |
1303 while (1) | |
1304 { | |
1305 rtx next = NEXT_INSN (insn); | |
1306 rtx prev = PREV_INSN (insn); | |
1307 | |
1308 if (!NOTE_P (insn)) | |
1309 { | |
1310 INSN_DELETED_P (insn) = 1; | |
1311 | |
1312 /* Patch this insn out of the chain. */ | |
1313 /* We don't do this all at once, because we | |
1314 must preserve all NOTEs. */ | |
1315 if (prev) | |
1316 NEXT_INSN (prev) = next; | |
1317 | |
1318 if (next) | |
1319 PREV_INSN (next) = prev; | |
1320 } | |
1321 | |
1322 if (insn == to) | |
1323 break; | |
1324 insn = next; | |
1325 } | |
1326 | |
1327 /* Note that if TO is an unconditional jump | |
1328 we *do not* delete the BARRIER that follows, | |
1329 since the peephole that replaces this sequence | |
1330 is also an unconditional jump in that case. */ | |
1331 } | |
1332 | |
1333 /* Throughout LOC, redirect OLABEL to NLABEL. Treat null OLABEL or | |
1334 NLABEL as a return. Accrue modifications into the change group. */ | |
1335 | |
1336 static void | |
1337 redirect_exp_1 (rtx *loc, rtx olabel, rtx nlabel, rtx insn) | |
1338 { | |
1339 rtx x = *loc; | |
1340 RTX_CODE code = GET_CODE (x); | |
1341 int i; | |
1342 const char *fmt; | |
1343 | |
1344 if (code == LABEL_REF) | |
1345 { | |
1346 if (XEXP (x, 0) == olabel) | |
1347 { | |
1348 rtx n; | |
1349 if (nlabel) | |
1350 n = gen_rtx_LABEL_REF (Pmode, nlabel); | |
1351 else | |
1352 n = gen_rtx_RETURN (VOIDmode); | |
1353 | |
1354 validate_change (insn, loc, n, 1); | |
1355 return; | |
1356 } | |
1357 } | |
1358 else if (code == RETURN && olabel == 0) | |
1359 { | |
1360 if (nlabel) | |
1361 x = gen_rtx_LABEL_REF (Pmode, nlabel); | |
1362 else | |
1363 x = gen_rtx_RETURN (VOIDmode); | |
1364 if (loc == &PATTERN (insn)) | |
1365 x = gen_rtx_SET (VOIDmode, pc_rtx, x); | |
1366 validate_change (insn, loc, x, 1); | |
1367 return; | |
1368 } | |
1369 | |
1370 if (code == SET && nlabel == 0 && SET_DEST (x) == pc_rtx | |
1371 && GET_CODE (SET_SRC (x)) == LABEL_REF | |
1372 && XEXP (SET_SRC (x), 0) == olabel) | |
1373 { | |
1374 validate_change (insn, loc, gen_rtx_RETURN (VOIDmode), 1); | |
1375 return; | |
1376 } | |
1377 | |
1378 if (code == IF_THEN_ELSE) | |
1379 { | |
1380 /* Skip the condition of an IF_THEN_ELSE. We only want to | |
1381 change jump destinations, not eventual label comparisons. */ | |
1382 redirect_exp_1 (&XEXP (x, 1), olabel, nlabel, insn); | |
1383 redirect_exp_1 (&XEXP (x, 2), olabel, nlabel, insn); | |
1384 return; | |
1385 } | |
1386 | |
1387 fmt = GET_RTX_FORMAT (code); | |
1388 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
1389 { | |
1390 if (fmt[i] == 'e') | |
1391 redirect_exp_1 (&XEXP (x, i), olabel, nlabel, insn); | |
1392 else if (fmt[i] == 'E') | |
1393 { | |
1394 int j; | |
1395 for (j = 0; j < XVECLEN (x, i); j++) | |
1396 redirect_exp_1 (&XVECEXP (x, i, j), olabel, nlabel, insn); | |
1397 } | |
1398 } | |
1399 } | |
1400 | |
1401 /* Make JUMP go to NLABEL instead of where it jumps now. Accrue | |
1402 the modifications into the change group. Return false if we did | |
1403 not see how to do that. */ | |
1404 | |
1405 int | |
1406 redirect_jump_1 (rtx jump, rtx nlabel) | |
1407 { | |
1408 int ochanges = num_validated_changes (); | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1409 rtx *loc, asmop; |
0 | 1410 |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1411 asmop = extract_asm_operands (PATTERN (jump)); |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1412 if (asmop) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1413 { |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1414 if (nlabel == NULL) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1415 return 0; |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1416 gcc_assert (ASM_OPERANDS_LABEL_LENGTH (asmop) == 1); |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1417 loc = &ASM_OPERANDS_LABEL (asmop, 0); |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1418 } |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1419 else if (GET_CODE (PATTERN (jump)) == PARALLEL) |
0 | 1420 loc = &XVECEXP (PATTERN (jump), 0, 0); |
1421 else | |
1422 loc = &PATTERN (jump); | |
1423 | |
1424 redirect_exp_1 (loc, JUMP_LABEL (jump), nlabel, jump); | |
1425 return num_validated_changes () > ochanges; | |
1426 } | |
1427 | |
1428 /* Make JUMP go to NLABEL instead of where it jumps now. If the old | |
1429 jump target label is unused as a result, it and the code following | |
1430 it may be deleted. | |
1431 | |
1432 If NLABEL is zero, we are to turn the jump into a (possibly conditional) | |
1433 RETURN insn. | |
1434 | |
1435 The return value will be 1 if the change was made, 0 if it wasn't | |
1436 (this can only occur for NLABEL == 0). */ | |
1437 | |
1438 int | |
1439 redirect_jump (rtx jump, rtx nlabel, int delete_unused) | |
1440 { | |
1441 rtx olabel = JUMP_LABEL (jump); | |
1442 | |
1443 if (nlabel == olabel) | |
1444 return 1; | |
1445 | |
1446 if (! redirect_jump_1 (jump, nlabel) || ! apply_change_group ()) | |
1447 return 0; | |
1448 | |
1449 redirect_jump_2 (jump, olabel, nlabel, delete_unused, 0); | |
1450 return 1; | |
1451 } | |
1452 | |
1453 /* Fix up JUMP_LABEL and label ref counts after OLABEL has been replaced with | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1454 NLABEL in JUMP. |
0 | 1455 If DELETE_UNUSED is positive, delete related insn to OLABEL if its ref |
1456 count has dropped to zero. */ | |
1457 void | |
1458 redirect_jump_2 (rtx jump, rtx olabel, rtx nlabel, int delete_unused, | |
1459 int invert) | |
1460 { | |
1461 rtx note; | |
1462 | |
1463 gcc_assert (JUMP_LABEL (jump) == olabel); | |
1464 | |
1465 /* Negative DELETE_UNUSED used to be used to signalize behavior on | |
1466 moving FUNCTION_END note. Just sanity check that no user still worry | |
1467 about this. */ | |
1468 gcc_assert (delete_unused >= 0); | |
1469 JUMP_LABEL (jump) = nlabel; | |
1470 if (nlabel) | |
1471 ++LABEL_NUSES (nlabel); | |
1472 | |
1473 /* Update labels in any REG_EQUAL note. */ | |
1474 if ((note = find_reg_note (jump, REG_EQUAL, NULL_RTX)) != NULL_RTX) | |
1475 { | |
1476 if (!nlabel || (invert && !invert_exp_1 (XEXP (note, 0), jump))) | |
1477 remove_note (jump, note); | |
1478 else | |
1479 { | |
1480 redirect_exp_1 (&XEXP (note, 0), olabel, nlabel, jump); | |
1481 confirm_change_group (); | |
1482 } | |
1483 } | |
1484 | |
1485 if (olabel && --LABEL_NUSES (olabel) == 0 && delete_unused > 0 | |
1486 /* Undefined labels will remain outside the insn stream. */ | |
1487 && INSN_UID (olabel)) | |
1488 delete_related_insns (olabel); | |
1489 if (invert) | |
1490 invert_br_probabilities (jump); | |
1491 } | |
1492 | |
1493 /* Invert the jump condition X contained in jump insn INSN. Accrue the | |
1494 modifications into the change group. Return nonzero for success. */ | |
1495 static int | |
1496 invert_exp_1 (rtx x, rtx insn) | |
1497 { | |
1498 RTX_CODE code = GET_CODE (x); | |
1499 | |
1500 if (code == IF_THEN_ELSE) | |
1501 { | |
1502 rtx comp = XEXP (x, 0); | |
1503 rtx tem; | |
1504 enum rtx_code reversed_code; | |
1505 | |
1506 /* We can do this in two ways: The preferable way, which can only | |
1507 be done if this is not an integer comparison, is to reverse | |
1508 the comparison code. Otherwise, swap the THEN-part and ELSE-part | |
1509 of the IF_THEN_ELSE. If we can't do either, fail. */ | |
1510 | |
1511 reversed_code = reversed_comparison_code (comp, insn); | |
1512 | |
1513 if (reversed_code != UNKNOWN) | |
1514 { | |
1515 validate_change (insn, &XEXP (x, 0), | |
1516 gen_rtx_fmt_ee (reversed_code, | |
1517 GET_MODE (comp), XEXP (comp, 0), | |
1518 XEXP (comp, 1)), | |
1519 1); | |
1520 return 1; | |
1521 } | |
1522 | |
1523 tem = XEXP (x, 1); | |
1524 validate_change (insn, &XEXP (x, 1), XEXP (x, 2), 1); | |
1525 validate_change (insn, &XEXP (x, 2), tem, 1); | |
1526 return 1; | |
1527 } | |
1528 else | |
1529 return 0; | |
1530 } | |
1531 | |
1532 /* Invert the condition of the jump JUMP, and make it jump to label | |
1533 NLABEL instead of where it jumps now. Accrue changes into the | |
1534 change group. Return false if we didn't see how to perform the | |
1535 inversion and redirection. */ | |
1536 | |
1537 int | |
1538 invert_jump_1 (rtx jump, rtx nlabel) | |
1539 { | |
1540 rtx x = pc_set (jump); | |
1541 int ochanges; | |
1542 int ok; | |
1543 | |
1544 ochanges = num_validated_changes (); | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1545 if (x == NULL) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1546 return 0; |
0 | 1547 ok = invert_exp_1 (SET_SRC (x), jump); |
1548 gcc_assert (ok); | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1549 |
0 | 1550 if (num_validated_changes () == ochanges) |
1551 return 0; | |
1552 | |
1553 /* redirect_jump_1 will fail of nlabel == olabel, and the current use is | |
1554 in Pmode, so checking this is not merely an optimization. */ | |
1555 return nlabel == JUMP_LABEL (jump) || redirect_jump_1 (jump, nlabel); | |
1556 } | |
1557 | |
1558 /* Invert the condition of the jump JUMP, and make it jump to label | |
1559 NLABEL instead of where it jumps now. Return true if successful. */ | |
1560 | |
1561 int | |
1562 invert_jump (rtx jump, rtx nlabel, int delete_unused) | |
1563 { | |
1564 rtx olabel = JUMP_LABEL (jump); | |
1565 | |
1566 if (invert_jump_1 (jump, nlabel) && apply_change_group ()) | |
1567 { | |
1568 redirect_jump_2 (jump, olabel, nlabel, delete_unused, 1); | |
1569 return 1; | |
1570 } | |
1571 cancel_changes (0); | |
1572 return 0; | |
1573 } | |
1574 | |
1575 | |
1576 /* Like rtx_equal_p except that it considers two REGs as equal | |
1577 if they renumber to the same value and considers two commutative | |
1578 operations to be the same if the order of the operands has been | |
1579 reversed. */ | |
1580 | |
1581 int | |
1582 rtx_renumbered_equal_p (const_rtx x, const_rtx y) | |
1583 { | |
1584 int i; | |
1585 const enum rtx_code code = GET_CODE (x); | |
1586 const char *fmt; | |
1587 | |
1588 if (x == y) | |
1589 return 1; | |
1590 | |
1591 if ((code == REG || (code == SUBREG && REG_P (SUBREG_REG (x)))) | |
1592 && (REG_P (y) || (GET_CODE (y) == SUBREG | |
1593 && REG_P (SUBREG_REG (y))))) | |
1594 { | |
1595 int reg_x = -1, reg_y = -1; | |
1596 int byte_x = 0, byte_y = 0; | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1597 struct subreg_info info; |
0 | 1598 |
1599 if (GET_MODE (x) != GET_MODE (y)) | |
1600 return 0; | |
1601 | |
1602 /* If we haven't done any renumbering, don't | |
1603 make any assumptions. */ | |
1604 if (reg_renumber == 0) | |
1605 return rtx_equal_p (x, y); | |
1606 | |
1607 if (code == SUBREG) | |
1608 { | |
1609 reg_x = REGNO (SUBREG_REG (x)); | |
1610 byte_x = SUBREG_BYTE (x); | |
1611 | |
1612 if (reg_renumber[reg_x] >= 0) | |
1613 { | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1614 subreg_get_info (reg_renumber[reg_x], |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1615 GET_MODE (SUBREG_REG (x)), byte_x, |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1616 GET_MODE (x), &info); |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1617 if (!info.representable_p) |
0 | 1618 return 0; |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1619 reg_x = info.offset; |
0 | 1620 byte_x = 0; |
1621 } | |
1622 } | |
1623 else | |
1624 { | |
1625 reg_x = REGNO (x); | |
1626 if (reg_renumber[reg_x] >= 0) | |
1627 reg_x = reg_renumber[reg_x]; | |
1628 } | |
1629 | |
1630 if (GET_CODE (y) == SUBREG) | |
1631 { | |
1632 reg_y = REGNO (SUBREG_REG (y)); | |
1633 byte_y = SUBREG_BYTE (y); | |
1634 | |
1635 if (reg_renumber[reg_y] >= 0) | |
1636 { | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1637 subreg_get_info (reg_renumber[reg_y], |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1638 GET_MODE (SUBREG_REG (y)), byte_y, |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1639 GET_MODE (y), &info); |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1640 if (!info.representable_p) |
0 | 1641 return 0; |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1642 reg_y = info.offset; |
0 | 1643 byte_y = 0; |
1644 } | |
1645 } | |
1646 else | |
1647 { | |
1648 reg_y = REGNO (y); | |
1649 if (reg_renumber[reg_y] >= 0) | |
1650 reg_y = reg_renumber[reg_y]; | |
1651 } | |
1652 | |
1653 return reg_x >= 0 && reg_x == reg_y && byte_x == byte_y; | |
1654 } | |
1655 | |
1656 /* Now we have disposed of all the cases | |
1657 in which different rtx codes can match. */ | |
1658 if (code != GET_CODE (y)) | |
1659 return 0; | |
1660 | |
1661 switch (code) | |
1662 { | |
1663 case PC: | |
1664 case CC0: | |
1665 case ADDR_VEC: | |
1666 case ADDR_DIFF_VEC: | |
1667 case CONST_INT: | |
1668 case CONST_DOUBLE: | |
1669 return 0; | |
1670 | |
1671 case LABEL_REF: | |
1672 /* We can't assume nonlocal labels have their following insns yet. */ | |
1673 if (LABEL_REF_NONLOCAL_P (x) || LABEL_REF_NONLOCAL_P (y)) | |
1674 return XEXP (x, 0) == XEXP (y, 0); | |
1675 | |
1676 /* Two label-refs are equivalent if they point at labels | |
1677 in the same position in the instruction stream. */ | |
1678 return (next_real_insn (XEXP (x, 0)) | |
1679 == next_real_insn (XEXP (y, 0))); | |
1680 | |
1681 case SYMBOL_REF: | |
1682 return XSTR (x, 0) == XSTR (y, 0); | |
1683 | |
1684 case CODE_LABEL: | |
1685 /* If we didn't match EQ equality above, they aren't the same. */ | |
1686 return 0; | |
1687 | |
1688 default: | |
1689 break; | |
1690 } | |
1691 | |
1692 /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent. */ | |
1693 | |
1694 if (GET_MODE (x) != GET_MODE (y)) | |
1695 return 0; | |
1696 | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1697 /* MEMs refering to different address space are not equivalent. */ |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1698 if (code == MEM && MEM_ADDR_SPACE (x) != MEM_ADDR_SPACE (y)) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1699 return 0; |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1700 |
0 | 1701 /* For commutative operations, the RTX match if the operand match in any |
1702 order. Also handle the simple binary and unary cases without a loop. */ | |
1703 if (targetm.commutative_p (x, UNKNOWN)) | |
1704 return ((rtx_renumbered_equal_p (XEXP (x, 0), XEXP (y, 0)) | |
1705 && rtx_renumbered_equal_p (XEXP (x, 1), XEXP (y, 1))) | |
1706 || (rtx_renumbered_equal_p (XEXP (x, 0), XEXP (y, 1)) | |
1707 && rtx_renumbered_equal_p (XEXP (x, 1), XEXP (y, 0)))); | |
1708 else if (NON_COMMUTATIVE_P (x)) | |
1709 return (rtx_renumbered_equal_p (XEXP (x, 0), XEXP (y, 0)) | |
1710 && rtx_renumbered_equal_p (XEXP (x, 1), XEXP (y, 1))); | |
1711 else if (UNARY_P (x)) | |
1712 return rtx_renumbered_equal_p (XEXP (x, 0), XEXP (y, 0)); | |
1713 | |
1714 /* Compare the elements. If any pair of corresponding elements | |
1715 fail to match, return 0 for the whole things. */ | |
1716 | |
1717 fmt = GET_RTX_FORMAT (code); | |
1718 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
1719 { | |
1720 int j; | |
1721 switch (fmt[i]) | |
1722 { | |
1723 case 'w': | |
1724 if (XWINT (x, i) != XWINT (y, i)) | |
1725 return 0; | |
1726 break; | |
1727 | |
1728 case 'i': | |
1729 if (XINT (x, i) != XINT (y, i)) | |
1730 return 0; | |
1731 break; | |
1732 | |
1733 case 't': | |
1734 if (XTREE (x, i) != XTREE (y, i)) | |
1735 return 0; | |
1736 break; | |
1737 | |
1738 case 's': | |
1739 if (strcmp (XSTR (x, i), XSTR (y, i))) | |
1740 return 0; | |
1741 break; | |
1742 | |
1743 case 'e': | |
1744 if (! rtx_renumbered_equal_p (XEXP (x, i), XEXP (y, i))) | |
1745 return 0; | |
1746 break; | |
1747 | |
1748 case 'u': | |
1749 if (XEXP (x, i) != XEXP (y, i)) | |
1750 return 0; | |
1751 /* Fall through. */ | |
1752 case '0': | |
1753 break; | |
1754 | |
1755 case 'E': | |
1756 if (XVECLEN (x, i) != XVECLEN (y, i)) | |
1757 return 0; | |
1758 for (j = XVECLEN (x, i) - 1; j >= 0; j--) | |
1759 if (!rtx_renumbered_equal_p (XVECEXP (x, i, j), XVECEXP (y, i, j))) | |
1760 return 0; | |
1761 break; | |
1762 | |
1763 default: | |
1764 gcc_unreachable (); | |
1765 } | |
1766 } | |
1767 return 1; | |
1768 } | |
1769 | |
1770 /* If X is a hard register or equivalent to one or a subregister of one, | |
1771 return the hard register number. If X is a pseudo register that was not | |
1772 assigned a hard register, return the pseudo register number. Otherwise, | |
1773 return -1. Any rtx is valid for X. */ | |
1774 | |
1775 int | |
1776 true_regnum (const_rtx x) | |
1777 { | |
1778 if (REG_P (x)) | |
1779 { | |
1780 if (REGNO (x) >= FIRST_PSEUDO_REGISTER && reg_renumber[REGNO (x)] >= 0) | |
1781 return reg_renumber[REGNO (x)]; | |
1782 return REGNO (x); | |
1783 } | |
1784 if (GET_CODE (x) == SUBREG) | |
1785 { | |
1786 int base = true_regnum (SUBREG_REG (x)); | |
1787 if (base >= 0 | |
55
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1788 && base < FIRST_PSEUDO_REGISTER) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1789 { |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1790 struct subreg_info info; |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1791 |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1792 subreg_get_info (REGNO (SUBREG_REG (x)), |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1793 GET_MODE (SUBREG_REG (x)), |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1794 SUBREG_BYTE (x), GET_MODE (x), &info); |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1795 |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1796 if (info.representable_p) |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1797 return base + info.offset; |
77e2b8dfacca
update it from 4.4.3 to 4.5.0
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
0
diff
changeset
|
1798 } |
0 | 1799 } |
1800 return -1; | |
1801 } | |
1802 | |
1803 /* Return regno of the register REG and handle subregs too. */ | |
1804 unsigned int | |
1805 reg_or_subregno (const_rtx reg) | |
1806 { | |
1807 if (GET_CODE (reg) == SUBREG) | |
1808 reg = SUBREG_REG (reg); | |
1809 gcc_assert (REG_P (reg)); | |
1810 return REGNO (reg); | |
1811 } |