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

/* Fold a constant sub-tree into a single node for C-compiler
   Copyright (C) 1987-2021 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

/* Non-zero if we are folding constants inside an initializer; zero
   otherwise.  */
extern int folding_initializer;

/* 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 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);
#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 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_single_bit_test (location_t, enum tree_code, tree, 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 int multiple_of_p (tree, const_tree, const_tree);
#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 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_pod *);
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 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 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);

/* 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)


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