osprey-gcc-4.2.0/gcc/cfganal.c File Reference

#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "rtl.h"
#include "obstack.h"
#include "hard-reg-set.h"
#include "basic-block.h"
#include "insn-config.h"
#include "recog.h"
#include "toplev.h"
#include "tm_p.h"
#include "timevar.h"

Include dependency graph for cfganal.c:

Go to the source code of this file.

Data Types

type depth_first_search_dsS

Defines

#define MARK_VISITED(BB)   (SET_BIT (visited, (BB)->index))

#define UNMARK_VISITED(BB)   (RESET_BIT (visited, (BB)->index))

#define VISITED_P(BB)   (TEST_BIT (visited, (BB)->index))

Typedefs

typedef struct
depth_first_search_dsS * depth_first_search_ds

Functions/Subroutines

static void flow_dfs_compute_reverse_init (depth_first_search_ds)

static void flow_dfs_compute_reverse_add_bb (depth_first_search_ds, basic_block)

static basic_block flow_dfs_compute_reverse_execute (depth_first_search_ds, basic_block)

static void flow_dfs_compute_reverse_finish (depth_first_search_ds)

static bool flow_active_insn_p (rtx)

bool forwarder_block_p (basic_block bb)

bool can_fallthru (basic_block src, basic_block target)

bool could_fall_through (basic_block src, basic_block target)

bool mark_dfs_back_edges (void)

void set_edge_can_fallthru_flag (void)

void find_unreachable_blocks (void)

struct edge_list * create_edge_list (void)

void free_edge_list (struct edge_list *elist)

void print_edge_list (FILE *f, struct edge_list *elist)

void verify_edge_list (FILE *f, struct edge_list *elist)

edge find_edge (basic_block pred, basic_block succ)

int find_edge_index (struct edge_list *edge_list, basic_block pred, basic_block succ)

void flow_nodes_print (const char *str, const sbitmap nodes, FILE *file)

void flow_edge_list_print (const char *str, const edge *edge_list, int num_edges, FILE *file)

static void remove_fake_predecessors (basic_block bb)

void remove_fake_edges (void)

void remove_fake_exit_edges (void)

void add_noreturn_fake_exit_edges (void)

void connect_infinite_loops_to_exit (void)

int post_order_compute (int *post_order, bool include_entry_exit)

int pre_and_rev_post_order_compute (int *pre_order, int *rev_post_order, bool include_entry_exit)

int dfs_enumerate_from (basic_block bb, int reverse, bool(*predicate)(basic_block, void *), basic_block *rslt, int rslt_max, void *data)

static void compute_dominance_frontiers_1 (bitmap *frontiers)

void compute_dominance_frontiers (bitmap *frontiers)

Define Documentation

#define MARK_VISITED ( BB ) (SET_BIT (visited, (BB)->index))

Referenced by blocks_in_phiopt_order(), and dfs_enumerate_from().

#define UNMARK_VISITED ( BB ) (RESET_BIT (visited, (BB)->index))

Referenced by dfs_enumerate_from().

#define VISITED_P ( BB ) (TEST_BIT (visited, (BB)->index))

Referenced by blocks_in_phiopt_order(), and dfs_enumerate_from().

Typedef Documentation

typedef struct depth_first_search_dsS* depth_first_search_ds

Definition at line 49 of file cfganal.c.

Function Documentation

void add_noreturn_fake_exit_edges ( void )

Definition at line 601 of file cfganal.c.

References EDGE_COUNT, EDGE_FAKE, EXIT_BLOCK_PTR, FOR_EACH_BB, make_single_succ_edge(), NULL, and basic_block_def::succ.

bool can_fallthru	(	basic_block	src,
		basic_block	target
	)

Definition at line 105 of file cfganal.c.

References active_insn_p(), BB_END, BB_HEAD, edge::dest, EDGE_FALLTHRU, EXIT_BLOCK_PTR, edge::flags, FOR_EACH_EDGE, insn, next_active_insn(), and basic_block_def::next_bb.

void compute_dominance_frontiers ( bitmap * frontiers )

Definition at line 1071 of file cfganal.c.

References compute_dominance_frontiers_1(), timevar_pop, and timevar_push.

static void compute_dominance_frontiers_1 ( bitmap * frontiers ) [static]

Definition at line 1038 of file cfganal.c.

References b, bitmap_bit_p(), bitmap_set_bit(), CDI_DOMINATORS, EDGE_COUNT, ENTRY_BLOCK_PTR, FOR_EACH_BB, FOR_EACH_EDGE, get_immediate_dominator(), basic_block_def::index, p, and edge::src.

void connect_infinite_loops_to_exit ( void )

Definition at line 622 of file cfganal.c.

References EDGE_FAKE, EXIT_BLOCK_PTR, flow_dfs_compute_reverse_add_bb(), flow_dfs_compute_reverse_execute(), flow_dfs_compute_reverse_finish(), flow_dfs_compute_reverse_init(), and make_edge().

bool could_fall_through	(	basic_block	src,
		basic_block	target
	)

Definition at line 133 of file cfganal.c.

References edge::dest, EDGE_FALLTHRU, EXIT_BLOCK_PTR, edge::flags, and FOR_EACH_EDGE.

Referenced by fixup_reorder_chain().

struct edge_list* create_edge_list ( void ) [read]

Definition at line 339 of file cfganal.c.

References EDGE_COUNT, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, FOR_BB_BETWEEN, FOR_EACH_EDGE, edge_list::index_to_edge, n_basic_blocks, edge_list::num_blocks, edge_list::num_edges, basic_block_def::succ, edge::succ_next, xmalloc(), XNEW, and XNEWVEC.

int dfs_enumerate_from	(	basic_block	bb,
		int	reverse,
		bool()(basic_block, void )	predicate,
		basic_block *	rslt,
		int	rslt_max,
		void *	data
	)

Definition at line 933 of file cfganal.c.

References BB_VISITED, edge::dest, basic_block_def::flags, flags, FOR_EACH_EDGE, free(), gcc_assert, last_basic_block, MARK_VISITED, sbitmap_alloc(), sbitmap_resize(), sbitmap_zero(), size, sp, edge::src, UNMARK_VISITED, visited, VISITED_P, xcalloc(), and XCNEWVEC.

edge find_edge	(	basic_block	pred,
		basic_block	succ
	)

Definition at line 482 of file cfganal.c.

References edge::dest, EDGE_COUNT, FOR_EACH_EDGE, NULL, and edge::src.

int find_edge_index	(	struct edge_list *	edge_list,
		basic_block	pred,
		basic_block	succ
	)

Definition at line 507 of file cfganal.c.

References EDGE_INDEX_NO_EDGE, INDEX_EDGE_PRED_BB, INDEX_EDGE_SUCC_BB, NUM_EDGES, and x.

void find_unreachable_blocks ( void )

Definition at line 279 of file cfganal.c.

References b, BB_REACHABLE, edge::dest, dest, ENTRY_BLOCK_PTR, basic_block_def::flags, FOR_EACH_BB, FOR_EACH_EDGE, free(), n_basic_blocks, basic_block_def::succ, edge::succ_next, tos, worklist, xmalloc(), and XNEWVEC.

static bool flow_active_insn_p ( rtx insn ) [static]

Definition at line 63 of file cfganal.c.

References active_insn_p(), GET_CODE, PATTERN, REG_FUNCTION_VALUE_P, REG_P, and XEXP.

static void flow_dfs_compute_reverse_add_bb	(	depth_first_search_ds	data,
		basic_block	bb
	)			`[static]`

Definition at line 882 of file cfganal.c.

References basic_block_def::index, SET_BIT, depth_first_search_dsS::sp, depth_first_search_dsS::stack, and depth_first_search_dsS::visited_blocks.

static basic_block flow_dfs_compute_reverse_execute	(	depth_first_search_ds	data,
		basic_block	last_unvisited
	)			`[static]`

Definition at line 894 of file cfganal.c.

References flow_dfs_compute_reverse_add_bb(), FOR_BB_BETWEEN, FOR_EACH_EDGE, basic_block_def::index, NULL, depth_first_search_dsS::sp, edge::src, depth_first_search_dsS::stack, TEST_BIT, and depth_first_search_dsS::visited_blocks.

static void flow_dfs_compute_reverse_finish ( depth_first_search_ds data ) [static]

Definition at line 923 of file cfganal.c.

References free(), sbitmap_free, depth_first_search_dsS::stack, and depth_first_search_dsS::visited_blocks.

static void flow_dfs_compute_reverse_init ( depth_first_search_ds data ) [static]

Definition at line 862 of file cfganal.c.

References last_basic_block, n_basic_blocks, sbitmap_alloc(), sbitmap_zero(), depth_first_search_dsS::sp, depth_first_search_dsS::stack, depth_first_search_dsS::visited_blocks, and XNEWVEC.

void flow_edge_list_print	(	const char *	str,
		const edge *	edge_list,
		int	num_edges,
		FILE *	file
	)

Definition at line 539 of file cfganal.c.

References edge::dest, fprintf(), fputs(), i, and src.

void flow_nodes_print	(	const char *	str,
		const sbitmap	nodes,
		FILE *	file
	)

Definition at line 522 of file cfganal.c.

References EXECUTE_IF_SET_IN_SBITMAP, fprintf(), fputs(), and node.

bool forwarder_block_p ( basic_block bb )

Definition at line 85 of file cfganal.c.

References BB_END, BB_HEAD, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, flow_active_insn_p(), GET_CODE, insn, INSN_P, JUMP_P, NEXT_INSN, simplejump_p(), and single_succ_p().

void free_edge_list ( struct edge_list * elist )

Definition at line 377 of file cfganal.c.

References free(), and edge_list::index_to_edge.

bool mark_dfs_back_edges ( void )

Definition at line 158 of file cfganal.c.

References edge::dest, dest, EDGE_COUNT, EDGE_DFS_BACK, ei_edge(), ei_next(), ei_one_before_end_p(), ei_start, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, edge::flags, free(), basic_block_def::index, last_basic_block, n_basic_blocks, sbitmap_alloc(), sbitmap_free, sbitmap_zero(), SET_BIT, sp, src, edge::src, stack, basic_block_def::succ, edge::succ_next, TEST_BIT, visited, xcalloc(), XCNEWVEC, xmalloc(), and XNEWVEC.

int post_order_compute	(	int *	post_order,
		bool	include_entry_exit
	)

Definition at line 652 of file cfganal.c.

References edge::dest, dest, EDGE_COUNT, ei_edge(), ei_next(), ei_one_before_end_p(), ei_start, ENTRY_BLOCK, ENTRY_BLOCK_PTR, EXIT_BLOCK, EXIT_BLOCK_PTR, free(), basic_block_def::index, last_basic_block, n_basic_blocks, sbitmap_alloc(), sbitmap_free, sbitmap_zero(), SET_BIT, sp, src, edge::src, stack, TEST_BIT, visited, and XNEWVEC.

Referenced by df_analyze(), and set_up_bb_rts_numbers().

int pre_and_rev_post_order_compute	(	int *	pre_order,
		int *	rev_post_order,
		bool	include_entry_exit
	)

Definition at line 731 of file cfganal.c.

References edge::dest, dest, EDGE_COUNT, ei_edge(), ei_next(), ei_one_before_end_p(), ei_start, ENTRY_BLOCK, ENTRY_BLOCK_PTR, EXIT_BLOCK, EXIT_BLOCK_PTR, free(), gcc_assert, basic_block_def::index, last_basic_block, n_basic_blocks, NUM_FIXED_BLOCKS, sbitmap_alloc(), sbitmap_free, sbitmap_zero(), SET_BIT, sp, src, edge::src, stack, TEST_BIT, visited, and XNEWVEC.

Referenced by compute_rvuse_and_antic_safe(), flow_loops_find(), init_reassoc(), and vt_find_locations().

void print_edge_list	(	FILE *	f,
		struct edge_list *	elist
	)

Definition at line 389 of file cfganal.c.

References ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, fprintf(), index(), INDEX_EDGE_PRED_BB, INDEX_EDGE_SUCC_BB, edge_list::num_blocks, edge_list::num_edges, and x.

void remove_fake_edges ( void )

Definition at line 579 of file cfganal.c.

References ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, FOR_BB_BETWEEN, NULL, remove_fake_predecessors(), and remove_fake_successors().

void remove_fake_exit_edges ( void )

Definition at line 590 of file cfganal.c.

References EXIT_BLOCK_PTR, and remove_fake_predecessors().

Referenced by execute_sink_code(), fini_pre(), make_edges(), one_pre_gcse_pass(), see_execute_LCM(), store_motion(), tree_estimate_probability(), and try_optimize_cfg().

static void remove_fake_predecessors ( basic_block bb ) [static]

Definition at line 560 of file cfganal.c.

References EDGE_FAKE, ei_next(), ei_safe_edge(), ei_start, edge::flags, and remove_edge().

void set_edge_can_fallthru_flag ( void )

Definition at line 242 of file cfganal.c.

References any_condjump_p(), BB_END, EDGE_CAN_FALLTHRU, EDGE_COUNT, EDGE_FALLTHRU, EDGE_SUCC, basic_block_def::end, edge::flags, FOR_EACH_BB, FOR_EACH_EDGE, invert_jump(), JUMP_LABEL, basic_block_def::succ, and edge::succ_next.

void verify_edge_list	(	FILE *	f,
		struct edge_list *	elist
	)

Definition at line 416 of file cfganal.c.

References edge::dest, EDGE_INDEX, EDGE_INDEX_NO_EDGE, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, FOR_BB_BETWEEN, FOR_EACH_EDGE, fprintf(), index(), basic_block_def::index, INDEX_EDGE_PRED_BB, INDEX_EDGE_SUCC_BB, NULL, p, basic_block_def::pred, edge::pred_next, s, edge::src, basic_block_def::succ, and edge::succ_next.


Data Types
type	depth_first_search_dsS
Defines
#define	MARK_VISITED(BB) (SET_BIT (visited, (BB)->index))
#define	UNMARK_VISITED(BB) (RESET_BIT (visited, (BB)->index))
#define	VISITED_P(BB) (TEST_BIT (visited, (BB)->index))
Typedefs
typedef struct depth_first_search_dsS *	depth_first_search_ds
Functions/Subroutines
static void	flow_dfs_compute_reverse_init (depth_first_search_ds)
static void	flow_dfs_compute_reverse_add_bb (depth_first_search_ds, basic_block)
static basic_block	flow_dfs_compute_reverse_execute (depth_first_search_ds, basic_block)
static void	flow_dfs_compute_reverse_finish (depth_first_search_ds)
static bool	flow_active_insn_p (rtx)
bool	forwarder_block_p (basic_block bb)
bool	can_fallthru (basic_block src, basic_block target)
bool	could_fall_through (basic_block src, basic_block target)
bool	mark_dfs_back_edges (void)
void	set_edge_can_fallthru_flag (void)
void	find_unreachable_blocks (void)
struct edge_list *	create_edge_list (void)
void	free_edge_list (struct edge_list *elist)
void	print_edge_list (FILE f, struct edge_list elist)
void	verify_edge_list (FILE f, struct edge_list elist)
edge	find_edge (basic_block pred, basic_block succ)
int	find_edge_index (struct edge_list *edge_list, basic_block pred, basic_block succ)
void	flow_nodes_print (const char str, const sbitmap nodes, FILE file)
void	flow_edge_list_print (const char str, const edge edge_list, int num_edges, FILE *file)
static void	remove_fake_predecessors (basic_block bb)
void	remove_fake_edges (void)
void	remove_fake_exit_edges (void)
void	add_noreturn_fake_exit_edges (void)
void	connect_infinite_loops_to_exit (void)
int	post_order_compute (int *post_order, bool include_entry_exit)
int	pre_and_rev_post_order_compute (int pre_order, int rev_post_order, bool include_entry_exit)
int	dfs_enumerate_from (basic_block bb, int reverse, bool(predicate)(basic_block, void ), basic_block rslt, int rslt_max, void data)
static void	compute_dominance_frontiers_1 (bitmap *frontiers)
void	compute_dominance_frontiers (bitmap *frontiers)