1/* Control flow graph analysis header file.
2   Copyright (C) 2014-2015 Free Software Foundation, Inc.
3
4This file is part of GCC.
5
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
9version.
10
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.
15
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/>.  */
19
20
21#ifndef GCC_CFGANAL_H
22#define GCC_CFGANAL_H
23
24/* This structure maintains an edge list vector.  */
25/* FIXME: Make this a vec<edge>.  */
26struct edge_list
27{
28  int num_edges;
29  edge *index_to_edge;
30};
31
32
33/* Class to compute and manage control dependences on an edge-list.  */
34class control_dependences
35{
36public:
37  control_dependences (edge_list *);
38  ~control_dependences ();
39  bitmap get_edges_dependent_on (int);
40  edge get_edge (int);
41
42private:
43  void set_control_dependence_map_bit (basic_block, int);
44  void clear_control_dependence_bitmap (basic_block);
45  void find_control_dependence (int);
46  vec<bitmap> control_dependence_map;
47  edge_list *m_el;
48};
49
50extern bool mark_dfs_back_edges (void);
51extern void find_unreachable_blocks (void);
52struct edge_list * create_edge_list (void);
53void free_edge_list (struct edge_list *);
54void print_edge_list (FILE *, struct edge_list *);
55void verify_edge_list (FILE *, struct edge_list *);
56edge find_edge (basic_block, basic_block);
57int find_edge_index (struct edge_list *, basic_block, basic_block);
58extern void remove_fake_edges (void);
59extern void remove_fake_exit_edges (void);
60extern void add_noreturn_fake_exit_edges (void);
61extern void connect_infinite_loops_to_exit (void);
62extern int post_order_compute (int *, bool, bool);
63extern basic_block dfs_find_deadend (basic_block);
64extern int inverted_post_order_compute (int *);
65extern int pre_and_rev_post_order_compute_fn (struct function *,
66					      int *, int *, bool);
67extern int pre_and_rev_post_order_compute (int *, int *, bool);
68extern int dfs_enumerate_from (basic_block, int,
69			       bool (*)(const_basic_block, const void *),
70			       basic_block *, int, const void *);
71extern void compute_dominance_frontiers (struct bitmap_head *);
72extern bitmap compute_idf (bitmap, struct bitmap_head *);
73extern void bitmap_intersection_of_succs (sbitmap, sbitmap *, basic_block);
74extern void bitmap_intersection_of_preds (sbitmap, sbitmap *, basic_block);
75extern void bitmap_union_of_succs (sbitmap, sbitmap *, basic_block);
76extern void bitmap_union_of_preds (sbitmap, sbitmap *, basic_block);
77extern basic_block * single_pred_before_succ_order (void);
78
79#endif /* GCC_CFGANAL_H */
80