}
}
-/* Return the HWI converted value of X. */
-
-static inline HOST_WIDE_INT
-dd_int_cst_value (tree x)
-{
- if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
- x = fold_convert (integer_type_node, x);
-
- return int_cst_value (x);
-}
-
/* Helper recursive function for initializing the matrix A. Returns
the initial value of CHREC. */
gcc_assert (chrec);
if (TREE_CODE (chrec) != POLYNOMIAL_CHREC)
- return dd_int_cst_value (chrec);
+ return int_cst_value (chrec);
- A[index][0] = mult * dd_int_cst_value (CHREC_RIGHT (chrec));
+ A[index][0] = mult * int_cst_value (CHREC_RIGHT (chrec));
return initialize_matrix_A (A, CHREC_LEFT (chrec), index + 1, mult);
}
affine_fn ova1, ova2, ovb;
tree last_conflicts_xz, last_conflicts_yz, last_conflicts_xyz;
- step_x = dd_int_cst_value (CHREC_RIGHT (CHREC_LEFT (chrec_a)));
- step_y = dd_int_cst_value (CHREC_RIGHT (chrec_a));
- step_z = dd_int_cst_value (CHREC_RIGHT (chrec_b));
+ step_x = int_cst_value (CHREC_RIGHT (CHREC_LEFT (chrec_a)));
+ step_y = int_cst_value (CHREC_RIGHT (chrec_a));
+ step_z = int_cst_value (CHREC_RIGHT (chrec_b));
niter_x =
estimated_loop_iterations_int (get_chrec_loop (CHREC_LEFT (chrec_a)),
niter_b = estimated_loop_iterations_int (get_chrec_loop (chrec_b),
false);
niter = MIN (niter_a, niter_b);
- step_a = dd_int_cst_value (CHREC_RIGHT (chrec_a));
- step_b = dd_int_cst_value (CHREC_RIGHT (chrec_b));
+ step_a = int_cst_value (CHREC_RIGHT (chrec_a));
+ step_b = int_cst_value (CHREC_RIGHT (chrec_b));
compute_overlap_steps_for_affine_univar (niter, step_a, step_b,
&ova, &ovb,
return false;
}
- dist = dd_int_cst_value (SUB_DISTANCE (subscript));
+ dist = int_cst_value (SUB_DISTANCE (subscript));
/* This is the subscript coupling test. If we have already
recorded a distance for this loop (a distance coming from
/* For "{{0, +, 2}_1, +, 3}_2" the distance vector is (3, -2). */
dist_v = lambda_vector_new (DDR_NB_LOOPS (ddr));
- v1 = dd_int_cst_value (CHREC_RIGHT (c_1));
- v2 = dd_int_cst_value (CHREC_RIGHT (c_2));
+ v1 = int_cst_value (CHREC_RIGHT (c_1));
+ v2 = int_cst_value (CHREC_RIGHT (c_2));
cd = gcd (v1, v2);
v1 /= cd;
v2 /= cd;
return false;
var_idx = index_in_loop_nest (var, DDR_LOOP_NEST (ddr));
- pb->eqs[eq].coef[offset + var_idx + 1] = dd_int_cst_value (right);
+ pb->eqs[eq].coef[offset + var_idx + 1] = int_cst_value (right);
/* Compute the innermost loop index. */
DDR_INNER_LOOP (ddr) = MAX (DDR_INNER_LOOP (ddr), var_idx);
if (offset == 0)
pb->eqs[eq].coef[var_idx + DDR_NB_LOOPS (ddr) + 1]
- += dd_int_cst_value (right);
+ += int_cst_value (right);
switch (TREE_CODE (left))
{
return init_omega_eq_with_af (pb, eq, offset, left, ddr);
case INTEGER_CST:
- pb->eqs[eq].coef[0] += dd_int_cst_value (left);
+ pb->eqs[eq].coef[0] += int_cst_value (left);
return true;
default:
}
case INTEGER_CST:
- pb->eqs[eq].coef[0] += dd_int_cst_value (access_fun);
+ pb->eqs[eq].coef[0] += int_cst_value (access_fun);
return true;
default: