1 /* Chains of recurrences.
2 Copyright (C) 2003, 2004 Free Software Foundation, Inc.
3 Contributed by Sebastian Pop <s.pop@laposte.net>
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 2, 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 COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
22 /* This file implements operations on chains of recurrences. Chains
23 of recurrences are used for modeling evolution functions of scalar
29 #include "coretypes.h"
34 #include "diagnostic.h"
36 #include "tree-chrec.h"
37 #include "tree-pass.h"
41 /* Extended folder for chrecs. */
43 /* Determines whether CST is not a constant evolution. */
46 is_not_constant_evolution (tree cst)
48 return (TREE_CODE (cst) == POLYNOMIAL_CHREC);
51 /* Fold CODE for a polynomial function and a constant. */
54 chrec_fold_poly_cst (enum tree_code code,
61 gcc_assert (TREE_CODE (poly) == POLYNOMIAL_CHREC);
62 gcc_assert (!is_not_constant_evolution (cst));
67 return build_polynomial_chrec
68 (CHREC_VARIABLE (poly),
69 chrec_fold_plus (type, CHREC_LEFT (poly), cst),
73 return build_polynomial_chrec
74 (CHREC_VARIABLE (poly),
75 chrec_fold_minus (type, CHREC_LEFT (poly), cst),
79 return build_polynomial_chrec
80 (CHREC_VARIABLE (poly),
81 chrec_fold_multiply (type, CHREC_LEFT (poly), cst),
82 chrec_fold_multiply (type, CHREC_RIGHT (poly), cst));
85 return chrec_dont_know;
89 /* Fold the addition of two polynomial functions. */
92 chrec_fold_plus_poly_poly (enum tree_code code,
101 gcc_assert (TREE_CODE (poly0) == POLYNOMIAL_CHREC);
102 gcc_assert (TREE_CODE (poly1) == POLYNOMIAL_CHREC);
105 {a, +, b}_1 + {c, +, d}_2 -> {{a, +, b}_1 + c, +, d}_2,
106 {a, +, b}_2 + {c, +, d}_1 -> {{c, +, d}_1 + a, +, b}_2,
107 {a, +, b}_x + {c, +, d}_x -> {a+c, +, b+d}_x. */
108 if (CHREC_VARIABLE (poly0) < CHREC_VARIABLE (poly1))
110 if (code == PLUS_EXPR)
111 return build_polynomial_chrec
112 (CHREC_VARIABLE (poly1),
113 chrec_fold_plus (type, poly0, CHREC_LEFT (poly1)),
114 CHREC_RIGHT (poly1));
116 return build_polynomial_chrec
117 (CHREC_VARIABLE (poly1),
118 chrec_fold_minus (type, poly0, CHREC_LEFT (poly1)),
119 chrec_fold_multiply (type, CHREC_RIGHT (poly1),
120 build_int_cst_type (type, -1)));
123 if (CHREC_VARIABLE (poly0) > CHREC_VARIABLE (poly1))
125 if (code == PLUS_EXPR)
126 return build_polynomial_chrec
127 (CHREC_VARIABLE (poly0),
128 chrec_fold_plus (type, CHREC_LEFT (poly0), poly1),
129 CHREC_RIGHT (poly0));
131 return build_polynomial_chrec
132 (CHREC_VARIABLE (poly0),
133 chrec_fold_minus (type, CHREC_LEFT (poly0), poly1),
134 CHREC_RIGHT (poly0));
137 if (code == PLUS_EXPR)
139 left = chrec_fold_plus
140 (type, CHREC_LEFT (poly0), CHREC_LEFT (poly1));
141 right = chrec_fold_plus
142 (type, CHREC_RIGHT (poly0), CHREC_RIGHT (poly1));
146 left = chrec_fold_minus
147 (type, CHREC_LEFT (poly0), CHREC_LEFT (poly1));
148 right = chrec_fold_minus
149 (type, CHREC_RIGHT (poly0), CHREC_RIGHT (poly1));
152 if (chrec_zerop (right))
155 return build_polynomial_chrec
156 (CHREC_VARIABLE (poly0), left, right);
161 /* Fold the multiplication of two polynomial functions. */
164 chrec_fold_multiply_poly_poly (tree type,
170 gcc_assert (TREE_CODE (poly0) == POLYNOMIAL_CHREC);
171 gcc_assert (TREE_CODE (poly1) == POLYNOMIAL_CHREC);
173 /* {a, +, b}_1 * {c, +, d}_2 -> {c*{a, +, b}_1, +, d}_2,
174 {a, +, b}_2 * {c, +, d}_1 -> {a*{c, +, d}_1, +, b}_2,
175 {a, +, b}_x * {c, +, d}_x -> {a*c, +, a*d + b*c + b*d, +, 2*b*d}_x. */
176 if (CHREC_VARIABLE (poly0) < CHREC_VARIABLE (poly1))
177 /* poly0 is a constant wrt. poly1. */
178 return build_polynomial_chrec
179 (CHREC_VARIABLE (poly1),
180 chrec_fold_multiply (type, CHREC_LEFT (poly1), poly0),
181 CHREC_RIGHT (poly1));
183 if (CHREC_VARIABLE (poly1) < CHREC_VARIABLE (poly0))
184 /* poly1 is a constant wrt. poly0. */
185 return build_polynomial_chrec
186 (CHREC_VARIABLE (poly0),
187 chrec_fold_multiply (type, CHREC_LEFT (poly0), poly1),
188 CHREC_RIGHT (poly0));
190 /* poly0 and poly1 are two polynomials in the same variable,
191 {a, +, b}_x * {c, +, d}_x -> {a*c, +, a*d + b*c + b*d, +, 2*b*d}_x. */
193 build_polynomial_chrec
194 (CHREC_VARIABLE (poly0),
195 build_polynomial_chrec
196 (CHREC_VARIABLE (poly0),
199 chrec_fold_multiply (type, CHREC_LEFT (poly0), CHREC_LEFT (poly1)),
201 /* "a*d + b*c + b*d". */
203 (type, chrec_fold_multiply (type, CHREC_LEFT (poly0), CHREC_RIGHT (poly1)),
207 chrec_fold_multiply (type, CHREC_RIGHT (poly0), CHREC_LEFT (poly1)),
208 chrec_fold_multiply (type, CHREC_RIGHT (poly0), CHREC_RIGHT (poly1))))),
212 (type, build_int_cst (NULL_TREE, 2),
213 chrec_fold_multiply (type, CHREC_RIGHT (poly0), CHREC_RIGHT (poly1))));
216 /* When the operands are automatically_generated_chrec_p, the fold has
217 to respect the semantics of the operands. */
220 chrec_fold_automatically_generated_operands (tree op0,
223 if (op0 == chrec_dont_know
224 || op1 == chrec_dont_know)
225 return chrec_dont_know;
227 if (op0 == chrec_known
228 || op1 == chrec_known)
231 if (op0 == chrec_not_analyzed_yet
232 || op1 == chrec_not_analyzed_yet)
233 return chrec_not_analyzed_yet;
235 /* The default case produces a safe result. */
236 return chrec_dont_know;
239 /* Fold the addition of two chrecs. */
242 chrec_fold_plus_1 (enum tree_code code,
247 if (automatically_generated_chrec_p (op0)
248 || automatically_generated_chrec_p (op1))
249 return chrec_fold_automatically_generated_operands (op0, op1);
251 switch (TREE_CODE (op0))
253 case POLYNOMIAL_CHREC:
254 switch (TREE_CODE (op1))
256 case POLYNOMIAL_CHREC:
257 return chrec_fold_plus_poly_poly (code, type, op0, op1);
260 if (code == PLUS_EXPR)
261 return build_polynomial_chrec
262 (CHREC_VARIABLE (op0),
263 chrec_fold_plus (type, CHREC_LEFT (op0), op1),
266 return build_polynomial_chrec
267 (CHREC_VARIABLE (op0),
268 chrec_fold_minus (type, CHREC_LEFT (op0), op1),
273 switch (TREE_CODE (op1))
275 case POLYNOMIAL_CHREC:
276 if (code == PLUS_EXPR)
277 return build_polynomial_chrec
278 (CHREC_VARIABLE (op1),
279 chrec_fold_plus (type, op0, CHREC_LEFT (op1)),
282 return build_polynomial_chrec
283 (CHREC_VARIABLE (op1),
284 chrec_fold_minus (type, op0, CHREC_LEFT (op1)),
285 chrec_fold_multiply (type, CHREC_RIGHT (op1),
286 build_int_cst_type (type, -1)));
289 if (tree_contains_chrecs (op0)
290 || tree_contains_chrecs (op1))
291 return build (code, type, op0, op1);
293 return fold (build (code, type, op0, op1));
298 /* Fold the addition of two chrecs. */
301 chrec_fold_plus (tree type,
305 if (integer_zerop (op0))
307 if (integer_zerop (op1))
310 return chrec_fold_plus_1 (PLUS_EXPR, type, op0, op1);
313 /* Fold the subtraction of two chrecs. */
316 chrec_fold_minus (tree type,
320 if (integer_zerop (op1))
323 return chrec_fold_plus_1 (MINUS_EXPR, type, op0, op1);
326 /* Fold the multiplication of two chrecs. */
329 chrec_fold_multiply (tree type,
333 if (automatically_generated_chrec_p (op0)
334 || automatically_generated_chrec_p (op1))
335 return chrec_fold_automatically_generated_operands (op0, op1);
337 switch (TREE_CODE (op0))
339 case POLYNOMIAL_CHREC:
340 switch (TREE_CODE (op1))
342 case POLYNOMIAL_CHREC:
343 return chrec_fold_multiply_poly_poly (type, op0, op1);
346 if (integer_onep (op1))
348 if (integer_zerop (op1))
349 return build_int_cst_type (type, 0);
351 return build_polynomial_chrec
352 (CHREC_VARIABLE (op0),
353 chrec_fold_multiply (type, CHREC_LEFT (op0), op1),
354 chrec_fold_multiply (type, CHREC_RIGHT (op0), op1));
358 if (integer_onep (op0))
361 if (integer_zerop (op0))
362 return build_int_cst_type (type, 0);
364 switch (TREE_CODE (op1))
366 case POLYNOMIAL_CHREC:
367 return build_polynomial_chrec
368 (CHREC_VARIABLE (op1),
369 chrec_fold_multiply (type, CHREC_LEFT (op1), op0),
370 chrec_fold_multiply (type, CHREC_RIGHT (op1), op0));
373 if (integer_onep (op1))
375 if (integer_zerop (op1))
376 return build_int_cst_type (type, 0);
377 return fold (build (MULT_EXPR, type, op0, op1));
389 tree_fold_factorial (tree f)
391 if (tree_int_cst_sgn (f) <= 0)
392 return integer_one_node;
395 (build (MULT_EXPR, integer_type_node, f,
396 tree_fold_factorial (fold (build (MINUS_EXPR, integer_type_node,
397 f, integer_one_node)))));
400 /* The binomial coefficient. */
403 tree_fold_binomial (tree n,
407 (build (EXACT_DIV_EXPR, integer_type_node, tree_fold_factorial (n),
408 fold (build (MULT_EXPR, integer_type_node,
409 tree_fold_factorial (k),
411 (fold (build (MINUS_EXPR, integer_type_node,
415 /* Helper function. Use the Newton's interpolating formula for
416 evaluating the value of the evolution function. */
419 chrec_evaluate (unsigned var,
424 tree type = chrec_type (chrec);
425 tree binomial_n_k = tree_fold_binomial (n, k);
427 if (TREE_CODE (chrec) == POLYNOMIAL_CHREC)
429 if (CHREC_VARIABLE (chrec) > var)
430 return chrec_evaluate (var, CHREC_LEFT (chrec), n, k);
432 if (CHREC_VARIABLE (chrec) == var)
433 return chrec_fold_plus
435 fold (build (MULT_EXPR, type, binomial_n_k, CHREC_LEFT (chrec))),
436 chrec_evaluate (var, CHREC_RIGHT (chrec), n,
437 fold (build (PLUS_EXPR, type, k, integer_one_node))));
439 return fold (build (MULT_EXPR, type, binomial_n_k, chrec));
442 return fold (build (MULT_EXPR, type, binomial_n_k, chrec));
445 /* Evaluates "CHREC (X)" when the varying variable is VAR.
446 Example: Given the following parameters,
452 The result is given by the Newton's interpolating formula:
453 3 * \binom{10}{0} + 4 * \binom{10}{1}.
457 chrec_apply (unsigned var,
461 tree type = chrec_type (chrec);
462 tree res = chrec_dont_know;
464 if (automatically_generated_chrec_p (chrec)
465 || automatically_generated_chrec_p (x)
467 /* When the symbols are defined in an outer loop, it is possible
468 to symbolically compute the apply, since the symbols are
469 constants with respect to the varying loop. */
470 || chrec_contains_symbols_defined_in_loop (chrec, var)
471 || chrec_contains_symbols (x))
472 return chrec_dont_know;
474 if (dump_file && (dump_flags & TDF_DETAILS))
475 fprintf (dump_file, "(chrec_apply \n");
477 if (evolution_function_is_affine_p (chrec))
479 /* "{a, +, b} (x)" -> "a + b*x". */
480 if (TREE_CODE (CHREC_LEFT (chrec)) == INTEGER_CST
481 && integer_zerop (CHREC_LEFT (chrec)))
482 res = chrec_fold_multiply (type, CHREC_RIGHT (chrec), x);
485 res = chrec_fold_plus (type, CHREC_LEFT (chrec),
486 chrec_fold_multiply (type,
487 CHREC_RIGHT (chrec), x));
490 else if (TREE_CODE (chrec) != POLYNOMIAL_CHREC)
493 else if (TREE_CODE (x) == INTEGER_CST
494 && tree_int_cst_sgn (x) == 1)
495 /* testsuite/.../ssa-chrec-38.c. */
496 res = chrec_evaluate (var, chrec, x, integer_zero_node);
499 res = chrec_dont_know;
501 if (dump_file && (dump_flags & TDF_DETAILS))
503 fprintf (dump_file, " (varying_loop = %d\n", var);
504 fprintf (dump_file, ")\n (chrec = ");
505 print_generic_expr (dump_file, chrec, 0);
506 fprintf (dump_file, ")\n (x = ");
507 print_generic_expr (dump_file, x, 0);
508 fprintf (dump_file, ")\n (res = ");
509 print_generic_expr (dump_file, res, 0);
510 fprintf (dump_file, "))\n");
516 /* Replaces the initial condition in CHREC with INIT_COND. */
519 chrec_replace_initial_condition (tree chrec,
522 if (automatically_generated_chrec_p (chrec))
525 switch (TREE_CODE (chrec))
527 case POLYNOMIAL_CHREC:
528 return build_polynomial_chrec
529 (CHREC_VARIABLE (chrec),
530 chrec_replace_initial_condition (CHREC_LEFT (chrec), init_cond),
531 CHREC_RIGHT (chrec));
538 /* Returns the initial condition of a given CHREC. */
541 initial_condition (tree chrec)
543 if (automatically_generated_chrec_p (chrec))
546 if (TREE_CODE (chrec) == POLYNOMIAL_CHREC)
547 return initial_condition (CHREC_LEFT (chrec));
552 /* Returns a univariate function that represents the evolution in
553 LOOP_NUM. Mask the evolution of any other loop. */
556 hide_evolution_in_other_loops_than_loop (tree chrec,
559 if (automatically_generated_chrec_p (chrec))
562 switch (TREE_CODE (chrec))
564 case POLYNOMIAL_CHREC:
565 if (CHREC_VARIABLE (chrec) == loop_num)
566 return build_polynomial_chrec
568 hide_evolution_in_other_loops_than_loop (CHREC_LEFT (chrec),
570 CHREC_RIGHT (chrec));
572 else if (CHREC_VARIABLE (chrec) < loop_num)
573 /* There is no evolution in this loop. */
574 return initial_condition (chrec);
577 return hide_evolution_in_other_loops_than_loop (CHREC_LEFT (chrec),
585 /* Returns the evolution part of CHREC in LOOP_NUM when RIGHT is
586 true, otherwise returns the initial condition in LOOP_NUM. */
589 chrec_component_in_loop_num (tree chrec,
595 if (automatically_generated_chrec_p (chrec))
598 switch (TREE_CODE (chrec))
600 case POLYNOMIAL_CHREC:
601 if (CHREC_VARIABLE (chrec) == loop_num)
604 component = CHREC_RIGHT (chrec);
606 component = CHREC_LEFT (chrec);
608 if (TREE_CODE (CHREC_LEFT (chrec)) != POLYNOMIAL_CHREC
609 || CHREC_VARIABLE (CHREC_LEFT (chrec)) != CHREC_VARIABLE (chrec))
613 return build_polynomial_chrec
615 chrec_component_in_loop_num (CHREC_LEFT (chrec),
621 else if (CHREC_VARIABLE (chrec) < loop_num)
622 /* There is no evolution part in this loop. */
626 return chrec_component_in_loop_num (CHREC_LEFT (chrec),
638 /* Returns the evolution part in LOOP_NUM. Example: the call
639 evolution_part_in_loop_num ({{0, +, 1}_1, +, 2}_1, 1) returns
643 evolution_part_in_loop_num (tree chrec,
646 return chrec_component_in_loop_num (chrec, loop_num, true);
649 /* Returns the initial condition in LOOP_NUM. Example: the call
650 initial_condition_in_loop_num ({{0, +, 1}_1, +, 2}_2, 2) returns
654 initial_condition_in_loop_num (tree chrec,
657 return chrec_component_in_loop_num (chrec, loop_num, false);
660 /* Set or reset the evolution of CHREC to NEW_EVOL in loop LOOP_NUM.
661 This function is essentially used for setting the evolution to
662 chrec_dont_know, for example after having determined that it is
663 impossible to say how many times a loop will execute. */
666 reset_evolution_in_loop (unsigned loop_num,
670 if (TREE_CODE (chrec) == POLYNOMIAL_CHREC
671 && CHREC_VARIABLE (chrec) > loop_num)
674 build_int_cst (NULL_TREE, CHREC_VARIABLE (chrec)),
675 reset_evolution_in_loop (loop_num, CHREC_LEFT (chrec), new_evol),
676 reset_evolution_in_loop (loop_num, CHREC_RIGHT (chrec), new_evol));
678 while (TREE_CODE (chrec) == POLYNOMIAL_CHREC
679 && CHREC_VARIABLE (chrec) == loop_num)
680 chrec = CHREC_LEFT (chrec);
682 return build_polynomial_chrec (loop_num, chrec, new_evol);
685 /* Merges two evolution functions that were found by following two
686 alternate paths of a conditional expression. */
689 chrec_merge (tree chrec1,
692 if (chrec1 == chrec_dont_know
693 || chrec2 == chrec_dont_know)
694 return chrec_dont_know;
696 if (chrec1 == chrec_known
697 || chrec2 == chrec_known)
700 if (chrec1 == chrec_not_analyzed_yet)
702 if (chrec2 == chrec_not_analyzed_yet)
705 if (operand_equal_p (chrec1, chrec2, 0))
708 return chrec_dont_know;
715 /* Helper function for is_multivariate_chrec. */
718 is_multivariate_chrec_rec (tree chrec, unsigned int rec_var)
720 if (chrec == NULL_TREE)
723 if (TREE_CODE (chrec) == POLYNOMIAL_CHREC)
725 if (CHREC_VARIABLE (chrec) != rec_var)
728 return (is_multivariate_chrec_rec (CHREC_LEFT (chrec), rec_var)
729 || is_multivariate_chrec_rec (CHREC_RIGHT (chrec), rec_var));
735 /* Determine whether the given chrec is multivariate or not. */
738 is_multivariate_chrec (tree chrec)
740 if (chrec == NULL_TREE)
743 if (TREE_CODE (chrec) == POLYNOMIAL_CHREC)
744 return (is_multivariate_chrec_rec (CHREC_LEFT (chrec),
745 CHREC_VARIABLE (chrec))
746 || is_multivariate_chrec_rec (CHREC_RIGHT (chrec),
747 CHREC_VARIABLE (chrec)));
752 /* Determines whether the chrec contains symbolic names or not. */
755 chrec_contains_symbols (tree chrec)
757 if (chrec == NULL_TREE)
760 if (TREE_CODE (chrec) == SSA_NAME
761 || TREE_CODE (chrec) == VAR_DECL
762 || TREE_CODE (chrec) == PARM_DECL
763 || TREE_CODE (chrec) == FUNCTION_DECL
764 || TREE_CODE (chrec) == LABEL_DECL
765 || TREE_CODE (chrec) == RESULT_DECL
766 || TREE_CODE (chrec) == FIELD_DECL)
769 switch (TREE_CODE_LENGTH (TREE_CODE (chrec)))
772 if (chrec_contains_symbols (TREE_OPERAND (chrec, 2)))
776 if (chrec_contains_symbols (TREE_OPERAND (chrec, 1)))
780 if (chrec_contains_symbols (TREE_OPERAND (chrec, 0)))
788 /* Determines whether the chrec contains undetermined coefficients. */
791 chrec_contains_undetermined (tree chrec)
793 if (chrec == chrec_dont_know
794 || chrec == chrec_not_analyzed_yet
795 || chrec == NULL_TREE)
798 switch (TREE_CODE_LENGTH (TREE_CODE (chrec)))
801 if (chrec_contains_undetermined (TREE_OPERAND (chrec, 2)))
805 if (chrec_contains_undetermined (TREE_OPERAND (chrec, 1)))
809 if (chrec_contains_undetermined (TREE_OPERAND (chrec, 0)))
817 /* Determines whether the tree EXPR contains chrecs. */
820 tree_contains_chrecs (tree expr)
822 if (expr == NULL_TREE)
825 if (tree_is_chrec (expr))
828 switch (TREE_CODE_LENGTH (TREE_CODE (expr)))
831 if (tree_contains_chrecs (TREE_OPERAND (expr, 2)))
835 if (tree_contains_chrecs (TREE_OPERAND (expr, 1)))
839 if (tree_contains_chrecs (TREE_OPERAND (expr, 0)))
847 /* Determine whether the given tree is an affine multivariate
851 evolution_function_is_affine_multivariate_p (tree chrec)
853 if (chrec == NULL_TREE)
856 switch (TREE_CODE (chrec))
858 case POLYNOMIAL_CHREC:
859 if (evolution_function_is_constant_p (CHREC_LEFT (chrec)))
861 if (evolution_function_is_constant_p (CHREC_RIGHT (chrec)))
865 if (TREE_CODE (CHREC_RIGHT (chrec)) == POLYNOMIAL_CHREC
866 && CHREC_VARIABLE (CHREC_RIGHT (chrec))
867 != CHREC_VARIABLE (chrec)
868 && evolution_function_is_affine_multivariate_p
869 (CHREC_RIGHT (chrec)))
877 if (evolution_function_is_constant_p (CHREC_RIGHT (chrec))
878 && TREE_CODE (CHREC_LEFT (chrec)) == POLYNOMIAL_CHREC
879 && CHREC_VARIABLE (CHREC_LEFT (chrec)) != CHREC_VARIABLE (chrec)
880 && evolution_function_is_affine_multivariate_p
881 (CHREC_LEFT (chrec)))
892 /* Determine whether the given tree is a function in zero or one
896 evolution_function_is_univariate_p (tree chrec)
898 if (chrec == NULL_TREE)
901 switch (TREE_CODE (chrec))
903 case POLYNOMIAL_CHREC:
904 switch (TREE_CODE (CHREC_LEFT (chrec)))
906 case POLYNOMIAL_CHREC:
907 if (CHREC_VARIABLE (chrec) != CHREC_VARIABLE (CHREC_LEFT (chrec)))
909 if (!evolution_function_is_univariate_p (CHREC_LEFT (chrec)))
917 switch (TREE_CODE (CHREC_RIGHT (chrec)))
919 case POLYNOMIAL_CHREC:
920 if (CHREC_VARIABLE (chrec) != CHREC_VARIABLE (CHREC_RIGHT (chrec)))
922 if (!evolution_function_is_univariate_p (CHREC_RIGHT (chrec)))
935 /* Returns the number of variables of CHREC. Example: the call
936 nb_vars_in_chrec ({{0, +, 1}_5, +, 2}_6) returns 2. */
939 nb_vars_in_chrec (tree chrec)
941 if (chrec == NULL_TREE)
944 switch (TREE_CODE (chrec))
946 case POLYNOMIAL_CHREC:
947 return 1 + nb_vars_in_chrec
948 (initial_condition_in_loop_num (chrec, CHREC_VARIABLE (chrec)));
957 /* Convert the initial condition of chrec to type. */
960 chrec_convert (tree type,
965 if (automatically_generated_chrec_p (chrec))
968 ct = chrec_type (chrec);
972 if (TYPE_PRECISION (ct) < TYPE_PRECISION (type))
973 return count_ev_in_wider_type (type, chrec);
975 switch (TREE_CODE (chrec))
977 case POLYNOMIAL_CHREC:
978 return build_polynomial_chrec (CHREC_VARIABLE (chrec),
982 CHREC_RIGHT (chrec)));
986 tree res = fold_convert (type, chrec);
988 /* Don't propagate overflows. */
989 TREE_OVERFLOW (res) = 0;
990 if (CONSTANT_CLASS_P (res))
991 TREE_CONSTANT_OVERFLOW (res) = 0;
997 /* Returns the type of the chrec. */
1000 chrec_type (tree chrec)
1002 if (automatically_generated_chrec_p (chrec))
1005 return TREE_TYPE (chrec);