edge->m_summary_id = -1;
edges_count++;
- gcc_assert (++edges_max_uid != 0);
+ ++edges_max_uid;
+ gcc_assert (edges_max_uid != 0);
edge->m_uid = edges_max_uid;
edge->aux = NULL;
edge->caller = caller;
if (varargs)
XVECEXP (pat, 0, vec_pos++) = gen_rtx_USE (VOIDmode, varargs);
- gcc_assert (vec_pos = XVECLEN (pat, 0));
+ gcc_assert (vec_pos == XVECLEN (pat, 0));
nvptx_emit_forking (parallel, true);
emit_call_insn (pat);
eh_region new_r;
new_r = gen_eh_region (old_r->type, outer);
- gcc_assert (!data->eh_map->put (old_r, new_r));
+ bool existed = data->eh_map->put (old_r, new_r);
+ gcc_assert (!existed);
switch (old_r->type)
{
continue;
new_lp = gen_eh_landing_pad (new_r);
- gcc_assert (!data->eh_map->put (old_lp, new_lp));
+ bool existed = data->eh_map->put (old_lp, new_lp);
+ gcc_assert (!existed);
new_lp->post_landing_pad
= data->label_map (old_lp->post_landing_pad, data->label_map_data);
if ((col = (col+1) % 8) == 0)
fputs ("\n ", output_file);
decl = description->decls[i];
- gcc_assert (j++ == DECL_INSN_RESERV (decl)->insn_num);
+ gcc_assert (j == DECL_INSN_RESERV (decl)->insn_num);
+ ++j;
fprintf (output_file, "% 4d,",
DECL_INSN_RESERV (decl)->default_latency);
}
aff.offset = 0;
expr = aff_combination_to_tree (&aff);
- gcc_assert (!alt_base_map->put (base, base == expr ? NULL : expr));
+ bool existed = alt_base_map->put (base, base == expr ? NULL : expr);
+ gcc_assert (!existed);
return expr == base ? NULL : expr;
}
static void
add_cand_for_stmt (gimple *gs, slsr_cand_t c)
{
- gcc_assert (!stmt_cand_map->put (gs, c));
+ bool existed = stmt_cand_map->put (gs, c);
+ gcc_assert (!existed);
}
\f
/* Given PHI which contains a phi statement, determine whether it
last_node = encoder->nodes.pop ();
if (last_node.node != node)
{
- gcc_assert (encoder->map->put (last_node.node, index + 1));
+ bool existed = encoder->map->put (last_node.node, index + 1);
+ gcc_assert (existed);
/* Move the last element to the original spot of NODE. */
encoder->nodes[index] = last_node;
{
if (!pipe_path.empty ())
{
- gcc_assert (close (pipefd) == 0);
+ int res = close (pipefd);
+ gcc_assert (res == 0);
pipefd = -1;
}
}
{
int fd = pipe_path.empty () ? wfd : pipefd;
char c = 'G';
- gcc_assert (write (fd, &c, 1) == 1);
+ int res = write (fd, &c, 1);
+ gcc_assert (res == 1);
}
if (!get_eh_throw_stmt_table (ifun))
set_eh_throw_stmt_table (ifun, hash_map<gimple *, int>::create_ggc (31));
- gcc_assert (!get_eh_throw_stmt_table (ifun)->put (t, num));
+ bool existed = get_eh_throw_stmt_table (ifun)->put (t, num);
+ gcc_assert (!existed);
}
/* Add statement T in the current function (cfun) to EH landing pad NUM. */
case IFN_MASK_LEN_LOAD:
case IFN_MASK_LEN_STORE:
/* The second argument contains the correct alias type. */
- gcc_assert (use->op_p = gimple_call_arg_ptr (call, 0));
+ gcc_assert (use->op_p == gimple_call_arg_ptr (call, 0));
return TREE_TYPE (gimple_call_arg (call, 1));
default:
insert_operand_rank (tree e, int64_t rank)
{
gcc_assert (rank > 0);
- gcc_assert (!operand_rank->put (e, rank));
+ bool existed = operand_rank->put (e, rank);
+ gcc_assert (!existed);
}
/* Given an expression E, return the rank of the expression. */
insert_vi_for_tree (tree t, varinfo_t vi)
{
gcc_assert (vi);
- gcc_assert (!vi_for_tree->put (t, vi));
+ bool existed = vi_for_tree->put (t, vi);
+ gcc_assert (!existed);
}
/* Find the variable info for tree T in VI_FOR_TREE. If T does not