&& TREE_CODE (step) == INTEGER_CST)
{
tree i_plus_s = fold_build2 (PLUS_EXPR, integer_type_node, init, step);
- tree sign = fold_build2 (GT_EXPR, boolean_type_node, i_plus_s, init);
+ tree sign = fold_binary (GT_EXPR, boolean_type_node, i_plus_s, init);
if (sign == boolean_true_node)
estimation = fold_build2 (CEIL_DIV_EXPR, integer_type_node,
fprintf (dump_file, ")\n");
}
- res = xmalloc (sizeof (struct data_reference));
+ res = XNEW (struct data_reference);
DR_STMT (res) = stmt;
DR_REF (res) = ref;
fprintf (dump_file, ")\n");
}
- res = xmalloc (sizeof (struct data_reference));
+ res = XNEW (struct data_reference);
DR_STMT (res) = stmt;
DR_REF (res) = ref;
bool differ_p;
unsigned int i;
- res = xmalloc (sizeof (struct data_dependence_relation));
+ res = XNEW (struct data_dependence_relation);
DDR_A (res) = a;
DDR_B (res) = b;
{
struct subscript *subscript;
- subscript = xmalloc (sizeof (struct subscript));
+ subscript = XNEW (struct subscript);
SUB_CONFLICTS_IN_A (subscript) = chrec_dont_know;
SUB_CONFLICTS_IN_B (subscript) = chrec_dont_know;
SUB_LAST_CONFLICT (subscript) = chrec_dont_know;
struct data_reference *res;
insert_dont_know_node:;
- res = xmalloc (sizeof (struct data_reference));
+ res = XNEW (struct data_reference);
DR_STMT (res) = NULL_TREE;
DR_REF (res) = NULL_TREE;
DR_BASE_OBJECT (res) = NULL;