1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
/* Communication between registering jump thread requests and
updating the SSA/CFG for jump threading.
Copyright (C) 2013-2021 Free Software Foundation, Inc.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
any later version.
GCC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#ifndef _TREE_SSA_THREADUPDATE_H
#define _TREE_SSA_THREADUPDATE_H 1
enum jump_thread_edge_type
{
EDGE_START_JUMP_THREAD,
EDGE_FSM_THREAD,
EDGE_COPY_SRC_BLOCK,
EDGE_COPY_SRC_JOINER_BLOCK,
EDGE_NO_COPY_SRC_BLOCK
};
// We keep the registered jump threading opportunities in this
// vector as edge pairs (original_edge, target_edge).
class jump_thread_edge
{
public:
jump_thread_edge (edge e, jump_thread_edge_type t) : e (e), type (t) {}
edge e;
jump_thread_edge_type type;
};
class jump_thread_path_allocator
{
public:
jump_thread_path_allocator ();
~jump_thread_path_allocator ();
jump_thread_edge *allocate_thread_edge (edge, jump_thread_edge_type);
vec<jump_thread_edge *> *allocate_thread_path ();
private:
DISABLE_COPY_AND_ASSIGN (jump_thread_path_allocator);
obstack m_obstack;
};
// This is the underlying jump thread registry. When all candidates
// have been registered with register_jump_thread(),
// thread_through_all_blocks() is called to actually change the CFG.
class jump_thread_path_registry
{
public:
jump_thread_path_registry ();
~jump_thread_path_registry ();
bool register_jump_thread (vec<jump_thread_edge *> *);
void remove_jump_threads_including (edge);
bool thread_through_all_blocks (bool);
jump_thread_edge *allocate_thread_edge (edge e, jump_thread_edge_type t);
vec<jump_thread_edge *> *allocate_thread_path ();
void dump ();
private:
void debug_path (FILE *, int pathno);
void mark_threaded_blocks (bitmap threaded_blocks);
bool rewire_first_differing_edge (unsigned path_num, unsigned edge_num);
void adjust_paths_after_duplication (unsigned curr_path_num);
bool duplicate_thread_path (edge entry,
edge exit,
basic_block *region,
unsigned n_region,
unsigned current_path_no);
bool thread_block_1 (basic_block, bool noloop_only, bool joiners);
bool thread_block (basic_block, bool noloop_only);
bool thread_through_loop_header (class loop *loop,
bool may_peel_loop_headers);
class redirection_data *lookup_redirection_data (edge e, enum insert_option);
vec<vec<jump_thread_edge *> *> m_paths;
hash_table<struct removed_edges> *m_removed_edges;
// Main data structure to hold information for duplicates of BB.
hash_table<redirection_data> *m_redirection_data;
// Jump threading statistics.
unsigned long m_num_threaded_edges;
jump_thread_path_allocator m_allocator;
};
// Rather than search all the edges in jump thread paths each time DOM
// is able to simply if control statement, we build a hash table with
// the deleted edges. We only care about the address of the edge, not
// its contents.
struct removed_edges : nofree_ptr_hash<edge_def>
{
static hashval_t hash (edge e) { return htab_hash_pointer (e); }
static bool equal (edge e1, edge e2) { return e1 == e2; }
};
extern unsigned int estimate_threading_killed_stmts (basic_block);
enum bb_dom_status
{
/* BB does not dominate latch of the LOOP. */
DOMST_NONDOMINATING,
/* The LOOP is broken (there is no path from the header to its latch. */
DOMST_LOOP_BROKEN,
/* BB dominates the latch of the LOOP. */
DOMST_DOMINATING
};
enum bb_dom_status determine_bb_domination_status (class loop *, basic_block);
// In tree-ssa-dom.c.
extern void free_dom_edge_info (edge);
#endif
|
