2010-01-08 Tobias Burnus <burnus@net-b.de

[pf3gnuchains/gcc-fork.git] / gcc / tree-chrec.h

diff --git a/gcc/tree-chrec.h b/gcc/tree-chrec.h
index 6ef1b66..fcff93a 100644 (file)
--- a/gcc/tree-chrec.h
+++ b/gcc/tree-chrec.h
@@ -1,12 +1,13 @@
 /* Chains of recurrences.
 /* Chains of recurrences.

-   Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc.
-   Contributed by Sebastian Pop <s.pop@laposte.net>
+   Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009
+   Free Software Foundation, Inc.
+   Contributed by Sebastian Pop <pop@cri.ensmp.fr>

 
 This file is part of GCC.
 
 GCC is free software; you can redistribute it and/or modify it under
 the terms of the GNU General Public License as published by the Free
 
 This file is part of GCC.
 
 GCC is free software; you can redistribute it and/or modify it under
 the terms of the GNU General Public License as published by the Free

-Software Foundation; either version 2, or (at your option) any later
+Software Foundation; either version 3, or (at your option) any later

 version.
 
 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
 version.
 
 GCC is distributed in the hope that it will be useful, but WITHOUT ANY


@@ -15,23 +16,14 @@ FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 for more details.
 
 You should have received a copy of the GNU General Public License
 for more details.
 
 You should have received a copy of the GNU General Public License

-along with GCC; see the file COPYING.  If not, write to the Free
-Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
-02110-1301, USA.  */
+along with GCC; see the file COPYING3.  If not see
+<http://www.gnu.org/licenses/>.  */

 
 #ifndef GCC_TREE_CHREC_H
 #define GCC_TREE_CHREC_H
 
 
 #ifndef GCC_TREE_CHREC_H
 #define GCC_TREE_CHREC_H
 

-/* Accessors for the chains of recurrences.  */
-#define CHREC_VAR(NODE)           TREE_OPERAND (NODE, 0)
-#define CHREC_LEFT(NODE)          TREE_OPERAND (NODE, 1)
-#define CHREC_RIGHT(NODE)         TREE_OPERAND (NODE, 2)
-#define CHREC_VARIABLE(NODE)      TREE_INT_CST_LOW (CHREC_VAR (NODE))
-
-\f
-
-/* The following trees are unique elements.  Thus the comparison of another 
-   element to these elements should be done on the pointer to these trees, 
+/* The following trees are unique elements.  Thus the comparison of another
+   element to these elements should be done on the pointer to these trees,

    and not on their value.  */
 
 extern tree chrec_not_analyzed_yet;
    and not on their value.  */
 
 extern tree chrec_not_analyzed_yet;


@@ -42,17 +34,16 @@ extern GTY(()) tree chrec_known;
    include it in the following function.  */
 
 static inline bool
    include it in the following function.  */
 
 static inline bool

-automatically_generated_chrec_p (tree chrec)
+automatically_generated_chrec_p (const_tree chrec)

 {
 {

-  return (chrec == chrec_not_analyzed_yet 
-         || chrec == chrec_dont_know
+  return (chrec == chrec_dont_know

          || chrec == chrec_known);
 }
 
 /* The tree nodes aka. CHRECs.  */
 
 static inline bool
          || chrec == chrec_known);
 }
 
 /* The tree nodes aka. CHRECs.  */
 
 static inline bool

-tree_is_chrec (tree expr)
+tree_is_chrec (const_tree expr)

 {
   if (TREE_CODE (expr) == POLYNOMIAL_CHREC
       || automatically_generated_chrec_p (expr))
 {
   if (TREE_CODE (expr) == POLYNOMIAL_CHREC
       || automatically_generated_chrec_p (expr))


@@ -67,8 +58,9 @@ tree_is_chrec (tree expr)
 extern tree chrec_fold_plus (tree, tree, tree);
 extern tree chrec_fold_minus (tree, tree, tree);
 extern tree chrec_fold_multiply (tree, tree, tree);
 extern tree chrec_fold_plus (tree, tree, tree);
 extern tree chrec_fold_minus (tree, tree, tree);
 extern tree chrec_fold_multiply (tree, tree, tree);

-extern tree chrec_convert (tree, tree, tree);
-extern tree chrec_type (tree);
+extern tree chrec_convert (tree, tree, gimple);
+extern tree chrec_convert_rhs (tree, tree, gimple);
+extern tree chrec_convert_aggressive (tree, tree);

 
 /* Operations.  */
 extern tree chrec_apply (unsigned, tree, tree);
 
 /* Operations.  */
 extern tree chrec_apply (unsigned, tree, tree);


@@ -79,57 +71,94 @@ extern tree evolution_part_in_loop_num (tree, unsigned);
 extern tree hide_evolution_in_other_loops_than_loop (tree, unsigned);
 extern tree reset_evolution_in_loop (unsigned, tree, tree);
 extern tree chrec_merge (tree, tree);
 extern tree hide_evolution_in_other_loops_than_loop (tree, unsigned);
 extern tree reset_evolution_in_loop (unsigned, tree, tree);
 extern tree chrec_merge (tree, tree);

+extern void for_each_scev_op (tree *, bool (*) (tree *, void *), void *);

 
 /* Observers.  */
 
 /* Observers.  */

-extern bool is_multivariate_chrec (tree);
+extern bool eq_evolutions_p (const_tree, const_tree);
+extern bool is_multivariate_chrec (const_tree);

 extern bool chrec_is_positive (tree, bool *);
 extern bool chrec_is_positive (tree, bool *);

-extern bool chrec_contains_symbols (tree);
-extern bool chrec_contains_symbols_defined_in_loop (tree, unsigned);
-extern bool chrec_contains_undetermined (tree);
-extern bool tree_contains_chrecs (tree, int *);
-extern bool evolution_function_is_affine_multivariate_p (tree);
-extern bool evolution_function_is_univariate_p (tree);
+extern bool chrec_contains_symbols (const_tree);
+extern bool chrec_contains_symbols_defined_in_loop (const_tree, unsigned);
+extern bool chrec_contains_undetermined (const_tree);
+extern bool tree_contains_chrecs (const_tree, int *);
+extern bool evolution_function_is_affine_multivariate_p (const_tree, int);
+extern bool evolution_function_is_univariate_p (const_tree);

 extern unsigned nb_vars_in_chrec (tree);
 extern unsigned nb_vars_in_chrec (tree);

+extern bool evolution_function_is_invariant_p (tree, int);
+extern bool scev_is_linear_expression (tree);
+extern bool evolution_function_right_is_integer_cst (const_tree);

 
 

-\f
+/* Determines whether CHREC is equal to zero.  */
+
+static inline bool
+chrec_zerop (const_tree chrec)
+{
+  if (chrec == NULL_TREE)
+    return false;
+
+  if (TREE_CODE (chrec) == INTEGER_CST)
+    return integer_zerop (chrec);
+
+  return false;
+}
+
+/* Determines whether CHREC is a loop invariant with respect to LOOP_NUM.
+   Set the result in RES and return true when the property can be computed.  */
+
+static inline bool
+no_evolution_in_loop_p (tree chrec, unsigned loop_num, bool *res)
+{
+  tree scev;
+
+  if (chrec == chrec_not_analyzed_yet
+      || chrec == chrec_dont_know
+      || chrec_contains_symbols_defined_in_loop (chrec, loop_num))
+    return false;
+
+  STRIP_NOPS (chrec);
+  scev = hide_evolution_in_other_loops_than_loop (chrec, loop_num);
+  *res = !tree_is_chrec (scev);
+  return true;
+}

 
 /* Build a polynomial chain of recurrence.  */
 
 
 /* Build a polynomial chain of recurrence.  */
 

-static inline tree 
-build_polynomial_chrec (unsigned loop_num, 
-                       tree left, 
+static inline tree
+build_polynomial_chrec (unsigned loop_num,
+                       tree left,

                        tree right)
 {
                        tree right)
 {

+  bool val;
+

   if (left == chrec_dont_know
       || right == chrec_dont_know)
     return chrec_dont_know;
 
   if (left == chrec_dont_know
       || right == chrec_dont_know)
     return chrec_dont_know;
 

-  return build (POLYNOMIAL_CHREC, TREE_TYPE (left), 
-               build_int_cst (NULL_TREE, loop_num), left, right);
-}
+  if (!no_evolution_in_loop_p (left, loop_num, &val)
+      || !val)
+    return chrec_dont_know;

 
 

-\f
+  /* Pointer types should occur only on the left hand side, i.e. in
+     the base of the chrec, and not in the step.  */
+  gcc_assert (!POINTER_TYPE_P (TREE_TYPE (right)));

 
 

-/* Observers.  */
+  /* Types of left and right sides of a chrec should be compatible.  */
+  if (POINTER_TYPE_P (TREE_TYPE (left)))
+    gcc_assert (sizetype == TREE_TYPE (right));
+  else
+    gcc_assert (TREE_TYPE (left) == TREE_TYPE (right));

 
 

-/* Determines whether CHREC is equal to zero.  */
+  if (chrec_zerop (right))
+    return left;

 
 

-static inline bool 
-chrec_zerop (tree chrec)
-{
-  if (chrec == NULL_TREE)
-    return false;
-  
-  if (TREE_CODE (chrec) == INTEGER_CST)
-    return integer_zerop (chrec);
-  
-  return false;
+  return build3 (POLYNOMIAL_CHREC, TREE_TYPE (left),
+                build_int_cst (NULL_TREE, loop_num), left, right);

 }
 
 /* Determines whether the expression CHREC is a constant.  */
 
 }
 
 /* Determines whether the expression CHREC is a constant.  */
 

-static inline bool 
-evolution_function_is_constant_p (tree chrec)
+static inline bool
+evolution_function_is_constant_p (const_tree chrec)

 {
   if (chrec == NULL_TREE)
     return false;
 {
   if (chrec == NULL_TREE)
     return false;


@@ -139,71 +168,95 @@ evolution_function_is_constant_p (tree chrec)
     case INTEGER_CST:
     case REAL_CST:
       return true;
     case INTEGER_CST:
     case REAL_CST:
       return true;

-      
+

     default:
       return false;
     }
 }
 
     default:
       return false;
     }
 }
 

-extern bool evolution_function_is_invariant_p (tree, int);
-/* Determine whether the given tree is an affine evolution function or not.  */
+/* Determine whether CHREC is an affine evolution function in LOOPNUM.  */

 
 

-static inline bool 
-evolution_function_is_affine_p (tree chrec)
+static inline bool
+evolution_function_is_affine_in_loop (const_tree chrec, int loopnum)

 {
   if (chrec == NULL_TREE)
     return false;
 {
   if (chrec == NULL_TREE)
     return false;

-  
+

   switch (TREE_CODE (chrec))
     {
     case POLYNOMIAL_CHREC:
   switch (TREE_CODE (chrec))
     {
     case POLYNOMIAL_CHREC:

-      if (evolution_function_is_invariant_p (CHREC_LEFT (chrec), 
-                                            CHREC_VARIABLE (chrec))
-         && evolution_function_is_invariant_p (CHREC_RIGHT (chrec),
-                                               CHREC_VARIABLE (chrec)))
+      if (evolution_function_is_invariant_p (CHREC_LEFT (chrec), loopnum)
+         && evolution_function_is_invariant_p (CHREC_RIGHT (chrec), loopnum))

        return true;
       else
        return false;
        return true;
       else
        return false;

-      
+

     default:
       return false;
     }
 }
 
     default:
       return false;
     }
 }
 

-/* Determine whether the given tree is an affine or constant evolution
-   function.  */
+/* Determine whether CHREC is an affine evolution function or not.  */

 
 

-static inline bool 
-evolution_function_is_affine_or_constant_p (tree chrec)
+static inline bool
+evolution_function_is_affine_p (const_tree chrec)

 {
 {

-  return evolution_function_is_affine_p (chrec) 
-    || evolution_function_is_constant_p (chrec);
+  if (chrec == NULL_TREE)
+    return false;
+
+  switch (TREE_CODE (chrec))
+    {
+    case POLYNOMIAL_CHREC:
+      if (evolution_function_is_invariant_p (CHREC_LEFT (chrec),
+                                            CHREC_VARIABLE (chrec))
+         && evolution_function_is_invariant_p (CHREC_RIGHT (chrec),
+                                               CHREC_VARIABLE (chrec)))
+       return true;
+      else
+       return false;
+
+    default:
+      return false;
+    }

 }
 
 /* Determines whether EXPR does not contains chrec expressions.  */
 
 static inline bool
 }
 
 /* Determines whether EXPR does not contains chrec expressions.  */
 
 static inline bool

-tree_does_not_contain_chrecs (tree expr)
+tree_does_not_contain_chrecs (const_tree expr)

 {
   return !tree_contains_chrecs (expr, NULL);
 }
 
 {
   return !tree_contains_chrecs (expr, NULL);
 }
 

-/* Determines whether CHREC is a loop invariant with respect to LOOP_NUM.  
-   Set the result in RES and return true when the property can be computed.  */
+/* Returns the type of the chrec.  */

 
 

-static inline bool
-no_evolution_in_loop_p (tree chrec, unsigned loop_num, bool *res)
+static inline tree
+chrec_type (const_tree chrec)

 {
 {

-  tree scev;
-  
-  if (chrec == chrec_not_analyzed_yet
-      || chrec == chrec_dont_know
-      || chrec_contains_symbols_defined_in_loop (chrec, loop_num))
-    return false;
+  if (automatically_generated_chrec_p (chrec))
+    return NULL_TREE;
+
+  return TREE_TYPE (chrec);
+}
+
+static inline tree
+chrec_fold_op (enum tree_code code, tree type, tree op0, tree op1)
+{
+  switch (code)
+    {
+    case PLUS_EXPR:
+      return chrec_fold_plus (type, op0, op1);
+
+    case MINUS_EXPR:
+      return chrec_fold_minus (type, op0, op1);
+
+    case MULT_EXPR:
+      return chrec_fold_multiply (type, op0, op1);
+
+    default:
+      gcc_unreachable ();
+    }

 
 

-  scev = hide_evolution_in_other_loops_than_loop (chrec, loop_num);
-  *res = !tree_is_chrec (scev);
-  return true;

 }
 
 #endif  /* GCC_TREE_CHREC_H  */
 }
 
 #endif  /* GCC_TREE_CHREC_H  */