Home
last modified time | relevance | path

Searched refs:CHREC_LEFT (Results 1 – 6 of 6) sorted by relevance

/openbsd/src/gnu/gcc/gcc/
Dtree-chrec.c73 chrec_fold_plus (type, CHREC_LEFT (poly), cst), in chrec_fold_poly_cst()
79 chrec_fold_minus (type, CHREC_LEFT (poly), cst), in chrec_fold_poly_cst()
85 chrec_fold_multiply (type, CHREC_LEFT (poly), cst), in chrec_fold_poly_cst()
119 chrec_fold_plus (type, poly0, CHREC_LEFT (poly1)), in chrec_fold_plus_poly_poly()
124 chrec_fold_minus (type, poly0, CHREC_LEFT (poly1)), in chrec_fold_plus_poly_poly()
136 chrec_fold_plus (type, CHREC_LEFT (poly0), poly1), in chrec_fold_plus_poly_poly()
141 chrec_fold_minus (type, CHREC_LEFT (poly0), poly1), in chrec_fold_plus_poly_poly()
148 (type, CHREC_LEFT (poly0), CHREC_LEFT (poly1)); in chrec_fold_plus_poly_poly()
155 (type, CHREC_LEFT (poly0), CHREC_LEFT (poly1)); in chrec_fold_plus_poly_poly()
193 chrec_fold_multiply (type, CHREC_LEFT (poly1), poly0), in chrec_fold_multiply_poly_poly()
[all …]
Dtree-chrec.h27 #define CHREC_LEFT(NODE) TREE_OPERAND (NODE, 1) macro
163 if (evolution_function_is_invariant_p (CHREC_LEFT (chrec), in evolution_function_is_affine_p()
Dtree-scalar-evolution.c519 if (!chrec_is_positive (CHREC_LEFT (chrec), &value0) in chrec_is_positive()
683 left = CHREC_LEFT (chrec_before); in add_to_evolution_1()
695 left = add_to_evolution_1 (loop_nb, CHREC_LEFT (chrec_before), in add_to_evolution_1()
1745 chrec_convert (type, CHREC_LEFT (op), NULL_TREE), in fold_used_pointer_cast()
2226 op0 = instantiate_parameters_1 (loop, CHREC_LEFT (chrec), in instantiate_parameters_1()
2236 if (CHREC_LEFT (chrec) != op0 in instantiate_parameters_1()
2835 iv->base = CHREC_LEFT (ev); in simple_iv()
Dtree-data-ref.c2626 return initialize_matrix_A (A, CHREC_LEFT (chrec), index + 1, mult); in initialize_matrix_A()
2703 step_x = int_cst_value (CHREC_RIGHT (CHREC_LEFT (chrec_a))); in compute_overlap_steps_for_affine_1_2()
2707 numiter_x = get_number_of_iters_for_loop (CHREC_VARIABLE (CHREC_LEFT (chrec_a))); in compute_overlap_steps_for_affine_1_2()
3150 left_a = CHREC_LEFT (*chrec_a); in can_use_analyze_subscript_affine_affine()
3151 left_b = chrec_convert (type, CHREC_LEFT (*chrec_b), NULL_TREE); in can_use_analyze_subscript_affine_affine()
3272 return chrec_steps_divide_constant_p (CHREC_LEFT (chrec), cst, res); in chrec_steps_divide_constant_p()
3655 tree c_1 = CHREC_LEFT (c_2); in add_multivariate_self_dist()
3656 tree c_0 = CHREC_LEFT (c_1); in add_multivariate_self_dist()
Dtree-pretty-print.c1668 dump_generic_node (buffer, CHREC_LEFT (node), spc, flags, false); in dump_generic_node()
Dtree.def892 Under the form: cr = {CHREC_LEFT (cr), +, CHREC_RIGHT (cr)}. */