GCC Middle and Back End API Reference
Go to the documentation of this file.
1/* Control flow graph analysis header file.
2 Copyright (C) 2014-2024 Free Software Foundation, Inc.
4This file is part of GCC.
6GCC is free software; you can redistribute it and/or modify it under
7the terms of the GNU General Public License as published by the Free
8Software Foundation; either version 3, or (at your option) any later
11GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12WARRANTY; without even the implied warranty of MERCHANTABILITY or
13FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14for more details.
16You should have received a copy of the GNU General Public License
17along with GCC; see the file COPYING3. If not see
18<http://www.gnu.org/licenses/>. */
21#ifndef GCC_CFGANAL_H
22#define GCC_CFGANAL_H
24/* This structure maintains an edge list vector. */
25/* FIXME: Make this a vec<edge>. */
33/* Class to compute and manage control dependences on an edge-list. */
52extern bool mark_dfs_back_edges (struct function *);
53extern bool mark_dfs_back_edges (void);
54extern void verify_marked_backedges (struct function *);
55extern void find_unreachable_blocks (void);
56extern void verify_no_unreachable_blocks (void);
57struct edge_list * create_edge_list (void);
58void free_edge_list (struct edge_list *);
59void print_edge_list (FILE *, struct edge_list *);
60void verify_edge_list (FILE *, struct edge_list *);
63extern void remove_fake_edges (void);
64extern void remove_fake_exit_edges (void);
65extern void add_noreturn_fake_exit_edges (void);
66extern void connect_infinite_loops_to_exit (void);
67extern int post_order_compute (int *, bool, bool);
69extern int inverted_rev_post_order_compute (struct function *,
70 int *, sbitmap *start_points = 0);
72 int *, int *, bool);
73extern int pre_and_rev_post_order_compute (int *, int *, bool);
75 bitmap, bool, int *,
76 vec<std::pair<int, int> > *);
77extern int dfs_enumerate_from (basic_block, int,
78 bool (*)(const_basic_block, const void *),
79 basic_block *, int, const void *);
80extern void compute_dominance_frontiers (class bitmap_head *);
81extern bitmap compute_idf (bitmap, class bitmap_head *);
91#endif /* GCC_CFGANAL_H */
bitmap compute_idf(bitmap, class bitmap_head *)
Definition cfganal.cc:1680
int rev_post_order_and_mark_dfs_back_seme(struct function *, edge, bitmap, bool, int *, vec< std::pair< int, int > > *)
Definition cfganal.cc:1167
void bitmap_intersection_of_preds(sbitmap, sbitmap *, basic_block)
Definition cfganal.cc:1777
int inverted_rev_post_order_compute(struct function *, int *, sbitmap *start_points=0)
Definition cfganal.cc:824
int pre_and_rev_post_order_compute(int *, int *, bool)
Definition cfganal.cc:1075
void add_noreturn_fake_exit_edges(void)
Definition cfganal.cc:601
void verify_marked_backedges(struct function *)
Definition cfganal.cc:148
void verify_no_unreachable_blocks(void)
Definition cfganal.cc:233
void bitmap_intersection_of_succs(sbitmap, sbitmap *, basic_block)
Definition cfganal.cc:1738
bool mark_dfs_back_edges(void)
Definition cfganal.cc:140
edge find_edge(basic_block, basic_block)
Definition cfganal.cc:518
void remove_fake_exit_edges(void)
Definition cfganal.cc:590
basic_block dfs_find_deadend(basic_block)
Definition cfganal.cc:766
int find_edge_index(struct edge_list *, basic_block, basic_block)
Definition cfganal.cc:543
int pre_and_rev_post_order_compute_fn(struct function *, int *, int *, bool)
Definition cfganal.cc:979
edge single_incoming_edge_ignoring_loop_edges(basic_block, bool)
edge single_pred_edge_ignoring_loop_edges(basic_block, bool)
Definition cfganal.cc:1949
void verify_edge_list(FILE *, struct edge_list *)
Definition cfganal.cc:331
int dfs_enumerate_from(basic_block, int, bool(*)(const_basic_block, const void *), basic_block *, int, const void *)
Definition cfganal.cc:1564
void remove_fake_edges(void)
Definition cfganal.cc:579
void free_edge_list(struct edge_list *)
Definition cfganal.cc:292
void find_unreachable_blocks(void)
Definition cfganal.cc:184
int post_order_compute(int *, bool, bool)
Definition cfganal.cc:655
basic_block * single_pred_before_succ_order(void)
Definition cfganal.cc:1895
void compute_dominance_frontiers(class bitmap_head *)
Definition cfganal.cc:1639
void connect_infinite_loops_to_exit(void)
Definition cfganal.cc:622
void bitmap_union_of_succs(sbitmap, sbitmap *, basic_block)
Definition cfganal.cc:1816
void bitmap_union_of_preds(sbitmap, sbitmap *, basic_block)
Definition cfganal.cc:1855
struct edge_list * create_edge_list(void)
Definition cfganal.cc:257
void print_edge_list(FILE *, struct edge_list *)
Definition cfganal.cc:304
Definition bitmap.h:328
Definition cfganal.h:35
basic_block get_edge_src(int)
Definition cfganal.cc:500
Definition cfganal.cc:441
void clear_control_dependence_bitmap(basic_block)
Definition cfganal.cc:411
void set_control_dependence_map_bit(basic_block, int)
Definition cfganal.cc:400
basic_block get_edge_dest(int)
Definition cfganal.cc:508
vec< bitmap_head > control_dependence_map
Definition cfganal.h:47
vec< std::pair< int, int > > m_el
Definition cfganal.h:48
void find_control_dependence(int)
Definition cfganal.cc:420
bitmap_obstack m_bitmaps
Definition cfganal.h:49
bitmap get_edges_dependent_on(int)
Definition cfganal.cc:492
Definition cfganal.cc:482
class edge_def * edge
Definition coretypes.h:343
class bitmap_head * bitmap
Definition coretypes.h:51
Definition basic-block.h:117
Definition bitmap.h:294
Definition cfganal.h:27
edge * index_to_edge
Definition cfganal.h:29
int num_edges
Definition cfganal.h:28
Definition function.h:249
Definition sbitmap.h:87
Definition vec.h:450