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