Searched refs:CHREC_RIGHT (Results 1 - 5 of 5) sorted by relevance
| /freebsd-10.2-release/contrib/gcc/ |
| H A D | tree-chrec.c | 75 CHREC_RIGHT (poly));
81 CHREC_RIGHT (poly));
87 chrec_fold_multiply (type, CHREC_RIGHT (poly), cst));
121 CHREC_RIGHT (poly1));
126 chrec_fold_multiply (type, CHREC_RIGHT (poly1),
138 CHREC_RIGHT (poly0));
143 CHREC_RIGHT (poly0));
151 (type, CHREC_RIGHT (poly0), CHREC_RIGHT (poly1));
158 (type, CHREC_RIGHT (poly
[all...] |
| H A D | tree-chrec.h | 28 #define CHREC_RIGHT(NODE) TREE_OPERAND (NODE, 2) macro
169 && evolution_function_is_invariant_p (CHREC_RIGHT (chrec),
|
| H A D | tree-data-ref.c | 2460 if (!chrec_is_positive (CHREC_RIGHT (chrec_b), &value1))
2480 if (tree_fold_divides_p (CHREC_RIGHT (chrec_b), difference))
2490 CHREC_RIGHT (chrec_b));
2541 if (!chrec_is_positive (CHREC_RIGHT (chrec_b), &value2))
2560 if (tree_fold_divides_p (CHREC_RIGHT (chrec_b), difference))
2568 CHREC_RIGHT (chrec_b));
2629 A[index][0] = mult * int_cst_value (CHREC_RIGHT (chrec));
2707 step_x = int_cst_value (CHREC_RIGHT (CHREC_LEFT (chrec_a)));
2708 step_y = int_cst_value (CHREC_RIGHT (chrec_a));
2709 step_z = int_cst_value (CHREC_RIGHT (chrec_
[all...] |
| H A D | tree-scalar-evolution.c | 521 || !chrec_is_positive (CHREC_RIGHT (chrec), &value1))
685 right = CHREC_RIGHT (chrec_before);
698 right = CHREC_RIGHT (chrec_before);
1751 chrec_convert (type, CHREC_RIGHT (op), NULL_TREE));
2236 op1 = instantiate_parameters_1 (loop, CHREC_RIGHT (chrec),
2242 || CHREC_RIGHT (chrec) != op1)
2832 iv->step = CHREC_RIGHT (ev);
|
| H A D | tree-pretty-print.c | 1670 dump_generic_node (buffer, CHREC_RIGHT (node), spc, flags, false);
|
Completed in 119 milliseconds