1 /* Conditional constant propagation pass for the GNU compiler.
2 Copyright (C) 2000-2024 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-iterator.h"
133 #include "gimple-fold.h"
135 #include "gimplify.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 && VAR_P (SSA_NAME_VAR (var
)))
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 /* But avoid using meet for constant -> copy transitions. */
537 && !(old_val
->lattice_val
== CONSTANT
538 && CONSTANT_CLASS_P (old_val
->value
)
539 && new_val
->lattice_val
== CONSTANT
540 && TREE_CODE (new_val
->value
) == SSA_NAME
))
541 ccp_lattice_meet (new_val
, old_val
);
543 gcc_checking_assert (valid_lattice_transition (*old_val
, *new_val
));
545 /* If *OLD_VAL and NEW_VAL are the same, return false to inform the
546 caller that this was a non-transition. */
547 if (old_val
->lattice_val
!= new_val
->lattice_val
548 || (new_val
->lattice_val
== CONSTANT
549 && (TREE_CODE (new_val
->value
) != TREE_CODE (old_val
->value
)
550 || (TREE_CODE (new_val
->value
) == INTEGER_CST
551 && (new_val
->mask
!= old_val
->mask
552 || (wi::bit_and_not (wi::to_widest (old_val
->value
),
554 != wi::bit_and_not (wi::to_widest (new_val
->value
),
556 || (TREE_CODE (new_val
->value
) != INTEGER_CST
557 && !operand_equal_p (new_val
->value
, old_val
->value
, 0)))))
559 /* ??? We would like to delay creation of INTEGER_CSTs from
560 partially constants here. */
562 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
564 dump_lattice_value (dump_file
, "Lattice value changed to ", *new_val
);
565 fprintf (dump_file
, ". Adding SSA edges to worklist.\n");
570 gcc_assert (new_val
->lattice_val
!= UNINITIALIZED
);
577 static ccp_prop_value_t
get_value_for_expr (tree
, bool);
578 static ccp_prop_value_t
bit_value_binop (enum tree_code
, tree
, tree
, tree
);
579 void bit_value_binop (enum tree_code
, signop
, int, widest_int
*, widest_int
*,
580 signop
, int, const widest_int
&, const widest_int
&,
581 signop
, int, const widest_int
&, const widest_int
&);
583 /* Return a widest_int that can be used for bitwise simplifications
587 value_to_wide_int (ccp_prop_value_t val
)
590 && TREE_CODE (val
.value
) == INTEGER_CST
)
591 return wi::to_widest (val
.value
);
596 /* Return the value for the address expression EXPR based on alignment
599 static ccp_prop_value_t
600 get_value_from_alignment (tree expr
)
602 tree type
= TREE_TYPE (expr
);
603 ccp_prop_value_t val
;
604 unsigned HOST_WIDE_INT bitpos
;
607 gcc_assert (TREE_CODE (expr
) == ADDR_EXPR
);
609 get_pointer_alignment_1 (expr
, &align
, &bitpos
);
610 val
.mask
= wi::bit_and_not
611 (POINTER_TYPE_P (type
) || TYPE_UNSIGNED (type
)
612 ? wi::mask
<widest_int
> (TYPE_PRECISION (type
), false)
614 align
/ BITS_PER_UNIT
- 1);
616 = wi::sext (val
.mask
, TYPE_PRECISION (type
)) == -1 ? VARYING
: CONSTANT
;
617 if (val
.lattice_val
== CONSTANT
)
618 val
.value
= build_int_cstu (type
, bitpos
/ BITS_PER_UNIT
);
620 val
.value
= NULL_TREE
;
625 /* Return the value for the tree operand EXPR. If FOR_BITS_P is true
626 return constant bits extracted from alignment information for
627 invariant addresses. */
629 static ccp_prop_value_t
630 get_value_for_expr (tree expr
, bool for_bits_p
)
632 ccp_prop_value_t val
;
634 if (TREE_CODE (expr
) == SSA_NAME
)
636 ccp_prop_value_t
*val_
= get_value (expr
);
641 val
.lattice_val
= VARYING
;
642 val
.value
= NULL_TREE
;
646 && val
.lattice_val
== CONSTANT
)
648 if (TREE_CODE (val
.value
) == ADDR_EXPR
)
649 val
= get_value_from_alignment (val
.value
);
650 else if (TREE_CODE (val
.value
) != INTEGER_CST
)
652 val
.lattice_val
= VARYING
;
653 val
.value
= NULL_TREE
;
657 /* Fall back to a copy value. */
659 && val
.lattice_val
== VARYING
660 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (expr
))
662 val
.lattice_val
= CONSTANT
;
667 else if (is_gimple_min_invariant (expr
)
668 && (!for_bits_p
|| TREE_CODE (expr
) == INTEGER_CST
))
670 val
.lattice_val
= CONSTANT
;
673 canonicalize_value (&val
);
675 else if (TREE_CODE (expr
) == ADDR_EXPR
)
676 val
= get_value_from_alignment (expr
);
679 val
.lattice_val
= VARYING
;
681 val
.value
= NULL_TREE
;
684 if (val
.lattice_val
== VARYING
685 && INTEGRAL_TYPE_P (TREE_TYPE (expr
))
686 && TYPE_UNSIGNED (TREE_TYPE (expr
)))
687 val
.mask
= wi::zext (val
.mask
, TYPE_PRECISION (TREE_TYPE (expr
)));
692 /* Return the likely CCP lattice value for STMT.
694 If STMT has no operands, then return CONSTANT.
696 Else if undefinedness of operands of STMT cause its value to be
697 undefined, then return UNDEFINED.
699 Else if any operands of STMT are constants, then return CONSTANT.
701 Else return VARYING. */
704 likely_value (gimple
*stmt
)
706 bool has_constant_operand
, has_undefined_operand
, all_undefined_operands
;
707 bool has_nsa_operand
;
712 enum gimple_code code
= gimple_code (stmt
);
714 /* This function appears to be called only for assignments, calls,
715 conditionals, and switches, due to the logic in visit_stmt. */
716 gcc_assert (code
== GIMPLE_ASSIGN
717 || code
== GIMPLE_CALL
718 || code
== GIMPLE_COND
719 || code
== GIMPLE_SWITCH
);
721 /* If the statement has volatile operands, it won't fold to a
723 if (gimple_has_volatile_ops (stmt
))
726 /* .DEFERRED_INIT produces undefined. */
727 if (gimple_call_internal_p (stmt
, IFN_DEFERRED_INIT
))
730 /* Arrive here for more complex cases. */
731 has_constant_operand
= false;
732 has_undefined_operand
= false;
733 all_undefined_operands
= true;
734 has_nsa_operand
= false;
735 FOR_EACH_SSA_TREE_OPERAND (use
, stmt
, iter
, SSA_OP_USE
)
737 ccp_prop_value_t
*val
= get_value (use
);
739 if (val
&& val
->lattice_val
== UNDEFINED
)
740 has_undefined_operand
= true;
742 all_undefined_operands
= false;
744 if (val
&& val
->lattice_val
== CONSTANT
)
745 has_constant_operand
= true;
747 if (SSA_NAME_IS_DEFAULT_DEF (use
)
748 || !prop_simulate_again_p (SSA_NAME_DEF_STMT (use
)))
749 has_nsa_operand
= true;
752 /* There may be constants in regular rhs operands. For calls we
753 have to ignore lhs, fndecl and static chain, otherwise only
755 for (i
= (is_gimple_call (stmt
) ? 2 : 0) + gimple_has_lhs (stmt
);
756 i
< gimple_num_ops (stmt
); ++i
)
758 tree op
= gimple_op (stmt
, i
);
759 if (!op
|| TREE_CODE (op
) == SSA_NAME
)
761 if (is_gimple_min_invariant (op
))
762 has_constant_operand
= true;
765 if (has_constant_operand
)
766 all_undefined_operands
= false;
768 if (has_undefined_operand
769 && code
== GIMPLE_CALL
770 && gimple_call_internal_p (stmt
))
771 switch (gimple_call_internal_fn (stmt
))
773 /* These 3 builtins use the first argument just as a magic
774 way how to find out a decl uid. */
775 case IFN_GOMP_SIMD_LANE
:
776 case IFN_GOMP_SIMD_VF
:
777 case IFN_GOMP_SIMD_LAST_LANE
:
778 has_undefined_operand
= false;
784 /* If the operation combines operands like COMPLEX_EXPR make sure to
785 not mark the result UNDEFINED if only one part of the result is
787 if (has_undefined_operand
&& all_undefined_operands
)
789 else if (code
== GIMPLE_ASSIGN
&& has_undefined_operand
)
791 switch (gimple_assign_rhs_code (stmt
))
793 /* Unary operators are handled with all_undefined_operands. */
796 case POINTER_PLUS_EXPR
:
798 /* Not MIN_EXPR, MAX_EXPR. One VARYING operand may be selected.
799 Not bitwise operators, one VARYING operand may specify the
801 Not logical operators for the same reason, apart from XOR.
802 Not COMPLEX_EXPR as one VARYING operand makes the result partly
803 not UNDEFINED. Not *DIV_EXPR, comparisons and shifts because
804 the undefined operand may be promoted. */
808 /* If any part of an address is UNDEFINED, like the index
809 of an ARRAY_EXPR, then treat the result as UNDEFINED. */
816 /* If there was an UNDEFINED operand but the result may be not UNDEFINED
817 fall back to CONSTANT. During iteration UNDEFINED may still drop
819 if (has_undefined_operand
)
822 /* We do not consider virtual operands here -- load from read-only
823 memory may have only VARYING virtual operands, but still be
824 constant. Also we can combine the stmt with definitions from
825 operands whose definitions are not simulated again. */
826 if (has_constant_operand
828 || gimple_references_memory_p (stmt
))
834 /* Returns true if STMT cannot be constant. */
837 surely_varying_stmt_p (gimple
*stmt
)
839 /* If the statement has operands that we cannot handle, it cannot be
841 if (gimple_has_volatile_ops (stmt
))
844 /* If it is a call and does not return a value or is not a
845 builtin and not an indirect call or a call to function with
846 assume_aligned/alloc_align attribute, it is varying. */
847 if (is_gimple_call (stmt
))
849 tree fndecl
, fntype
= gimple_call_fntype (stmt
);
850 if (!gimple_call_lhs (stmt
)
851 || ((fndecl
= gimple_call_fndecl (stmt
)) != NULL_TREE
852 && !fndecl_built_in_p (fndecl
)
853 && !lookup_attribute ("assume_aligned",
854 TYPE_ATTRIBUTES (fntype
))
855 && !lookup_attribute ("alloc_align",
856 TYPE_ATTRIBUTES (fntype
))))
860 /* Any other store operation is not interesting. */
861 else if (gimple_vdef (stmt
))
864 /* Anything other than assignments and conditional jumps are not
865 interesting for CCP. */
866 if (gimple_code (stmt
) != GIMPLE_ASSIGN
867 && gimple_code (stmt
) != GIMPLE_COND
868 && gimple_code (stmt
) != GIMPLE_SWITCH
869 && gimple_code (stmt
) != GIMPLE_CALL
)
875 /* Initialize local data structures for CCP. */
878 ccp_initialize (void)
882 n_const_val
= num_ssa_names
;
883 const_val
= XCNEWVEC (ccp_prop_value_t
, n_const_val
);
885 /* Initialize simulation flags for PHI nodes and statements. */
886 FOR_EACH_BB_FN (bb
, cfun
)
888 gimple_stmt_iterator i
;
890 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
892 gimple
*stmt
= gsi_stmt (i
);
895 /* If the statement is a control insn, then we do not
896 want to avoid simulating the statement once. Failure
897 to do so means that those edges will never get added. */
898 if (stmt_ends_bb_p (stmt
))
901 is_varying
= surely_varying_stmt_p (stmt
);
908 /* If the statement will not produce a constant, mark
909 all its outputs VARYING. */
910 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, iter
, SSA_OP_ALL_DEFS
)
911 set_value_varying (def
);
913 prop_set_simulate_again (stmt
, !is_varying
);
917 /* Now process PHI nodes. We never clear the simulate_again flag on
918 phi nodes, since we do not know which edges are executable yet,
919 except for phi nodes for virtual operands when we do not do store ccp. */
920 FOR_EACH_BB_FN (bb
, cfun
)
924 for (i
= gsi_start_phis (bb
); !gsi_end_p (i
); gsi_next (&i
))
926 gphi
*phi
= i
.phi ();
928 if (virtual_operand_p (gimple_phi_result (phi
)))
929 prop_set_simulate_again (phi
, false);
931 prop_set_simulate_again (phi
, true);
936 /* Debug count support. Reset the values of ssa names
937 VARYING when the total number ssa names analyzed is
938 beyond the debug count specified. */
944 for (i
= 0; i
< num_ssa_names
; i
++)
948 const_val
[i
].lattice_val
= VARYING
;
949 const_val
[i
].mask
= -1;
950 const_val
[i
].value
= NULL_TREE
;
956 /* We want to provide our own GET_VALUE and FOLD_STMT virtual methods. */
957 class ccp_folder
: public substitute_and_fold_engine
960 tree
value_of_expr (tree
, gimple
*) final override
;
961 bool fold_stmt (gimple_stmt_iterator
*) final override
;
964 /* This method just wraps GET_CONSTANT_VALUE for now. Over time
965 naked calls to GET_CONSTANT_VALUE should be eliminated in favor
966 of calling member functions. */
969 ccp_folder::value_of_expr (tree op
, gimple
*)
971 return get_constant_value (op
);
974 /* Do final substitution of propagated values, cleanup the flowgraph and
975 free allocated storage. If NONZERO_P, record nonzero bits.
977 Return TRUE when something was optimized. */
980 ccp_finalize (bool nonzero_p
)
982 bool something_changed
;
988 /* Derive alignment and misalignment information from partially
989 constant pointers in the lattice or nonzero bits from partially
990 constant integers. */
991 FOR_EACH_SSA_NAME (i
, name
, cfun
)
993 ccp_prop_value_t
*val
;
994 unsigned int tem
, align
;
996 if (!POINTER_TYPE_P (TREE_TYPE (name
))
997 && (!INTEGRAL_TYPE_P (TREE_TYPE (name
))
998 /* Don't record nonzero bits before IPA to avoid
999 using too much memory. */
1003 val
= get_value (name
);
1004 if (val
->lattice_val
!= CONSTANT
1005 || TREE_CODE (val
->value
) != INTEGER_CST
1009 if (POINTER_TYPE_P (TREE_TYPE (name
)))
1011 /* Trailing mask bits specify the alignment, trailing value
1012 bits the misalignment. */
1013 tem
= val
->mask
.to_uhwi ();
1014 align
= least_bit_hwi (tem
);
1016 set_ptr_info_alignment (get_ptr_info (name
), align
,
1017 (TREE_INT_CST_LOW (val
->value
)
1022 unsigned int precision
= TYPE_PRECISION (TREE_TYPE (val
->value
));
1023 wide_int value
= wi::to_wide (val
->value
);
1024 wide_int mask
= wide_int::from (val
->mask
, precision
, UNSIGNED
);
1025 set_bitmask (name
, value
, mask
);
1029 /* Perform substitutions based on the known constant values. */
1030 class ccp_folder ccp_folder
;
1031 something_changed
= ccp_folder
.substitute_and_fold ();
1035 return something_changed
;
1039 /* Compute the meet operator between *VAL1 and *VAL2. Store the result
1042 any M UNDEFINED = any
1043 any M VARYING = VARYING
1044 Ci M Cj = Ci if (i == j)
1045 Ci M Cj = VARYING if (i != j)
1049 ccp_lattice_meet (ccp_prop_value_t
*val1
, ccp_prop_value_t
*val2
)
1051 if (val1
->lattice_val
== UNDEFINED
1052 /* For UNDEFINED M SSA we can't always SSA because its definition
1053 may not dominate the PHI node. Doing optimistic copy propagation
1054 also causes a lot of gcc.dg/uninit-pred*.c FAILs. */
1055 && (val2
->lattice_val
!= CONSTANT
1056 || TREE_CODE (val2
->value
) != SSA_NAME
))
1058 /* UNDEFINED M any = any */
1061 else if (val2
->lattice_val
== UNDEFINED
1063 && (val1
->lattice_val
!= CONSTANT
1064 || TREE_CODE (val1
->value
) != SSA_NAME
))
1066 /* any M UNDEFINED = any
1067 Nothing to do. VAL1 already contains the value we want. */
1070 else if (val1
->lattice_val
== VARYING
1071 || val2
->lattice_val
== VARYING
)
1073 /* any M VARYING = VARYING. */
1074 val1
->lattice_val
= VARYING
;
1076 val1
->value
= NULL_TREE
;
1078 else if (val1
->lattice_val
== CONSTANT
1079 && val2
->lattice_val
== CONSTANT
1080 && TREE_CODE (val1
->value
) == INTEGER_CST
1081 && TREE_CODE (val2
->value
) == INTEGER_CST
)
1083 /* Ci M Cj = Ci if (i == j)
1084 Ci M Cj = VARYING if (i != j)
1086 For INTEGER_CSTs mask unequal bits. If no equal bits remain,
1088 val1
->mask
= (val1
->mask
| val2
->mask
1089 | (wi::to_widest (val1
->value
)
1090 ^ wi::to_widest (val2
->value
)));
1091 if (wi::sext (val1
->mask
, TYPE_PRECISION (TREE_TYPE (val1
->value
))) == -1)
1093 val1
->lattice_val
= VARYING
;
1094 val1
->value
= NULL_TREE
;
1097 else if (val1
->lattice_val
== CONSTANT
1098 && val2
->lattice_val
== CONSTANT
1099 && operand_equal_p (val1
->value
, val2
->value
, 0))
1101 /* Ci M Cj = Ci if (i == j)
1102 Ci M Cj = VARYING if (i != j)
1104 VAL1 already contains the value we want for equivalent values. */
1106 else if (val1
->lattice_val
== CONSTANT
1107 && val2
->lattice_val
== CONSTANT
1108 && (TREE_CODE (val1
->value
) == ADDR_EXPR
1109 || TREE_CODE (val2
->value
) == ADDR_EXPR
))
1111 /* When not equal addresses are involved try meeting for
1113 ccp_prop_value_t tem
= *val2
;
1114 if (TREE_CODE (val1
->value
) == ADDR_EXPR
)
1115 *val1
= get_value_for_expr (val1
->value
, true);
1116 if (TREE_CODE (val2
->value
) == ADDR_EXPR
)
1117 tem
= get_value_for_expr (val2
->value
, true);
1118 ccp_lattice_meet (val1
, &tem
);
1122 /* Any other combination is VARYING. */
1123 val1
->lattice_val
= VARYING
;
1125 val1
->value
= NULL_TREE
;
1130 /* Loop through the PHI_NODE's parameters for BLOCK and compare their
1131 lattice values to determine PHI_NODE's lattice value. The value of a
1132 PHI node is determined calling ccp_lattice_meet with all the arguments
1133 of the PHI node that are incoming via executable edges. */
1135 enum ssa_prop_result
1136 ccp_propagate::visit_phi (gphi
*phi
)
1139 ccp_prop_value_t new_val
;
1141 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1143 fprintf (dump_file
, "\nVisiting PHI node: ");
1144 print_gimple_stmt (dump_file
, phi
, 0, dump_flags
);
1147 new_val
.lattice_val
= UNDEFINED
;
1148 new_val
.value
= NULL_TREE
;
1152 bool non_exec_edge
= false;
1153 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
1155 /* Compute the meet operator over all the PHI arguments flowing
1156 through executable edges. */
1157 edge e
= gimple_phi_arg_edge (phi
, i
);
1159 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1162 "\tArgument #%d (%d -> %d %sexecutable)\n",
1163 i
, e
->src
->index
, e
->dest
->index
,
1164 (e
->flags
& EDGE_EXECUTABLE
) ? "" : "not ");
1167 /* If the incoming edge is executable, Compute the meet operator for
1168 the existing value of the PHI node and the current PHI argument. */
1169 if (e
->flags
& EDGE_EXECUTABLE
)
1171 tree arg
= gimple_phi_arg (phi
, i
)->def
;
1172 ccp_prop_value_t arg_val
= get_value_for_expr (arg
, false);
1180 ccp_lattice_meet (&new_val
, &arg_val
);
1182 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1184 fprintf (dump_file
, "\t");
1185 print_generic_expr (dump_file
, arg
, dump_flags
);
1186 dump_lattice_value (dump_file
, "\tValue: ", arg_val
);
1187 fprintf (dump_file
, "\n");
1190 if (new_val
.lattice_val
== VARYING
)
1194 non_exec_edge
= true;
1197 /* In case there were non-executable edges and the value is a copy
1198 make sure its definition dominates the PHI node. */
1200 && new_val
.lattice_val
== CONSTANT
1201 && TREE_CODE (new_val
.value
) == SSA_NAME
1202 && ! SSA_NAME_IS_DEFAULT_DEF (new_val
.value
)
1203 && ! dominated_by_p (CDI_DOMINATORS
, gimple_bb (phi
),
1204 gimple_bb (SSA_NAME_DEF_STMT (new_val
.value
))))
1206 new_val
.lattice_val
= VARYING
;
1207 new_val
.value
= NULL_TREE
;
1211 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1213 dump_lattice_value (dump_file
, "\n PHI node value: ", new_val
);
1214 fprintf (dump_file
, "\n\n");
1217 /* Make the transition to the new value. */
1218 if (set_lattice_value (gimple_phi_result (phi
), &new_val
))
1220 if (new_val
.lattice_val
== VARYING
)
1221 return SSA_PROP_VARYING
;
1223 return SSA_PROP_INTERESTING
;
1226 return SSA_PROP_NOT_INTERESTING
;
1229 /* Return the constant value for OP or OP otherwise. */
1232 valueize_op (tree op
)
1234 if (TREE_CODE (op
) == SSA_NAME
)
1236 tree tem
= get_constant_value (op
);
1243 /* Return the constant value for OP, but signal to not follow SSA
1244 edges if the definition may be simulated again. */
1247 valueize_op_1 (tree op
)
1249 if (TREE_CODE (op
) == SSA_NAME
)
1251 /* If the definition may be simulated again we cannot follow
1252 this SSA edge as the SSA propagator does not necessarily
1253 re-visit the use. */
1254 gimple
*def_stmt
= SSA_NAME_DEF_STMT (op
);
1255 if (!gimple_nop_p (def_stmt
)
1256 && prop_simulate_again_p (def_stmt
))
1258 tree tem
= get_constant_value (op
);
1265 /* CCP specific front-end to the non-destructive constant folding
1268 Attempt to simplify the RHS of STMT knowing that one or more
1269 operands are constants.
1271 If simplification is possible, return the simplified RHS,
1272 otherwise return the original RHS or NULL_TREE. */
1275 ccp_fold (gimple
*stmt
)
1277 switch (gimple_code (stmt
))
1281 /* Return the constant switch index. */
1282 return valueize_op (gimple_switch_index (as_a
<gswitch
*> (stmt
)));
1288 return gimple_fold_stmt_to_constant_1 (stmt
,
1289 valueize_op
, valueize_op_1
);
1296 /* Determine the minimum and maximum values, *MIN and *MAX respectively,
1297 represented by the mask pair VAL and MASK with signedness SGN and
1298 precision PRECISION. */
1301 value_mask_to_min_max (widest_int
*min
, widest_int
*max
,
1302 const widest_int
&val
, const widest_int
&mask
,
1303 signop sgn
, int precision
)
1305 *min
= wi::bit_and_not (val
, mask
);
1307 if (sgn
== SIGNED
&& wi::neg_p (mask
))
1309 widest_int sign_bit
= wi::lshift (1, precision
- 1);
1312 /* MAX is zero extended, and MIN is sign extended. */
1313 *min
= wi::ext (*min
, precision
, sgn
);
1314 *max
= wi::ext (*max
, precision
, sgn
);
1318 /* Apply the operation CODE in type TYPE to the value, mask pair
1319 RVAL and RMASK representing a value of type RTYPE and set
1320 the value, mask pair *VAL and *MASK to the result. */
1323 bit_value_unop (enum tree_code code
, signop type_sgn
, int type_precision
,
1324 widest_int
*val
, widest_int
*mask
,
1325 signop rtype_sgn
, int rtype_precision
,
1326 const widest_int
&rval
, const widest_int
&rmask
)
1337 widest_int temv
, temm
;
1338 /* Return ~rval + 1. */
1339 bit_value_unop (BIT_NOT_EXPR
, type_sgn
, type_precision
, &temv
, &temm
,
1340 type_sgn
, type_precision
, rval
, rmask
);
1341 bit_value_binop (PLUS_EXPR
, type_sgn
, type_precision
, val
, mask
,
1342 type_sgn
, type_precision
, temv
, temm
,
1343 type_sgn
, type_precision
, 1, 0);
1349 /* First extend mask and value according to the original type. */
1350 *mask
= wi::ext (rmask
, rtype_precision
, rtype_sgn
);
1351 *val
= wi::ext (rval
, rtype_precision
, rtype_sgn
);
1353 /* Then extend mask and value according to the target type. */
1354 *mask
= wi::ext (*mask
, type_precision
, type_sgn
);
1355 *val
= wi::ext (*val
, type_precision
, type_sgn
);
1361 if (wi::sext (rmask
, rtype_precision
) == -1)
1366 else if (wi::neg_p (rmask
))
1368 /* Result is either rval or -rval. */
1369 widest_int temv
, temm
;
1370 bit_value_unop (NEGATE_EXPR
, rtype_sgn
, rtype_precision
, &temv
,
1371 &temm
, type_sgn
, type_precision
, rval
, rmask
);
1372 temm
|= (rmask
| (rval
^ temv
));
1373 /* Extend the result. */
1374 *mask
= wi::ext (temm
, type_precision
, type_sgn
);
1375 *val
= wi::ext (temv
, type_precision
, type_sgn
);
1377 else if (wi::neg_p (rval
))
1379 bit_value_unop (NEGATE_EXPR
, type_sgn
, type_precision
, val
, mask
,
1380 type_sgn
, type_precision
, rval
, rmask
);
1396 /* Determine the mask pair *VAL and *MASK from multiplying the
1397 argument mask pair RVAL, RMASK by the unsigned constant C. */
1399 bit_value_mult_const (signop sgn
, int width
,
1400 widest_int
*val
, widest_int
*mask
,
1401 const widest_int
&rval
, const widest_int
&rmask
,
1404 widest_int sum_mask
= 0;
1406 /* Ensure rval_lo only contains known bits. */
1407 widest_int rval_lo
= wi::bit_and_not (rval
, rmask
);
1411 /* General case (some bits of multiplicand are known set). */
1412 widest_int sum_val
= 0;
1415 /* Determine the lowest bit set in the multiplier. */
1416 int bitpos
= wi::ctz (c
);
1417 widest_int term_mask
= rmask
<< bitpos
;
1418 widest_int term_val
= rval_lo
<< bitpos
;
1421 widest_int lo
= sum_val
+ term_val
;
1422 widest_int hi
= (sum_val
| sum_mask
) + (term_val
| term_mask
);
1423 sum_mask
|= term_mask
| (lo
^ hi
);
1426 /* Clear this bit in the multiplier. */
1427 c
^= wi::lshift (1, bitpos
);
1429 /* Correctly extend the result value. */
1430 *val
= wi::ext (sum_val
, width
, sgn
);
1434 /* Special case (no bits of multiplicand are known set). */
1437 /* Determine the lowest bit set in the multiplier. */
1438 int bitpos
= wi::ctz (c
);
1439 widest_int term_mask
= rmask
<< bitpos
;
1442 widest_int hi
= sum_mask
+ term_mask
;
1443 sum_mask
|= term_mask
| hi
;
1445 /* Clear this bit in the multiplier. */
1446 c
^= wi::lshift (1, bitpos
);
1451 /* Correctly extend the result mask. */
1452 *mask
= wi::ext (sum_mask
, width
, sgn
);
1455 /* Fill up to MAX values in the BITS array with values representing
1456 each of the non-zero bits in the value X. Returns the number of
1457 bits in X (capped at the maximum value MAX). For example, an X
1458 value 11, places 1, 2 and 8 in BITS and returns the value 3. */
1461 get_individual_bits (widest_int
*bits
, widest_int x
, unsigned int max
)
1463 unsigned int count
= 0;
1464 while (count
< max
&& x
!= 0)
1466 int bitpos
= wi::ctz (x
);
1467 bits
[count
] = wi::lshift (1, bitpos
);
1474 /* Array of 2^N - 1 values representing the bits flipped between
1475 consecutive Gray codes. This is used to efficiently enumerate
1476 all permutations on N bits using XOR. */
1477 static const unsigned char gray_code_bit_flips
[63] = {
1478 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4,
1479 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5,
1480 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4,
1481 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0
1484 /* Apply the operation CODE in type TYPE to the value, mask pairs
1485 R1VAL, R1MASK and R2VAL, R2MASK representing a values of type R1TYPE
1486 and R2TYPE and set the value, mask pair *VAL and *MASK to the result. */
1489 bit_value_binop (enum tree_code code
, signop sgn
, int width
,
1490 widest_int
*val
, widest_int
*mask
,
1491 signop r1type_sgn
, int r1type_precision
,
1492 const widest_int
&r1val
, const widest_int
&r1mask
,
1493 signop r2type_sgn
, int r2type_precision ATTRIBUTE_UNUSED
,
1494 const widest_int
&r2val
, const widest_int
&r2mask
)
1496 bool swap_p
= false;
1498 /* Assume we'll get a constant result. Use an initial non varying
1499 value, we fall back to varying in the end if necessary. */
1501 /* Ensure that VAL is initialized (to any value). */
1507 /* The mask is constant where there is a known not
1508 set bit, (m1 | m2) & ((v1 | m1) & (v2 | m2)) */
1509 *mask
= (r1mask
| r2mask
) & (r1val
| r1mask
) & (r2val
| r2mask
);
1510 *val
= r1val
& r2val
;
1514 /* The mask is constant where there is a known
1515 set bit, (m1 | m2) & ~((v1 & ~m1) | (v2 & ~m2)). */
1516 *mask
= wi::bit_and_not (r1mask
| r2mask
,
1517 wi::bit_and_not (r1val
, r1mask
)
1518 | wi::bit_and_not (r2val
, r2mask
));
1519 *val
= r1val
| r2val
;
1524 *mask
= r1mask
| r2mask
;
1525 *val
= r1val
^ r2val
;
1532 widest_int shift
= r2val
;
1540 if (wi::neg_p (shift
, r2type_sgn
))
1543 if (code
== RROTATE_EXPR
)
1544 code
= LROTATE_EXPR
;
1546 code
= RROTATE_EXPR
;
1548 if (code
== RROTATE_EXPR
)
1550 *mask
= wi::rrotate (r1mask
, shift
, width
);
1551 *val
= wi::rrotate (r1val
, shift
, width
);
1555 *mask
= wi::lrotate (r1mask
, shift
, width
);
1556 *val
= wi::lrotate (r1val
, shift
, width
);
1558 *mask
= wi::ext (*mask
, width
, sgn
);
1559 *val
= wi::ext (*val
, width
, sgn
);
1562 else if (wi::ltu_p (r2val
| r2mask
, width
)
1563 && wi::popcount (r2mask
) <= 4)
1566 widest_int res_val
, res_mask
;
1567 widest_int tmp_val
, tmp_mask
;
1568 widest_int shift
= wi::bit_and_not (r2val
, r2mask
);
1569 unsigned int bit_count
= get_individual_bits (bits
, r2mask
, 4);
1570 unsigned int count
= (1 << bit_count
) - 1;
1572 /* Initialize result to rotate by smallest value of shift. */
1573 if (code
== RROTATE_EXPR
)
1575 res_mask
= wi::rrotate (r1mask
, shift
, width
);
1576 res_val
= wi::rrotate (r1val
, shift
, width
);
1580 res_mask
= wi::lrotate (r1mask
, shift
, width
);
1581 res_val
= wi::lrotate (r1val
, shift
, width
);
1584 /* Iterate through the remaining values of shift. */
1585 for (unsigned int i
=0; i
<count
; i
++)
1587 shift
^= bits
[gray_code_bit_flips
[i
]];
1588 if (code
== RROTATE_EXPR
)
1590 tmp_mask
= wi::rrotate (r1mask
, shift
, width
);
1591 tmp_val
= wi::rrotate (r1val
, shift
, width
);
1595 tmp_mask
= wi::lrotate (r1mask
, shift
, width
);
1596 tmp_val
= wi::lrotate (r1val
, shift
, width
);
1598 /* Accumulate the result. */
1599 res_mask
|= tmp_mask
| (res_val
^ tmp_val
);
1601 *val
= wi::ext (wi::bit_and_not (res_val
, res_mask
), width
, sgn
);
1602 *mask
= wi::ext (res_mask
, width
, sgn
);
1608 /* ??? We can handle partially known shift counts if we know
1609 its sign. That way we can tell that (x << (y | 8)) & 255
1613 widest_int shift
= r2val
;
1621 if (wi::neg_p (shift
, r2type_sgn
))
1623 if (code
== RSHIFT_EXPR
)
1625 *mask
= wi::rshift (wi::ext (r1mask
, width
, sgn
), shift
, sgn
);
1626 *val
= wi::rshift (wi::ext (r1val
, width
, sgn
), shift
, sgn
);
1630 *mask
= wi::ext (r1mask
<< shift
, width
, sgn
);
1631 *val
= wi::ext (r1val
<< shift
, width
, sgn
);
1635 else if (wi::ltu_p (r2val
| r2mask
, width
))
1637 if (wi::popcount (r2mask
) <= 4)
1640 widest_int arg_val
, arg_mask
;
1641 widest_int res_val
, res_mask
;
1642 widest_int tmp_val
, tmp_mask
;
1643 widest_int shift
= wi::bit_and_not (r2val
, r2mask
);
1644 unsigned int bit_count
= get_individual_bits (bits
, r2mask
, 4);
1645 unsigned int count
= (1 << bit_count
) - 1;
1647 /* Initialize result to shift by smallest value of shift. */
1648 if (code
== RSHIFT_EXPR
)
1650 arg_mask
= wi::ext (r1mask
, width
, sgn
);
1651 arg_val
= wi::ext (r1val
, width
, sgn
);
1652 res_mask
= wi::rshift (arg_mask
, shift
, sgn
);
1653 res_val
= wi::rshift (arg_val
, shift
, sgn
);
1659 res_mask
= arg_mask
<< shift
;
1660 res_val
= arg_val
<< shift
;
1663 /* Iterate through the remaining values of shift. */
1664 for (unsigned int i
=0; i
<count
; i
++)
1666 shift
^= bits
[gray_code_bit_flips
[i
]];
1667 if (code
== RSHIFT_EXPR
)
1669 tmp_mask
= wi::rshift (arg_mask
, shift
, sgn
);
1670 tmp_val
= wi::rshift (arg_val
, shift
, sgn
);
1674 tmp_mask
= arg_mask
<< shift
;
1675 tmp_val
= arg_val
<< shift
;
1677 /* Accumulate the result. */
1678 res_mask
|= tmp_mask
| (res_val
^ tmp_val
);
1680 res_mask
= wi::ext (res_mask
, width
, sgn
);
1681 res_val
= wi::ext (res_val
, width
, sgn
);
1682 *val
= wi::bit_and_not (res_val
, res_mask
);
1685 else if ((r1val
| r1mask
) == 0)
1687 /* Handle shifts of zero to avoid undefined wi::ctz below. */
1691 else if (code
== LSHIFT_EXPR
)
1693 widest_int tmp
= wi::mask
<widest_int
> (width
, false);
1694 tmp
<<= wi::ctz (r1val
| r1mask
);
1695 tmp
<<= wi::bit_and_not (r2val
, r2mask
);
1696 *mask
= wi::ext (tmp
, width
, sgn
);
1699 else if (!wi::neg_p (r1val
| r1mask
, sgn
))
1701 /* Logical right shift, or zero sign bit. */
1702 widest_int arg
= r1val
| r1mask
;
1703 int lzcount
= wi::clz (arg
);
1705 lzcount
-= wi::get_precision (arg
) - width
;
1706 widest_int tmp
= wi::mask
<widest_int
> (width
, false);
1707 tmp
= wi::lrshift (tmp
, lzcount
);
1708 tmp
= wi::lrshift (tmp
, wi::bit_and_not (r2val
, r2mask
));
1709 *mask
= wi::ext (tmp
, width
, sgn
);
1712 else if (!wi::neg_p (r1mask
))
1714 /* Arithmetic right shift with set sign bit. */
1715 widest_int arg
= wi::bit_and_not (r1val
, r1mask
);
1716 int sbcount
= wi::clrsb (arg
);
1717 sbcount
-= wi::get_precision (arg
) - width
;
1718 widest_int tmp
= wi::mask
<widest_int
> (width
, false);
1719 tmp
= wi::lrshift (tmp
, sbcount
);
1720 tmp
= wi::lrshift (tmp
, wi::bit_and_not (r2val
, r2mask
));
1721 *mask
= wi::sext (tmp
, width
);
1722 tmp
= wi::bit_not (tmp
);
1723 *val
= wi::sext (tmp
, width
);
1729 case POINTER_PLUS_EXPR
:
1731 /* Do the addition with unknown bits set to zero, to give carry-ins of
1732 zero wherever possible. */
1733 widest_int lo
= (wi::bit_and_not (r1val
, r1mask
)
1734 + wi::bit_and_not (r2val
, r2mask
));
1735 lo
= wi::ext (lo
, width
, sgn
);
1736 /* Do the addition with unknown bits set to one, to give carry-ins of
1737 one wherever possible. */
1738 widest_int hi
= (r1val
| r1mask
) + (r2val
| r2mask
);
1739 hi
= wi::ext (hi
, width
, sgn
);
1740 /* Each bit in the result is known if (a) the corresponding bits in
1741 both inputs are known, and (b) the carry-in to that bit position
1742 is known. We can check condition (b) by seeing if we got the same
1743 result with minimised carries as with maximised carries. */
1744 *mask
= r1mask
| r2mask
| (lo
^ hi
);
1745 *mask
= wi::ext (*mask
, width
, sgn
);
1746 /* It shouldn't matter whether we choose lo or hi here. */
1752 case POINTER_DIFF_EXPR
:
1754 /* Subtraction is derived from the addition algorithm above. */
1755 widest_int lo
= wi::bit_and_not (r1val
, r1mask
) - (r2val
| r2mask
);
1756 lo
= wi::ext (lo
, width
, sgn
);
1757 widest_int hi
= (r1val
| r1mask
) - wi::bit_and_not (r2val
, r2mask
);
1758 hi
= wi::ext (hi
, width
, sgn
);
1759 *mask
= r1mask
| r2mask
| (lo
^ hi
);
1760 *mask
= wi::ext (*mask
, width
, sgn
);
1767 && !wi::neg_p (r2val
, sgn
)
1768 && (flag_expensive_optimizations
|| wi::popcount (r2val
) < 8))
1769 bit_value_mult_const (sgn
, width
, val
, mask
, r1val
, r1mask
, r2val
);
1770 else if (r1mask
== 0
1771 && !wi::neg_p (r1val
, sgn
)
1772 && (flag_expensive_optimizations
|| wi::popcount (r1val
) < 8))
1773 bit_value_mult_const (sgn
, width
, val
, mask
, r2val
, r2mask
, r1val
);
1776 /* Just track trailing zeros in both operands and transfer
1777 them to the other. */
1778 int r1tz
= wi::ctz (r1val
| r1mask
);
1779 int r2tz
= wi::ctz (r2val
| r2mask
);
1780 if (r1tz
+ r2tz
>= width
)
1785 else if (r1tz
+ r2tz
> 0)
1787 *mask
= wi::ext (wi::mask
<widest_int
> (r1tz
+ r2tz
, true),
1797 widest_int m
= r1mask
| r2mask
;
1798 if (wi::bit_and_not (r1val
, m
) != wi::bit_and_not (r2val
, m
))
1801 *val
= ((code
== EQ_EXPR
) ? 0 : 1);
1805 /* We know the result of a comparison is always one or zero. */
1815 code
= swap_tree_comparison (code
);
1820 widest_int min1
, max1
, min2
, max2
;
1823 const widest_int
&o1val
= swap_p
? r2val
: r1val
;
1824 const widest_int
&o1mask
= swap_p
? r2mask
: r1mask
;
1825 const widest_int
&o2val
= swap_p
? r1val
: r2val
;
1826 const widest_int
&o2mask
= swap_p
? r1mask
: r2mask
;
1828 value_mask_to_min_max (&min1
, &max1
, o1val
, o1mask
,
1829 r1type_sgn
, r1type_precision
);
1830 value_mask_to_min_max (&min2
, &max2
, o2val
, o2mask
,
1831 r1type_sgn
, r1type_precision
);
1833 /* For comparisons the signedness is in the comparison operands. */
1834 /* Do a cross comparison of the max/min pairs. */
1835 maxmin
= wi::cmp (max1
, min2
, r1type_sgn
);
1836 minmax
= wi::cmp (min1
, max2
, r1type_sgn
);
1837 if (maxmin
< (code
== LE_EXPR
? 1: 0)) /* o1 < or <= o2. */
1842 else if (minmax
> (code
== LT_EXPR
? -1 : 0)) /* o1 >= or > o2. */
1847 else if (maxmin
== minmax
) /* o1 and o2 are equal. */
1849 /* This probably should never happen as we'd have
1850 folded the thing during fully constant value folding. */
1852 *val
= (code
== LE_EXPR
? 1 : 0);
1856 /* We know the result of a comparison is always one or zero. */
1866 widest_int min1
, max1
, min2
, max2
;
1868 value_mask_to_min_max (&min1
, &max1
, r1val
, r1mask
, sgn
, width
);
1869 value_mask_to_min_max (&min2
, &max2
, r2val
, r2mask
, sgn
, width
);
1871 if (wi::cmp (max1
, min2
, sgn
) <= 0) /* r1 is less than r2. */
1873 if (code
== MIN_EXPR
)
1884 else if (wi::cmp (min1
, max2
, sgn
) >= 0) /* r2 is less than r1. */
1886 if (code
== MIN_EXPR
)
1899 /* The result is either r1 or r2. */
1900 *mask
= r1mask
| r2mask
| (r1val
^ r2val
);
1906 case TRUNC_MOD_EXPR
:
1908 widest_int r1max
= r1val
| r1mask
;
1909 widest_int r2max
= r2val
| r2mask
;
1911 || (!wi::neg_p (r1max
) && !wi::neg_p (r2max
)))
1913 /* Confirm R2 has some bits set, to avoid division by zero. */
1914 widest_int r2min
= wi::bit_and_not (r2val
, r2mask
);
1917 /* R1 % R2 is R1 if R1 is always less than R2. */
1918 if (wi::ltu_p (r1max
, r2min
))
1925 /* R1 % R2 is always less than the maximum of R2. */
1926 unsigned int lzcount
= wi::clz (r2max
);
1927 unsigned int bits
= wi::get_precision (r2max
) - lzcount
;
1928 if (r2max
== wi::lshift (1, bits
))
1930 *mask
= wi::mask
<widest_int
> (bits
, false);
1938 case TRUNC_DIV_EXPR
:
1940 widest_int r1max
= r1val
| r1mask
;
1941 widest_int r2max
= r2val
| r2mask
;
1942 if (r2mask
== 0 && !wi::neg_p (r1max
))
1944 widest_int shift
= wi::exact_log2 (r2val
);
1947 // Handle division by a power of 2 as an rshift.
1948 bit_value_binop (RSHIFT_EXPR
, sgn
, width
, val
, mask
,
1949 r1type_sgn
, r1type_precision
, r1val
, r1mask
,
1950 r2type_sgn
, r2type_precision
, shift
, r2mask
);
1955 || (!wi::neg_p (r1max
) && !wi::neg_p (r2max
)))
1957 /* Confirm R2 has some bits set, to avoid division by zero. */
1958 widest_int r2min
= wi::bit_and_not (r2val
, r2mask
);
1961 /* R1 / R2 is zero if R1 is always less than R2. */
1962 if (wi::ltu_p (r1max
, r2min
))
1970 = wi::udiv_trunc (wi::zext (r1max
, width
), r2min
);
1971 unsigned int lzcount
= wi::clz (upper
);
1972 unsigned int bits
= wi::get_precision (upper
) - lzcount
;
1973 *mask
= wi::mask
<widest_int
> (bits
, false);
1985 /* Return the propagation value when applying the operation CODE to
1986 the value RHS yielding type TYPE. */
1988 static ccp_prop_value_t
1989 bit_value_unop (enum tree_code code
, tree type
, tree rhs
)
1991 ccp_prop_value_t rval
= get_value_for_expr (rhs
, true);
1992 widest_int value
, mask
;
1993 ccp_prop_value_t val
;
1995 if (rval
.lattice_val
== UNDEFINED
)
1998 gcc_assert ((rval
.lattice_val
== CONSTANT
1999 && TREE_CODE (rval
.value
) == INTEGER_CST
)
2000 || wi::sext (rval
.mask
, TYPE_PRECISION (TREE_TYPE (rhs
))) == -1);
2001 bit_value_unop (code
, TYPE_SIGN (type
), TYPE_PRECISION (type
), &value
, &mask
,
2002 TYPE_SIGN (TREE_TYPE (rhs
)), TYPE_PRECISION (TREE_TYPE (rhs
)),
2003 value_to_wide_int (rval
), rval
.mask
);
2004 if (wi::sext (mask
, TYPE_PRECISION (type
)) != -1)
2006 val
.lattice_val
= CONSTANT
;
2008 /* ??? Delay building trees here. */
2009 val
.value
= wide_int_to_tree (type
, value
);
2013 val
.lattice_val
= VARYING
;
2014 val
.value
= NULL_TREE
;
2020 /* Return the propagation value when applying the operation CODE to
2021 the values RHS1 and RHS2 yielding type TYPE. */
2023 static ccp_prop_value_t
2024 bit_value_binop (enum tree_code code
, tree type
, tree rhs1
, tree rhs2
)
2026 ccp_prop_value_t r1val
= get_value_for_expr (rhs1
, true);
2027 ccp_prop_value_t r2val
= get_value_for_expr (rhs2
, true);
2028 widest_int value
, mask
;
2029 ccp_prop_value_t val
;
2031 if (r1val
.lattice_val
== UNDEFINED
2032 || r2val
.lattice_val
== UNDEFINED
)
2034 val
.lattice_val
= VARYING
;
2035 val
.value
= NULL_TREE
;
2040 gcc_assert ((r1val
.lattice_val
== CONSTANT
2041 && TREE_CODE (r1val
.value
) == INTEGER_CST
)
2042 || wi::sext (r1val
.mask
,
2043 TYPE_PRECISION (TREE_TYPE (rhs1
))) == -1);
2044 gcc_assert ((r2val
.lattice_val
== CONSTANT
2045 && TREE_CODE (r2val
.value
) == INTEGER_CST
)
2046 || wi::sext (r2val
.mask
,
2047 TYPE_PRECISION (TREE_TYPE (rhs2
))) == -1);
2048 bit_value_binop (code
, TYPE_SIGN (type
), TYPE_PRECISION (type
), &value
, &mask
,
2049 TYPE_SIGN (TREE_TYPE (rhs1
)), TYPE_PRECISION (TREE_TYPE (rhs1
)),
2050 value_to_wide_int (r1val
), r1val
.mask
,
2051 TYPE_SIGN (TREE_TYPE (rhs2
)), TYPE_PRECISION (TREE_TYPE (rhs2
)),
2052 value_to_wide_int (r2val
), r2val
.mask
);
2054 /* (x * x) & 2 == 0. */
2055 if (code
== MULT_EXPR
&& rhs1
== rhs2
&& TYPE_PRECISION (type
) > 1)
2058 if (wi::sext (mask
, TYPE_PRECISION (type
)) != -1)
2059 value
= wi::bit_and_not (value
, m
);
2062 mask
= wi::bit_and_not (mask
, m
);
2065 if (wi::sext (mask
, TYPE_PRECISION (type
)) != -1)
2067 val
.lattice_val
= CONSTANT
;
2069 /* ??? Delay building trees here. */
2070 val
.value
= wide_int_to_tree (type
, value
);
2074 val
.lattice_val
= VARYING
;
2075 val
.value
= NULL_TREE
;
2081 /* Return the propagation value for __builtin_assume_aligned
2082 and functions with assume_aligned or alloc_aligned attribute.
2083 For __builtin_assume_aligned, ATTR is NULL_TREE,
2084 for assume_aligned attribute ATTR is non-NULL and ALLOC_ALIGNED
2085 is false, for alloc_aligned attribute ATTR is non-NULL and
2086 ALLOC_ALIGNED is true. */
2088 static ccp_prop_value_t
2089 bit_value_assume_aligned (gimple
*stmt
, tree attr
, ccp_prop_value_t ptrval
,
2092 tree align
, misalign
= NULL_TREE
, type
;
2093 unsigned HOST_WIDE_INT aligni
, misaligni
= 0;
2094 ccp_prop_value_t alignval
;
2095 widest_int value
, mask
;
2096 ccp_prop_value_t val
;
2098 if (attr
== NULL_TREE
)
2100 tree ptr
= gimple_call_arg (stmt
, 0);
2101 type
= TREE_TYPE (ptr
);
2102 ptrval
= get_value_for_expr (ptr
, true);
2106 tree lhs
= gimple_call_lhs (stmt
);
2107 type
= TREE_TYPE (lhs
);
2110 if (ptrval
.lattice_val
== UNDEFINED
)
2112 gcc_assert ((ptrval
.lattice_val
== CONSTANT
2113 && TREE_CODE (ptrval
.value
) == INTEGER_CST
)
2114 || wi::sext (ptrval
.mask
, TYPE_PRECISION (type
)) == -1);
2115 if (attr
== NULL_TREE
)
2117 /* Get aligni and misaligni from __builtin_assume_aligned. */
2118 align
= gimple_call_arg (stmt
, 1);
2119 if (!tree_fits_uhwi_p (align
))
2121 aligni
= tree_to_uhwi (align
);
2122 if (gimple_call_num_args (stmt
) > 2)
2124 misalign
= gimple_call_arg (stmt
, 2);
2125 if (!tree_fits_uhwi_p (misalign
))
2127 misaligni
= tree_to_uhwi (misalign
);
2132 /* Get aligni and misaligni from assume_aligned or
2133 alloc_align attributes. */
2134 if (TREE_VALUE (attr
) == NULL_TREE
)
2136 attr
= TREE_VALUE (attr
);
2137 align
= TREE_VALUE (attr
);
2138 if (!tree_fits_uhwi_p (align
))
2140 aligni
= tree_to_uhwi (align
);
2143 if (aligni
== 0 || aligni
> gimple_call_num_args (stmt
))
2145 align
= gimple_call_arg (stmt
, aligni
- 1);
2146 if (!tree_fits_uhwi_p (align
))
2148 aligni
= tree_to_uhwi (align
);
2150 else if (TREE_CHAIN (attr
) && TREE_VALUE (TREE_CHAIN (attr
)))
2152 misalign
= TREE_VALUE (TREE_CHAIN (attr
));
2153 if (!tree_fits_uhwi_p (misalign
))
2155 misaligni
= tree_to_uhwi (misalign
);
2158 if (aligni
<= 1 || (aligni
& (aligni
- 1)) != 0 || misaligni
>= aligni
)
2161 align
= build_int_cst_type (type
, -aligni
);
2162 alignval
= get_value_for_expr (align
, true);
2163 bit_value_binop (BIT_AND_EXPR
, TYPE_SIGN (type
), TYPE_PRECISION (type
), &value
, &mask
,
2164 TYPE_SIGN (type
), TYPE_PRECISION (type
), value_to_wide_int (ptrval
), ptrval
.mask
,
2165 TYPE_SIGN (type
), TYPE_PRECISION (type
), value_to_wide_int (alignval
), alignval
.mask
);
2167 if (wi::sext (mask
, TYPE_PRECISION (type
)) != -1)
2169 val
.lattice_val
= CONSTANT
;
2171 gcc_assert ((mask
.to_uhwi () & (aligni
- 1)) == 0);
2172 gcc_assert ((value
.to_uhwi () & (aligni
- 1)) == 0);
2174 /* ??? Delay building trees here. */
2175 val
.value
= wide_int_to_tree (type
, value
);
2179 val
.lattice_val
= VARYING
;
2180 val
.value
= NULL_TREE
;
2186 /* Evaluate statement STMT.
2187 Valid only for assignments, calls, conditionals, and switches. */
2189 static ccp_prop_value_t
2190 evaluate_stmt (gimple
*stmt
)
2192 ccp_prop_value_t val
;
2193 tree simplified
= NULL_TREE
;
2194 ccp_lattice_t likelyvalue
= likely_value (stmt
);
2195 bool is_constant
= false;
2197 bool ignore_return_flags
= false;
2199 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2201 fprintf (dump_file
, "which is likely ");
2202 switch (likelyvalue
)
2205 fprintf (dump_file
, "CONSTANT");
2208 fprintf (dump_file
, "UNDEFINED");
2211 fprintf (dump_file
, "VARYING");
2215 fprintf (dump_file
, "\n");
2218 /* If the statement is likely to have a CONSTANT result, then try
2219 to fold the statement to determine the constant value. */
2220 /* FIXME. This is the only place that we call ccp_fold.
2221 Since likely_value never returns CONSTANT for calls, we will
2222 not attempt to fold them, including builtins that may profit. */
2223 if (likelyvalue
== CONSTANT
)
2225 fold_defer_overflow_warnings ();
2226 simplified
= ccp_fold (stmt
);
2228 && TREE_CODE (simplified
) == SSA_NAME
)
2230 /* We may not use values of something that may be simulated again,
2231 see valueize_op_1. */
2232 if (SSA_NAME_IS_DEFAULT_DEF (simplified
)
2233 || ! prop_simulate_again_p (SSA_NAME_DEF_STMT (simplified
)))
2235 ccp_prop_value_t
*val
= get_value (simplified
);
2236 if (val
&& val
->lattice_val
!= VARYING
)
2238 fold_undefer_overflow_warnings (true, stmt
, 0);
2243 /* We may also not place a non-valueized copy in the lattice
2244 as that might become stale if we never re-visit this stmt. */
2245 simplified
= NULL_TREE
;
2247 is_constant
= simplified
&& is_gimple_min_invariant (simplified
);
2248 fold_undefer_overflow_warnings (is_constant
, stmt
, 0);
2251 /* The statement produced a constant value. */
2252 val
.lattice_val
= CONSTANT
;
2253 val
.value
= simplified
;
2258 /* If the statement is likely to have a VARYING result, then do not
2259 bother folding the statement. */
2260 else if (likelyvalue
== VARYING
)
2262 enum gimple_code code
= gimple_code (stmt
);
2263 if (code
== GIMPLE_ASSIGN
)
2265 enum tree_code subcode
= gimple_assign_rhs_code (stmt
);
2267 /* Other cases cannot satisfy is_gimple_min_invariant
2269 if (get_gimple_rhs_class (subcode
) == GIMPLE_SINGLE_RHS
)
2270 simplified
= gimple_assign_rhs1 (stmt
);
2272 else if (code
== GIMPLE_SWITCH
)
2273 simplified
= gimple_switch_index (as_a
<gswitch
*> (stmt
));
2275 /* These cannot satisfy is_gimple_min_invariant without folding. */
2276 gcc_assert (code
== GIMPLE_CALL
|| code
== GIMPLE_COND
);
2277 is_constant
= simplified
&& is_gimple_min_invariant (simplified
);
2280 /* The statement produced a constant value. */
2281 val
.lattice_val
= CONSTANT
;
2282 val
.value
= simplified
;
2286 /* If the statement result is likely UNDEFINED, make it so. */
2287 else if (likelyvalue
== UNDEFINED
)
2289 val
.lattice_val
= UNDEFINED
;
2290 val
.value
= NULL_TREE
;
2295 /* Resort to simplification for bitwise tracking. */
2296 if (flag_tree_bit_ccp
2297 && (likelyvalue
== CONSTANT
|| is_gimple_call (stmt
)
2298 || (gimple_assign_single_p (stmt
)
2299 && gimple_assign_rhs_code (stmt
) == ADDR_EXPR
))
2302 enum gimple_code code
= gimple_code (stmt
);
2303 val
.lattice_val
= VARYING
;
2304 val
.value
= NULL_TREE
;
2306 if (code
== GIMPLE_ASSIGN
)
2308 enum tree_code subcode
= gimple_assign_rhs_code (stmt
);
2309 tree rhs1
= gimple_assign_rhs1 (stmt
);
2310 tree lhs
= gimple_assign_lhs (stmt
);
2311 if ((INTEGRAL_TYPE_P (TREE_TYPE (lhs
))
2312 || POINTER_TYPE_P (TREE_TYPE (lhs
)))
2313 && (INTEGRAL_TYPE_P (TREE_TYPE (rhs1
))
2314 || POINTER_TYPE_P (TREE_TYPE (rhs1
))))
2315 switch (get_gimple_rhs_class (subcode
))
2317 case GIMPLE_SINGLE_RHS
:
2318 val
= get_value_for_expr (rhs1
, true);
2321 case GIMPLE_UNARY_RHS
:
2322 val
= bit_value_unop (subcode
, TREE_TYPE (lhs
), rhs1
);
2325 case GIMPLE_BINARY_RHS
:
2326 val
= bit_value_binop (subcode
, TREE_TYPE (lhs
), rhs1
,
2327 gimple_assign_rhs2 (stmt
));
2333 else if (code
== GIMPLE_COND
)
2335 enum tree_code code
= gimple_cond_code (stmt
);
2336 tree rhs1
= gimple_cond_lhs (stmt
);
2337 tree rhs2
= gimple_cond_rhs (stmt
);
2338 if (INTEGRAL_TYPE_P (TREE_TYPE (rhs1
))
2339 || POINTER_TYPE_P (TREE_TYPE (rhs1
)))
2340 val
= bit_value_binop (code
, TREE_TYPE (rhs1
), rhs1
, rhs2
);
2342 else if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
))
2344 tree fndecl
= gimple_call_fndecl (stmt
);
2345 switch (DECL_FUNCTION_CODE (fndecl
))
2347 case BUILT_IN_MALLOC
:
2348 case BUILT_IN_REALLOC
:
2349 case BUILT_IN_GOMP_REALLOC
:
2350 case BUILT_IN_CALLOC
:
2351 case BUILT_IN_STRDUP
:
2352 case BUILT_IN_STRNDUP
:
2353 val
.lattice_val
= CONSTANT
;
2354 val
.value
= build_int_cst (TREE_TYPE (gimple_get_lhs (stmt
)), 0);
2355 val
.mask
= ~((HOST_WIDE_INT
) MALLOC_ABI_ALIGNMENT
2356 / BITS_PER_UNIT
- 1);
2359 CASE_BUILT_IN_ALLOCA
:
2360 align
= (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_ALLOCA
2362 : TREE_INT_CST_LOW (gimple_call_arg (stmt
, 1)));
2363 val
.lattice_val
= CONSTANT
;
2364 val
.value
= build_int_cst (TREE_TYPE (gimple_get_lhs (stmt
)), 0);
2365 val
.mask
= ~((HOST_WIDE_INT
) align
/ BITS_PER_UNIT
- 1);
2368 case BUILT_IN_ASSUME_ALIGNED
:
2369 val
= bit_value_assume_aligned (stmt
, NULL_TREE
, val
, false);
2370 ignore_return_flags
= true;
2373 case BUILT_IN_ALIGNED_ALLOC
:
2374 case BUILT_IN_GOMP_ALLOC
:
2376 tree align
= get_constant_value (gimple_call_arg (stmt
, 0));
2378 && tree_fits_uhwi_p (align
))
2380 unsigned HOST_WIDE_INT aligni
= tree_to_uhwi (align
);
2382 /* align must be power-of-two */
2383 && (aligni
& (aligni
- 1)) == 0)
2385 val
.lattice_val
= CONSTANT
;
2386 val
.value
= build_int_cst (ptr_type_node
, 0);
2393 case BUILT_IN_BSWAP16
:
2394 case BUILT_IN_BSWAP32
:
2395 case BUILT_IN_BSWAP64
:
2396 case BUILT_IN_BSWAP128
:
2397 val
= get_value_for_expr (gimple_call_arg (stmt
, 0), true);
2398 if (val
.lattice_val
== UNDEFINED
)
2400 else if (val
.lattice_val
== CONSTANT
2402 && TREE_CODE (val
.value
) == INTEGER_CST
)
2404 tree type
= TREE_TYPE (gimple_call_lhs (stmt
));
2405 int prec
= TYPE_PRECISION (type
);
2406 wide_int wval
= wi::to_wide (val
.value
);
2408 = wide_int_to_tree (type
,
2409 wi::bswap (wide_int::from (wval
, prec
,
2412 = widest_int::from (wi::bswap (wide_int::from (val
.mask
,
2416 if (wi::sext (val
.mask
, prec
) != -1)
2419 val
.lattice_val
= VARYING
;
2420 val
.value
= NULL_TREE
;
2427 if (is_gimple_call (stmt
) && gimple_call_lhs (stmt
))
2429 tree fntype
= gimple_call_fntype (stmt
);
2432 tree attrs
= lookup_attribute ("assume_aligned",
2433 TYPE_ATTRIBUTES (fntype
));
2435 val
= bit_value_assume_aligned (stmt
, attrs
, val
, false);
2436 attrs
= lookup_attribute ("alloc_align",
2437 TYPE_ATTRIBUTES (fntype
));
2439 val
= bit_value_assume_aligned (stmt
, attrs
, val
, true);
2441 int flags
= ignore_return_flags
2442 ? 0 : gimple_call_return_flags (as_a
<gcall
*> (stmt
));
2443 if (flags
& ERF_RETURNS_ARG
2444 && (flags
& ERF_RETURN_ARG_MASK
) < gimple_call_num_args (stmt
))
2446 val
= get_value_for_expr
2447 (gimple_call_arg (stmt
,
2448 flags
& ERF_RETURN_ARG_MASK
), true);
2451 is_constant
= (val
.lattice_val
== CONSTANT
);
2454 if (flag_tree_bit_ccp
2455 && ((is_constant
&& TREE_CODE (val
.value
) == INTEGER_CST
)
2457 && gimple_get_lhs (stmt
)
2458 && TREE_CODE (gimple_get_lhs (stmt
)) == SSA_NAME
)
2460 tree lhs
= gimple_get_lhs (stmt
);
2461 wide_int nonzero_bits
= get_nonzero_bits (lhs
);
2462 if (nonzero_bits
!= -1)
2466 val
.lattice_val
= CONSTANT
;
2467 val
.value
= build_zero_cst (TREE_TYPE (lhs
));
2468 val
.mask
= extend_mask (nonzero_bits
, TYPE_SIGN (TREE_TYPE (lhs
)));
2473 if (wi::bit_and_not (wi::to_wide (val
.value
), nonzero_bits
) != 0)
2474 val
.value
= wide_int_to_tree (TREE_TYPE (lhs
),
2476 & wi::to_wide (val
.value
));
2477 if (nonzero_bits
== 0)
2480 val
.mask
= val
.mask
& extend_mask (nonzero_bits
,
2481 TYPE_SIGN (TREE_TYPE (lhs
)));
2486 /* The statement produced a nonconstant value. */
2489 /* The statement produced a copy. */
2490 if (simplified
&& TREE_CODE (simplified
) == SSA_NAME
2491 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (simplified
))
2493 val
.lattice_val
= CONSTANT
;
2494 val
.value
= simplified
;
2497 /* The statement is VARYING. */
2500 val
.lattice_val
= VARYING
;
2501 val
.value
= NULL_TREE
;
2509 typedef hash_table
<nofree_ptr_hash
<gimple
> > gimple_htab
;
2511 /* Given a BUILT_IN_STACK_SAVE value SAVED_VAL, insert a clobber of VAR before
2512 each matching BUILT_IN_STACK_RESTORE. Mark visited phis in VISITED. */
2515 insert_clobber_before_stack_restore (tree saved_val
, tree var
,
2516 gimple_htab
**visited
)
2519 gassign
*clobber_stmt
;
2521 imm_use_iterator iter
;
2522 gimple_stmt_iterator i
;
2525 FOR_EACH_IMM_USE_STMT (stmt
, iter
, saved_val
)
2526 if (gimple_call_builtin_p (stmt
, BUILT_IN_STACK_RESTORE
))
2528 clobber
= build_clobber (TREE_TYPE (var
), CLOBBER_STORAGE_END
);
2529 clobber_stmt
= gimple_build_assign (var
, clobber
);
2531 i
= gsi_for_stmt (stmt
);
2532 gsi_insert_before (&i
, clobber_stmt
, GSI_SAME_STMT
);
2534 else if (gimple_code (stmt
) == GIMPLE_PHI
)
2537 *visited
= new gimple_htab (10);
2539 slot
= (*visited
)->find_slot (stmt
, INSERT
);
2544 insert_clobber_before_stack_restore (gimple_phi_result (stmt
), var
,
2547 else if (gimple_assign_ssa_name_copy_p (stmt
))
2548 insert_clobber_before_stack_restore (gimple_assign_lhs (stmt
), var
,
2552 /* Advance the iterator to the previous non-debug gimple statement in the same
2553 or dominating basic block. */
2556 gsi_prev_dom_bb_nondebug (gimple_stmt_iterator
*i
)
2560 gsi_prev_nondebug (i
);
2561 while (gsi_end_p (*i
))
2563 dom
= get_immediate_dominator (CDI_DOMINATORS
, gsi_bb (*i
));
2564 if (dom
== NULL
|| dom
== ENTRY_BLOCK_PTR_FOR_FN (cfun
))
2567 *i
= gsi_last_bb (dom
);
2571 /* Find a BUILT_IN_STACK_SAVE dominating gsi_stmt (I), and insert
2572 a clobber of VAR before each matching BUILT_IN_STACK_RESTORE.
2574 It is possible that BUILT_IN_STACK_SAVE cannot be found in a dominator when
2575 a previous pass (such as DOM) duplicated it along multiple paths to a BB.
2576 In that case the function gives up without inserting the clobbers. */
2579 insert_clobbers_for_var (gimple_stmt_iterator i
, tree var
)
2583 gimple_htab
*visited
= NULL
;
2585 for (; !gsi_end_p (i
); gsi_prev_dom_bb_nondebug (&i
))
2587 stmt
= gsi_stmt (i
);
2589 if (!gimple_call_builtin_p (stmt
, BUILT_IN_STACK_SAVE
))
2592 saved_val
= gimple_call_lhs (stmt
);
2593 if (saved_val
== NULL_TREE
)
2596 insert_clobber_before_stack_restore (saved_val
, var
, &visited
);
2603 /* Detects a __builtin_alloca_with_align with constant size argument. Declares
2604 fixed-size array and returns the address, if found, otherwise returns
2608 fold_builtin_alloca_with_align (gimple
*stmt
)
2610 unsigned HOST_WIDE_INT size
, threshold
, n_elem
;
2611 tree lhs
, arg
, block
, var
, elem_type
, array_type
;
2614 lhs
= gimple_call_lhs (stmt
);
2615 if (lhs
== NULL_TREE
)
2618 /* Detect constant argument. */
2619 arg
= get_constant_value (gimple_call_arg (stmt
, 0));
2620 if (arg
== NULL_TREE
2621 || TREE_CODE (arg
) != INTEGER_CST
2622 || !tree_fits_uhwi_p (arg
))
2625 size
= tree_to_uhwi (arg
);
2627 /* Heuristic: don't fold large allocas. */
2628 threshold
= (unsigned HOST_WIDE_INT
)param_large_stack_frame
;
2629 /* In case the alloca is located at function entry, it has the same lifetime
2630 as a declared array, so we allow a larger size. */
2631 block
= gimple_block (stmt
);
2632 if (!(cfun
->after_inlining
2634 && TREE_CODE (BLOCK_SUPERCONTEXT (block
)) == FUNCTION_DECL
))
2636 if (size
> threshold
)
2639 /* We have to be able to move points-to info. We used to assert
2640 that we can but IPA PTA might end up with two UIDs here
2641 as it might need to handle more than one instance being
2642 live at the same time. Instead of trying to detect this case
2643 (using the first UID would be OK) just give up for now. */
2644 struct ptr_info_def
*pi
= SSA_NAME_PTR_INFO (lhs
);
2648 && !pt_solution_singleton_or_null_p (&pi
->pt
, &uid
))
2651 /* Declare array. */
2652 elem_type
= build_nonstandard_integer_type (BITS_PER_UNIT
, 1);
2653 n_elem
= size
* 8 / BITS_PER_UNIT
;
2654 array_type
= build_array_type_nelts (elem_type
, n_elem
);
2656 if (tree ssa_name
= SSA_NAME_IDENTIFIER (lhs
))
2658 /* Give the temporary a name derived from the name of the VLA
2659 declaration so it can be referenced in diagnostics. */
2660 const char *name
= IDENTIFIER_POINTER (ssa_name
);
2661 var
= create_tmp_var (array_type
, name
);
2664 var
= create_tmp_var (array_type
);
2666 if (gimple
*lhsdef
= SSA_NAME_DEF_STMT (lhs
))
2668 /* Set the temporary's location to that of the VLA declaration
2669 so it can be pointed to in diagnostics. */
2670 location_t loc
= gimple_location (lhsdef
);
2671 DECL_SOURCE_LOCATION (var
) = loc
;
2674 SET_DECL_ALIGN (var
, TREE_INT_CST_LOW (gimple_call_arg (stmt
, 1)));
2676 SET_DECL_PT_UID (var
, uid
);
2678 /* Fold alloca to the address of the array. */
2679 return fold_convert (TREE_TYPE (lhs
), build_fold_addr_expr (var
));
2682 /* Fold the stmt at *GSI with CCP specific information that propagating
2683 and regular folding does not catch. */
2686 ccp_folder::fold_stmt (gimple_stmt_iterator
*gsi
)
2688 gimple
*stmt
= gsi_stmt (*gsi
);
2690 switch (gimple_code (stmt
))
2694 gcond
*cond_stmt
= as_a
<gcond
*> (stmt
);
2695 ccp_prop_value_t val
;
2696 /* Statement evaluation will handle type mismatches in constants
2697 more gracefully than the final propagation. This allows us to
2698 fold more conditionals here. */
2699 val
= evaluate_stmt (stmt
);
2700 if (val
.lattice_val
!= CONSTANT
2706 fprintf (dump_file
, "Folding predicate ");
2707 print_gimple_expr (dump_file
, stmt
, 0);
2708 fprintf (dump_file
, " to ");
2709 print_generic_expr (dump_file
, val
.value
);
2710 fprintf (dump_file
, "\n");
2713 if (integer_zerop (val
.value
))
2714 gimple_cond_make_false (cond_stmt
);
2716 gimple_cond_make_true (cond_stmt
);
2723 tree lhs
= gimple_call_lhs (stmt
);
2724 int flags
= gimple_call_flags (stmt
);
2727 bool changed
= false;
2730 /* If the call was folded into a constant make sure it goes
2731 away even if we cannot propagate into all uses because of
2734 && TREE_CODE (lhs
) == SSA_NAME
2735 && (val
= get_constant_value (lhs
))
2736 /* Don't optimize away calls that have side-effects. */
2737 && (flags
& (ECF_CONST
|ECF_PURE
)) != 0
2738 && (flags
& ECF_LOOPING_CONST_OR_PURE
) == 0)
2740 tree new_rhs
= unshare_expr (val
);
2741 if (!useless_type_conversion_p (TREE_TYPE (lhs
),
2742 TREE_TYPE (new_rhs
)))
2743 new_rhs
= fold_convert (TREE_TYPE (lhs
), new_rhs
);
2744 gimplify_and_update_call_from_tree (gsi
, new_rhs
);
2748 /* Internal calls provide no argument types, so the extra laxity
2749 for normal calls does not apply. */
2750 if (gimple_call_internal_p (stmt
))
2753 /* The heuristic of fold_builtin_alloca_with_align differs before and
2754 after inlining, so we don't require the arg to be changed into a
2755 constant for folding, but just to be constant. */
2756 if (gimple_call_builtin_p (stmt
, BUILT_IN_ALLOCA_WITH_ALIGN
)
2757 || gimple_call_builtin_p (stmt
, BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
))
2759 tree new_rhs
= fold_builtin_alloca_with_align (stmt
);
2762 gimplify_and_update_call_from_tree (gsi
, new_rhs
);
2763 tree var
= TREE_OPERAND (TREE_OPERAND (new_rhs
, 0),0);
2764 insert_clobbers_for_var (*gsi
, var
);
2769 /* If there's no extra info from an assume_aligned call,
2770 drop it so it doesn't act as otherwise useless dataflow
2772 if (gimple_call_builtin_p (stmt
, BUILT_IN_ASSUME_ALIGNED
))
2774 tree ptr
= gimple_call_arg (stmt
, 0);
2775 ccp_prop_value_t ptrval
= get_value_for_expr (ptr
, true);
2776 if (ptrval
.lattice_val
== CONSTANT
2777 && TREE_CODE (ptrval
.value
) == INTEGER_CST
2778 && ptrval
.mask
!= 0)
2780 ccp_prop_value_t val
2781 = bit_value_assume_aligned (stmt
, NULL_TREE
, ptrval
, false);
2782 unsigned int ptralign
= least_bit_hwi (ptrval
.mask
.to_uhwi ());
2783 unsigned int align
= least_bit_hwi (val
.mask
.to_uhwi ());
2784 if (ptralign
== align
2785 && ((TREE_INT_CST_LOW (ptrval
.value
) & (align
- 1))
2786 == (TREE_INT_CST_LOW (val
.value
) & (align
- 1))))
2788 replace_call_with_value (gsi
, ptr
);
2794 /* Propagate into the call arguments. Compared to replace_uses_in
2795 this can use the argument slot types for type verification
2796 instead of the current argument type. We also can safely
2797 drop qualifiers here as we are dealing with constants anyway. */
2798 argt
= TYPE_ARG_TYPES (gimple_call_fntype (stmt
));
2799 for (i
= 0; i
< gimple_call_num_args (stmt
) && argt
;
2800 ++i
, argt
= TREE_CHAIN (argt
))
2802 tree arg
= gimple_call_arg (stmt
, i
);
2803 if (TREE_CODE (arg
) == SSA_NAME
2804 && (val
= get_constant_value (arg
))
2805 && useless_type_conversion_p
2806 (TYPE_MAIN_VARIANT (TREE_VALUE (argt
)),
2807 TYPE_MAIN_VARIANT (TREE_TYPE (val
))))
2809 gimple_call_set_arg (stmt
, i
, unshare_expr (val
));
2819 tree lhs
= gimple_assign_lhs (stmt
);
2822 /* If we have a load that turned out to be constant replace it
2823 as we cannot propagate into all uses in all cases. */
2824 if (gimple_assign_single_p (stmt
)
2825 && TREE_CODE (lhs
) == SSA_NAME
2826 && (val
= get_constant_value (lhs
)))
2828 tree rhs
= unshare_expr (val
);
2829 if (!useless_type_conversion_p (TREE_TYPE (lhs
), TREE_TYPE (rhs
)))
2830 rhs
= fold_build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (lhs
), rhs
);
2831 gimple_assign_set_rhs_from_tree (gsi
, rhs
);
2843 /* Visit the assignment statement STMT. Set the value of its LHS to the
2844 value computed by the RHS and store LHS in *OUTPUT_P. If STMT
2845 creates virtual definitions, set the value of each new name to that
2846 of the RHS (if we can derive a constant out of the RHS).
2847 Value-returning call statements also perform an assignment, and
2848 are handled here. */
2850 static enum ssa_prop_result
2851 visit_assignment (gimple
*stmt
, tree
*output_p
)
2853 ccp_prop_value_t val
;
2854 enum ssa_prop_result retval
= SSA_PROP_NOT_INTERESTING
;
2856 tree lhs
= gimple_get_lhs (stmt
);
2857 if (TREE_CODE (lhs
) == SSA_NAME
)
2859 /* Evaluate the statement, which could be
2860 either a GIMPLE_ASSIGN or a GIMPLE_CALL. */
2861 val
= evaluate_stmt (stmt
);
2863 /* If STMT is an assignment to an SSA_NAME, we only have one
2865 if (set_lattice_value (lhs
, &val
))
2868 if (val
.lattice_val
== VARYING
)
2869 retval
= SSA_PROP_VARYING
;
2871 retval
= SSA_PROP_INTERESTING
;
2879 /* Visit the conditional statement STMT. Return SSA_PROP_INTERESTING
2880 if it can determine which edge will be taken. Otherwise, return
2881 SSA_PROP_VARYING. */
2883 static enum ssa_prop_result
2884 visit_cond_stmt (gimple
*stmt
, edge
*taken_edge_p
)
2886 ccp_prop_value_t val
;
2889 block
= gimple_bb (stmt
);
2890 val
= evaluate_stmt (stmt
);
2891 if (val
.lattice_val
!= CONSTANT
2893 return SSA_PROP_VARYING
;
2895 /* Find which edge out of the conditional block will be taken and add it
2896 to the worklist. If no single edge can be determined statically,
2897 return SSA_PROP_VARYING to feed all the outgoing edges to the
2898 propagation engine. */
2899 *taken_edge_p
= find_taken_edge (block
, val
.value
);
2901 return SSA_PROP_INTERESTING
;
2903 return SSA_PROP_VARYING
;
2907 /* Evaluate statement STMT. If the statement produces an output value and
2908 its evaluation changes the lattice value of its output, return
2909 SSA_PROP_INTERESTING and set *OUTPUT_P to the SSA_NAME holding the
2912 If STMT is a conditional branch and we can determine its truth
2913 value, set *TAKEN_EDGE_P accordingly. If STMT produces a varying
2914 value, return SSA_PROP_VARYING. */
2916 enum ssa_prop_result
2917 ccp_propagate::visit_stmt (gimple
*stmt
, edge
*taken_edge_p
, tree
*output_p
)
2922 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2924 fprintf (dump_file
, "\nVisiting statement:\n");
2925 print_gimple_stmt (dump_file
, stmt
, 0, dump_flags
);
2928 switch (gimple_code (stmt
))
2931 /* If the statement is an assignment that produces a single
2932 output value, evaluate its RHS to see if the lattice value of
2933 its output has changed. */
2934 return visit_assignment (stmt
, output_p
);
2937 /* A value-returning call also performs an assignment. */
2938 if (gimple_call_lhs (stmt
) != NULL_TREE
)
2939 return visit_assignment (stmt
, output_p
);
2944 /* If STMT is a conditional branch, see if we can determine
2945 which branch will be taken. */
2946 /* FIXME. It appears that we should be able to optimize
2947 computed GOTOs here as well. */
2948 return visit_cond_stmt (stmt
, taken_edge_p
);
2954 /* Any other kind of statement is not interesting for constant
2955 propagation and, therefore, not worth simulating. */
2956 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2957 fprintf (dump_file
, "No interesting values produced. Marked VARYING.\n");
2959 /* Definitions made by statements other than assignments to
2960 SSA_NAMEs represent unknown modifications to their outputs.
2961 Mark them VARYING. */
2962 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, iter
, SSA_OP_ALL_DEFS
)
2963 set_value_varying (def
);
2965 return SSA_PROP_VARYING
;
2969 /* Main entry point for SSA Conditional Constant Propagation. If NONZERO_P,
2970 record nonzero bits. */
2973 do_ssa_ccp (bool nonzero_p
)
2975 unsigned int todo
= 0;
2976 calculate_dominance_info (CDI_DOMINATORS
);
2979 class ccp_propagate ccp_propagate
;
2980 ccp_propagate
.ssa_propagate ();
2981 if (ccp_finalize (nonzero_p
|| flag_ipa_bit_cp
))
2983 todo
= (TODO_cleanup_cfg
| TODO_update_ssa
);
2985 /* ccp_finalize does not preserve loop-closed ssa. */
2986 loops_state_clear (LOOP_CLOSED_SSA
);
2989 free_dominance_info (CDI_DOMINATORS
);
2996 const pass_data pass_data_ccp
=
2998 GIMPLE_PASS
, /* type */
3000 OPTGROUP_NONE
, /* optinfo_flags */
3001 TV_TREE_CCP
, /* tv_id */
3002 ( PROP_cfg
| PROP_ssa
), /* properties_required */
3003 0, /* properties_provided */
3004 0, /* properties_destroyed */
3005 0, /* todo_flags_start */
3006 TODO_update_address_taken
, /* todo_flags_finish */
3009 class pass_ccp
: public gimple_opt_pass
3012 pass_ccp (gcc::context
*ctxt
)
3013 : gimple_opt_pass (pass_data_ccp
, ctxt
), nonzero_p (false)
3016 /* opt_pass methods: */
3017 opt_pass
* clone () final override
{ return new pass_ccp (m_ctxt
); }
3018 void set_pass_param (unsigned int n
, bool param
) final override
3020 gcc_assert (n
== 0);
3023 bool gate (function
*) final override
{ return flag_tree_ccp
!= 0; }
3024 unsigned int execute (function
*) final override
3026 return do_ssa_ccp (nonzero_p
);
3030 /* Determines whether the pass instance records nonzero bits. */
3032 }; // class pass_ccp
3037 make_pass_ccp (gcc::context
*ctxt
)
3039 return new pass_ccp (ctxt
);
3044 /* Try to optimize out __builtin_stack_restore. Optimize it out
3045 if there is another __builtin_stack_restore in the same basic
3046 block and no calls or ASM_EXPRs are in between, or if this block's
3047 only outgoing edge is to EXIT_BLOCK and there are no calls or
3048 ASM_EXPRs after this __builtin_stack_restore. */
3051 optimize_stack_restore (gimple_stmt_iterator i
)
3056 basic_block bb
= gsi_bb (i
);
3057 gimple
*call
= gsi_stmt (i
);
3059 if (gimple_code (call
) != GIMPLE_CALL
3060 || gimple_call_num_args (call
) != 1
3061 || TREE_CODE (gimple_call_arg (call
, 0)) != SSA_NAME
3062 || !POINTER_TYPE_P (TREE_TYPE (gimple_call_arg (call
, 0))))
3065 for (gsi_next (&i
); !gsi_end_p (i
); gsi_next (&i
))
3067 stmt
= gsi_stmt (i
);
3068 if (gimple_code (stmt
) == GIMPLE_ASM
)
3070 if (gimple_code (stmt
) != GIMPLE_CALL
)
3073 callee
= gimple_call_fndecl (stmt
);
3075 || !fndecl_built_in_p (callee
, BUILT_IN_NORMAL
)
3076 /* All regular builtins are ok, just obviously not alloca. */
3077 || ALLOCA_FUNCTION_CODE_P (DECL_FUNCTION_CODE (callee
))
3078 /* Do not remove stack updates before strub leave. */
3079 || fndecl_built_in_p (callee
, BUILT_IN___STRUB_LEAVE
))
3082 if (fndecl_built_in_p (callee
, BUILT_IN_STACK_RESTORE
))
3083 goto second_stack_restore
;
3089 /* Allow one successor of the exit block, or zero successors. */
3090 switch (EDGE_COUNT (bb
->succs
))
3095 if (single_succ_edge (bb
)->dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
3101 second_stack_restore
:
3103 /* If there's exactly one use, then zap the call to __builtin_stack_save.
3104 If there are multiple uses, then the last one should remove the call.
3105 In any case, whether the call to __builtin_stack_save can be removed
3106 or not is irrelevant to removing the call to __builtin_stack_restore. */
3107 if (has_single_use (gimple_call_arg (call
, 0)))
3109 gimple
*stack_save
= SSA_NAME_DEF_STMT (gimple_call_arg (call
, 0));
3110 if (is_gimple_call (stack_save
))
3112 callee
= gimple_call_fndecl (stack_save
);
3113 if (callee
&& fndecl_built_in_p (callee
, BUILT_IN_STACK_SAVE
))
3115 gimple_stmt_iterator stack_save_gsi
;
3118 stack_save_gsi
= gsi_for_stmt (stack_save
);
3119 rhs
= build_int_cst (TREE_TYPE (gimple_call_arg (call
, 0)), 0);
3120 replace_call_with_value (&stack_save_gsi
, rhs
);
3125 /* No effect, so the statement will be deleted. */
3126 return integer_zero_node
;
3129 /* If va_list type is a simple pointer and nothing special is needed,
3130 optimize __builtin_va_start (&ap, 0) into ap = __builtin_next_arg (0),
3131 __builtin_va_end (&ap) out as NOP and __builtin_va_copy into a simple
3132 pointer assignment. */
3135 optimize_stdarg_builtin (gimple
*call
)
3137 tree callee
, lhs
, rhs
, cfun_va_list
;
3138 bool va_list_simple_ptr
;
3139 location_t loc
= gimple_location (call
);
3141 callee
= gimple_call_fndecl (call
);
3143 cfun_va_list
= targetm
.fn_abi_va_list (callee
);
3144 va_list_simple_ptr
= POINTER_TYPE_P (cfun_va_list
)
3145 && (TREE_TYPE (cfun_va_list
) == void_type_node
3146 || TREE_TYPE (cfun_va_list
) == char_type_node
);
3148 switch (DECL_FUNCTION_CODE (callee
))
3150 case BUILT_IN_VA_START
:
3151 if (!va_list_simple_ptr
3152 || targetm
.expand_builtin_va_start
!= NULL
3153 || !builtin_decl_explicit_p (BUILT_IN_NEXT_ARG
))
3156 if (gimple_call_num_args (call
) != 2)
3159 lhs
= gimple_call_arg (call
, 0);
3160 if (!POINTER_TYPE_P (TREE_TYPE (lhs
))
3161 || TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (lhs
)))
3162 != TYPE_MAIN_VARIANT (cfun_va_list
))
3165 lhs
= build_fold_indirect_ref_loc (loc
, lhs
);
3166 rhs
= build_call_expr_loc (loc
, builtin_decl_explicit (BUILT_IN_NEXT_ARG
),
3167 1, integer_zero_node
);
3168 rhs
= fold_convert_loc (loc
, TREE_TYPE (lhs
), rhs
);
3169 return build2 (MODIFY_EXPR
, TREE_TYPE (lhs
), lhs
, rhs
);
3171 case BUILT_IN_VA_COPY
:
3172 if (!va_list_simple_ptr
)
3175 if (gimple_call_num_args (call
) != 2)
3178 lhs
= gimple_call_arg (call
, 0);
3179 if (!POINTER_TYPE_P (TREE_TYPE (lhs
))
3180 || TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (lhs
)))
3181 != TYPE_MAIN_VARIANT (cfun_va_list
))
3184 lhs
= build_fold_indirect_ref_loc (loc
, lhs
);
3185 rhs
= gimple_call_arg (call
, 1);
3186 if (TYPE_MAIN_VARIANT (TREE_TYPE (rhs
))
3187 != TYPE_MAIN_VARIANT (cfun_va_list
))
3190 rhs
= fold_convert_loc (loc
, TREE_TYPE (lhs
), rhs
);
3191 return build2 (MODIFY_EXPR
, TREE_TYPE (lhs
), lhs
, rhs
);
3193 case BUILT_IN_VA_END
:
3194 /* No effect, so the statement will be deleted. */
3195 return integer_zero_node
;
3202 /* Attemp to make the block of __builtin_unreachable I unreachable by changing
3203 the incoming jumps. Return true if at least one jump was changed. */
3206 optimize_unreachable (gimple_stmt_iterator i
)
3208 basic_block bb
= gsi_bb (i
);
3209 gimple_stmt_iterator gsi
;
3215 if (flag_sanitize
& SANITIZE_UNREACHABLE
)
3218 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
3220 stmt
= gsi_stmt (gsi
);
3222 if (is_gimple_debug (stmt
))
3225 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
3227 /* Verify we do not need to preserve the label. */
3228 if (FORCED_LABEL (gimple_label_label (label_stmt
)))
3234 /* Only handle the case that __builtin_unreachable is the first statement
3235 in the block. We rely on DCE to remove stmts without side-effects
3236 before __builtin_unreachable. */
3237 if (gsi_stmt (gsi
) != gsi_stmt (i
))
3242 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
3244 gsi
= gsi_last_bb (e
->src
);
3245 if (gsi_end_p (gsi
))
3248 stmt
= gsi_stmt (gsi
);
3249 if (gcond
*cond_stmt
= dyn_cast
<gcond
*> (stmt
))
3251 if (e
->flags
& EDGE_TRUE_VALUE
)
3252 gimple_cond_make_false (cond_stmt
);
3253 else if (e
->flags
& EDGE_FALSE_VALUE
)
3254 gimple_cond_make_true (cond_stmt
);
3257 update_stmt (cond_stmt
);
3261 /* Todo: handle other cases. Note that unreachable switch case
3262 statements have already been removed. */
3273 _1 = __atomic_fetch_or_* (ptr_6, 1, _3);
3277 _1 = __atomic_fetch_or_* (ptr_6, 1, _3);
3281 _1 = __atomic_fetch_and_* (ptr_6, ~1, _3);
3285 _1 = __atomic_fetch_and_* (ptr_6, ~1, _3);
3289 USE_STMT is the gimplt statement which uses the return value of
3290 __atomic_fetch_or_*. LHS is the return value of __atomic_fetch_or_*.
3291 MASK is the mask passed to __atomic_fetch_or_*.
3295 convert_atomic_bit_not (enum internal_fn fn
, gimple
*use_stmt
,
3296 tree lhs
, tree mask
)
3299 if (fn
== IFN_ATOMIC_BIT_TEST_AND_RESET
)
3301 /* MASK must be ~1. */
3302 if (!operand_equal_p (build_int_cst (TREE_TYPE (lhs
),
3303 ~HOST_WIDE_INT_1
), mask
, 0))
3305 and_mask
= build_int_cst (TREE_TYPE (lhs
), 1);
3309 /* MASK must be 1. */
3310 if (!operand_equal_p (build_int_cst (TREE_TYPE (lhs
), 1), mask
, 0))
3315 tree use_lhs
= gimple_assign_lhs (use_stmt
);
3317 use_operand_p use_p
;
3318 gimple
*use_not_stmt
;
3320 if (!single_imm_use (use_lhs
, &use_p
, &use_not_stmt
)
3321 || !is_gimple_assign (use_not_stmt
))
3324 if (!CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (use_not_stmt
)))
3327 tree use_not_lhs
= gimple_assign_lhs (use_not_stmt
);
3328 if (TREE_CODE (TREE_TYPE (use_not_lhs
)) != BOOLEAN_TYPE
)
3331 gimple_stmt_iterator gsi
;
3332 gsi
= gsi_for_stmt (use_stmt
);
3333 gsi_remove (&gsi
, true);
3334 tree var
= make_ssa_name (TREE_TYPE (lhs
));
3335 use_stmt
= gimple_build_assign (var
, BIT_AND_EXPR
, lhs
, and_mask
);
3336 gsi
= gsi_for_stmt (use_not_stmt
);
3337 gsi_insert_before (&gsi
, use_stmt
, GSI_NEW_STMT
);
3338 lhs
= gimple_assign_lhs (use_not_stmt
);
3339 gimple
*g
= gimple_build_assign (lhs
, EQ_EXPR
, var
,
3340 build_zero_cst (TREE_TYPE (mask
)));
3341 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
3342 gsi
= gsi_for_stmt (use_not_stmt
);
3343 gsi_remove (&gsi
, true);
3347 /* match.pd function to match atomic_bit_test_and pattern which
3349 _1 = __atomic_fetch_or_4 (&v, 1, 0);
3353 extern bool gimple_nop_atomic_bit_test_and_p (tree
, tree
*,
3355 extern bool gimple_nop_convert (tree
, tree
*, tree (*) (tree
));
3358 mask_2 = 1 << cnt_1;
3359 _4 = __atomic_fetch_or_* (ptr_6, mask_2, _3);
3362 _4 = .ATOMIC_BIT_TEST_AND_SET (ptr_6, cnt_1, 0, _3);
3364 If _5 is only used in _5 != 0 or _5 == 0 comparisons, 1
3365 is passed instead of 0, and the builtin just returns a zero
3366 or 1 value instead of the actual bit.
3367 Similarly for __sync_fetch_and_or_* (without the ", _3" part
3368 in there), and/or if mask_2 is a power of 2 constant.
3369 Similarly for xor instead of or, use ATOMIC_BIT_TEST_AND_COMPLEMENT
3370 in that case. And similarly for and instead of or, except that
3371 the second argument to the builtin needs to be one's complement
3372 of the mask instead of mask. */
3375 optimize_atomic_bit_test_and (gimple_stmt_iterator
*gsip
,
3376 enum internal_fn fn
, bool has_model_arg
,
3379 gimple
*call
= gsi_stmt (*gsip
);
3380 tree lhs
= gimple_call_lhs (call
);
3381 use_operand_p use_p
;
3386 if (!flag_inline_atomics
3388 || !gimple_call_builtin_p (call
, BUILT_IN_NORMAL
)
3390 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (lhs
)
3391 || !single_imm_use (lhs
, &use_p
, &use_stmt
)
3392 || !is_gimple_assign (use_stmt
)
3393 || !gimple_vdef (call
))
3398 case IFN_ATOMIC_BIT_TEST_AND_SET
:
3399 optab
= atomic_bit_test_and_set_optab
;
3401 case IFN_ATOMIC_BIT_TEST_AND_COMPLEMENT
:
3402 optab
= atomic_bit_test_and_complement_optab
;
3404 case IFN_ATOMIC_BIT_TEST_AND_RESET
:
3405 optab
= atomic_bit_test_and_reset_optab
;
3413 mask
= gimple_call_arg (call
, 1);
3414 tree_code rhs_code
= gimple_assign_rhs_code (use_stmt
);
3415 if (rhs_code
!= BIT_AND_EXPR
)
3417 if (rhs_code
!= NOP_EXPR
&& rhs_code
!= BIT_NOT_EXPR
)
3420 tree use_lhs
= gimple_assign_lhs (use_stmt
);
3421 if (TREE_CODE (use_lhs
) == SSA_NAME
3422 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use_lhs
))
3425 tree use_rhs
= gimple_assign_rhs1 (use_stmt
);
3429 if (optab_handler (optab
, TYPE_MODE (TREE_TYPE (lhs
)))
3430 == CODE_FOR_nothing
)
3434 gimple_stmt_iterator gsi
;
3438 if (rhs_code
== BIT_NOT_EXPR
)
3440 g
= convert_atomic_bit_not (fn
, use_stmt
, lhs
, mask
);
3446 else if (TREE_CODE (TREE_TYPE (use_lhs
)) == BOOLEAN_TYPE
)
3449 if (fn
== IFN_ATOMIC_BIT_TEST_AND_RESET
)
3451 /* MASK must be ~1. */
3452 if (!operand_equal_p (build_int_cst (TREE_TYPE (lhs
),
3458 _1 = __atomic_fetch_and_* (ptr_6, ~1, _3);
3461 _1 = __atomic_fetch_and_* (ptr_6, ~1, _3);
3465 and_mask
= build_int_cst (TREE_TYPE (lhs
), 1);
3469 and_mask
= build_int_cst (TREE_TYPE (lhs
), 1);
3470 if (!operand_equal_p (and_mask
, mask
, 0))
3474 _1 = __atomic_fetch_or_* (ptr_6, 1, _3);
3477 _1 = __atomic_fetch_or_* (ptr_6, 1, _3);
3482 var
= make_ssa_name (TREE_TYPE (use_rhs
));
3483 replace_uses_by (use_rhs
, var
);
3484 g
= gimple_build_assign (var
, BIT_AND_EXPR
, use_rhs
,
3486 gsi
= gsi_for_stmt (use_stmt
);
3487 gsi_insert_before (&gsi
, g
, GSI_NEW_STMT
);
3491 else if (TYPE_PRECISION (TREE_TYPE (use_lhs
))
3492 <= TYPE_PRECISION (TREE_TYPE (use_rhs
)))
3494 gimple
*use_nop_stmt
;
3495 if (!single_imm_use (use_lhs
, &use_p
, &use_nop_stmt
)
3496 || (!is_gimple_assign (use_nop_stmt
)
3497 && gimple_code (use_nop_stmt
) != GIMPLE_COND
))
3504 tree use_nop_lhs
= nullptr;
3505 rhs_code
= ERROR_MARK
;
3506 if (is_gimple_assign (use_nop_stmt
))
3508 use_nop_lhs
= gimple_assign_lhs (use_nop_stmt
);
3509 rhs_code
= gimple_assign_rhs_code (use_nop_stmt
);
3511 if (!use_nop_lhs
|| rhs_code
!= BIT_AND_EXPR
)
3517 && TREE_CODE (use_nop_lhs
) == SSA_NAME
3518 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use_nop_lhs
))
3520 if (use_nop_lhs
&& rhs_code
== BIT_NOT_EXPR
)
3525 g
= convert_atomic_bit_not (fn
, use_nop_stmt
, lhs
,
3530 _1 = __atomic_fetch_or_4 (ptr_6, 1, _3);
3535 _1 = __atomic_fetch_or_4 (ptr_6, ~1, _3);
3539 _1 = __atomic_fetch_and_4 (ptr_6, ~1, _3);
3544 _1 = __atomic_fetch_and_4 (ptr_6, 1, _3);
3548 gsi
= gsi_for_stmt (use_stmt
);
3549 gsi_remove (&gsi
, true);
3555 tree cmp_rhs1
, cmp_rhs2
;
3561 if (TREE_CODE (TREE_TYPE (use_nop_lhs
))
3564 cmp_rhs1
= gimple_assign_rhs1 (use_nop_stmt
);
3565 cmp_rhs2
= gimple_assign_rhs2 (use_nop_stmt
);
3572 rhs_code
= gimple_cond_code (use_nop_stmt
);
3573 cmp_rhs1
= gimple_cond_lhs (use_nop_stmt
);
3574 cmp_rhs2
= gimple_cond_rhs (use_nop_stmt
);
3576 if (rhs_code
!= GE_EXPR
&& rhs_code
!= LT_EXPR
)
3578 if (use_lhs
!= cmp_rhs1
)
3580 if (!integer_zerop (cmp_rhs2
))
3585 unsigned HOST_WIDE_INT bytes
3586 = tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (use_rhs
)));
3587 ibit
= bytes
* BITS_PER_UNIT
- 1;
3588 unsigned HOST_WIDE_INT highest
3589 = HOST_WIDE_INT_1U
<< ibit
;
3591 if (fn
== IFN_ATOMIC_BIT_TEST_AND_RESET
)
3593 /* Get the signed maximum of the USE_RHS type. */
3594 and_mask
= build_int_cst (TREE_TYPE (use_rhs
),
3596 if (!operand_equal_p (and_mask
, mask
, 0))
3600 _1 = __atomic_fetch_and_4 (ptr_6, 0x7fffffff, _3);
3601 _5 = (signed int) _1;
3602 _4 = _5 < 0 or _5 >= 0;
3604 _1 = __atomic_fetch_and_4 (ptr_6, 0x7fffffff, _3);
3605 _6 = _1 & 0x80000000;
3606 _4 = _6 != 0 or _6 == 0;
3608 _1 = __atomic_fetch_and_4 (ptr_6, 0x7fffffff, _3);
3609 _5 = (signed int) _1;
3610 if (_5 < 0 or _5 >= 0)
3612 _1 = __atomic_fetch_and_4 (ptr_6, 0x7fffffff, _3);
3613 _6 = _1 & 0x80000000;
3614 if (_6 != 0 or _6 == 0)
3616 and_mask
= build_int_cst (TREE_TYPE (use_rhs
),
3621 /* Get the signed minimum of the USE_RHS type. */
3622 and_mask
= build_int_cst (TREE_TYPE (use_rhs
),
3624 if (!operand_equal_p (and_mask
, mask
, 0))
3628 _1 = __atomic_fetch_or_4 (ptr_6, 0x80000000, _3);
3629 _5 = (signed int) _1;
3630 _4 = _5 < 0 or _5 >= 0;
3632 _1 = __atomic_fetch_or_4 (ptr_6, 0x80000000, _3);
3633 _6 = _1 & 0x80000000;
3634 _4 = _6 != 0 or _6 == 0;
3636 _1 = __atomic_fetch_or_4 (ptr_6, 0x80000000, _3);
3637 _5 = (signed int) _1;
3638 if (_5 < 0 or _5 >= 0)
3640 _1 = __atomic_fetch_or_4 (ptr_6, 0x80000000, _3);
3641 _6 = _1 & 0x80000000;
3642 if (_6 != 0 or _6 == 0)
3645 var
= make_ssa_name (TREE_TYPE (use_rhs
));
3646 gsi
= gsi_for_stmt (use_stmt
);
3647 gsi_remove (&gsi
, true);
3648 g
= gimple_build_assign (var
, BIT_AND_EXPR
, use_rhs
,
3650 gsi
= gsi_for_stmt (use_nop_stmt
);
3651 gsi_insert_before (&gsi
, g
, GSI_NEW_STMT
);
3653 rhs_code
= rhs_code
== GE_EXPR
? EQ_EXPR
: NE_EXPR
;
3654 tree const_zero
= build_zero_cst (TREE_TYPE (use_rhs
));
3656 g
= gimple_build_assign (use_nop_lhs
, rhs_code
,
3659 g
= gimple_build_cond (rhs_code
, var
, const_zero
,
3661 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
3662 gsi
= gsi_for_stmt (use_nop_stmt
);
3663 gsi_remove (&gsi
, true);
3670 if (!gimple_nop_atomic_bit_test_and_p (use_nop_lhs
,
3672 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (match_op
[2])
3673 || !single_imm_use (match_op
[2], &use_p
, &g
)
3674 || !is_gimple_assign (g
))
3677 if (TREE_CODE (match_op
[1]) == INTEGER_CST
)
3679 ibit
= tree_log2 (match_op
[1]);
3680 gcc_assert (ibit
>= 0);
3684 g
= SSA_NAME_DEF_STMT (match_op
[1]);
3685 gcc_assert (is_gimple_assign (g
));
3686 bit
= gimple_assign_rhs2 (g
);
3689 _1 = __atomic_fetch_or_4 (ptr_6, mask, _3);
3693 _1 = __atomic_fetch_or_4 (ptr_6, mask, _3);
3698 _2 = (unsigned int) _1;
3699 _3 = __atomic_fetch_and_4 (ptr_6, _2, 0);
3703 _1 = __atomic_fetch_and_* (ptr_6, ~mask_7, _3);
3708 _1 = __atomic_fetch_and_4 (ptr_6, ~mask, _3);
3709 _2 = (short int) _1;
3712 _1 = __atomic_fetch_and_4 (ptr_6, ~mask, _3);
3714 _5 = (short int) _8;
3716 gimple_seq stmts
= NULL
;
3717 match_op
[1] = gimple_convert (&stmts
,
3718 TREE_TYPE (use_rhs
),
3720 var
= gimple_build (&stmts
, BIT_AND_EXPR
,
3721 TREE_TYPE (use_rhs
), use_rhs
, match_op
[1]);
3722 gsi
= gsi_for_stmt (use_stmt
);
3723 gsi_remove (&gsi
, true);
3724 release_defs (use_stmt
);
3725 use_stmt
= gimple_seq_last_stmt (stmts
);
3726 gsi
= gsi_for_stmt (use_nop_stmt
);
3727 gsi_insert_seq_before (&gsi
, stmts
, GSI_SAME_STMT
);
3728 gimple_assign_set_rhs_with_ops (&gsi
, CONVERT_EXPR
, var
);
3729 update_stmt (use_nop_stmt
);
3739 bit
= build_int_cst (TREE_TYPE (lhs
), ibit
);
3742 else if (optab_handler (optab
, TYPE_MODE (TREE_TYPE (lhs
)))
3743 == CODE_FOR_nothing
)
3746 tree use_lhs
= gimple_assign_lhs (use_stmt
);
3752 if (TREE_CODE (mask
) == INTEGER_CST
)
3754 if (fn
== IFN_ATOMIC_BIT_TEST_AND_RESET
)
3755 mask
= const_unop (BIT_NOT_EXPR
, TREE_TYPE (mask
), mask
);
3756 mask
= fold_convert (TREE_TYPE (lhs
), mask
);
3757 int ibit
= tree_log2 (mask
);
3760 bit
= build_int_cst (TREE_TYPE (lhs
), ibit
);
3762 else if (TREE_CODE (mask
) == SSA_NAME
)
3764 gimple
*g
= SSA_NAME_DEF_STMT (mask
);
3766 if (gimple_nop_convert (mask
, &match_op
, NULL
))
3769 if (TREE_CODE (mask
) != SSA_NAME
)
3771 g
= SSA_NAME_DEF_STMT (mask
);
3773 if (!is_gimple_assign (g
))
3776 if (fn
== IFN_ATOMIC_BIT_TEST_AND_RESET
)
3778 if (gimple_assign_rhs_code (g
) != BIT_NOT_EXPR
)
3780 mask
= gimple_assign_rhs1 (g
);
3781 if (TREE_CODE (mask
) != SSA_NAME
)
3783 g
= SSA_NAME_DEF_STMT (mask
);
3786 if (!is_gimple_assign (g
)
3787 || gimple_assign_rhs_code (g
) != LSHIFT_EXPR
3788 || !integer_onep (gimple_assign_rhs1 (g
)))
3790 bit
= gimple_assign_rhs2 (g
);
3796 if (gimple_assign_rhs1 (use_stmt
) == lhs
)
3797 cmp_mask
= gimple_assign_rhs2 (use_stmt
);
3799 cmp_mask
= gimple_assign_rhs1 (use_stmt
);
3802 if (gimple_nop_convert (cmp_mask
, &match_op
, NULL
))
3803 cmp_mask
= match_op
;
3805 if (!operand_equal_p (cmp_mask
, mask
, 0))
3809 bool use_bool
= true;
3810 bool has_debug_uses
= false;
3811 imm_use_iterator iter
;
3814 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use_lhs
))
3816 FOR_EACH_IMM_USE_STMT (g
, iter
, use_lhs
)
3818 enum tree_code code
= ERROR_MARK
;
3819 tree op0
= NULL_TREE
, op1
= NULL_TREE
;
3820 if (is_gimple_debug (g
))
3822 has_debug_uses
= true;
3825 else if (is_gimple_assign (g
))
3826 switch (gimple_assign_rhs_code (g
))
3829 op1
= gimple_assign_rhs1 (g
);
3830 code
= TREE_CODE (op1
);
3831 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
3833 op0
= TREE_OPERAND (op1
, 0);
3834 op1
= TREE_OPERAND (op1
, 1);
3838 code
= gimple_assign_rhs_code (g
);
3839 op0
= gimple_assign_rhs1 (g
);
3840 op1
= gimple_assign_rhs2 (g
);
3845 else if (gimple_code (g
) == GIMPLE_COND
)
3847 code
= gimple_cond_code (g
);
3848 op0
= gimple_cond_lhs (g
);
3849 op1
= gimple_cond_rhs (g
);
3852 if ((code
== EQ_EXPR
|| code
== NE_EXPR
)
3854 && integer_zerop (op1
))
3856 use_operand_p use_p
;
3858 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
3868 tree new_lhs
= make_ssa_name (TREE_TYPE (lhs
));
3869 tree flag
= build_int_cst (TREE_TYPE (lhs
), use_bool
);
3871 g
= gimple_build_call_internal (fn
, 5, gimple_call_arg (call
, 0),
3872 bit
, flag
, gimple_call_arg (call
, 2),
3873 gimple_call_fn (call
));
3875 g
= gimple_build_call_internal (fn
, 4, gimple_call_arg (call
, 0),
3876 bit
, flag
, gimple_call_fn (call
));
3877 gimple_call_set_lhs (g
, new_lhs
);
3878 gimple_set_location (g
, gimple_location (call
));
3879 gimple_move_vops (g
, call
);
3880 bool throws
= stmt_can_throw_internal (cfun
, call
);
3881 gimple_call_set_nothrow (as_a
<gcall
*> (g
),
3882 gimple_call_nothrow_p (as_a
<gcall
*> (call
)));
3883 gimple_stmt_iterator gsi
= *gsip
;
3884 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
3888 maybe_clean_or_replace_eh_stmt (call
, g
);
3889 if (after
|| (use_bool
&& has_debug_uses
))
3890 e
= find_fallthru_edge (gsi_bb (gsi
)->succs
);
3894 /* The internal function returns the value of the specified bit
3895 before the atomic operation. If we are interested in the value
3896 of the specified bit after the atomic operation (makes only sense
3897 for xor, otherwise the bit content is compile time known),
3898 we need to invert the bit. */
3899 tree mask_convert
= mask
;
3900 gimple_seq stmts
= NULL
;
3902 mask_convert
= gimple_convert (&stmts
, TREE_TYPE (lhs
), mask
);
3903 new_lhs
= gimple_build (&stmts
, BIT_XOR_EXPR
, TREE_TYPE (lhs
), new_lhs
,
3904 use_bool
? build_int_cst (TREE_TYPE (lhs
), 1)
3908 gsi_insert_seq_on_edge_immediate (e
, stmts
);
3909 gsi
= gsi_for_stmt (gimple_seq_last (stmts
));
3912 gsi_insert_seq_after (&gsi
, stmts
, GSI_NEW_STMT
);
3914 if (use_bool
&& has_debug_uses
)
3916 tree temp
= NULL_TREE
;
3917 if (!throws
|| after
|| single_pred_p (e
->dest
))
3919 temp
= build_debug_expr_decl (TREE_TYPE (lhs
));
3920 tree t
= build2 (LSHIFT_EXPR
, TREE_TYPE (lhs
), new_lhs
, bit
);
3921 g
= gimple_build_debug_bind (temp
, t
, g
);
3922 if (throws
&& !after
)
3924 gsi
= gsi_after_labels (e
->dest
);
3925 gsi_insert_before (&gsi
, g
, GSI_SAME_STMT
);
3928 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
3930 FOR_EACH_IMM_USE_STMT (g
, iter
, use_lhs
)
3931 if (is_gimple_debug (g
))
3933 use_operand_p use_p
;
3934 if (temp
== NULL_TREE
)
3935 gimple_debug_bind_reset_value (g
);
3937 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
3938 SET_USE (use_p
, temp
);
3942 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_lhs
)
3943 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use_lhs
);
3944 replace_uses_by (use_lhs
, new_lhs
);
3945 gsi
= gsi_for_stmt (use_stmt
);
3946 gsi_remove (&gsi
, true);
3947 release_defs (use_stmt
);
3948 gsi_remove (gsip
, true);
3949 release_ssa_name (lhs
);
3954 _4 = __atomic_add_fetch_* (ptr_6, arg_2, _3);
3957 _4 = .ATOMIC_ADD_FETCH_CMP_0 (EQ_EXPR, ptr_6, arg_2, _3);
3959 Similarly for __sync_add_and_fetch_* (without the ", _3" part
3963 optimize_atomic_op_fetch_cmp_0 (gimple_stmt_iterator
*gsip
,
3964 enum internal_fn fn
, bool has_model_arg
)
3966 gimple
*call
= gsi_stmt (*gsip
);
3967 tree lhs
= gimple_call_lhs (call
);
3968 use_operand_p use_p
;
3971 if (!flag_inline_atomics
3973 || !gimple_call_builtin_p (call
, BUILT_IN_NORMAL
)
3975 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (lhs
)
3976 || !single_imm_use (lhs
, &use_p
, &use_stmt
)
3977 || !gimple_vdef (call
))
3983 case IFN_ATOMIC_ADD_FETCH_CMP_0
:
3984 optab
= atomic_add_fetch_cmp_0_optab
;
3986 case IFN_ATOMIC_SUB_FETCH_CMP_0
:
3987 optab
= atomic_sub_fetch_cmp_0_optab
;
3989 case IFN_ATOMIC_AND_FETCH_CMP_0
:
3990 optab
= atomic_and_fetch_cmp_0_optab
;
3992 case IFN_ATOMIC_OR_FETCH_CMP_0
:
3993 optab
= atomic_or_fetch_cmp_0_optab
;
3995 case IFN_ATOMIC_XOR_FETCH_CMP_0
:
3996 optab
= atomic_xor_fetch_cmp_0_optab
;
4002 if (optab_handler (optab
, TYPE_MODE (TREE_TYPE (lhs
)))
4003 == CODE_FOR_nothing
)
4007 if (gimple_assign_cast_p (use_stmt
))
4009 use_lhs
= gimple_assign_lhs (use_stmt
);
4010 if (!tree_nop_conversion_p (TREE_TYPE (use_lhs
), TREE_TYPE (lhs
))
4011 || (!INTEGRAL_TYPE_P (TREE_TYPE (use_lhs
))
4012 && !POINTER_TYPE_P (TREE_TYPE (use_lhs
)))
4013 || SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use_lhs
)
4014 || !single_imm_use (use_lhs
, &use_p
, &use_stmt
))
4017 enum tree_code code
= ERROR_MARK
;
4018 tree op0
= NULL_TREE
, op1
= NULL_TREE
;
4019 if (is_gimple_assign (use_stmt
))
4020 switch (gimple_assign_rhs_code (use_stmt
))
4023 op1
= gimple_assign_rhs1 (use_stmt
);
4024 code
= TREE_CODE (op1
);
4025 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
4027 op0
= TREE_OPERAND (op1
, 0);
4028 op1
= TREE_OPERAND (op1
, 1);
4032 code
= gimple_assign_rhs_code (use_stmt
);
4033 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
4035 op0
= gimple_assign_rhs1 (use_stmt
);
4036 op1
= gimple_assign_rhs2 (use_stmt
);
4040 else if (gimple_code (use_stmt
) == GIMPLE_COND
)
4042 code
= gimple_cond_code (use_stmt
);
4043 op0
= gimple_cond_lhs (use_stmt
);
4044 op1
= gimple_cond_rhs (use_stmt
);
4053 if (!INTEGRAL_TYPE_P (TREE_TYPE (use_lhs
))
4054 || TREE_CODE (TREE_TYPE (use_lhs
)) == BOOLEAN_TYPE
4055 || TYPE_UNSIGNED (TREE_TYPE (use_lhs
)))
4060 if (op0
== use_lhs
&& integer_zerop (op1
))
4070 /* Use special encoding of the operation. We want to also
4071 encode the mode in the first argument and for neither EQ_EXPR
4072 etc. nor EQ etc. we can rely it will fit into QImode. */
4073 case EQ_EXPR
: encoded
= ATOMIC_OP_FETCH_CMP_0_EQ
; break;
4074 case NE_EXPR
: encoded
= ATOMIC_OP_FETCH_CMP_0_NE
; break;
4075 case LT_EXPR
: encoded
= ATOMIC_OP_FETCH_CMP_0_LT
; break;
4076 case LE_EXPR
: encoded
= ATOMIC_OP_FETCH_CMP_0_LE
; break;
4077 case GT_EXPR
: encoded
= ATOMIC_OP_FETCH_CMP_0_GT
; break;
4078 case GE_EXPR
: encoded
= ATOMIC_OP_FETCH_CMP_0_GE
; break;
4079 default: gcc_unreachable ();
4082 tree new_lhs
= make_ssa_name (boolean_type_node
);
4084 tree flag
= build_int_cst (TREE_TYPE (lhs
), encoded
);
4086 g
= gimple_build_call_internal (fn
, 5, flag
,
4087 gimple_call_arg (call
, 0),
4088 gimple_call_arg (call
, 1),
4089 gimple_call_arg (call
, 2),
4090 gimple_call_fn (call
));
4092 g
= gimple_build_call_internal (fn
, 4, flag
,
4093 gimple_call_arg (call
, 0),
4094 gimple_call_arg (call
, 1),
4095 gimple_call_fn (call
));
4096 gimple_call_set_lhs (g
, new_lhs
);
4097 gimple_set_location (g
, gimple_location (call
));
4098 gimple_move_vops (g
, call
);
4099 bool throws
= stmt_can_throw_internal (cfun
, call
);
4100 gimple_call_set_nothrow (as_a
<gcall
*> (g
),
4101 gimple_call_nothrow_p (as_a
<gcall
*> (call
)));
4102 gimple_stmt_iterator gsi
= *gsip
;
4103 gsi_insert_after (&gsi
, g
, GSI_SAME_STMT
);
4105 maybe_clean_or_replace_eh_stmt (call
, g
);
4106 if (is_gimple_assign (use_stmt
))
4107 switch (gimple_assign_rhs_code (use_stmt
))
4110 gimple_assign_set_rhs1 (use_stmt
, new_lhs
);
4113 gsi
= gsi_for_stmt (use_stmt
);
4114 if (tree ulhs
= gimple_assign_lhs (use_stmt
))
4115 if (useless_type_conversion_p (TREE_TYPE (ulhs
),
4118 gimple_assign_set_rhs_with_ops (&gsi
, SSA_NAME
, new_lhs
);
4121 gimple_assign_set_rhs_with_ops (&gsi
, NOP_EXPR
, new_lhs
);
4124 else if (gimple_code (use_stmt
) == GIMPLE_COND
)
4126 gcond
*use_cond
= as_a
<gcond
*> (use_stmt
);
4127 gimple_cond_set_code (use_cond
, NE_EXPR
);
4128 gimple_cond_set_lhs (use_cond
, new_lhs
);
4129 gimple_cond_set_rhs (use_cond
, boolean_false_node
);
4132 update_stmt (use_stmt
);
4135 gsi
= gsi_for_stmt (SSA_NAME_DEF_STMT (use_lhs
));
4136 gsi_remove (&gsi
, true);
4137 release_ssa_name (use_lhs
);
4139 gsi_remove (gsip
, true);
4140 release_ssa_name (lhs
);
4150 Similarly for memset (&a, ..., sizeof (a)); instead of a = {};
4151 and/or memcpy (&b, &a, sizeof (a)); instead of b = a; */
4154 optimize_memcpy (gimple_stmt_iterator
*gsip
, tree dest
, tree src
, tree len
)
4156 gimple
*stmt
= gsi_stmt (*gsip
);
4157 if (gimple_has_volatile_ops (stmt
))
4160 tree vuse
= gimple_vuse (stmt
);
4164 gimple
*defstmt
= SSA_NAME_DEF_STMT (vuse
);
4165 tree src2
= NULL_TREE
, len2
= NULL_TREE
;
4166 poly_int64 offset
, offset2
;
4167 tree val
= integer_zero_node
;
4168 if (gimple_store_p (defstmt
)
4169 && gimple_assign_single_p (defstmt
)
4170 && TREE_CODE (gimple_assign_rhs1 (defstmt
)) == CONSTRUCTOR
4171 && !gimple_clobber_p (defstmt
))
4172 src2
= gimple_assign_lhs (defstmt
);
4173 else if (gimple_call_builtin_p (defstmt
, BUILT_IN_MEMSET
)
4174 && TREE_CODE (gimple_call_arg (defstmt
, 0)) == ADDR_EXPR
4175 && TREE_CODE (gimple_call_arg (defstmt
, 1)) == INTEGER_CST
)
4177 src2
= TREE_OPERAND (gimple_call_arg (defstmt
, 0), 0);
4178 len2
= gimple_call_arg (defstmt
, 2);
4179 val
= gimple_call_arg (defstmt
, 1);
4180 /* For non-0 val, we'd have to transform stmt from assignment
4181 into memset (only if dest is addressable). */
4182 if (!integer_zerop (val
) && is_gimple_assign (stmt
))
4186 if (src2
== NULL_TREE
)
4189 if (len
== NULL_TREE
)
4190 len
= (TREE_CODE (src
) == COMPONENT_REF
4191 ? DECL_SIZE_UNIT (TREE_OPERAND (src
, 1))
4192 : TYPE_SIZE_UNIT (TREE_TYPE (src
)));
4193 if (len2
== NULL_TREE
)
4194 len2
= (TREE_CODE (src2
) == COMPONENT_REF
4195 ? DECL_SIZE_UNIT (TREE_OPERAND (src2
, 1))
4196 : TYPE_SIZE_UNIT (TREE_TYPE (src2
)));
4197 if (len
== NULL_TREE
4198 || !poly_int_tree_p (len
)
4199 || len2
== NULL_TREE
4200 || !poly_int_tree_p (len2
))
4203 src
= get_addr_base_and_unit_offset (src
, &offset
);
4204 src2
= get_addr_base_and_unit_offset (src2
, &offset2
);
4205 if (src
== NULL_TREE
4206 || src2
== NULL_TREE
4207 || maybe_lt (offset
, offset2
))
4210 if (!operand_equal_p (src
, src2
, 0))
4213 /* [ src + offset2, src + offset2 + len2 - 1 ] is set to val.
4215 [ src + offset, src + offset + len - 1 ] is a subset of that. */
4216 if (maybe_gt (wi::to_poly_offset (len
) + (offset
- offset2
),
4217 wi::to_poly_offset (len2
)))
4220 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4222 fprintf (dump_file
, "Simplified\n ");
4223 print_gimple_stmt (dump_file
, stmt
, 0, dump_flags
);
4224 fprintf (dump_file
, "after previous\n ");
4225 print_gimple_stmt (dump_file
, defstmt
, 0, dump_flags
);
4228 /* For simplicity, don't change the kind of the stmt,
4229 turn dest = src; into dest = {}; and memcpy (&dest, &src, len);
4230 into memset (&dest, val, len);
4231 In theory we could change dest = src into memset if dest
4232 is addressable (maybe beneficial if val is not 0), or
4233 memcpy (&dest, &src, len) into dest = {} if len is the size
4234 of dest, dest isn't volatile. */
4235 if (is_gimple_assign (stmt
))
4237 tree ctor
= build_constructor (TREE_TYPE (dest
), NULL
);
4238 gimple_assign_set_rhs_from_tree (gsip
, ctor
);
4241 else /* If stmt is memcpy, transform it into memset. */
4243 gcall
*call
= as_a
<gcall
*> (stmt
);
4244 tree fndecl
= builtin_decl_implicit (BUILT_IN_MEMSET
);
4245 gimple_call_set_fndecl (call
, fndecl
);
4246 gimple_call_set_fntype (call
, TREE_TYPE (fndecl
));
4247 gimple_call_set_arg (call
, 1, val
);
4251 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4253 fprintf (dump_file
, "into\n ");
4254 print_gimple_stmt (dump_file
, stmt
, 0, dump_flags
);
4258 /* A simple pass that attempts to fold all builtin functions. This pass
4259 is run after we've propagated as many constants as we can. */
4263 const pass_data pass_data_fold_builtins
=
4265 GIMPLE_PASS
, /* type */
4267 OPTGROUP_NONE
, /* optinfo_flags */
4268 TV_NONE
, /* tv_id */
4269 ( PROP_cfg
| PROP_ssa
), /* properties_required */
4270 0, /* properties_provided */
4271 0, /* properties_destroyed */
4272 0, /* todo_flags_start */
4273 TODO_update_ssa
, /* todo_flags_finish */
4276 class pass_fold_builtins
: public gimple_opt_pass
4279 pass_fold_builtins (gcc::context
*ctxt
)
4280 : gimple_opt_pass (pass_data_fold_builtins
, ctxt
)
4283 /* opt_pass methods: */
4284 opt_pass
* clone () final override
{ return new pass_fold_builtins (m_ctxt
); }
4285 unsigned int execute (function
*) final override
;
4287 }; // class pass_fold_builtins
4290 pass_fold_builtins::execute (function
*fun
)
4292 bool cfg_changed
= false;
4294 unsigned int todoflags
= 0;
4296 FOR_EACH_BB_FN (bb
, fun
)
4298 gimple_stmt_iterator i
;
4299 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
4301 gimple
*stmt
, *old_stmt
;
4303 enum built_in_function fcode
;
4305 stmt
= gsi_stmt (i
);
4307 if (gimple_code (stmt
) != GIMPLE_CALL
)
4309 if (gimple_assign_load_p (stmt
) && gimple_store_p (stmt
))
4310 optimize_memcpy (&i
, gimple_assign_lhs (stmt
),
4311 gimple_assign_rhs1 (stmt
), NULL_TREE
);
4316 callee
= gimple_call_fndecl (stmt
);
4318 && gimple_call_internal_p (stmt
, IFN_ASSUME
))
4320 gsi_remove (&i
, true);
4323 if (!callee
|| !fndecl_built_in_p (callee
, BUILT_IN_NORMAL
))
4329 fcode
= DECL_FUNCTION_CODE (callee
);
4334 tree result
= NULL_TREE
;
4335 switch (DECL_FUNCTION_CODE (callee
))
4337 case BUILT_IN_CONSTANT_P
:
4338 /* Resolve __builtin_constant_p. If it hasn't been
4339 folded to integer_one_node by now, it's fairly
4340 certain that the value simply isn't constant. */
4341 result
= integer_zero_node
;
4344 case BUILT_IN_ASSUME_ALIGNED
:
4345 /* Remove __builtin_assume_aligned. */
4346 result
= gimple_call_arg (stmt
, 0);
4349 case BUILT_IN_STACK_RESTORE
:
4350 result
= optimize_stack_restore (i
);
4356 case BUILT_IN_UNREACHABLE
:
4357 if (optimize_unreachable (i
))
4361 case BUILT_IN_ATOMIC_ADD_FETCH_1
:
4362 case BUILT_IN_ATOMIC_ADD_FETCH_2
:
4363 case BUILT_IN_ATOMIC_ADD_FETCH_4
:
4364 case BUILT_IN_ATOMIC_ADD_FETCH_8
:
4365 case BUILT_IN_ATOMIC_ADD_FETCH_16
:
4366 optimize_atomic_op_fetch_cmp_0 (&i
,
4367 IFN_ATOMIC_ADD_FETCH_CMP_0
,
4370 case BUILT_IN_SYNC_ADD_AND_FETCH_1
:
4371 case BUILT_IN_SYNC_ADD_AND_FETCH_2
:
4372 case BUILT_IN_SYNC_ADD_AND_FETCH_4
:
4373 case BUILT_IN_SYNC_ADD_AND_FETCH_8
:
4374 case BUILT_IN_SYNC_ADD_AND_FETCH_16
:
4375 optimize_atomic_op_fetch_cmp_0 (&i
,
4376 IFN_ATOMIC_ADD_FETCH_CMP_0
,
4380 case BUILT_IN_ATOMIC_SUB_FETCH_1
:
4381 case BUILT_IN_ATOMIC_SUB_FETCH_2
:
4382 case BUILT_IN_ATOMIC_SUB_FETCH_4
:
4383 case BUILT_IN_ATOMIC_SUB_FETCH_8
:
4384 case BUILT_IN_ATOMIC_SUB_FETCH_16
:
4385 optimize_atomic_op_fetch_cmp_0 (&i
,
4386 IFN_ATOMIC_SUB_FETCH_CMP_0
,
4389 case BUILT_IN_SYNC_SUB_AND_FETCH_1
:
4390 case BUILT_IN_SYNC_SUB_AND_FETCH_2
:
4391 case BUILT_IN_SYNC_SUB_AND_FETCH_4
:
4392 case BUILT_IN_SYNC_SUB_AND_FETCH_8
:
4393 case BUILT_IN_SYNC_SUB_AND_FETCH_16
:
4394 optimize_atomic_op_fetch_cmp_0 (&i
,
4395 IFN_ATOMIC_SUB_FETCH_CMP_0
,
4399 case BUILT_IN_ATOMIC_FETCH_OR_1
:
4400 case BUILT_IN_ATOMIC_FETCH_OR_2
:
4401 case BUILT_IN_ATOMIC_FETCH_OR_4
:
4402 case BUILT_IN_ATOMIC_FETCH_OR_8
:
4403 case BUILT_IN_ATOMIC_FETCH_OR_16
:
4404 optimize_atomic_bit_test_and (&i
,
4405 IFN_ATOMIC_BIT_TEST_AND_SET
,
4408 case BUILT_IN_SYNC_FETCH_AND_OR_1
:
4409 case BUILT_IN_SYNC_FETCH_AND_OR_2
:
4410 case BUILT_IN_SYNC_FETCH_AND_OR_4
:
4411 case BUILT_IN_SYNC_FETCH_AND_OR_8
:
4412 case BUILT_IN_SYNC_FETCH_AND_OR_16
:
4413 optimize_atomic_bit_test_and (&i
,
4414 IFN_ATOMIC_BIT_TEST_AND_SET
,
4418 case BUILT_IN_ATOMIC_FETCH_XOR_1
:
4419 case BUILT_IN_ATOMIC_FETCH_XOR_2
:
4420 case BUILT_IN_ATOMIC_FETCH_XOR_4
:
4421 case BUILT_IN_ATOMIC_FETCH_XOR_8
:
4422 case BUILT_IN_ATOMIC_FETCH_XOR_16
:
4423 optimize_atomic_bit_test_and
4424 (&i
, IFN_ATOMIC_BIT_TEST_AND_COMPLEMENT
, true, false);
4426 case BUILT_IN_SYNC_FETCH_AND_XOR_1
:
4427 case BUILT_IN_SYNC_FETCH_AND_XOR_2
:
4428 case BUILT_IN_SYNC_FETCH_AND_XOR_4
:
4429 case BUILT_IN_SYNC_FETCH_AND_XOR_8
:
4430 case BUILT_IN_SYNC_FETCH_AND_XOR_16
:
4431 optimize_atomic_bit_test_and
4432 (&i
, IFN_ATOMIC_BIT_TEST_AND_COMPLEMENT
, false, false);
4435 case BUILT_IN_ATOMIC_XOR_FETCH_1
:
4436 case BUILT_IN_ATOMIC_XOR_FETCH_2
:
4437 case BUILT_IN_ATOMIC_XOR_FETCH_4
:
4438 case BUILT_IN_ATOMIC_XOR_FETCH_8
:
4439 case BUILT_IN_ATOMIC_XOR_FETCH_16
:
4440 if (optimize_atomic_bit_test_and
4441 (&i
, IFN_ATOMIC_BIT_TEST_AND_COMPLEMENT
, true, true))
4443 optimize_atomic_op_fetch_cmp_0 (&i
,
4444 IFN_ATOMIC_XOR_FETCH_CMP_0
,
4447 case BUILT_IN_SYNC_XOR_AND_FETCH_1
:
4448 case BUILT_IN_SYNC_XOR_AND_FETCH_2
:
4449 case BUILT_IN_SYNC_XOR_AND_FETCH_4
:
4450 case BUILT_IN_SYNC_XOR_AND_FETCH_8
:
4451 case BUILT_IN_SYNC_XOR_AND_FETCH_16
:
4452 if (optimize_atomic_bit_test_and
4453 (&i
, IFN_ATOMIC_BIT_TEST_AND_COMPLEMENT
, false, true))
4455 optimize_atomic_op_fetch_cmp_0 (&i
,
4456 IFN_ATOMIC_XOR_FETCH_CMP_0
,
4460 case BUILT_IN_ATOMIC_FETCH_AND_1
:
4461 case BUILT_IN_ATOMIC_FETCH_AND_2
:
4462 case BUILT_IN_ATOMIC_FETCH_AND_4
:
4463 case BUILT_IN_ATOMIC_FETCH_AND_8
:
4464 case BUILT_IN_ATOMIC_FETCH_AND_16
:
4465 optimize_atomic_bit_test_and (&i
,
4466 IFN_ATOMIC_BIT_TEST_AND_RESET
,
4469 case BUILT_IN_SYNC_FETCH_AND_AND_1
:
4470 case BUILT_IN_SYNC_FETCH_AND_AND_2
:
4471 case BUILT_IN_SYNC_FETCH_AND_AND_4
:
4472 case BUILT_IN_SYNC_FETCH_AND_AND_8
:
4473 case BUILT_IN_SYNC_FETCH_AND_AND_16
:
4474 optimize_atomic_bit_test_and (&i
,
4475 IFN_ATOMIC_BIT_TEST_AND_RESET
,
4479 case BUILT_IN_ATOMIC_AND_FETCH_1
:
4480 case BUILT_IN_ATOMIC_AND_FETCH_2
:
4481 case BUILT_IN_ATOMIC_AND_FETCH_4
:
4482 case BUILT_IN_ATOMIC_AND_FETCH_8
:
4483 case BUILT_IN_ATOMIC_AND_FETCH_16
:
4484 optimize_atomic_op_fetch_cmp_0 (&i
,
4485 IFN_ATOMIC_AND_FETCH_CMP_0
,
4488 case BUILT_IN_SYNC_AND_AND_FETCH_1
:
4489 case BUILT_IN_SYNC_AND_AND_FETCH_2
:
4490 case BUILT_IN_SYNC_AND_AND_FETCH_4
:
4491 case BUILT_IN_SYNC_AND_AND_FETCH_8
:
4492 case BUILT_IN_SYNC_AND_AND_FETCH_16
:
4493 optimize_atomic_op_fetch_cmp_0 (&i
,
4494 IFN_ATOMIC_AND_FETCH_CMP_0
,
4498 case BUILT_IN_ATOMIC_OR_FETCH_1
:
4499 case BUILT_IN_ATOMIC_OR_FETCH_2
:
4500 case BUILT_IN_ATOMIC_OR_FETCH_4
:
4501 case BUILT_IN_ATOMIC_OR_FETCH_8
:
4502 case BUILT_IN_ATOMIC_OR_FETCH_16
:
4503 optimize_atomic_op_fetch_cmp_0 (&i
,
4504 IFN_ATOMIC_OR_FETCH_CMP_0
,
4507 case BUILT_IN_SYNC_OR_AND_FETCH_1
:
4508 case BUILT_IN_SYNC_OR_AND_FETCH_2
:
4509 case BUILT_IN_SYNC_OR_AND_FETCH_4
:
4510 case BUILT_IN_SYNC_OR_AND_FETCH_8
:
4511 case BUILT_IN_SYNC_OR_AND_FETCH_16
:
4512 optimize_atomic_op_fetch_cmp_0 (&i
,
4513 IFN_ATOMIC_OR_FETCH_CMP_0
,
4517 case BUILT_IN_MEMCPY
:
4518 if (gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
)
4519 && TREE_CODE (gimple_call_arg (stmt
, 0)) == ADDR_EXPR
4520 && TREE_CODE (gimple_call_arg (stmt
, 1)) == ADDR_EXPR
4521 && TREE_CODE (gimple_call_arg (stmt
, 2)) == INTEGER_CST
)
4523 tree dest
= TREE_OPERAND (gimple_call_arg (stmt
, 0), 0);
4524 tree src
= TREE_OPERAND (gimple_call_arg (stmt
, 1), 0);
4525 tree len
= gimple_call_arg (stmt
, 2);
4526 optimize_memcpy (&i
, dest
, src
, len
);
4530 case BUILT_IN_VA_START
:
4531 case BUILT_IN_VA_END
:
4532 case BUILT_IN_VA_COPY
:
4533 /* These shouldn't be folded before pass_stdarg. */
4534 result
= optimize_stdarg_builtin (stmt
);
4546 gimplify_and_update_call_from_tree (&i
, result
);
4549 todoflags
|= TODO_update_address_taken
;
4551 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4553 fprintf (dump_file
, "Simplified\n ");
4554 print_gimple_stmt (dump_file
, stmt
, 0, dump_flags
);
4558 stmt
= gsi_stmt (i
);
4561 if (maybe_clean_or_replace_eh_stmt (old_stmt
, stmt
)
4562 && gimple_purge_dead_eh_edges (bb
))
4565 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4567 fprintf (dump_file
, "to\n ");
4568 print_gimple_stmt (dump_file
, stmt
, 0, dump_flags
);
4569 fprintf (dump_file
, "\n");
4572 /* Retry the same statement if it changed into another
4573 builtin, there might be new opportunities now. */
4574 if (gimple_code (stmt
) != GIMPLE_CALL
)
4579 callee
= gimple_call_fndecl (stmt
);
4581 || !fndecl_built_in_p (callee
, fcode
))
4586 /* Delete unreachable blocks. */
4588 todoflags
|= TODO_cleanup_cfg
;
4596 make_pass_fold_builtins (gcc::context
*ctxt
)
4598 return new pass_fold_builtins (ctxt
);
4601 /* A simple pass that emits some warnings post IPA. */
4605 const pass_data pass_data_post_ipa_warn
=
4607 GIMPLE_PASS
, /* type */
4608 "post_ipa_warn", /* name */
4609 OPTGROUP_NONE
, /* optinfo_flags */
4610 TV_NONE
, /* tv_id */
4611 ( PROP_cfg
| PROP_ssa
), /* properties_required */
4612 0, /* properties_provided */
4613 0, /* properties_destroyed */
4614 0, /* todo_flags_start */
4615 0, /* todo_flags_finish */
4618 class pass_post_ipa_warn
: public gimple_opt_pass
4621 pass_post_ipa_warn (gcc::context
*ctxt
)
4622 : gimple_opt_pass (pass_data_post_ipa_warn
, ctxt
)
4625 /* opt_pass methods: */
4626 opt_pass
* clone () final override
{ return new pass_post_ipa_warn (m_ctxt
); }
4627 bool gate (function
*) final override
{ return warn_nonnull
!= 0; }
4628 unsigned int execute (function
*) final override
;
4630 }; // class pass_fold_builtins
4633 pass_post_ipa_warn::execute (function
*fun
)
4637 FOR_EACH_BB_FN (bb
, fun
)
4639 gimple_stmt_iterator gsi
;
4640 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4642 gimple
*stmt
= gsi_stmt (gsi
);
4643 if (!is_gimple_call (stmt
) || warning_suppressed_p (stmt
, OPT_Wnonnull
))
4646 tree fntype
= gimple_call_fntype (stmt
);
4647 bitmap nonnullargs
= get_nonnull_args (fntype
);
4651 tree fndecl
= gimple_call_fndecl (stmt
);
4652 const bool closure
= fndecl
&& DECL_LAMBDA_FUNCTION_P (fndecl
);
4654 for (unsigned i
= 0; i
< gimple_call_num_args (stmt
); i
++)
4656 tree arg
= gimple_call_arg (stmt
, i
);
4657 if (TREE_CODE (TREE_TYPE (arg
)) != POINTER_TYPE
)
4659 if (!integer_zerop (arg
))
4661 if (i
== 0 && closure
)
4662 /* Avoid warning for the first argument to lambda functions. */
4664 if (!bitmap_empty_p (nonnullargs
)
4665 && !bitmap_bit_p (nonnullargs
, i
))
4668 /* In C++ non-static member functions argument 0 refers
4669 to the implicit this pointer. Use the same one-based
4670 numbering for ordinary arguments. */
4671 unsigned argno
= TREE_CODE (fntype
) == METHOD_TYPE
? i
: i
+ 1;
4672 location_t loc
= (EXPR_HAS_LOCATION (arg
)
4673 ? EXPR_LOCATION (arg
)
4674 : gimple_location (stmt
));
4675 auto_diagnostic_group d
;
4678 if (warning_at (loc
, OPT_Wnonnull
,
4679 "%qs pointer is null", "this")
4681 inform (DECL_SOURCE_LOCATION (fndecl
),
4682 "in a call to non-static member function %qD",
4687 if (!warning_at (loc
, OPT_Wnonnull
,
4688 "argument %u null where non-null "
4692 tree fndecl
= gimple_call_fndecl (stmt
);
4693 if (fndecl
&& DECL_IS_UNDECLARED_BUILTIN (fndecl
))
4694 inform (loc
, "in a call to built-in function %qD",
4697 inform (DECL_SOURCE_LOCATION (fndecl
),
4698 "in a call to function %qD declared %qs",
4701 BITMAP_FREE (nonnullargs
);
4710 make_pass_post_ipa_warn (gcc::context
*ctxt
)
4712 return new pass_post_ipa_warn (ctxt
);