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
130
131
132
|
/* Data structures and function declarations for the SSA value propagation
engine.
Copyright (C) 2004-2020 Free Software Foundation, Inc.
Contributed by Diego Novillo <dnovillo@redhat.com>
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_PROPAGATE_H
#define _TREE_SSA_PROPAGATE_H 1
/* If SIM_P is true, statement S will be simulated again. */
static inline void
prop_set_simulate_again (gimple *s, bool visit_p)
{
gimple_set_visited (s, visit_p);
}
/* Return true if statement T should be simulated again. */
static inline bool
prop_simulate_again_p (gimple *s)
{
return gimple_visited_p (s);
}
/* Lattice values used for propagation purposes. Specific instances
of a propagation engine must return these values from the statement
and PHI visit functions to direct the engine. */
enum ssa_prop_result {
/* The statement produces nothing of interest. No edges will be
added to the work lists. */
SSA_PROP_NOT_INTERESTING,
/* The statement produces an interesting value. The set SSA_NAMEs
returned by SSA_PROP_VISIT_STMT should be added to
INTERESTING_SSA_EDGES. If the statement being visited is a
conditional jump, SSA_PROP_VISIT_STMT should indicate which edge
out of the basic block should be marked executable. */
SSA_PROP_INTERESTING,
/* The statement produces a varying (i.e., useless) value and
should not be simulated again. If the statement being visited
is a conditional jump, all the edges coming out of the block
will be considered executable. */
SSA_PROP_VARYING
};
extern bool valid_gimple_rhs_p (tree);
extern void move_ssa_defining_stmt_for_defs (gimple *, gimple *);
extern bool update_gimple_call (gimple_stmt_iterator *, tree, int, ...);
extern bool update_call_from_tree (gimple_stmt_iterator *, tree);
extern bool stmt_makes_single_store (gimple *);
extern bool may_propagate_copy (tree, tree);
extern bool may_propagate_copy_into_stmt (gimple *, tree);
extern bool may_propagate_copy_into_asm (tree);
extern void propagate_value (use_operand_p, tree);
extern void replace_exp (use_operand_p, tree);
extern void propagate_tree_value (tree *, tree);
extern void propagate_tree_value_into_stmt (gimple_stmt_iterator *, tree);
/* Public interface into the SSA propagation engine. Clients should inherit
from this class and provide their own visitors. */
class ssa_propagation_engine
{
public:
virtual ~ssa_propagation_engine (void) { }
/* Virtual functions the clients must provide to visit statements
and phi nodes respectively. */
virtual enum ssa_prop_result visit_stmt (gimple *, edge *, tree *) = 0;
virtual enum ssa_prop_result visit_phi (gphi *) = 0;
/* Main interface into the propagation engine. */
void ssa_propagate (void);
private:
/* Internal implementation details. */
void simulate_stmt (gimple *stmt);
void simulate_block (basic_block);
};
class substitute_and_fold_engine
{
public:
substitute_and_fold_engine (bool fold_all_stmts = false)
: fold_all_stmts (fold_all_stmts) { }
virtual ~substitute_and_fold_engine (void) { }
virtual bool fold_stmt (gimple_stmt_iterator *) { return false; }
virtual tree get_value (tree, gimple *) { return NULL_TREE; }
bool substitute_and_fold (basic_block = NULL);
bool replace_uses_in (gimple *);
bool replace_phi_args_in (gphi *);
virtual void pre_fold_bb (basic_block) { }
virtual void post_fold_bb (basic_block) { }
virtual void pre_fold_stmt (gimple *) { }
virtual void post_new_stmt (gimple *) { }
void propagate_into_phi_args (basic_block);
/* Users like VRP can set this when they want to perform
folding for every propagation. */
bool fold_all_stmts;
// FIXME: These are temporarily used for keeping track of IL changes
// for evrp. They should be removed before merging upstream.
virtual void tmp_stats_remove_stmt (gimple *, tree) { }
virtual void tmp_stats_set_modified (bool) { }
virtual void tmp_stats_changed_phi (gphi *orig_phi ATTRIBUTE_UNUSED,
gphi *new_phi ATTRIBUTE_UNUSED) { }
};
#endif /* _TREE_SSA_PROPAGATE_H */
|
