]> git.ipfire.org Git - thirdparty/gcc.git/blame - gcc/fold-const.h
projects / thirdparty / gcc.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
* doc/install.texi (Specific, alpha): Remove note to use
[thirdparty/gcc.git] / gcc / fold-const.h
CommitLineData
9ed99284 1/* Fold a constant sub-tree into a single node for C-compiler
fbd26352 2 Copyright (C) 1987-2019 Free Software Foundation, Inc.
9ed99284 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
23/* Non-zero if we are folding constants inside an initializer; zero
24 otherwise. */
25extern int folding_initializer;
26
27/* Convert between trees and native memory representation. */
4237b215 28extern int native_encode_expr (const_tree, unsigned char *, int, int off = -1);
9ed99284 29extern 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
37extern tree fold (tree);
38#define fold_unary(CODE,T1,T2)\
39 fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
40extern 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)
43extern 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)
46extern 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)
49extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree);
50#define fold_build1(c,t1,t2)\
35da6652 51 fold_build1_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
52extern tree fold_build1_loc (location_t, enum tree_code, tree,
53 tree CXX_MEM_STAT_INFO);
9ed99284 54#define fold_build2(c,t1,t2,t3)\
35da6652 55 fold_build2_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
56extern tree fold_build2_loc (location_t, enum tree_code, tree, tree,
57 tree CXX_MEM_STAT_INFO);
9ed99284 58#define fold_build3(c,t1,t2,t3,t4)\
35da6652 59 fold_build3_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
60extern tree fold_build3_loc (location_t, enum tree_code, tree, tree, tree,
61 tree CXX_MEM_STAT_INFO);
9ed99284 62extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree);
63extern 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)
66extern 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)
69extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *);
22592b33 70extern tree get_array_ctor_element_at_index (tree, offset_int,
71 unsigned * = NULL);
9ed99284 72extern bool fold_convertible_p (const_tree, const_tree);
73#define fold_convert(T1,T2)\
74 fold_convert_loc (UNKNOWN_LOCATION, T1, T2)
75extern tree fold_convert_loc (location_t, tree, tree);
76extern tree fold_single_bit_test (location_t, enum tree_code, tree, tree, tree);
77extern tree fold_ignored_result (tree);
78extern tree fold_abs_const (tree, tree);
79extern tree fold_indirect_ref_1 (location_t, tree, tree);
80extern void fold_defer_overflow_warnings (void);
42acab1c 81extern void fold_undefer_overflow_warnings (bool, const gimple *, int);
9ed99284 82extern void fold_undefer_and_ignore_overflow_warnings (void);
83extern bool fold_deferring_overflow_warnings_p (void);
eb1a077c 84extern void fold_overflow_warning (const char*, enum warn_strict_overflow_code);
14c7029b 85extern enum tree_code fold_div_compare (enum tree_code, tree, tree,
86 tree *, tree *, bool *);
c4cacc38 87extern bool operand_equal_p (const_tree, const_tree, unsigned int);
9ed99284 88extern 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)
91extern 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)
94extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree);
95#define invert_truthvalue(T)\
96 invert_truthvalue_loc (UNKNOWN_LOCATION, T)
97extern tree invert_truthvalue_loc (location_t, tree);
98extern tree fold_unary_to_constant (enum tree_code, tree, tree);
99extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
dba2ece2 100extern 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 *);
9ed99284 103extern tree fold_read_from_constant_string (tree);
a25cdd8a 104extern tree fold_read_from_vector (tree, poly_uint64);
143aadc0 105#if GCC_VEC_PERN_INDICES_H
106extern tree fold_vec_perm (tree, tree, tree, const vec_perm_indices &);
107#endif
b8c83ca3 108extern bool wide_int_binop (wide_int &res, enum tree_code,
109 const wide_int &arg1, const wide_int &arg2,
110 signop, wi::overflow_type *);
111extern tree int_const_binop (enum tree_code, const_tree, const_tree, int = 1);
9ed99284 112#define build_fold_addr_expr(T)\
113 build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
114extern 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)
117extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree);
118extern tree fold_build_cleanup_point_expr (tree type, tree expr);
9ed99284 119#define build_fold_indirect_ref(T)\
120 build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
121extern tree build_fold_indirect_ref_loc (location_t, tree);
122#define fold_indirect_ref(T)\
123 fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
124extern tree fold_indirect_ref_loc (location_t, tree);
125extern 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)
90ca1268 128extern poly_offset_int mem_ref_offset (const_tree);
8672ee56 129extern tree build_invariant_address (tree, tree, poly_int64);
9ed99284 130extern tree constant_boolean_node (bool, tree);
fe5ad926 131extern tree div_if_zero_remainder (const_tree, const_tree);
9ed99284 132
48baf518 133extern bool tree_swap_operands_p (const_tree, const_tree);
9ed99284 134extern enum tree_code swap_tree_comparison (enum tree_code);
135
81bc0f0f 136extern bool ptr_difference_const (tree, tree, poly_int64_pod *);
9ed99284 137extern enum tree_code invert_tree_comparison (enum tree_code, bool);
03821886 138extern bool inverse_conditions_p (const_tree, const_tree);
9ed99284 139
140extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
141extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
142 bool *);
143extern bool tree_single_nonzero_warnv_p (tree, bool *);
ee230333 144extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree,
145 bool *, int);
9ed99284 146extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
ee230333 147 bool *, int);
148extern bool tree_single_nonnegative_warnv_p (tree, bool *, int);
7a366e88 149extern bool tree_call_nonnegative_warnv_p (tree, combined_fn, tree, tree,
150 bool *, int);
9ed99284 151
6f5f406a 152extern bool integer_valued_real_unary_p (tree_code, tree, int);
153extern bool integer_valued_real_binary_p (tree_code, tree, tree, int);
7a366e88 154extern bool integer_valued_real_call_p (combined_fn, tree, tree, int);
6f5f406a 155extern bool integer_valued_real_single_p (tree, int);
156extern bool integer_valued_real_p (tree, int = 0);
157
9ed99284 158extern bool fold_real_zero_addition_p (const_tree, const_tree, int);
159extern tree combine_comparisons (location_t, enum tree_code, enum tree_code,
160 enum tree_code, tree, tree, tree);
161extern void debug_fold_checksum (const_tree);
162extern bool may_negate_without_overflow_p (const_tree);
163#define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
9aa78eb0 164extern tree round_up_loc (location_t, tree, unsigned int);
9ed99284 165#define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
166extern tree round_down_loc (location_t, tree, int);
8672ee56 167extern tree size_int_kind (poly_int64, enum size_type_kind);
9ed99284 168#define size_binop(CODE,T1,T2)\
169 size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
170extern 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)
173extern 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)
177extern tree non_lvalue_loc (location_t, tree);
178
70229d3b 179extern bool tree_expr_nonzero_p (tree);
9ed99284 180extern bool tree_expr_nonnegative_p (tree);
ee230333 181extern bool tree_expr_nonnegative_warnv_p (tree, bool *, int = 0);
9ed99284 182extern tree make_range (tree, int *, tree *, tree *, bool *);
183extern tree make_range_step (location_t, enum tree_code, tree, tree, tree,
184 tree *, tree *, int *, bool *);
14c7029b 185extern tree range_check_type (tree);
9ed99284 186extern tree build_range_check (location_t, tree, tree, int, tree, tree);
187extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int,
188 tree, tree);
6a78ea5d 189extern tree sign_bit_p (tree, const_tree);
190extern tree exact_inverse (tree, tree);
7dff0499 191extern bool expr_not_equal_to (tree t, const wide_int &);
6d31c916 192extern tree const_unop (enum tree_code, tree, tree);
193extern tree const_binop (enum tree_code, tree, tree, tree);
7a366e88 194extern bool negate_mathfn_p (combined_fn);
9b7116a1 195extern const char *c_getstr (tree, unsigned HOST_WIDE_INT * = NULL);
d1f6ca14 196extern wide_int tree_nonzero_bits (const_tree);
9ed99284 197
b20a8bb4 198/* Return OFF converted to a pointer offset type suitable as offset for
199 POINTER_PLUS_EXPR. Use location LOC for this conversion. */
200extern 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. */
205extern 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. */
211extern 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)
9ed99284 215#endif // GCC_FOLD_CONST_H
Mirror of https://gcc.gnu.org/git/gcc.git