/* Chains of recurrences.
- Copyright (C) 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
+ Copyright (C) 2003, 2004, 2005, 2006, 2007 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
-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
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
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
-tree_is_chrec (tree expr)
+tree_is_chrec (const_tree expr)
{
if (TREE_CODE (expr) == POLYNOMIAL_CHREC
|| automatically_generated_chrec_p (expr))
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_convert_rhs (tree, tree, tree);
extern tree chrec_convert_aggressive (tree, tree);
/* Operations. */
extern tree chrec_merge (tree, tree);
/* Observers. */
-extern bool eq_evolutions_p (tree, tree);
-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_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 bool evolution_function_is_invariant_p (tree, int);
/* Determines whether CHREC is equal to zero. */
static inline bool
-chrec_zerop (tree chrec)
+chrec_zerop (const_tree chrec)
{
if (chrec == NULL_TREE)
return false;
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;
+
+ scev = hide_evolution_in_other_loops_than_loop (chrec, loop_num);
+ *res = !tree_is_chrec (scev);
+ return true;
+}
+
/* Build a polynomial chain of recurrence. */
static inline tree
tree left,
tree right)
{
+ bool val;
+
if (left == chrec_dont_know
|| right == chrec_dont_know)
return chrec_dont_know;
- gcc_assert (TREE_TYPE (left) == TREE_TYPE (right));
+ if (no_evolution_in_loop_p (left, loop_num, &val) && !val)
+ return chrec_dont_know;
+
+ /* 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)));
+
+ /* 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));
if (chrec_zerop (right))
return left;
/* Determines whether the expression CHREC is a constant. */
static inline bool
-evolution_function_is_constant_p (tree chrec)
+evolution_function_is_constant_p (const_tree chrec)
{
if (chrec == NULL_TREE)
return false;
}
}
-extern bool evolution_function_is_invariant_p (tree, int);
/* Determine whether the given tree is an affine evolution function or not. */
static inline bool
-evolution_function_is_affine_p (tree chrec)
+evolution_function_is_affine_p (const_tree chrec)
{
if (chrec == NULL_TREE)
return false;
function. */
static inline bool
-evolution_function_is_affine_or_constant_p (tree chrec)
+evolution_function_is_affine_or_constant_p (const_tree chrec)
{
return evolution_function_is_affine_p (chrec)
|| evolution_function_is_constant_p (chrec);
/* 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);
}
-/* 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;
-
- scev = hide_evolution_in_other_loops_than_loop (chrec, loop_num);
- *res = !tree_is_chrec (scev);
- return true;
-}
-
/* Returns the type of the chrec. */
static inline tree
-chrec_type (tree chrec)
+chrec_type (const_tree chrec)
{
if (automatically_generated_chrec_p (chrec))
return NULL_TREE;
OSDN Git Service
