]>
Commit | Line | Data |
---|---|---|
d8a2d370 | 1 | /* Fold a constant sub-tree into a single node for C-compiler |
8d9254fc | 2 | Copyright (C) 1987-2020 Free Software Foundation, Inc. |
d8a2d370 DN |
3 | |
4 | This file is part of GCC. | |
5 | ||
6 | GCC is free software; you can redistribute it and/or modify it under | |
7 | the terms of the GNU General Public License as published by the Free | |
8 | Software Foundation; either version 3, or (at your option) any later | |
9 | version. | |
10 | ||
11 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
12 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with GCC; see the file COPYING3. If not see | |
18 | <http://www.gnu.org/licenses/>. */ | |
19 | ||
20 | #ifndef GCC_FOLD_CONST_H | |
21 | #define GCC_FOLD_CONST_H | |
22 | ||
23 | /* Non-zero if we are folding constants inside an initializer; zero | |
24 | otherwise. */ | |
25 | extern int folding_initializer; | |
26 | ||
27 | /* Convert between trees and native memory representation. */ | |
b2505143 | 28 | extern int native_encode_expr (const_tree, unsigned char *, int, int off = -1); |
d8a2d370 DN |
29 | extern tree native_interpret_expr (tree, const unsigned char *, int); |
30 | ||
31 | /* Fold constants as much as possible in an expression. | |
32 | Returns the simplified expression. | |
33 | Acts only on the top level of the expression; | |
34 | if the argument itself cannot be simplified, its | |
35 | subexpressions are not changed. */ | |
36 | ||
37 | extern tree fold (tree); | |
38 | #define fold_unary(CODE,T1,T2)\ | |
39 | fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2) | |
40 | extern tree fold_unary_loc (location_t, enum tree_code, tree, tree); | |
41 | #define fold_unary_ignore_overflow(CODE,T1,T2)\ | |
42 | fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2) | |
43 | extern tree fold_unary_ignore_overflow_loc (location_t, enum tree_code, tree, tree); | |
44 | #define fold_binary(CODE,T1,T2,T3)\ | |
45 | fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3) | |
46 | extern tree fold_binary_loc (location_t, enum tree_code, tree, tree, tree); | |
47 | #define fold_ternary(CODE,T1,T2,T3,T4)\ | |
48 | fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4) | |
49 | extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree); | |
50 | #define fold_build1(c,t1,t2)\ | |
226b8289 TS |
51 | fold_build1_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO) |
52 | extern tree fold_build1_loc (location_t, enum tree_code, tree, | |
53 | tree CXX_MEM_STAT_INFO); | |
d8a2d370 | 54 | #define fold_build2(c,t1,t2,t3)\ |
226b8289 TS |
55 | fold_build2_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO) |
56 | extern tree fold_build2_loc (location_t, enum tree_code, tree, tree, | |
57 | tree CXX_MEM_STAT_INFO); | |
d8a2d370 | 58 | #define fold_build3(c,t1,t2,t3,t4)\ |
226b8289 TS |
59 | fold_build3_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO) |
60 | extern tree fold_build3_loc (location_t, enum tree_code, tree, tree, tree, | |
61 | tree CXX_MEM_STAT_INFO); | |
d8a2d370 DN |
62 | extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree); |
63 | extern tree fold_build2_initializer_loc (location_t, enum tree_code, tree, tree, tree); | |
64 | #define fold_build_call_array(T1,T2,N,T4)\ | |
65 | fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4) | |
66 | extern tree fold_build_call_array_loc (location_t, tree, tree, int, tree *); | |
67 | #define fold_build_call_array_initializer(T1,T2,N,T4)\ | |
68 | fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4) | |
69 | extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *); | |
831e688a RB |
70 | extern tree get_array_ctor_element_at_index (tree, offset_int, |
71 | unsigned * = NULL); | |
d8a2d370 DN |
72 | extern bool fold_convertible_p (const_tree, const_tree); |
73 | #define fold_convert(T1,T2)\ | |
74 | fold_convert_loc (UNKNOWN_LOCATION, T1, T2) | |
75 | extern tree fold_convert_loc (location_t, tree, tree); | |
76 | extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree); | |
77 | extern tree fold_ignored_result (tree); | |
78 | extern tree fold_abs_const (tree, tree); | |
79 | extern tree fold_indirect_ref_1 (location_t, tree, tree); | |
80 | extern void fold_defer_overflow_warnings (void); | |
355fe088 | 81 | extern void fold_undefer_overflow_warnings (bool, const gimple *, int); |
d8a2d370 DN |
82 | extern void fold_undefer_and_ignore_overflow_warnings (void); |
83 | extern bool fold_deferring_overflow_warnings_p (void); | |
a8b85ce9 | 84 | extern void fold_overflow_warning (const char*, enum warn_strict_overflow_code); |
8d1628eb JJ |
85 | extern enum tree_code fold_div_compare (enum tree_code, tree, tree, |
86 | tree *, tree *, bool *); | |
7f4a8ee0 | 87 | extern bool operand_equal_p (const_tree, const_tree, unsigned int flags = 0); |
d8a2d370 DN |
88 | extern int multiple_of_p (tree, const_tree, const_tree); |
89 | #define omit_one_operand(T1,T2,T3)\ | |
90 | omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3) | |
91 | extern tree omit_one_operand_loc (location_t, tree, tree, tree); | |
92 | #define omit_two_operands(T1,T2,T3,T4)\ | |
93 | omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4) | |
94 | extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree); | |
95 | #define invert_truthvalue(T)\ | |
96 | invert_truthvalue_loc (UNKNOWN_LOCATION, T) | |
97 | extern tree invert_truthvalue_loc (location_t, tree); | |
98 | extern tree fold_unary_to_constant (enum tree_code, tree, tree); | |
99 | extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree); | |
f2901002 JJ |
100 | extern tree fold_bit_and_mask (tree, tree, enum tree_code, |
101 | tree, enum tree_code, tree, tree, | |
102 | tree, enum tree_code, tree, tree, tree *); | |
d8a2d370 | 103 | extern tree fold_read_from_constant_string (tree); |
4f8b89f0 | 104 | extern tree fold_read_from_vector (tree, poly_uint64); |
ebd733a7 RB |
105 | #if GCC_VEC_PERN_INDICES_H |
106 | extern tree fold_vec_perm (tree, tree, tree, const vec_perm_indices &); | |
107 | #endif | |
5f9d2c58 AH |
108 | extern bool wide_int_binop (wide_int &res, enum tree_code, |
109 | const wide_int &arg1, const wide_int &arg2, | |
110 | signop, wi::overflow_type *); | |
111 | extern tree int_const_binop (enum tree_code, const_tree, const_tree, int = 1); | |
d8a2d370 DN |
112 | #define build_fold_addr_expr(T)\ |
113 | build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T)) | |
114 | extern tree build_fold_addr_expr_loc (location_t, tree); | |
115 | #define build_fold_addr_expr_with_type(T,TYPE)\ | |
116 | build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE) | |
117 | extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree); | |
118 | extern tree fold_build_cleanup_point_expr (tree type, tree expr); | |
d8a2d370 DN |
119 | #define build_fold_indirect_ref(T)\ |
120 | build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T) | |
121 | extern tree build_fold_indirect_ref_loc (location_t, tree); | |
122 | #define fold_indirect_ref(T)\ | |
123 | fold_indirect_ref_loc (UNKNOWN_LOCATION, T) | |
124 | extern tree fold_indirect_ref_loc (location_t, tree); | |
125 | extern tree build_simple_mem_ref_loc (location_t, tree); | |
126 | #define build_simple_mem_ref(T)\ | |
127 | build_simple_mem_ref_loc (UNKNOWN_LOCATION, T) | |
aca52e6f | 128 | extern poly_offset_int mem_ref_offset (const_tree); |
36fd6408 | 129 | extern tree build_invariant_address (tree, tree, poly_int64); |
d8a2d370 | 130 | extern tree constant_boolean_node (bool, tree); |
807e902e | 131 | extern tree div_if_zero_remainder (const_tree, const_tree); |
d8a2d370 | 132 | |
14e72812 | 133 | extern bool tree_swap_operands_p (const_tree, const_tree); |
d8a2d370 DN |
134 | extern enum tree_code swap_tree_comparison (enum tree_code); |
135 | ||
f37fac2b | 136 | extern bool ptr_difference_const (tree, tree, poly_int64_pod *); |
d8a2d370 | 137 | extern enum tree_code invert_tree_comparison (enum tree_code, bool); |
2c58d42c | 138 | extern bool inverse_conditions_p (const_tree, const_tree); |
d8a2d370 DN |
139 | |
140 | extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *); | |
141 | extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1, | |
142 | bool *); | |
143 | extern bool tree_single_nonzero_warnv_p (tree, bool *); | |
68e57f04 RS |
144 | extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree, |
145 | bool *, int); | |
d8a2d370 | 146 | extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree, |
68e57f04 RS |
147 | bool *, int); |
148 | extern bool tree_single_nonnegative_warnv_p (tree, bool *, int); | |
1d9da71f RS |
149 | extern bool tree_call_nonnegative_warnv_p (tree, combined_fn, tree, tree, |
150 | bool *, int); | |
d8a2d370 | 151 | |
67dbe582 RS |
152 | extern bool integer_valued_real_unary_p (tree_code, tree, int); |
153 | extern bool integer_valued_real_binary_p (tree_code, tree, tree, int); | |
1d9da71f | 154 | extern bool integer_valued_real_call_p (combined_fn, tree, tree, int); |
67dbe582 RS |
155 | extern bool integer_valued_real_single_p (tree, int); |
156 | extern bool integer_valued_real_p (tree, int = 0); | |
157 | ||
d8a2d370 DN |
158 | extern bool fold_real_zero_addition_p (const_tree, const_tree, int); |
159 | extern tree combine_comparisons (location_t, enum tree_code, enum tree_code, | |
160 | enum tree_code, tree, tree, tree); | |
161 | extern void debug_fold_checksum (const_tree); | |
162 | extern bool may_negate_without_overflow_p (const_tree); | |
163 | #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N) | |
605f12f4 | 164 | extern tree round_up_loc (location_t, tree, unsigned int); |
d8a2d370 DN |
165 | #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N) |
166 | extern tree round_down_loc (location_t, tree, int); | |
36fd6408 | 167 | extern tree size_int_kind (poly_int64, enum size_type_kind); |
d8a2d370 DN |
168 | #define size_binop(CODE,T1,T2)\ |
169 | size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2) | |
170 | extern tree size_binop_loc (location_t, enum tree_code, tree, tree); | |
171 | #define size_diffop(T1,T2)\ | |
172 | size_diffop_loc (UNKNOWN_LOCATION, T1, T2) | |
173 | extern tree size_diffop_loc (location_t, tree, tree); | |
174 | ||
175 | /* Return an expr equal to X but certainly not valid as an lvalue. */ | |
176 | #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T) | |
177 | extern tree non_lvalue_loc (location_t, tree); | |
178 | ||
e36c1cfe | 179 | extern bool tree_expr_nonzero_p (tree); |
d8a2d370 | 180 | extern bool tree_expr_nonnegative_p (tree); |
68e57f04 | 181 | extern bool tree_expr_nonnegative_warnv_p (tree, bool *, int = 0); |
d8a2d370 DN |
182 | extern tree make_range (tree, int *, tree *, tree *, bool *); |
183 | extern tree make_range_step (location_t, enum tree_code, tree, tree, tree, | |
184 | tree *, tree *, int *, bool *); | |
8d1628eb | 185 | extern tree range_check_type (tree); |
d8a2d370 DN |
186 | extern tree build_range_check (location_t, tree, tree, int, tree, tree); |
187 | extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int, | |
188 | tree, tree); | |
a7f24614 RB |
189 | extern tree sign_bit_p (tree, const_tree); |
190 | extern tree exact_inverse (tree, tree); | |
20b8d734 | 191 | extern bool expr_not_equal_to (tree t, const wide_int &); |
8006f46b RB |
192 | extern tree const_unop (enum tree_code, tree, tree); |
193 | extern tree const_binop (enum tree_code, tree, tree, tree); | |
1d9da71f | 194 | extern bool negate_mathfn_p (combined_fn); |
d01b568a | 195 | extern const char *c_getstr (tree, unsigned HOST_WIDE_INT * = NULL); |
ba6557e2 | 196 | extern wide_int tree_nonzero_bits (const_tree); |
d8a2d370 | 197 | |
40e23961 MC |
198 | /* Return OFF converted to a pointer offset type suitable as offset for |
199 | POINTER_PLUS_EXPR. Use location LOC for this conversion. */ | |
200 | extern tree convert_to_ptrofftype_loc (location_t loc, tree off); | |
201 | ||
202 | #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t) | |
203 | ||
204 | /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */ | |
205 | extern tree fold_build_pointer_plus_loc (location_t loc, tree ptr, tree off); | |
206 | ||
207 | #define fold_build_pointer_plus(p,o) \ | |
208 | fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o) | |
209 | ||
210 | /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */ | |
211 | extern tree fold_build_pointer_plus_hwi_loc (location_t loc, tree ptr, HOST_WIDE_INT off); | |
212 | ||
213 | #define fold_build_pointer_plus_hwi(p,o) \ | |
214 | fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o) | |
7f4a8ee0 ML |
215 | |
216 | ||
217 | /* Class used to compare gimple operands. */ | |
218 | ||
219 | class operand_compare | |
220 | { | |
221 | public: | |
222 | /* Return true if two operands are equal. The flags fields can be used | |
223 | to specify OEP flags described above. */ | |
224 | virtual bool operand_equal_p (const_tree, const_tree, unsigned int flags); | |
225 | ||
226 | /* Generate a hash value for an expression. This can be used iteratively | |
227 | by passing a previous result as the HSTATE argument. */ | |
228 | virtual void hash_operand (const_tree, inchash::hash &, unsigned flags); | |
229 | ||
230 | protected: | |
231 | /* Verify that when arguments (ARG0 and ARG1) are equal, then they have | |
232 | an equal hash value. When the function knowns comparison return, | |
233 | true is returned. Then RET is set to corresponding comparsion result. */ | |
234 | bool verify_hash_value (const_tree arg0, const_tree arg1, unsigned int flags, | |
235 | bool *ret); | |
236 | }; | |
237 | ||
d8a2d370 | 238 | #endif // GCC_FOLD_CONST_H |