[thirdparty/gcc.git] / gcc / fold-const.h

/* Fold a constant sub-tree into a single node for C-compiler
   Copyright (C) 1987-2024 Free Software Foundation, Inc.

This file is part of GCC.

GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 3, or (at your option) any later
version.

GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
for more details.

You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3.  If not see
<http://www.gnu.org/licenses/>.  */

#ifndef GCC_FOLD_CONST_H
#define GCC_FOLD_CONST_H

/* Nonzero if we are folding constants inside an initializer or a C++
   manifestly-constant-evaluated context; zero otherwise.
   Should be used when folding in initializer enables additional
   optimizations.  */
extern int folding_initializer;
/* Nonzero if we are folding C++ manifestly-constant-evaluated context; zero
   otherwise.
   Should be used when certain constructs shouldn't be optimized
   during folding in that context.  */
extern bool folding_cxx_constexpr;

/* Convert between trees and native memory representation.  */
extern int native_encode_expr (const_tree, unsigned char *, int, int off = -1);
extern int native_encode_initializer (tree, unsigned char *, int,
				      int off = -1, unsigned char * = nullptr);
extern tree native_interpret_expr (tree, const unsigned char *, int);
extern tree native_interpret_real (tree, const unsigned char *, int);
extern bool can_native_interpret_type_p (tree);
extern tree native_interpret_aggregate (tree, const unsigned char *, int, int);
extern tree find_bitfield_repr_type (int, int);
extern void shift_bytes_in_array_left (unsigned char *, unsigned int,
				       unsigned int);
extern void shift_bytes_in_array_right (unsigned char *, unsigned int,
					unsigned int);

/* Fold constants as much as possible in an expression.
   Returns the simplified expression.
   Acts only on the top level of the expression;
   if the argument itself cannot be simplified, its
   subexpressions are not changed.  */

extern tree fold (tree);
extern tree fold_init (tree);
#define fold_unary(CODE,T1,T2)\
   fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
extern tree fold_unary_loc (location_t, enum tree_code, tree, tree);
#define fold_unary_ignore_overflow(CODE,T1,T2)\
   fold_unary_ignore_overflow_loc (UNKNOWN_LOCATION, CODE, T1, T2)
extern tree fold_unary_ignore_overflow_loc (location_t, enum tree_code, tree, tree);
#define fold_binary(CODE,T1,T2,T3)\
   fold_binary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3)
extern tree fold_binary_loc (location_t, enum tree_code, tree, tree, tree);
#define fold_ternary(CODE,T1,T2,T3,T4)\
   fold_ternary_loc (UNKNOWN_LOCATION, CODE, T1, T2, T3, T4)
extern tree fold_ternary_loc (location_t, enum tree_code, tree, tree, tree, tree);
#define fold_build1(c,t1,t2)\
   fold_build1_loc (UNKNOWN_LOCATION, c, t1, t2 MEM_STAT_INFO)
extern tree fold_build1_loc (location_t, enum tree_code, tree,
			     tree CXX_MEM_STAT_INFO);
#define fold_build2(c,t1,t2,t3)\
   fold_build2_loc (UNKNOWN_LOCATION, c, t1, t2, t3 MEM_STAT_INFO)
extern tree fold_build2_loc (location_t, enum tree_code, tree, tree,
			     tree CXX_MEM_STAT_INFO);
#define fold_build3(c,t1,t2,t3,t4)\
   fold_build3_loc (UNKNOWN_LOCATION, c, t1, t2, t3, t4 MEM_STAT_INFO)
extern tree fold_build3_loc (location_t, enum tree_code, tree, tree, tree,
				  tree CXX_MEM_STAT_INFO);
extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree);
extern tree fold_build2_initializer_loc (location_t, enum tree_code, tree, tree, tree);
#define fold_build_call_array(T1,T2,N,T4)\
   fold_build_call_array_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
extern tree fold_build_call_array_loc (location_t, tree, tree, int, tree *);
#define fold_build_call_array_initializer(T1,T2,N,T4)\
   fold_build_call_array_initializer_loc (UNKNOWN_LOCATION, T1, T2, N, T4)
extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *);
extern tree fold_binary_initializer_loc (location_t, tree_code, tree, tree, tree);
extern tree get_array_ctor_element_at_index (tree, offset_int,
					     unsigned * = NULL);
extern bool fold_convertible_p (const_tree, const_tree);
#define fold_convert(T1,T2)\
   fold_convert_loc (UNKNOWN_LOCATION, T1, T2)
extern tree fold_convert_loc (location_t, tree, tree);
extern tree fold_ignored_result (tree);
extern tree fold_abs_const (tree, tree);
extern tree fold_indirect_ref_1 (location_t, tree, tree);
extern void fold_defer_overflow_warnings (void);
extern void fold_undefer_overflow_warnings (bool, const gimple *, int);
extern void fold_undefer_and_ignore_overflow_warnings (void);
extern bool fold_deferring_overflow_warnings_p (void);
extern void fold_overflow_warning (const char*, enum warn_strict_overflow_code);
extern enum tree_code fold_div_compare (enum tree_code, tree, tree,
					tree *, tree *, bool *);
extern bool operand_equal_p (const_tree, const_tree, unsigned int flags = 0);
extern bool multiple_of_p (tree, const_tree, const_tree, bool = true);
#define omit_one_operand(T1,T2,T3)\
   omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
extern tree omit_one_operand_loc (location_t, tree, tree, tree);
#define omit_two_operands(T1,T2,T3,T4)\
   omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree);
#define invert_truthvalue(T)\
   invert_truthvalue_loc (UNKNOWN_LOCATION, T)
extern tree invert_truthvalue_loc (location_t, tree);
extern tree fold_unary_to_constant (enum tree_code, tree, tree);
extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
extern tree fold_bit_and_mask (tree, tree, enum tree_code,
			       tree, enum tree_code, tree, tree,
			       tree, enum tree_code, tree, tree, tree *);
extern tree fold_read_from_constant_string (tree);
extern tree fold_read_from_vector (tree, poly_uint64);
#if GCC_VEC_PERN_INDICES_H
extern tree fold_vec_perm (tree, tree, tree, const vec_perm_indices &);
#endif
extern bool wide_int_binop (wide_int &res, enum tree_code,
			    const wide_int &arg1, const wide_int &arg2,
			    signop, wi::overflow_type *);
extern bool poly_int_binop (poly_wide_int &res, enum tree_code,
			    const_tree, const_tree, signop,
			    wi::overflow_type *);
extern tree int_const_binop (enum tree_code, const_tree, const_tree, int = 1);
#define build_fold_addr_expr(T)\
        build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
extern tree build_fold_addr_expr_loc (location_t, tree);
#define build_fold_addr_expr_with_type(T,TYPE)\
        build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree);
extern tree fold_build_cleanup_point_expr (tree type, tree expr);
#define build_fold_indirect_ref(T)\
        build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
extern tree build_fold_indirect_ref_loc (location_t, tree);
#define fold_indirect_ref(T)\
        fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
extern tree fold_indirect_ref_loc (location_t, tree);
extern tree build_simple_mem_ref_loc (location_t, tree);
#define build_simple_mem_ref(T)\
	build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
extern poly_offset_int mem_ref_offset (const_tree);
extern tree build_invariant_address (tree, tree, poly_int64);
extern tree constant_boolean_node (bool, tree);
extern tree div_if_zero_remainder (const_tree, const_tree);

extern bool tree_swap_operands_p (const_tree, const_tree);
extern enum tree_code swap_tree_comparison (enum tree_code);

extern bool ptr_difference_const (tree, tree, poly_int64 *);
extern enum tree_code invert_tree_comparison (enum tree_code, bool);
extern bool inverse_conditions_p (const_tree, const_tree);

extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
                                         bool *);
extern bool tree_single_nonzero_warnv_p (tree, bool *);
extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree,
					    bool *, int);
extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
					     bool *, int);
extern bool tree_single_nonnegative_warnv_p (tree, bool *, int);
extern bool tree_call_nonnegative_warnv_p (tree, combined_fn, tree, tree,
					   bool *, int);

extern bool integer_valued_real_unary_p (tree_code, tree, int);
extern bool integer_valued_real_binary_p (tree_code, tree, tree, int);
extern bool integer_valued_real_call_p (combined_fn, tree, tree, int);
extern bool integer_valued_real_single_p (tree, int);
extern bool integer_valued_real_p (tree, int = 0);

extern bool fold_real_zero_addition_p (const_tree, const_tree, const_tree,
				       int);
extern tree combine_comparisons (location_t, enum tree_code, enum tree_code,
				 enum tree_code, tree, tree, tree);
extern void debug_fold_checksum (const_tree);
extern bool may_negate_without_overflow_p (const_tree);
#define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
extern tree round_up_loc (location_t, tree, unsigned int);
#define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
extern tree round_down_loc (location_t, tree, int);
extern tree size_int_kind (poly_int64, enum size_type_kind);
#define size_binop(CODE,T1,T2)\
   size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
extern tree size_binop_loc (location_t, enum tree_code, tree, tree);
#define size_diffop(T1,T2)\
   size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
extern tree size_diffop_loc (location_t, tree, tree);

/* Return an expr equal to X but certainly not valid as an lvalue.  */
#define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
extern tree non_lvalue_loc (location_t, tree);

extern bool tree_expr_nonzero_p (tree);
extern bool tree_expr_nonnegative_p (tree);
extern bool tree_expr_nonnegative_warnv_p (tree, bool *, int = 0);
extern bool tree_expr_finite_p (const_tree);
extern bool tree_expr_infinite_p (const_tree);
extern bool tree_expr_maybe_infinite_p (const_tree);
extern bool tree_expr_signaling_nan_p (const_tree);
extern bool tree_expr_maybe_signaling_nan_p (const_tree);
extern bool tree_expr_nan_p (const_tree);
extern bool tree_expr_maybe_nan_p (const_tree);
extern bool tree_expr_maybe_real_minus_zero_p (const_tree);
extern tree make_range (tree, int *, tree *, tree *, bool *);
extern tree make_range_step (location_t, enum tree_code, tree, tree, tree,
			     tree *, tree *, int *, bool *);
extern tree range_check_type (tree);
extern tree build_range_check (location_t, tree, tree, int, tree, tree);
extern bool merge_ranges (int *, tree *, tree *, int, tree, tree, int,
			  tree, tree);
extern tree sign_bit_p (tree, const_tree);
extern bool simple_condition_p (tree);
extern tree exact_inverse (tree, tree);
extern bool expr_not_equal_to (tree t, const wide_int &);
extern tree const_unop (enum tree_code, tree, tree);
extern tree vector_const_binop (enum tree_code, tree, tree,
				tree (*) (enum tree_code, tree, tree));
extern tree const_binop (enum tree_code, tree, tree, tree);
extern bool negate_mathfn_p (combined_fn);
extern const char *getbyterep (tree, unsigned HOST_WIDE_INT *);
extern const char *c_getstr (tree);
extern wide_int tree_nonzero_bits (const_tree);
extern int address_compare (tree_code, tree, tree, tree, tree &, tree &,
			    poly_int64 &, poly_int64 &, bool);
extern tree ctor_single_nonzero_element (const_tree);

/* Return OFF converted to a pointer offset type suitable as offset for
   POINTER_PLUS_EXPR.  Use location LOC for this conversion.  */
extern tree convert_to_ptrofftype_loc (location_t loc, tree off);

#define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)

/* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF.  */
extern tree fold_build_pointer_plus_loc (location_t loc, tree ptr, tree off);

#define fold_build_pointer_plus(p,o) \
	fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)

/* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF.  */
extern tree fold_build_pointer_plus_hwi_loc (location_t loc, tree ptr, HOST_WIDE_INT off);

#define fold_build_pointer_plus_hwi(p,o) \
	fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)

extern tree_code minmax_from_comparison (tree_code, tree, tree,
					 tree, tree);

/* In gimple-fold.cc.  */
extern void clear_type_padding_in_mask (tree, unsigned char *);
extern bool clear_padding_type_may_have_padding_p (tree);
extern bool arith_overflowed_p (enum tree_code, const_tree, const_tree,
				const_tree);

/* Class used to compare gimple operands.  */

class operand_compare
{
public:
  /* Return true if two operands are equal.  The flags fields can be used
     to specify OEP flags described in tree-core.h.  */
  virtual bool operand_equal_p (const_tree, const_tree, unsigned int flags);

  /* Generate a hash value for an expression.  This can be used iteratively
     by passing a previous result as the HSTATE argument.  */
  virtual void hash_operand (const_tree, inchash::hash &, unsigned flags);

protected:
  /* Verify that when arguments (ARG0 and ARG1) are equal, then they have
     an equal hash value.  When the function knowns comparison return,
     true is returned.  Then RET is set to corresponding comparsion result.  */
  bool verify_hash_value (const_tree arg0, const_tree arg1, unsigned int flags,
			  bool *ret);
};

#endif // GCC_FOLD_CONST_H
Commit	Line	Data
d8a2d370	1	/* Fold a constant sub-tree into a single node for C-compiler
a945c346	2	Copyright (C) 1987-2024 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
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	27	extern 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. */
	32	extern bool folding_cxx_constexpr;
d8a2d370 DN	33
d8a2d370 DN	34	/* Convert between trees and native memory representation. */
b2505143	35	extern int native_encode_expr (const_tree, unsigned char *, int, int off = -1);
ea69031c	36	extern int native_encode_initializer (tree, unsigned char *, int,
896048cf	37	int off = -1, unsigned char * = nullptr);
d8a2d370	38	extern tree native_interpret_expr (tree, const unsigned char *, int);
2801f23f	39	extern tree native_interpret_real (tree, const unsigned char *, int);
ea69031c	40	extern bool can_native_interpret_type_p (tree);
896048cf JJ	41	extern tree native_interpret_aggregate (tree, const unsigned char *, int, int);
896048cf JJ	42	extern tree find_bitfield_repr_type (int, int);
8aba425f JJ	43	extern void shift_bytes_in_array_left (unsigned char *, unsigned int,
	44	unsigned int);
	45	extern 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
	54	extern tree fold (tree);
600dcd74	55	extern tree fold_init (tree);
d8a2d370 DN	56	#define fold_unary(CODE,T1,T2)\
	57	fold_unary_loc (UNKNOWN_LOCATION, CODE, T1, T2)
	58	extern 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)
	61	extern 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)
	64	extern 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)
	67	extern 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)
	70	extern 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)
	74	extern 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)
	78	extern tree fold_build3_loc (location_t, enum tree_code, tree, tree, tree,
	79	tree CXX_MEM_STAT_INFO);
d8a2d370 DN	80	extern tree fold_build1_initializer_loc (location_t, enum tree_code, tree, tree);
	81	extern 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)
	84	extern 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)
	87	extern tree fold_build_call_array_initializer_loc (location_t, tree, tree, int, tree *);
53caa472	88	extern tree fold_binary_initializer_loc (location_t, tree_code, tree, tree, tree);
831e688a RB	89	extern tree get_array_ctor_element_at_index (tree, offset_int,
831e688a RB	90	unsigned * = NULL);
d8a2d370 DN	91	extern bool fold_convertible_p (const_tree, const_tree);
	92	#define fold_convert(T1,T2)\
	93	fold_convert_loc (UNKNOWN_LOCATION, T1, T2)
	94	extern tree fold_convert_loc (location_t, tree, tree);
d8a2d370 DN	95	extern tree fold_ignored_result (tree);
	96	extern tree fold_abs_const (tree, tree);
	97	extern tree fold_indirect_ref_1 (location_t, tree, tree);
	98	extern void fold_defer_overflow_warnings (void);
355fe088	99	extern void fold_undefer_overflow_warnings (bool, const gimple *, int);
d8a2d370 DN	100	extern void fold_undefer_and_ignore_overflow_warnings (void);
d8a2d370 DN	101	extern bool fold_deferring_overflow_warnings_p (void);
a8b85ce9	102	extern void fold_overflow_warning (const char*, enum warn_strict_overflow_code);
8d1628eb JJ	103	extern enum tree_code fold_div_compare (enum tree_code, tree, tree,
8d1628eb JJ	104	tree , tree , bool *);
7f4a8ee0	105	extern bool operand_equal_p (const_tree, const_tree, unsigned int flags = 0);
ca15abc0	106	extern bool multiple_of_p (tree, const_tree, const_tree, bool = true);
d8a2d370 DN	107	#define omit_one_operand(T1,T2,T3)\
	108	omit_one_operand_loc (UNKNOWN_LOCATION, T1, T2, T3)
	109	extern tree omit_one_operand_loc (location_t, tree, tree, tree);
	110	#define omit_two_operands(T1,T2,T3,T4)\
	111	omit_two_operands_loc (UNKNOWN_LOCATION, T1, T2, T3, T4)
	112	extern tree omit_two_operands_loc (location_t, tree, tree, tree, tree);
	113	#define invert_truthvalue(T)\
	114	invert_truthvalue_loc (UNKNOWN_LOCATION, T)
	115	extern tree invert_truthvalue_loc (location_t, tree);
	116	extern tree fold_unary_to_constant (enum tree_code, tree, tree);
	117	extern tree fold_binary_to_constant (enum tree_code, tree, tree, tree);
f2901002 JJ	118	extern tree fold_bit_and_mask (tree, tree, enum tree_code,
	119	tree, enum tree_code, tree, tree,
	120	tree, enum tree_code, tree, tree, tree *);
d8a2d370	121	extern tree fold_read_from_constant_string (tree);
4f8b89f0	122	extern tree fold_read_from_vector (tree, poly_uint64);
ebd733a7 RB	123	#if GCC_VEC_PERN_INDICES_H
	124	extern tree fold_vec_perm (tree, tree, tree, const vec_perm_indices &);
	125	#endif
5f9d2c58 AH	126	extern bool wide_int_binop (wide_int &res, enum tree_code,
	127	const wide_int &arg1, const wide_int &arg2,
	128	signop, wi::overflow_type *);
87217bea JS	129	extern bool poly_int_binop (poly_wide_int &res, enum tree_code,
	130	const_tree, const_tree, signop,
	131	wi::overflow_type *);
5f9d2c58	132	extern tree int_const_binop (enum tree_code, const_tree, const_tree, int = 1);
d8a2d370 DN	133	#define build_fold_addr_expr(T)\
	134	build_fold_addr_expr_loc (UNKNOWN_LOCATION, (T))
	135	extern tree build_fold_addr_expr_loc (location_t, tree);
	136	#define build_fold_addr_expr_with_type(T,TYPE)\
	137	build_fold_addr_expr_with_type_loc (UNKNOWN_LOCATION, (T), TYPE)
	138	extern tree build_fold_addr_expr_with_type_loc (location_t, tree, tree);
	139	extern tree fold_build_cleanup_point_expr (tree type, tree expr);
d8a2d370 DN	140	#define build_fold_indirect_ref(T)\
	141	build_fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
	142	extern tree build_fold_indirect_ref_loc (location_t, tree);
	143	#define fold_indirect_ref(T)\
	144	fold_indirect_ref_loc (UNKNOWN_LOCATION, T)
	145	extern tree fold_indirect_ref_loc (location_t, tree);
	146	extern tree build_simple_mem_ref_loc (location_t, tree);
	147	#define build_simple_mem_ref(T)\
	148	build_simple_mem_ref_loc (UNKNOWN_LOCATION, T)
aca52e6f	149	extern poly_offset_int mem_ref_offset (const_tree);
36fd6408	150	extern tree build_invariant_address (tree, tree, poly_int64);
d8a2d370	151	extern tree constant_boolean_node (bool, tree);
807e902e	152	extern tree div_if_zero_remainder (const_tree, const_tree);
d8a2d370	153
14e72812	154	extern bool tree_swap_operands_p (const_tree, const_tree);
d8a2d370 DN	155	extern enum tree_code swap_tree_comparison (enum tree_code);
d8a2d370 DN	156
eaa41a6d	157	extern bool ptr_difference_const (tree, tree, poly_int64 *);
d8a2d370	158	extern enum tree_code invert_tree_comparison (enum tree_code, bool);
2c58d42c	159	extern bool inverse_conditions_p (const_tree, const_tree);
d8a2d370 DN	160
	161	extern bool tree_unary_nonzero_warnv_p (enum tree_code, tree, tree, bool *);
	162	extern bool tree_binary_nonzero_warnv_p (enum tree_code, tree, tree, tree op1,
	163	bool *);
	164	extern bool tree_single_nonzero_warnv_p (tree, bool *);
68e57f04 RS	165	extern bool tree_unary_nonnegative_warnv_p (enum tree_code, tree, tree,
68e57f04 RS	166	bool *, int);
d8a2d370	167	extern bool tree_binary_nonnegative_warnv_p (enum tree_code, tree, tree, tree,
68e57f04 RS	168	bool *, int);
68e57f04 RS	169	extern bool tree_single_nonnegative_warnv_p (tree, bool *, int);
1d9da71f RS	170	extern bool tree_call_nonnegative_warnv_p (tree, combined_fn, tree, tree,
1d9da71f RS	171	bool *, int);
d8a2d370	172
67dbe582 RS	173	extern bool integer_valued_real_unary_p (tree_code, tree, int);
67dbe582 RS	174	extern bool integer_valued_real_binary_p (tree_code, tree, tree, int);
1d9da71f	175	extern bool integer_valued_real_call_p (combined_fn, tree, tree, int);
67dbe582 RS	176	extern bool integer_valued_real_single_p (tree, int);
	177	extern bool integer_valued_real_p (tree, int = 0);
	178
5b02ed4b RS	179	extern bool fold_real_zero_addition_p (const_tree, const_tree, const_tree,
5b02ed4b RS	180	int);
d8a2d370 DN	181	extern tree combine_comparisons (location_t, enum tree_code, enum tree_code,
	182	enum tree_code, tree, tree, tree);
	183	extern void debug_fold_checksum (const_tree);
	184	extern bool may_negate_without_overflow_p (const_tree);
	185	#define round_up(T,N) round_up_loc (UNKNOWN_LOCATION, T, N)
605f12f4	186	extern tree round_up_loc (location_t, tree, unsigned int);
d8a2d370 DN	187	#define round_down(T,N) round_down_loc (UNKNOWN_LOCATION, T, N)
d8a2d370 DN	188	extern tree round_down_loc (location_t, tree, int);
36fd6408	189	extern tree size_int_kind (poly_int64, enum size_type_kind);
d8a2d370 DN	190	#define size_binop(CODE,T1,T2)\
	191	size_binop_loc (UNKNOWN_LOCATION, CODE, T1, T2)
	192	extern tree size_binop_loc (location_t, enum tree_code, tree, tree);
	193	#define size_diffop(T1,T2)\
	194	size_diffop_loc (UNKNOWN_LOCATION, T1, T2)
	195	extern tree size_diffop_loc (location_t, tree, tree);
	196
	197	/* Return an expr equal to X but certainly not valid as an lvalue. */
	198	#define non_lvalue(T) non_lvalue_loc (UNKNOWN_LOCATION, T)
	199	extern tree non_lvalue_loc (location_t, tree);
	200
e36c1cfe	201	extern bool tree_expr_nonzero_p (tree);
d8a2d370	202	extern bool tree_expr_nonnegative_p (tree);
68e57f04	203	extern bool tree_expr_nonnegative_warnv_p (tree, bool *, int = 0);
1be48781 RS	204	extern bool tree_expr_finite_p (const_tree);
	205	extern bool tree_expr_infinite_p (const_tree);
	206	extern bool tree_expr_maybe_infinite_p (const_tree);
	207	extern bool tree_expr_signaling_nan_p (const_tree);
	208	extern bool tree_expr_maybe_signaling_nan_p (const_tree);
	209	extern bool tree_expr_nan_p (const_tree);
	210	extern bool tree_expr_maybe_nan_p (const_tree);
a761829a	211	extern bool tree_expr_maybe_real_minus_zero_p (const_tree);
d8a2d370 DN	212	extern tree make_range (tree, int , tree , tree , bool );
	213	extern tree make_range_step (location_t, enum tree_code, tree, tree, tree,
	214	tree , tree , int , bool );
8d1628eb	215	extern tree range_check_type (tree);
d8a2d370 DN	216	extern tree build_range_check (location_t, tree, tree, int, tree, tree);
	217	extern bool merge_ranges (int , tree , tree *, int, tree, tree, int,
	218	tree, tree);
a7f24614	219	extern tree sign_bit_p (tree, const_tree);
08b51bad	220	extern bool simple_condition_p (tree);
a7f24614	221	extern tree exact_inverse (tree, tree);
20b8d734	222	extern bool expr_not_equal_to (tree t, const wide_int &);
8006f46b	223	extern tree const_unop (enum tree_code, tree, tree);
87217bea JS	224	extern tree vector_const_binop (enum tree_code, tree, tree,
87217bea JS	225	tree (*) (enum tree_code, tree, tree));
8006f46b	226	extern tree const_binop (enum tree_code, tree, tree, tree);
1d9da71f	227	extern bool negate_mathfn_p (combined_fn);
866626ef MS	228	extern const char getbyterep (tree, unsigned HOST_WIDE_INT );
866626ef MS	229	extern const char *c_getstr (tree);
ba6557e2	230	extern wide_int tree_nonzero_bits (const_tree);
6123b998 JJ	231	extern int address_compare (tree_code, tree, tree, tree, tree &, tree &,
6123b998 JJ	232	poly_int64 &, poly_int64 &, bool);
2ef0e75d	233	extern tree ctor_single_nonzero_element (const_tree);
d8a2d370	234
40e23961 MC	235	/* Return OFF converted to a pointer offset type suitable as offset for
	236	POINTER_PLUS_EXPR. Use location LOC for this conversion. */
	237	extern tree convert_to_ptrofftype_loc (location_t loc, tree off);
	238
	239	#define convert_to_ptrofftype(t) convert_to_ptrofftype_loc (UNKNOWN_LOCATION, t)
	240
	241	/* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
	242	extern tree fold_build_pointer_plus_loc (location_t loc, tree ptr, tree off);
	243
	244	#define fold_build_pointer_plus(p,o) \
	245	fold_build_pointer_plus_loc (UNKNOWN_LOCATION, p, o)
	246
	247	/* Build and fold a POINTER_PLUS_EXPR at LOC offsetting PTR by OFF. */
	248	extern tree fold_build_pointer_plus_hwi_loc (location_t loc, tree ptr, HOST_WIDE_INT off);
	249
	250	#define fold_build_pointer_plus_hwi(p,o) \
	251	fold_build_pointer_plus_hwi_loc (UNKNOWN_LOCATION, p, o)
7f4a8ee0	252
b9b30dba AP	253	extern tree_code minmax_from_comparison (tree_code, tree, tree,
	254	tree, tree);
	255
ba206889 RB	256	/* In gimple-fold.cc. */
	257	extern void clear_type_padding_in_mask (tree, unsigned char *);
	258	extern bool clear_padding_type_may_have_padding_p (tree);
	259	extern bool arith_overflowed_p (enum tree_code, const_tree, const_tree,
	260	const_tree);
7f4a8ee0 ML	261
	262	/* Class used to compare gimple operands. */
	263
	264	class operand_compare
	265	{
	266	public:
	267	/* Return true if two operands are equal. The flags fields can be used
691924db	268	to specify OEP flags described in tree-core.h. */
7f4a8ee0 ML	269	virtual bool operand_equal_p (const_tree, const_tree, unsigned int flags);
	270
	271	/* Generate a hash value for an expression. This can be used iteratively
	272	by passing a previous result as the HSTATE argument. */
	273	virtual void hash_operand (const_tree, inchash::hash &, unsigned flags);
	274
	275	protected:
	276	/* Verify that when arguments (ARG0 and ARG1) are equal, then they have
	277	an equal hash value. When the function knowns comparison return,
	278	true is returned. Then RET is set to corresponding comparsion result. */
	279	bool verify_hash_value (const_tree arg0, const_tree arg1, unsigned int flags,
	280	bool *ret);
	281	};
	282
d8a2d370	283	#endif // GCC_FOLD_CONST_H