Searched refs:CHREC_LEFT (Results 1 - 5 of 5) sorted by relevance

/freebsd-10.3-release/contrib/gcc/
H A Dtree-chrec.c74 chrec_fold_plus (type, CHREC_LEFT (poly), cst),
80 chrec_fold_minus (type, CHREC_LEFT (poly), cst),
86 chrec_fold_multiply (type, CHREC_LEFT (poly), cst),
120 chrec_fold_plus (type, poly0, CHREC_LEFT (poly1)),
125 chrec_fold_minus (type, poly0, CHREC_LEFT (poly1)),
137 chrec_fold_plus (type, CHREC_LEFT (poly0), poly1),
142 chrec_fold_minus (type, CHREC_LEFT (poly0), poly1),
149 (type, CHREC_LEFT (poly0), CHREC_LEFT (poly1));
156 (type, CHREC_LEFT (poly
[all...]
H A Dtree-chrec.h27 #define CHREC_LEFT(NODE) TREE_OPERAND (NODE, 1) macro
167 if (evolution_function_is_invariant_p (CHREC_LEFT (chrec),
H A Dtree-scalar-evolution.c520 if (!chrec_is_positive (CHREC_LEFT (chrec), &value0)
684 left = CHREC_LEFT (chrec_before);
696 left = add_to_evolution_1 (loop_nb, CHREC_LEFT (chrec_before),
1750 chrec_convert (type, CHREC_LEFT (op), NULL_TREE),
2231 op0 = instantiate_parameters_1 (loop, CHREC_LEFT (chrec),
2241 if (CHREC_LEFT (chrec) != op0
2842 iv->base = CHREC_LEFT (ev);
H A Dtree-data-ref.c2630 return initialize_matrix_A (A, CHREC_LEFT (chrec), index + 1, mult);
2707 step_x = int_cst_value (CHREC_RIGHT (CHREC_LEFT (chrec_a)));
2711 numiter_x = get_number_of_iters_for_loop (CHREC_VARIABLE (CHREC_LEFT (chrec_a)));
3154 left_a = CHREC_LEFT (*chrec_a);
3155 left_b = chrec_convert (type, CHREC_LEFT (*chrec_b), NULL_TREE);
3276 return chrec_steps_divide_constant_p (CHREC_LEFT (chrec), cst, res);
3659 tree c_1 = CHREC_LEFT (c_2);
3660 tree c_0 = CHREC_LEFT (c_1);
H A Dtree-pretty-print.c1668 dump_generic_node (buffer, CHREC_LEFT (node), spc, flags, false);

Completed in 72 milliseconds