1 /* Chains of recurrences.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
3 Contributed by Sebastian Pop <pop@cri.ensmp.fr>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 #ifndef GCC_TREE_CHREC_H
22 #define GCC_TREE_CHREC_H
24 /* Accessors for the chains of recurrences. */
25 #define CHREC_VAR(NODE) TREE_OPERAND (NODE, 0)
26 #define CHREC_LEFT(NODE) TREE_OPERAND (NODE, 1)
27 #define CHREC_RIGHT(NODE) TREE_OPERAND (NODE, 2)
28 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
32 /* The following trees are unique elements. Thus the comparison of another
33 element to these elements should be done on the pointer to these trees,
34 and not on their value. */
36 extern tree chrec_not_analyzed_yet
;
37 extern GTY(()) tree chrec_dont_know
;
38 extern GTY(()) tree chrec_known
;
40 /* After having added an automatically generated element, please
41 include it in the following function. */
44 automatically_generated_chrec_p (tree chrec
)
46 return (chrec
== chrec_not_analyzed_yet
47 || chrec
== chrec_dont_know
48 || chrec
== chrec_known
);
51 /* The tree nodes aka. CHRECs. */
54 tree_is_chrec (tree expr
)
56 if (TREE_CODE (expr
) == POLYNOMIAL_CHREC
57 || automatically_generated_chrec_p (expr
))
65 /* Chrec folding functions. */
66 extern tree
chrec_fold_plus (tree
, tree
, tree
);
67 extern tree
chrec_fold_minus (tree
, tree
, tree
);
68 extern tree
chrec_fold_multiply (tree
, tree
, tree
);
69 extern tree
chrec_convert (tree
, tree
, tree
);
70 extern tree
chrec_convert_aggressive (tree
, tree
);
73 extern tree
chrec_apply (unsigned, tree
, tree
);
74 extern tree
chrec_replace_initial_condition (tree
, tree
);
75 extern tree
initial_condition (tree
);
76 extern tree
initial_condition_in_loop_num (tree
, unsigned);
77 extern tree
evolution_part_in_loop_num (tree
, unsigned);
78 extern tree
hide_evolution_in_other_loops_than_loop (tree
, unsigned);
79 extern tree
reset_evolution_in_loop (unsigned, tree
, tree
);
80 extern tree
chrec_merge (tree
, tree
);
83 extern bool eq_evolutions_p (tree
, tree
);
84 extern bool is_multivariate_chrec (tree
);
85 extern bool chrec_is_positive (tree
, bool *);
86 extern bool chrec_contains_symbols (tree
);
87 extern bool chrec_contains_symbols_defined_in_loop (tree
, unsigned);
88 extern bool chrec_contains_undetermined (tree
);
89 extern bool tree_contains_chrecs (tree
, int *);
90 extern bool evolution_function_is_affine_multivariate_p (tree
);
91 extern bool evolution_function_is_univariate_p (tree
);
92 extern unsigned nb_vars_in_chrec (tree
);
96 /* Build a polynomial chain of recurrence. */
99 build_polynomial_chrec (unsigned loop_num
,
103 if (left
== chrec_dont_know
104 || right
== chrec_dont_know
)
105 return chrec_dont_know
;
107 gcc_assert (TREE_TYPE (left
) == TREE_TYPE (right
));
109 return build3 (POLYNOMIAL_CHREC
, TREE_TYPE (left
),
110 build_int_cst (NULL_TREE
, loop_num
), left
, right
);
117 /* Determines whether CHREC is equal to zero. */
120 chrec_zerop (tree chrec
)
122 if (chrec
== NULL_TREE
)
125 if (TREE_CODE (chrec
) == INTEGER_CST
)
126 return integer_zerop (chrec
);
131 /* Determines whether the expression CHREC is a constant. */
134 evolution_function_is_constant_p (tree chrec
)
136 if (chrec
== NULL_TREE
)
139 switch (TREE_CODE (chrec
))
150 extern bool evolution_function_is_invariant_p (tree
, int);
151 /* Determine whether the given tree is an affine evolution function or not. */
154 evolution_function_is_affine_p (tree chrec
)
156 if (chrec
== NULL_TREE
)
159 switch (TREE_CODE (chrec
))
161 case POLYNOMIAL_CHREC
:
162 if (evolution_function_is_invariant_p (CHREC_LEFT (chrec
),
163 CHREC_VARIABLE (chrec
))
164 && evolution_function_is_invariant_p (CHREC_RIGHT (chrec
),
165 CHREC_VARIABLE (chrec
)))
175 /* Determine whether the given tree is an affine or constant evolution
179 evolution_function_is_affine_or_constant_p (tree chrec
)
181 return evolution_function_is_affine_p (chrec
)
182 || evolution_function_is_constant_p (chrec
);
185 /* Determines whether EXPR does not contains chrec expressions. */
188 tree_does_not_contain_chrecs (tree expr
)
190 return !tree_contains_chrecs (expr
, NULL
);
193 /* Determines whether CHREC is a loop invariant with respect to LOOP_NUM.
194 Set the result in RES and return true when the property can be computed. */
197 no_evolution_in_loop_p (tree chrec
, unsigned loop_num
, bool *res
)
201 if (chrec
== chrec_not_analyzed_yet
202 || chrec
== chrec_dont_know
203 || chrec_contains_symbols_defined_in_loop (chrec
, loop_num
))
206 scev
= hide_evolution_in_other_loops_than_loop (chrec
, loop_num
);
207 *res
= !tree_is_chrec (scev
);
211 /* Returns the type of the chrec. */
214 chrec_type (tree chrec
)
216 if (automatically_generated_chrec_p (chrec
))
219 return TREE_TYPE (chrec
);
223 #endif /* GCC_TREE_CHREC_H */