/* Control flow graph manipulation code for GNU compiler.
Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
- 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
+ 1999, 2000, 2001, 2002, 2003, 2004, 2005
+ Free Software Foundation, Inc.
This file is part of GCC.
02111-1307, USA. */
/* This file contains low level functions to manipulate the CFG and
- analyze it. All other modules should not transform the datastructure
+ analyze it. All other modules should not transform the data structure
directly and use abstraction instead. The file is supposed to be
ordered bottom-up and should not contain any code dependent on a
particular intermediate language (RTL or trees).
- Allocation of AUX fields for basic blocks
alloc_aux_for_blocks, free_aux_for_blocks, alloc_aux_for_block
- clear_bb_flags
+ - Consistency checking
+ verify_flow_info
+ - Dumping and debugging
+ print_rtl_with_bb, dump_bb, debug_bb, debug_bb_n
*/
\f
#include "config.h"
#include "tree.h"
#include "rtl.h"
#include "hard-reg-set.h"
-#include "basic-block.h"
#include "regs.h"
#include "flags.h"
#include "output.h"
#include "except.h"
#include "toplev.h"
#include "tm_p.h"
-#include "obstack.h"
#include "alloc-pool.h"
+#include "timevar.h"
+#include "ggc.h"
/* The obstack on which the flow graph components are allocated. */
-struct obstack flow_obstack;
-static char *flow_firstobj;
-
-/* Basic block object pool. */
-
-static alloc_pool bb_pool;
-
-/* Edge object pool. */
-
-static alloc_pool edge_pool;
+struct bitmap_obstack reg_obstack;
/* Number of basic blocks in the current function. */
varray_type basic_block_info;
/* The special entry and exit blocks. */
+basic_block ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR;
+
+/* Memory alloc pool for bb member rbi. */
+static alloc_pool rbi_pool;
+
+void debug_flow_info (void);
+static void free_edge (edge);
-struct basic_block_def entry_exit_blocks[2]
-= {{NULL, /* head */
- NULL, /* end */
- NULL, /* head_tree */
- NULL, /* end_tree */
- NULL, /* pred */
- NULL, /* succ */
- NULL, /* local_set */
- NULL, /* cond_local_set */
- NULL, /* global_live_at_start */
- NULL, /* global_live_at_end */
- NULL, /* aux */
- ENTRY_BLOCK, /* index */
- NULL, /* prev_bb */
- EXIT_BLOCK_PTR, /* next_bb */
- 0, /* loop_depth */
- NULL, /* loop_father */
- 0, /* count */
- 0, /* frequency */
- 0 /* flags */
- },
- {
- NULL, /* head */
- NULL, /* end */
- NULL, /* head_tree */
- NULL, /* end_tree */
- NULL, /* pred */
- NULL, /* succ */
- NULL, /* local_set */
- NULL, /* cond_local_set */
- NULL, /* global_live_at_start */
- NULL, /* global_live_at_end */
- NULL, /* aux */
- EXIT_BLOCK, /* index */
- ENTRY_BLOCK_PTR, /* prev_bb */
- NULL, /* next_bb */
- 0, /* loop_depth */
- NULL, /* loop_father */
- 0, /* count */
- 0, /* frequency */
- 0 /* flags */
- }
-};
-
-void debug_flow_info PARAMS ((void));
-static void free_edge PARAMS ((edge));
+/* Indicate the presence of the profile. */
+enum profile_status profile_status;
\f
/* Called once at initialization time. */
void
-init_flow ()
+init_flow (void)
{
- static int initialized;
-
n_edges = 0;
- if (!initialized)
- {
- gcc_obstack_init (&flow_obstack);
- flow_firstobj = (char *) obstack_alloc (&flow_obstack, 0);
- initialized = 1;
- }
- else
- {
- free_alloc_pool (bb_pool);
- free_alloc_pool (edge_pool);
- obstack_free (&flow_obstack, flow_firstobj);
- flow_firstobj = (char *) obstack_alloc (&flow_obstack, 0);
- }
- bb_pool = create_alloc_pool ("Basic block pool",
- sizeof (struct basic_block_def), 100);
- edge_pool = create_alloc_pool ("Edge pool",
- sizeof (struct edge_def), 100);
+ ENTRY_BLOCK_PTR = ggc_alloc_cleared (sizeof (*ENTRY_BLOCK_PTR));
+ ENTRY_BLOCK_PTR->index = ENTRY_BLOCK;
+ EXIT_BLOCK_PTR = ggc_alloc_cleared (sizeof (*EXIT_BLOCK_PTR));
+ EXIT_BLOCK_PTR->index = EXIT_BLOCK;
+ ENTRY_BLOCK_PTR->next_bb = EXIT_BLOCK_PTR;
+ EXIT_BLOCK_PTR->prev_bb = ENTRY_BLOCK_PTR;
}
\f
/* Helper function for remove_edge and clear_edges. Frees edge structure
without actually unlinking it from the pred/succ lists. */
static void
-free_edge (e)
- edge e;
+free_edge (edge e ATTRIBUTE_UNUSED)
{
n_edges--;
- pool_free (edge_pool, e);
+ ggc_free (e);
}
/* Free the memory associated with the edge structures. */
void
-clear_edges ()
+clear_edges (void)
{
basic_block bb;
edge e;
+ edge_iterator ei;
FOR_EACH_BB (bb)
{
- edge e = bb->succ;
-
- while (e)
- {
- edge next = e->succ_next;
-
- free_edge (e);
- e = next;
- }
-
- bb->succ = NULL;
- bb->pred = NULL;
- }
-
- e = ENTRY_BLOCK_PTR->succ;
- while (e)
- {
- edge next = e->succ_next;
-
- free_edge (e);
- e = next;
+ FOR_EACH_EDGE (e, ei, bb->succs)
+ free_edge (e);
+ VEC_truncate (edge, bb->succs, 0);
+ VEC_truncate (edge, bb->preds, 0);
}
- EXIT_BLOCK_PTR->pred = NULL;
- ENTRY_BLOCK_PTR->succ = NULL;
+ FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
+ free_edge (e);
+ VEC_truncate (edge, EXIT_BLOCK_PTR->preds, 0);
+ VEC_truncate (edge, ENTRY_BLOCK_PTR->succs, 0);
- if (n_edges)
- abort ();
+ gcc_assert (!n_edges);
}
\f
/* Allocate memory for basic_block. */
basic_block
-alloc_block ()
+alloc_block (void)
{
basic_block bb;
- bb = pool_alloc (bb_pool);
- memset (bb, 0, sizeof (*bb));
+ bb = ggc_alloc_cleared (sizeof (*bb));
return bb;
}
+/* Create memory pool for rbi_pool. */
+
+void
+alloc_rbi_pool (void)
+{
+ rbi_pool = create_alloc_pool ("rbi pool",
+ sizeof (struct reorder_block_def),
+ n_basic_blocks + 2);
+}
+
+/* Free rbi_pool. */
+
+void
+free_rbi_pool (void)
+{
+ free_alloc_pool (rbi_pool);
+}
+
+/* Initialize rbi (the structure containing data used by basic block
+ duplication and reordering) for the given basic block. */
+
+void
+initialize_bb_rbi (basic_block bb)
+{
+ gcc_assert (!bb->rbi);
+ bb->rbi = pool_alloc (rbi_pool);
+ memset (bb->rbi, 0, sizeof (struct reorder_block_def));
+}
+
/* Link block B to chain after AFTER. */
void
-link_block (b, after)
- basic_block b, after;
+link_block (basic_block b, basic_block after)
{
b->next_bb = after->next_bb;
b->prev_bb = after;
/* Unlink block B from chain. */
void
-unlink_block (b)
- basic_block b;
+unlink_block (basic_block b)
{
b->next_bb->prev_bb = b->prev_bb;
b->prev_bb->next_bb = b->next_bb;
+ b->prev_bb = NULL;
+ b->next_bb = NULL;
}
/* Sequentially order blocks and compact the arrays. */
void
-compact_blocks ()
+compact_blocks (void)
{
int i;
basic_block bb;
-
+
i = 0;
FOR_EACH_BB (bb)
{
i++;
}
- if (i != n_basic_blocks)
- abort ();
+ gcc_assert (i == n_basic_blocks);
+
+ for (; i < last_basic_block; i++)
+ BASIC_BLOCK (i) = NULL;
last_basic_block = n_basic_blocks;
}
/* Remove block B from the basic block array. */
void
-expunge_block (b)
- basic_block b;
+expunge_block (basic_block b)
{
unlink_block (b);
BASIC_BLOCK (b->index) = NULL;
n_basic_blocks--;
- pool_free (bb_pool, b);
+ /* We should be able to ggc_free here, but we are not.
+ The dead SSA_NAMES are left pointing to dead statements that are pointing
+ to dead basic blocks making garbage collector to die.
+ We should be able to release all dead SSA_NAMES and at the same time we should
+ clear out BB pointer of dead statements consistently. */
}
\f
-/* Create an edge connecting SRC and DST with FLAGS optionally using
- edge cache CACHE. Return the new edge, NULL if already exist. */
+/* Connect E to E->src. */
-edge
-cached_make_edge (edge_cache, src, dst, flags)
- sbitmap *edge_cache;
- basic_block src, dst;
- int flags;
+static inline void
+connect_src (edge e)
{
- int use_edge_cache;
- edge e;
+ VEC_safe_push (edge, e->src->succs, e);
+}
- /* Don't bother with edge cache for ENTRY or EXIT, if there aren't that
- many edges to them, or we didn't allocate memory for it. */
- use_edge_cache = (edge_cache
- && src != ENTRY_BLOCK_PTR && dst != EXIT_BLOCK_PTR);
+/* Connect E to E->dest. */
- /* Make sure we don't add duplicate edges. */
- switch (use_edge_cache)
+static inline void
+connect_dest (edge e)
+{
+ basic_block dest = e->dest;
+ VEC_safe_push (edge, dest->preds, e);
+ e->dest_idx = EDGE_COUNT (dest->preds) - 1;
+}
+
+/* Disconnect edge E from E->src. */
+
+static inline void
+disconnect_src (edge e)
+{
+ basic_block src = e->src;
+ edge_iterator ei;
+ edge tmp;
+
+ for (ei = ei_start (src->succs); (tmp = ei_safe_edge (ei)); )
{
- default:
- /* Quick test for non-existence of the edge. */
- if (! TEST_BIT (edge_cache[src->index], dst->index))
- break;
-
- /* The edge exists; early exit if no work to do. */
- if (flags == 0)
- return NULL;
-
- /* FALLTHRU */
- case 0:
- for (e = src->succ; e; e = e->succ_next)
- if (e->dest == dst)
- {
- e->flags |= flags;
- return NULL;
- }
- break;
+ if (tmp == e)
+ {
+ VEC_unordered_remove (edge, src->succs, ei.index);
+ return;
+ }
+ else
+ ei_next (&ei);
}
-
-
- e = pool_alloc (edge_pool);
- memset (e, 0, sizeof (*e));
+
+ gcc_unreachable ();
+}
+
+/* Disconnect edge E from E->dest. */
+
+static inline void
+disconnect_dest (edge e)
+{
+ basic_block dest = e->dest;
+ unsigned int dest_idx = e->dest_idx;
+
+ VEC_unordered_remove (edge, dest->preds, dest_idx);
+
+ /* If we removed an edge in the middle of the edge vector, we need
+ to update dest_idx of the edge that moved into the "hole". */
+ if (dest_idx < EDGE_COUNT (dest->preds))
+ EDGE_PRED (dest, dest_idx)->dest_idx = dest_idx;
+}
+
+/* Create an edge connecting SRC and DEST with flags FLAGS. Return newly
+ created edge. Use this only if you are sure that this edge can't
+ possibly already exist. */
+
+edge
+unchecked_make_edge (basic_block src, basic_block dst, int flags)
+{
+ edge e;
+ e = ggc_alloc_cleared (sizeof (*e));
n_edges++;
- e->succ_next = src->succ;
- e->pred_next = dst->pred;
e->src = src;
e->dest = dst;
e->flags = flags;
- src->succ = e;
- dst->pred = e;
+ connect_src (e);
+ connect_dest (e);
- if (use_edge_cache)
- SET_BIT (edge_cache[src->index], dst->index);
+ execute_on_growing_pred (e);
return e;
}
+/* Create an edge connecting SRC and DST with FLAGS optionally using
+ edge cache CACHE. Return the new edge, NULL if already exist. */
+
+edge
+cached_make_edge (sbitmap *edge_cache, basic_block src, basic_block dst, int flags)
+{
+ if (edge_cache == NULL
+ || src == ENTRY_BLOCK_PTR
+ || dst == EXIT_BLOCK_PTR)
+ return make_edge (src, dst, flags);
+
+ /* Does the requested edge already exist? */
+ if (! TEST_BIT (edge_cache[src->index], dst->index))
+ {
+ /* The edge does not exist. Create one and update the
+ cache. */
+ SET_BIT (edge_cache[src->index], dst->index);
+ return unchecked_make_edge (src, dst, flags);
+ }
+
+ /* At this point, we know that the requested edge exists. Adjust
+ flags if necessary. */
+ if (flags)
+ {
+ edge e = find_edge (src, dst);
+ e->flags |= flags;
+ }
+
+ return NULL;
+}
+
/* Create an edge connecting SRC and DEST with flags FLAGS. Return newly
created edge or NULL if already exist. */
edge
-make_edge (src, dest, flags)
- basic_block src, dest;
- int flags;
+make_edge (basic_block src, basic_block dest, int flags)
{
- return cached_make_edge (NULL, src, dest, flags);
+ edge e = find_edge (src, dest);
+
+ /* Make sure we don't add duplicate edges. */
+ if (e)
+ {
+ e->flags |= flags;
+ return NULL;
+ }
+
+ return unchecked_make_edge (src, dest, flags);
}
/* Create an edge connecting SRC to DEST and set probability by knowing
that it is the single edge leaving SRC. */
edge
-make_single_succ_edge (src, dest, flags)
- basic_block src, dest;
- int flags;
+make_single_succ_edge (basic_block src, basic_block dest, int flags)
{
edge e = make_edge (src, dest, flags);
/* This function will remove an edge from the flow graph. */
void
-remove_edge (e)
- edge e;
+remove_edge (edge e)
{
- edge last_pred = NULL;
- edge last_succ = NULL;
- edge tmp;
- basic_block src, dest;
-
- src = e->src;
- dest = e->dest;
- for (tmp = src->succ; tmp && tmp != e; tmp = tmp->succ_next)
- last_succ = tmp;
+ execute_on_shrinking_pred (e);
- if (!tmp)
- abort ();
- if (last_succ)
- last_succ->succ_next = e->succ_next;
- else
- src->succ = e->succ_next;
-
- for (tmp = dest->pred; tmp && tmp != e; tmp = tmp->pred_next)
- last_pred = tmp;
-
- if (!tmp)
- abort ();
- if (last_pred)
- last_pred->pred_next = e->pred_next;
- else
- dest->pred = e->pred_next;
+ disconnect_src (e);
+ disconnect_dest (e);
free_edge (e);
}
/* Redirect an edge's successor from one block to another. */
void
-redirect_edge_succ (e, new_succ)
- edge e;
- basic_block new_succ;
+redirect_edge_succ (edge e, basic_block new_succ)
{
- edge *pe;
+ execute_on_shrinking_pred (e);
- /* Disconnect the edge from the old successor block. */
- for (pe = &e->dest->pred; *pe != e; pe = &(*pe)->pred_next)
- continue;
- *pe = (*pe)->pred_next;
+ disconnect_dest (e);
- /* Reconnect the edge to the new successor block. */
- e->pred_next = new_succ->pred;
- new_succ->pred = e;
e->dest = new_succ;
+
+ /* Reconnect the edge to the new successor block. */
+ connect_dest (e);
+
+ execute_on_growing_pred (e);
}
/* Like previous but avoid possible duplicate edge. */
edge
-redirect_edge_succ_nodup (e, new_succ)
- edge e;
- basic_block new_succ;
+redirect_edge_succ_nodup (edge e, basic_block new_succ)
{
edge s;
- /* Check whether the edge is already present. */
- for (s = e->src->succ; s; s = s->succ_next)
- if (s->dest == new_succ && s != e)
- break;
-
- if (s)
+ s = find_edge (e->src, new_succ);
+ if (s && s != e)
{
s->flags |= e->flags;
s->probability += e->probability;
/* Redirect an edge's predecessor from one block to another. */
void
-redirect_edge_pred (e, new_pred)
- edge e;
- basic_block new_pred;
+redirect_edge_pred (edge e, basic_block new_pred)
{
- edge *pe;
+ disconnect_src (e);
- /* Disconnect the edge from the old predecessor block. */
- for (pe = &e->src->succ; *pe != e; pe = &(*pe)->succ_next)
- continue;
-
- *pe = (*pe)->succ_next;
+ e->src = new_pred;
/* Reconnect the edge to the new predecessor block. */
- e->succ_next = new_pred->succ;
- new_pred->succ = e;
- e->src = new_pred;
+ connect_src (e);
}
+/* Clear all basic block flags, with the exception of partitioning. */
void
-clear_bb_flags ()
+clear_bb_flags (void)
{
basic_block bb;
FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb)
- bb->flags = 0;
+ bb->flags = BB_PARTITION (bb);
+}
+\f
+/* Check the consistency of profile information. We can't do that
+ in verify_flow_info, as the counts may get invalid for incompletely
+ solved graphs, later eliminating of conditionals or roundoff errors.
+ It is still practical to have them reported for debugging of simple
+ testcases. */
+void
+check_bb_profile (basic_block bb, FILE * file)
+{
+ edge e;
+ int sum = 0;
+ gcov_type lsum;
+ edge_iterator ei;
+
+ if (profile_status == PROFILE_ABSENT)
+ return;
+
+ if (bb != EXIT_BLOCK_PTR)
+ {
+ FOR_EACH_EDGE (e, ei, bb->succs)
+ sum += e->probability;
+ if (EDGE_COUNT (bb->succs) && abs (sum - REG_BR_PROB_BASE) > 100)
+ fprintf (file, "Invalid sum of outgoing probabilities %.1f%%\n",
+ sum * 100.0 / REG_BR_PROB_BASE);
+ lsum = 0;
+ FOR_EACH_EDGE (e, ei, bb->succs)
+ lsum += e->count;
+ if (EDGE_COUNT (bb->succs)
+ && (lsum - bb->count > 100 || lsum - bb->count < -100))
+ fprintf (file, "Invalid sum of outgoing counts %i, should be %i\n",
+ (int) lsum, (int) bb->count);
+ }
+ if (bb != ENTRY_BLOCK_PTR)
+ {
+ sum = 0;
+ FOR_EACH_EDGE (e, ei, bb->preds)
+ sum += EDGE_FREQUENCY (e);
+ if (abs (sum - bb->frequency) > 100)
+ fprintf (file,
+ "Invalid sum of incoming frequencies %i, should be %i\n",
+ sum, bb->frequency);
+ lsum = 0;
+ FOR_EACH_EDGE (e, ei, bb->preds)
+ lsum += e->count;
+ if (lsum - bb->count > 100 || lsum - bb->count < -100)
+ fprintf (file, "Invalid sum of incoming counts %i, should be %i\n",
+ (int) lsum, (int) bb->count);
+ }
}
\f
void
-dump_flow_info (file)
- FILE *file;
+dump_flow_info (FILE *file)
{
int i;
- int max_regno = max_reg_num ();
basic_block bb;
- static const char * const reg_class_names[] = REG_CLASS_NAMES;
- fprintf (file, "%d registers.\n", max_regno);
- for (i = FIRST_PSEUDO_REGISTER; i < max_regno; i++)
- if (REG_N_REFS (i))
- {
- enum reg_class class, altclass;
-
- fprintf (file, "\nRegister %d used %d times across %d insns",
- i, REG_N_REFS (i), REG_LIVE_LENGTH (i));
- if (REG_BASIC_BLOCK (i) >= 0)
- fprintf (file, " in block %d", REG_BASIC_BLOCK (i));
- if (REG_N_SETS (i))
- fprintf (file, "; set %d time%s", REG_N_SETS (i),
- (REG_N_SETS (i) == 1) ? "" : "s");
- if (regno_reg_rtx[i] != NULL && REG_USERVAR_P (regno_reg_rtx[i]))
- fprintf (file, "; user var");
- if (REG_N_DEATHS (i) != 1)
- fprintf (file, "; dies in %d places", REG_N_DEATHS (i));
- if (REG_N_CALLS_CROSSED (i) == 1)
- fprintf (file, "; crosses 1 call");
- else if (REG_N_CALLS_CROSSED (i))
- fprintf (file, "; crosses %d calls", REG_N_CALLS_CROSSED (i));
- if (regno_reg_rtx[i] != NULL
- && PSEUDO_REGNO_BYTES (i) != UNITS_PER_WORD)
- fprintf (file, "; %d bytes", PSEUDO_REGNO_BYTES (i));
-
- class = reg_preferred_class (i);
- altclass = reg_alternate_class (i);
- if (class != GENERAL_REGS || altclass != ALL_REGS)
+ /* There are no pseudo registers after reload. Don't dump them. */
+ if (reg_n_info && !reload_completed)
+ {
+ int max_regno = max_reg_num ();
+ fprintf (file, "%d registers.\n", max_regno);
+ for (i = FIRST_PSEUDO_REGISTER; i < max_regno; i++)
+ if (REG_N_REFS (i))
{
- if (altclass == ALL_REGS || class == ALL_REGS)
- fprintf (file, "; pref %s", reg_class_names[(int) class]);
- else if (altclass == NO_REGS)
- fprintf (file, "; %s or none", reg_class_names[(int) class]);
- else
- fprintf (file, "; pref %s, else %s",
- reg_class_names[(int) class],
- reg_class_names[(int) altclass]);
+ enum reg_class class, altclass;
+
+ fprintf (file, "\nRegister %d used %d times across %d insns",
+ i, REG_N_REFS (i), REG_LIVE_LENGTH (i));
+ if (REG_BASIC_BLOCK (i) >= 0)
+ fprintf (file, " in block %d", REG_BASIC_BLOCK (i));
+ if (REG_N_SETS (i))
+ fprintf (file, "; set %d time%s", REG_N_SETS (i),
+ (REG_N_SETS (i) == 1) ? "" : "s");
+ if (regno_reg_rtx[i] != NULL && REG_USERVAR_P (regno_reg_rtx[i]))
+ fprintf (file, "; user var");
+ if (REG_N_DEATHS (i) != 1)
+ fprintf (file, "; dies in %d places", REG_N_DEATHS (i));
+ if (REG_N_CALLS_CROSSED (i) == 1)
+ fprintf (file, "; crosses 1 call");
+ else if (REG_N_CALLS_CROSSED (i))
+ fprintf (file, "; crosses %d calls", REG_N_CALLS_CROSSED (i));
+ if (regno_reg_rtx[i] != NULL
+ && PSEUDO_REGNO_BYTES (i) != UNITS_PER_WORD)
+ fprintf (file, "; %d bytes", PSEUDO_REGNO_BYTES (i));
+
+ class = reg_preferred_class (i);
+ altclass = reg_alternate_class (i);
+ if (class != GENERAL_REGS || altclass != ALL_REGS)
+ {
+ if (altclass == ALL_REGS || class == ALL_REGS)
+ fprintf (file, "; pref %s", reg_class_names[(int) class]);
+ else if (altclass == NO_REGS)
+ fprintf (file, "; %s or none", reg_class_names[(int) class]);
+ else
+ fprintf (file, "; pref %s, else %s",
+ reg_class_names[(int) class],
+ reg_class_names[(int) altclass]);
+ }
+
+ if (regno_reg_rtx[i] != NULL && REG_POINTER (regno_reg_rtx[i]))
+ fprintf (file, "; pointer");
+ fprintf (file, ".\n");
}
-
- if (regno_reg_rtx[i] != NULL && REG_POINTER (regno_reg_rtx[i]))
- fprintf (file, "; pointer");
- fprintf (file, ".\n");
- }
+ }
fprintf (file, "\n%d basic blocks, %d edges.\n", n_basic_blocks, n_edges);
FOR_EACH_BB (bb)
{
edge e;
- int sum;
- gcov_type lsum;
+ edge_iterator ei;
- fprintf (file, "\nBasic block %d: first insn %d, last %d, ",
- bb->index, INSN_UID (bb->head), INSN_UID (bb->end));
+ fprintf (file, "\nBasic block %d ", bb->index);
fprintf (file, "prev %d, next %d, ",
bb->prev_bb->index, bb->next_bb->index);
fprintf (file, "loop_depth %d, count ", bb->loop_depth);
fprintf (file, ".\n");
fprintf (file, "Predecessors: ");
- for (e = bb->pred; e; e = e->pred_next)
+ FOR_EACH_EDGE (e, ei, bb->preds)
dump_edge_info (file, e, 0);
fprintf (file, "\nSuccessors: ");
- for (e = bb->succ; e; e = e->succ_next)
+ FOR_EACH_EDGE (e, ei, bb->succs)
dump_edge_info (file, e, 1);
- fprintf (file, "\nRegisters live at start:");
- dump_regset (bb->global_live_at_start, file);
+ if (bb->global_live_at_start)
+ {
+ fprintf (file, "\nRegisters live at start:");
+ dump_regset (bb->global_live_at_start, file);
+ }
- fprintf (file, "\nRegisters live at end:");
- dump_regset (bb->global_live_at_end, file);
+ if (bb->global_live_at_end)
+ {
+ fprintf (file, "\nRegisters live at end:");
+ dump_regset (bb->global_live_at_end, file);
+ }
putc ('\n', file);
-
- /* Check the consistency of profile information. We can't do that
- in verify_flow_info, as the counts may get invalid for incompletely
- solved graphs, later eliminating of conditionals or roundoff errors.
- It is still practical to have them reported for debugging of simple
- testcases. */
- sum = 0;
- for (e = bb->succ; e; e = e->succ_next)
- sum += e->probability;
- if (bb->succ && abs (sum - REG_BR_PROB_BASE) > 100)
- fprintf (file, "Invalid sum of outgoing probabilities %.1f%%\n",
- sum * 100.0 / REG_BR_PROB_BASE);
- sum = 0;
- for (e = bb->pred; e; e = e->pred_next)
- sum += EDGE_FREQUENCY (e);
- if (abs (sum - bb->frequency) > 100)
- fprintf (file,
- "Invalid sum of incomming frequencies %i, should be %i\n",
- sum, bb->frequency);
- lsum = 0;
- for (e = bb->pred; e; e = e->pred_next)
- lsum += e->count;
- if (lsum - bb->count > 100 || lsum - bb->count < -100)
- fprintf (file, "Invalid sum of incomming counts %i, should be %i\n",
- (int)lsum, (int)bb->count);
- lsum = 0;
- for (e = bb->succ; e; e = e->succ_next)
- lsum += e->count;
- if (bb->succ && (lsum - bb->count > 100 || lsum - bb->count < -100))
- fprintf (file, "Invalid sum of incomming counts %i, should be %i\n",
- (int)lsum, (int)bb->count);
+ check_bb_profile (bb, file);
}
putc ('\n', file);
}
void
-debug_flow_info ()
+debug_flow_info (void)
{
dump_flow_info (stderr);
}
void
-dump_edge_info (file, e, do_succ)
- FILE *file;
- edge e;
- int do_succ;
+dump_edge_info (FILE *file, edge e, int do_succ)
{
basic_block side = (do_succ ? e->dest : e->src);
if (e->flags)
{
- static const char * const bitnames[]
- = {"fallthru", "ab", "abcall", "eh", "fake", "dfs_back", "can_fallthru","irreducible"};
+ static const char * const bitnames[] = {
+ "fallthru", "ab", "abcall", "eh", "fake", "dfs_back",
+ "can_fallthru", "irreducible", "sibcall", "loop_exit",
+ "true", "false", "exec"
+ };
int comma = 0;
int i, flags = e->flags;
be first initialized by alloc_aux_for_blocks. */
inline void
-alloc_aux_for_block (bb, size)
- basic_block bb;
- int size;
+alloc_aux_for_block (basic_block bb, int size)
{
/* Verify that aux field is clear. */
- if (bb->aux || !first_block_aux_obj)
- abort ();
+ gcc_assert (!bb->aux && first_block_aux_obj);
bb->aux = obstack_alloc (&block_aux_obstack, size);
memset (bb->aux, 0, size);
}
alloc_aux_for_block for each basic block. */
void
-alloc_aux_for_blocks (size)
- int size;
+alloc_aux_for_blocks (int size)
{
static int initialized;
gcc_obstack_init (&block_aux_obstack);
initialized = 1;
}
-
- /* Check whether AUX data are still allocated. */
- else if (first_block_aux_obj)
- abort ();
- first_block_aux_obj = (char *) obstack_alloc (&block_aux_obstack, 0);
+ else
+ /* Check whether AUX data are still allocated. */
+ gcc_assert (!first_block_aux_obj);
+
+ first_block_aux_obj = obstack_alloc (&block_aux_obstack, 0);
if (size)
{
basic_block bb;
/* Clear AUX pointers of all blocks. */
void
-clear_aux_for_blocks ()
+clear_aux_for_blocks (void)
{
basic_block bb;
of all blocks. */
void
-free_aux_for_blocks ()
+free_aux_for_blocks (void)
{
- if (!first_block_aux_obj)
- abort ();
+ gcc_assert (first_block_aux_obj);
obstack_free (&block_aux_obstack, first_block_aux_obj);
first_block_aux_obj = NULL;
be first initialized by alloc_aux_for_edges. */
inline void
-alloc_aux_for_edge (e, size)
- edge e;
- int size;
+alloc_aux_for_edge (edge e, int size)
{
/* Verify that aux field is clear. */
- if (e->aux || !first_edge_aux_obj)
- abort ();
+ gcc_assert (!e->aux && first_edge_aux_obj);
e->aux = obstack_alloc (&edge_aux_obstack, size);
memset (e->aux, 0, size);
}
alloc_aux_for_edge for each basic edge. */
void
-alloc_aux_for_edges (size)
- int size;
+alloc_aux_for_edges (int size)
{
static int initialized;
gcc_obstack_init (&edge_aux_obstack);
initialized = 1;
}
+ else
+ /* Check whether AUX data are still allocated. */
+ gcc_assert (!first_edge_aux_obj);
- /* Check whether AUX data are still allocated. */
- else if (first_edge_aux_obj)
- abort ();
-
- first_edge_aux_obj = (char *) obstack_alloc (&edge_aux_obstack, 0);
+ first_edge_aux_obj = obstack_alloc (&edge_aux_obstack, 0);
if (size)
{
basic_block bb;
FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb)
{
edge e;
+ edge_iterator ei;
- for (e = bb->succ; e; e = e->succ_next)
+ FOR_EACH_EDGE (e, ei, bb->succs)
alloc_aux_for_edge (e, size);
}
}
/* Clear AUX pointers of all edges. */
void
-clear_aux_for_edges ()
+clear_aux_for_edges (void)
{
basic_block bb;
edge e;
FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb)
{
- for (e = bb->succ; e; e = e->succ_next)
+ edge_iterator ei;
+ FOR_EACH_EDGE (e, ei, bb->succs)
e->aux = NULL;
}
}
of all edges. */
void
-free_aux_for_edges ()
+free_aux_for_edges (void)
{
- if (!first_edge_aux_obj)
- abort ();
+ gcc_assert (first_edge_aux_obj);
obstack_free (&edge_aux_obstack, first_edge_aux_obj);
first_edge_aux_obj = NULL;
clear_aux_for_edges ();
}
+
+void
+debug_bb (basic_block bb)
+{
+ dump_bb (bb, stderr, 0);
+}
+
+basic_block
+debug_bb_n (int n)
+{
+ basic_block bb = BASIC_BLOCK (n);
+ dump_bb (bb, stderr, 0);
+ return bb;
+}
+
+/* Dumps cfg related information about basic block BB to FILE. */
+
+static void
+dump_cfg_bb_info (FILE *file, basic_block bb)
+{
+ unsigned i;
+ edge_iterator ei;
+ bool first = true;
+ static const char * const bb_bitnames[] =
+ {
+ "dirty", "new", "reachable", "visited", "irreducible_loop", "superblock"
+ };
+ const unsigned n_bitnames = sizeof (bb_bitnames) / sizeof (char *);
+ edge e;
+
+ fprintf (file, "Basic block %d", bb->index);
+ for (i = 0; i < n_bitnames; i++)
+ if (bb->flags & (1 << i))
+ {
+ if (first)
+ fprintf (file, " (");
+ else
+ fprintf (file, ", ");
+ first = false;
+ fprintf (file, bb_bitnames[i]);
+ }
+ if (!first)
+ fprintf (file, ")");
+ fprintf (file, "\n");
+
+ fprintf (file, "Predecessors: ");
+ FOR_EACH_EDGE (e, ei, bb->preds)
+ dump_edge_info (file, e, 0);
+
+ fprintf (file, "\nSuccessors: ");
+ FOR_EACH_EDGE (e, ei, bb->succs)
+ dump_edge_info (file, e, 1);
+ fprintf (file, "\n\n");
+}
+
+/* Dumps a brief description of cfg to FILE. */
+
+void
+brief_dump_cfg (FILE *file)
+{
+ basic_block bb;
+
+ FOR_EACH_BB (bb)
+ {
+ dump_cfg_bb_info (file, bb);
+ }
+}
+
+/* An edge originally destinating BB of FREQUENCY and COUNT has been proved to
+ leave the block by TAKEN_EDGE. Update profile of BB such that edge E can be
+ redirected to destination of TAKEN_EDGE.
+
+ This function may leave the profile inconsistent in the case TAKEN_EDGE
+ frequency or count is believed to be lower than FREQUENCY or COUNT
+ respectively. */
+void
+update_bb_profile_for_threading (basic_block bb, int edge_frequency,
+ gcov_type count, edge taken_edge)
+{
+ edge c;
+ int prob;
+ edge_iterator ei;
+
+ bb->count -= count;
+ if (bb->count < 0)
+ bb->count = 0;
+
+ /* Compute the probability of TAKEN_EDGE being reached via threaded edge.
+ Watch for overflows. */
+ if (bb->frequency)
+ prob = edge_frequency * REG_BR_PROB_BASE / bb->frequency;
+ else
+ prob = 0;
+ if (prob > taken_edge->probability)
+ {
+ if (dump_file)
+ fprintf (dump_file, "Jump threading proved probability of edge "
+ "%i->%i too small (it is %i, should be %i).\n",
+ taken_edge->src->index, taken_edge->dest->index,
+ taken_edge->probability, prob);
+ prob = taken_edge->probability;
+ }
+
+ /* Now rescale the probabilities. */
+ taken_edge->probability -= prob;
+ prob = REG_BR_PROB_BASE - prob;
+ bb->frequency -= edge_frequency;
+ if (bb->frequency < 0)
+ bb->frequency = 0;
+ if (prob <= 0)
+ {
+ if (dump_file)
+ fprintf (dump_file, "Edge frequencies of bb %i has been reset, "
+ "frequency of block should end up being 0, it is %i\n",
+ bb->index, bb->frequency);
+ EDGE_SUCC (bb, 0)->probability = REG_BR_PROB_BASE;
+ ei = ei_start (bb->succs);
+ ei_next (&ei);
+ for (; (c = ei_safe_edge (ei)); ei_next (&ei))
+ c->probability = 0;
+ }
+ else if (prob != REG_BR_PROB_BASE)
+ {
+ int scale = REG_BR_PROB_BASE / prob;
+
+ FOR_EACH_EDGE (c, ei, bb->succs)
+ c->probability *= scale;
+ }
+
+ if (bb != taken_edge->src)
+ abort ();
+ taken_edge->count -= count;
+ if (taken_edge->count < 0)
+ taken_edge->count = 0;
+}
OSDN Git Service
