1 /* Code for GIMPLE range related routines.
2 Copyright (C) 2019-2020 Free Software Foundation, Inc.
3 Contributed by Andrew MacLeod <amacleod@redhat.com>
4 and Aldy Hernandez <aldyh@redhat.com>.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
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/>. */
24 #include "coretypes.h"
26 #include "insn-codes.h"
31 #include "gimple-pretty-print.h"
32 #include "gimple-iterator.h"
33 #include "optabs-tree.h"
34 #include "gimple-fold.h"
36 #include "fold-const.h"
39 #include "fold-const.h"
40 #include "case-cfn-macros.h"
41 #include "omp-general.h"
43 #include "tree-ssa-loop.h"
44 #include "tree-scalar-evolution.h"
46 #include "alloc-pool.h"
47 #include "vr-values.h"
48 #include "gimple-range.h"
51 // Adjust the range for a pointer difference where the operands came
54 // This notices the following sequence:
56 // def = __builtin_memchr (arg, 0, sz)
59 // The range for N can be narrowed to [0, PTRDIFF_MAX - 1].
62 adjust_pointer_diff_expr (irange
&res
, const gimple
*diff_stmt
)
64 tree op0
= gimple_assign_rhs1 (diff_stmt
);
65 tree op1
= gimple_assign_rhs2 (diff_stmt
);
66 tree op0_ptype
= TREE_TYPE (TREE_TYPE (op0
));
67 tree op1_ptype
= TREE_TYPE (TREE_TYPE (op1
));
70 if (TREE_CODE (op0
) == SSA_NAME
71 && TREE_CODE (op1
) == SSA_NAME
72 && (call
= SSA_NAME_DEF_STMT (op0
))
73 && is_gimple_call (call
)
74 && gimple_call_builtin_p (call
, BUILT_IN_MEMCHR
)
75 && TYPE_MODE (op0_ptype
) == TYPE_MODE (char_type_node
)
76 && TYPE_PRECISION (op0_ptype
) == TYPE_PRECISION (char_type_node
)
77 && TYPE_MODE (op1_ptype
) == TYPE_MODE (char_type_node
)
78 && TYPE_PRECISION (op1_ptype
) == TYPE_PRECISION (char_type_node
)
79 && gimple_call_builtin_p (call
, BUILT_IN_MEMCHR
)
80 && vrp_operand_equal_p (op1
, gimple_call_arg (call
, 0))
81 && integer_zerop (gimple_call_arg (call
, 1)))
83 tree max
= vrp_val_max (ptrdiff_type_node
);
84 wide_int wmax
= wi::to_wide (max
, TYPE_PRECISION (TREE_TYPE (max
)));
85 tree expr_type
= gimple_expr_type (diff_stmt
);
86 tree range_min
= build_zero_cst (expr_type
);
87 tree range_max
= wide_int_to_tree (expr_type
, wmax
- 1);
88 int_range
<2> r (range_min
, range_max
);
93 // This function looks for situations when walking the use/def chains
94 // may provide additonal contextual range information not exposed on
95 // this statement. Like knowing the IMAGPART return value from a
96 // builtin function is a boolean result.
98 // We should rework how we're called, as we have an op_unknown entry
99 // for IMAGPART_EXPR and POINTER_DIFF_EXPR in range-ops just so this
100 // function gets called.
103 gimple_range_adjustment (irange
&res
, const gimple
*stmt
)
105 switch (gimple_expr_code (stmt
))
107 case POINTER_DIFF_EXPR
:
108 adjust_pointer_diff_expr (res
, stmt
);
113 tree name
= TREE_OPERAND (gimple_assign_rhs1 (stmt
), 0);
114 if (TREE_CODE (name
) == SSA_NAME
)
116 gimple
*def_stmt
= SSA_NAME_DEF_STMT (name
);
117 if (def_stmt
&& is_gimple_call (def_stmt
)
118 && gimple_call_internal_p (def_stmt
))
120 switch (gimple_call_internal_fn (def_stmt
))
122 case IFN_ADD_OVERFLOW
:
123 case IFN_SUB_OVERFLOW
:
124 case IFN_MUL_OVERFLOW
:
125 case IFN_ATOMIC_COMPARE_EXCHANGE
:
128 r
.set_varying (boolean_type_node
);
129 tree type
= TREE_TYPE (gimple_assign_lhs (stmt
));
130 range_cast (r
, type
);
146 // Return a range in R for the tree EXPR. Return true if a range is
147 // representable, and UNDEFINED/false if not.
150 get_tree_range (irange
&r
, tree expr
)
156 type
= TREE_TYPE (expr
);
158 // Return false if the type isn't suported.
159 if (!irange::supports_type_p (type
))
165 switch (TREE_CODE (expr
))
168 if (TREE_OVERFLOW_P (expr
))
169 expr
= drop_tree_overflow (expr
);
174 r
= gimple_range_global (expr
);
179 // Handle &var which can show up in phi arguments.
181 if (tree_single_nonzero_warnv_p (expr
, &ov
))
183 r
= range_nonzero (type
);
192 r
.set_varying (type
);
196 // Fold this unary statement using R1 as operand1's range, returning
197 // the result in RES. Return false if the operation fails.
200 gimple_range_fold (irange
&res
, const gimple
*stmt
, const irange
&r1
)
202 gcc_checking_assert (gimple_range_handler (stmt
));
204 tree type
= gimple_expr_type (stmt
);
205 // Unary SSA operations require the LHS type as the second range.
206 int_range
<2> r2 (type
);
208 return gimple_range_fold (res
, stmt
, r1
, r2
);
211 // Fold this binary statement using R1 and R2 as the operands ranges,
212 // returning the result in RES. Return false if the operation fails.
215 gimple_range_fold (irange
&res
, const gimple
*stmt
,
216 const irange
&r1
, const irange
&r2
)
218 gcc_checking_assert (gimple_range_handler (stmt
));
220 gimple_range_handler (stmt
)->fold_range (res
, gimple_expr_type (stmt
),
223 // If there are any gimple lookups, do those now.
224 gimple_range_adjustment (res
, stmt
);
228 // Return the base of the RHS of an assignment.
231 gimple_range_base_of_assignment (const gimple
*stmt
)
233 gcc_checking_assert (gimple_code (stmt
) == GIMPLE_ASSIGN
);
234 tree op1
= gimple_assign_rhs1 (stmt
);
235 if (gimple_assign_rhs_code (stmt
) == ADDR_EXPR
)
236 return get_base_address (TREE_OPERAND (op1
, 0));
240 // Return the first operand of this statement if it is a valid operand
241 // supported by ranges, otherwise return NULL_TREE. Special case is
242 // &(SSA_NAME expr), return the SSA_NAME instead of the ADDR expr.
245 gimple_range_operand1 (const gimple
*stmt
)
247 gcc_checking_assert (gimple_range_handler (stmt
));
249 switch (gimple_code (stmt
))
252 return gimple_cond_lhs (stmt
);
255 tree base
= gimple_range_base_of_assignment (stmt
);
256 if (base
&& TREE_CODE (base
) == MEM_REF
)
258 // If the base address is an SSA_NAME, we return it
259 // here. This allows processing of the range of that
260 // name, while the rest of the expression is simply
261 // ignored. The code in range_ops will see the
262 // ADDR_EXPR and do the right thing.
263 tree ssa
= TREE_OPERAND (base
, 0);
264 if (TREE_CODE (ssa
) == SSA_NAME
)
275 // Return the second operand of statement STMT, otherwise return NULL_TREE.
278 gimple_range_operand2 (const gimple
*stmt
)
280 gcc_checking_assert (gimple_range_handler (stmt
));
282 switch (gimple_code (stmt
))
285 return gimple_cond_rhs (stmt
);
287 if (gimple_num_ops (stmt
) >= 3)
288 return gimple_assign_rhs2 (stmt
);
295 // Calculate what we can determine of the range of this unary
296 // statement's operand if the lhs of the expression has the range
297 // LHS_RANGE. Return false if nothing can be determined.
300 gimple_range_calc_op1 (irange
&r
, const gimple
*stmt
, const irange
&lhs_range
)
302 gcc_checking_assert (gimple_num_ops (stmt
) < 3);
304 // An empty range is viral.
305 tree type
= TREE_TYPE (gimple_range_operand1 (stmt
));
306 if (lhs_range
.undefined_p ())
311 // Unary operations require the type of the first operand in the
312 // second range position.
313 int_range
<2> type_range (type
);
314 return gimple_range_handler (stmt
)->op1_range (r
, type
, lhs_range
,
318 // Calculate what we can determine of the range of this statement's
319 // first operand if the lhs of the expression has the range LHS_RANGE
320 // and the second operand has the range OP2_RANGE. Return false if
321 // nothing can be determined.
324 gimple_range_calc_op1 (irange
&r
, const gimple
*stmt
,
325 const irange
&lhs_range
, const irange
&op2_range
)
327 // Unary operation are allowed to pass a range in for second operand
328 // as there are often additional restrictions beyond the type which
329 // can be imposed. See operator_cast::op1_range().
330 tree type
= TREE_TYPE (gimple_range_operand1 (stmt
));
331 // An empty range is viral.
332 if (op2_range
.undefined_p () || lhs_range
.undefined_p ())
337 return gimple_range_handler (stmt
)->op1_range (r
, type
, lhs_range
,
341 // Calculate what we can determine of the range of this statement's
342 // second operand if the lhs of the expression has the range LHS_RANGE
343 // and the first operand has the range OP1_RANGE. Return false if
344 // nothing can be determined.
347 gimple_range_calc_op2 (irange
&r
, const gimple
*stmt
,
348 const irange
&lhs_range
, const irange
&op1_range
)
350 tree type
= TREE_TYPE (gimple_range_operand2 (stmt
));
351 // An empty range is viral.
352 if (op1_range
.undefined_p () || lhs_range
.undefined_p ())
357 return gimple_range_handler (stmt
)->op2_range (r
, type
, lhs_range
,
361 // Calculate a range for statement S and return it in R. If NAME is provided it
362 // represents the SSA_NAME on the LHS of the statement. It is only required
363 // if there is more than one lhs/output. If a range cannot
364 // be calculated, return false.
367 gimple_ranger::calc_stmt (irange
&r
, gimple
*s
, tree name
)
370 // If name is specified, make sure it is an LHS of S.
371 gcc_checking_assert (name
? SSA_NAME_DEF_STMT (name
) == s
: true);
373 if (gimple_range_handler (s
))
374 res
= range_of_range_op (r
, s
);
375 else if (is_a
<gphi
*>(s
))
376 res
= range_of_phi (r
, as_a
<gphi
*> (s
));
377 else if (is_a
<gcall
*>(s
))
378 res
= range_of_call (r
, as_a
<gcall
*> (s
));
379 else if (is_a
<gassign
*> (s
) && gimple_assign_rhs_code (s
) == COND_EXPR
)
380 res
= range_of_cond_expr (r
, as_a
<gassign
*> (s
));
384 // If no name is specified, try the expression kind.
387 tree t
= gimple_expr_type (s
);
388 if (!irange::supports_type_p (t
))
393 if (!gimple_range_ssa_p (name
))
395 // We don't understand the stmt, so return the global range.
396 r
= gimple_range_global (name
);
400 if (r
.undefined_p ())
403 // We sometimes get compatible types copied from operands, make sure
404 // the correct type is being returned.
405 if (name
&& TREE_TYPE (name
) != r
.type ())
407 gcc_checking_assert (range_compatible_p (r
.type (), TREE_TYPE (name
)));
408 range_cast (r
, TREE_TYPE (name
));
413 // Calculate a range for range_op statement S and return it in R. If any
414 // If a range cannot be calculated, return false.
417 gimple_ranger::range_of_range_op (irange
&r
, gimple
*s
)
419 int_range_max range1
, range2
;
420 tree lhs
= gimple_get_lhs (s
);
421 tree type
= gimple_expr_type (s
);
422 gcc_checking_assert (irange::supports_type_p (type
));
424 tree op1
= gimple_range_operand1 (s
);
425 tree op2
= gimple_range_operand2 (s
);
429 // Register potential dependencies for stale value tracking.
430 m_cache
.register_dependency (lhs
, op1
);
431 m_cache
.register_dependency (lhs
, op2
);
434 if (range_of_non_trivial_assignment (r
, s
))
437 if (range_of_expr (range1
, op1
, s
))
440 return gimple_range_fold (r
, s
, range1
);
442 if (range_of_expr (range2
, op2
, s
))
443 return gimple_range_fold (r
, s
, range1
, range2
);
445 r
.set_varying (type
);
449 // Calculate the range of a non-trivial assignment. That is, is one
450 // inolving arithmetic on an SSA name (for example, an ADDR_EXPR).
451 // Return the range in R.
453 // If a range cannot be calculated, return false.
456 gimple_ranger::range_of_non_trivial_assignment (irange
&r
, gimple
*stmt
)
458 if (gimple_code (stmt
) != GIMPLE_ASSIGN
)
461 tree base
= gimple_range_base_of_assignment (stmt
);
464 if (TREE_CODE (base
) == MEM_REF
)
466 if (TREE_CODE (TREE_OPERAND (base
, 0)) == SSA_NAME
)
468 int_range_max range1
;
469 tree ssa
= TREE_OPERAND (base
, 0);
470 if (range_of_expr (range1
, ssa
, stmt
))
472 tree type
= TREE_TYPE (ssa
);
473 range_operator
*op
= range_op_handler (POINTER_PLUS_EXPR
,
475 int_range
<2> offset (TREE_OPERAND (base
, 1),
476 TREE_OPERAND (base
, 1));
477 op
->fold_range (r
, type
, range1
, offset
);
483 if (gimple_assign_rhs_code (stmt
) == ADDR_EXPR
)
485 // Handle "= &a" and return non-zero.
486 r
= range_nonzero (TREE_TYPE (gimple_assign_rhs1 (stmt
)));
493 // Calculate a range for phi statement S and return it in R.
494 // If a range cannot be calculated, return false.
497 gimple_ranger::range_of_phi (irange
&r
, gphi
*phi
)
499 tree phi_def
= gimple_phi_result (phi
);
500 tree type
= TREE_TYPE (phi_def
);
501 int_range_max arg_range
;
504 if (!irange::supports_type_p (type
))
507 // Start with an empty range, unioning in each argument's range.
509 for (x
= 0; x
< gimple_phi_num_args (phi
); x
++)
511 tree arg
= gimple_phi_arg_def (phi
, x
);
512 edge e
= gimple_phi_arg_edge (phi
, x
);
514 // Register potential dependencies for stale value tracking.
515 m_cache
.register_dependency (phi_def
, arg
);
517 range_on_edge (arg_range
, e
, arg
);
518 r
.union_ (arg_range
);
519 // Once the value reaches varying, stop looking.
524 // If SCEV is available, query if this PHI has any knonwn values.
525 if (scev_initialized_p () && !POINTER_TYPE_P (TREE_TYPE (phi_def
)))
527 value_range loop_range
;
528 class loop
*l
= loop_containing_stmt (phi
);
529 if (l
&& loop_outer (l
))
531 range_of_ssa_name_with_loop_info (loop_range
, phi_def
, l
, phi
);
532 if (!loop_range
.varying_p ())
534 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
536 fprintf (dump_file
, " Loops range found for ");
537 print_generic_expr (dump_file
, phi_def
, TDF_SLIM
);
538 fprintf (dump_file
, ": ");
539 loop_range
.dump (dump_file
);
540 fprintf (dump_file
, " and calculated range :");
542 fprintf (dump_file
, "\n");
544 r
.intersect (loop_range
);
552 // Calculate a range for call statement S and return it in R.
553 // If a range cannot be calculated, return false.
556 gimple_ranger::range_of_call (irange
&r
, gcall
*call
)
558 tree type
= gimple_call_return_type (call
);
559 tree lhs
= gimple_call_lhs (call
);
560 bool strict_overflow_p
;
562 if (!irange::supports_type_p (type
))
565 if (range_of_builtin_call (r
, call
))
567 else if (gimple_stmt_nonnegative_warnv_p (call
, &strict_overflow_p
))
568 r
.set (build_int_cst (type
, 0), TYPE_MAX_VALUE (type
));
569 else if (gimple_call_nonnull_result_p (call
)
570 || gimple_call_nonnull_arg (call
))
571 r
= range_nonzero (type
);
573 r
.set_varying (type
);
575 // If there is an LHS, intersect that with what is known.
579 def
= gimple_range_global (lhs
);
585 // Return the range of a __builtin_ubsan* in CALL and set it in R.
586 // CODE is the type of ubsan call (PLUS_EXPR, MINUS_EXPR or
590 range_of_builtin_ubsan_call (range_query
&query
, irange
&r
, gcall
*call
,
593 gcc_checking_assert (code
== PLUS_EXPR
|| code
== MINUS_EXPR
594 || code
== MULT_EXPR
);
595 tree type
= gimple_call_return_type (call
);
596 range_operator
*op
= range_op_handler (code
, type
);
597 gcc_checking_assert (op
);
598 int_range_max ir0
, ir1
;
599 tree arg0
= gimple_call_arg (call
, 0);
600 tree arg1
= gimple_call_arg (call
, 1);
601 query
.range_of_expr (ir0
, arg0
, call
);
602 query
.range_of_expr (ir1
, arg1
, call
);
604 bool saved_flag_wrapv
= flag_wrapv
;
605 // Pretend the arithmetic is wrapping. If there is any overflow,
606 // we'll complain, but will actually do wrapping operation.
608 op
->fold_range (r
, type
, ir0
, ir1
);
609 flag_wrapv
= saved_flag_wrapv
;
611 // If for both arguments vrp_valueize returned non-NULL, this should
612 // have been already folded and if not, it wasn't folded because of
613 // overflow. Avoid removing the UBSAN_CHECK_* calls in that case.
614 if (r
.singleton_p ())
615 r
.set_varying (type
);
618 // For a builtin in CALL, return a range in R if known and return
619 // TRUE. Otherwise return FALSE.
622 range_of_builtin_call (range_query
&query
, irange
&r
, gcall
*call
)
624 combined_fn func
= gimple_call_combined_fn (call
);
625 if (func
== CFN_LAST
)
628 tree type
= gimple_call_return_type (call
);
630 int mini
, maxi
, zerov
= 0, prec
;
631 scalar_int_mode mode
;
635 case CFN_BUILT_IN_CONSTANT_P
:
636 if (cfun
->after_inlining
)
642 arg
= gimple_call_arg (call
, 0);
643 if (query
.range_of_expr (r
, arg
, call
) && r
.singleton_p ())
645 r
.set (build_one_cst (type
), build_one_cst (type
));
652 // __builtin_ffs* and __builtin_popcount* return [0, prec].
653 arg
= gimple_call_arg (call
, 0);
654 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
657 query
.range_of_expr (r
, arg
, call
);
658 // If arg is non-zero, then ffs or popcount are non-zero.
659 if (!range_includes_zero_p (&r
))
661 // If some high bits are known to be zero, decrease the maximum.
662 if (!r
.undefined_p ())
664 if (TYPE_SIGN (r
.type ()) == SIGNED
)
665 range_cast (r
, unsigned_type_for (r
.type ()));
666 wide_int max
= r
.upper_bound ();
667 maxi
= wi::floor_log2 (max
) + 1;
669 r
.set (build_int_cst (type
, mini
), build_int_cst (type
, maxi
));
673 r
.set (build_zero_cst (type
), build_one_cst (type
));
677 // __builtin_c[lt]z* return [0, prec-1], except when the
678 // argument is 0, but that is undefined behavior.
680 // For __builtin_c[lt]z* consider argument of 0 always undefined
681 // behavior, for internal fns depending on C?Z_DEFINED_VALUE_AT_ZERO.
682 arg
= gimple_call_arg (call
, 0);
683 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
686 mode
= SCALAR_INT_TYPE_MODE (TREE_TYPE (arg
));
687 if (gimple_call_internal_p (call
))
689 if (optab_handler (clz_optab
, mode
) != CODE_FOR_nothing
690 && CLZ_DEFINED_VALUE_AT_ZERO (mode
, zerov
) == 2)
692 // Only handle the single common value.
696 // Magic value to give up, unless we can prove arg is non-zero.
701 query
.range_of_expr (r
, arg
, call
);
702 // From clz of minimum we can compute result maximum.
705 int newmaxi
= prec
- 1 - wi::floor_log2 (r
.lower_bound ());
706 // Argument is unsigned, so do nothing if it is [0, ...] range.
713 else if (!range_includes_zero_p (&r
))
720 // From clz of maximum we can compute result minimum.
723 int newmini
= prec
- 1 - wi::floor_log2 (r
.upper_bound ());
726 // Argument range is [0, 0]. If CLZ_DEFINED_VALUE_AT_ZERO
727 // is 2 with VALUE of prec, return [prec, prec], otherwise
737 r
.set (build_int_cst (type
, mini
), build_int_cst (type
, maxi
));
741 // __builtin_ctz* return [0, prec-1], except for when the
742 // argument is 0, but that is undefined behavior.
744 // For __builtin_ctz* consider argument of 0 always undefined
745 // behavior, for internal fns depending on CTZ_DEFINED_VALUE_AT_ZERO.
746 arg
= gimple_call_arg (call
, 0);
747 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
750 mode
= SCALAR_INT_TYPE_MODE (TREE_TYPE (arg
));
751 if (gimple_call_internal_p (call
))
753 if (optab_handler (ctz_optab
, mode
) != CODE_FOR_nothing
754 && CTZ_DEFINED_VALUE_AT_ZERO (mode
, zerov
) == 2)
756 // Handle only the two common values.
759 else if (zerov
== prec
)
762 // Magic value to give up, unless we can prove arg is non-zero.
766 query
.range_of_expr (r
, arg
, call
);
767 if (!r
.undefined_p ())
769 if (r
.lower_bound () != 0)
774 // If some high bits are known to be zero, we can decrease
776 wide_int max
= r
.upper_bound ();
779 // Argument is [0, 0]. If CTZ_DEFINED_VALUE_AT_ZERO
780 // is 2 with value -1 or prec, return [-1, -1] or [prec, prec].
781 // Otherwise ignore the range.
784 else if (maxi
== prec
)
787 // If value at zero is prec and 0 is in the range, we can't lower
788 // the upper bound. We could create two separate ranges though,
789 // [0,floor_log2(max)][prec,prec] though.
790 else if (maxi
!= prec
)
791 maxi
= wi::floor_log2 (max
);
795 r
.set (build_int_cst (type
, mini
), build_int_cst (type
, maxi
));
799 arg
= gimple_call_arg (call
, 0);
800 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
801 r
.set (build_int_cst (type
, 0), build_int_cst (type
, prec
- 1));
803 case CFN_UBSAN_CHECK_ADD
:
804 range_of_builtin_ubsan_call (query
, r
, call
, PLUS_EXPR
);
806 case CFN_UBSAN_CHECK_SUB
:
807 range_of_builtin_ubsan_call (query
, r
, call
, MINUS_EXPR
);
809 case CFN_UBSAN_CHECK_MUL
:
810 range_of_builtin_ubsan_call (query
, r
, call
, MULT_EXPR
);
813 case CFN_GOACC_DIM_SIZE
:
814 case CFN_GOACC_DIM_POS
:
815 // Optimizing these two internal functions helps the loop
816 // optimizer eliminate outer comparisons. Size is [1,N]
817 // and pos is [0,N-1].
819 bool is_pos
= func
== CFN_GOACC_DIM_POS
;
820 int axis
= oacc_get_ifn_dim_arg (call
);
821 int size
= oacc_get_fn_dim_size (current_function_decl
, axis
);
823 // If it's dynamic, the backend might know a hardware limitation.
824 size
= targetm
.goacc
.dim_limit (axis
);
826 r
.set (build_int_cst (type
, is_pos
? 0 : 1),
828 ? build_int_cst (type
, size
- is_pos
) : vrp_val_max (type
));
832 case CFN_BUILT_IN_STRLEN
:
833 if (tree lhs
= gimple_call_lhs (call
))
834 if (ptrdiff_type_node
835 && (TYPE_PRECISION (ptrdiff_type_node
)
836 == TYPE_PRECISION (TREE_TYPE (lhs
))))
838 tree type
= TREE_TYPE (lhs
);
839 tree max
= vrp_val_max (ptrdiff_type_node
);
841 = wi::to_wide (max
, TYPE_PRECISION (TREE_TYPE (max
)));
842 tree range_min
= build_zero_cst (type
);
843 // To account for the terminating NULL, the maximum length
844 // is one less than the maximum array size, which in turn
845 // is one less than PTRDIFF_MAX (or SIZE_MAX where it's
846 // smaller than the former type).
847 // FIXME: Use max_object_size() - 1 here.
848 tree range_max
= wide_int_to_tree (type
, wmax
- 2);
849 r
.set (range_min
, range_max
);
861 gimple_ranger::range_of_builtin_call (irange
&r
, gcall
*call
)
863 return ::range_of_builtin_call (*this, r
, call
);
866 // Calculate a range for COND_EXPR statement S and return it in R.
867 // If a range cannot be calculated, return false.
870 gimple_ranger::range_of_cond_expr (irange
&r
, gassign
*s
)
872 int_range_max cond_range
, range1
, range2
;
873 tree cond
= gimple_assign_rhs1 (s
);
874 tree op1
= gimple_assign_rhs2 (s
);
875 tree op2
= gimple_assign_rhs3 (s
);
877 gcc_checking_assert (gimple_assign_rhs_code (s
) == COND_EXPR
);
878 gcc_checking_assert (useless_type_conversion_p (TREE_TYPE (op1
),
880 if (!irange::supports_type_p (TREE_TYPE (op1
)))
883 range_of_expr (cond_range
, cond
, s
);
884 range_of_expr (range1
, op1
, s
);
885 range_of_expr (range2
, op2
, s
);
887 // If the condition is known, choose the appropriate expression.
888 if (cond_range
.singleton_p ())
890 // False, pick second operand.
891 if (cond_range
.zero_p ())
905 gimple_ranger::range_of_expr (irange
&r
, tree expr
, gimple
*stmt
)
907 if (!gimple_range_ssa_p (expr
))
908 return get_tree_range (r
, expr
);
910 // If there is no statement, just get the global value.
913 if (!m_cache
.get_global_range (r
, expr
))
914 r
= gimple_range_global (expr
);
918 basic_block bb
= gimple_bb (stmt
);
919 gimple
*def_stmt
= SSA_NAME_DEF_STMT (expr
);
921 // If name is defined in this block, try to get an range from S.
922 if (def_stmt
&& gimple_bb (def_stmt
) == bb
)
923 range_of_stmt (r
, def_stmt
, expr
);
925 // Otherwise OP comes from outside this block, use range on entry.
926 range_on_entry (r
, bb
, expr
);
928 // No range yet, see if there is a dereference in the block.
929 // We don't care if it's between the def and a use within a block
930 // because the entire block must be executed anyway.
931 // FIXME:?? For non-call exceptions we could have a statement throw
932 // which causes an early block exit.
933 // in which case we may need to walk from S back to the def/top of block
934 // to make sure the deref happens between S and there before claiming
935 // there is a deref. Punt for now.
936 if (!cfun
->can_throw_non_call_exceptions
&& r
.varying_p () &&
937 m_cache
.m_non_null
.non_null_deref_p (expr
, bb
))
938 r
= range_nonzero (TREE_TYPE (expr
));
943 // Return the range of NAME on entry to block BB in R.
946 gimple_ranger::range_on_entry (irange
&r
, basic_block bb
, tree name
)
948 int_range_max entry_range
;
949 gcc_checking_assert (gimple_range_ssa_p (name
));
951 // Start with any known range
952 range_of_stmt (r
, SSA_NAME_DEF_STMT (name
), name
);
954 // Now see if there is any on_entry value which may refine it.
955 if (m_cache
.block_range (entry_range
, bb
, name
))
956 r
.intersect (entry_range
);
959 // Calculate the range for NAME at the end of block BB and return it in R.
960 // Return false if no range can be calculated.
963 gimple_ranger::range_on_exit (irange
&r
, basic_block bb
, tree name
)
965 // on-exit from the exit block?
966 gcc_checking_assert (bb
!= EXIT_BLOCK_PTR_FOR_FN (cfun
));
967 gcc_checking_assert (gimple_range_ssa_p (name
));
969 gimple
*s
= last_stmt (bb
);
970 // If there is no statement in the block and this isn't the entry
971 // block, go get the range_on_entry for this block. For the entry
972 // block, a NULL stmt will return the global value for NAME.
973 if (!s
&& bb
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
))
974 range_on_entry (r
, bb
, name
);
976 range_of_expr (r
, name
, s
);
977 gcc_checking_assert (r
.undefined_p ()
978 || range_compatible_p (r
.type (), TREE_TYPE (name
)));
981 // Calculate a range for NAME on edge E and return it in R.
984 gimple_ranger::range_on_edge (irange
&r
, edge e
, tree name
)
986 int_range_max edge_range
;
987 gcc_checking_assert (irange::supports_type_p (TREE_TYPE (name
)));
989 // PHI arguments can be constants, catch these here.
990 if (!gimple_range_ssa_p (name
))
991 return range_of_expr (r
, name
);
993 range_on_exit (r
, e
->src
, name
);
994 gcc_checking_assert (r
.undefined_p ()
995 || range_compatible_p (r
.type(), TREE_TYPE (name
)));
997 // Check to see if NAME is defined on edge e.
998 if (m_cache
.outgoing_edge_range_p (edge_range
, e
, name
))
999 r
.intersect (edge_range
);
1004 // Calculate a range for statement S and return it in R. If NAME is
1005 // provided it represents the SSA_NAME on the LHS of the statement.
1006 // It is only required if there is more than one lhs/output. Check
1007 // the global cache for NAME first to see if the evaluation can be
1008 // avoided. If a range cannot be calculated, return false and UNDEFINED.
1011 gimple_ranger::range_of_stmt (irange
&r
, gimple
*s
, tree name
)
1016 name
= gimple_get_lhs (s
);
1018 // If no name, simply call the base routine.
1020 return calc_stmt (r
, s
, NULL_TREE
);
1022 if (!gimple_range_ssa_p (name
))
1025 // Check if the stmt has already been processed, and is not stale.
1026 if (m_cache
.get_non_stale_global_range (r
, name
))
1029 // Otherwise calculate a new value and save it.
1030 calc_stmt (r
, s
, name
);
1031 m_cache
.set_global_range (name
, r
);
1035 // This routine will export whatever global ranges are known to GCC
1036 // SSA_RANGE_NAME_INFO fields.
1039 gimple_ranger::export_global_ranges ()
1045 fprintf (dump_file
, "Exported global range table\n");
1046 fprintf (dump_file
, "===========================\n");
1049 for ( x
= 1; x
< num_ssa_names
; x
++)
1051 tree name
= ssa_name (x
);
1052 if (name
&& !SSA_NAME_IN_FREE_LIST (name
)
1053 && gimple_range_ssa_p (name
)
1054 && m_cache
.get_global_range (r
, name
)
1057 // Make sure the new range is a subset of the old range.
1058 int_range_max old_range
;
1059 old_range
= gimple_range_global (name
);
1060 old_range
.intersect (r
);
1061 /* Disable this while we fix tree-ssa/pr61743-2.c. */
1062 //gcc_checking_assert (old_range == r);
1064 // WTF? Can't write non-null pointer ranges?? stupid set_range_info!
1065 if (!POINTER_TYPE_P (TREE_TYPE (name
)) && !r
.undefined_p ())
1068 set_range_info (name
, vr
);
1071 print_generic_expr (dump_file
, name
, TDF_SLIM
);
1072 fprintf (dump_file
, " --> ");
1073 vr
.dump (dump_file
);
1074 fprintf (dump_file
, "\n");
1075 fprintf (dump_file
, " irange : ");
1077 fprintf (dump_file
, "\n");
1084 // Print the known table values to file F.
1087 gimple_ranger::dump (FILE *f
)
1091 FOR_EACH_BB_FN (bb
, cfun
)
1096 int_range_max range
;
1097 fprintf (f
, "\n=========== BB %d ============\n", bb
->index
);
1098 m_cache
.dump (f
, bb
);
1100 dump_bb (f
, bb
, 4, TDF_NONE
);
1102 // Now find any globals defined in this block.
1103 for (x
= 1; x
< num_ssa_names
; x
++)
1105 tree name
= ssa_name (x
);
1106 if (gimple_range_ssa_p (name
) && SSA_NAME_DEF_STMT (name
) &&
1107 gimple_bb (SSA_NAME_DEF_STMT (name
)) == bb
&&
1108 m_cache
.get_global_range (range
, name
))
1110 if (!range
.varying_p ())
1112 print_generic_expr (f
, name
, TDF_SLIM
);
1121 // And now outgoing edges, if they define anything.
1122 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1124 for (x
= 1; x
< num_ssa_names
; x
++)
1126 tree name
= gimple_range_ssa_p (ssa_name (x
));
1127 if (name
&& m_cache
.outgoing_edge_range_p (range
, e
, name
))
1129 gimple
*s
= SSA_NAME_DEF_STMT (name
);
1130 // Only print the range if this is the def block, or
1131 // the on entry cache for either end of the edge is
1133 if ((s
&& bb
== gimple_bb (s
)) ||
1134 m_cache
.block_range (range
, bb
, name
, false) ||
1135 m_cache
.block_range (range
, e
->dest
, name
, false))
1137 range_on_edge (range
, e
, name
);
1138 if (!range
.varying_p ())
1140 fprintf (f
, "%d->%d ", e
->src
->index
,
1143 if (e
->flags
& EDGE_TRUE_VALUE
)
1144 fprintf (f
, " (T)%c", c
);
1145 else if (e
->flags
& EDGE_FALSE_VALUE
)
1146 fprintf (f
, " (F)%c", c
);
1149 print_generic_expr (f
, name
, TDF_SLIM
);
1150 fprintf(f
, " : \t");
1160 m_cache
.dump (dump_file
, (dump_flags
& TDF_DETAILS
) != 0);
1163 // If SCEV has any information about phi node NAME, return it as a range in R.
1166 gimple_ranger::range_of_ssa_name_with_loop_info (irange
&r
, tree name
,
1167 class loop
*l
, gphi
*phi
)
1169 gcc_checking_assert (TREE_CODE (name
) == SSA_NAME
);
1170 tree min
, max
, type
= TREE_TYPE (name
);
1171 if (bounds_of_var_in_loop (&min
, &max
, this, l
, phi
, name
))
1173 // ?? We could do better here. Since MIN/MAX can only be an
1174 // SSA, SSA +- INTEGER_CST, or INTEGER_CST, we could easily call
1175 // the ranger and solve anything not an integer.
1176 if (TREE_CODE (min
) != INTEGER_CST
)
1177 min
= vrp_val_min (type
);
1178 if (TREE_CODE (max
) != INTEGER_CST
)
1179 max
= vrp_val_max (type
);
1183 r
.set_varying (type
);
1186 // --------------------------------------------------------------------------
1187 // trace_ranger implementation.
1190 trace_ranger::trace_ranger ()
1196 // If dumping, return true and print the prefix for the next output line.
1199 trace_ranger::dumping (unsigned counter
, bool trailing
)
1201 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1203 // Print counter index as well as INDENT spaces.
1205 fprintf (dump_file
, " %-7u ", counter
);
1207 fprintf (dump_file
, " ");
1209 for (x
= 0; x
< indent
; x
++)
1210 fputc (' ', dump_file
);
1216 // After calling a routine, if dumping, print the CALLER, NAME, and RESULT,
1217 // returning RESULT.
1220 trace_ranger::trailer (unsigned counter
, const char *caller
, bool result
,
1221 tree name
, const irange
&r
)
1223 if (dumping (counter
, true))
1226 fputs(result
? "TRUE : " : "FALSE : ", dump_file
);
1227 fprintf (dump_file
, "(%u) ", counter
);
1228 fputs (caller
, dump_file
);
1229 fputs (" (",dump_file
);
1231 print_generic_expr (dump_file
, name
, TDF_SLIM
);
1232 fputs (") ",dump_file
);
1236 fputc('\n', dump_file
);
1239 fputc('\n', dump_file
);
1240 // Marks the end of a request.
1242 fputc('\n', dump_file
);
1247 // Tracing version of range_on_edge. Call it with printing wrappers.
1250 trace_ranger::range_on_edge (irange
&r
, edge e
, tree name
)
1252 unsigned idx
= ++trace_count
;
1255 fprintf (dump_file
, "range_on_edge (");
1256 print_generic_expr (dump_file
, name
, TDF_SLIM
);
1257 fprintf (dump_file
, ") on edge %d->%d\n", e
->src
->index
, e
->dest
->index
);
1261 bool res
= gimple_ranger::range_on_edge (r
, e
, name
);
1262 trailer (idx
, "range_on_edge", true, name
, r
);
1266 // Tracing version of range_on_entry. Call it with printing wrappers.
1269 trace_ranger::range_on_entry (irange
&r
, basic_block bb
, tree name
)
1271 unsigned idx
= ++trace_count
;
1274 fprintf (dump_file
, "range_on_entry (");
1275 print_generic_expr (dump_file
, name
, TDF_SLIM
);
1276 fprintf (dump_file
, ") to BB %d\n", bb
->index
);
1280 gimple_ranger::range_on_entry (r
, bb
, name
);
1282 trailer (idx
, "range_on_entry", true, name
, r
);
1285 // Tracing version of range_on_exit. Call it with printing wrappers.
1288 trace_ranger::range_on_exit (irange
&r
, basic_block bb
, tree name
)
1290 unsigned idx
= ++trace_count
;
1293 fprintf (dump_file
, "range_on_exit (");
1294 print_generic_expr (dump_file
, name
, TDF_SLIM
);
1295 fprintf (dump_file
, ") from BB %d\n", bb
->index
);
1299 gimple_ranger::range_on_exit (r
, bb
, name
);
1301 trailer (idx
, "range_on_exit", true, name
, r
);
1304 // Tracing version of range_of_stmt. Call it with printing wrappers.
1307 trace_ranger::range_of_stmt (irange
&r
, gimple
*s
, tree name
)
1310 unsigned idx
= ++trace_count
;
1313 fprintf (dump_file
, "range_of_stmt (");
1315 print_generic_expr (dump_file
, name
, TDF_SLIM
);
1316 fputs (") at stmt ", dump_file
);
1317 print_gimple_stmt (dump_file
, s
, 0, TDF_SLIM
);
1321 res
= gimple_ranger::range_of_stmt (r
, s
, name
);
1323 return trailer (idx
, "range_of_stmt", res
, name
, r
);
1326 // Tracing version of range_of_expr. Call it with printing wrappers.
1329 trace_ranger::range_of_expr (irange
&r
, tree name
, gimple
*s
)
1332 unsigned idx
= ++trace_count
;
1335 fprintf (dump_file
, "range_of_expr(");
1336 print_generic_expr (dump_file
, name
, TDF_SLIM
);
1337 fputs (")", dump_file
);
1340 fputs (" at stmt ", dump_file
);
1341 print_gimple_stmt (dump_file
, s
, 0, TDF_SLIM
);
1344 fputs ("\n", dump_file
);
1348 res
= gimple_ranger::range_of_expr (r
, name
, s
);
1350 return trailer (idx
, "range_of_expr", res
, name
, r
);