/* Chains of recurrences.
- Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009
+ Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
Free Software Foundation, Inc.
Contributed by Sebastian Pop <pop@cri.ensmp.fr>
#ifndef GCC_TREE_CHREC_H
#define GCC_TREE_CHREC_H
-/* 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;
/* Operations. */
extern tree chrec_apply (unsigned, tree, tree);
+extern tree chrec_apply_map (tree, VEC (tree, heap) *);
extern tree chrec_replace_initial_condition (tree, tree);
extern tree initial_condition (tree);
extern tree initial_condition_in_loop_num (tree, unsigned);
/* Determines whether CHREC is equal to zero. */
-static inline bool
+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.
+/* 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. */
-static inline tree
-build_polynomial_chrec (unsigned loop_num,
- tree left,
+static inline tree
+build_polynomial_chrec (unsigned loop_num,
+ tree left,
tree right)
{
bool val;
/* 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));
+ gcc_assert (ptrofftype_p (TREE_TYPE (right)));
else
gcc_assert (TREE_TYPE (left) == TREE_TYPE (right));
if (chrec_zerop (right))
return left;
- return build3 (POLYNOMIAL_CHREC, TREE_TYPE (left),
+ return build3 (POLYNOMIAL_CHREC, TREE_TYPE (left),
build_int_cst (NULL_TREE, loop_num), left, right);
}
/* Determines whether the expression CHREC is a constant. */
-static inline bool
+static inline bool
evolution_function_is_constant_p (const_tree chrec)
{
if (chrec == NULL_TREE)
case INTEGER_CST:
case REAL_CST:
return true;
-
+
default:
return false;
}
/* Determine whether CHREC is an affine evolution function in LOOPNUM. */
-static inline bool
+static inline bool
evolution_function_is_affine_in_loop (const_tree chrec, int loopnum)
{
if (chrec == NULL_TREE)
return false;
-
+
switch (TREE_CODE (chrec))
{
case POLYNOMIAL_CHREC:
return true;
else
return false;
-
+
default:
return false;
}
/* Determine whether CHREC is an affine evolution function or not. */
-static inline bool
+static inline bool
evolution_function_is_affine_p (const_tree 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;
- }
+ return chrec
+ && TREE_CODE (chrec) == POLYNOMIAL_CHREC
+ && evolution_function_is_invariant_p (CHREC_RIGHT (chrec),
+ CHREC_VARIABLE (chrec))
+ && (TREE_CODE (CHREC_RIGHT (chrec)) != POLYNOMIAL_CHREC
+ || evolution_function_is_affine_p (CHREC_RIGHT (chrec)));
}
/* Determines whether EXPR does not contains chrec expressions. */