1 /* Conditional constant propagation pass for the GNU compiler.
2 Copyright (C) 2000-2022 Free Software Foundation, Inc.
3 Adapted from original RTL SSA-CCP by Daniel Berlin <dberlin@dberlin.org>
4 Adapted to GIMPLE trees by Diego Novillo <dnovillo@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by the
10 Free Software Foundation; either version 3, or (at your option) any
13 GCC is distributed in the hope that it will be useful, but WITHOUT
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
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/>. */
22 /* Conditional constant propagation (CCP) is based on the SSA
23 propagation engine (tree-ssa-propagate.cc). Constant assignments of
24 the form VAR = CST are propagated from the assignments into uses of
25 VAR, which in turn may generate new constants. The simulation uses
26 a four level lattice to keep track of constant values associated
27 with SSA names. Given an SSA name V_i, it may take one of the
30 UNINITIALIZED -> the initial state of the value. This value
31 is replaced with a correct initial value
32 the first time the value is used, so the
33 rest of the pass does not need to care about
34 it. Using this value simplifies initialization
35 of the pass, and prevents us from needlessly
36 scanning statements that are never reached.
38 UNDEFINED -> V_i is a local variable whose definition
39 has not been processed yet. Therefore we
40 don't yet know if its value is a constant
43 CONSTANT -> V_i has been found to hold a constant
46 VARYING -> V_i cannot take a constant value, or if it
47 does, it is not possible to determine it
50 The core of SSA-CCP is in ccp_visit_stmt and ccp_visit_phi_node:
52 1- In ccp_visit_stmt, we are interested in assignments whose RHS
53 evaluates into a constant and conditional jumps whose predicate
54 evaluates into a boolean true or false. When an assignment of
55 the form V_i = CONST is found, V_i's lattice value is set to
56 CONSTANT and CONST is associated with it. This causes the
57 propagation engine to add all the SSA edges coming out the
58 assignment into the worklists, so that statements that use V_i
61 If the statement is a conditional with a constant predicate, we
62 mark the outgoing edges as executable or not executable
63 depending on the predicate's value. This is then used when
64 visiting PHI nodes to know when a PHI argument can be ignored.
67 2- In ccp_visit_phi_node, if all the PHI arguments evaluate to the
68 same constant C, then the LHS of the PHI is set to C. This
69 evaluation is known as the "meet operation". Since one of the
70 goals of this evaluation is to optimistically return constant
71 values as often as possible, it uses two main short cuts:
73 - If an argument is flowing in through a non-executable edge, it
74 is ignored. This is useful in cases like this:
80 a_11 = PHI (a_9, a_10)
82 If PRED is known to always evaluate to false, then we can
83 assume that a_11 will always take its value from a_10, meaning
84 that instead of consider it VARYING (a_9 and a_10 have
85 different values), we can consider it CONSTANT 100.
87 - If an argument has an UNDEFINED value, then it does not affect
88 the outcome of the meet operation. If a variable V_i has an
89 UNDEFINED value, it means that either its defining statement
90 hasn't been visited yet or V_i has no defining statement, in
91 which case the original symbol 'V' is being used
92 uninitialized. Since 'V' is a local variable, the compiler
93 may assume any initial value for it.
96 After propagation, every variable V_i that ends up with a lattice
97 value of CONSTANT will have the associated constant value in the
98 array CONST_VAL[i].VALUE. That is fed into substitute_and_fold for
99 final substitution and folding.
101 This algorithm uses wide-ints at the max precision of the target.
102 This means that, with one uninteresting exception, variables with
103 UNSIGNED types never go to VARYING because the bits above the
104 precision of the type of the variable are always zero. The
105 uninteresting case is a variable of UNSIGNED type that has the
106 maximum precision of the target. Such variables can go to VARYING,
107 but this causes no loss of infomation since these variables will
112 Constant propagation with conditional branches,
113 Wegman and Zadeck, ACM TOPLAS 13(2):181-210.
115 Building an Optimizing Compiler,
116 Robert Morgan, Butterworth-Heinemann, 1998, Section 8.9.
118 Advanced Compiler Design and Implementation,
119 Steven Muchnick, Morgan Kaufmann, 1997, Section 12.6 */
123 #include "coretypes.h"
128 #include "tree-pass.h"
130 #include "gimple-pretty-print.h"
131 #include "fold-const.h"
132 #include "gimple-fold.h"
134 #include "gimplify.h"
135 #include "gimple-iterator.h"
136 #include "tree-cfg.h"
137 #include "tree-ssa-propagate.h"
139 #include "builtins.h"
141 #include "stor-layout.h"
142 #include "optabs-query.h"
143 #include "tree-ssa-ccp.h"
144 #include "tree-dfa.h"
145 #include "diagnostic-core.h"
146 #include "stringpool.h"
148 #include "tree-vector-builder.h"
150 #include "alloc-pool.h"
151 #include "symbol-summary.h"
152 #include "ipa-utils.h"
153 #include "ipa-prop.h"
154 #include "internal-fn.h"
156 /* Possible lattice values. */
165 class ccp_prop_value_t
{
168 ccp_lattice_t lattice_val
;
170 /* Propagated value. */
173 /* Mask that applies to the propagated value during CCP. For X
174 with a CONSTANT lattice value X & ~mask == value & ~mask. The
175 zero bits in the mask cover constant values. The ones mean no
180 class ccp_propagate
: public ssa_propagation_engine
183 enum ssa_prop_result
visit_stmt (gimple
*, edge
*, tree
*) FINAL OVERRIDE
;
184 enum ssa_prop_result
visit_phi (gphi
*) FINAL OVERRIDE
;
187 /* Array of propagated constant values. After propagation,
188 CONST_VAL[I].VALUE holds the constant value for SSA_NAME(I). If
189 the constant is held in an SSA name representing a memory store
190 (i.e., a VDEF), CONST_VAL[I].MEM_REF will contain the actual
191 memory reference used to store (i.e., the LHS of the assignment
193 static ccp_prop_value_t
*const_val
;
194 static unsigned n_const_val
;
196 static void canonicalize_value (ccp_prop_value_t
*);
197 static void ccp_lattice_meet (ccp_prop_value_t
*, ccp_prop_value_t
*);
199 /* Dump constant propagation value VAL to file OUTF prefixed by PREFIX. */
202 dump_lattice_value (FILE *outf
, const char *prefix
, ccp_prop_value_t val
)
204 switch (val
.lattice_val
)
207 fprintf (outf
, "%sUNINITIALIZED", prefix
);
210 fprintf (outf
, "%sUNDEFINED", prefix
);
213 fprintf (outf
, "%sVARYING", prefix
);
216 if (TREE_CODE (val
.value
) != INTEGER_CST
219 fprintf (outf
, "%sCONSTANT ", prefix
);
220 print_generic_expr (outf
, val
.value
, dump_flags
);
224 widest_int cval
= wi::bit_and_not (wi::to_widest (val
.value
),
226 fprintf (outf
, "%sCONSTANT ", prefix
);
227 print_hex (cval
, outf
);
228 fprintf (outf
, " (");
229 print_hex (val
.mask
, outf
);
239 /* Print lattice value VAL to stderr. */
241 void debug_lattice_value (ccp_prop_value_t val
);
244 debug_lattice_value (ccp_prop_value_t val
)
246 dump_lattice_value (stderr
, "", val
);
247 fprintf (stderr
, "\n");
250 /* Extend NONZERO_BITS to a full mask, based on sgn. */
253 extend_mask (const wide_int
&nonzero_bits
, signop sgn
)
255 return widest_int::from (nonzero_bits
, sgn
);
258 /* Compute a default value for variable VAR and store it in the
259 CONST_VAL array. The following rules are used to get default
262 1- Global and static variables that are declared constant are
265 2- Any other value is considered UNDEFINED. This is useful when
266 considering PHI nodes. PHI arguments that are undefined do not
267 change the constant value of the PHI node, which allows for more
268 constants to be propagated.
270 3- Variables defined by statements other than assignments and PHI
271 nodes are considered VARYING.
273 4- Initial values of variables that are not GIMPLE registers are
274 considered VARYING. */
276 static ccp_prop_value_t
277 get_default_value (tree var
)
279 ccp_prop_value_t val
= { UNINITIALIZED
, NULL_TREE
, 0 };
282 stmt
= SSA_NAME_DEF_STMT (var
);
284 if (gimple_nop_p (stmt
))
286 /* Variables defined by an empty statement are those used
287 before being initialized. If VAR is a local variable, we
288 can assume initially that it is UNDEFINED, otherwise we must
289 consider it VARYING. */
290 if (!virtual_operand_p (var
)
291 && SSA_NAME_VAR (var
)
292 && TREE_CODE (SSA_NAME_VAR (var
)) == VAR_DECL
)
293 val
.lattice_val
= UNDEFINED
;
296 val
.lattice_val
= VARYING
;
298 if (flag_tree_bit_ccp
)
300 wide_int nonzero_bits
= get_nonzero_bits (var
);
304 if (SSA_NAME_VAR (var
)
305 && TREE_CODE (SSA_NAME_VAR (var
)) == PARM_DECL
306 && ipcp_get_parm_bits (SSA_NAME_VAR (var
), &value
, &mask
))
308 val
.lattice_val
= CONSTANT
;
310 widest_int ipa_value
= wi::to_widest (value
);
311 /* Unknown bits from IPA CP must be equal to zero. */
312 gcc_assert (wi::bit_and (ipa_value
, mask
) == 0);
314 if (nonzero_bits
!= -1)
315 val
.mask
&= extend_mask (nonzero_bits
,
316 TYPE_SIGN (TREE_TYPE (var
)));
318 else if (nonzero_bits
!= -1)
320 val
.lattice_val
= CONSTANT
;
321 val
.value
= build_zero_cst (TREE_TYPE (var
));
322 val
.mask
= extend_mask (nonzero_bits
,
323 TYPE_SIGN (TREE_TYPE (var
)));
328 else if (is_gimple_assign (stmt
))
331 if (gimple_assign_single_p (stmt
)
332 && DECL_P (gimple_assign_rhs1 (stmt
))
333 && (cst
= get_symbol_constant_value (gimple_assign_rhs1 (stmt
))))
335 val
.lattice_val
= CONSTANT
;
340 /* Any other variable defined by an assignment is considered
342 val
.lattice_val
= UNDEFINED
;
345 else if ((is_gimple_call (stmt
)
346 && gimple_call_lhs (stmt
) != NULL_TREE
)
347 || gimple_code (stmt
) == GIMPLE_PHI
)
349 /* A variable defined by a call or a PHI node is considered
351 val
.lattice_val
= UNDEFINED
;
355 /* Otherwise, VAR will never take on a constant value. */
356 val
.lattice_val
= VARYING
;
364 /* Get the constant value associated with variable VAR. */
366 static inline ccp_prop_value_t
*
369 ccp_prop_value_t
*val
;
371 if (const_val
== NULL
372 || SSA_NAME_VERSION (var
) >= n_const_val
)
375 val
= &const_val
[SSA_NAME_VERSION (var
)];
376 if (val
->lattice_val
== UNINITIALIZED
)
377 *val
= get_default_value (var
);
379 canonicalize_value (val
);
384 /* Return the constant tree value associated with VAR. */
387 get_constant_value (tree var
)
389 ccp_prop_value_t
*val
;
390 if (TREE_CODE (var
) != SSA_NAME
)
392 if (is_gimple_min_invariant (var
))
396 val
= get_value (var
);
398 && val
->lattice_val
== CONSTANT
399 && (TREE_CODE (val
->value
) != INTEGER_CST
405 /* Sets the value associated with VAR to VARYING. */
408 set_value_varying (tree var
)
410 ccp_prop_value_t
*val
= &const_val
[SSA_NAME_VERSION (var
)];
412 val
->lattice_val
= VARYING
;
413 val
->value
= NULL_TREE
;
417 /* For integer constants, make sure to drop TREE_OVERFLOW. */
420 canonicalize_value (ccp_prop_value_t
*val
)
422 if (val
->lattice_val
!= CONSTANT
)
425 if (TREE_OVERFLOW_P (val
->value
))
426 val
->value
= drop_tree_overflow (val
->value
);
429 /* Return whether the lattice transition is valid. */
432 valid_lattice_transition (ccp_prop_value_t old_val
, ccp_prop_value_t new_val
)
434 /* Lattice transitions must always be monotonically increasing in
436 if (old_val
.lattice_val
< new_val
.lattice_val
)
439 if (old_val
.lattice_val
!= new_val
.lattice_val
)
442 if (!old_val
.value
&& !new_val
.value
)
445 /* Now both lattice values are CONSTANT. */
447 /* Allow arbitrary copy changes as we might look through PHI <a_1, ...>
448 when only a single copy edge is executable. */
449 if (TREE_CODE (old_val
.value
) == SSA_NAME
450 && TREE_CODE (new_val
.value
) == SSA_NAME
)
453 /* Allow transitioning from a constant to a copy. */
454 if (is_gimple_min_invariant (old_val
.value
)
455 && TREE_CODE (new_val
.value
) == SSA_NAME
)
458 /* Allow transitioning from PHI <&x, not executable> == &x
459 to PHI <&x, &y> == common alignment. */
460 if (TREE_CODE (old_val
.value
) != INTEGER_CST
461 && TREE_CODE (new_val
.value
) == INTEGER_CST
)
464 /* Bit-lattices have to agree in the still valid bits. */
465 if (TREE_CODE (old_val
.value
) == INTEGER_CST
466 && TREE_CODE (new_val
.value
) == INTEGER_CST
)
467 return (wi::bit_and_not (wi::to_widest (old_val
.value
), new_val
.mask
)
468 == wi::bit_and_not (wi::to_widest (new_val
.value
), new_val
.mask
));
470 /* Otherwise constant values have to agree. */
471 if (operand_equal_p (old_val
.value
, new_val
.value
, 0))
474 /* At least the kinds and types should agree now. */
475 if (TREE_CODE (old_val
.value
) != TREE_CODE (new_val
.value
)
476 || !types_compatible_p (TREE_TYPE (old_val
.value
),
477 TREE_TYPE (new_val
.value
)))
480 /* For floats and !HONOR_NANS allow transitions from (partial) NaN
482 tree type
= TREE_TYPE (new_val
.value
);
483 if (SCALAR_FLOAT_TYPE_P (type
)
484 && !HONOR_NANS (type
))
486 if (REAL_VALUE_ISNAN (TREE_REAL_CST (old_val
.value
)))
489 else if (VECTOR_FLOAT_TYPE_P (type
)
490 && !HONOR_NANS (type
))
493 = tree_vector_builder::binary_encoded_nelts (old_val
.value
,
495 for (unsigned int i
= 0; i
< count
; ++i
)
496 if (!REAL_VALUE_ISNAN
497 (TREE_REAL_CST (VECTOR_CST_ENCODED_ELT (old_val
.value
, i
)))
498 && !operand_equal_p (VECTOR_CST_ENCODED_ELT (old_val
.value
, i
),
499 VECTOR_CST_ENCODED_ELT (new_val
.value
, i
), 0))
503 else if (COMPLEX_FLOAT_TYPE_P (type
)
504 && !HONOR_NANS (type
))
506 if (!REAL_VALUE_ISNAN (TREE_REAL_CST (TREE_REALPART (old_val
.value
)))
507 && !operand_equal_p (TREE_REALPART (old_val
.value
),
508 TREE_REALPART (new_val
.value
), 0))
510 if (!REAL_VALUE_ISNAN (TREE_REAL_CST (TREE_IMAGPART (old_val
.value
)))
511 && !operand_equal_p (TREE_IMAGPART (old_val
.value
),
512 TREE_IMAGPART (new_val
.value
), 0))
519 /* Set the value for variable VAR to NEW_VAL. Return true if the new
520 value is different from VAR's previous value. */
523 set_lattice_value (tree var
, ccp_prop_value_t
*new_val
)
525 /* We can deal with old UNINITIALIZED values just fine here. */
526 ccp_prop_value_t
*old_val
= &const_val
[SSA_NAME_VERSION (var
)];
528 canonicalize_value (new_val
);
530 /* We have to be careful to not go up the bitwise lattice
531 represented by the mask. Instead of dropping to VARYING
532 use the meet operator to retain a conservative value.
533 Missed optimizations like PR65851 makes this necessary.
534 It also ensures we converge to a stable lattice solution. */
535 if (old_val
->lattice_val
!= UNINITIALIZED
)
536 ccp_lattice_meet (new_val
, old_val
);
538 gcc_checking_assert (valid_lattice_transition (*old_val
, *new_val
));
540 /* If *OLD_VAL and NEW_VAL are the same, return false to inform the
541 caller that this was a non-transition. */
542 if (old_val
->lattice_val
!= new_val
->lattice_val
543 || (new_val
->lattice_val
== CONSTANT
544 && (TREE_CODE (new_val
->value
) != TREE_CODE (old_val
->value
)
545 || (TREE_CODE (new_val
->value
) == INTEGER_CST
546 && (new_val
->mask
!= old_val
->mask
547 || (wi::bit_and_not (wi::to_widest (old_val
->value
),
549 != wi::bit_and_not (wi::to_widest (new_val
->value
),
551 || (TREE_CODE (new_val
->value
) != INTEGER_CST
552 && !operand_equal_p (new_val
->value
, old_val
->value
, 0)))))
554 /* ??? We would like to delay creation of INTEGER_CSTs from
555 partially constants here. */
557 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
559 dump_lattice_value (dump_file
, "Lattice value changed to ", *new_val
);
560 fprintf (dump_file
, ". Adding SSA edges to worklist.\n");
565 gcc_assert (new_val
->lattice_val
!= UNINITIALIZED
);
572 static ccp_prop_value_t
get_value_for_expr (tree
, bool);
573 static ccp_prop_value_t
bit_value_binop (enum tree_code
, tree
, tree
, tree
);
574 void bit_value_binop (enum tree_code
, signop
, int, widest_int
*, widest_int
*,
575 signop
, int, const widest_int
&, const widest_int
&,
576 signop
, int, const widest_int
&, const widest_int
&);
578 /* Return a widest_int that can be used for bitwise simplifications
582 value_to_wide_int (ccp_prop_value_t val
)
585 && TREE_CODE (val
.value
) == INTEGER_CST
)
586 return wi::to_widest (val
.value
);
591 /* Return the value for the address expression EXPR based on alignment
594 static ccp_prop_value_t
595 get_value_from_alignment (tree expr
)
597 tree type
= TREE_TYPE (expr
);
598 ccp_prop_value_t val
;
599 unsigned HOST_WIDE_INT bitpos
;
602 gcc_assert (TREE_CODE (expr
) == ADDR_EXPR
);
604 get_pointer_alignment_1 (expr
, &align
, &bitpos
);
605 val
.mask
= wi::bit_and_not
606 (POINTER_TYPE_P (type
) || TYPE_UNSIGNED (type
)
607 ? wi::mask
<widest_int
> (TYPE_PRECISION (type
), false)
609 align
/ BITS_PER_UNIT
- 1);
611 = wi::sext (val
.mask
, TYPE_PRECISION (type
)) == -1 ? VARYING
: CONSTANT
;
612 if (val
.lattice_val
== CONSTANT
)
613 val
.value
= build_int_cstu (type
, bitpos
/ BITS_PER_UNIT
);
615 val
.value
= NULL_TREE
;
620 /* Return the value for the tree operand EXPR. If FOR_BITS_P is true
621 return constant bits extracted from alignment information for
622 invariant addresses. */
624 static ccp_prop_value_t
625 get_value_for_expr (tree expr
, bool for_bits_p
)
627 ccp_prop_value_t val
;
629 if (TREE_CODE (expr
) == SSA_NAME
)
631 ccp_prop_value_t
*val_
= get_value (expr
);
636 val
.lattice_val
= VARYING
;
637 val
.value
= NULL_TREE
;
641 && val
.lattice_val
== CONSTANT
)
643 if (TREE_CODE (val
.value
) == ADDR_EXPR
)
644 val
= get_value_from_alignment (val
.value
);
645 else if (TREE_CODE (val
.value
) != INTEGER_CST
)
647 val
.lattice_val
= VARYING
;
648 val
.value
= NULL_TREE
;
652 /* Fall back to a copy value. */
654 && val
.lattice_val
== VARYING
655 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (expr
))
657 val
.lattice_val
= CONSTANT
;
662 else if (is_gimple_min_invariant (expr
)
663 && (!for_bits_p
|| TREE_CODE (expr
) == INTEGER_CST
))
665 val
.lattice_val
= CONSTANT
;
668 canonicalize_value (&val
);
670 else if (TREE_CODE (expr
) == ADDR_EXPR
)
671 val
= get_value_from_alignment (expr
);
674 val
.lattice_val
= VARYING
;
676 val
.value
= NULL_TREE
;
679 if (val
.lattice_val
== VARYING
680 && TYPE_UNSIGNED (TREE_TYPE (expr
)))
681 val
.mask
= wi::zext (val
.mask
, TYPE_PRECISION (TREE_TYPE (expr
)));
686 /* Return the likely CCP lattice value for STMT.
688 If STMT has no operands, then return CONSTANT.
690 Else if undefinedness of operands of STMT cause its value to be
691 undefined, then return UNDEFINED.
693 Else if any operands of STMT are constants, then return CONSTANT.
695 Else return VARYING. */
698 likely_value (gimple
*stmt
)
700 bool has_constant_operand
, has_undefined_operand
, all_undefined_operands
;
701 bool has_nsa_operand
;
706 enum gimple_code code
= gimple_code (stmt
);
708 /* This function appears to be called only for assignments, calls,
709 conditionals, and switches, due to the logic in visit_stmt. */
710 gcc_assert (code
== GIMPLE_ASSIGN
711 || code
== GIMPLE_CALL
712 || code
== GIMPLE_COND
713 || code
== GIMPLE_SWITCH
);
715 /* If the statement has volatile operands, it won't fold to a
717 if (gimple_has_volatile_ops (stmt
))
720 /* Arrive here for more complex cases. */
721 has_constant_operand
= false;
722 has_undefined_operand
= false;
723 all_undefined_operands
= true;
724 has_nsa_operand
= false;
725 FOR_EACH_SSA_TREE_OPERAND (use
, stmt
, iter
, SSA_OP_USE
)
727 ccp_prop_value_t
*val
= get_value (use
);
729 if (val
&& val
->lattice_val
== UNDEFINED
)
730 has_undefined_operand
= true;
732 all_undefined_operands
= false;
734 if (val
&& val
->lattice_val
== CONSTANT
)
735 has_constant_operand
= true;
737 if (SSA_NAME_IS_DEFAULT_DEF (use
)
738 || !prop_simulate_again_p (SSA_NAME_DEF_STMT (use
)))
739 has_nsa_operand
= true;
742 /* There may be constants in regular rhs operands. For calls we
743 have to ignore lhs, fndecl and static chain, otherwise only
745 for (i
= (is_gimple_call (stmt
) ? 2 : 0) + gimple_has_lhs (stmt
);
746 i
< gimple_num_ops (stmt
); ++i
)
748 tree op
= gimple_op (stmt
, i
);
749 if (!op
|| TREE_CODE (op
) == SSA_NAME
)
751 if (is_gimple_min_invariant (op
))
752 has_constant_operand
= true;
755 if (has_constant_operand
)
756 all_undefined_operands
= false;
758 if (has_undefined_operand
759 && code
== GIMPLE_CALL
760 && gimple_call_internal_p (stmt
))
761 switch (gimple_call_internal_fn (stmt
))
763 /* These 3 builtins use the first argument just as a magic
764 way how to find out a decl uid. */
765 case IFN_GOMP_SIMD_LANE
:
766 case IFN_GOMP_SIMD_VF
:
767 case IFN_GOMP_SIMD_LAST_LANE
:
768 has_undefined_operand
= false;
774 /* If the operation combines operands like COMPLEX_EXPR make sure to
775 not mark the result UNDEFINED if only one part of the result is
777 if (has_undefined_operand
&& all_undefined_operands
)
779 else if (code
== GIMPLE_ASSIGN
&& has_undefined_operand
)
781 switch (gimple_assign_rhs_code (stmt
))
783 /* Unary operators are handled with all_undefined_operands. */
786 case POINTER_PLUS_EXPR
:
788 /* Not MIN_EXPR, MAX_EXPR. One VARYING operand may be selected.
789 Not bitwise operators, one VARYING operand may specify the
791 Not logical operators for the same reason, apart from XOR.
792 Not COMPLEX_EXPR as one VARYING operand makes the result partly
793 not UNDEFINED. Not *DIV_EXPR, comparisons and shifts because
794 the undefined operand may be promoted. */
798 /* If any part of an address is UNDEFINED, like the index
799 of an ARRAY_EXPR, then treat the result as UNDEFINED. */
806 /* If there was an UNDEFINED operand but the result may be not UNDEFINED
807 fall back to CONSTANT. During iteration UNDEFINED may still drop
809 if (has_undefined_operand
)
812 /* We do not consider virtual operands here -- load from read-only
813 memory may have only VARYING virtual operands, but still be
814 constant. Also we can combine the stmt with definitions from
815 operands whose definitions are not simulated again. */
816 if (has_constant_operand
818 || gimple_references_memory_p (stmt
))
824 /* Returns true if STMT cannot be constant. */
827 surely_varying_stmt_p (gimple
*stmt
)
829 /* If the statement has operands that we cannot handle, it cannot be
831 if (gimple_has_volatile_ops (stmt
))
834 /* If it is a call and does not return a value or is not a
835 builtin and not an indirect call or a call to function with
836 assume_aligned/alloc_align attribute, it is varying. */
837 if (is_gimple_call (stmt
))
839 tree fndecl
, fntype
= gimple_call_fntype (stmt
);
840 if (!gimple_call_lhs (stmt
)
841 || ((fndecl
= gimple_call_fndecl (stmt
)) != NULL_TREE
842 && !fndecl_built_in_p (fndecl
)
843 && !lookup_attribute ("assume_aligned",
844 TYPE_ATTRIBUTES (fntype
))
845 && !lookup_attribute ("alloc_align",
846 TYPE_ATTRIBUTES (fntype
))))
850 /* Any other store operation is not interesting. */
851 else if (gimple_vdef (stmt
))
854 /* Anything other than assignments and conditional jumps are not
855 interesting for CCP. */
856 if (gimple_code (stmt
) != GIMPLE_ASSIGN
857 && gimple_code (stmt
) != GIMPLE_COND
858 && gimple_code (stmt
) != GIMPLE_SWITCH
859 && gimple_code (stmt
) != GIMPLE_CALL
)
865 /* Initialize local data structures for CCP. */
868 ccp_initialize (void)
872 n_const_val
= num_ssa_names
;
873 const_val
= XCNEWVEC (ccp_prop_value_t
, n_const_val
);
875 /* Initialize simulation flags for PHI nodes and statements. */
876 FOR_EACH_BB_FN (bb
, cfun
)
878 gimple_stmt_iterator i
;
880 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
882 gimple
*stmt
= gsi_stmt (i
);
885 /* If the statement is a control insn, then we do not
886 want to avoid simulating the statement once. Failure
887 to do so means that those edges will never get added. */
888 if (stmt_ends_bb_p (stmt
))
891 is_varying
= surely_varying_stmt_p (stmt
);
898 /* If the statement will not produce a constant, mark
899 all its outputs VARYING. */
900 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, iter
, SSA_OP_ALL_DEFS
)
901 set_value_varying (def
);
903 prop_set_simulate_again (stmt
, !is_varying
);
907 /* Now process PHI nodes. We never clear the simulate_again flag on
908 phi nodes, since we do not know which edges are executable yet,
909 except for phi nodes for virtual operands when we do not do store ccp. */
910 FOR_EACH_BB_FN (bb
, cfun
)
914 for (i
= gsi_start_phis (bb
); !gsi_end_p (i
); gsi_next (&i
))
916 gphi
*phi
= i
.phi ();
918 if (virtual_operand_p (gimple_phi_result (phi
)))
919 prop_set_simulate_again (phi
, false);
921 prop_set_simulate_again (phi
, true);
926 /* Debug count support. Reset the values of ssa names
927 VARYING when the total number ssa names analyzed is
928 beyond the debug count specified. */
934 for (i
= 0; i
< num_ssa_names
; i
++)
938 const_val
[i
].lattice_val
= VARYING
;
939 const_val
[i
].mask
= -1;
940 const_val
[i
].value
= NULL_TREE
;
946 /* We want to provide our own GET_VALUE and FOLD_STMT virtual methods. */
947 class ccp_folder
: public substitute_and_fold_engine
950 tree
value_of_expr (tree
, gimple
*) FINAL OVERRIDE
;
951 bool fold_stmt (gimple_stmt_iterator
*) FINAL OVERRIDE
;
954 /* This method just wraps GET_CONSTANT_VALUE for now. Over time
955 naked calls to GET_CONSTANT_VALUE should be eliminated in favor
956 of calling member functions. */
959 ccp_folder::value_of_expr (tree op
, gimple
*)
961 return get_constant_value (op
);
964 /* Do final substitution of propagated values, cleanup the flowgraph and
965 free allocated storage. If NONZERO_P, record nonzero bits.
967 Return TRUE when something was optimized. */
970 ccp_finalize (bool nonzero_p
)
972 bool something_changed
;
978 /* Derive alignment and misalignment information from partially
979 constant pointers in the lattice or nonzero bits from partially
980 constant integers. */
981 FOR_EACH_SSA_NAME (i
, name
, cfun
)
983 ccp_prop_value_t
*val
;
984 unsigned int tem
, align
;
986 if (!POINTER_TYPE_P (TREE_TYPE (name
))
987 && (!INTEGRAL_TYPE_P (TREE_TYPE (name
))
988 /* Don't record nonzero bits before IPA to avoid
989 using too much memory. */
993 val
= get_value (name
);
994 if (val
->lattice_val
!= CONSTANT
995 || TREE_CODE (val
->value
) != INTEGER_CST
999 if (POINTER_TYPE_P (TREE_TYPE (name
)))
1001 /* Trailing mask bits specify the alignment, trailing value
1002 bits the misalignment. */
1003 tem
= val
->mask
.to_uhwi ();
1004 align
= least_bit_hwi (tem
);
1006 set_ptr_info_alignment (get_ptr_info (name
), align
,
1007 (TREE_INT_CST_LOW (val
->value
)
1012 unsigned int precision
= TYPE_PRECISION (TREE_TYPE (val
->value
));
1013 wide_int nonzero_bits
1014 = (wide_int::from (val
->mask
, precision
, UNSIGNED
)
1015 | wi::to_wide (val
->value
));
1016 nonzero_bits
&= get_nonzero_bits (name
);
1017 set_nonzero_bits (name
, nonzero_bits
);
1021 /* Perform substitutions based on the known constant values. */
1022 class ccp_folder ccp_folder
;
1023 something_changed
= ccp_folder
.substitute_and_fold ();
1027 return something_changed
;
1031 /* Compute the meet operator between *VAL1 and *VAL2. Store the result
1034 any M UNDEFINED = any
1035 any M VARYING = VARYING
1036 Ci M Cj = Ci if (i == j)
1037 Ci M Cj = VARYING if (i != j)
1041 ccp_lattice_meet (ccp_prop_value_t
*val1
, ccp_prop_value_t
*val2
)
1043 if (val1
->lattice_val
== UNDEFINED
1044 /* For UNDEFINED M SSA we can't always SSA because its definition
1045 may not dominate the PHI node. Doing optimistic copy propagation
1046 also causes a lot of gcc.dg/uninit-pred*.c FAILs. */
1047 && (val2
->lattice_val
!= CONSTANT
1048 || TREE_CODE (val2
->value
) != SSA_NAME
))
1050 /* UNDEFINED M any = any */
1053 else if (val2
->lattice_val
== UNDEFINED
1055 && (val1
->lattice_val
!= CONSTANT
1056 || TREE_CODE (val1
->value
) != SSA_NAME
))
1058 /* any M UNDEFINED = any
1059 Nothing to do. VAL1 already contains the value we want. */
1062 else if (val1
->lattice_val
== VARYING
1063 || val2
->lattice_val
== VARYING
)
1065 /* any M VARYING = VARYING. */
1066 val1
->lattice_val
= VARYING
;
1068 val1
->value
= NULL_TREE
;
1070 else if (val1
->lattice_val
== CONSTANT
1071 && val2
->lattice_val
== CONSTANT
1072 && TREE_CODE (val1
->value
) == INTEGER_CST
1073 && TREE_CODE (val2
->value
) == INTEGER_CST
)
1075 /* Ci M Cj = Ci if (i == j)
1076 Ci M Cj = VARYING if (i != j)
1078 For INTEGER_CSTs mask unequal bits. If no equal bits remain,
1080 val1
->mask
= (val1
->mask
| val2
->mask
1081 | (wi::to_widest (val1
->value
)
1082 ^ wi::to_widest (val2
->value
)));
1083 if (wi::sext (val1
->mask
, TYPE_PRECISION (TREE_TYPE (val1
->value
))) == -1)
1085 val1
->lattice_val
= VARYING
;
1086 val1
->value
= NULL_TREE
;
1089 else if (val1
->lattice_val
== CONSTANT
1090 && val2
->lattice_val
== CONSTANT
1091 && operand_equal_p (val1
->value
, val2
->value
, 0))
1093 /* Ci M Cj = Ci if (i == j)
1094 Ci M Cj = VARYING if (i != j)
1096 VAL1 already contains the value we want for equivalent values. */
1098 else if (val1
->lattice_val
== CONSTANT
1099 && val2
->lattice_val
== CONSTANT
1100 && (TREE_CODE (val1
->value
) == ADDR_EXPR
1101 || TREE_CODE (val2
->value
) == ADDR_EXPR
))
1103 /* When not equal addresses are involved try meeting for
1105 ccp_prop_value_t tem
= *val2
;
1106 if (TREE_CODE (val1
->value
) == ADDR_EXPR
)
1107 *val1
= get_value_for_expr (val1
->value
, true);
1108 if (TREE_CODE (val2
->value
) == ADDR_EXPR
)
1109 tem
= get_value_for_expr (val2
->value
, true);
1110 ccp_lattice_meet (val1
, &tem
);
1114 /* Any other combination is VARYING. */
1115 val1
->lattice_val
= VARYING
;
1117 val1
->value
= NULL_TREE
;
1122 /* Loop through the PHI_NODE's parameters for BLOCK and compare their
1123 lattice values to determine PHI_NODE's lattice value. The value of a
1124 PHI node is determined calling ccp_lattice_meet with all the arguments
1125 of the PHI node that are incoming via executable edges. */
1127 enum ssa_prop_result
1128 ccp_propagate::visit_phi (gphi
*phi
)
1131 ccp_prop_value_t new_val
;
1133 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1135 fprintf (dump_file
, "\nVisiting PHI node: ");
1136 print_gimple_stmt (dump_file
, phi
, 0, dump_flags
);
1139 new_val
.lattice_val
= UNDEFINED
;
1140 new_val
.value
= NULL_TREE
;
1144 bool non_exec_edge
= false;
1145 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
1147 /* Compute the meet operator over all the PHI arguments flowing
1148 through executable edges. */
1149 edge e
= gimple_phi_arg_edge (phi
, i
);
1151 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1154 "\tArgument #%d (%d -> %d %sexecutable)\n",
1155 i
, e
->src
->index
, e
->dest
->index
,
1156 (e
->flags
& EDGE_EXECUTABLE
) ? "" : "not ");
1159 /* If the incoming edge is executable, Compute the meet operator for
1160 the existing value of the PHI node and the current PHI argument. */
1161 if (e
->flags
& EDGE_EXECUTABLE
)
1163 tree arg
= gimple_phi_arg (phi
, i
)->def
;
1164 ccp_prop_value_t arg_val
= get_value_for_expr (arg
, false);
1172 ccp_lattice_meet (&new_val
, &arg_val
);
1174 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1176 fprintf (dump_file
, "\t");
1177 print_generic_expr (dump_file
, arg
, dump_flags
);
1178 dump_lattice_value (dump_file
, "\tValue: ", arg_val
);
1179 fprintf (dump_file
, "\n");
1182 if (new_val
.lattice_val
== VARYING
)
1186 non_exec_edge
= true;
1189 /* In case there were non-executable edges and the value is a copy
1190 make sure its definition dominates the PHI node. */
1192 && new_val
.lattice_val
== CONSTANT
1193 && TREE_CODE (new_val
.value
) == SSA_NAME
1194 && ! SSA_NAME_IS_DEFAULT_DEF (new_val
.value
)
1195 && ! dominated_by_p (CDI_DOMINATORS
, gimple_bb (phi
),
1196 gimple_bb (SSA_NAME_DEF_STMT (new_val
.value
))))
1198 new_val
.lattice_val
= VARYING
;
1199 new_val
.value
= NULL_TREE
;
1203 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1205 dump_lattice_value (dump_file
, "\n PHI node value: ", new_val
);
1206 fprintf (dump_file
, "\n\n");
1209 /* Make the transition to the new value. */
1210 if (set_lattice_value (gimple_phi_result (phi
), &new_val
))
1212 if (new_val
.lattice_val
== VARYING
)
1213 return SSA_PROP_VARYING
;
1215 return SSA_PROP_INTERESTING
;
1218 return SSA_PROP_NOT_INTERESTING
;
1221 /* Return the constant value for OP or OP otherwise. */
1224 valueize_op (tree op
)
1226 if (TREE_CODE (op
) == SSA_NAME
)
1228 tree tem
= get_constant_value (op
);
1235 /* Return the constant value for OP, but signal to not follow SSA
1236 edges if the definition may be simulated again. */
1239 valueize_op_1 (tree op
)
1241 if (TREE_CODE (op
) == SSA_NAME
)
1243 /* If the definition may be simulated again we cannot follow
1244 this SSA edge as the SSA propagator does not necessarily
1245 re-visit the use. */
1246 gimple
*def_stmt
= SSA_NAME_DEF_STMT (op
);
1247 if (!gimple_nop_p (def_stmt
)
1248 && prop_simulate_again_p (def_stmt
))
1250 tree tem
= get_constant_value (op
);
1257 /* CCP specific front-end to the non-destructive constant folding
1260 Attempt to simplify the RHS of STMT knowing that one or more
1261 operands are constants.
1263 If simplification is possible, return the simplified RHS,
1264 otherwise return the original RHS or NULL_TREE. */
1267 ccp_fold (gimple
*stmt
)
1269 location_t loc
= gimple_location (stmt
);
1270 switch (gimple_code (stmt
))
1274 /* Handle comparison operators that can appear in GIMPLE form. */
1275 tree op0
= valueize_op (gimple_cond_lhs (stmt
));
1276 tree op1
= valueize_op (gimple_cond_rhs (stmt
));
1277 enum tree_code code
= gimple_cond_code (stmt
);
1278 return fold_binary_loc (loc
, code
, boolean_type_node
, op0
, op1
);
1283 /* Return the constant switch index. */
1284 return valueize_op (gimple_switch_index (as_a
<gswitch
*> (stmt
)));
1289 return gimple_fold_stmt_to_constant_1 (stmt
,
1290 valueize_op
, valueize_op_1
);
1297 /* Determine the minimum and maximum values, *MIN and *MAX respectively,
1298 represented by the mask pair VAL and MASK with signedness SGN and
1299 precision PRECISION. */
1302 value_mask_to_min_max (widest_int
*min
, widest_int
*max
,
1303 const widest_int
&val
, const widest_int
&mask
,
1304 signop sgn
, int precision
)
1306 *min
= wi::bit_and_not (val
, mask
);
1308 if (sgn
== SIGNED
&& wi::neg_p (mask
))
1310 widest_int sign_bit
= wi::lshift (1, precision
- 1);
1313 /* MAX is zero extended, and MIN is sign extended. */
1314 *min
= wi::ext (*min
, precision
, sgn
);
1315 *max
= wi::ext (*max
, precision
, sgn
);
1319 /* Apply the operation CODE in type TYPE to the value, mask pair
1320 RVAL and RMASK representing a value of type RTYPE and set
1321 the value, mask pair *VAL and *MASK to the result. */
1324 bit_value_unop (enum tree_code code
, signop type_sgn
, int type_precision
,
1325 widest_int
*val
, widest_int
*mask
,
1326 signop rtype_sgn
, int rtype_precision
,
1327 const widest_int
&rval
, const widest_int
&rmask
)
1338 widest_int temv
, temm
;
1339 /* Return ~rval + 1. */
1340 bit_value_unop (BIT_NOT_EXPR
, type_sgn
, type_precision
, &temv
, &temm
,
1341 type_sgn
, type_precision
, rval
, rmask
);
1342 bit_value_binop (PLUS_EXPR
, type_sgn
, type_precision
, val
, mask
,
1343 type_sgn
, type_precision
, temv
, temm
,
1344 type_sgn
, type_precision
, 1, 0);
1350 /* First extend mask and value according to the original type. */
1351 *mask
= wi::ext (rmask
, rtype_precision
, rtype_sgn
);
1352 *val
= wi::ext (rval
, rtype_precision
, rtype_sgn
);
1354 /* Then extend mask and value according to the target type. */
1355 *mask
= wi::ext (*mask
, type_precision
, type_sgn
);
1356 *val
= wi::ext (*val
, type_precision
, type_sgn
);
1362 if (wi::sext (rmask
, rtype_precision
) == -1)
1364 else if (wi::neg_p (rmask
))
1366 /* Result is either rval or -rval. */
1367 widest_int temv
, temm
;
1368 bit_value_unop (NEGATE_EXPR
, rtype_sgn
, rtype_precision
, &temv
,
1369 &temm
, type_sgn
, type_precision
, rval
, rmask
);
1370 temm
|= (rmask
| (rval
^ temv
));
1371 /* Extend the result. */
1372 *mask
= wi::ext (temm
, type_precision
, type_sgn
);
1373 *val
= wi::ext (temv
, type_precision
, type_sgn
);
1375 else if (wi::neg_p (rval
))
1377 bit_value_unop (NEGATE_EXPR
, type_sgn
, type_precision
, val
, mask
,
1378 type_sgn
, type_precision
, rval
, rmask
);
1393 /* Determine the mask pair *VAL and *MASK from multiplying the
1394 argument mask pair RVAL, RMASK by the unsigned constant C. */
1396 bit_value_mult_const (signop sgn
, int width
,
1397 widest_int
*val
, widest_int
*mask
,
1398 const widest_int
&rval
, const widest_int
&rmask
,
1401 widest_int sum_mask
= 0;
1403 /* Ensure rval_lo only contains known bits. */
1404 widest_int rval_lo
= wi::bit_and_not (rval
, rmask
);
1408 /* General case (some bits of multiplicand are known set). */
1409 widest_int sum_val
= 0;
1412 /* Determine the lowest bit set in the multiplier. */
1413 int bitpos
= wi::ctz (c
);
1414 widest_int term_mask
= rmask
<< bitpos
;
1415 widest_int term_val
= rval_lo
<< bitpos
;
1418 widest_int lo
= sum_val
+ term_val
;
1419 widest_int hi
= (sum_val
| sum_mask
) + (term_val
| term_mask
);
1420 sum_mask
|= term_mask
| (lo
^ hi
);
1423 /* Clear this bit in the multiplier. */
1424 c
^= wi::lshift (1, bitpos
);
1426 /* Correctly extend the result value. */
1427 *val
= wi::ext (sum_val
, width
, sgn
);
1431 /* Special case (no bits of multiplicand are known set). */
1434 /* Determine the lowest bit set in the multiplier. */
1435 int bitpos
= wi::ctz (c
);
1436 widest_int term_mask
= rmask
<< bitpos
;
1439 widest_int hi
= sum_mask
+ term_mask
;
1440 sum_mask
|= term_mask
| hi
;
1442 /* Clear this bit in the multiplier. */
1443 c
^= wi::lshift (1, bitpos
);
1448 /* Correctly extend the result mask. */
1449 *mask
= wi::ext (sum_mask
, width
, sgn
);
1452 /* Fill up to MAX values in the BITS array with values representing
1453 each of the non-zero bits in the value X. Returns the number of
1454 bits in X (capped at the maximum value MAX). For example, an X
1455 value 11, places 1, 2 and 8 in BITS and returns the value 3. */
1458 get_individual_bits (widest_int
*bits
, widest_int x
, unsigned int max
)
1460 unsigned int count
= 0;
1461 while (count
< max
&& x
!= 0)
1463 int bitpos
= wi::ctz (x
);
1464 bits
[count
] = wi::lshift (1, bitpos
);
1471 /* Array of 2^N - 1 values representing the bits flipped between
1472 consecutive Gray codes. This is used to efficiently enumerate
1473 all permutations on N bits using XOR. */
1474 static const unsigned char gray_code_bit_flips
[63] = {
1475 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4,
1476 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5,
1477 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4,
1478 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0
1481 /* Apply the operation CODE in type TYPE to the value, mask pairs
1482 R1VAL, R1MASK and R2VAL, R2MASK representing a values of type R1TYPE
1483 and R2TYPE and set the value, mask pair *VAL and *MASK to the result. */
1486 bit_value_binop (enum tree_code code
, signop sgn
, int width
,
1487 widest_int
*val
, widest_int
*mask
,
1488 signop r1type_sgn
, int r1type_precision
,
1489 const widest_int
&r1val
, const widest_int
&r1mask
,
1490 signop r2type_sgn
, int r2type_precision ATTRIBUTE_UNUSED
,
1491 const widest_int
&r2val
, const widest_int
&r2mask
)
1493 bool swap_p
= false;
1495 /* Assume we'll get a constant result. Use an initial non varying
1496 value, we fall back to varying in the end if necessary. */
1498 /* Ensure that VAL is initialized (to any value). */
1504 /* The mask is constant where there is a known not
1505 set bit, (m1 | m2) & ((v1 | m1) & (v2 | m2)) */
1506 *mask
= (r1mask
| r2mask
) & (r1val
| r1mask
) & (r2val
| r2mask
);
1507 *val
= r1val
& r2val
;
1511 /* The mask is constant where there is a known
1512 set bit, (m1 | m2) & ~((v1 & ~m1) | (v2 & ~m2)). */
1513 *mask
= wi::bit_and_not (r1mask
| r2mask
,
1514 wi::bit_and_not (r1val
, r1mask
)
1515 | wi::bit_and_not (r2val
, r2mask
));
1516 *val
= r1val
| r2val
;
1521 *mask
= r1mask
| r2mask
;
1522 *val
= r1val
^ r2val
;
1529 widest_int shift
= r2val
;
1537 if (wi::neg_p (shift
, r2type_sgn
))
1540 if (code
== RROTATE_EXPR
)
1541 code
= LROTATE_EXPR
;
1543 code
= RROTATE_EXPR
;
1545 if (code
== RROTATE_EXPR
)
1547 *mask
= wi::rrotate (r1mask
, shift
, width
);
1548 *val
= wi::rrotate (r1val
, shift
, width
);
1552 *mask
= wi::lrotate (r1mask
, shift
, width
);
1553 *val
= wi::lrotate (r1val
, shift
, width
);
1557 else if (wi::ltu_p (r2val
| r2mask
, width
)
1558 && wi::popcount (r2mask
) <= 4)
1561 widest_int res_val
, res_mask
;
1562 widest_int tmp_val
, tmp_mask
;
1563 widest_int shift
= wi::bit_and_not (r2val
, r2mask
);
1564 unsigned int bit_count
= get_individual_bits (bits
, r2mask
, 4);
1565 unsigned int count
= (1 << bit_count
) - 1;
1567 /* Initialize result to rotate by smallest value of shift. */
1568 if (code
== RROTATE_EXPR
)
1570 res_mask
= wi::rrotate (r1mask
, shift
, width
);
1571 res_val
= wi::rrotate (r1val
, shift
, width
);
1575 res_mask
= wi::lrotate (r1mask
, shift
, width
);
1576 res_val
= wi::lrotate (r1val
, shift
, width
);
1579 /* Iterate through the remaining values of shift. */
1580 for (unsigned int i
=0; i
<count
; i
++)
1582 shift
^= bits
[gray_code_bit_flips
[i
]];
1583 if (code
== RROTATE_EXPR
)
1585 tmp_mask
= wi::rrotate (r1mask
, shift
, width
);
1586 tmp_val
= wi::rrotate (r1val
, shift
, width
);
1590 tmp_mask
= wi::lrotate (r1mask
, shift
, width
);
1591 tmp_val
= wi::lrotate (r1val
, shift
, width
);
1593 /* Accumulate the result. */
1594 res_mask
|= tmp_mask
| (res_val
^ tmp_val
);
1596 *val
= wi::bit_and_not (res_val
, res_mask
);
1603 /* ??? We can handle partially known shift counts if we know
1604 its sign. That way we can tell that (x << (y | 8)) & 255
1608 widest_int shift
= r2val
;
1616 if (wi::neg_p (shift
, r2type_sgn
))
1618 if (code
== RSHIFT_EXPR
)
1620 *mask
= wi::rshift (wi::ext (r1mask
, width
, sgn
), shift
, sgn
);
1621 *val
= wi::rshift (wi::ext (r1val
, width
, sgn
), shift
, sgn
);
1625 *mask
= wi::ext (r1mask
<< shift
, width
, sgn
);
1626 *val
= wi::ext (r1val
<< shift
, width
, sgn
);
1630 else if (wi::ltu_p (r2val
| r2mask
, width
))
1632 if (wi::popcount (r2mask
) <= 4)
1635 widest_int arg_val
, arg_mask
;
1636 widest_int res_val
, res_mask
;
1637 widest_int tmp_val
, tmp_mask
;
1638 widest_int shift
= wi::bit_and_not (r2val
, r2mask
);
1639 unsigned int bit_count
= get_individual_bits (bits
, r2mask
, 4);
1640 unsigned int count
= (1 << bit_count
) - 1;
1642 /* Initialize result to shift by smallest value of shift. */
1643 if (code
== RSHIFT_EXPR
)
1645 arg_mask
= wi::ext (r1mask
, width
, sgn
);
1646 arg_val
= wi::ext (r1val
, width
, sgn
);
1647 res_mask
= wi::rshift (arg_mask
, shift
, sgn
);
1648 res_val
= wi::rshift (arg_val
, shift
, sgn
);
1654 res_mask
= arg_mask
<< shift
;
1655 res_val
= arg_val
<< shift
;
1658 /* Iterate through the remaining values of shift. */
1659 for (unsigned int i
=0; i
<count
; i
++)
1661 shift
^= bits
[gray_code_bit_flips
[i
]];
1662 if (code
== RSHIFT_EXPR
)
1664 tmp_mask
= wi::rshift (arg_mask
, shift
, sgn
);
1665 tmp_val
= wi::rshift (arg_val
, shift
, sgn
);
1669 tmp_mask
= arg_mask
<< shift
;
1670 tmp_val
= arg_val
<< shift
;
1672 /* Accumulate the result. */
1673 res_mask
|= tmp_mask
| (res_val
^ tmp_val
);
1675 res_mask
= wi::ext (res_mask
, width
, sgn
);
1676 res_val
= wi::ext (res_val
, width
, sgn
);
1677 *val
= wi::bit_and_not (res_val
, res_mask
);
1680 else if ((r1val
| r1mask
) == 0)
1682 /* Handle shifts of zero to avoid undefined wi::ctz below. */
1686 else if (code
== LSHIFT_EXPR
)
1688 widest_int tmp
= wi::mask
<widest_int
> (width
, false);
1689 tmp
<<= wi::ctz (r1val
| r1mask
);
1690 tmp
<<= wi::bit_and_not (r2val
, r2mask
);
1691 *mask
= wi::ext (tmp
, width
, sgn
);
1694 else if (!wi::neg_p (r1val
| r1mask
, sgn
))
1696 /* Logical right shift, or zero sign bit. */
1697 widest_int arg
= r1val
| r1mask
;
1698 int lzcount
= wi::clz (arg
);
1700 lzcount
-= wi::get_precision (arg
) - width
;
1701 widest_int tmp
= wi::mask
<widest_int
> (width
, false);
1702 tmp
= wi::lrshift (tmp
, lzcount
);
1703 tmp
= wi::lrshift (tmp
, wi::bit_and_not (r2val
, r2mask
));
1704 *mask
= wi::ext (tmp
, width
, sgn
);
1707 else if (!wi::neg_p (r1mask
))
1709 /* Arithmetic right shift with set sign bit. */
1710 widest_int arg
= wi::bit_and_not (r1val
, r1mask
);
1711 int sbcount
= wi::clrsb (arg
);
1712 sbcount
-= wi::get_precision (arg
) - width
;
1713 widest_int tmp
= wi::mask
<widest_int
> (width
, false);
1714 tmp
= wi::lrshift (tmp
, sbcount
);
1715 tmp
= wi::lrshift (tmp
, wi::bit_and_not (r2val
, r2mask
));
1716 *mask
= wi::sext (tmp
, width
);
1717 tmp
= wi::bit_not (tmp
);
1718 *val
= wi::sext (tmp
, width
);
1724 case POINTER_PLUS_EXPR
:
1726 /* Do the addition with unknown bits set to zero, to give carry-ins of
1727 zero wherever possible. */
1728 widest_int lo
= (wi::bit_and_not (r1val
, r1mask
)
1729 + wi::bit_and_not (r2val
, r2mask
));
1730 lo
= wi::ext (lo
, width
, sgn
);
1731 /* Do the addition with unknown bits set to one, to give carry-ins of
1732 one wherever possible. */
1733 widest_int hi
= (r1val
| r1mask
) + (r2val
| r2mask
);
1734 hi
= wi::ext (hi
, width
, sgn
);
1735 /* Each bit in the result is known if (a) the corresponding bits in
1736 both inputs are known, and (b) the carry-in to that bit position
1737 is known. We can check condition (b) by seeing if we got the same
1738 result with minimised carries as with maximised carries. */
1739 *mask
= r1mask
| r2mask
| (lo
^ hi
);
1740 *mask
= wi::ext (*mask
, width
, sgn
);
1741 /* It shouldn't matter whether we choose lo or hi here. */
1747 case POINTER_DIFF_EXPR
:
1749 /* Subtraction is derived from the addition algorithm above. */
1750 widest_int lo
= wi::bit_and_not (r1val
, r1mask
) - (r2val
| r2mask
);
1751 lo
= wi::ext (lo
, width
, sgn
);
1752 widest_int hi
= (r1val
| r1mask
) - wi::bit_and_not (r2val
, r2mask
);
1753 hi
= wi::ext (hi
, width
, sgn
);
1754 *mask
= r1mask
| r2mask
| (lo
^ hi
);
1755 *mask
= wi::ext (*mask
, width
, sgn
);
1762 && !wi::neg_p (r2val
, sgn
)
1763 && (flag_expensive_optimizations
|| wi::popcount (r2val
) < 8))
1764 bit_value_mult_const (sgn
, width
, val
, mask
, r1val
, r1mask
, r2val
);
1765 else if (r1mask
== 0
1766 && !wi::neg_p (r1val
, sgn
)
1767 && (flag_expensive_optimizations
|| wi::popcount (r1val
) < 8))
1768 bit_value_mult_const (sgn
, width
, val
, mask
, r2val
, r2mask
, r1val
);
1771 /* Just track trailing zeros in both operands and transfer
1772 them to the other. */
1773 int r1tz
= wi::ctz (r1val
| r1mask
);
1774 int r2tz
= wi::ctz (r2val
| r2mask
);
1775 if (r1tz
+ r2tz
>= width
)
1780 else if (r1tz
+ r2tz
> 0)
1782 *mask
= wi::ext (wi::mask
<widest_int
> (r1tz
+ r2tz
, true),
1792 widest_int m
= r1mask
| r2mask
;
1793 if (wi::bit_and_not (r1val
, m
) != wi::bit_and_not (r2val
, m
))
1796 *val
= ((code
== EQ_EXPR
) ? 0 : 1);
1800 /* We know the result of a comparison is always one or zero. */
1810 code
= swap_tree_comparison (code
);
1815 widest_int min1
, max1
, min2
, max2
;
1818 const widest_int
&o1val
= swap_p
? r2val
: r1val
;
1819 const widest_int
&o1mask
= swap_p
? r2mask
: r1mask
;
1820 const widest_int
&o2val
= swap_p
? r1val
: r2val
;
1821 const widest_int
&o2mask
= swap_p
? r1mask
: r2mask
;
1823 value_mask_to_min_max (&min1
, &max1
, o1val
, o1mask
,
1824 r1type_sgn
, r1type_precision
);
1825 value_mask_to_min_max (&min2
, &max2
, o2val
, o2mask
,
1826 r1type_sgn
, r1type_precision
);
1828 /* For comparisons the signedness is in the comparison operands. */
1829 /* Do a cross comparison of the max/min pairs. */
1830 maxmin
= wi::cmp (max1
, min2
, r1type_sgn
);
1831 minmax
= wi::cmp (min1
, max2
, r1type_sgn
);
1832 if (maxmin
< (code
== LE_EXPR
? 1: 0)) /* o1 < or <= o2. */
1837 else if (minmax
> (code
== LT_EXPR
? -1 : 0)) /* o1 >= or > o2. */
1842 else if (maxmin
== minmax
) /* o1 and o2 are equal. */
1844 /* This probably should never happen as we'd have
1845 folded the thing during fully constant value folding. */
1847 *val
= (code
== LE_EXPR
? 1 : 0);
1851 /* We know the result of a comparison is always one or zero. */
1861 widest_int min1
, max1
, min2
, max2
;
1863 value_mask_to_min_max (&min1
, &max1
, r1val
, r1mask
, sgn
, width
);
1864 value_mask_to_min_max (&min2
, &max2
, r2val
, r2mask
, sgn
, width
);
1866 if (wi::cmp (max1
, min2
, sgn
) <= 0) /* r1 is less than r2. */
1868 if (code
== MIN_EXPR
)
1879 else if (wi::cmp (min1
, max2
, sgn
) >= 0) /* r2 is less than r1. */
1881 if (code
== MIN_EXPR
)
1894 /* The result is either r1 or r2. */
1895 *mask
= r1mask
| r2mask
| (r1val
^ r2val
);
1901 case TRUNC_MOD_EXPR
:
1903 widest_int r1max
= r1val
| r1mask
;
1904 widest_int r2max
= r2val
| r2mask
;
1906 || (!wi::neg_p (r1max
) && !wi::neg_p (r2max
)))
1908 /* Confirm R2 has some bits set, to avoid division by zero. */
1909 widest_int r2min
= wi::bit_and_not (r2val
, r2mask
);
1912 /* R1 % R2 is R1 if R1 is always less than R2. */
1913 if (wi::ltu_p (r1max
, r2min
))
1920 /* R1 % R2 is always less than the maximum of R2. */
1921 unsigned int lzcount
= wi::clz (r2max
);
1922 unsigned int bits
= wi::get_precision (r2max
) - lzcount
;
1923 if (r2max
== wi::lshift (1, bits
))
1925 *mask
= wi::mask
<widest_int
> (bits
, false);
1933 case TRUNC_DIV_EXPR
:
1935 widest_int r1max
= r1val
| r1mask
;
1936 widest_int r2max
= r2val
| r2mask
;
1938 || (!wi::neg_p (r1max
) && !wi::neg_p (r2max
)))
1940 /* Confirm R2 has some bits set, to avoid division by zero. */
1941 widest_int r2min
= wi::bit_and_not (r2val
, r2mask
);
1944 /* R1 / R2 is zero if R1 is always less than R2. */
1945 if (wi::ltu_p (r1max
, r2min
))
1952 widest_int upper
= wi::udiv_trunc (r1max
, r2min
);
1953 unsigned int lzcount
= wi::clz (upper
);
1954 unsigned int bits
= wi::get_precision (upper
) - lzcount
;
1955 *mask
= wi::mask
<widest_int
> (bits
, false);
1967 /* Return the propagation value when applying the operation CODE to
1968 the value RHS yielding type TYPE. */
1970 static ccp_prop_value_t
1971 bit_value_unop (enum tree_code code
, tree type
, tree rhs
)
1973 ccp_prop_value_t rval
= get_value_for_expr (rhs
, true);
1974 widest_int value
, mask
;
1975 ccp_prop_value_t val
;
1977 if (rval
.lattice_val
== UNDEFINED
)
1980 gcc_assert ((rval
.lattice_val
== CONSTANT
1981 && TREE_CODE (rval
.value
) == INTEGER_CST
)
1982 || wi::sext (rval
.mask
, TYPE_PRECISION (TREE_TYPE (rhs
))) == -1);
1983 bit_value_unop (code
, TYPE_SIGN (type
), TYPE_PRECISION (type
), &value
, &mask
,
1984 TYPE_SIGN (TREE_TYPE (rhs
)), TYPE_PRECISION (TREE_TYPE (rhs
)),
1985 value_to_wide_int (rval
), rval
.mask
);
1986 if (wi::sext (mask
, TYPE_PRECISION (type
)) != -1)
1988 val
.lattice_val
= CONSTANT
;
1990 /* ??? Delay building trees here. */
1991 val
.value
= wide_int_to_tree (type
, value
);
1995 val
.lattice_val
= VARYING
;
1996 val
.value
= NULL_TREE
;
2002 /* Return the propagation value when applying the operation CODE to
2003 the values RHS1 and RHS2 yielding type TYPE. */
2005 static ccp_prop_value_t
2006 bit_value_binop (enum tree_code code
, tree type
, tree rhs1
, tree rhs2
)
2008 ccp_prop_value_t r1val
= get_value_for_expr (rhs1
, true);
2009 ccp_prop_value_t r2val
= get_value_for_expr (rhs2
, true);
2010 widest_int value
, mask
;
2011 ccp_prop_value_t val
;
2013 if (r1val
.lattice_val
== UNDEFINED
2014 || r2val
.lattice_val
== UNDEFINED
)
2016 val
.lattice_val
= VARYING
;
2017 val
.value
= NULL_TREE
;
2022 gcc_assert ((r1val
.lattice_val
== CONSTANT
2023 && TREE_CODE (r1val
.value
) == INTEGER_CST
)
2024 || wi::sext (r1val
.mask
,
2025 TYPE_PRECISION (TREE_TYPE (rhs1
))) == -1);
2026 gcc_assert ((r2val
.lattice_val
== CONSTANT
2027 && TREE_CODE (r2val
.value
) == INTEGER_CST
)
2028 || wi::sext (r2val
.mask
,
2029 TYPE_PRECISION (TREE_TYPE (rhs2
))) == -1);
2030 bit_value_binop (code
, TYPE_SIGN (type
), TYPE_PRECISION (type
), &value
, &mask
,
2031 TYPE_SIGN (TREE_TYPE (rhs1
)), TYPE_PRECISION (TREE_TYPE (rhs1
)),
2032 value_to_wide_int (r1val
), r1val
.mask
,
2033 TYPE_SIGN (TREE_TYPE (rhs2
)), TYPE_PRECISION (TREE_TYPE (rhs2
)),
2034 value_to_wide_int (r2val
), r2val
.mask
);
2036 /* (x * x) & 2 == 0. */
2037 if (code
== MULT_EXPR
&& rhs1
== rhs2
&& TYPE_PRECISION (type
) > 1)
2040 if (wi::sext (mask
, TYPE_PRECISION (type
)) != -1)
2041 value
= wi::bit_and_not (value
, m
);
2044 mask
= wi::bit_and_not (mask
, m
);
2047 if (wi::sext (mask
, TYPE_PRECISION (type
)) != -1)
2049 val
.lattice_val
= CONSTANT
;
2051 /* ??? Delay building trees here. */
2052 val
.value
= wide_int_to_tree (type
, value
);
2056 val
.lattice_val
= VARYING
;
2057 val
.value
= NULL_TREE
;
2063 /* Return the propagation value for __builtin_assume_aligned
2064 and functions with assume_aligned or alloc_aligned attribute.
2065 For __builtin_assume_aligned, ATTR is NULL_TREE,
2066 for assume_aligned attribute ATTR is non-NULL and ALLOC_ALIGNED
2067 is false, for alloc_aligned attribute ATTR is non-NULL and
2068 ALLOC_ALIGNED is true. */
2070 static ccp_prop_value_t
2071 bit_value_assume_aligned (gimple
*stmt
, tree attr
, ccp_prop_value_t ptrval
,
2074 tree align
, misalign
= NULL_TREE
, type
;
2075 unsigned HOST_WIDE_INT aligni
, misaligni
= 0;
2076 ccp_prop_value_t alignval
;
2077 widest_int value
, mask
;
2078 ccp_prop_value_t val
;
2080 if (attr
== NULL_TREE
)
2082 tree ptr
= gimple_call_arg (stmt
, 0);
2083 type
= TREE_TYPE (ptr
);
2084 ptrval
= get_value_for_expr (ptr
, true);
2088 tree lhs
= gimple_call_lhs (stmt
);
2089 type
= TREE_TYPE (lhs
);
2092 if (ptrval
.lattice_val
== UNDEFINED
)
2094 gcc_assert ((ptrval
.lattice_val
== CONSTANT
2095 && TREE_CODE (ptrval
.value
) == INTEGER_CST
)
2096 || wi::sext (ptrval
.mask
, TYPE_PRECISION (type
)) == -1);
2097 if (attr
== NULL_TREE
)
2099 /* Get aligni and misaligni from __builtin_assume_aligned. */
2100 align
= gimple_call_arg (stmt
, 1);
2101 if (!tree_fits_uhwi_p (align
))
2103 aligni
= tree_to_uhwi (align
);
2104 if (gimple_call_num_args (stmt
) > 2)
2106 misalign
= gimple_call_arg (stmt
, 2);
2107 if (!tree_fits_uhwi_p (misalign
))
2109 misaligni
= tree_to_uhwi (misalign
);
2114 /* Get aligni and misaligni from assume_aligned or
2115 alloc_align attributes. */
2116 if (TREE_VALUE (attr
) == NULL_TREE
)
2118 attr
= TREE_VALUE (attr
);
2119 align
= TREE_VALUE (attr
);
2120 if (!tree_fits_uhwi_p (align
))
2122 aligni
= tree_to_uhwi (align
);
2125 if (aligni
== 0 || aligni
> gimple_call_num_args (stmt
))
2127 align
= gimple_call_arg (stmt
, aligni
- 1);
2128 if (!tree_fits_uhwi_p (align
))
2130 aligni
= tree_to_uhwi (align
);
2132 else if (TREE_CHAIN (attr
) && TREE_VALUE (TREE_CHAIN (attr
)))
2134 misalign
= TREE_VALUE (TREE_CHAIN (attr
));
2135 if (!tree_fits_uhwi_p (misalign
))
2137 misaligni
= tree_to_uhwi (misalign
);
2140 if (aligni
<= 1 || (aligni
& (aligni
- 1)) != 0 || misaligni
>= aligni
)
2143 align
= build_int_cst_type (type
, -aligni
);
2144 alignval
= get_value_for_expr (align
, true);
2145 bit_value_binop (BIT_AND_EXPR
, TYPE_SIGN (type
), TYPE_PRECISION (type
), &value
, &mask
,
2146 TYPE_SIGN (type
), TYPE_PRECISION (type
), value_to_wide_int (ptrval
), ptrval
.mask
,
2147 TYPE_SIGN (type
), TYPE_PRECISION (type
), value_to_wide_int (alignval
), alignval
.mask
);
2149 if (wi::sext (mask
, TYPE_PRECISION (type
)) != -1)
2151 val
.lattice_val
= CONSTANT
;
2153 gcc_assert ((mask
.to_uhwi () & (aligni
- 1)) == 0);
2154 gcc_assert ((value
.to_uhwi () & (aligni
- 1)) == 0);
2156 /* ??? Delay building trees here. */
2157 val
.value
= wide_int_to_tree (type
, value
);
2161 val
.lattice_val
= VARYING
;
2162 val
.value
= NULL_TREE
;
2168 /* Evaluate statement STMT.
2169 Valid only for assignments, calls, conditionals, and switches. */
2171 static ccp_prop_value_t
2172 evaluate_stmt (gimple
*stmt
)
2174 ccp_prop_value_t val
;
2175 tree simplified
= NULL_TREE
;
2176 ccp_lattice_t likelyvalue
= likely_value (stmt
);
2177 bool is_constant
= false;
2179 bool ignore_return_flags
= false;
2181 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2183 fprintf (dump_file
, "which is likely ");
2184 switch (likelyvalue
)
2187 fprintf (dump_file
, "CONSTANT");
2190 fprintf (dump_file
, "UNDEFINED");
2193 fprintf (dump_file
, "VARYING");
2197 fprintf (dump_file
, "\n");
2200 /* If the statement is likely to have a CONSTANT result, then try
2201 to fold the statement to determine the constant value. */
2202 /* FIXME. This is the only place that we call ccp_fold.
2203 Since likely_value never returns CONSTANT for calls, we will
2204 not attempt to fold them, including builtins that may profit. */
2205 if (likelyvalue
== CONSTANT
)
2207 fold_defer_overflow_warnings ();
2208 simplified
= ccp_fold (stmt
);
2210 && TREE_CODE (simplified
) == SSA_NAME
)
2212 /* We may not use values of something that may be simulated again,
2213 see valueize_op_1. */
2214 if (SSA_NAME_IS_DEFAULT_DEF (simplified
)
2215 || ! prop_simulate_again_p (SSA_NAME_DEF_STMT (simplified
)))
2217 ccp_prop_value_t
*val
= get_value (simplified
);
2218 if (val
&& val
->lattice_val
!= VARYING
)
2220 fold_undefer_overflow_warnings (true, stmt
, 0);
2225 /* We may also not place a non-valueized copy in the lattice
2226 as that might become stale if we never re-visit this stmt. */
2227 simplified
= NULL_TREE
;
2229 is_constant
= simplified
&& is_gimple_min_invariant (simplified
);
2230 fold_undefer_overflow_warnings (is_constant
, stmt
, 0);
2233 /* The statement produced a constant value. */
2234 val
.lattice_val
= CONSTANT
;
2235 val
.value
= simplified
;
2240 /* If the statement is likely to have a VARYING result, then do not
2241 bother folding the statement. */
2242 else if (likelyvalue
== VARYING
)
2244 enum gimple_code code
= gimple_code (stmt
);
2245 if (code
== GIMPLE_ASSIGN
)
2247 enum tree_code subcode
= gimple_assign_rhs_code (stmt
);
2249 /* Other cases cannot satisfy is_gimple_min_invariant
2251 if (get_gimple_rhs_class (subcode
) == GIMPLE_SINGLE_RHS
)
2252 simplified
= gimple_assign_rhs1 (stmt
);
2254 else if (code
== GIMPLE_SWITCH
)
2255 simplified
= gimple_switch_index (as_a
<gswitch
*> (stmt
));
2257 /* These cannot satisfy is_gimple_min_invariant without folding. */
2258 gcc_assert (code
== GIMPLE_CALL
|| code
== GIMPLE_COND
);
2259 is_constant
= simplified
&& is_gimple_min_invariant (simplified
);
2262 /* The statement produced a constant value. */
2263 val
.lattice_val
= CONSTANT
;
2264 val
.value
= simplified
;
2268 /* If the statement result is likely UNDEFINED, make it so. */
2269 else if (likelyvalue
== UNDEFINED
)
2271 val
.lattice_val
= UNDEFINED
;
2272 val
.value
= NULL_TREE
;
2277 /* Resort to simplification for bitwise tracking. */
2278 if (flag_tree_bit_ccp
2279 && (likelyvalue
== CONSTANT
|| is_gimple_call (stmt
)
2280 || (gimple_assign_single_p (stmt
)
2281 && gimple_assign_rhs_code (stmt
) == ADDR_EXPR
))
2284 enum gimple_code code
= gimple_code (stmt
);
2285 val
.lattice_val
= VARYING
;
2286 val
.value
= NULL_TREE
;
2288 if (code
== GIMPLE_ASSIGN
)
2290 enum tree_code subcode
= gimple_assign_rhs_code (stmt
);
2291 tree rhs1
= gimple_assign_rhs1 (stmt
);
2292 tree lhs
= gimple_assign_lhs (stmt
);
2293 if ((INTEGRAL_TYPE_P (TREE_TYPE (lhs
))
2294 || POINTER_TYPE_P (TREE_TYPE (lhs
)))
2295 && (INTEGRAL_TYPE_P (TREE_TYPE (rhs1
))
2296 || POINTER_TYPE_P (TREE_TYPE (rhs1
))))
2297 switch (get_gimple_rhs_class (subcode
))
2299 case GIMPLE_SINGLE_RHS
:
2300 val
= get_value_for_expr (rhs1
, true);
2303 case GIMPLE_UNARY_RHS
:
2304 val
= bit_value_unop (subcode
, TREE_TYPE (lhs
), rhs1
);
2307 case GIMPLE_BINARY_RHS
:
2308 val
= bit_value_binop (subcode
, TREE_TYPE (lhs
), rhs1
,
2309 gimple_assign_rhs2 (stmt
));
2315 else if (code
== GIMPLE_COND
)
2317 enum tree_code code
= gimple_cond_code (stmt
);
2318 tree rhs1
= gimple_cond_lhs (stmt
);
2319 tree rhs2
= gimple_cond_rhs (stmt
);
2320 if (INTEGRAL_TYPE_P (TREE_TYPE (rhs1
))
2321 || POINTER_TYPE_P (TREE_TYPE (rhs1
)))
2322 val
= bit_value_binop (code
, TREE_TYPE (rhs1
), rhs1
, rhs2
);
2324 else if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
))
2326 tree fndecl
= gimple_call_fndecl (stmt
);
2327 switch (DECL_FUNCTION_CODE (fndecl
))
2329 case BUILT_IN_MALLOC
:
2330 case BUILT_IN_REALLOC
:
2331 case BUILT_IN_CALLOC
:
2332 case BUILT_IN_STRDUP
:
2333 case BUILT_IN_STRNDUP
:
2334 val
.lattice_val
= CONSTANT
;
2335 val
.value
= build_int_cst (TREE_TYPE (gimple_get_lhs (stmt
)), 0);
2336 val
.mask
= ~((HOST_WIDE_INT
) MALLOC_ABI_ALIGNMENT
2337 / BITS_PER_UNIT
- 1);
2340 CASE_BUILT_IN_ALLOCA
:
2341 align
= (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_ALLOCA
2343 : TREE_INT_CST_LOW (gimple_call_arg (stmt
, 1)));
2344 val
.lattice_val
= CONSTANT
;
2345 val
.value
= build_int_cst (TREE_TYPE (gimple_get_lhs (stmt
)), 0);
2346 val
.mask
= ~((HOST_WIDE_INT
) align
/ BITS_PER_UNIT
- 1);
2349 case BUILT_IN_ASSUME_ALIGNED
:
2350 val
= bit_value_assume_aligned (stmt
, NULL_TREE
, val
, false);
2351 ignore_return_flags
= true;
2354 case BUILT_IN_ALIGNED_ALLOC
:
2355 case BUILT_IN_GOMP_ALLOC
:
2357 tree align
= get_constant_value (gimple_call_arg (stmt
, 0));
2359 && tree_fits_uhwi_p (align
))
2361 unsigned HOST_WIDE_INT aligni
= tree_to_uhwi (align
);
2363 /* align must be power-of-two */
2364 && (aligni
& (aligni
- 1)) == 0)
2366 val
.lattice_val
= CONSTANT
;
2367 val
.value
= build_int_cst (ptr_type_node
, 0);
2374 case BUILT_IN_BSWAP16
:
2375 case BUILT_IN_BSWAP32
:
2376 case BUILT_IN_BSWAP64
:
2377 case BUILT_IN_BSWAP128
:
2378 val
= get_value_for_expr (gimple_call_arg (stmt
, 0), true);
2379 if (val
.lattice_val
== UNDEFINED
)
2381 else if (val
.lattice_val
== CONSTANT
2383 && TREE_CODE (val
.value
) == INTEGER_CST
)
2385 tree type
= TREE_TYPE (gimple_call_lhs (stmt
));
2386 int prec
= TYPE_PRECISION (type
);
2387 wide_int wval
= wi::to_wide (val
.value
);
2389 = wide_int_to_tree (type
,
2390 wide_int::from (wval
, prec
,
2391 UNSIGNED
).bswap ());
2393 = widest_int::from (wide_int::from (val
.mask
, prec
,
2396 if (wi::sext (val
.mask
, prec
) != -1)
2399 val
.lattice_val
= VARYING
;
2400 val
.value
= NULL_TREE
;
2407 if (is_gimple_call (stmt
) && gimple_call_lhs (stmt
))
2409 tree fntype
= gimple_call_fntype (stmt
);
2412 tree attrs
= lookup_attribute ("assume_aligned",
2413 TYPE_ATTRIBUTES (fntype
));
2415 val
= bit_value_assume_aligned (stmt
, attrs
, val
, false);
2416 attrs
= lookup_attribute ("alloc_align",
2417 TYPE_ATTRIBUTES (fntype
));
2419 val
= bit_value_assume_aligned (stmt
, attrs
, val
, true);
2421 int flags
= ignore_return_flags
2422 ? 0 : gimple_call_return_flags (as_a
<gcall
*> (stmt
));
2423 if (flags
& ERF_RETURNS_ARG
2424 && (flags
& ERF_RETURN_ARG_MASK
) < gimple_call_num_args (stmt
))
2426 val
= get_value_for_expr
2427 (gimple_call_arg (stmt
,
2428 flags
& ERF_RETURN_ARG_MASK
), true);
2431 is_constant
= (val
.lattice_val
== CONSTANT
);
2434 if (flag_tree_bit_ccp
2435 && ((is_constant
&& TREE_CODE (val
.value
) == INTEGER_CST
)
2437 && gimple_get_lhs (stmt
)
2438 && TREE_CODE (gimple_get_lhs (stmt
)) == SSA_NAME
)
2440 tree lhs
= gimple_get_lhs (stmt
);
2441 wide_int nonzero_bits
= get_nonzero_bits (lhs
);
2442 if (nonzero_bits
!= -1)
2446 val
.lattice_val
= CONSTANT
;
2447 val
.value
= build_zero_cst (TREE_TYPE (lhs
));
2448 val
.mask
= extend_mask (nonzero_bits
, TYPE_SIGN (TREE_TYPE (lhs
)));
2453 if (wi::bit_and_not (wi::to_wide (val
.value
), nonzero_bits
) != 0)
2454 val
.value
= wide_int_to_tree (TREE_TYPE (lhs
),
2456 & wi::to_wide (val
.value
));
2457 if (nonzero_bits
== 0)
2460 val
.mask
= val
.mask
& extend_mask (nonzero_bits
,
2461 TYPE_SIGN (TREE_TYPE (lhs
)));
2466 /* The statement produced a nonconstant value. */
2469 /* The statement produced a copy. */
2470 if (simplified
&& TREE_CODE (simplified
) == SSA_NAME
2471 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (simplified
))
2473 val
.lattice_val
= CONSTANT
;
2474 val
.value
= simplified
;
2477 /* The statement is VARYING. */
2480 val
.lattice_val
= VARYING
;
2481 val
.value
= NULL_TREE
;
2489 typedef hash_table
<nofree_ptr_hash
<gimple
> > gimple_htab
;
2491 /* Given a BUILT_IN_STACK_SAVE value SAVED_VAL, insert a clobber of VAR before
2492 each matching BUILT_IN_STACK_RESTORE. Mark visited phis in VISITED. */
2495 insert_clobber_before_stack_restore (tree saved_val
, tree var
,
2496 gimple_htab
**visited
)
2499 gassign
*clobber_stmt
;
2501 imm_use_iterator iter
;
2502 gimple_stmt_iterator i
;
2505 FOR_EACH_IMM_USE_STMT (stmt
, iter
, saved_val
)
2506 if (gimple_call_builtin_p (stmt
, BUILT_IN_STACK_RESTORE
))
2508 clobber
= build_clobber (TREE_TYPE (var
), CLOBBER_EOL
);
2509 clobber_stmt
= gimple_build_assign (var
, clobber
);
2511 i
= gsi_for_stmt (stmt
);
2512 gsi_insert_before (&i
, clobber_stmt
, GSI_SAME_STMT
);
2514 else if (gimple_code (stmt
) == GIMPLE_PHI
)
2517 *visited
= new gimple_htab (10);
2519 slot
= (*visited
)->find_slot (stmt
, INSERT
);
2524 insert_clobber_before_stack_restore (gimple_phi_result (stmt
), var
,
2527 else if (gimple_assign_ssa_name_copy_p (stmt
))
2528 insert_clobber_before_stack_restore (gimple_assign_lhs (stmt
), var
,
2532 /* Advance the iterator to the previous non-debug gimple statement in the same
2533 or dominating basic block. */
2536 gsi_prev_dom_bb_nondebug (gimple_stmt_iterator
*i
)
2540 gsi_prev_nondebug (i
);
2541 while (gsi_end_p (*i
))
2543 dom
= get_immediate_dominator (CDI_DOMINATORS
, gsi_bb (*i
));
2544 if (dom
== NULL
|| dom
== ENTRY_BLOCK_PTR_FOR_FN (cfun
))
2547 *i
= gsi_last_bb (dom
);
2551 /* Find a BUILT_IN_STACK_SAVE dominating gsi_stmt (I), and insert
2552 a clobber of VAR before each matching BUILT_IN_STACK_RESTORE.
2554 It is possible that BUILT_IN_STACK_SAVE cannot be found in a dominator when
2555 a previous pass (such as DOM) duplicated it along multiple paths to a BB.
2556 In that case the function gives up without inserting the clobbers. */
2559 insert_clobbers_for_var (gimple_stmt_iterator i
, tree var
)
2563 gimple_htab
*visited
= NULL
;
2565 for (; !gsi_end_p (i
); gsi_prev_dom_bb_nondebug (&i
))
2567 stmt
= gsi_stmt (i
);
2569 if (!gimple_call_builtin_p (stmt
, BUILT_IN_STACK_SAVE
))
2572 saved_val
= gimple_call_lhs (stmt
);
2573 if (saved_val
== NULL_TREE
)
2576 insert_clobber_before_stack_restore (saved_val
, var
, &visited
);
2583 /* Detects a __builtin_alloca_with_align with constant size argument. Declares
2584 fixed-size array and returns the address, if found, otherwise returns
2588 fold_builtin_alloca_with_align (gimple
*stmt
)
2590 unsigned HOST_WIDE_INT size
, threshold
, n_elem
;
2591 tree lhs
, arg
, block
, var
, elem_type
, array_type
;
2594 lhs
= gimple_call_lhs (stmt
);
2595 if (lhs
== NULL_TREE
)
2598 /* Detect constant argument. */
2599 arg
= get_constant_value (gimple_call_arg (stmt
, 0));
2600 if (arg
== NULL_TREE
2601 || TREE_CODE (arg
) != INTEGER_CST
2602 || !tree_fits_uhwi_p (arg
))
2605 size
= tree_to_uhwi (arg
);
2607 /* Heuristic: don't fold large allocas. */
2608 threshold
= (unsigned HOST_WIDE_INT
)param_large_stack_frame
;
2609 /* In case the alloca is located at function entry, it has the same lifetime
2610 as a declared array, so we allow a larger size. */
2611 block
= gimple_block (stmt
);
2612 if (!(cfun
->after_inlining
2614 && TREE_CODE (BLOCK_SUPERCONTEXT (block
)) == FUNCTION_DECL
))
2616 if (size
> threshold
)
2619 /* We have to be able to move points-to info. We used to assert
2620 that we can but IPA PTA might end up with two UIDs here
2621 as it might need to handle more than one instance being
2622 live at the same time. Instead of trying to detect this case
2623 (using the first UID would be OK) just give up for now. */
2624 struct ptr_info_def
*pi
= SSA_NAME_PTR_INFO (lhs
);
2628 && !pt_solution_singleton_or_null_p (&pi
->pt
, &uid
))
2631 /* Declare array. */
2632 elem_type
= build_nonstandard_integer_type (BITS_PER_UNIT
, 1);
2633 n_elem
= size
* 8 / BITS_PER_UNIT
;
2634 array_type
= build_array_type_nelts (elem_type
, n_elem
);
2636 if (tree ssa_name
= SSA_NAME_IDENTIFIER (lhs
))
2638 /* Give the temporary a name derived from the name of the VLA
2639 declaration so it can be referenced in diagnostics. */
2640 const char *name
= IDENTIFIER_POINTER (ssa_name
);
2641 var
= create_tmp_var (array_type
, name
);
2644 var
= create_tmp_var (array_type
);
2646 if (gimple
*lhsdef
= SSA_NAME_DEF_STMT (lhs
))
2648 /* Set the temporary's location to that of the VLA declaration
2649 so it can be pointed to in diagnostics. */
2650 location_t loc
= gimple_location (lhsdef
);
2651 DECL_SOURCE_LOCATION (var
) = loc
;
2654 SET_DECL_ALIGN (var
, TREE_INT_CST_LOW (gimple_call_arg (stmt
, 1)));
2656 SET_DECL_PT_UID (var
, uid
);
2658 /* Fold alloca to the address of the array. */
2659 return fold_convert (TREE_TYPE (lhs
), build_fold_addr_expr (var
));
2662 /* Fold the stmt at *GSI with CCP specific information that propagating
2663 and regular folding does not catch. */
2666 ccp_folder::fold_stmt (gimple_stmt_iterator
*gsi
)
2668 gimple
*stmt
= gsi_stmt (*gsi
);
2670 switch (gimple_code (stmt
))
2674 gcond
*cond_stmt
= as_a
<gcond
*> (stmt
);
2675 ccp_prop_value_t val
;
2676 /* Statement evaluation will handle type mismatches in constants
2677 more gracefully than the final propagation. This allows us to
2678 fold more conditionals here. */
2679 val
= evaluate_stmt (stmt
);
2680 if (val
.lattice_val
!= CONSTANT
2686 fprintf (dump_file
, "Folding predicate ");
2687 print_gimple_expr (dump_file
, stmt
, 0);
2688 fprintf (dump_file
, " to ");
2689 print_generic_expr (dump_file
, val
.value
);
2690 fprintf (dump_file
, "\n");
2693 if (integer_zerop (val
.value
))
2694 gimple_cond_make_false (cond_stmt
);
2696 gimple_cond_make_true (cond_stmt
);
2703 tree lhs
= gimple_call_lhs (stmt
);
2704 int flags
= gimple_call_flags (stmt
);
2707 bool changed
= false;
2710 /* If the call was folded into a constant make sure it goes
2711 away even if we cannot propagate into all uses because of
2714 && TREE_CODE (lhs
) == SSA_NAME
2715 && (val
= get_constant_value (lhs
))
2716 /* Don't optimize away calls that have side-effects. */
2717 && (flags
& (ECF_CONST
|ECF_PURE
)) != 0
2718 && (flags
& ECF_LOOPING_CONST_OR_PURE
) == 0)
2720 tree new_rhs
= unshare_expr (val
);
2721 if (!useless_type_conversion_p (TREE_TYPE (lhs
),
2722 TREE_TYPE (new_rhs
)))
2723 new_rhs
= fold_convert (TREE_TYPE (lhs
), new_rhs
);
2724 gimplify_and_update_call_from_tree (gsi
, new_rhs
);
2728 /* Internal calls provide no argument types, so the extra laxity
2729 for normal calls does not apply. */
2730 if (gimple_call_internal_p (stmt
))
2733 /* The heuristic of fold_builtin_alloca_with_align differs before and
2734 after inlining, so we don't require the arg to be changed into a
2735 constant for folding, but just to be constant. */
2736 if (gimple_call_builtin_p (stmt
, BUILT_IN_ALLOCA_WITH_ALIGN
)
2737 || gimple_call_builtin_p (stmt
, BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
))
2739 tree new_rhs
= fold_builtin_alloca_with_align (stmt
);
2742 gimplify_and_update_call_from_tree (gsi
, new_rhs
);
2743 tree var
= TREE_OPERAND (TREE_OPERAND (new_rhs
, 0),0);
2744 insert_clobbers_for_var (*gsi
, var
);
2749 /* If there's no extra info from an assume_aligned call,
2750 drop it so it doesn't act as otherwise useless dataflow
2752 if (gimple_call_builtin_p (stmt
, BUILT_IN_ASSUME_ALIGNED
))
2754 tree ptr
= gimple_call_arg (stmt
, 0);
2755 ccp_prop_value_t ptrval
= get_value_for_expr (ptr
, true);
2756 if (ptrval
.lattice_val
== CONSTANT
2757 && TREE_CODE (ptrval
.value
) == INTEGER_CST
2758 && ptrval
.mask
!= 0)
2760 ccp_prop_value_t val
2761 = bit_value_assume_aligned (stmt
, NULL_TREE
, ptrval
, false);
2762 unsigned int ptralign
= least_bit_hwi (ptrval
.mask
.to_uhwi ());
2763 unsigned int align
= least_bit_hwi (val
.mask
.to_uhwi ());
2764 if (ptralign
== align
2765 && ((TREE_INT_CST_LOW (ptrval
.value
) & (align
- 1))
2766 == (TREE_INT_CST_LOW (val
.value
) & (align
- 1))))
2768 replace_call_with_value (gsi
, ptr
);
2774 /* Propagate into the call arguments. Compared to replace_uses_in
2775 this can use the argument slot types for type verification
2776 instead of the current argument type. We also can safely
2777 drop qualifiers here as we are dealing with constants anyway. */
2778 argt
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
2779 for (i
= 0; i
< gimple_call_num_args (stmt
) && argt
;
2780 ++i
, argt
= TREE_CHAIN (argt
))
2782 tree arg
= gimple_call_arg (stmt
, i
);
2783 if (TREE_CODE (arg
) == SSA_NAME
2784 && (val
= get_constant_value (arg
))
2785 && useless_type_conversion_p
2786 (TYPE_MAIN_VARIANT (TREE_VALUE (argt
)),
2787 TYPE_MAIN_VARIANT (TREE_TYPE (val
))))
2789 gimple_call_set_arg (stmt
, i
, unshare_expr (val
));
2799 tree lhs
= gimple_assign_lhs (stmt
);
2802 /* If we have a load that turned out to be constant replace it
2803 as we cannot propagate into all uses in all cases. */
2804 if (gimple_assign_single_p (stmt
)
2805 && TREE_CODE (lhs
) == SSA_NAME
2806 && (val
= get_constant_value (lhs
)))
2808 tree rhs
= unshare_expr (val
);
2809 if (!useless_type_conversion_p (TREE_TYPE (lhs
), TREE_TYPE (rhs
)))
2810 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (lhs
), rhs
);
2811 gimple_assign_set_rhs_from_tree (gsi
, rhs
);
2823 /* Visit the assignment statement STMT. Set the value of its LHS to the
2824 value computed by the RHS and store LHS in *OUTPUT_P. If STMT
2825 creates virtual definitions, set the value of each new name to that
2826 of the RHS (if we can derive a constant out of the RHS).
2827 Value-returning call statements also perform an assignment, and
2828 are handled here. */
2830 static enum ssa_prop_result
2831 visit_assignment (gimple
*stmt
, tree
*output_p
)
2833 ccp_prop_value_t val
;
2834 enum ssa_prop_result retval
= SSA_PROP_NOT_INTERESTING
;
2836 tree lhs
= gimple_get_lhs (stmt
);
2837 if (TREE_CODE (lhs
) == SSA_NAME
)
2839 /* Evaluate the statement, which could be
2840 either a GIMPLE_ASSIGN or a GIMPLE_CALL. */
2841 val
= evaluate_stmt (stmt
);
2843 /* If STMT is an assignment to an SSA_NAME, we only have one
2845 if (set_lattice_value (lhs
, &val
))
2848 if (val
.lattice_val
== VARYING
)
2849 retval
= SSA_PROP_VARYING
;
2851 retval
= SSA_PROP_INTERESTING
;
2859 /* Visit the conditional statement STMT. Return SSA_PROP_INTERESTING
2860 if it can determine which edge will be taken. Otherwise, return
2861 SSA_PROP_VARYING. */
2863 static enum ssa_prop_result
2864 visit_cond_stmt (gimple
*stmt
, edge
*taken_edge_p
)
2866 ccp_prop_value_t val
;
2869 block
= gimple_bb (stmt
);
2870 val
= evaluate_stmt (stmt
);
2871 if (val
.lattice_val
!= CONSTANT
2873 return SSA_PROP_VARYING
;
2875 /* Find which edge out of the conditional block will be taken and add it
2876 to the worklist. If no single edge can be determined statically,
2877 return SSA_PROP_VARYING to feed all the outgoing edges to the
2878 propagation engine. */
2879 *taken_edge_p
= find_taken_edge (block
, val
.value
);
2881 return SSA_PROP_INTERESTING
;
2883 return SSA_PROP_VARYING
;
2887 /* Evaluate statement STMT. If the statement produces an output value and
2888 its evaluation changes the lattice value of its output, return
2889 SSA_PROP_INTERESTING and set *OUTPUT_P to the SSA_NAME holding the
2892 If STMT is a conditional branch and we can determine its truth
2893 value, set *TAKEN_EDGE_P accordingly. If STMT produces a varying
2894 value, return SSA_PROP_VARYING. */
2896 enum ssa_prop_result
2897 ccp_propagate::visit_stmt (gimple
*stmt
, edge
*taken_edge_p
, tree
*output_p
)
2902 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2904 fprintf (dump_file
, "\nVisiting statement:\n");
2905 print_gimple_stmt (dump_file
, stmt
, 0, dump_flags
);
2908 switch (gimple_code (stmt
))
2911 /* If the statement is an assignment that produces a single
2912 output value, evaluate its RHS to see if the lattice value of
2913 its output has changed. */
2914 return visit_assignment (stmt
, output_p
);
2917 /* A value-returning call also performs an assignment. */
2918 if (gimple_call_lhs (stmt
) != NULL_TREE
)
2919 return visit_assignment (stmt
, output_p
);
2924 /* If STMT is a conditional branch, see if we can determine
2925 which branch will be taken. */
2926 /* FIXME. It appears that we should be able to optimize
2927 computed GOTOs here as well. */
2928 return visit_cond_stmt (stmt
, taken_edge_p
);
2934 /* Any other kind of statement is not interesting for constant
2935 propagation and, therefore, not worth simulating. */
2936 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2937 fprintf (dump_file
, "No interesting values produced. Marked VARYING.\n");
2939 /* Definitions made by statements other than assignments to
2940 SSA_NAMEs represent unknown modifications to their outputs.
2941 Mark them VARYING. */
2942 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, iter
, SSA_OP_ALL_DEFS
)
2943 set_value_varying (def
);
2945 return SSA_PROP_VARYING
;
2949 /* Main entry point for SSA Conditional Constant Propagation. If NONZERO_P,
2950 record nonzero bits. */
2953 do_ssa_ccp (bool nonzero_p
)
2955 unsigned int todo
= 0;
2956 calculate_dominance_info (CDI_DOMINATORS
);
2959 class ccp_propagate ccp_propagate
;
2960 ccp_propagate
.ssa_propagate ();
2961 if (ccp_finalize (nonzero_p
|| flag_ipa_bit_cp
))
2963 todo
= (TODO_cleanup_cfg
| TODO_update_ssa
);
2965 /* ccp_finalize does not preserve loop-closed ssa. */
2966 loops_state_clear (LOOP_CLOSED_SSA
);
2969 free_dominance_info (CDI_DOMINATORS
);
2976 const pass_data pass_data_ccp
=
2978 GIMPLE_PASS
, /* type */
2980 OPTGROUP_NONE
, /* optinfo_flags */
2981 TV_TREE_CCP
, /* tv_id */
2982 ( PROP_cfg
| PROP_ssa
), /* properties_required */
2983 0, /* properties_provided */
2984 0, /* properties_destroyed */
2985 0, /* todo_flags_start */
2986 TODO_update_address_taken
, /* todo_flags_finish */
2989 class pass_ccp
: public gimple_opt_pass
2992 pass_ccp (gcc::context
*ctxt
)
2993 : gimple_opt_pass (pass_data_ccp
, ctxt
), nonzero_p (false)
2996 /* opt_pass methods: */
2997 opt_pass
* clone () { return new pass_ccp (m_ctxt
); }
2998 void set_pass_param (unsigned int n
, bool param
)
3000 gcc_assert (n
== 0);
3003 virtual bool gate (function
*) { return flag_tree_ccp
!= 0; }
3004 virtual unsigned int execute (function
*) { return do_ssa_ccp (nonzero_p
); }
3007 /* Determines whether the pass instance records nonzero bits. */
3009 }; // class pass_ccp
3014 make_pass_ccp (gcc::context
*ctxt
)
3016 return new pass_ccp (ctxt
);
3021 /* Try to optimize out __builtin_stack_restore. Optimize it out
3022 if there is another __builtin_stack_restore in the same basic
3023 block and no calls or ASM_EXPRs are in between, or if this block's
3024 only outgoing edge is to EXIT_BLOCK and there are no calls or
3025 ASM_EXPRs after this __builtin_stack_restore. */
3028 optimize_stack_restore (gimple_stmt_iterator i
)
3033 basic_block bb
= gsi_bb (i
);
3034 gimple
*call
= gsi_stmt (i
);
3036 if (gimple_code (call
) != GIMPLE_CALL
3037 || gimple_call_num_args (call
) != 1
3038 || TREE_CODE (gimple_call_arg (call
, 0)) != SSA_NAME
3039 || !POINTER_TYPE_P (TREE_TYPE (gimple_call_arg (call
, 0))))
3042 for (gsi_next (&i
); !gsi_end_p (i
); gsi_next (&i
))
3044 stmt
= gsi_stmt (i
);
3045 if (gimple_code (stmt
) == GIMPLE_ASM
)
3047 if (gimple_code (stmt
) != GIMPLE_CALL
)
3050 callee
= gimple_call_fndecl (stmt
);
3052 || !fndecl_built_in_p (callee
, BUILT_IN_NORMAL
)
3053 /* All regular builtins are ok, just obviously not alloca. */
3054 || ALLOCA_FUNCTION_CODE_P (DECL_FUNCTION_CODE (callee
)))
3057 if (fndecl_built_in_p (callee
, BUILT_IN_STACK_RESTORE
))
3058 goto second_stack_restore
;
3064 /* Allow one successor of the exit block, or zero successors. */
3065 switch (EDGE_COUNT (bb
->succs
))
3070 if (single_succ_edge (bb
)->dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
3076 second_stack_restore
:
3078 /* If there's exactly one use, then zap the call to __builtin_stack_save.
3079 If there are multiple uses, then the last one should remove the call.
3080 In any case, whether the call to __builtin_stack_save can be removed
3081 or not is irrelevant to removing the call to __builtin_stack_restore. */
3082 if (has_single_use (gimple_call_arg (call
, 0)))
3084 gimple
*stack_save
= SSA_NAME_DEF_STMT (gimple_call_arg (call
, 0));
3085 if (is_gimple_call (stack_save
))
3087 callee
= gimple_call_fndecl (stack_save
);
3088 if (callee
&& fndecl_built_in_p (callee
, BUILT_IN_STACK_SAVE
))
3090 gimple_stmt_iterator stack_save_gsi
;
3093 stack_save_gsi
= gsi_for_stmt (stack_save
);
3094 rhs
= build_int_cst (TREE_TYPE (gimple_call_arg (call
, 0)), 0);
3095 replace_call_with_value (&stack_save_gsi
, rhs
);
3100 /* No effect, so the statement will be deleted. */
3101 return integer_zero_node
;
3104 /* If va_list type is a simple pointer and nothing special is needed,
3105 optimize __builtin_va_start (&ap, 0) into ap = __builtin_next_arg (0),
3106 __builtin_va_end (&ap) out as NOP and __builtin_va_copy into a simple
3107 pointer assignment. */
3110 optimize_stdarg_builtin (gimple
*call
)
3112 tree callee
, lhs
, rhs
, cfun_va_list
;
3113 bool va_list_simple_ptr
;
3114 location_t loc
= gimple_location (call
);
3116 callee
= gimple_call_fndecl (call
);
3118 cfun_va_list
= targetm
.fn_abi_va_list (callee
);
3119 va_list_simple_ptr
= POINTER_TYPE_P (cfun_va_list
)
3120 && (TREE_TYPE (cfun_va_list
) == void_type_node
3121 || TREE_TYPE (cfun_va_list
) == char_type_node
);
3123 switch (DECL_FUNCTION_CODE (callee
))
3125 case BUILT_IN_VA_START
:
3126 if (!va_list_simple_ptr
3127 || targetm
.expand_builtin_va_start
!= NULL
3128 || !builtin_decl_explicit_p (BUILT_IN_NEXT_ARG
))
3131 if (gimple_call_num_args (call
) != 2)
3134 lhs
= gimple_call_arg (call
, 0);
3135 if (!POINTER_TYPE_P (TREE_TYPE (lhs
))
3136 || TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (lhs
)))
3137 != TYPE_MAIN_VARIANT (cfun_va_list
))
3140 lhs
= build_fold_indirect_ref_loc (loc
, lhs
);
3141 rhs
= build_call_expr_loc (loc
, builtin_decl_explicit (BUILT_IN_NEXT_ARG
),
3142 1, integer_zero_node
);
3143 rhs
= fold_convert_loc (loc
, TREE_TYPE (lhs
), rhs
);
3144 return build2 (MODIFY_EXPR
, TREE_TYPE (lhs
), lhs
, rhs
);
3146 case BUILT_IN_VA_COPY
:
3147 if (!va_list_simple_ptr
)
3150 if (gimple_call_num_args (call
) != 2)
3153 lhs
= gimple_call_arg (call
, 0);
3154 if (!POINTER_TYPE_P (TREE_TYPE (lhs
))
3155 || TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (lhs
)))
3156 != TYPE_MAIN_VARIANT (cfun_va_list
))
3159 lhs
= build_fold_indirect_ref_loc (loc
, lhs
);
3160 rhs
= gimple_call_arg (call
, 1);
3161 if (TYPE_MAIN_VARIANT (TREE_TYPE (rhs
))
3162 != TYPE_MAIN_VARIANT (cfun_va_list
))
3165 rhs
= fold_convert_loc (loc
, TREE_TYPE (lhs
), rhs
);
3166 return build2 (MODIFY_EXPR
, TREE_TYPE (lhs
), lhs
, rhs
);
3168 case BUILT_IN_VA_END
:
3169 /* No effect, so the statement will be deleted. */
3170 return integer_zero_node
;
3177 /* Attemp to make the block of __builtin_unreachable I unreachable by changing
3178 the incoming jumps. Return true if at least one jump was changed. */
3181 optimize_unreachable (gimple_stmt_iterator i
)
3183 basic_block bb
= gsi_bb (i
);
3184 gimple_stmt_iterator gsi
;
3190 if (flag_sanitize
& SANITIZE_UNREACHABLE
)
3193 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3195 stmt
= gsi_stmt (gsi
);
3197 if (is_gimple_debug (stmt
))
3200 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
3202 /* Verify we do not need to preserve the label. */
3203 if (FORCED_LABEL (gimple_label_label (label_stmt
)))
3209 /* Only handle the case that __builtin_unreachable is the first statement
3210 in the block. We rely on DCE to remove stmts without side-effects
3211 before __builtin_unreachable. */
3212 if (gsi_stmt (gsi
) != gsi_stmt (i
))
3217 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
3219 gsi
= gsi_last_bb (e
->src
);
3220 if (gsi_end_p (gsi
))
3223 stmt
= gsi_stmt (gsi
);
3224 if (gcond
*cond_stmt
= dyn_cast
<gcond
*> (stmt
))
3226 if (e
->flags
& EDGE_TRUE_VALUE
)
3227 gimple_cond_make_false (cond_stmt
);
3228 else if (e
->flags
& EDGE_FALSE_VALUE
)
3229 gimple_cond_make_true (cond_stmt
);
3232 update_stmt (cond_stmt
);
3236 /* Todo: handle other cases. Note that unreachable switch case
3237 statements have already been removed. */
3248 _1 = __atomic_fetch_or_* (ptr_6, 1, _3);
3252 _1 = __atomic_fetch_or_* (ptr_6, 1, _3);
3256 _1 = __atomic_fetch_and_* (ptr_6, ~1, _3);
3260 _1 = __atomic_fetch_and_* (ptr_6, ~1, _3);
3264 USE_STMT is the gimplt statement which uses the return value of
3265 __atomic_fetch_or_*. LHS is the return value of __atomic_fetch_or_*.
3266 MASK is the mask passed to __atomic_fetch_or_*.
3270 convert_atomic_bit_not (enum internal_fn fn
, gimple
*use_stmt
,
3271 tree lhs
, tree mask
)
3274 if (fn
== IFN_ATOMIC_BIT_TEST_AND_RESET
)
3276 /* MASK must be ~1. */
3277 if (!operand_equal_p (build_int_cst (TREE_TYPE (lhs
),
3278 ~HOST_WIDE_INT_1
), mask
, 0))
3280 and_mask
= build_int_cst (TREE_TYPE (lhs
), 1);
3284 /* MASK must be 1. */
3285 if (!operand_equal_p (build_int_cst (TREE_TYPE (lhs
), 1), mask
, 0))
3290 tree use_lhs
= gimple_assign_lhs (use_stmt
);
3292 use_operand_p use_p
;
3293 gimple
*use_not_stmt
;
3295 if (!single_imm_use (use_lhs
, &use_p
, &use_not_stmt
)
3296 || !is_gimple_assign (use_not_stmt
))
3299 if (!CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (use_not_stmt
)))
3302 tree use_not_lhs
= gimple_assign_lhs (use_not_stmt
);
3303 if (TREE_CODE (TREE_TYPE (use_not_lhs
)) != BOOLEAN_TYPE
)
3306 gimple_stmt_iterator gsi
;
3307 gsi
= gsi_for_stmt (use_stmt
);
3308 gsi_remove (&gsi
, true);
3309 tree var
= make_ssa_name (TREE_TYPE (lhs
));
3310 use_stmt
= gimple_build_assign (var
, BIT_AND_EXPR
, lhs
, and_mask
);
3311 gsi
= gsi_for_stmt (use_not_stmt
);
3312 gsi_insert_before (&gsi
, use_stmt
, GSI_NEW_STMT
);
3313 lhs
= gimple_assign_lhs (use_not_stmt
);
3314 gimple
*g
= gimple_build_assign (lhs
, EQ_EXPR
, var
,
3315 build_zero_cst (TREE_TYPE (mask
)));
3316 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
3317 gsi
= gsi_for_stmt (use_not_stmt
);
3318 gsi_remove (&gsi
, true);
3322 /* match.pd function to match atomic_bit_test_and pattern which
3324 _1 = __atomic_fetch_or_4 (&v, 1, 0);
3328 extern bool gimple_nop_atomic_bit_test_and_p (tree
, tree
*,
3330 extern bool gimple_nop_convert (tree
, tree
*, tree (*) (tree
));
3333 mask_2 = 1 << cnt_1;
3334 _4 = __atomic_fetch_or_* (ptr_6, mask_2, _3);
3337 _4 = .ATOMIC_BIT_TEST_AND_SET (ptr_6, cnt_1, 0, _3);
3339 If _5 is only used in _5 != 0 or _5 == 0 comparisons, 1
3340 is passed instead of 0, and the builtin just returns a zero
3341 or 1 value instead of the actual bit.
3342 Similarly for __sync_fetch_and_or_* (without the ", _3" part
3343 in there), and/or if mask_2 is a power of 2 constant.
3344 Similarly for xor instead of or, use ATOMIC_BIT_TEST_AND_COMPLEMENT
3345 in that case. And similarly for and instead of or, except that
3346 the second argument to the builtin needs to be one's complement
3347 of the mask instead of mask. */
3350 optimize_atomic_bit_test_and (gimple_stmt_iterator
*gsip
,
3351 enum internal_fn fn
, bool has_model_arg
,
3354 gimple
*call
= gsi_stmt (*gsip
);
3355 tree lhs
= gimple_call_lhs (call
);
3356 use_operand_p use_p
;
3361 if (!flag_inline_atomics
3363 || !gimple_call_builtin_p (call
, BUILT_IN_NORMAL
)
3365 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (lhs
)
3366 || !single_imm_use (lhs
, &use_p
, &use_stmt
)
3367 || !is_gimple_assign (use_stmt
)
3368 || !gimple_vdef (call
))
3373 case IFN_ATOMIC_BIT_TEST_AND_SET
:
3374 optab
= atomic_bit_test_and_set_optab
;
3376 case IFN_ATOMIC_BIT_TEST_AND_COMPLEMENT
:
3377 optab
= atomic_bit_test_and_complement_optab
;
3379 case IFN_ATOMIC_BIT_TEST_AND_RESET
:
3380 optab
= atomic_bit_test_and_reset_optab
;
3388 mask
= gimple_call_arg (call
, 1);
3389 tree_code rhs_code
= gimple_assign_rhs_code (use_stmt
);
3390 if (rhs_code
!= BIT_AND_EXPR
)
3392 if (rhs_code
!= NOP_EXPR
&& rhs_code
!= BIT_NOT_EXPR
)
3395 tree use_lhs
= gimple_assign_lhs (use_stmt
);
3396 if (TREE_CODE (use_lhs
) == SSA_NAME
3397 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use_lhs
))
3400 tree use_rhs
= gimple_assign_rhs1 (use_stmt
);
3404 if (optab_handler (optab
, TYPE_MODE (TREE_TYPE (lhs
)))
3405 == CODE_FOR_nothing
)
3409 gimple_stmt_iterator gsi
;
3413 if (rhs_code
== BIT_NOT_EXPR
)
3415 g
= convert_atomic_bit_not (fn
, use_stmt
, lhs
, mask
);
3421 else if (TREE_CODE (TREE_TYPE (use_lhs
)) == BOOLEAN_TYPE
)
3424 if (fn
== IFN_ATOMIC_BIT_TEST_AND_RESET
)
3426 /* MASK must be ~1. */
3427 if (!operand_equal_p (build_int_cst (TREE_TYPE (lhs
),
3433 _1 = __atomic_fetch_and_* (ptr_6, ~1, _3);
3436 _1 = __atomic_fetch_and_* (ptr_6, ~1, _3);
3440 and_mask
= build_int_cst (TREE_TYPE (lhs
), 1);
3444 and_mask
= build_int_cst (TREE_TYPE (lhs
), 1);
3445 if (!operand_equal_p (and_mask
, mask
, 0))
3449 _1 = __atomic_fetch_or_* (ptr_6, 1, _3);
3452 _1 = __atomic_fetch_or_* (ptr_6, 1, _3);
3457 var
= make_ssa_name (TREE_TYPE (use_rhs
));
3458 replace_uses_by (use_rhs
, var
);
3459 g
= gimple_build_assign (var
, BIT_AND_EXPR
, use_rhs
,
3461 gsi
= gsi_for_stmt (use_stmt
);
3462 gsi_insert_before (&gsi
, g
, GSI_NEW_STMT
);
3466 else if (TYPE_PRECISION (TREE_TYPE (use_lhs
))
3467 <= TYPE_PRECISION (TREE_TYPE (use_rhs
)))
3469 gimple
*use_nop_stmt
;
3470 if (!single_imm_use (use_lhs
, &use_p
, &use_nop_stmt
)
3471 || !is_gimple_assign (use_nop_stmt
))
3473 tree use_nop_lhs
= gimple_assign_lhs (use_nop_stmt
);
3474 rhs_code
= gimple_assign_rhs_code (use_nop_stmt
);
3475 if (rhs_code
!= BIT_AND_EXPR
)
3477 if (TREE_CODE (use_nop_lhs
) == SSA_NAME
3478 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use_nop_lhs
))
3480 if (rhs_code
== BIT_NOT_EXPR
)
3482 g
= convert_atomic_bit_not (fn
, use_nop_stmt
, lhs
,
3487 _1 = __atomic_fetch_or_4 (ptr_6, 1, _3);
3492 _1 = __atomic_fetch_or_4 (ptr_6, ~1, _3);
3496 _1 = __atomic_fetch_and_4 (ptr_6, ~1, _3);
3501 _1 = __atomic_fetch_and_4 (ptr_6, 1, _3);
3505 gsi
= gsi_for_stmt (use_stmt
);
3506 gsi_remove (&gsi
, true);
3512 if (TREE_CODE (TREE_TYPE (use_nop_lhs
)) != BOOLEAN_TYPE
)
3514 if (rhs_code
!= GE_EXPR
&& rhs_code
!= LT_EXPR
)
3516 tree cmp_rhs1
= gimple_assign_rhs1 (use_nop_stmt
);
3517 if (use_lhs
!= cmp_rhs1
)
3519 tree cmp_rhs2
= gimple_assign_rhs2 (use_nop_stmt
);
3520 if (!integer_zerop (cmp_rhs2
))
3525 unsigned HOST_WIDE_INT bytes
3526 = tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (use_rhs
)));
3527 ibit
= bytes
* BITS_PER_UNIT
- 1;
3528 unsigned HOST_WIDE_INT highest
3529 = HOST_WIDE_INT_1U
<< ibit
;
3531 if (fn
== IFN_ATOMIC_BIT_TEST_AND_RESET
)
3533 /* Get the signed maximum of the USE_RHS type. */
3534 and_mask
= build_int_cst (TREE_TYPE (use_rhs
),
3536 if (!operand_equal_p (and_mask
, mask
, 0))
3540 _1 = __atomic_fetch_and_4 (ptr_6, 0x7fffffff, _3);
3541 _5 = (signed int) _1;
3542 _4 = _5 < 0 or _5 >= 0;
3544 _1 = __atomic_fetch_and_4 (ptr_6, 0x7fffffff, _3);
3545 _6 = _1 & 0x80000000;
3546 _4 = _6 != 0 or _6 == 0;
3548 and_mask
= build_int_cst (TREE_TYPE (use_rhs
),
3553 /* Get the signed minimum of the USE_RHS type. */
3554 and_mask
= build_int_cst (TREE_TYPE (use_rhs
),
3556 if (!operand_equal_p (and_mask
, mask
, 0))
3560 _1 = __atomic_fetch_or_4 (ptr_6, 0x80000000, _3);
3561 _5 = (signed int) _1;
3562 _4 = _5 < 0 or _5 >= 0;
3564 _1 = __atomic_fetch_or_4 (ptr_6, 0x80000000, _3);
3565 _6 = _1 & 0x80000000;
3566 _4 = _6 != 0 or _6 == 0;
3569 var
= make_ssa_name (TREE_TYPE (use_rhs
));
3570 gsi
= gsi_for_stmt (use_stmt
);
3571 gsi_remove (&gsi
, true);
3572 g
= gimple_build_assign (var
, BIT_AND_EXPR
, use_rhs
,
3574 gsi
= gsi_for_stmt (use_nop_stmt
);
3575 gsi_insert_before (&gsi
, g
, GSI_NEW_STMT
);
3577 g
= gimple_build_assign (use_nop_lhs
,
3578 (rhs_code
== GE_EXPR
3579 ? EQ_EXPR
: NE_EXPR
),
3581 build_zero_cst (TREE_TYPE (use_rhs
)));
3582 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
3583 gsi
= gsi_for_stmt (use_nop_stmt
);
3584 gsi_remove (&gsi
, true);
3591 if (!gimple_nop_atomic_bit_test_and_p (use_nop_lhs
,
3593 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (match_op
[2])
3594 || !single_imm_use (match_op
[2], &use_p
, &g
)
3595 || !is_gimple_assign (g
))
3598 if (TREE_CODE (match_op
[1]) == INTEGER_CST
)
3600 ibit
= tree_log2 (match_op
[1]);
3601 gcc_assert (ibit
>= 0);
3605 g
= SSA_NAME_DEF_STMT (match_op
[1]);
3606 gcc_assert (is_gimple_assign (g
));
3607 bit
= gimple_assign_rhs2 (g
);
3610 _1 = __atomic_fetch_or_4 (ptr_6, mask, _3);
3614 _1 = __atomic_fetch_or_4 (ptr_6, mask, _3);
3619 _2 = (unsigned int) _1;
3620 _3 = __atomic_fetch_and_4 (ptr_6, _2, 0);
3624 _1 = __atomic_fetch_and_* (ptr_6, ~mask_7, _3);
3629 _1 = __atomic_fetch_and_4 (ptr_6, ~mask, _3);
3630 _2 = (short int) _1;
3633 _1 = __atomic_fetch_and_4 (ptr_6, ~mask, _3);
3635 _5 = (short int) _8;
3637 gimple_seq stmts
= NULL
;
3638 match_op
[1] = gimple_convert (&stmts
,
3639 TREE_TYPE (use_rhs
),
3641 var
= gimple_build (&stmts
, BIT_AND_EXPR
,
3642 TREE_TYPE (use_rhs
), use_rhs
, match_op
[1]);
3643 gsi
= gsi_for_stmt (use_stmt
);
3644 gsi_remove (&gsi
, true);
3645 release_defs (use_stmt
);
3646 use_stmt
= gimple_seq_last_stmt (stmts
);
3647 gsi
= gsi_for_stmt (use_nop_stmt
);
3648 gsi_insert_seq_before (&gsi
, stmts
, GSI_SAME_STMT
);
3649 gimple_assign_set_rhs_with_ops (&gsi
, CONVERT_EXPR
, var
);
3650 update_stmt (use_nop_stmt
);
3660 bit
= build_int_cst (TREE_TYPE (lhs
), ibit
);
3663 else if (optab_handler (optab
, TYPE_MODE (TREE_TYPE (lhs
)))
3664 == CODE_FOR_nothing
)
3667 tree use_lhs
= gimple_assign_lhs (use_stmt
);
3673 if (TREE_CODE (mask
) == INTEGER_CST
)
3675 if (fn
== IFN_ATOMIC_BIT_TEST_AND_RESET
)
3676 mask
= const_unop (BIT_NOT_EXPR
, TREE_TYPE (mask
), mask
);
3677 mask
= fold_convert (TREE_TYPE (lhs
), mask
);
3678 int ibit
= tree_log2 (mask
);
3681 bit
= build_int_cst (TREE_TYPE (lhs
), ibit
);
3683 else if (TREE_CODE (mask
) == SSA_NAME
)
3685 gimple
*g
= SSA_NAME_DEF_STMT (mask
);
3687 if (gimple_nop_convert (mask
, &match_op
, NULL
))
3690 if (TREE_CODE (mask
) != SSA_NAME
)
3692 g
= SSA_NAME_DEF_STMT (mask
);
3694 if (!is_gimple_assign (g
))
3697 if (fn
== IFN_ATOMIC_BIT_TEST_AND_RESET
)
3699 if (gimple_assign_rhs_code (g
) != BIT_NOT_EXPR
)
3701 mask
= gimple_assign_rhs1 (g
);
3702 if (TREE_CODE (mask
) != SSA_NAME
)
3704 g
= SSA_NAME_DEF_STMT (mask
);
3707 if (!is_gimple_assign (g
)
3708 || gimple_assign_rhs_code (g
) != LSHIFT_EXPR
3709 || !integer_onep (gimple_assign_rhs1 (g
)))
3711 bit
= gimple_assign_rhs2 (g
);
3717 if (gimple_assign_rhs1 (use_stmt
) == lhs
)
3718 cmp_mask
= gimple_assign_rhs2 (use_stmt
);
3720 cmp_mask
= gimple_assign_rhs1 (use_stmt
);
3723 if (gimple_nop_convert (cmp_mask
, &match_op
, NULL
))
3724 cmp_mask
= match_op
;
3726 if (!operand_equal_p (cmp_mask
, mask
, 0))
3730 bool use_bool
= true;
3731 bool has_debug_uses
= false;
3732 imm_use_iterator iter
;
3735 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use_lhs
))
3737 FOR_EACH_IMM_USE_STMT (g
, iter
, use_lhs
)
3739 enum tree_code code
= ERROR_MARK
;
3740 tree op0
= NULL_TREE
, op1
= NULL_TREE
;
3741 if (is_gimple_debug (g
))
3743 has_debug_uses
= true;
3746 else if (is_gimple_assign (g
))
3747 switch (gimple_assign_rhs_code (g
))
3750 op1
= gimple_assign_rhs1 (g
);
3751 code
= TREE_CODE (op1
);
3752 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
3754 op0
= TREE_OPERAND (op1
, 0);
3755 op1
= TREE_OPERAND (op1
, 1);
3759 code
= gimple_assign_rhs_code (g
);
3760 op0
= gimple_assign_rhs1 (g
);
3761 op1
= gimple_assign_rhs2 (g
);
3766 else if (gimple_code (g
) == GIMPLE_COND
)
3768 code
= gimple_cond_code (g
);
3769 op0
= gimple_cond_lhs (g
);
3770 op1
= gimple_cond_rhs (g
);
3773 if ((code
== EQ_EXPR
|| code
== NE_EXPR
)
3775 && integer_zerop (op1
))
3777 use_operand_p use_p
;
3779 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
3789 tree new_lhs
= make_ssa_name (TREE_TYPE (lhs
));
3790 tree flag
= build_int_cst (TREE_TYPE (lhs
), use_bool
);
3792 g
= gimple_build_call_internal (fn
, 4, gimple_call_arg (call
, 0),
3793 bit
, flag
, gimple_call_arg (call
, 2));
3795 g
= gimple_build_call_internal (fn
, 3, gimple_call_arg (call
, 0),
3797 gimple_call_set_lhs (g
, new_lhs
);
3798 gimple_set_location (g
, gimple_location (call
));
3799 gimple_move_vops (g
, call
);
3800 bool throws
= stmt_can_throw_internal (cfun
, call
);
3801 gimple_call_set_nothrow (as_a
<gcall
*> (g
),
3802 gimple_call_nothrow_p (as_a
<gcall
*> (call
)));
3803 gimple_stmt_iterator gsi
= *gsip
;
3804 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
3808 maybe_clean_or_replace_eh_stmt (call
, g
);
3809 if (after
|| (use_bool
&& has_debug_uses
))
3810 e
= find_fallthru_edge (gsi_bb (gsi
)->succs
);
3814 /* The internal function returns the value of the specified bit
3815 before the atomic operation. If we are interested in the value
3816 of the specified bit after the atomic operation (makes only sense
3817 for xor, otherwise the bit content is compile time known),
3818 we need to invert the bit. */
3819 tree mask_convert
= mask
;
3820 gimple_seq stmts
= NULL
;
3822 mask_convert
= gimple_convert (&stmts
, TREE_TYPE (lhs
), mask
);
3823 new_lhs
= gimple_build (&stmts
, BIT_XOR_EXPR
, TREE_TYPE (lhs
), new_lhs
,
3824 use_bool
? build_int_cst (TREE_TYPE (lhs
), 1)
3828 gsi_insert_seq_on_edge_immediate (e
, stmts
);
3829 gsi
= gsi_for_stmt (gimple_seq_last (stmts
));
3832 gsi_insert_seq_after (&gsi
, stmts
, GSI_NEW_STMT
);
3834 if (use_bool
&& has_debug_uses
)
3836 tree temp
= NULL_TREE
;
3837 if (!throws
|| after
|| single_pred_p (e
->dest
))
3839 temp
= build_debug_expr_decl (TREE_TYPE (lhs
));
3840 tree t
= build2 (LSHIFT_EXPR
, TREE_TYPE (lhs
), new_lhs
, bit
);
3841 g
= gimple_build_debug_bind (temp
, t
, g
);
3842 if (throws
&& !after
)
3844 gsi
= gsi_after_labels (e
->dest
);
3845 gsi_insert_before (&gsi
, g
, GSI_SAME_STMT
);
3848 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
3850 FOR_EACH_IMM_USE_STMT (g
, iter
, use_lhs
)
3851 if (is_gimple_debug (g
))
3853 use_operand_p use_p
;
3854 if (temp
== NULL_TREE
)
3855 gimple_debug_bind_reset_value (g
);
3857 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
3858 SET_USE (use_p
, temp
);
3862 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_lhs
)
3863 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use_lhs
);
3864 replace_uses_by (use_lhs
, new_lhs
);
3865 gsi
= gsi_for_stmt (use_stmt
);
3866 gsi_remove (&gsi
, true);
3867 release_defs (use_stmt
);
3868 gsi_remove (gsip
, true);
3869 release_ssa_name (lhs
);
3874 _4 = __atomic_add_fetch_* (ptr_6, arg_2, _3);
3877 _4 = .ATOMIC_ADD_FETCH_CMP_0 (EQ_EXPR, ptr_6, arg_2, _3);
3879 Similarly for __sync_add_and_fetch_* (without the ", _3" part
3883 optimize_atomic_op_fetch_cmp_0 (gimple_stmt_iterator
*gsip
,
3884 enum internal_fn fn
, bool has_model_arg
)
3886 gimple
*call
= gsi_stmt (*gsip
);
3887 tree lhs
= gimple_call_lhs (call
);
3888 use_operand_p use_p
;
3891 if (!flag_inline_atomics
3893 || !gimple_call_builtin_p (call
, BUILT_IN_NORMAL
)
3895 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (lhs
)
3896 || !single_imm_use (lhs
, &use_p
, &use_stmt
)
3897 || !gimple_vdef (call
))
3903 case IFN_ATOMIC_ADD_FETCH_CMP_0
:
3904 optab
= atomic_add_fetch_cmp_0_optab
;
3906 case IFN_ATOMIC_SUB_FETCH_CMP_0
:
3907 optab
= atomic_sub_fetch_cmp_0_optab
;
3909 case IFN_ATOMIC_AND_FETCH_CMP_0
:
3910 optab
= atomic_and_fetch_cmp_0_optab
;
3912 case IFN_ATOMIC_OR_FETCH_CMP_0
:
3913 optab
= atomic_or_fetch_cmp_0_optab
;
3915 case IFN_ATOMIC_XOR_FETCH_CMP_0
:
3916 optab
= atomic_xor_fetch_cmp_0_optab
;
3922 if (optab_handler (optab
, TYPE_MODE (TREE_TYPE (lhs
)))
3923 == CODE_FOR_nothing
)
3927 if (gimple_assign_cast_p (use_stmt
))
3929 use_lhs
= gimple_assign_lhs (use_stmt
);
3930 if (!tree_nop_conversion_p (TREE_TYPE (use_lhs
), TREE_TYPE (lhs
))
3931 || (!INTEGRAL_TYPE_P (TREE_TYPE (use_lhs
))
3932 && !POINTER_TYPE_P (TREE_TYPE (use_lhs
)))
3933 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use_lhs
)
3934 || !single_imm_use (use_lhs
, &use_p
, &use_stmt
))
3937 enum tree_code code
= ERROR_MARK
;
3938 tree op0
= NULL_TREE
, op1
= NULL_TREE
;
3939 if (is_gimple_assign (use_stmt
))
3940 switch (gimple_assign_rhs_code (use_stmt
))
3943 op1
= gimple_assign_rhs1 (use_stmt
);
3944 code
= TREE_CODE (op1
);
3945 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
3947 op0
= TREE_OPERAND (op1
, 0);
3948 op1
= TREE_OPERAND (op1
, 1);
3952 code
= gimple_assign_rhs_code (use_stmt
);
3953 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
3955 op0
= gimple_assign_rhs1 (use_stmt
);
3956 op1
= gimple_assign_rhs2 (use_stmt
);
3960 else if (gimple_code (use_stmt
) == GIMPLE_COND
)
3962 code
= gimple_cond_code (use_stmt
);
3963 op0
= gimple_cond_lhs (use_stmt
);
3964 op1
= gimple_cond_rhs (use_stmt
);
3973 if (!INTEGRAL_TYPE_P (TREE_TYPE (use_lhs
))
3974 || TREE_CODE (TREE_TYPE (use_lhs
)) == BOOLEAN_TYPE
3975 || TYPE_UNSIGNED (TREE_TYPE (use_lhs
)))
3980 if (op0
== use_lhs
&& integer_zerop (op1
))
3990 /* Use special encoding of the operation. We want to also
3991 encode the mode in the first argument and for neither EQ_EXPR
3992 etc. nor EQ etc. we can rely it will fit into QImode. */
3993 case EQ_EXPR
: encoded
= ATOMIC_OP_FETCH_CMP_0_EQ
; break;
3994 case NE_EXPR
: encoded
= ATOMIC_OP_FETCH_CMP_0_NE
; break;
3995 case LT_EXPR
: encoded
= ATOMIC_OP_FETCH_CMP_0_LT
; break;
3996 case LE_EXPR
: encoded
= ATOMIC_OP_FETCH_CMP_0_LE
; break;
3997 case GT_EXPR
: encoded
= ATOMIC_OP_FETCH_CMP_0_GT
; break;
3998 case GE_EXPR
: encoded
= ATOMIC_OP_FETCH_CMP_0_GE
; break;
3999 default: gcc_unreachable ();
4002 tree new_lhs
= make_ssa_name (boolean_type_node
);
4004 tree flag
= build_int_cst (TREE_TYPE (lhs
), encoded
);
4006 g
= gimple_build_call_internal (fn
, 4, flag
,
4007 gimple_call_arg (call
, 0),
4008 gimple_call_arg (call
, 1),
4009 gimple_call_arg (call
, 2));
4011 g
= gimple_build_call_internal (fn
, 3, flag
,
4012 gimple_call_arg (call
, 0),
4013 gimple_call_arg (call
, 1));
4014 gimple_call_set_lhs (g
, new_lhs
);
4015 gimple_set_location (g
, gimple_location (call
));
4016 gimple_move_vops (g
, call
);
4017 bool throws
= stmt_can_throw_internal (cfun
, call
);
4018 gimple_call_set_nothrow (as_a
<gcall
*> (g
),
4019 gimple_call_nothrow_p (as_a
<gcall
*> (call
)));
4020 gimple_stmt_iterator gsi
= *gsip
;
4021 gsi_insert_after (&gsi
, g
, GSI_SAME_STMT
);
4023 maybe_clean_or_replace_eh_stmt (call
, g
);
4024 if (is_gimple_assign (use_stmt
))
4025 switch (gimple_assign_rhs_code (use_stmt
))
4028 gimple_assign_set_rhs1 (use_stmt
, new_lhs
);
4031 gsi
= gsi_for_stmt (use_stmt
);
4032 if (tree ulhs
= gimple_assign_lhs (use_stmt
))
4033 if (useless_type_conversion_p (TREE_TYPE (ulhs
),
4036 gimple_assign_set_rhs_with_ops (&gsi
, SSA_NAME
, new_lhs
);
4039 gimple_assign_set_rhs_with_ops (&gsi
, NOP_EXPR
, new_lhs
);
4042 else if (gimple_code (use_stmt
) == GIMPLE_COND
)
4044 gcond
*use_cond
= as_a
<gcond
*> (use_stmt
);
4045 gimple_cond_set_code (use_cond
, NE_EXPR
);
4046 gimple_cond_set_lhs (use_cond
, new_lhs
);
4047 gimple_cond_set_rhs (use_cond
, boolean_false_node
);
4050 update_stmt (use_stmt
);
4053 gsi
= gsi_for_stmt (SSA_NAME_DEF_STMT (use_lhs
));
4054 gsi_remove (&gsi
, true);
4055 release_ssa_name (use_lhs
);
4057 gsi_remove (gsip
, true);
4058 release_ssa_name (lhs
);
4068 Similarly for memset (&a, ..., sizeof (a)); instead of a = {};
4069 and/or memcpy (&b, &a, sizeof (a)); instead of b = a; */
4072 optimize_memcpy (gimple_stmt_iterator
*gsip
, tree dest
, tree src
, tree len
)
4074 gimple
*stmt
= gsi_stmt (*gsip
);
4075 if (gimple_has_volatile_ops (stmt
))
4078 tree vuse
= gimple_vuse (stmt
);
4082 gimple
*defstmt
= SSA_NAME_DEF_STMT (vuse
);
4083 tree src2
= NULL_TREE
, len2
= NULL_TREE
;
4084 poly_int64 offset
, offset2
;
4085 tree val
= integer_zero_node
;
4086 if (gimple_store_p (defstmt
)
4087 && gimple_assign_single_p (defstmt
)
4088 && TREE_CODE (gimple_assign_rhs1 (defstmt
)) == CONSTRUCTOR
4089 && !gimple_clobber_p (defstmt
))
4090 src2
= gimple_assign_lhs (defstmt
);
4091 else if (gimple_call_builtin_p (defstmt
, BUILT_IN_MEMSET
)
4092 && TREE_CODE (gimple_call_arg (defstmt
, 0)) == ADDR_EXPR
4093 && TREE_CODE (gimple_call_arg (defstmt
, 1)) == INTEGER_CST
)
4095 src2
= TREE_OPERAND (gimple_call_arg (defstmt
, 0), 0);
4096 len2
= gimple_call_arg (defstmt
, 2);
4097 val
= gimple_call_arg (defstmt
, 1);
4098 /* For non-0 val, we'd have to transform stmt from assignment
4099 into memset (only if dest is addressable). */
4100 if (!integer_zerop (val
) && is_gimple_assign (stmt
))
4104 if (src2
== NULL_TREE
)
4107 if (len
== NULL_TREE
)
4108 len
= (TREE_CODE (src
) == COMPONENT_REF
4109 ? DECL_SIZE_UNIT (TREE_OPERAND (src
, 1))
4110 : TYPE_SIZE_UNIT (TREE_TYPE (src
)));
4111 if (len2
== NULL_TREE
)
4112 len2
= (TREE_CODE (src2
) == COMPONENT_REF
4113 ? DECL_SIZE_UNIT (TREE_OPERAND (src2
, 1))
4114 : TYPE_SIZE_UNIT (TREE_TYPE (src2
)));
4115 if (len
== NULL_TREE
4116 || !poly_int_tree_p (len
)
4117 || len2
== NULL_TREE
4118 || !poly_int_tree_p (len2
))
4121 src
= get_addr_base_and_unit_offset (src
, &offset
);
4122 src2
= get_addr_base_and_unit_offset (src2
, &offset2
);
4123 if (src
== NULL_TREE
4124 || src2
== NULL_TREE
4125 || maybe_lt (offset
, offset2
))
4128 if (!operand_equal_p (src
, src2
, 0))
4131 /* [ src + offset2, src + offset2 + len2 - 1 ] is set to val.
4133 [ src + offset, src + offset + len - 1 ] is a subset of that. */
4134 if (maybe_gt (wi::to_poly_offset (len
) + (offset
- offset2
),
4135 wi::to_poly_offset (len2
)))
4138 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4140 fprintf (dump_file
, "Simplified\n ");
4141 print_gimple_stmt (dump_file
, stmt
, 0, dump_flags
);
4142 fprintf (dump_file
, "after previous\n ");
4143 print_gimple_stmt (dump_file
, defstmt
, 0, dump_flags
);
4146 /* For simplicity, don't change the kind of the stmt,
4147 turn dest = src; into dest = {}; and memcpy (&dest, &src, len);
4148 into memset (&dest, val, len);
4149 In theory we could change dest = src into memset if dest
4150 is addressable (maybe beneficial if val is not 0), or
4151 memcpy (&dest, &src, len) into dest = {} if len is the size
4152 of dest, dest isn't volatile. */
4153 if (is_gimple_assign (stmt
))
4155 tree ctor
= build_constructor (TREE_TYPE (dest
), NULL
);
4156 gimple_assign_set_rhs_from_tree (gsip
, ctor
);
4159 else /* If stmt is memcpy, transform it into memset. */
4161 gcall
*call
= as_a
<gcall
*> (stmt
);
4162 tree fndecl
= builtin_decl_implicit (BUILT_IN_MEMSET
);
4163 gimple_call_set_fndecl (call
, fndecl
);
4164 gimple_call_set_fntype (call
, TREE_TYPE (fndecl
));
4165 gimple_call_set_arg (call
, 1, val
);
4169 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4171 fprintf (dump_file
, "into\n ");
4172 print_gimple_stmt (dump_file
, stmt
, 0, dump_flags
);
4176 /* A simple pass that attempts to fold all builtin functions. This pass
4177 is run after we've propagated as many constants as we can. */
4181 const pass_data pass_data_fold_builtins
=
4183 GIMPLE_PASS
, /* type */
4185 OPTGROUP_NONE
, /* optinfo_flags */
4186 TV_NONE
, /* tv_id */
4187 ( PROP_cfg
| PROP_ssa
), /* properties_required */
4188 0, /* properties_provided */
4189 0, /* properties_destroyed */
4190 0, /* todo_flags_start */
4191 TODO_update_ssa
, /* todo_flags_finish */
4194 class pass_fold_builtins
: public gimple_opt_pass
4197 pass_fold_builtins (gcc::context
*ctxt
)
4198 : gimple_opt_pass (pass_data_fold_builtins
, ctxt
)
4201 /* opt_pass methods: */
4202 opt_pass
* clone () { return new pass_fold_builtins (m_ctxt
); }
4203 virtual unsigned int execute (function
*);
4205 }; // class pass_fold_builtins
4208 pass_fold_builtins::execute (function
*fun
)
4210 bool cfg_changed
= false;
4212 unsigned int todoflags
= 0;
4214 FOR_EACH_BB_FN (bb
, fun
)
4216 gimple_stmt_iterator i
;
4217 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
4219 gimple
*stmt
, *old_stmt
;
4221 enum built_in_function fcode
;
4223 stmt
= gsi_stmt (i
);
4225 if (gimple_code (stmt
) != GIMPLE_CALL
)
4227 /* Remove all *ssaname_N ={v} {CLOBBER}; stmts,
4228 after the last GIMPLE DSE they aren't needed and might
4229 unnecessarily keep the SSA_NAMEs live. */
4230 if (gimple_clobber_p (stmt
))
4232 tree lhs
= gimple_assign_lhs (stmt
);
4233 if (TREE_CODE (lhs
) == MEM_REF
4234 && TREE_CODE (TREE_OPERAND (lhs
, 0)) == SSA_NAME
)
4236 unlink_stmt_vdef (stmt
);
4237 gsi_remove (&i
, true);
4238 release_defs (stmt
);
4242 else if (gimple_assign_load_p (stmt
) && gimple_store_p (stmt
))
4243 optimize_memcpy (&i
, gimple_assign_lhs (stmt
),
4244 gimple_assign_rhs1 (stmt
), NULL_TREE
);
4249 callee
= gimple_call_fndecl (stmt
);
4250 if (!callee
|| !fndecl_built_in_p (callee
, BUILT_IN_NORMAL
))
4256 fcode
= DECL_FUNCTION_CODE (callee
);
4261 tree result
= NULL_TREE
;
4262 switch (DECL_FUNCTION_CODE (callee
))
4264 case BUILT_IN_CONSTANT_P
:
4265 /* Resolve __builtin_constant_p. If it hasn't been
4266 folded to integer_one_node by now, it's fairly
4267 certain that the value simply isn't constant. */
4268 result
= integer_zero_node
;
4271 case BUILT_IN_ASSUME_ALIGNED
:
4272 /* Remove __builtin_assume_aligned. */
4273 result
= gimple_call_arg (stmt
, 0);
4276 case BUILT_IN_STACK_RESTORE
:
4277 result
= optimize_stack_restore (i
);
4283 case BUILT_IN_UNREACHABLE
:
4284 if (optimize_unreachable (i
))
4288 case BUILT_IN_ATOMIC_ADD_FETCH_1
:
4289 case BUILT_IN_ATOMIC_ADD_FETCH_2
:
4290 case BUILT_IN_ATOMIC_ADD_FETCH_4
:
4291 case BUILT_IN_ATOMIC_ADD_FETCH_8
:
4292 case BUILT_IN_ATOMIC_ADD_FETCH_16
:
4293 optimize_atomic_op_fetch_cmp_0 (&i
,
4294 IFN_ATOMIC_ADD_FETCH_CMP_0
,
4297 case BUILT_IN_SYNC_ADD_AND_FETCH_1
:
4298 case BUILT_IN_SYNC_ADD_AND_FETCH_2
:
4299 case BUILT_IN_SYNC_ADD_AND_FETCH_4
:
4300 case BUILT_IN_SYNC_ADD_AND_FETCH_8
:
4301 case BUILT_IN_SYNC_ADD_AND_FETCH_16
:
4302 optimize_atomic_op_fetch_cmp_0 (&i
,
4303 IFN_ATOMIC_ADD_FETCH_CMP_0
,
4307 case BUILT_IN_ATOMIC_SUB_FETCH_1
:
4308 case BUILT_IN_ATOMIC_SUB_FETCH_2
:
4309 case BUILT_IN_ATOMIC_SUB_FETCH_4
:
4310 case BUILT_IN_ATOMIC_SUB_FETCH_8
:
4311 case BUILT_IN_ATOMIC_SUB_FETCH_16
:
4312 optimize_atomic_op_fetch_cmp_0 (&i
,
4313 IFN_ATOMIC_SUB_FETCH_CMP_0
,
4316 case BUILT_IN_SYNC_SUB_AND_FETCH_1
:
4317 case BUILT_IN_SYNC_SUB_AND_FETCH_2
:
4318 case BUILT_IN_SYNC_SUB_AND_FETCH_4
:
4319 case BUILT_IN_SYNC_SUB_AND_FETCH_8
:
4320 case BUILT_IN_SYNC_SUB_AND_FETCH_16
:
4321 optimize_atomic_op_fetch_cmp_0 (&i
,
4322 IFN_ATOMIC_SUB_FETCH_CMP_0
,
4326 case BUILT_IN_ATOMIC_FETCH_OR_1
:
4327 case BUILT_IN_ATOMIC_FETCH_OR_2
:
4328 case BUILT_IN_ATOMIC_FETCH_OR_4
:
4329 case BUILT_IN_ATOMIC_FETCH_OR_8
:
4330 case BUILT_IN_ATOMIC_FETCH_OR_16
:
4331 optimize_atomic_bit_test_and (&i
,
4332 IFN_ATOMIC_BIT_TEST_AND_SET
,
4335 case BUILT_IN_SYNC_FETCH_AND_OR_1
:
4336 case BUILT_IN_SYNC_FETCH_AND_OR_2
:
4337 case BUILT_IN_SYNC_FETCH_AND_OR_4
:
4338 case BUILT_IN_SYNC_FETCH_AND_OR_8
:
4339 case BUILT_IN_SYNC_FETCH_AND_OR_16
:
4340 optimize_atomic_bit_test_and (&i
,
4341 IFN_ATOMIC_BIT_TEST_AND_SET
,
4345 case BUILT_IN_ATOMIC_FETCH_XOR_1
:
4346 case BUILT_IN_ATOMIC_FETCH_XOR_2
:
4347 case BUILT_IN_ATOMIC_FETCH_XOR_4
:
4348 case BUILT_IN_ATOMIC_FETCH_XOR_8
:
4349 case BUILT_IN_ATOMIC_FETCH_XOR_16
:
4350 optimize_atomic_bit_test_and
4351 (&i
, IFN_ATOMIC_BIT_TEST_AND_COMPLEMENT
, true, false);
4353 case BUILT_IN_SYNC_FETCH_AND_XOR_1
:
4354 case BUILT_IN_SYNC_FETCH_AND_XOR_2
:
4355 case BUILT_IN_SYNC_FETCH_AND_XOR_4
:
4356 case BUILT_IN_SYNC_FETCH_AND_XOR_8
:
4357 case BUILT_IN_SYNC_FETCH_AND_XOR_16
:
4358 optimize_atomic_bit_test_and
4359 (&i
, IFN_ATOMIC_BIT_TEST_AND_COMPLEMENT
, false, false);
4362 case BUILT_IN_ATOMIC_XOR_FETCH_1
:
4363 case BUILT_IN_ATOMIC_XOR_FETCH_2
:
4364 case BUILT_IN_ATOMIC_XOR_FETCH_4
:
4365 case BUILT_IN_ATOMIC_XOR_FETCH_8
:
4366 case BUILT_IN_ATOMIC_XOR_FETCH_16
:
4367 if (optimize_atomic_bit_test_and
4368 (&i
, IFN_ATOMIC_BIT_TEST_AND_COMPLEMENT
, true, true))
4370 optimize_atomic_op_fetch_cmp_0 (&i
,
4371 IFN_ATOMIC_XOR_FETCH_CMP_0
,
4374 case BUILT_IN_SYNC_XOR_AND_FETCH_1
:
4375 case BUILT_IN_SYNC_XOR_AND_FETCH_2
:
4376 case BUILT_IN_SYNC_XOR_AND_FETCH_4
:
4377 case BUILT_IN_SYNC_XOR_AND_FETCH_8
:
4378 case BUILT_IN_SYNC_XOR_AND_FETCH_16
:
4379 if (optimize_atomic_bit_test_and
4380 (&i
, IFN_ATOMIC_BIT_TEST_AND_COMPLEMENT
, false, true))
4382 optimize_atomic_op_fetch_cmp_0 (&i
,
4383 IFN_ATOMIC_XOR_FETCH_CMP_0
,
4387 case BUILT_IN_ATOMIC_FETCH_AND_1
:
4388 case BUILT_IN_ATOMIC_FETCH_AND_2
:
4389 case BUILT_IN_ATOMIC_FETCH_AND_4
:
4390 case BUILT_IN_ATOMIC_FETCH_AND_8
:
4391 case BUILT_IN_ATOMIC_FETCH_AND_16
:
4392 optimize_atomic_bit_test_and (&i
,
4393 IFN_ATOMIC_BIT_TEST_AND_RESET
,
4396 case BUILT_IN_SYNC_FETCH_AND_AND_1
:
4397 case BUILT_IN_SYNC_FETCH_AND_AND_2
:
4398 case BUILT_IN_SYNC_FETCH_AND_AND_4
:
4399 case BUILT_IN_SYNC_FETCH_AND_AND_8
:
4400 case BUILT_IN_SYNC_FETCH_AND_AND_16
:
4401 optimize_atomic_bit_test_and (&i
,
4402 IFN_ATOMIC_BIT_TEST_AND_RESET
,
4406 case BUILT_IN_ATOMIC_AND_FETCH_1
:
4407 case BUILT_IN_ATOMIC_AND_FETCH_2
:
4408 case BUILT_IN_ATOMIC_AND_FETCH_4
:
4409 case BUILT_IN_ATOMIC_AND_FETCH_8
:
4410 case BUILT_IN_ATOMIC_AND_FETCH_16
:
4411 optimize_atomic_op_fetch_cmp_0 (&i
,
4412 IFN_ATOMIC_AND_FETCH_CMP_0
,
4415 case BUILT_IN_SYNC_AND_AND_FETCH_1
:
4416 case BUILT_IN_SYNC_AND_AND_FETCH_2
:
4417 case BUILT_IN_SYNC_AND_AND_FETCH_4
:
4418 case BUILT_IN_SYNC_AND_AND_FETCH_8
:
4419 case BUILT_IN_SYNC_AND_AND_FETCH_16
:
4420 optimize_atomic_op_fetch_cmp_0 (&i
,
4421 IFN_ATOMIC_AND_FETCH_CMP_0
,
4425 case BUILT_IN_ATOMIC_OR_FETCH_1
:
4426 case BUILT_IN_ATOMIC_OR_FETCH_2
:
4427 case BUILT_IN_ATOMIC_OR_FETCH_4
:
4428 case BUILT_IN_ATOMIC_OR_FETCH_8
:
4429 case BUILT_IN_ATOMIC_OR_FETCH_16
:
4430 optimize_atomic_op_fetch_cmp_0 (&i
,
4431 IFN_ATOMIC_OR_FETCH_CMP_0
,
4434 case BUILT_IN_SYNC_OR_AND_FETCH_1
:
4435 case BUILT_IN_SYNC_OR_AND_FETCH_2
:
4436 case BUILT_IN_SYNC_OR_AND_FETCH_4
:
4437 case BUILT_IN_SYNC_OR_AND_FETCH_8
:
4438 case BUILT_IN_SYNC_OR_AND_FETCH_16
:
4439 optimize_atomic_op_fetch_cmp_0 (&i
,
4440 IFN_ATOMIC_OR_FETCH_CMP_0
,
4444 case BUILT_IN_MEMCPY
:
4445 if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
)
4446 && TREE_CODE (gimple_call_arg (stmt
, 0)) == ADDR_EXPR
4447 && TREE_CODE (gimple_call_arg (stmt
, 1)) == ADDR_EXPR
4448 && TREE_CODE (gimple_call_arg (stmt
, 2)) == INTEGER_CST
)
4450 tree dest
= TREE_OPERAND (gimple_call_arg (stmt
, 0), 0);
4451 tree src
= TREE_OPERAND (gimple_call_arg (stmt
, 1), 0);
4452 tree len
= gimple_call_arg (stmt
, 2);
4453 optimize_memcpy (&i
, dest
, src
, len
);
4457 case BUILT_IN_VA_START
:
4458 case BUILT_IN_VA_END
:
4459 case BUILT_IN_VA_COPY
:
4460 /* These shouldn't be folded before pass_stdarg. */
4461 result
= optimize_stdarg_builtin (stmt
);
4473 gimplify_and_update_call_from_tree (&i
, result
);
4476 todoflags
|= TODO_update_address_taken
;
4478 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4480 fprintf (dump_file
, "Simplified\n ");
4481 print_gimple_stmt (dump_file
, stmt
, 0, dump_flags
);
4485 stmt
= gsi_stmt (i
);
4488 if (maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
)
4489 && gimple_purge_dead_eh_edges (bb
))
4492 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4494 fprintf (dump_file
, "to\n ");
4495 print_gimple_stmt (dump_file
, stmt
, 0, dump_flags
);
4496 fprintf (dump_file
, "\n");
4499 /* Retry the same statement if it changed into another
4500 builtin, there might be new opportunities now. */
4501 if (gimple_code (stmt
) != GIMPLE_CALL
)
4506 callee
= gimple_call_fndecl (stmt
);
4508 || !fndecl_built_in_p (callee
, fcode
))
4513 /* Delete unreachable blocks. */
4515 todoflags
|= TODO_cleanup_cfg
;
4523 make_pass_fold_builtins (gcc::context
*ctxt
)
4525 return new pass_fold_builtins (ctxt
);
4528 /* A simple pass that emits some warnings post IPA. */
4532 const pass_data pass_data_post_ipa_warn
=
4534 GIMPLE_PASS
, /* type */
4535 "post_ipa_warn", /* name */
4536 OPTGROUP_NONE
, /* optinfo_flags */
4537 TV_NONE
, /* tv_id */
4538 ( PROP_cfg
| PROP_ssa
), /* properties_required */
4539 0, /* properties_provided */
4540 0, /* properties_destroyed */
4541 0, /* todo_flags_start */
4542 0, /* todo_flags_finish */
4545 class pass_post_ipa_warn
: public gimple_opt_pass
4548 pass_post_ipa_warn (gcc::context
*ctxt
)
4549 : gimple_opt_pass (pass_data_post_ipa_warn
, ctxt
)
4552 /* opt_pass methods: */
4553 opt_pass
* clone () { return new pass_post_ipa_warn (m_ctxt
); }
4554 virtual bool gate (function
*) { return warn_nonnull
!= 0; }
4555 virtual unsigned int execute (function
*);
4557 }; // class pass_fold_builtins
4560 pass_post_ipa_warn::execute (function
*fun
)
4564 FOR_EACH_BB_FN (bb
, fun
)
4566 gimple_stmt_iterator gsi
;
4567 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4569 gimple
*stmt
= gsi_stmt (gsi
);
4570 if (!is_gimple_call (stmt
) || warning_suppressed_p (stmt
, OPT_Wnonnull
))
4573 tree fntype
= gimple_call_fntype (stmt
);
4574 bitmap nonnullargs
= get_nonnull_args (fntype
);
4578 tree fndecl
= gimple_call_fndecl (stmt
);
4579 const bool closure
= fndecl
&& DECL_LAMBDA_FUNCTION_P (fndecl
);
4581 for (unsigned i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4583 tree arg
= gimple_call_arg (stmt
, i
);
4584 if (TREE_CODE (TREE_TYPE (arg
)) != POINTER_TYPE
)
4586 if (!integer_zerop (arg
))
4588 if (i
== 0 && closure
)
4589 /* Avoid warning for the first argument to lambda functions. */
4591 if (!bitmap_empty_p (nonnullargs
)
4592 && !bitmap_bit_p (nonnullargs
, i
))
4595 /* In C++ non-static member functions argument 0 refers
4596 to the implicit this pointer. Use the same one-based
4597 numbering for ordinary arguments. */
4598 unsigned argno
= TREE_CODE (fntype
) == METHOD_TYPE
? i
: i
+ 1;
4599 location_t loc
= (EXPR_HAS_LOCATION (arg
)
4600 ? EXPR_LOCATION (arg
)
4601 : gimple_location (stmt
));
4602 auto_diagnostic_group d
;
4605 if (warning_at (loc
, OPT_Wnonnull
,
4606 "%qs pointer is null", "this")
4608 inform (DECL_SOURCE_LOCATION (fndecl
),
4609 "in a call to non-static member function %qD",
4614 if (!warning_at (loc
, OPT_Wnonnull
,
4615 "argument %u null where non-null "
4619 tree fndecl
= gimple_call_fndecl (stmt
);
4620 if (fndecl
&& DECL_IS_UNDECLARED_BUILTIN (fndecl
))
4621 inform (loc
, "in a call to built-in function %qD",
4624 inform (DECL_SOURCE_LOCATION (fndecl
),
4625 "in a call to function %qD declared %qs",
4628 BITMAP_FREE (nonnullargs
);
4637 make_pass_post_ipa_warn (gcc::context
*ctxt
)
4639 return new pass_post_ipa_warn (ctxt
);