/* Hooks for cfg representation specific functions.
|
/* Hooks for cfg representation specific functions.
|
Copyright (C) 2003, 2004, 2005, 2007 Free Software Foundation, Inc.
|
Copyright (C) 2003, 2004, 2005, 2007 Free Software Foundation, Inc.
|
Contributed by Sebastian Pop <s.pop@laposte.net>
|
Contributed by Sebastian Pop <s.pop@laposte.net>
|
|
|
This file is part of GCC.
|
This file is part of GCC.
|
|
|
GCC is free software; you can redistribute it and/or modify
|
GCC is free software; you can redistribute it and/or modify
|
it under the terms of the GNU General Public License as published by
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 3, or (at your option)
|
the Free Software Foundation; either version 3, or (at your option)
|
any later version.
|
any later version.
|
|
|
GCC is distributed in the hope that it will be useful,
|
GCC is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with GCC; see the file COPYING3. If not see
|
along with GCC; see the file COPYING3. If not see
|
<http://www.gnu.org/licenses/>. */
|
<http://www.gnu.org/licenses/>. */
|
|
|
#include "config.h"
|
#include "config.h"
|
#include "system.h"
|
#include "system.h"
|
#include "coretypes.h"
|
#include "coretypes.h"
|
#include "tm.h"
|
#include "tm.h"
|
#include "tree.h"
|
#include "tree.h"
|
#include "rtl.h"
|
#include "rtl.h"
|
#include "basic-block.h"
|
#include "basic-block.h"
|
#include "tree-flow.h"
|
#include "tree-flow.h"
|
#include "timevar.h"
|
#include "timevar.h"
|
#include "toplev.h"
|
#include "toplev.h"
|
|
|
/* A pointer to one of the hooks containers. */
|
/* A pointer to one of the hooks containers. */
|
static struct cfg_hooks *cfg_hooks;
|
static struct cfg_hooks *cfg_hooks;
|
|
|
/* Initialization of functions specific to the rtl IR. */
|
/* Initialization of functions specific to the rtl IR. */
|
void
|
void
|
rtl_register_cfg_hooks (void)
|
rtl_register_cfg_hooks (void)
|
{
|
{
|
cfg_hooks = &rtl_cfg_hooks;
|
cfg_hooks = &rtl_cfg_hooks;
|
}
|
}
|
|
|
/* Initialization of functions specific to the rtl IR. */
|
/* Initialization of functions specific to the rtl IR. */
|
void
|
void
|
cfg_layout_rtl_register_cfg_hooks (void)
|
cfg_layout_rtl_register_cfg_hooks (void)
|
{
|
{
|
cfg_hooks = &cfg_layout_rtl_cfg_hooks;
|
cfg_hooks = &cfg_layout_rtl_cfg_hooks;
|
}
|
}
|
|
|
/* Initialization of functions specific to the tree IR. */
|
/* Initialization of functions specific to the tree IR. */
|
|
|
void
|
void
|
tree_register_cfg_hooks (void)
|
tree_register_cfg_hooks (void)
|
{
|
{
|
cfg_hooks = &tree_cfg_hooks;
|
cfg_hooks = &tree_cfg_hooks;
|
}
|
}
|
|
|
/* Returns current ir type (rtl = 0, trees = 1). */
|
/* Returns current ir type (rtl = 0, trees = 1). */
|
|
|
int
|
int
|
ir_type (void)
|
ir_type (void)
|
{
|
{
|
return cfg_hooks == &tree_cfg_hooks ? 1 : 0;
|
return cfg_hooks == &tree_cfg_hooks ? 1 : 0;
|
}
|
}
|
|
|
/* Verify the CFG consistency.
|
/* Verify the CFG consistency.
|
|
|
Currently it does following: checks edge and basic block list correctness
|
Currently it does following: checks edge and basic block list correctness
|
and calls into IL dependent checking then. */
|
and calls into IL dependent checking then. */
|
|
|
void
|
void
|
verify_flow_info (void)
|
verify_flow_info (void)
|
{
|
{
|
size_t *edge_checksum;
|
size_t *edge_checksum;
|
int err = 0;
|
int err = 0;
|
basic_block bb, last_bb_seen;
|
basic_block bb, last_bb_seen;
|
basic_block *last_visited;
|
basic_block *last_visited;
|
|
|
timevar_push (TV_CFG_VERIFY);
|
timevar_push (TV_CFG_VERIFY);
|
last_visited = XCNEWVEC (basic_block, last_basic_block);
|
last_visited = XCNEWVEC (basic_block, last_basic_block);
|
edge_checksum = XCNEWVEC (size_t, last_basic_block);
|
edge_checksum = XCNEWVEC (size_t, last_basic_block);
|
|
|
/* Check bb chain & numbers. */
|
/* Check bb chain & numbers. */
|
last_bb_seen = ENTRY_BLOCK_PTR;
|
last_bb_seen = ENTRY_BLOCK_PTR;
|
FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR->next_bb, NULL, next_bb)
|
FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR->next_bb, NULL, next_bb)
|
{
|
{
|
if (bb != EXIT_BLOCK_PTR
|
if (bb != EXIT_BLOCK_PTR
|
&& bb != BASIC_BLOCK (bb->index))
|
&& bb != BASIC_BLOCK (bb->index))
|
{
|
{
|
error ("bb %d on wrong place", bb->index);
|
error ("bb %d on wrong place", bb->index);
|
err = 1;
|
err = 1;
|
}
|
}
|
|
|
if (bb->prev_bb != last_bb_seen)
|
if (bb->prev_bb != last_bb_seen)
|
{
|
{
|
error ("prev_bb of %d should be %d, not %d",
|
error ("prev_bb of %d should be %d, not %d",
|
bb->index, last_bb_seen->index, bb->prev_bb->index);
|
bb->index, last_bb_seen->index, bb->prev_bb->index);
|
err = 1;
|
err = 1;
|
}
|
}
|
|
|
last_bb_seen = bb;
|
last_bb_seen = bb;
|
}
|
}
|
|
|
/* Now check the basic blocks (boundaries etc.) */
|
/* Now check the basic blocks (boundaries etc.) */
|
FOR_EACH_BB_REVERSE (bb)
|
FOR_EACH_BB_REVERSE (bb)
|
{
|
{
|
int n_fallthru = 0;
|
int n_fallthru = 0;
|
edge e;
|
edge e;
|
edge_iterator ei;
|
edge_iterator ei;
|
|
|
if (bb->count < 0)
|
if (bb->count < 0)
|
{
|
{
|
error ("verify_flow_info: Wrong count of block %i %i",
|
error ("verify_flow_info: Wrong count of block %i %i",
|
bb->index, (int)bb->count);
|
bb->index, (int)bb->count);
|
err = 1;
|
err = 1;
|
}
|
}
|
if (bb->frequency < 0)
|
if (bb->frequency < 0)
|
{
|
{
|
error ("verify_flow_info: Wrong frequency of block %i %i",
|
error ("verify_flow_info: Wrong frequency of block %i %i",
|
bb->index, bb->frequency);
|
bb->index, bb->frequency);
|
err = 1;
|
err = 1;
|
}
|
}
|
FOR_EACH_EDGE (e, ei, bb->succs)
|
FOR_EACH_EDGE (e, ei, bb->succs)
|
{
|
{
|
if (last_visited [e->dest->index] == bb)
|
if (last_visited [e->dest->index] == bb)
|
{
|
{
|
error ("verify_flow_info: Duplicate edge %i->%i",
|
error ("verify_flow_info: Duplicate edge %i->%i",
|
e->src->index, e->dest->index);
|
e->src->index, e->dest->index);
|
err = 1;
|
err = 1;
|
}
|
}
|
if (e->probability < 0 || e->probability > REG_BR_PROB_BASE)
|
if (e->probability < 0 || e->probability > REG_BR_PROB_BASE)
|
{
|
{
|
error ("verify_flow_info: Wrong probability of edge %i->%i %i",
|
error ("verify_flow_info: Wrong probability of edge %i->%i %i",
|
e->src->index, e->dest->index, e->probability);
|
e->src->index, e->dest->index, e->probability);
|
err = 1;
|
err = 1;
|
}
|
}
|
if (e->count < 0)
|
if (e->count < 0)
|
{
|
{
|
error ("verify_flow_info: Wrong count of edge %i->%i %i",
|
error ("verify_flow_info: Wrong count of edge %i->%i %i",
|
e->src->index, e->dest->index, (int)e->count);
|
e->src->index, e->dest->index, (int)e->count);
|
err = 1;
|
err = 1;
|
}
|
}
|
|
|
last_visited [e->dest->index] = bb;
|
last_visited [e->dest->index] = bb;
|
|
|
if (e->flags & EDGE_FALLTHRU)
|
if (e->flags & EDGE_FALLTHRU)
|
n_fallthru++;
|
n_fallthru++;
|
|
|
if (e->src != bb)
|
if (e->src != bb)
|
{
|
{
|
error ("verify_flow_info: Basic block %d succ edge is corrupted",
|
error ("verify_flow_info: Basic block %d succ edge is corrupted",
|
bb->index);
|
bb->index);
|
fprintf (stderr, "Predecessor: ");
|
fprintf (stderr, "Predecessor: ");
|
dump_edge_info (stderr, e, 0);
|
dump_edge_info (stderr, e, 0);
|
fprintf (stderr, "\nSuccessor: ");
|
fprintf (stderr, "\nSuccessor: ");
|
dump_edge_info (stderr, e, 1);
|
dump_edge_info (stderr, e, 1);
|
fprintf (stderr, "\n");
|
fprintf (stderr, "\n");
|
err = 1;
|
err = 1;
|
}
|
}
|
|
|
edge_checksum[e->dest->index] += (size_t) e;
|
edge_checksum[e->dest->index] += (size_t) e;
|
}
|
}
|
if (n_fallthru > 1)
|
if (n_fallthru > 1)
|
{
|
{
|
error ("wrong amount of branch edges after unconditional jump %i", bb->index);
|
error ("wrong amount of branch edges after unconditional jump %i", bb->index);
|
err = 1;
|
err = 1;
|
}
|
}
|
|
|
FOR_EACH_EDGE (e, ei, bb->preds)
|
FOR_EACH_EDGE (e, ei, bb->preds)
|
{
|
{
|
if (e->dest != bb)
|
if (e->dest != bb)
|
{
|
{
|
error ("basic block %d pred edge is corrupted", bb->index);
|
error ("basic block %d pred edge is corrupted", bb->index);
|
fputs ("Predecessor: ", stderr);
|
fputs ("Predecessor: ", stderr);
|
dump_edge_info (stderr, e, 0);
|
dump_edge_info (stderr, e, 0);
|
fputs ("\nSuccessor: ", stderr);
|
fputs ("\nSuccessor: ", stderr);
|
dump_edge_info (stderr, e, 1);
|
dump_edge_info (stderr, e, 1);
|
fputc ('\n', stderr);
|
fputc ('\n', stderr);
|
err = 1;
|
err = 1;
|
}
|
}
|
|
|
if (ei.index != e->dest_idx)
|
if (ei.index != e->dest_idx)
|
{
|
{
|
error ("basic block %d pred edge is corrupted", bb->index);
|
error ("basic block %d pred edge is corrupted", bb->index);
|
error ("its dest_idx should be %d, not %d",
|
error ("its dest_idx should be %d, not %d",
|
ei.index, e->dest_idx);
|
ei.index, e->dest_idx);
|
fputs ("Predecessor: ", stderr);
|
fputs ("Predecessor: ", stderr);
|
dump_edge_info (stderr, e, 0);
|
dump_edge_info (stderr, e, 0);
|
fputs ("\nSuccessor: ", stderr);
|
fputs ("\nSuccessor: ", stderr);
|
dump_edge_info (stderr, e, 1);
|
dump_edge_info (stderr, e, 1);
|
fputc ('\n', stderr);
|
fputc ('\n', stderr);
|
err = 1;
|
err = 1;
|
}
|
}
|
|
|
edge_checksum[e->dest->index] -= (size_t) e;
|
edge_checksum[e->dest->index] -= (size_t) e;
|
}
|
}
|
}
|
}
|
|
|
/* Complete edge checksumming for ENTRY and EXIT. */
|
/* Complete edge checksumming for ENTRY and EXIT. */
|
{
|
{
|
edge e;
|
edge e;
|
edge_iterator ei;
|
edge_iterator ei;
|
|
|
FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
|
FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
|
edge_checksum[e->dest->index] += (size_t) e;
|
edge_checksum[e->dest->index] += (size_t) e;
|
|
|
FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
|
FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
|
edge_checksum[e->dest->index] -= (size_t) e;
|
edge_checksum[e->dest->index] -= (size_t) e;
|
}
|
}
|
|
|
FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
|
FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
|
if (edge_checksum[bb->index])
|
if (edge_checksum[bb->index])
|
{
|
{
|
error ("basic block %i edge lists are corrupted", bb->index);
|
error ("basic block %i edge lists are corrupted", bb->index);
|
err = 1;
|
err = 1;
|
}
|
}
|
|
|
last_bb_seen = ENTRY_BLOCK_PTR;
|
last_bb_seen = ENTRY_BLOCK_PTR;
|
|
|
/* Clean up. */
|
/* Clean up. */
|
free (last_visited);
|
free (last_visited);
|
free (edge_checksum);
|
free (edge_checksum);
|
|
|
if (cfg_hooks->verify_flow_info)
|
if (cfg_hooks->verify_flow_info)
|
err |= cfg_hooks->verify_flow_info ();
|
err |= cfg_hooks->verify_flow_info ();
|
if (err)
|
if (err)
|
internal_error ("verify_flow_info failed");
|
internal_error ("verify_flow_info failed");
|
timevar_pop (TV_CFG_VERIFY);
|
timevar_pop (TV_CFG_VERIFY);
|
}
|
}
|
|
|
/* Print out one basic block. This function takes care of the purely
|
/* Print out one basic block. This function takes care of the purely
|
graph related information. The cfg hook for the active representation
|
graph related information. The cfg hook for the active representation
|
should dump representation-specific information. */
|
should dump representation-specific information. */
|
|
|
void
|
void
|
dump_bb (basic_block bb, FILE *outf, int indent)
|
dump_bb (basic_block bb, FILE *outf, int indent)
|
{
|
{
|
edge e;
|
edge e;
|
edge_iterator ei;
|
edge_iterator ei;
|
char *s_indent;
|
char *s_indent;
|
|
|
s_indent = alloca ((size_t) indent + 1);
|
s_indent = alloca ((size_t) indent + 1);
|
memset (s_indent, ' ', (size_t) indent);
|
memset (s_indent, ' ', (size_t) indent);
|
s_indent[indent] = '\0';
|
s_indent[indent] = '\0';
|
|
|
fprintf (outf, ";;%s basic block %d, loop depth %d, count ",
|
fprintf (outf, ";;%s basic block %d, loop depth %d, count ",
|
s_indent, bb->index, bb->loop_depth);
|
s_indent, bb->index, bb->loop_depth);
|
fprintf (outf, HOST_WIDEST_INT_PRINT_DEC, (HOST_WIDEST_INT) bb->count);
|
fprintf (outf, HOST_WIDEST_INT_PRINT_DEC, (HOST_WIDEST_INT) bb->count);
|
putc ('\n', outf);
|
putc ('\n', outf);
|
|
|
fprintf (outf, ";;%s prev block ", s_indent);
|
fprintf (outf, ";;%s prev block ", s_indent);
|
if (bb->prev_bb)
|
if (bb->prev_bb)
|
fprintf (outf, "%d, ", bb->prev_bb->index);
|
fprintf (outf, "%d, ", bb->prev_bb->index);
|
else
|
else
|
fprintf (outf, "(nil), ");
|
fprintf (outf, "(nil), ");
|
fprintf (outf, "next block ");
|
fprintf (outf, "next block ");
|
if (bb->next_bb)
|
if (bb->next_bb)
|
fprintf (outf, "%d", bb->next_bb->index);
|
fprintf (outf, "%d", bb->next_bb->index);
|
else
|
else
|
fprintf (outf, "(nil)");
|
fprintf (outf, "(nil)");
|
putc ('\n', outf);
|
putc ('\n', outf);
|
|
|
fprintf (outf, ";;%s pred: ", s_indent);
|
fprintf (outf, ";;%s pred: ", s_indent);
|
FOR_EACH_EDGE (e, ei, bb->preds)
|
FOR_EACH_EDGE (e, ei, bb->preds)
|
dump_edge_info (outf, e, 0);
|
dump_edge_info (outf, e, 0);
|
putc ('\n', outf);
|
putc ('\n', outf);
|
|
|
fprintf (outf, ";;%s succ: ", s_indent);
|
fprintf (outf, ";;%s succ: ", s_indent);
|
FOR_EACH_EDGE (e, ei, bb->succs)
|
FOR_EACH_EDGE (e, ei, bb->succs)
|
dump_edge_info (outf, e, 1);
|
dump_edge_info (outf, e, 1);
|
putc ('\n', outf);
|
putc ('\n', outf);
|
|
|
if (cfg_hooks->dump_bb)
|
if (cfg_hooks->dump_bb)
|
cfg_hooks->dump_bb (bb, outf, indent);
|
cfg_hooks->dump_bb (bb, outf, indent);
|
}
|
}
|
|
|
/* Redirect edge E to the given basic block DEST and update underlying program
|
/* Redirect edge E to the given basic block DEST and update underlying program
|
representation. Returns edge representing redirected branch (that may not
|
representation. Returns edge representing redirected branch (that may not
|
be equivalent to E in the case of duplicate edges being removed) or NULL
|
be equivalent to E in the case of duplicate edges being removed) or NULL
|
if edge is not easily redirectable for whatever reason. */
|
if edge is not easily redirectable for whatever reason. */
|
|
|
edge
|
edge
|
redirect_edge_and_branch (edge e, basic_block dest)
|
redirect_edge_and_branch (edge e, basic_block dest)
|
{
|
{
|
edge ret;
|
edge ret;
|
|
|
if (!cfg_hooks->redirect_edge_and_branch)
|
if (!cfg_hooks->redirect_edge_and_branch)
|
internal_error ("%s does not support redirect_edge_and_branch",
|
internal_error ("%s does not support redirect_edge_and_branch",
|
cfg_hooks->name);
|
cfg_hooks->name);
|
|
|
ret = cfg_hooks->redirect_edge_and_branch (e, dest);
|
ret = cfg_hooks->redirect_edge_and_branch (e, dest);
|
|
|
return ret;
|
return ret;
|
}
|
}
|
|
|
/* Redirect the edge E to basic block DEST even if it requires creating
|
/* Redirect the edge E to basic block DEST even if it requires creating
|
of a new basic block; then it returns the newly created basic block.
|
of a new basic block; then it returns the newly created basic block.
|
Aborts when redirection is impossible. */
|
Aborts when redirection is impossible. */
|
|
|
basic_block
|
basic_block
|
redirect_edge_and_branch_force (edge e, basic_block dest)
|
redirect_edge_and_branch_force (edge e, basic_block dest)
|
{
|
{
|
basic_block ret;
|
basic_block ret;
|
|
|
if (!cfg_hooks->redirect_edge_and_branch_force)
|
if (!cfg_hooks->redirect_edge_and_branch_force)
|
internal_error ("%s does not support redirect_edge_and_branch_force",
|
internal_error ("%s does not support redirect_edge_and_branch_force",
|
cfg_hooks->name);
|
cfg_hooks->name);
|
|
|
ret = cfg_hooks->redirect_edge_and_branch_force (e, dest);
|
ret = cfg_hooks->redirect_edge_and_branch_force (e, dest);
|
|
|
return ret;
|
return ret;
|
}
|
}
|
|
|
/* Splits basic block BB after the specified instruction I (but at least after
|
/* Splits basic block BB after the specified instruction I (but at least after
|
the labels). If I is NULL, splits just after labels. The newly created edge
|
the labels). If I is NULL, splits just after labels. The newly created edge
|
is returned. The new basic block is created just after the old one. */
|
is returned. The new basic block is created just after the old one. */
|
|
|
edge
|
edge
|
split_block (basic_block bb, void *i)
|
split_block (basic_block bb, void *i)
|
{
|
{
|
basic_block new_bb;
|
basic_block new_bb;
|
|
|
if (!cfg_hooks->split_block)
|
if (!cfg_hooks->split_block)
|
internal_error ("%s does not support split_block", cfg_hooks->name);
|
internal_error ("%s does not support split_block", cfg_hooks->name);
|
|
|
new_bb = cfg_hooks->split_block (bb, i);
|
new_bb = cfg_hooks->split_block (bb, i);
|
if (!new_bb)
|
if (!new_bb)
|
return NULL;
|
return NULL;
|
|
|
new_bb->count = bb->count;
|
new_bb->count = bb->count;
|
new_bb->frequency = bb->frequency;
|
new_bb->frequency = bb->frequency;
|
new_bb->loop_depth = bb->loop_depth;
|
new_bb->loop_depth = bb->loop_depth;
|
|
|
if (dom_info_available_p (CDI_DOMINATORS))
|
if (dom_info_available_p (CDI_DOMINATORS))
|
{
|
{
|
redirect_immediate_dominators (CDI_DOMINATORS, bb, new_bb);
|
redirect_immediate_dominators (CDI_DOMINATORS, bb, new_bb);
|
set_immediate_dominator (CDI_DOMINATORS, new_bb, bb);
|
set_immediate_dominator (CDI_DOMINATORS, new_bb, bb);
|
}
|
}
|
|
|
return make_single_succ_edge (bb, new_bb, EDGE_FALLTHRU);
|
return make_single_succ_edge (bb, new_bb, EDGE_FALLTHRU);
|
}
|
}
|
|
|
/* Splits block BB just after labels. The newly created edge is returned. */
|
/* Splits block BB just after labels. The newly created edge is returned. */
|
|
|
edge
|
edge
|
split_block_after_labels (basic_block bb)
|
split_block_after_labels (basic_block bb)
|
{
|
{
|
return split_block (bb, NULL);
|
return split_block (bb, NULL);
|
}
|
}
|
|
|
/* Moves block BB immediately after block AFTER. Returns false if the
|
/* Moves block BB immediately after block AFTER. Returns false if the
|
movement was impossible. */
|
movement was impossible. */
|
|
|
bool
|
bool
|
move_block_after (basic_block bb, basic_block after)
|
move_block_after (basic_block bb, basic_block after)
|
{
|
{
|
bool ret;
|
bool ret;
|
|
|
if (!cfg_hooks->move_block_after)
|
if (!cfg_hooks->move_block_after)
|
internal_error ("%s does not support move_block_after", cfg_hooks->name);
|
internal_error ("%s does not support move_block_after", cfg_hooks->name);
|
|
|
ret = cfg_hooks->move_block_after (bb, after);
|
ret = cfg_hooks->move_block_after (bb, after);
|
|
|
return ret;
|
return ret;
|
}
|
}
|
|
|
/* Deletes the basic block BB. */
|
/* Deletes the basic block BB. */
|
|
|
void
|
void
|
delete_basic_block (basic_block bb)
|
delete_basic_block (basic_block bb)
|
{
|
{
|
if (!cfg_hooks->delete_basic_block)
|
if (!cfg_hooks->delete_basic_block)
|
internal_error ("%s does not support delete_basic_block", cfg_hooks->name);
|
internal_error ("%s does not support delete_basic_block", cfg_hooks->name);
|
|
|
cfg_hooks->delete_basic_block (bb);
|
cfg_hooks->delete_basic_block (bb);
|
|
|
/* Remove the edges into and out of this block. Note that there may
|
/* Remove the edges into and out of this block. Note that there may
|
indeed be edges in, if we are removing an unreachable loop. */
|
indeed be edges in, if we are removing an unreachable loop. */
|
while (EDGE_COUNT (bb->preds) != 0)
|
while (EDGE_COUNT (bb->preds) != 0)
|
remove_edge (EDGE_PRED (bb, 0));
|
remove_edge (EDGE_PRED (bb, 0));
|
while (EDGE_COUNT (bb->succs) != 0)
|
while (EDGE_COUNT (bb->succs) != 0)
|
remove_edge (EDGE_SUCC (bb, 0));
|
remove_edge (EDGE_SUCC (bb, 0));
|
|
|
if (dom_computed[CDI_DOMINATORS])
|
if (dom_computed[CDI_DOMINATORS])
|
delete_from_dominance_info (CDI_DOMINATORS, bb);
|
delete_from_dominance_info (CDI_DOMINATORS, bb);
|
if (dom_computed[CDI_POST_DOMINATORS])
|
if (dom_computed[CDI_POST_DOMINATORS])
|
delete_from_dominance_info (CDI_POST_DOMINATORS, bb);
|
delete_from_dominance_info (CDI_POST_DOMINATORS, bb);
|
|
|
/* Remove the basic block from the array. */
|
/* Remove the basic block from the array. */
|
expunge_block (bb);
|
expunge_block (bb);
|
}
|
}
|
|
|
/* Splits edge E and returns the newly created basic block. */
|
/* Splits edge E and returns the newly created basic block. */
|
|
|
basic_block
|
basic_block
|
split_edge (edge e)
|
split_edge (edge e)
|
{
|
{
|
basic_block ret;
|
basic_block ret;
|
gcov_type count = e->count;
|
gcov_type count = e->count;
|
int freq = EDGE_FREQUENCY (e);
|
int freq = EDGE_FREQUENCY (e);
|
edge f;
|
edge f;
|
bool irr = (e->flags & EDGE_IRREDUCIBLE_LOOP) != 0;
|
bool irr = (e->flags & EDGE_IRREDUCIBLE_LOOP) != 0;
|
|
|
if (!cfg_hooks->split_edge)
|
if (!cfg_hooks->split_edge)
|
internal_error ("%s does not support split_edge", cfg_hooks->name);
|
internal_error ("%s does not support split_edge", cfg_hooks->name);
|
|
|
ret = cfg_hooks->split_edge (e);
|
ret = cfg_hooks->split_edge (e);
|
ret->count = count;
|
ret->count = count;
|
ret->frequency = freq;
|
ret->frequency = freq;
|
single_succ_edge (ret)->probability = REG_BR_PROB_BASE;
|
single_succ_edge (ret)->probability = REG_BR_PROB_BASE;
|
single_succ_edge (ret)->count = count;
|
single_succ_edge (ret)->count = count;
|
|
|
if (irr)
|
if (irr)
|
{
|
{
|
ret->flags |= BB_IRREDUCIBLE_LOOP;
|
ret->flags |= BB_IRREDUCIBLE_LOOP;
|
single_pred_edge (ret)->flags |= EDGE_IRREDUCIBLE_LOOP;
|
single_pred_edge (ret)->flags |= EDGE_IRREDUCIBLE_LOOP;
|
single_succ_edge (ret)->flags |= EDGE_IRREDUCIBLE_LOOP;
|
single_succ_edge (ret)->flags |= EDGE_IRREDUCIBLE_LOOP;
|
}
|
}
|
|
|
if (dom_computed[CDI_DOMINATORS])
|
if (dom_computed[CDI_DOMINATORS])
|
set_immediate_dominator (CDI_DOMINATORS, ret, single_pred (ret));
|
set_immediate_dominator (CDI_DOMINATORS, ret, single_pred (ret));
|
|
|
if (dom_computed[CDI_DOMINATORS] >= DOM_NO_FAST_QUERY)
|
if (dom_computed[CDI_DOMINATORS] >= DOM_NO_FAST_QUERY)
|
{
|
{
|
/* There are two cases:
|
/* There are two cases:
|
|
|
If the immediate dominator of e->dest is not e->src, it
|
If the immediate dominator of e->dest is not e->src, it
|
remains unchanged.
|
remains unchanged.
|
|
|
If immediate dominator of e->dest is e->src, it may become
|
If immediate dominator of e->dest is e->src, it may become
|
ret, provided that all other predecessors of e->dest are
|
ret, provided that all other predecessors of e->dest are
|
dominated by e->dest. */
|
dominated by e->dest. */
|
|
|
if (get_immediate_dominator (CDI_DOMINATORS, single_succ (ret))
|
if (get_immediate_dominator (CDI_DOMINATORS, single_succ (ret))
|
== single_pred (ret))
|
== single_pred (ret))
|
{
|
{
|
edge_iterator ei;
|
edge_iterator ei;
|
FOR_EACH_EDGE (f, ei, single_succ (ret)->preds)
|
FOR_EACH_EDGE (f, ei, single_succ (ret)->preds)
|
{
|
{
|
if (f == single_succ_edge (ret))
|
if (f == single_succ_edge (ret))
|
continue;
|
continue;
|
|
|
if (!dominated_by_p (CDI_DOMINATORS, f->src,
|
if (!dominated_by_p (CDI_DOMINATORS, f->src,
|
single_succ (ret)))
|
single_succ (ret)))
|
break;
|
break;
|
}
|
}
|
|
|
if (!f)
|
if (!f)
|
set_immediate_dominator (CDI_DOMINATORS, single_succ (ret), ret);
|
set_immediate_dominator (CDI_DOMINATORS, single_succ (ret), ret);
|
}
|
}
|
};
|
};
|
|
|
return ret;
|
return ret;
|
}
|
}
|
|
|
/* Creates a new basic block just after the basic block AFTER.
|
/* Creates a new basic block just after the basic block AFTER.
|
HEAD and END are the first and the last statement belonging
|
HEAD and END are the first and the last statement belonging
|
to the block. If both are NULL, an empty block is created. */
|
to the block. If both are NULL, an empty block is created. */
|
|
|
basic_block
|
basic_block
|
create_basic_block (void *head, void *end, basic_block after)
|
create_basic_block (void *head, void *end, basic_block after)
|
{
|
{
|
basic_block ret;
|
basic_block ret;
|
|
|
if (!cfg_hooks->create_basic_block)
|
if (!cfg_hooks->create_basic_block)
|
internal_error ("%s does not support create_basic_block", cfg_hooks->name);
|
internal_error ("%s does not support create_basic_block", cfg_hooks->name);
|
|
|
ret = cfg_hooks->create_basic_block (head, end, after);
|
ret = cfg_hooks->create_basic_block (head, end, after);
|
|
|
if (dom_computed[CDI_DOMINATORS])
|
if (dom_computed[CDI_DOMINATORS])
|
add_to_dominance_info (CDI_DOMINATORS, ret);
|
add_to_dominance_info (CDI_DOMINATORS, ret);
|
if (dom_computed[CDI_POST_DOMINATORS])
|
if (dom_computed[CDI_POST_DOMINATORS])
|
add_to_dominance_info (CDI_POST_DOMINATORS, ret);
|
add_to_dominance_info (CDI_POST_DOMINATORS, ret);
|
|
|
return ret;
|
return ret;
|
}
|
}
|
|
|
/* Creates an empty basic block just after basic block AFTER. */
|
/* Creates an empty basic block just after basic block AFTER. */
|
|
|
basic_block
|
basic_block
|
create_empty_bb (basic_block after)
|
create_empty_bb (basic_block after)
|
{
|
{
|
return create_basic_block (NULL, NULL, after);
|
return create_basic_block (NULL, NULL, after);
|
}
|
}
|
|
|
/* Checks whether we may merge blocks BB1 and BB2. */
|
/* Checks whether we may merge blocks BB1 and BB2. */
|
|
|
bool
|
bool
|
can_merge_blocks_p (basic_block bb1, basic_block bb2)
|
can_merge_blocks_p (basic_block bb1, basic_block bb2)
|
{
|
{
|
bool ret;
|
bool ret;
|
|
|
if (!cfg_hooks->can_merge_blocks_p)
|
if (!cfg_hooks->can_merge_blocks_p)
|
internal_error ("%s does not support can_merge_blocks_p", cfg_hooks->name);
|
internal_error ("%s does not support can_merge_blocks_p", cfg_hooks->name);
|
|
|
ret = cfg_hooks->can_merge_blocks_p (bb1, bb2);
|
ret = cfg_hooks->can_merge_blocks_p (bb1, bb2);
|
|
|
return ret;
|
return ret;
|
}
|
}
|
|
|
void
|
void
|
predict_edge (edge e, enum br_predictor predictor, int probability)
|
predict_edge (edge e, enum br_predictor predictor, int probability)
|
{
|
{
|
if (!cfg_hooks->predict_edge)
|
if (!cfg_hooks->predict_edge)
|
internal_error ("%s does not support predict_edge", cfg_hooks->name);
|
internal_error ("%s does not support predict_edge", cfg_hooks->name);
|
|
|
cfg_hooks->predict_edge (e, predictor, probability);
|
cfg_hooks->predict_edge (e, predictor, probability);
|
}
|
}
|
|
|
bool
|
bool
|
predicted_by_p (basic_block bb, enum br_predictor predictor)
|
predicted_by_p (basic_block bb, enum br_predictor predictor)
|
{
|
{
|
if (!cfg_hooks->predict_edge)
|
if (!cfg_hooks->predict_edge)
|
internal_error ("%s does not support predicted_by_p", cfg_hooks->name);
|
internal_error ("%s does not support predicted_by_p", cfg_hooks->name);
|
|
|
return cfg_hooks->predicted_by_p (bb, predictor);
|
return cfg_hooks->predicted_by_p (bb, predictor);
|
}
|
}
|
|
|
/* Merges basic block B into basic block A. */
|
/* Merges basic block B into basic block A. */
|
|
|
void
|
void
|
merge_blocks (basic_block a, basic_block b)
|
merge_blocks (basic_block a, basic_block b)
|
{
|
{
|
edge e;
|
edge e;
|
edge_iterator ei;
|
edge_iterator ei;
|
|
|
if (!cfg_hooks->merge_blocks)
|
if (!cfg_hooks->merge_blocks)
|
internal_error ("%s does not support merge_blocks", cfg_hooks->name);
|
internal_error ("%s does not support merge_blocks", cfg_hooks->name);
|
|
|
cfg_hooks->merge_blocks (a, b);
|
cfg_hooks->merge_blocks (a, b);
|
|
|
/* Normally there should only be one successor of A and that is B, but
|
/* Normally there should only be one successor of A and that is B, but
|
partway though the merge of blocks for conditional_execution we'll
|
partway though the merge of blocks for conditional_execution we'll
|
be merging a TEST block with THEN and ELSE successors. Free the
|
be merging a TEST block with THEN and ELSE successors. Free the
|
whole lot of them and hope the caller knows what they're doing. */
|
whole lot of them and hope the caller knows what they're doing. */
|
|
|
while (EDGE_COUNT (a->succs) != 0)
|
while (EDGE_COUNT (a->succs) != 0)
|
remove_edge (EDGE_SUCC (a, 0));
|
remove_edge (EDGE_SUCC (a, 0));
|
|
|
/* Adjust the edges out of B for the new owner. */
|
/* Adjust the edges out of B for the new owner. */
|
FOR_EACH_EDGE (e, ei, b->succs)
|
FOR_EACH_EDGE (e, ei, b->succs)
|
e->src = a;
|
e->src = a;
|
a->succs = b->succs;
|
a->succs = b->succs;
|
a->flags |= b->flags;
|
a->flags |= b->flags;
|
|
|
/* B hasn't quite yet ceased to exist. Attempt to prevent mishap. */
|
/* B hasn't quite yet ceased to exist. Attempt to prevent mishap. */
|
b->preds = b->succs = NULL;
|
b->preds = b->succs = NULL;
|
|
|
if (dom_computed[CDI_DOMINATORS])
|
if (dom_computed[CDI_DOMINATORS])
|
redirect_immediate_dominators (CDI_DOMINATORS, b, a);
|
redirect_immediate_dominators (CDI_DOMINATORS, b, a);
|
|
|
if (dom_computed[CDI_DOMINATORS])
|
if (dom_computed[CDI_DOMINATORS])
|
delete_from_dominance_info (CDI_DOMINATORS, b);
|
delete_from_dominance_info (CDI_DOMINATORS, b);
|
if (dom_computed[CDI_POST_DOMINATORS])
|
if (dom_computed[CDI_POST_DOMINATORS])
|
delete_from_dominance_info (CDI_POST_DOMINATORS, b);
|
delete_from_dominance_info (CDI_POST_DOMINATORS, b);
|
|
|
expunge_block (b);
|
expunge_block (b);
|
}
|
}
|
|
|
/* Split BB into entry part and the rest (the rest is the newly created block).
|
/* Split BB into entry part and the rest (the rest is the newly created block).
|
Redirect those edges for that REDIRECT_EDGE_P returns true to the entry
|
Redirect those edges for that REDIRECT_EDGE_P returns true to the entry
|
part. Returns the edge connecting the entry part to the rest. */
|
part. Returns the edge connecting the entry part to the rest. */
|
|
|
edge
|
edge
|
make_forwarder_block (basic_block bb, bool (*redirect_edge_p) (edge),
|
make_forwarder_block (basic_block bb, bool (*redirect_edge_p) (edge),
|
void (*new_bb_cbk) (basic_block))
|
void (*new_bb_cbk) (basic_block))
|
{
|
{
|
edge e, fallthru;
|
edge e, fallthru;
|
edge_iterator ei;
|
edge_iterator ei;
|
basic_block dummy, jump;
|
basic_block dummy, jump;
|
|
|
if (!cfg_hooks->make_forwarder_block)
|
if (!cfg_hooks->make_forwarder_block)
|
internal_error ("%s does not support make_forwarder_block",
|
internal_error ("%s does not support make_forwarder_block",
|
cfg_hooks->name);
|
cfg_hooks->name);
|
|
|
fallthru = split_block_after_labels (bb);
|
fallthru = split_block_after_labels (bb);
|
dummy = fallthru->src;
|
dummy = fallthru->src;
|
bb = fallthru->dest;
|
bb = fallthru->dest;
|
|
|
/* Redirect back edges we want to keep. */
|
/* Redirect back edges we want to keep. */
|
for (ei = ei_start (dummy->preds); (e = ei_safe_edge (ei)); )
|
for (ei = ei_start (dummy->preds); (e = ei_safe_edge (ei)); )
|
{
|
{
|
if (redirect_edge_p (e))
|
if (redirect_edge_p (e))
|
{
|
{
|
ei_next (&ei);
|
ei_next (&ei);
|
continue;
|
continue;
|
}
|
}
|
|
|
dummy->frequency -= EDGE_FREQUENCY (e);
|
dummy->frequency -= EDGE_FREQUENCY (e);
|
dummy->count -= e->count;
|
dummy->count -= e->count;
|
if (dummy->frequency < 0)
|
if (dummy->frequency < 0)
|
dummy->frequency = 0;
|
dummy->frequency = 0;
|
if (dummy->count < 0)
|
if (dummy->count < 0)
|
dummy->count = 0;
|
dummy->count = 0;
|
fallthru->count -= e->count;
|
fallthru->count -= e->count;
|
if (fallthru->count < 0)
|
if (fallthru->count < 0)
|
fallthru->count = 0;
|
fallthru->count = 0;
|
|
|
jump = redirect_edge_and_branch_force (e, bb);
|
jump = redirect_edge_and_branch_force (e, bb);
|
if (jump)
|
if (jump)
|
new_bb_cbk (jump);
|
new_bb_cbk (jump);
|
}
|
}
|
|
|
if (dom_info_available_p (CDI_DOMINATORS))
|
if (dom_info_available_p (CDI_DOMINATORS))
|
{
|
{
|
basic_block doms_to_fix[2];
|
basic_block doms_to_fix[2];
|
|
|
doms_to_fix[0] = dummy;
|
doms_to_fix[0] = dummy;
|
doms_to_fix[1] = bb;
|
doms_to_fix[1] = bb;
|
iterate_fix_dominators (CDI_DOMINATORS, doms_to_fix, 2);
|
iterate_fix_dominators (CDI_DOMINATORS, doms_to_fix, 2);
|
}
|
}
|
|
|
cfg_hooks->make_forwarder_block (fallthru);
|
cfg_hooks->make_forwarder_block (fallthru);
|
|
|
return fallthru;
|
return fallthru;
|
}
|
}
|
|
|
void
|
void
|
tidy_fallthru_edge (edge e)
|
tidy_fallthru_edge (edge e)
|
{
|
{
|
if (cfg_hooks->tidy_fallthru_edge)
|
if (cfg_hooks->tidy_fallthru_edge)
|
cfg_hooks->tidy_fallthru_edge (e);
|
cfg_hooks->tidy_fallthru_edge (e);
|
}
|
}
|
|
|
/* Fix up edges that now fall through, or rather should now fall through
|
/* Fix up edges that now fall through, or rather should now fall through
|
but previously required a jump around now deleted blocks. Simplify
|
but previously required a jump around now deleted blocks. Simplify
|
the search by only examining blocks numerically adjacent, since this
|
the search by only examining blocks numerically adjacent, since this
|
is how find_basic_blocks created them. */
|
is how find_basic_blocks created them. */
|
|
|
void
|
void
|
tidy_fallthru_edges (void)
|
tidy_fallthru_edges (void)
|
{
|
{
|
basic_block b, c;
|
basic_block b, c;
|
|
|
if (!cfg_hooks->tidy_fallthru_edge)
|
if (!cfg_hooks->tidy_fallthru_edge)
|
return;
|
return;
|
|
|
if (ENTRY_BLOCK_PTR->next_bb == EXIT_BLOCK_PTR)
|
if (ENTRY_BLOCK_PTR->next_bb == EXIT_BLOCK_PTR)
|
return;
|
return;
|
|
|
FOR_BB_BETWEEN (b, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR->prev_bb, next_bb)
|
FOR_BB_BETWEEN (b, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR->prev_bb, next_bb)
|
{
|
{
|
edge s;
|
edge s;
|
|
|
c = b->next_bb;
|
c = b->next_bb;
|
|
|
/* We care about simple conditional or unconditional jumps with
|
/* We care about simple conditional or unconditional jumps with
|
a single successor.
|
a single successor.
|
|
|
If we had a conditional branch to the next instruction when
|
If we had a conditional branch to the next instruction when
|
find_basic_blocks was called, then there will only be one
|
find_basic_blocks was called, then there will only be one
|
out edge for the block which ended with the conditional
|
out edge for the block which ended with the conditional
|
branch (since we do not create duplicate edges).
|
branch (since we do not create duplicate edges).
|
|
|
Furthermore, the edge will be marked as a fallthru because we
|
Furthermore, the edge will be marked as a fallthru because we
|
merge the flags for the duplicate edges. So we do not want to
|
merge the flags for the duplicate edges. So we do not want to
|
check that the edge is not a FALLTHRU edge. */
|
check that the edge is not a FALLTHRU edge. */
|
|
|
if (single_succ_p (b))
|
if (single_succ_p (b))
|
{
|
{
|
s = single_succ_edge (b);
|
s = single_succ_edge (b);
|
if (! (s->flags & EDGE_COMPLEX)
|
if (! (s->flags & EDGE_COMPLEX)
|
&& s->dest == c
|
&& s->dest == c
|
&& !find_reg_note (BB_END (b), REG_CROSSING_JUMP, NULL_RTX))
|
&& !find_reg_note (BB_END (b), REG_CROSSING_JUMP, NULL_RTX))
|
tidy_fallthru_edge (s);
|
tidy_fallthru_edge (s);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* Returns true if we can duplicate basic block BB. */
|
/* Returns true if we can duplicate basic block BB. */
|
|
|
bool
|
bool
|
can_duplicate_block_p (basic_block bb)
|
can_duplicate_block_p (basic_block bb)
|
{
|
{
|
edge e;
|
edge e;
|
|
|
if (!cfg_hooks->can_duplicate_block_p)
|
if (!cfg_hooks->can_duplicate_block_p)
|
internal_error ("%s does not support can_duplicate_block_p",
|
internal_error ("%s does not support can_duplicate_block_p",
|
cfg_hooks->name);
|
cfg_hooks->name);
|
|
|
if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR)
|
if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR)
|
return false;
|
return false;
|
|
|
/* Duplicating fallthru block to exit would require adding a jump
|
/* Duplicating fallthru block to exit would require adding a jump
|
and splitting the real last BB. */
|
and splitting the real last BB. */
|
e = find_edge (bb, EXIT_BLOCK_PTR);
|
e = find_edge (bb, EXIT_BLOCK_PTR);
|
if (e && (e->flags & EDGE_FALLTHRU))
|
if (e && (e->flags & EDGE_FALLTHRU))
|
return false;
|
return false;
|
|
|
return cfg_hooks->can_duplicate_block_p (bb);
|
return cfg_hooks->can_duplicate_block_p (bb);
|
}
|
}
|
|
|
/* Duplicates basic block BB and redirects edge E to it. Returns the
|
/* Duplicates basic block BB and redirects edge E to it. Returns the
|
new basic block. The new basic block is placed after the basic block
|
new basic block. The new basic block is placed after the basic block
|
AFTER. */
|
AFTER. */
|
|
|
basic_block
|
basic_block
|
duplicate_block (basic_block bb, edge e, basic_block after)
|
duplicate_block (basic_block bb, edge e, basic_block after)
|
{
|
{
|
edge s, n;
|
edge s, n;
|
basic_block new_bb;
|
basic_block new_bb;
|
gcov_type new_count = e ? e->count : 0;
|
gcov_type new_count = e ? e->count : 0;
|
edge_iterator ei;
|
edge_iterator ei;
|
|
|
if (!cfg_hooks->duplicate_block)
|
if (!cfg_hooks->duplicate_block)
|
internal_error ("%s does not support duplicate_block",
|
internal_error ("%s does not support duplicate_block",
|
cfg_hooks->name);
|
cfg_hooks->name);
|
|
|
if (bb->count < new_count)
|
if (bb->count < new_count)
|
new_count = bb->count;
|
new_count = bb->count;
|
|
|
#ifdef ENABLE_CHECKING
|
#ifdef ENABLE_CHECKING
|
gcc_assert (can_duplicate_block_p (bb));
|
gcc_assert (can_duplicate_block_p (bb));
|
#endif
|
#endif
|
|
|
new_bb = cfg_hooks->duplicate_block (bb);
|
new_bb = cfg_hooks->duplicate_block (bb);
|
if (after)
|
if (after)
|
move_block_after (new_bb, after);
|
move_block_after (new_bb, after);
|
|
|
new_bb->loop_depth = bb->loop_depth;
|
new_bb->loop_depth = bb->loop_depth;
|
new_bb->flags = bb->flags;
|
new_bb->flags = bb->flags;
|
FOR_EACH_EDGE (s, ei, bb->succs)
|
FOR_EACH_EDGE (s, ei, bb->succs)
|
{
|
{
|
/* Since we are creating edges from a new block to successors
|
/* Since we are creating edges from a new block to successors
|
of another block (which therefore are known to be disjoint), there
|
of another block (which therefore are known to be disjoint), there
|
is no need to actually check for duplicated edges. */
|
is no need to actually check for duplicated edges. */
|
n = unchecked_make_edge (new_bb, s->dest, s->flags);
|
n = unchecked_make_edge (new_bb, s->dest, s->flags);
|
n->probability = s->probability;
|
n->probability = s->probability;
|
if (e && bb->count)
|
if (e && bb->count)
|
{
|
{
|
/* Take care for overflows! */
|
/* Take care for overflows! */
|
n->count = s->count * (new_count * 10000 / bb->count) / 10000;
|
n->count = s->count * (new_count * 10000 / bb->count) / 10000;
|
s->count -= n->count;
|
s->count -= n->count;
|
}
|
}
|
else
|
else
|
n->count = s->count;
|
n->count = s->count;
|
n->aux = s->aux;
|
n->aux = s->aux;
|
}
|
}
|
|
|
if (e)
|
if (e)
|
{
|
{
|
new_bb->count = new_count;
|
new_bb->count = new_count;
|
bb->count -= new_count;
|
bb->count -= new_count;
|
|
|
new_bb->frequency = EDGE_FREQUENCY (e);
|
new_bb->frequency = EDGE_FREQUENCY (e);
|
bb->frequency -= EDGE_FREQUENCY (e);
|
bb->frequency -= EDGE_FREQUENCY (e);
|
|
|
redirect_edge_and_branch_force (e, new_bb);
|
redirect_edge_and_branch_force (e, new_bb);
|
|
|
if (bb->count < 0)
|
if (bb->count < 0)
|
bb->count = 0;
|
bb->count = 0;
|
if (bb->frequency < 0)
|
if (bb->frequency < 0)
|
bb->frequency = 0;
|
bb->frequency = 0;
|
}
|
}
|
else
|
else
|
{
|
{
|
new_bb->count = bb->count;
|
new_bb->count = bb->count;
|
new_bb->frequency = bb->frequency;
|
new_bb->frequency = bb->frequency;
|
}
|
}
|
|
|
set_bb_original (new_bb, bb);
|
set_bb_original (new_bb, bb);
|
set_bb_copy (bb, new_bb);
|
set_bb_copy (bb, new_bb);
|
|
|
return new_bb;
|
return new_bb;
|
}
|
}
|
|
|
/* Return 1 if BB ends with a call, possibly followed by some
|
/* Return 1 if BB ends with a call, possibly followed by some
|
instructions that must stay with the call, 0 otherwise. */
|
instructions that must stay with the call, 0 otherwise. */
|
|
|
bool
|
bool
|
block_ends_with_call_p (basic_block bb)
|
block_ends_with_call_p (basic_block bb)
|
{
|
{
|
if (!cfg_hooks->block_ends_with_call_p)
|
if (!cfg_hooks->block_ends_with_call_p)
|
internal_error ("%s does not support block_ends_with_call_p", cfg_hooks->name);
|
internal_error ("%s does not support block_ends_with_call_p", cfg_hooks->name);
|
|
|
return (cfg_hooks->block_ends_with_call_p) (bb);
|
return (cfg_hooks->block_ends_with_call_p) (bb);
|
}
|
}
|
|
|
/* Return 1 if BB ends with a conditional branch, 0 otherwise. */
|
/* Return 1 if BB ends with a conditional branch, 0 otherwise. */
|
|
|
bool
|
bool
|
block_ends_with_condjump_p (basic_block bb)
|
block_ends_with_condjump_p (basic_block bb)
|
{
|
{
|
if (!cfg_hooks->block_ends_with_condjump_p)
|
if (!cfg_hooks->block_ends_with_condjump_p)
|
internal_error ("%s does not support block_ends_with_condjump_p",
|
internal_error ("%s does not support block_ends_with_condjump_p",
|
cfg_hooks->name);
|
cfg_hooks->name);
|
|
|
return (cfg_hooks->block_ends_with_condjump_p) (bb);
|
return (cfg_hooks->block_ends_with_condjump_p) (bb);
|
}
|
}
|
|
|
/* Add fake edges to the function exit for any non constant and non noreturn
|
/* Add fake edges to the function exit for any non constant and non noreturn
|
calls, volatile inline assembly in the bitmap of blocks specified by
|
calls, volatile inline assembly in the bitmap of blocks specified by
|
BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks
|
BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks
|
that were split.
|
that were split.
|
|
|
The goal is to expose cases in which entering a basic block does not imply
|
The goal is to expose cases in which entering a basic block does not imply
|
that all subsequent instructions must be executed. */
|
that all subsequent instructions must be executed. */
|
|
|
int
|
int
|
flow_call_edges_add (sbitmap blocks)
|
flow_call_edges_add (sbitmap blocks)
|
{
|
{
|
if (!cfg_hooks->flow_call_edges_add)
|
if (!cfg_hooks->flow_call_edges_add)
|
internal_error ("%s does not support flow_call_edges_add",
|
internal_error ("%s does not support flow_call_edges_add",
|
cfg_hooks->name);
|
cfg_hooks->name);
|
|
|
return (cfg_hooks->flow_call_edges_add) (blocks);
|
return (cfg_hooks->flow_call_edges_add) (blocks);
|
}
|
}
|
|
|
/* This function is called immediately after edge E is added to the
|
/* This function is called immediately after edge E is added to the
|
edge vector E->dest->preds. */
|
edge vector E->dest->preds. */
|
|
|
void
|
void
|
execute_on_growing_pred (edge e)
|
execute_on_growing_pred (edge e)
|
{
|
{
|
if (cfg_hooks->execute_on_growing_pred)
|
if (cfg_hooks->execute_on_growing_pred)
|
cfg_hooks->execute_on_growing_pred (e);
|
cfg_hooks->execute_on_growing_pred (e);
|
}
|
}
|
|
|
/* This function is called immediately before edge E is removed from
|
/* This function is called immediately before edge E is removed from
|
the edge vector E->dest->preds. */
|
the edge vector E->dest->preds. */
|
|
|
void
|
void
|
execute_on_shrinking_pred (edge e)
|
execute_on_shrinking_pred (edge e)
|
{
|
{
|
if (cfg_hooks->execute_on_shrinking_pred)
|
if (cfg_hooks->execute_on_shrinking_pred)
|
cfg_hooks->execute_on_shrinking_pred (e);
|
cfg_hooks->execute_on_shrinking_pred (e);
|
}
|
}
|
|
|
/* This is used inside loop versioning when we want to insert
|
/* This is used inside loop versioning when we want to insert
|
stmts/insns on the edges, which have a different behavior
|
stmts/insns on the edges, which have a different behavior
|
in tree's and in RTL, so we made a CFG hook. */
|
in tree's and in RTL, so we made a CFG hook. */
|
void
|
void
|
lv_flush_pending_stmts (edge e)
|
lv_flush_pending_stmts (edge e)
|
{
|
{
|
if (cfg_hooks->flush_pending_stmts)
|
if (cfg_hooks->flush_pending_stmts)
|
cfg_hooks->flush_pending_stmts (e);
|
cfg_hooks->flush_pending_stmts (e);
|
}
|
}
|
|
|
/* Loop versioning uses the duplicate_loop_to_header_edge to create
|
/* Loop versioning uses the duplicate_loop_to_header_edge to create
|
a new version of the loop basic-blocks, the parameters here are
|
a new version of the loop basic-blocks, the parameters here are
|
exactly the same as in duplicate_loop_to_header_edge or
|
exactly the same as in duplicate_loop_to_header_edge or
|
tree_duplicate_loop_to_header_edge; while in tree-ssa there is
|
tree_duplicate_loop_to_header_edge; while in tree-ssa there is
|
additional work to maintain ssa information that's why there is
|
additional work to maintain ssa information that's why there is
|
a need to call the tree_duplicate_loop_to_header_edge rather
|
a need to call the tree_duplicate_loop_to_header_edge rather
|
than duplicate_loop_to_header_edge when we are in tree mode. */
|
than duplicate_loop_to_header_edge when we are in tree mode. */
|
bool
|
bool
|
cfg_hook_duplicate_loop_to_header_edge (struct loop *loop, edge e,
|
cfg_hook_duplicate_loop_to_header_edge (struct loop *loop, edge e,
|
struct loops *loops, unsigned int ndupl,
|
struct loops *loops, unsigned int ndupl,
|
sbitmap wont_exit, edge orig,
|
sbitmap wont_exit, edge orig,
|
edge *to_remove,
|
edge *to_remove,
|
unsigned int *n_to_remove, int flags)
|
unsigned int *n_to_remove, int flags)
|
{
|
{
|
gcc_assert (cfg_hooks->cfg_hook_duplicate_loop_to_header_edge);
|
gcc_assert (cfg_hooks->cfg_hook_duplicate_loop_to_header_edge);
|
return cfg_hooks->cfg_hook_duplicate_loop_to_header_edge (loop, e, loops,
|
return cfg_hooks->cfg_hook_duplicate_loop_to_header_edge (loop, e, loops,
|
ndupl, wont_exit,
|
ndupl, wont_exit,
|
orig, to_remove,
|
orig, to_remove,
|
n_to_remove, flags);
|
n_to_remove, flags);
|
}
|
}
|
|
|
/* Conditional jumps are represented differently in trees and RTL,
|
/* Conditional jumps are represented differently in trees and RTL,
|
this hook takes a basic block that is known to have a cond jump
|
this hook takes a basic block that is known to have a cond jump
|
at its end and extracts the taken and not taken eges out of it
|
at its end and extracts the taken and not taken eges out of it
|
and store it in E1 and E2 respectively. */
|
and store it in E1 and E2 respectively. */
|
void
|
void
|
extract_cond_bb_edges (basic_block b, edge *e1, edge *e2)
|
extract_cond_bb_edges (basic_block b, edge *e1, edge *e2)
|
{
|
{
|
gcc_assert (cfg_hooks->extract_cond_bb_edges);
|
gcc_assert (cfg_hooks->extract_cond_bb_edges);
|
cfg_hooks->extract_cond_bb_edges (b, e1, e2);
|
cfg_hooks->extract_cond_bb_edges (b, e1, e2);
|
}
|
}
|
|
|
/* Responsible for updating the ssa info (PHI nodes) on the
|
/* Responsible for updating the ssa info (PHI nodes) on the
|
new condition basic block that guards the versioned loop. */
|
new condition basic block that guards the versioned loop. */
|
void
|
void
|
lv_adjust_loop_header_phi (basic_block first, basic_block second,
|
lv_adjust_loop_header_phi (basic_block first, basic_block second,
|
basic_block new, edge e)
|
basic_block new, edge e)
|
{
|
{
|
if (cfg_hooks->lv_adjust_loop_header_phi)
|
if (cfg_hooks->lv_adjust_loop_header_phi)
|
cfg_hooks->lv_adjust_loop_header_phi (first, second, new, e);
|
cfg_hooks->lv_adjust_loop_header_phi (first, second, new, e);
|
}
|
}
|
|
|
/* Conditions in trees and RTL are different so we need
|
/* Conditions in trees and RTL are different so we need
|
a different handling when we add the condition to the
|
a different handling when we add the condition to the
|
versioning code. */
|
versioning code. */
|
void
|
void
|
lv_add_condition_to_bb (basic_block first, basic_block second,
|
lv_add_condition_to_bb (basic_block first, basic_block second,
|
basic_block new, void *cond)
|
basic_block new, void *cond)
|
{
|
{
|
gcc_assert (cfg_hooks->lv_add_condition_to_bb);
|
gcc_assert (cfg_hooks->lv_add_condition_to_bb);
|
cfg_hooks->lv_add_condition_to_bb (first, second, new, cond);
|
cfg_hooks->lv_add_condition_to_bb (first, second, new, cond);
|
}
|
}
|
|
|
