| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | cfghooks.h | 79 void (*dump_bb) (FILE *, basic_block, int, dump_flags_t);
80 void (*dump_bb_for_graph) (pretty_printer *, basic_block);
85 basic_block (*create_basic_block) (void *head, void *end, basic_block after);
91 edge (*redirect_edge_and_branch) (edge e, basic_block b);
96 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
103 void (*delete_basic_block) (basic_block);
107 basic_block (*split_block) (basic_block b, void * i);
110 bool (*move_block_after) (basic_block b, basic_block a);
113 bool (*can_merge_blocks_p) (basic_block a, basic_block b);
116 void (*merge_blocks) (basic_block a, basic_block b);
[all …]
|
| H A D | dominance.h | 40 vec<basic_block>);
45 vec<basic_block>);
46 extern basic_block get_immediate_dominator (enum cdi_direction, basic_block);
47 extern void set_immediate_dominator (enum cdi_direction, basic_block,
48 basic_block);
49 extern vec<basic_block> get_dominated_by (enum cdi_direction, basic_block);
50 extern vec<basic_block> get_dominated_by_region (enum cdi_direction,
51 basic_block *,
53 extern vec<basic_block> get_dominated_to_depth (enum cdi_direction,
54 basic_block, int);
[all …]
|
| H A D | tree-cfg.h | 36 extern basic_block label_to_block (struct function *, tree);
41 extern basic_block single_noncomplex_succ (basic_block bb);
44 extern edge find_taken_edge (basic_block, tree);
45 extern void gimple_debug_bb (basic_block);
46 extern basic_block gimple_debug_bb_n (int);
53 extern basic_block get_abnormal_succ_dispatcher (basic_block);
61 extern gphi *get_virtual_phi (basic_block);
62 extern gimple *first_stmt (basic_block);
63 extern gimple *last_stmt (basic_block);
64 extern gimple *last_and_only_stmt (basic_block);
[all …]
|
| H A D | cfg.h | 41 basic_block x_entry_block_ptr;
42 basic_block x_exit_block_ptr;
45 vec<basic_block, va_gc> *x_basic_block_info;
61 vec<basic_block, va_gc> *x_label_to_block_map;
86 extern basic_block alloc_block (void);
87 extern void link_block (basic_block, basic_block);
88 extern void unlink_block (basic_block);
90 extern void expunge_block (basic_block);
91 extern edge unchecked_make_edge (basic_block, basic_block, int);
92 extern edge cached_make_edge (sbitmap, basic_block, basic_block, int);
[all …]
|
| H A D | cfganal.h | 40 basic_block get_edge_src (int);
41 basic_block get_edge_dest (int);
44 void set_control_dependence_map_bit (basic_block, int);
45 void clear_control_dependence_bitmap (basic_block);
58 edge find_edge (basic_block, basic_block);
59 int find_edge_index (struct edge_list *, basic_block, basic_block);
65 extern basic_block dfs_find_deadend (basic_block);
73 extern int dfs_enumerate_from (basic_block, int,
75 basic_block *, int, const void *);
78 extern void bitmap_intersection_of_succs (sbitmap, sbitmap *, basic_block);
[all …]
|
| H A D | cfgrtl.h | 26 extern basic_block create_basic_block_structure (rtx_insn *, rtx_insn *,
27 rtx_note *, basic_block);
31 extern void update_bb_for_insn (basic_block);
34 extern bool can_fallthru (basic_block, basic_block);
35 extern rtx_note *bb_note (basic_block);
36 extern rtx_code_label *block_label (basic_block);
37 extern edge try_redirect_by_replacing_jump (edge, basic_block, bool);
38 extern void emit_barrier_after_bb (basic_block bb);
39 extern basic_block force_nonfallthru_and_redirect (edge, basic_block, rtx);
44 extern void update_br_prob_note (basic_block);
[all …]
|
| H A D | dominance.c | 63 dom_info (vec <basic_block>, cdi_direction);
68 inline basic_block get_idom (basic_block);
70 void calc_dfs_tree_nonrec (basic_block);
116 basic_block *m_dfs_to_bb;
135 basic_block m_start_block;
137 basic_block m_end_block;
143 void debug_dominance_tree (cdi_direction, basic_block);
183 m_dfs_to_bb = new_zero_array <basic_block> (num); in dom_init()
222 dom_info::dom_info (vec<basic_block> region, cdi_direction dir) in dom_info()
258 inline basic_block
[all …]
|
| H A D | tree-switch-conversion.h | 51 cluster (tree case_label_expr, basic_block case_bb, profile_probability prob,
74 virtual void emit (tree, tree, tree, basic_block, location_t) = 0;
97 basic_block m_case_bb;
110 cluster::cluster (tree case_label_expr, basic_block case_bb, in cluster()
125 basic_block case_bb, profile_probability prob);
167 void emit (tree, tree, tree, basic_block, location_t) in emit() argument
188 basic_block case_bb, profile_probability prob): in simple_cluster()
253 tree default_label_expr, basic_block default_bb, location_t loc);
371 tree default_label_expr, basic_block default_bb, location_t loc);
409 static basic_block hoist_edge_and_branch_if_true (gimple_stmt_iterator *gsip,
[all …]
|
| H A D | cfghooks.c | 103 basic_block bb, last_bb_seen; in verify_flow_info()
104 basic_block *last_visited; in verify_flow_info()
107 last_visited = XCNEWVEC (basic_block, last_basic_block_for_fn (cfun)); in verify_flow_info()
281 dump_bb (FILE *outf, basic_block bb, int indent, dump_flags_t flags) in dump_bb()
308 debug_slim (basic_block ptr) in debug_slim()
324 dump_bb_for_graph (pretty_printer *pp, basic_block bb) in DEFINE_DEBUG_HASH_SET()
341 basic_block bb; in dump_flow_info()
365 redirect_edge_and_branch (edge e, basic_block dest) in redirect_edge_and_branch()
407 basic_block src = e->src; in remove_branch()
454 redirect_edge_succ_nodup (edge e, basic_block new_succ) in redirect_edge_succ_nodup()
[all …]
|
| H A D | cfg.c | 101 basic_block bb; in clear_edges()
123 basic_block
126 basic_block bb; in alloc_block()
134 link_block (basic_block b, basic_block after) in link_block()
144 unlink_block (basic_block b) in unlink_block()
165 basic_block bb; in compact_blocks()
185 expunge_block (basic_block b) in expunge_block()
211 basic_block dest = e->dest; in connect_dest()
222 basic_block src = e->src; in disconnect_src()
246 basic_block dest = e->dest; in disconnect_dest()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | cfghooks.h | 82 void (*dump_bb) (FILE *, basic_block, int, dump_flags_t);
83 void (*dump_bb_for_graph) (pretty_printer *, basic_block);
88 basic_block (*create_basic_block) (void *head, void *end, basic_block after);
94 edge (*redirect_edge_and_branch) (edge e, basic_block b);
99 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
106 void (*delete_basic_block) (basic_block);
110 basic_block (*split_block) (basic_block b, void * i);
113 bool (*move_block_after) (basic_block b, basic_block a);
116 bool (*can_merge_blocks_p) (basic_block a, basic_block b);
119 void (*merge_blocks) (basic_block a, basic_block b);
[all …]
|
| H A D | tree-cfg.h | 36 extern basic_block label_to_block (struct function *, tree);
41 extern basic_block single_noncomplex_succ (basic_block bb);
44 extern edge find_taken_edge (basic_block, tree);
45 extern void gimple_debug_bb (basic_block);
46 extern basic_block gimple_debug_bb_n (int);
53 extern basic_block get_abnormal_succ_dispatcher (basic_block);
61 extern gphi *get_virtual_phi (basic_block);
62 extern gimple *first_stmt (basic_block);
63 extern gimple *last_stmt (basic_block);
64 extern gimple *last_and_only_stmt (basic_block);
[all …]
|
| H A D | dominance.h | 40 vec<basic_block>);
45 vec<basic_block>);
46 extern basic_block get_immediate_dominator (enum cdi_direction, basic_block);
47 extern void set_immediate_dominator (enum cdi_direction, basic_block,
48 basic_block);
49 extern auto_vec<basic_block> get_dominated_by (enum cdi_direction, basic_block);
50 extern auto_vec<basic_block> get_dominated_by_region (enum cdi_direction,
51 basic_block *,
53 extern auto_vec<basic_block> get_dominated_to_depth (enum cdi_direction,
54 basic_block, int);
[all …]
|
| H A D | cfg.h | 41 basic_block x_entry_block_ptr;
42 basic_block x_exit_block_ptr;
45 vec<basic_block, va_gc> *x_basic_block_info;
61 vec<basic_block, va_gc> *x_label_to_block_map;
86 extern basic_block alloc_block (void);
87 extern void link_block (basic_block, basic_block);
88 extern void unlink_block (basic_block);
90 extern void expunge_block (basic_block);
91 extern edge unchecked_make_edge (basic_block, basic_block, int);
92 extern edge cached_make_edge (sbitmap, basic_block, basic_block, int);
[all …]
|
| H A D | value-relation.h | 87 virtual const_bitmap equiv_set (tree, basic_block) = 0;
89 virtual void register_relation (basic_block, relation_kind, tree, tree) = 0;
91 virtual relation_kind query_relation (basic_block, tree, tree) = 0;
93 virtual relation_kind query_relation (basic_block, const_bitmap,
96 virtual void dump (FILE *, basic_block) const = 0;
100 void valid_equivs (bitmap b, const_bitmap equivs, basic_block bb);
110 basic_block m_bb; // Block this belongs to
127 const_bitmap equiv_set (tree ssa, basic_block bb);
128 void register_relation (basic_block bb, relation_kind k, tree ssa1,
131 relation_kind query_relation (basic_block, tree, tree);
[all …]
|
| H A D | cfganal.h | 40 basic_block get_edge_src (int);
41 basic_block get_edge_dest (int);
44 void set_control_dependence_map_bit (basic_block, int);
45 void clear_control_dependence_bitmap (basic_block);
61 edge find_edge (basic_block, basic_block);
62 int find_edge_index (struct edge_list *, basic_block, basic_block);
68 extern basic_block dfs_find_deadend (basic_block);
76 extern int dfs_enumerate_from (basic_block, int,
78 basic_block *, int, const void *);
81 extern void bitmap_intersection_of_succs (sbitmap, sbitmap *, basic_block);
[all …]
|
| H A D | cfgrtl.h | 26 extern basic_block create_basic_block_structure (rtx_insn *, rtx_insn *,
27 rtx_note *, basic_block);
31 extern void update_bb_for_insn (basic_block);
34 extern bool can_fallthru (basic_block, basic_block);
35 extern rtx_note *bb_note (basic_block);
36 extern rtx_code_label *block_label (basic_block);
37 extern edge try_redirect_by_replacing_jump (edge, basic_block, bool);
38 extern void emit_barrier_after_bb (basic_block bb);
39 extern basic_block force_nonfallthru_and_redirect (edge, basic_block, rtx);
45 extern void update_br_prob_note (basic_block);
[all …]
|
| H A D | gimple-range-path.h | 37 void compute_ranges (const vec<basic_block> &,
40 void compute_imports (bitmap imports, basic_block exit);
59 bool range_defined_in_block (irange &, tree name, basic_block bb);
60 void compute_ranges_in_block (basic_block bb);
61 void compute_ranges_in_phis (basic_block bb);
62 void adjust_for_non_null_uses (basic_block bb);
64 void compute_outgoing_relations (basic_block bb, basic_block next);
65 void compute_phi_relations (basic_block bb, basic_block prev);
69 bool ssa_defined_in_bb (tree name, basic_block bb);
73 void set_path (const vec<basic_block> &);
[all …]
|
| H A D | dominance.cc | 63 dom_info (vec <basic_block>, cdi_direction);
68 inline basic_block get_idom (basic_block);
70 void calc_dfs_tree_nonrec (basic_block);
116 basic_block *m_dfs_to_bb;
135 basic_block m_start_block;
137 basic_block m_end_block;
143 void debug_dominance_tree (cdi_direction, basic_block);
183 m_dfs_to_bb = new_zero_array <basic_block> (num); in dom_init()
222 dom_info::dom_info (vec<basic_block> region, cdi_direction dir) in dom_info()
258 inline basic_block
[all …]
|
| H A D | tree-switch-conversion.h | 51 inline cluster (tree case_label_expr, basic_block case_bb,
74 virtual void emit (tree, tree, tree, basic_block, location_t) = 0;
97 basic_block m_case_bb;
110 cluster::cluster (tree case_label_expr, basic_block case_bb, in cluster()
125 basic_block case_bb, profile_probability prob,
173 void emit (tree, tree, tree, basic_block, location_t) in emit() argument
204 basic_block case_bb, profile_probability prob, in simple_cluster()
270 tree default_label_expr, basic_block default_bb, location_t loc);
391 tree default_label_expr, basic_block default_bb, location_t loc);
429 static basic_block hoist_edge_and_branch_if_true (gimple_stmt_iterator *gsip,
[all …]
|
| H A D | cfghooks.cc | 106 basic_block bb, last_bb_seen; in verify_flow_info()
107 basic_block *last_visited; in verify_flow_info()
110 last_visited = XCNEWVEC (basic_block, last_basic_block_for_fn (cfun)); in verify_flow_info()
297 dump_bb (FILE *outf, basic_block bb, int indent, dump_flags_t flags) in dump_bb()
324 debug_slim (basic_block ptr) in debug_slim()
340 dump_bb_for_graph (pretty_printer *pp, basic_block bb) in DEFINE_DEBUG_HASH_SET()
357 basic_block bb; in dump_flow_info()
381 redirect_edge_and_branch (edge e, basic_block dest) in redirect_edge_and_branch()
423 basic_block src = e->src; in remove_branch()
470 redirect_edge_succ_nodup (edge e, basic_block new_succ) in redirect_edge_succ_nodup()
[all …]
|
| H A D | cfg.cc | 99 free_block (basic_block bb) in free_block()
115 basic_block next; in free_cfg()
117 for (basic_block bb = ENTRY_BLOCK_PTR_FOR_FN (fn); bb; bb = next) in free_cfg()
137 basic_block
140 basic_block bb; in alloc_block()
148 link_block (basic_block b, basic_block after) in link_block()
158 unlink_block (basic_block b) in unlink_block()
179 basic_block bb; in compact_blocks()
199 expunge_block (basic_block b) in expunge_block()
225 basic_block dest = e->dest; in connect_dest()
[all …]
|
| H A D | gimple-range-cache.h | 36 bool non_null_deref_p (tree name, basic_block bb, bool search_dom = true);
37 bool adjust_range (irange &r, tree name, basic_block bb,
39 bool set_nonnull (basic_block bb, tree name);
51 non_null_ref::adjust_range (irange &r, tree name, basic_block bb, in adjust_range()
89 void dump (FILE *f, basic_block bb, bool print_varying = true);
129 bool block_range (irange &r, basic_block bb, tree name, bool calc = true);
130 bool range_from_dom (irange &r, tree name, basic_block bb);
136 void propagate_updated_value (tree name, basic_block bb);
139 void update_to_nonnull (basic_block bb, tree name);
143 void dump_bb (FILE *f, basic_block bb);
[all …]
|
| H A D | tree-ssa-threadedge.h | 34 virtual void register_equivs_stmt (gimple *, basic_block,
37 void get_path (vec<basic_block> &);
38 void append_path (basic_block);
43 auto_vec<basic_block> m_blocks;
44 static const basic_block BB_MARKER;
53 virtual tree simplify (gimple *, gimple *, basic_block, jt_state *) = 0;
59 void register_equivs_stmt (gimple *, basic_block, jt_simplifier *) override in register_equivs_stmt() argument
69 tree simplify (gimple *stmt, gimple *, basic_block, jt_state *) override;
76 auto_vec<basic_block> m_path;
89 void thread_outgoing_edges (basic_block);
[all …]
|
| H A D | tracer.cc | 56 static void analyze_bb (basic_block, int *);
58 static edge find_best_successor (basic_block);
59 static edge find_best_predecessor (basic_block);
60 static int find_trace (basic_block, basic_block *);
71 mark_bb_seen (basic_block bb) in mark_bb_seen()
82 bb_seen_p (basic_block bb) in bb_seen_p()
129 analyze_bb (basic_block bb, int *count) in analyze_bb()
161 find_best_successor (basic_block bb) in find_best_successor()
185 find_best_predecessor (basic_block bb) in find_best_predecessor()
211 find_trace (basic_block bb, basic_block *trace) in find_trace()
[all …]
|