|
111
|
1 /* Fold a constant sub-tree into a single node for C-compiler
|
|
131
|
2 Copyright (C) 1987-2018 Free Software Foundation, Inc.
|
|
111
|
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 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)\
|
|
|
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);
|
|
|
54 #define fold_build2(c,t1,t2,t3)\
|
|
|
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);
|
|
|
58 #define fold_build3(c,t1,t2,t3,t4)\
|
|
|
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);
|
|
|
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 *);
|
|
|
70 extern tree get_array_ctor_element_at_index (tree, offset_int);
|
|
|
71 extern bool fold_convertible_p (const_tree, const_tree);
|
|
|
72 #define fold_convert(T1,T2)\
|
|
|
73 fold_convert_loc (UNKNOWN_LOCATION, T1, T2)
|
|
|
74 extern tree fold_convert_loc (location_t, tree, tree);
|
|
|
75 extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree);
|
|
|
76 extern tree fold_ignored_result (tree);
|
|
|
77 extern tree fold_abs_const (tree, tree);
|
|
|
78 extern tree fold_indirect_ref_1 (location_t, tree, tree);
|
|
|
79 extern void fold_defer_overflow_warnings (void);
|
|
|
80 extern void fold_undefer_overflow_warnings (bool, const gimple *, int);
|
|
|
81 extern void fold_undefer_and_ignore_overflow_warnings (void);
|
|
|
82 extern bool fold_deferring_overflow_warnings_p (void);
|
|
|
83 extern void fold_overflow_warning (const char*, enum warn_strict_overflow_code);
|
|
|
84 extern enum tree_code fold_div_compare (enum tree_code, tree, tree,
|
|
|
85 tree *, tree *, bool *);
|
|
|
86 extern int operand_equal_p (const_tree, const_tree, unsigned int);
|
|
|
87 extern int multiple_of_p (tree, const_tree, const_tree);
|
|
|
88 #define omit_one_operand(T1,T2,T3)\
|
|
|
89 omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
|
|
|
90 extern tree omit_one_operand_loc (location_t, tree, tree, tree);
|
|
|
91 #define omit_two_operands(T1,T2,T3,T4)\
|
|
|
92 omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
|
|
|
93 extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree);
|
|
|
94 #define invert_truthvalue(T)\
|
|
|
95 invert_truthvalue_loc (UNKNOWN_LOCATION, T)
|
|
|
96 extern tree invert_truthvalue_loc (location_t, tree);
|
|
|
97 extern tree fold_unary_to_constant (enum tree_code, tree, tree);
|
|
|
98 extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
|
|
131
|
99 extern tree fold_bit_and_mask (tree, tree, enum tree_code,
|
|
|
100 tree, enum tree_code, tree, tree,
|
|
|
101 tree, enum tree_code, tree, tree, tree *);
|
|
111
|
102 extern tree fold_read_from_constant_string (tree);
|
|
131
|
103 extern bool wide_int_binop (wide_int &res, enum tree_code,
|
|
|
104 const wide_int &arg1, const wide_int &arg2,
|
|
|
105 signop, wi::overflow_type *);
|
|
|
106 extern tree int_const_binop (enum tree_code, const_tree, const_tree, int = 1);
|
|
111
|
107 #define build_fold_addr_expr(T)\
|
|
|
108 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
|
|
|
109 extern tree build_fold_addr_expr_loc (location_t, tree);
|
|
|
110 #define build_fold_addr_expr_with_type(T,TYPE)\
|
|
|
111 build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
|
|
|
112 extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree);
|
|
|
113 extern tree fold_build_cleanup_point_expr (tree type, tree expr);
|
|
|
114 #define build_fold_indirect_ref(T)\
|
|
|
115 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
|
|
|
116 extern tree build_fold_indirect_ref_loc (location_t, tree);
|
|
|
117 #define fold_indirect_ref(T)\
|
|
|
118 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
|
|
|
119 extern tree fold_indirect_ref_loc (location_t, tree);
|
|
|
120 extern tree build_simple_mem_ref_loc (location_t, tree);
|
|
|
121 #define build_simple_mem_ref(T)\
|
|
|
122 build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
|
|
131
|
123 extern poly_offset_int mem_ref_offset (const_tree);
|
|
|
124 extern tree build_invariant_address (tree, tree, poly_int64);
|
|
111
|
125 extern tree constant_boolean_node (bool, tree);
|
|
|
126 extern tree div_if_zero_remainder (const_tree, const_tree);
|
|
|
127
|
|
|
128 extern bool tree_swap_operands_p (const_tree, const_tree);
|
|
|
129 extern enum tree_code swap_tree_comparison (enum tree_code);
|
|
|
130
|
|
131
|
131 extern bool ptr_difference_const (tree, tree, poly_int64_pod *);
|
|
111
|
132 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
|
|
131
|
133 extern bool inverse_conditions_p (const_tree, const_tree);
|
|
111
|
134
|
|
|
135 extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
|
|
|
136 extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
|
|
|
137 bool *);
|
|
|
138 extern bool tree_single_nonzero_warnv_p (tree, bool *);
|
|
|
139 extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree,
|
|
|
140 bool *, int);
|
|
|
141 extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
|
|
|
142 bool *, int);
|
|
|
143 extern bool tree_single_nonnegative_warnv_p (tree, bool *, int);
|
|
|
144 extern bool tree_call_nonnegative_warnv_p (tree, combined_fn, tree, tree,
|
|
|
145 bool *, int);
|
|
|
146
|
|
|
147 extern bool integer_valued_real_unary_p (tree_code, tree, int);
|
|
|
148 extern bool integer_valued_real_binary_p (tree_code, tree, tree, int);
|
|
|
149 extern bool integer_valued_real_call_p (combined_fn, tree, tree, int);
|
|
|
150 extern bool integer_valued_real_single_p (tree, int);
|
|
|
151 extern bool integer_valued_real_p (tree, int = 0);
|
|
|
152
|
|
|
153 extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
|
|
|
154 extern tree combine_comparisons (location_t, enum tree_code, enum tree_code,
|
|
|
155 enum tree_code, tree, tree, tree);
|
|
|
156 extern void debug_fold_checksum (const_tree);
|
|
|
157 extern bool may_negate_without_overflow_p (const_tree);
|
|
|
158 #define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
|
|
|
159 extern tree round_up_loc (location_t, tree, unsigned int);
|
|
|
160 #define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
|
|
|
161 extern tree round_down_loc (location_t, tree, int);
|
|
131
|
162 extern tree size_int_kind (poly_int64, enum size_type_kind);
|
|
111
|
163 #define size_binop(CODE,T1,T2)\
|
|
|
164 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
|
|
|
165 extern tree size_binop_loc (location_t, enum tree_code, tree, tree);
|
|
|
166 #define size_diffop(T1,T2)\
|
|
|
167 size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
|
|
|
168 extern tree size_diffop_loc (location_t, tree, tree);
|
|
|
169
|
|
|
170 /* Return an expr equal to X but certainly not valid as an lvalue. */
|
|
|
171 #define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
|
|
|
172 extern tree non_lvalue_loc (location_t, tree);
|
|
|
173
|
|
|
174 extern bool tree_expr_nonzero_p (tree);
|
|
|
175 extern bool tree_expr_nonnegative_p (tree);
|
|
|
176 extern bool tree_expr_nonnegative_warnv_p (tree, bool *, int = 0);
|
|
|
177 extern tree make_range (tree, int *, tree *, tree *, bool *);
|
|
|
178 extern tree make_range_step (location_t, enum tree_code, tree, tree, tree,
|
|
|
179 tree *, tree *, int *, bool *);
|
|
|
180 extern tree range_check_type (tree);
|
|
|
181 extern tree build_range_check (location_t, tree, tree, int, tree, tree);
|
|
|
182 extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int,
|
|
|
183 tree, tree);
|
|
|
184 extern tree sign_bit_p (tree, const_tree);
|
|
|
185 extern tree exact_inverse (tree, tree);
|
|
|
186 extern bool expr_not_equal_to (tree t, const wide_int &);
|
|
|
187 extern tree const_unop (enum tree_code, tree, tree);
|
|
|
188 extern tree const_binop (enum tree_code, tree, tree, tree);
|
|
|
189 extern bool negate_mathfn_p (combined_fn);
|
|
131
|
190 extern const char *c_getstr (tree, unsigned HOST_WIDE_INT * = NULL);
|
|
|
191 extern wide_int tree_nonzero_bits (const_tree);
|
|
111
|
192
|
|
|
193 /* Return OFF converted to a pointer offset type suitable as offset for
|
|
|
194 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
|
|
|
195 extern tree convert_to_ptrofftype_loc (location_t loc, tree off);
|
|
|
196
|
|
|
197 #define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
|
|
|
198
|
|
|
199 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
|
|
|
200 extern tree fold_build_pointer_plus_loc (location_t loc, tree ptr, tree off);
|
|
|
201
|
|
|
202 #define fold_build_pointer_plus(p,o) \
|
|
|
203 fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
|
|
|
204
|
|
|
205 /* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
|
|
|
206 extern tree fold_build_pointer_plus_hwi_loc (location_t loc, tree ptr, HOST_WIDE_INT off);
|
|
|
207
|
|
|
208 #define fold_build_pointer_plus_hwi(p,o) \
|
|
|
209 fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
|
|
|
210 #endif // GCC_FOLD_CONST_H
|
