b3ce5b6ed7
PR tree-optimization/30730 PR tree-optimization/26900 * tree-ssa-loop-niter.c: Include gmp.h. (bounds): New type. (mpz_set_double_int, get_type_bounds, mpz_to_double_int, split_to_var_and_offset, determine_value_range, bound_difference_of_offsetted_base, refine_bounds_using_guard, bound_difference, bounds_add, bounds_negate, number_of_iterations_ne_max, dump_affine_iv): New functions. (number_of_iterations_ne, number_of_iterations_lt_to_ne, assert_loop_rolls_lt, assert_loop_rolls_le): Use bounds on the difference of initial and final value of control iv to validate results. (number_of_iterations_cond): Add loop parameter. Determine bounds on the difference of the extremes of the control iv. Add dumps. (expand_simple_operations): Handle phi nodes. (simplify_using_initial_conditions): Do not record used conditions. (number_of_iterations_exit): Pass loop to number_of_iterations_cond. Do not set additional_info. (implies_nonnegative_p, implies_ge_p): Removed. (derive_constant_upper_bound): Do not use parameter `additional'. (record_estimate): Parameter `additional' removed. Parameter `i_bound' added. Do not call derive_constant_upper_bound. (record_nonwrapping_iv): Use derive_constant_upper_bound to bound the number of iterations estimate. (estimate_numbers_of_iterations_loop): Pass the estimate from the number of iterations analysis to record_estimate. * tree.h (multiple_of_p): Declare. * tree-scalar-evolution.c (expression_expensive_p): Removed. (scev_const_prop): Do not check expression_expensive_p. * fold-const.c (multiple_of_p): Exported. * double-int.c (double_int_mask): Exported. * double-int.h (double_int_mask): Declare. * tree-flow.h (struct tree_niter_desc): Removed additional_info field. Added max field. * gcc.dg/tree-ssa/loop-26.c: New test. From-SVN: r122896
178 lines
6.3 KiB
C
178 lines
6.3 KiB
C
/* Operations with long integers.
|
|
Copyright (C) 2006 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 2, 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 COPYING. If not, write to the Free
|
|
Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
|
|
02110-1301, USA. */
|
|
|
|
#ifndef DOUBLE_INT_H
|
|
#define DOUBLE_INT_H
|
|
|
|
/* A large integer is currently represented as a pair of HOST_WIDE_INTs.
|
|
It therefore represents a number with precision of
|
|
2 * HOST_BITS_PER_WIDE_INT bits (it is however possible that the
|
|
internal representation will change, if numbers with greater precision
|
|
are needed, so the users should not rely on it). The representation does
|
|
not contain any information about signedness of the represented value, so
|
|
it can be used to represent both signed and unsigned numbers. For
|
|
operations where the results depend on signedness (division, comparisons),
|
|
it must be specified separately. For each such operation, there are three
|
|
versions of the function -- double_int_op, that takes an extra UNS argument
|
|
giving the signedness of the values, and double_int_sop and double_int_uop
|
|
that stand for its specializations for signed and unsigned values.
|
|
|
|
You may also represent with numbers in smaller precision using double_int.
|
|
You however need to use double_int_ext (that fills in the bits of the
|
|
number over the prescribed precision with zeros or with the sign bit) before
|
|
operations that do not perform arithmetics modulo 2^precision (comparisons,
|
|
division), and possibly before storing the results, if you want to keep
|
|
them in some canonical form). In general, the signedness of double_int_ext
|
|
should match the signedness of the operation.
|
|
|
|
??? The components of double_int differ in signedness mostly for
|
|
historical reasons (they replace an older structure used to represent
|
|
numbers with precision higher than HOST_WIDE_INT). It might be less
|
|
confusing to have them both signed or both unsigned. */
|
|
|
|
typedef struct
|
|
{
|
|
unsigned HOST_WIDE_INT low;
|
|
HOST_WIDE_INT high;
|
|
} double_int;
|
|
|
|
union tree_node;
|
|
|
|
/* Constructors and conversions. */
|
|
|
|
union tree_node *double_int_to_tree (union tree_node *, double_int);
|
|
bool double_int_fits_to_tree_p (union tree_node *, double_int);
|
|
double_int tree_to_double_int (union tree_node *);
|
|
|
|
/* Constructs double_int from integer CST. The bits over the precision of
|
|
HOST_WIDE_INT are filled with the sign bit. */
|
|
|
|
static inline double_int
|
|
shwi_to_double_int (HOST_WIDE_INT cst)
|
|
{
|
|
double_int r;
|
|
|
|
r.low = (unsigned HOST_WIDE_INT) cst;
|
|
r.high = cst < 0 ? -1 : 0;
|
|
|
|
return r;
|
|
}
|
|
|
|
/* Some useful constants. */
|
|
|
|
#define double_int_minus_one (shwi_to_double_int (-1))
|
|
#define double_int_zero (shwi_to_double_int (0))
|
|
#define double_int_one (shwi_to_double_int (1))
|
|
#define double_int_two (shwi_to_double_int (2))
|
|
#define double_int_ten (shwi_to_double_int (10))
|
|
|
|
/* Constructs double_int from unsigned integer CST. The bits over the
|
|
precision of HOST_WIDE_INT are filled with zeros. */
|
|
|
|
static inline double_int
|
|
uhwi_to_double_int (unsigned HOST_WIDE_INT cst)
|
|
{
|
|
double_int r;
|
|
|
|
r.low = cst;
|
|
r.high = 0;
|
|
|
|
return r;
|
|
}
|
|
|
|
/* The following operations perform arithmetics modulo 2^precision,
|
|
so you do not need to call double_int_ext between them, even if
|
|
you are representing numbers with precision less than
|
|
2 * HOST_BITS_PER_WIDE_INT bits. */
|
|
|
|
double_int double_int_mul (double_int, double_int);
|
|
double_int double_int_add (double_int, double_int);
|
|
double_int double_int_neg (double_int);
|
|
|
|
/* You must ensure that double_int_ext is called on the operands
|
|
of the following operations, if the precision of the numbers
|
|
is less than 2 * HOST_BITS_PER_WIDE_INT bits. */
|
|
bool double_int_fits_in_hwi_p (double_int, bool);
|
|
bool double_int_fits_in_shwi_p (double_int);
|
|
bool double_int_fits_in_uhwi_p (double_int);
|
|
HOST_WIDE_INT double_int_to_shwi (double_int);
|
|
unsigned HOST_WIDE_INT double_int_to_uhwi (double_int);
|
|
double_int double_int_div (double_int, double_int, bool, unsigned);
|
|
double_int double_int_sdiv (double_int, double_int, unsigned);
|
|
double_int double_int_udiv (double_int, double_int, unsigned);
|
|
double_int double_int_mod (double_int, double_int, bool, unsigned);
|
|
double_int double_int_smod (double_int, double_int, unsigned);
|
|
double_int double_int_umod (double_int, double_int, unsigned);
|
|
double_int double_int_divmod (double_int, double_int, bool, unsigned, double_int *);
|
|
double_int double_int_sdivmod (double_int, double_int, unsigned, double_int *);
|
|
double_int double_int_udivmod (double_int, double_int, unsigned, double_int *);
|
|
bool double_int_negative_p (double_int);
|
|
int double_int_cmp (double_int, double_int, bool);
|
|
int double_int_scmp (double_int, double_int);
|
|
int double_int_ucmp (double_int, double_int);
|
|
void dump_double_int (FILE *, double_int, bool);
|
|
|
|
/* Zero and sign extension of numbers in smaller precisions. */
|
|
|
|
double_int double_int_ext (double_int, unsigned, bool);
|
|
double_int double_int_sext (double_int, unsigned);
|
|
double_int double_int_zext (double_int, unsigned);
|
|
double_int double_int_mask (unsigned);
|
|
|
|
#define ALL_ONES (~((unsigned HOST_WIDE_INT) 0))
|
|
|
|
/* The operands of the following comparison functions must be processed
|
|
with double_int_ext, if their precision is less than
|
|
2 * HOST_BITS_PER_WIDE_INT bits. */
|
|
|
|
/* Returns true if CST is zero. */
|
|
|
|
static inline bool
|
|
double_int_zero_p (double_int cst)
|
|
{
|
|
return cst.low == 0 && cst.high == 0;
|
|
}
|
|
|
|
/* Returns true if CST is one. */
|
|
|
|
static inline bool
|
|
double_int_one_p (double_int cst)
|
|
{
|
|
return cst.low == 1 && cst.high == 0;
|
|
}
|
|
|
|
/* Returns true if CST is minus one. */
|
|
|
|
static inline bool
|
|
double_int_minus_one_p (double_int cst)
|
|
{
|
|
return (cst.low == ALL_ONES && cst.high == -1);
|
|
}
|
|
|
|
/* Returns true if CST1 == CST2. */
|
|
|
|
static inline bool
|
|
double_int_equal_p (double_int cst1, double_int cst2)
|
|
{
|
|
return cst1.low == cst2.low && cst1.high == cst2.high;
|
|
}
|
|
|
|
#endif /* DOUBLE_INT_H */
|