提交: 019d6598357659e05640cf762b75e18953f70fe9 - gcc_os216 (git)

GCC with patches for OS216

Commit MetaInfo

• 修订版: 019d6598357659e05640cf762b75e18953f70fe9 (tree)
• 时间: 2016-07-07 20:50:55
• 作者: Jan Hubicka <jh@suse...>
• Commiter: Jan Hubicka

Log Message

tree-scalar-evolution.c (iv_can_overflow_p): export.

* tree-scalar-evolution.c (iv_can_overflow_p): export.
* tree-scalar-evolution.h (iv_can_overflow_p): Declare.
* tree-ssa-loop-ivopts.c (alloc_iv): Use it.

From-SVN: r238088

更改概述

• modified: gcc/ChangeLog
• modified: gcc/tree-scalar-evolution.c
• modified: gcc/tree-scalar-evolution.h
• modified: gcc/tree-ssa-loop-ivopts.c

差异

--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,9 @@
[phone]  Jan Hubicka  <[e-mail]>
+
+	* tree-scalar-evolution.c (iv_can_overflow_p): export.
+	* tree-scalar-evolution.h (iv_can_overflow_p): Declare.
+	* tree-ssa-loop-ivopts.c (alloc_iv): Use it.
+
 2016-07-07  Ilya Enkovich  <[e-mail]>
 
 	PR ipa/71624

--- a/gcc/tree-scalar-evolution.c
+++ b/gcc/tree-scalar-evolution.c
@@ -3317,7 +3317,7 @@ scev_reset (void)
    use this test even for derived IVs not computed every iteration or
    hypotetical IVs to be inserted into code.  */
 
-static bool
+bool
 iv_can_overflow_p (struct loop *loop, tree type, tree base, tree step)
 {
   widest_int nit;

--- a/gcc/tree-scalar-evolution.h
+++ b/gcc/tree-scalar-evolution.h
@@ -38,6 +38,7 @@ extern unsigned int scev_const_prop (void);
 extern bool expression_expensive_p (tree);
 extern bool simple_iv (struct loop *, struct loop *, tree, struct affine_iv *,
 		       bool);
+extern bool iv_can_overflow_p (struct loop *, tree, tree, tree);
 extern tree compute_overall_effect_of_inner_loop (struct loop *, tree);
 
 /* Returns the basic block preceding LOOP, or the CFG entry block when

--- a/gcc/tree-ssa-loop-ivopts.c
+++ b/gcc/tree-ssa-loop-ivopts.c
@@ -1181,6 +1181,10 @@ alloc_iv (struct ivopts_data *data, tree base, tree step,
   iv->biv_p = false;
   iv->nonlin_use = NULL;
   iv->ssa_name = NULL_TREE;
+  if (!no_overflow
+       && !iv_can_overflow_p (data->current_loop, TREE_TYPE (base),
+			      base, step))
+    no_overflow = true;
   iv->no_overflow = no_overflow;
   iv->have_address_use = false;