static int
mark_mem_use (rtx *x, void *data ATTRIBUTE_UNUSED)
{
- if (GET_CODE (*x) == MEM)
+ if (MEM_P (*x))
mem_ref_p = true;
return 0;
}
static void
mark_mem_store (rtx loc, rtx setter ATTRIBUTE_UNUSED, void *data ATTRIBUTE_UNUSED)
{
- if (GET_CODE (loc) == MEM)
+ if (MEM_P (loc))
mem_ref_p = true;
}
if (x == 0)
return false;
- if (GET_CODE (x) == MEM)
+ if (MEM_P (x))
return true;
code = GET_CODE (x);
return;
/* We must not add ANTI dep when there is an intra-loop TRUE dep in
the opozite direction. If the first_def reaches the USE then there is
- such a dep. */
+ such a dep. */
if (! bitmap_bit_p (bb_info->rd_gen, first_def->id))
create_ddg_dep_no_link (g, use_node, def_node, ANTI_DEP, REG_DEP, 1);
}
}
/* Perform intra-block Data Dependency analysis and connect the nodes in
- the DDG. We assume the loop has a single basic block. */
+ the DDG. We assume the loop has a single basic block. */
static void
build_intra_loop_deps (ddg_ptr g)
{
get_block_head_tail (g->bb->index, &head, &tail);
sched_analyze (&tmp_deps, head, tail);
- /* Build intra-loop data dependecies using the scheduler dependecy
+ /* Build intra-loop data dependencies using the scheduler dependency
analysis. */
for (i = 0; i < g->num_nodes; i++)
{
{
if (! INSN_P (insn))
{
- if (! first_note && GET_CODE (insn) == NOTE
+ if (! first_note && NOTE_P (insn)
&& NOTE_LINE_NUMBER (insn) != NOTE_INSN_BASIC_BLOCK)
first_note = insn;
continue;
}
- if (GET_CODE (insn) == JUMP_INSN)
+ if (JUMP_P (insn))
{
if (g->closing_branch)
abort (); /* Found two branches in DDG. */
if (!g->closing_branch)
abort (); /* Found no branch in DDG. */
- /* Build the data dependecy graph. */
+ /* Build the data dependency graph. */
build_intra_loop_deps (g);
build_inter_loop_deps (g, df);
return g;