struct loop;
/* Declared in tree-flow.h. */
-struct edge_prediction;
struct rtl_bb_info;
/* A basic block is a sequence of instructions with only entry and
/* Set on blocks that cannot be threaded through.
Only used in cfgcleanup.c. */
- BB_NONTHREADABLE_BLOCK = 1 << 11
+ BB_NONTHREADABLE_BLOCK = 1 << 11,
+
+ /* Set on blocks that were modified in some way. This bit is set in
+ df_set_bb_dirty, but not cleared by df_analyze, so it can be used
+ to test whether a block has been modified prior to a df_analyze
+ call. */
+ BB_MODIFIED = 1 << 12
};
/* Dummy flag for convenience in the hot/cold partitioning code. */
{
PROFILE_ABSENT,
PROFILE_GUESSED,
- PROFILE_READ
+ PROFILE_READ,
+ PROFILE_LAST /* Last value, used by profile streaming. */
};
/* A structure to group all the per-function control flow graph data.
static inline edge
single_succ_edge (const_basic_block bb)
{
-#ifdef ENABLE_CHECKING
- gcc_assert (single_succ_p (bb));
-#endif
+ gcc_checking_assert (single_succ_p (bb));
return EDGE_SUCC (bb, 0);
}
static inline edge
single_pred_edge (const_basic_block bb)
{
-#ifdef ENABLE_CHECKING
- gcc_assert (single_pred_p (bb));
-#endif
+ gcc_checking_assert (single_pred_p (bb));
return EDGE_PRED (bb, 0);
}
static inline VEC(edge,gc) *
ei_container (edge_iterator i)
{
-#ifdef ENABLE_CHECKING
- gcc_assert (i.container);
-#endif
+ gcc_checking_assert (i.container);
return *i.container;
}
static inline void
ei_next (edge_iterator *i)
{
-#ifdef ENABLE_CHECKING
- gcc_assert (i->index < EDGE_COUNT (ei_container (*i)));
-#endif
+ gcc_checking_assert (i->index < EDGE_COUNT (ei_container (*i)));
i->index++;
}
static inline void
ei_prev (edge_iterator *i)
{
-#ifdef ENABLE_CHECKING
- gcc_assert (i->index > 0);
-#endif
+ gcc_checking_assert (i->index > 0);
i->index--;
}
extern void flow_edge_list_print (const char *, const edge *, int, FILE *);
/* In cfgrtl.c */
-extern basic_block force_nonfallthru (edge);
extern rtx block_label (basic_block);
extern bool purge_all_dead_edges (void);
extern bool purge_dead_edges (basic_block);
+extern bool fixup_abnormal_edges (void);
/* In cfgbuild.c. */
extern void find_many_sub_basic_blocks (sbitmap);
extern void rtl_make_eh_edge (sbitmap, basic_block, rtx);
+enum replace_direction { dir_none, dir_forward, dir_backward, dir_both };
+
/* In cfgcleanup.c. */
extern bool cleanup_cfg (int);
-extern int flow_find_cross_jump (basic_block, basic_block, rtx *, rtx *);
+extern int flow_find_cross_jump (basic_block, basic_block, rtx *, rtx *,
+ enum replace_direction*);
extern int flow_find_head_matching_sequence (basic_block, basic_block,
rtx *, rtx *, int);
extern bool mark_dfs_back_edges (void);
extern void set_edge_can_fallthru_flag (void);
extern void update_br_prob_note (basic_block);
-extern void fixup_abnormal_edges (void);
extern bool inside_basic_block_p (const_rtx);
extern bool control_flow_insn_p (const_rtx);
extern rtx get_last_bb_insn (basic_block);
void set_loop_copy (struct loop *, struct loop *);
struct loop *get_loop_copy (struct loop *);
-
-extern rtx insert_insn_end_bb_new (rtx, basic_block);
-
#include "cfghooks.h"
/* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
return false;
}
+/* Return the fallthru edge in EDGES if it exists, NULL otherwise. */
+static inline edge
+find_fallthru_edge (VEC(edge,gc) *edges)
+{
+ edge e;
+ edge_iterator ei;
+
+ FOR_EACH_EDGE (e, ei, edges)
+ if (e->flags & EDGE_FALLTHRU)
+ break;
+
+ return e;
+}
+
/* In cfgloopmanip.c. */
extern edge mfb_kj_edge;
extern bool mfb_keep_just (edge);