]> git.ipfire.org Git - thirdparty/gcc.git/blame - gcc/vr-values.h
Put the CL into the right dir.
[thirdparty/gcc.git] / gcc / vr-values.h
CommitLineData
8302eff5 1/* Support routines for Value Range Propagation (VRP).
fbd26352 2 Copyright (C) 2016-2019 Free Software Foundation, Inc.
8302eff5 3
4This file is part of GCC.
5
6GCC is free software; you can redistribute it and/or modify
7it under the terms of the GNU General Public License as published by
8the Free Software Foundation; either version 3, or (at your option)
9any later version.
10
11GCC is distributed in the hope that it will be useful,
12but WITHOUT ANY WARRANTY; without even the implied warranty of
13MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14GNU General Public License for 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#ifndef GCC_VR_VALUES_H
21#define GCC_VR_VALUES_H
22
23/* The VR_VALUES class holds the current view of range information
24 for all the SSA_NAMEs in the IL.
25
26 It can be used to hold context sensitive range information during
27 a dominator walk or it may be used to hold range information in the
28 standard VRP pass as ranges are propagated through the lattice to a
29 steady state.
30
31 This information is independent of the range information that gets
32 attached to SSA_NAMEs. A pass such as VRP may choose to transfer
33 the global information it produces into global range information that
34 gets attached to an SSA_NAME. It's unclear how useful that global
35 information will be in a world where we can compute context sensitive
36 range information fast or perform on-demand queries. */
37class vr_values
38{
39 public:
40 vr_values (void);
41 ~vr_values (void);
42
448df21a 43 const value_range *get_value_range (const_tree);
c561e1e7 44 void set_vr_value (tree, value_range *);
d6f839ac 45 value_range *swap_vr_value (tree, value_range *);
46
448df21a 47 void set_def_to_varying (const_tree);
c561e1e7 48 void set_defs_to_varying (gimple *);
49 bool update_value_range (const_tree, value_range *);
50 tree op_with_constant_singleton_value_range (tree);
2e966e2a 51 void adjust_range_with_scev (value_range *, class loop *, gimple *, tree);
c561e1e7 52 tree vrp_evaluate_conditional (tree_code, tree, tree, gimple *);
53 void dump_all_value_ranges (FILE *);
54
55 void extract_range_for_var_from_comparison_expr (tree, enum tree_code,
56 tree, tree, value_range *);
57 void extract_range_from_phi_node (gphi *, value_range *);
58 void extract_range_basic (value_range *, gimple *);
c561e1e7 59 void extract_range_from_stmt (gimple *, edge *, tree *, value_range *);
60
61 void vrp_visit_cond_stmt (gcond *, edge *);
62
63 void simplify_cond_using_ranges_2 (gcond *);
64 bool simplify_stmt_using_ranges (gimple_stmt_iterator *);
65
2e1f26dd 66 /* Indicate that propagation through the lattice is complete. */
67 void set_lattice_propagation_complete (void) { values_propagated = true; }
8302eff5 68
2e1f26dd 69 /* Allocate a new value_range object. */
70 value_range *allocate_value_range (void)
71 { return vrp_value_range_pool.allocate (); }
d6f839ac 72 void free_value_range (value_range *vr)
73 { vrp_value_range_pool.remove (vr); }
8302eff5 74
d443f534 75 /* */
76 void cleanup_edges_and_switches (void);
77
c561e1e7 78 private:
448df21a 79 value_range *get_lattice_entry (const_tree);
8302eff5 80 bool vrp_stmt_computes_nonzero (gimple *);
8302eff5 81 bool op_with_boolean_value_range_p (tree);
82 bool check_for_binary_op_overflow (enum tree_code, tree, tree, tree, bool *);
448df21a 83 const value_range *get_vr_for_comparison (int, value_range *);
8302eff5 84 tree compare_name_with_value (enum tree_code, tree, tree, bool *, bool);
85 tree compare_names (enum tree_code, tree, tree, bool *);
86 bool two_valued_val_range_p (tree, tree *, tree *);
8302eff5 87 tree vrp_evaluate_conditional_warnv_with_ops_using_ranges (enum tree_code,
88 tree, tree,
89 bool *);
90 tree vrp_evaluate_conditional_warnv_with_ops (enum tree_code,
91 tree, tree, bool,
92 bool *, bool *);
2e1f26dd 93 void extract_range_from_assignment (value_range *, gassign *);
8302eff5 94 void extract_range_from_assert (value_range *, tree);
95 void extract_range_from_ssa_name (value_range *, tree);
96 void extract_range_from_binary_expr (value_range *, enum tree_code,
97 tree, tree, tree);
98 void extract_range_from_unary_expr (value_range *, enum tree_code,
99 tree, tree);
8302eff5 100 void extract_range_from_cond_expr (value_range *, gassign *);
8302eff5 101 void extract_range_from_comparison (value_range *, enum tree_code,
102 tree, tree, tree);
8302eff5 103 void vrp_visit_assignment_or_call (gimple*, tree *, value_range *);
104 void vrp_visit_switch_stmt (gswitch *, edge *);
8302eff5 105 bool simplify_truth_ops_using_ranges (gimple_stmt_iterator *, gimple *);
106 bool simplify_div_or_mod_using_ranges (gimple_stmt_iterator *, gimple *);
107 bool simplify_abs_using_ranges (gimple_stmt_iterator *, gimple *);
108 bool simplify_bit_ops_using_ranges (gimple_stmt_iterator *, gimple *);
109 bool simplify_min_or_max_using_ranges (gimple_stmt_iterator *, gimple *);
110 bool simplify_cond_using_ranges_1 (gcond *);
8302eff5 111 bool simplify_switch_using_ranges (gswitch *);
112 bool simplify_float_conversion_using_ranges (gimple_stmt_iterator *,
113 gimple *);
114 bool simplify_internal_call_using_ranges (gimple_stmt_iterator *, gimple *);
c561e1e7 115
2e1f26dd 116 /* Allocation pools for value_range objects. */
117 object_allocator<value_range> vrp_value_range_pool;
118
119 /* This probably belongs in the lattice rather than in here. */
120 bool values_propagated;
121
122 /* Allocations for equivalences all come from this obstack. */
123 bitmap_obstack vrp_equiv_obstack;
124
c561e1e7 125 /* Value range array. After propagation, VR_VALUE[I] holds the range
126 of values that SSA name N_I may take. */
127 unsigned int num_vr_values;
128 value_range **vr_value;
129
130 /* For a PHI node which sets SSA name N_I, VR_COUNTS[I] holds the
131 number of executable edges we saw the last time we visited the
132 node. */
133 int *vr_phi_edge_counts;
d443f534 134
135 /* Vectors of edges that need removing and switch statements that
136 need updating. It is expected that a pass using the simplification
137 routines will, at the end of the pass, clean up the edges and
138 switch statements. The class dtor will try to detect cases
139 that do not follow that expectation. */
140 struct switch_update {
141 gswitch *stmt;
142 tree vec;
143 };
144
145 vec<edge> to_remove_edges;
146 vec<switch_update> to_update_switch_stmts;
8302eff5 147};
148
46bc42c6 149extern tree get_output_for_vrp (gimple *);
8302eff5 150#endif /* GCC_VR_VALUES_H */