Remove assertion in get_info_about_necessary_edges
[gcc.git] / gcc / fold-const.h
1 /* Fold a constant sub-tree into a single node for C-compiler
2 Copyright (C) 1987-2020 Free Software Foundation, Inc.
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. */
28 extern int native_encode_expr (const_tree, unsigned char *, int, int off = -1);
29 extern int native_encode_initializer (tree, unsigned char *, int,
30 int off = -1);
31 extern tree native_interpret_expr (tree, const unsigned char *, int);
32 extern bool can_native_interpret_type_p (tree);
33
34 /* Fold constants as much as possible in an expression.
35 Returns the simplified expression.
36 Acts only on the top level of the expression;
37 if the argument itself cannot be simplified, its
38 subexpressions are not changed. */
39
40 extern tree fold (tree);
41 #define fold_unary(CODE,T1,T2)\
42 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
43 extern tree fold_unary_loc (location_t, enum tree_code, tree, tree);
44 #define fold_unary_ignore_overflow(CODE,T1,T2)\
45 fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
46 extern tree fold_unary_ignore_overflow_loc (location_t, enum tree_code, tree, tree);
47 #define fold_binary(CODE,T1,T2,T3)\
48 fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
49 extern tree fold_binary_loc (location_t, enum tree_code, tree, tree, tree);
50 #define fold_ternary(CODE,T1,T2,T3,T4)\
51 fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
52 extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree);
53 #define fold_build1(c,t1,t2)\
54 fold_build1_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
55 extern tree fold_build1_loc (location_t, enum tree_code, tree,
56 tree CXX_MEM_STAT_INFO);
57 #define fold_build2(c,t1,t2,t3)\
58 fold_build2_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
59 extern tree fold_build2_loc (location_t, enum tree_code, tree, tree,
60 tree CXX_MEM_STAT_INFO);
61 #define fold_build3(c,t1,t2,t3,t4)\
62 fold_build3_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
63 extern tree fold_build3_loc (location_t, enum tree_code, tree, tree, tree,
64 tree CXX_MEM_STAT_INFO);
65 extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree);
66 extern tree fold_build2_initializer_loc (location_t, enum tree_code, tree, tree, tree);
67 #define fold_build_call_array(T1,T2,N,T4)\
68 fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
69 extern tree fold_build_call_array_loc (location_t, tree, tree, int, tree *);
70 #define fold_build_call_array_initializer(T1,T2,N,T4)\
71 fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
72 extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *);
73 extern tree get_array_ctor_element_at_index (tree, offset_int,
74 unsigned * = NULL);
75 extern bool fold_convertible_p (const_tree, const_tree);
76 #define fold_convert(T1,T2)\
77 fold_convert_loc (UNKNOWN_LOCATION, T1, T2)
78 extern tree fold_convert_loc (location_t, tree, tree);
79 extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree);
80 extern tree fold_ignored_result (tree);
81 extern tree fold_abs_const (tree, tree);
82 extern tree fold_indirect_ref_1 (location_t, tree, tree);
83 extern void fold_defer_overflow_warnings (void);
84 extern void fold_undefer_overflow_warnings (bool, const gimple *, int);
85 extern void fold_undefer_and_ignore_overflow_warnings (void);
86 extern bool fold_deferring_overflow_warnings_p (void);
87 extern void fold_overflow_warning (const char*, enum warn_strict_overflow_code);
88 extern enum tree_code fold_div_compare (enum tree_code, tree, tree,
89 tree *, tree *, bool *);
90 extern bool operand_equal_p (const_tree, const_tree, unsigned int flags = 0);
91 extern int multiple_of_p (tree, const_tree, const_tree);
92 #define omit_one_operand(T1,T2,T3)\
93 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
94 extern tree omit_one_operand_loc (location_t, tree, tree, tree);
95 #define omit_two_operands(T1,T2,T3,T4)\
96 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
97 extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree);
98 #define invert_truthvalue(T)\
99 invert_truthvalue_loc (UNKNOWN_LOCATION, T)
100 extern tree invert_truthvalue_loc (location_t, tree);
101 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
102 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
103 extern tree fold_bit_and_mask (tree, tree, enum tree_code,
104 tree, enum tree_code, tree, tree,
105 tree, enum tree_code, tree, tree, tree *);
106 extern tree fold_read_from_constant_string (tree);
107 extern tree fold_read_from_vector (tree, poly_uint64);
108 #if GCC_VEC_PERN_INDICES_H
109 extern tree fold_vec_perm (tree, tree, tree, const vec_perm_indices &);
110 #endif
111 extern bool wide_int_binop (wide_int &res, enum tree_code,
112 const wide_int &arg1, const wide_int &arg2,
113 signop, wi::overflow_type *);
114 extern tree int_const_binop (enum tree_code, const_tree, const_tree, int = 1);
115 #define build_fold_addr_expr(T)\
116 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
117 extern tree build_fold_addr_expr_loc (location_t, tree);
118 #define build_fold_addr_expr_with_type(T,TYPE)\
119 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
120 extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree);
121 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
122 #define build_fold_indirect_ref(T)\
123 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
124 extern tree build_fold_indirect_ref_loc (location_t, tree);
125 #define fold_indirect_ref(T)\
126 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
127 extern tree fold_indirect_ref_loc (location_t, tree);
128 extern tree build_simple_mem_ref_loc (location_t, tree);
129 #define build_simple_mem_ref(T)\
130 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
131 extern poly_offset_int mem_ref_offset (const_tree);
132 extern tree build_invariant_address (tree, tree, poly_int64);
133 extern tree constant_boolean_node (bool, tree);
134 extern tree div_if_zero_remainder (const_tree, const_tree);
135
136 extern bool tree_swap_operands_p (const_tree, const_tree);
137 extern enum tree_code swap_tree_comparison (enum tree_code);
138
139 extern bool ptr_difference_const (tree, tree, poly_int64_pod *);
140 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
141 extern bool inverse_conditions_p (const_tree, const_tree);
142
143 extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
144 extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
145 bool *);
146 extern bool tree_single_nonzero_warnv_p (tree, bool *);
147 extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree,
148 bool *, int);
149 extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
150 bool *, int);
151 extern bool tree_single_nonnegative_warnv_p (tree, bool *, int);
152 extern bool tree_call_nonnegative_warnv_p (tree, combined_fn, tree, tree,
153 bool *, int);
154
155 extern bool integer_valued_real_unary_p (tree_code, tree, int);
156 extern bool integer_valued_real_binary_p (tree_code, tree, tree, int);
157 extern bool integer_valued_real_call_p (combined_fn, tree, tree, int);
158 extern bool integer_valued_real_single_p (tree, int);
159 extern bool integer_valued_real_p (tree, int = 0);
160
161 extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
162 extern tree combine_comparisons (location_t, enum tree_code, enum tree_code,
163 enum tree_code, tree, tree, tree);
164 extern void debug_fold_checksum (const_tree);
165 extern bool may_negate_without_overflow_p (const_tree);
166 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
167 extern tree round_up_loc (location_t, tree, unsigned int);
168 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
169 extern tree round_down_loc (location_t, tree, int);
170 extern tree size_int_kind (poly_int64, enum size_type_kind);
171 #define size_binop(CODE,T1,T2)\
172 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
173 extern tree size_binop_loc (location_t, enum tree_code, tree, tree);
174 #define size_diffop(T1,T2)\
175 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
176 extern tree size_diffop_loc (location_t, tree, tree);
177
178 /* Return an expr equal to X but certainly not valid as an lvalue. */
179 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
180 extern tree non_lvalue_loc (location_t, tree);
181
182 extern bool tree_expr_nonzero_p (tree);
183 extern bool tree_expr_nonnegative_p (tree);
184 extern bool tree_expr_nonnegative_warnv_p (tree, bool *, int = 0);
185 extern tree make_range (tree, int *, tree *, tree *, bool *);
186 extern tree make_range_step (location_t, enum tree_code, tree, tree, tree,
187 tree *, tree *, int *, bool *);
188 extern tree range_check_type (tree);
189 extern tree build_range_check (location_t, tree, tree, int, tree, tree);
190 extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int,
191 tree, tree);
192 extern tree sign_bit_p (tree, const_tree);
193 extern tree exact_inverse (tree, tree);
194 extern bool expr_not_equal_to (tree t, const wide_int &);
195 extern tree const_unop (enum tree_code, tree, tree);
196 extern tree const_binop (enum tree_code, tree, tree, tree);
197 extern bool negate_mathfn_p (combined_fn);
198 extern const char *c_getstr (tree, unsigned HOST_WIDE_INT * = NULL);
199 extern wide_int tree_nonzero_bits (const_tree);
200
201 /* Return OFF converted to a pointer offset type suitable as offset for
202 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
203 extern tree convert_to_ptrofftype_loc (location_t loc, tree off);
204
205 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
206
207 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
208 extern tree fold_build_pointer_plus_loc (location_t loc, tree ptr, tree off);
209
210 #define fold_build_pointer_plus(p,o) \
211 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
212
213 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
214 extern tree fold_build_pointer_plus_hwi_loc (location_t loc, tree ptr, HOST_WIDE_INT off);
215
216 #define fold_build_pointer_plus_hwi(p,o) \
217 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
218
219
220 /* Class used to compare gimple operands. */
221
222 class operand_compare
223 {
224 public:
225 /* Return true if two operands are equal. The flags fields can be used
226 to specify OEP flags described above. */
227 virtual bool operand_equal_p (const_tree, const_tree, unsigned int flags);
228
229 /* Generate a hash value for an expression. This can be used iteratively
230 by passing a previous result as the HSTATE argument. */
231 virtual void hash_operand (const_tree, inchash::hash &, unsigned flags);
232
233 protected:
234 /* Verify that when arguments (ARG0 and ARG1) are equal, then they have
235 an equal hash value. When the function knowns comparison return,
236 true is returned. Then RET is set to corresponding comparsion result. */
237 bool verify_hash_value (const_tree arg0, const_tree arg1, unsigned int flags,
238 bool *ret);
239 };
240
241 #endif // GCC_FOLD_CONST_H