2008-06-04 23:49:45 +02:00
|
|
|
|
/* Conditional Dead Call Elimination pass for the GNU compiler.
|
|
|
|
|
Copyright (C) 2008
|
|
|
|
|
Free Software Foundation, Inc.
|
|
|
|
|
Contributed by Xinliang David Li <davidxl@google.com>
|
|
|
|
|
|
|
|
|
|
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/>. */
|
|
|
|
|
|
|
|
|
|
#include "config.h"
|
|
|
|
|
#include "system.h"
|
|
|
|
|
#include "coretypes.h"
|
|
|
|
|
#include "tm.h"
|
|
|
|
|
#include "ggc.h"
|
|
|
|
|
|
|
|
|
|
/* These RTL headers are needed for basic-block.h. */
|
|
|
|
|
#include "rtl.h"
|
|
|
|
|
#include "tm_p.h"
|
|
|
|
|
#include "hard-reg-set.h"
|
|
|
|
|
#include "obstack.h"
|
|
|
|
|
#include "basic-block.h"
|
|
|
|
|
|
|
|
|
|
#include "tree.h"
|
|
|
|
|
#include "diagnostic.h"
|
|
|
|
|
#include "tree-flow.h"
|
2008-07-28 16:33:56 +02:00
|
|
|
|
#include "gimple.h"
|
2008-06-04 23:49:45 +02:00
|
|
|
|
#include "tree-dump.h"
|
|
|
|
|
#include "tree-pass.h"
|
|
|
|
|
#include "timevar.h"
|
|
|
|
|
#include "flags.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Conditional dead call elimination
|
|
|
|
|
|
|
|
|
|
Some builtin functions can set errno on error conditions, but they
|
|
|
|
|
are otherwise pure. If the result of a call to such a function is
|
|
|
|
|
not used, the compiler can still not eliminate the call without
|
|
|
|
|
powerful interprocedural analysis to prove that the errno is not
|
|
|
|
|
checked. However, if the conditions under which the error occurs
|
|
|
|
|
are known, the compiler can conditionally dead code eliminate the
|
|
|
|
|
calls by shrink-wrapping the semi-dead calls into the error condition:
|
|
|
|
|
|
|
|
|
|
built_in_call (args)
|
|
|
|
|
==>
|
|
|
|
|
if (error_cond (args))
|
|
|
|
|
built_in_call (args)
|
|
|
|
|
|
|
|
|
|
An actual simple example is :
|
|
|
|
|
log (x); // Mostly dead call
|
|
|
|
|
==>
|
|
|
|
|
if (x < 0)
|
|
|
|
|
log (x);
|
|
|
|
|
With this change, call to log (x) is effectively eliminated, as
|
|
|
|
|
in majority of the cases, log won't be called with x out of
|
|
|
|
|
range. The branch is totally predictable, so the branch cost
|
|
|
|
|
is low.
|
|
|
|
|
|
|
|
|
|
Note that library functions are not supposed to clear errno to zero without
|
|
|
|
|
error. See IEEE Std 1003.1, section 2.3 Error Numbers, and section 7.5:3 of
|
|
|
|
|
ISO/IEC 9899 (C99).
|
|
|
|
|
|
|
|
|
|
The condition wrapping the builtin call is conservatively set to avoid too
|
|
|
|
|
aggressive (wrong) shrink wrapping. The optimization is called conditional
|
|
|
|
|
dead call elimination because the call is eliminated under the condition
|
|
|
|
|
that the input arguments would not lead to domain or range error (for
|
|
|
|
|
instance when x <= 0 for a log (x) call), however the chances that the error
|
|
|
|
|
condition is hit is very low (those builtin calls which are conditionally
|
|
|
|
|
dead are usually part of the C++ abstraction penalty exposed after
|
|
|
|
|
inlining). */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* A structure for representing input domain of
|
|
|
|
|
a function argument in integer. If the lower
|
|
|
|
|
bound is -inf, has_lb is set to false. If the
|
|
|
|
|
upper bound is +inf, has_ub is false.
|
|
|
|
|
is_lb_inclusive and is_ub_inclusive are flags
|
|
|
|
|
to indicate if lb and ub value are inclusive
|
|
|
|
|
respectively. */
|
|
|
|
|
|
|
|
|
|
typedef struct input_domain
|
|
|
|
|
{
|
|
|
|
|
int lb;
|
|
|
|
|
int ub;
|
|
|
|
|
bool has_lb;
|
|
|
|
|
bool has_ub;
|
|
|
|
|
bool is_lb_inclusive;
|
|
|
|
|
bool is_ub_inclusive;
|
|
|
|
|
} inp_domain;
|
|
|
|
|
|
|
|
|
|
/* A helper function to construct and return an input
|
|
|
|
|
domain object. LB is the lower bound, HAS_LB is
|
|
|
|
|
a boolean flag indicating if the lower bound exists,
|
|
|
|
|
and LB_INCLUSIVE is a boolean flag indicating if the
|
|
|
|
|
lower bound is inclusive or not. UB, HAS_UB, and
|
|
|
|
|
UB_INCLUSIVE have the same meaning, but for upper
|
|
|
|
|
bound of the domain. */
|
|
|
|
|
|
|
|
|
|
static inp_domain
|
|
|
|
|
get_domain (int lb, bool has_lb, bool lb_inclusive,
|
|
|
|
|
int ub, bool has_ub, bool ub_inclusive)
|
|
|
|
|
{
|
|
|
|
|
inp_domain domain;
|
|
|
|
|
domain.lb = lb;
|
|
|
|
|
domain.has_lb = has_lb;
|
|
|
|
|
domain.is_lb_inclusive = lb_inclusive;
|
|
|
|
|
domain.ub = ub;
|
|
|
|
|
domain.has_ub = has_ub;
|
|
|
|
|
domain.is_ub_inclusive = ub_inclusive;
|
|
|
|
|
return domain;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A helper function to check the target format for the
|
|
|
|
|
argument type. In this implementation, only IEEE formats
|
|
|
|
|
are supported. ARG is the call argument to be checked.
|
|
|
|
|
Returns true if the format is supported. To support other
|
|
|
|
|
target formats, function get_no_error_domain needs to be
|
|
|
|
|
enhanced to have range bounds properly computed. Since
|
|
|
|
|
the check is cheap (very small number of candidates
|
|
|
|
|
to be checked), the result is not cached for each float type. */
|
|
|
|
|
|
|
|
|
|
static bool
|
|
|
|
|
check_target_format (tree arg)
|
|
|
|
|
{
|
|
|
|
|
tree type;
|
|
|
|
|
enum machine_mode mode;
|
|
|
|
|
const struct real_format *rfmt;
|
|
|
|
|
|
|
|
|
|
type = TREE_TYPE (arg);
|
|
|
|
|
mode = TYPE_MODE (type);
|
|
|
|
|
rfmt = REAL_MODE_FORMAT (mode);
|
2008-07-14 00:27:58 +02:00
|
|
|
|
if ((mode == SFmode
|
2008-09-14 19:58:14 +02:00
|
|
|
|
&& (rfmt == &ieee_single_format || rfmt == &mips_single_format
|
|
|
|
|
|| rfmt == &motorola_single_format))
|
2008-07-14 00:27:58 +02:00
|
|
|
|
|| (mode == DFmode
|
2008-09-14 19:58:14 +02:00
|
|
|
|
&& (rfmt == &ieee_double_format || rfmt == &mips_double_format
|
|
|
|
|
|| rfmt == &motorola_double_format))
|
2008-06-04 23:49:45 +02:00
|
|
|
|
/* For long double, we can not really check XFmode
|
|
|
|
|
which is only defined on intel platforms.
|
|
|
|
|
Candidate pre-selection using builtin function
|
|
|
|
|
code guarantees that we are checking formats
|
|
|
|
|
for long double modes: double, quad, and extended. */
|
|
|
|
|
|| (mode != SFmode && mode != DFmode
|
|
|
|
|
&& (rfmt == &ieee_quad_format
|
2008-07-14 00:27:58 +02:00
|
|
|
|
|| rfmt == &mips_quad_format
|
2008-09-14 19:58:14 +02:00
|
|
|
|
|| rfmt == &ieee_extended_motorola_format
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|| rfmt == &ieee_extended_intel_96_format
|
|
|
|
|
|| rfmt == &ieee_extended_intel_128_format
|
|
|
|
|
|| rfmt == &ieee_extended_intel_96_round_53_format)))
|
|
|
|
|
return true;
|
|
|
|
|
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* A helper function to help select calls to pow that are suitable for
|
|
|
|
|
conditional DCE transformation. It looks for pow calls that can be
|
|
|
|
|
guided with simple conditions. Such calls either have constant base
|
|
|
|
|
values or base values converted from integers. Returns true if
|
|
|
|
|
the pow call POW_CALL is a candidate. */
|
|
|
|
|
|
|
|
|
|
/* The maximum integer bit size for base argument of a pow call
|
|
|
|
|
that is suitable for shrink-wrapping transformation. */
|
|
|
|
|
#define MAX_BASE_INT_BIT_SIZE 32
|
|
|
|
|
|
|
|
|
|
static bool
|
2008-07-28 16:33:56 +02:00
|
|
|
|
check_pow (gimple pow_call)
|
2008-06-04 23:49:45 +02:00
|
|
|
|
{
|
|
|
|
|
tree base, expn;
|
|
|
|
|
enum tree_code bc, ec;
|
|
|
|
|
|
2008-07-28 16:33:56 +02:00
|
|
|
|
if (gimple_call_num_args (pow_call) != 2)
|
2008-06-04 23:49:45 +02:00
|
|
|
|
return false;
|
|
|
|
|
|
2008-07-28 16:33:56 +02:00
|
|
|
|
base = gimple_call_arg (pow_call, 0);
|
|
|
|
|
expn = gimple_call_arg (pow_call, 1);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
if (!check_target_format (expn))
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
bc = TREE_CODE (base);
|
|
|
|
|
ec = TREE_CODE (expn);
|
|
|
|
|
|
|
|
|
|
/* Folding candidates are not interesting.
|
|
|
|
|
Can actually assert that it is already folded. */
|
|
|
|
|
if (ec == REAL_CST && bc == REAL_CST)
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
if (bc == REAL_CST)
|
|
|
|
|
{
|
|
|
|
|
/* Only handle a fixed range of constant. */
|
|
|
|
|
REAL_VALUE_TYPE mv;
|
|
|
|
|
REAL_VALUE_TYPE bcv = TREE_REAL_CST (base);
|
|
|
|
|
if (REAL_VALUES_EQUAL (bcv, dconst1))
|
|
|
|
|
return false;
|
|
|
|
|
if (REAL_VALUES_LESS (bcv, dconst1))
|
|
|
|
|
return false;
|
|
|
|
|
real_from_integer (&mv, TYPE_MODE (TREE_TYPE (base)), 256, 0, 1);
|
|
|
|
|
if (REAL_VALUES_LESS (mv, bcv))
|
|
|
|
|
return false;
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
else if (bc == SSA_NAME)
|
|
|
|
|
{
|
2008-07-28 16:33:56 +02:00
|
|
|
|
tree base_val0, base_var, type;
|
|
|
|
|
gimple base_def;
|
2008-06-04 23:49:45 +02:00
|
|
|
|
int bit_sz;
|
|
|
|
|
|
|
|
|
|
/* Only handles cases where base value is converted
|
|
|
|
|
from integer values. */
|
|
|
|
|
base_def = SSA_NAME_DEF_STMT (base);
|
2008-07-28 16:33:56 +02:00
|
|
|
|
if (gimple_code (base_def) != GIMPLE_ASSIGN)
|
2008-06-04 23:49:45 +02:00
|
|
|
|
return false;
|
|
|
|
|
|
2008-07-28 16:33:56 +02:00
|
|
|
|
if (gimple_assign_rhs_code (base_def) != FLOAT_EXPR)
|
2008-06-04 23:49:45 +02:00
|
|
|
|
return false;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
base_val0 = gimple_assign_rhs1 (base_def);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
base_var = SSA_NAME_VAR (base_val0);
|
|
|
|
|
if (!DECL_P (base_var))
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
type = TREE_TYPE (base_var);
|
|
|
|
|
if (TREE_CODE (type) != INTEGER_TYPE)
|
|
|
|
|
return false;
|
|
|
|
|
bit_sz = TYPE_PRECISION (type);
|
|
|
|
|
/* If the type of the base is too wide,
|
|
|
|
|
the resulting shrink wrapping condition
|
|
|
|
|
will be too conservative. */
|
|
|
|
|
if (bit_sz > MAX_BASE_INT_BIT_SIZE)
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A helper function to help select candidate function calls that are
|
|
|
|
|
suitable for conditional DCE. Candidate functions must have single
|
|
|
|
|
valid input domain in this implementation except for pow (see check_pow).
|
|
|
|
|
Returns true if the function call is a candidate. */
|
|
|
|
|
|
|
|
|
|
static bool
|
2008-07-28 16:33:56 +02:00
|
|
|
|
check_builtin_call (gimple bcall)
|
2008-06-04 23:49:45 +02:00
|
|
|
|
{
|
|
|
|
|
tree arg;
|
|
|
|
|
|
2008-07-28 16:33:56 +02:00
|
|
|
|
arg = gimple_call_arg (bcall, 0);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
return check_target_format (arg);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A helper function to determine if a builtin function call is a
|
|
|
|
|
candidate for conditional DCE. Returns true if the builtin call
|
|
|
|
|
is a candidate. */
|
|
|
|
|
|
|
|
|
|
static bool
|
2008-07-28 16:33:56 +02:00
|
|
|
|
is_call_dce_candidate (gimple call)
|
2008-06-04 23:49:45 +02:00
|
|
|
|
{
|
|
|
|
|
tree fn;
|
|
|
|
|
enum built_in_function fnc;
|
|
|
|
|
|
2008-07-28 16:33:56 +02:00
|
|
|
|
/* Only potentially dead calls are considered. */
|
|
|
|
|
if (gimple_call_lhs (call))
|
2008-06-04 23:49:45 +02:00
|
|
|
|
return false;
|
|
|
|
|
|
2008-07-28 16:33:56 +02:00
|
|
|
|
fn = gimple_call_fndecl (call);
|
|
|
|
|
if (!fn
|
|
|
|
|
|| !DECL_BUILT_IN (fn)
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|| (DECL_BUILT_IN_CLASS (fn) != BUILT_IN_NORMAL))
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
fnc = DECL_FUNCTION_CODE (fn);
|
|
|
|
|
switch (fnc)
|
|
|
|
|
{
|
|
|
|
|
/* Trig functions. */
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_ACOS):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_ASIN):
|
|
|
|
|
/* Hyperbolic functions. */
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_ACOSH):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_ATANH):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_COSH):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_SINH):
|
|
|
|
|
/* Log functions. */
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_LOG):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_LOG2):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_LOG10):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_LOG1P):
|
|
|
|
|
/* Exp functions. */
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_EXP):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_EXP2):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_EXP10):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_EXPM1):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_POW10):
|
|
|
|
|
/* Sqrt. */
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_SQRT):
|
|
|
|
|
return check_builtin_call (call);
|
|
|
|
|
/* Special one: two argument pow. */
|
|
|
|
|
case BUILT_IN_POW:
|
|
|
|
|
return check_pow (call);
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* A helper function to generate gimple statements for
|
|
|
|
|
one bound comparison. ARG is the call argument to
|
|
|
|
|
be compared with the bound, LBUB is the bound value
|
|
|
|
|
in integer, TCODE is the tree_code of the comparison,
|
|
|
|
|
TEMP_NAME1/TEMP_NAME2 are names of the temporaries,
|
|
|
|
|
CONDS is a vector holding the produced GIMPLE statements,
|
|
|
|
|
and NCONDS points to the variable holding the number
|
|
|
|
|
of logical comparisons. CONDS is either empty or
|
|
|
|
|
a list ended with a null tree. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
gen_one_condition (tree arg, int lbub,
|
|
|
|
|
enum tree_code tcode,
|
|
|
|
|
const char *temp_name1,
|
2008-07-28 16:33:56 +02:00
|
|
|
|
const char *temp_name2,
|
|
|
|
|
VEC (gimple, heap) *conds,
|
2008-06-04 23:49:45 +02:00
|
|
|
|
unsigned *nconds)
|
|
|
|
|
{
|
|
|
|
|
tree lbub_real_cst, lbub_cst, float_type;
|
|
|
|
|
tree temp, tempn, tempc, tempcn;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple stmt1, stmt2, stmt3;
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
float_type = TREE_TYPE (arg);
|
|
|
|
|
lbub_cst = build_int_cst (integer_type_node, lbub);
|
|
|
|
|
lbub_real_cst = build_real_from_int_cst (float_type, lbub_cst);
|
|
|
|
|
|
|
|
|
|
temp = create_tmp_var (float_type, temp_name1);
|
2008-07-28 16:33:56 +02:00
|
|
|
|
stmt1 = gimple_build_assign (temp, arg);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
tempn = make_ssa_name (temp, stmt1);
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple_assign_set_lhs (stmt1, tempn);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
tempc = create_tmp_var (boolean_type_node, temp_name2);
|
2008-07-28 16:33:56 +02:00
|
|
|
|
stmt2 = gimple_build_assign (tempc,
|
|
|
|
|
fold_build2 (tcode,
|
|
|
|
|
boolean_type_node,
|
|
|
|
|
tempn, lbub_real_cst));
|
2008-06-04 23:49:45 +02:00
|
|
|
|
tempcn = make_ssa_name (tempc, stmt2);
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple_assign_set_lhs (stmt2, tempcn);
|
|
|
|
|
|
|
|
|
|
stmt3 = gimple_build_cond_from_tree (tempcn, NULL_TREE, NULL_TREE);
|
|
|
|
|
VEC_quick_push (gimple, conds, stmt1);
|
|
|
|
|
VEC_quick_push (gimple, conds, stmt2);
|
|
|
|
|
VEC_quick_push (gimple, conds, stmt3);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
(*nconds)++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A helper function to generate GIMPLE statements for
|
|
|
|
|
out of input domain check. ARG is the call argument
|
|
|
|
|
to be runtime checked, DOMAIN holds the valid domain
|
|
|
|
|
for the given function, CONDS points to the vector
|
|
|
|
|
holding the result GIMPLE statements. *NCONDS is
|
|
|
|
|
the number of logical comparisons. This function
|
|
|
|
|
produces no more than two logical comparisons, one
|
|
|
|
|
for lower bound check, one for upper bound check. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
gen_conditions_for_domain (tree arg, inp_domain domain,
|
2008-07-28 16:33:56 +02:00
|
|
|
|
VEC (gimple, heap) *conds,
|
2008-06-04 23:49:45 +02:00
|
|
|
|
unsigned *nconds)
|
|
|
|
|
{
|
|
|
|
|
if (domain.has_lb)
|
|
|
|
|
gen_one_condition (arg, domain.lb,
|
|
|
|
|
(domain.is_lb_inclusive
|
|
|
|
|
? LT_EXPR : LE_EXPR),
|
|
|
|
|
"DCE_COND_LB", "DCE_COND_LB_TEST",
|
|
|
|
|
conds, nconds);
|
|
|
|
|
|
|
|
|
|
if (domain.has_ub)
|
|
|
|
|
{
|
|
|
|
|
/* Now push a separator. */
|
|
|
|
|
if (domain.has_lb)
|
2008-07-28 16:33:56 +02:00
|
|
|
|
VEC_quick_push (gimple, conds, NULL);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
gen_one_condition (arg, domain.ub,
|
|
|
|
|
(domain.is_ub_inclusive
|
|
|
|
|
? GT_EXPR : GE_EXPR),
|
|
|
|
|
"DCE_COND_UB", "DCE_COND_UB_TEST",
|
|
|
|
|
conds, nconds);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* A helper function to generate condition
|
|
|
|
|
code for the y argument in call pow (some_const, y).
|
|
|
|
|
See candidate selection in check_pow. Since the
|
|
|
|
|
candidates' base values have a limited range,
|
|
|
|
|
the guarded code generated for y are simple:
|
|
|
|
|
if (y > max_y)
|
|
|
|
|
pow (const, y);
|
|
|
|
|
Note max_y can be computed separately for each
|
|
|
|
|
const base, but in this implementation, we
|
|
|
|
|
choose to compute it using the max base
|
|
|
|
|
in the allowed range for the purpose of
|
|
|
|
|
simplicity. BASE is the constant base value,
|
|
|
|
|
EXPN is the expression for the exponent argument,
|
|
|
|
|
*CONDS is the vector to hold resulting statements,
|
|
|
|
|
and *NCONDS is the number of logical conditions. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
gen_conditions_for_pow_cst_base (tree base, tree expn,
|
2008-07-28 16:33:56 +02:00
|
|
|
|
VEC (gimple, heap) *conds,
|
2008-06-04 23:49:45 +02:00
|
|
|
|
unsigned *nconds)
|
|
|
|
|
{
|
|
|
|
|
inp_domain exp_domain;
|
|
|
|
|
/* Validate the range of the base constant to make
|
|
|
|
|
sure it is consistent with check_pow. */
|
|
|
|
|
REAL_VALUE_TYPE mv;
|
|
|
|
|
REAL_VALUE_TYPE bcv = TREE_REAL_CST (base);
|
|
|
|
|
gcc_assert (!REAL_VALUES_EQUAL (bcv, dconst1)
|
|
|
|
|
&& !REAL_VALUES_LESS (bcv, dconst1));
|
|
|
|
|
real_from_integer (&mv, TYPE_MODE (TREE_TYPE (base)), 256, 0, 1);
|
|
|
|
|
gcc_assert (!REAL_VALUES_LESS (mv, bcv));
|
|
|
|
|
|
|
|
|
|
exp_domain = get_domain (0, false, false,
|
|
|
|
|
127, true, false);
|
|
|
|
|
|
|
|
|
|
gen_conditions_for_domain (expn, exp_domain,
|
|
|
|
|
conds, nconds);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Generate error condition code for pow calls with
|
|
|
|
|
non constant base values. The candidates selected
|
|
|
|
|
have their base argument value converted from
|
|
|
|
|
integer (see check_pow) value (1, 2, 4 bytes), and
|
|
|
|
|
the max exp value is computed based on the size
|
|
|
|
|
of the integer type (i.e. max possible base value).
|
|
|
|
|
The resulting input domain for exp argument is thus
|
|
|
|
|
conservative (smaller than the max value allowed by
|
|
|
|
|
the runtime value of the base). BASE is the integer
|
|
|
|
|
base value, EXPN is the expression for the exponent
|
|
|
|
|
argument, *CONDS is the vector to hold resulting
|
|
|
|
|
statements, and *NCONDS is the number of logical
|
|
|
|
|
conditions. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
gen_conditions_for_pow_int_base (tree base, tree expn,
|
2008-07-28 16:33:56 +02:00
|
|
|
|
VEC (gimple, heap) *conds,
|
2008-06-04 23:49:45 +02:00
|
|
|
|
unsigned *nconds)
|
|
|
|
|
{
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple base_def;
|
|
|
|
|
tree base_nm, base_val0;
|
2008-06-04 23:49:45 +02:00
|
|
|
|
tree base_var, int_type;
|
|
|
|
|
tree temp, tempn;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
tree cst0;
|
|
|
|
|
gimple stmt1, stmt2;
|
2008-06-04 23:49:45 +02:00
|
|
|
|
int bit_sz, max_exp;
|
|
|
|
|
inp_domain exp_domain;
|
|
|
|
|
|
|
|
|
|
base_def = SSA_NAME_DEF_STMT (base);
|
2008-07-28 16:33:56 +02:00
|
|
|
|
base_nm = gimple_assign_lhs (base_def);
|
|
|
|
|
base_val0 = gimple_assign_rhs1 (base_def);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
base_var = SSA_NAME_VAR (base_val0);
|
|
|
|
|
int_type = TREE_TYPE (base_var);
|
|
|
|
|
bit_sz = TYPE_PRECISION (int_type);
|
|
|
|
|
gcc_assert (bit_sz > 0
|
|
|
|
|
&& bit_sz <= MAX_BASE_INT_BIT_SIZE);
|
|
|
|
|
|
|
|
|
|
/* Determine the max exp argument value according to
|
|
|
|
|
the size of the base integer. The max exp value
|
|
|
|
|
is conservatively estimated assuming IEEE754 double
|
|
|
|
|
precision format. */
|
|
|
|
|
if (bit_sz == 8)
|
|
|
|
|
max_exp = 128;
|
|
|
|
|
else if (bit_sz == 16)
|
|
|
|
|
max_exp = 64;
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
gcc_assert (bit_sz == MAX_BASE_INT_BIT_SIZE);
|
|
|
|
|
max_exp = 32;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* For pow ((double)x, y), generate the following conditions:
|
|
|
|
|
cond 1:
|
|
|
|
|
temp1 = x;
|
|
|
|
|
if (temp1 <= 0)
|
|
|
|
|
|
|
|
|
|
cond 2:
|
|
|
|
|
temp2 = y;
|
|
|
|
|
if (temp2 > max_exp_real_cst) */
|
|
|
|
|
|
|
|
|
|
/* Generate condition in reverse order -- first
|
|
|
|
|
the condition for the exp argument. */
|
|
|
|
|
|
|
|
|
|
exp_domain = get_domain (0, false, false,
|
|
|
|
|
max_exp, true, true);
|
|
|
|
|
|
|
|
|
|
gen_conditions_for_domain (expn, exp_domain,
|
|
|
|
|
conds, nconds);
|
|
|
|
|
|
|
|
|
|
/* Now generate condition for the base argument.
|
|
|
|
|
Note it does not use the helper function
|
|
|
|
|
gen_conditions_for_domain because the base
|
|
|
|
|
type is integer. */
|
|
|
|
|
|
|
|
|
|
/* Push a separator. */
|
2008-07-28 16:33:56 +02:00
|
|
|
|
VEC_quick_push (gimple, conds, NULL);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
temp = create_tmp_var (int_type, "DCE_COND1");
|
|
|
|
|
cst0 = build_int_cst (int_type, 0);
|
2008-07-28 16:33:56 +02:00
|
|
|
|
stmt1 = gimple_build_assign (temp, base_val0);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
tempn = make_ssa_name (temp, stmt1);
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple_assign_set_lhs (stmt1, tempn);
|
|
|
|
|
stmt2 = gimple_build_cond (LE_EXPR, tempn, cst0, NULL_TREE, NULL_TREE);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
2008-07-28 16:33:56 +02:00
|
|
|
|
VEC_quick_push (gimple, conds, stmt1);
|
|
|
|
|
VEC_quick_push (gimple, conds, stmt2);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
(*nconds)++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Method to generate conditional statements for guarding conditionally
|
|
|
|
|
dead calls to pow. One or more statements can be generated for
|
|
|
|
|
each logical condition. Statement groups of different conditions
|
|
|
|
|
are separated by a NULL tree and they are stored in the VEC
|
|
|
|
|
conds. The number of logical conditions are stored in *nconds.
|
|
|
|
|
|
|
|
|
|
See C99 standard, 7.12.7.4:2, for description of pow (x, y).
|
|
|
|
|
The precise condition for domain errors are complex. In this
|
|
|
|
|
implementation, a simplified (but conservative) valid domain
|
|
|
|
|
for x and y are used: x is positive to avoid dom errors, while
|
|
|
|
|
y is smaller than a upper bound (depending on x) to avoid range
|
|
|
|
|
errors. Runtime code is generated to check x (if not constant)
|
|
|
|
|
and y against the valid domain. If it is out, jump to the call,
|
|
|
|
|
otherwise the call is bypassed. POW_CALL is the call statement,
|
|
|
|
|
*CONDS is a vector holding the resulting condition statements,
|
|
|
|
|
and *NCONDS is the number of logical conditions. */
|
|
|
|
|
|
|
|
|
|
static void
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gen_conditions_for_pow (gimple pow_call, VEC (gimple, heap) *conds,
|
2008-06-04 23:49:45 +02:00
|
|
|
|
unsigned *nconds)
|
|
|
|
|
{
|
|
|
|
|
tree base, expn;
|
|
|
|
|
enum tree_code bc, ec;
|
|
|
|
|
|
|
|
|
|
#ifdef ENABLE_CHECKING
|
|
|
|
|
gcc_assert (check_pow (pow_call));
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
*nconds = 0;
|
|
|
|
|
|
2008-07-28 16:33:56 +02:00
|
|
|
|
base = gimple_call_arg (pow_call, 0);
|
|
|
|
|
expn = gimple_call_arg (pow_call, 1);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
bc = TREE_CODE (base);
|
|
|
|
|
ec = TREE_CODE (expn);
|
|
|
|
|
|
|
|
|
|
if (bc == REAL_CST)
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gen_conditions_for_pow_cst_base (base, expn, conds, nconds);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
else if (bc == SSA_NAME)
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gen_conditions_for_pow_int_base (base, expn, conds, nconds);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
else
|
|
|
|
|
gcc_unreachable ();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* A helper routine to help computing the valid input domain
|
|
|
|
|
for a builtin function. See C99 7.12.7 for details. In this
|
|
|
|
|
implementation, we only handle single region domain. The
|
|
|
|
|
resulting region can be conservative (smaller) than the actual
|
|
|
|
|
one and rounded to integers. Some of the bounds are documented
|
|
|
|
|
in the standard, while other limit constants are computed
|
|
|
|
|
assuming IEEE floating point format (for SF and DF modes).
|
|
|
|
|
Since IEEE only sets minimum requirements for long double format,
|
|
|
|
|
different long double formats exist under different implementations
|
|
|
|
|
(e.g, 64 bit double precision (DF), 80 bit double-extended
|
|
|
|
|
precision (XF), and 128 bit quad precision (QF) ). For simplicity,
|
|
|
|
|
in this implementation, the computed bounds for long double assume
|
|
|
|
|
64 bit format (DF), and are therefore conservative. Another
|
|
|
|
|
assumption is that single precision float type is always SF mode,
|
|
|
|
|
and double type is DF mode. This function is quite
|
|
|
|
|
implementation specific, so it may not be suitable to be part of
|
|
|
|
|
builtins.c. This needs to be revisited later to see if it can
|
|
|
|
|
be leveraged in x87 assembly expansion. */
|
|
|
|
|
|
|
|
|
|
static inp_domain
|
|
|
|
|
get_no_error_domain (enum built_in_function fnc)
|
|
|
|
|
{
|
|
|
|
|
switch (fnc)
|
|
|
|
|
{
|
|
|
|
|
/* Trig functions: return [-1, +1] */
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_ACOS):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_ASIN):
|
|
|
|
|
return get_domain (-1, true, true,
|
|
|
|
|
1, true, true);
|
|
|
|
|
/* Hyperbolic functions. */
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_ACOSH):
|
|
|
|
|
/* acosh: [1, +inf) */
|
|
|
|
|
return get_domain (1, true, true,
|
|
|
|
|
1, false, false);
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_ATANH):
|
|
|
|
|
/* atanh: (-1, +1) */
|
|
|
|
|
return get_domain (-1, true, false,
|
|
|
|
|
1, true, false);
|
|
|
|
|
case BUILT_IN_COSHF:
|
|
|
|
|
case BUILT_IN_SINHF:
|
|
|
|
|
/* coshf: (-89, +89) */
|
|
|
|
|
return get_domain (-89, true, false,
|
|
|
|
|
89, true, false);
|
|
|
|
|
case BUILT_IN_COSH:
|
|
|
|
|
case BUILT_IN_SINH:
|
|
|
|
|
case BUILT_IN_COSHL:
|
|
|
|
|
case BUILT_IN_SINHL:
|
|
|
|
|
/* cosh: (-710, +710) */
|
|
|
|
|
return get_domain (-710, true, false,
|
|
|
|
|
710, true, false);
|
|
|
|
|
/* Log functions: (0, +inf) */
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_LOG):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_LOG2):
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_LOG10):
|
|
|
|
|
return get_domain (0, true, false,
|
|
|
|
|
0, false, false);
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_LOG1P):
|
|
|
|
|
return get_domain (-1, true, false,
|
|
|
|
|
0, false, false);
|
|
|
|
|
/* Exp functions. */
|
|
|
|
|
case BUILT_IN_EXPF:
|
|
|
|
|
case BUILT_IN_EXPM1F:
|
|
|
|
|
/* expf: (-inf, 88) */
|
|
|
|
|
return get_domain (-1, false, false,
|
|
|
|
|
88, true, false);
|
|
|
|
|
case BUILT_IN_EXP:
|
|
|
|
|
case BUILT_IN_EXPM1:
|
|
|
|
|
case BUILT_IN_EXPL:
|
|
|
|
|
case BUILT_IN_EXPM1L:
|
|
|
|
|
/* exp: (-inf, 709) */
|
|
|
|
|
return get_domain (-1, false, false,
|
|
|
|
|
709, true, false);
|
|
|
|
|
case BUILT_IN_EXP2F:
|
|
|
|
|
/* exp2f: (-inf, 128) */
|
|
|
|
|
return get_domain (-1, false, false,
|
|
|
|
|
128, true, false);
|
|
|
|
|
case BUILT_IN_EXP2:
|
|
|
|
|
case BUILT_IN_EXP2L:
|
|
|
|
|
/* exp2: (-inf, 1024) */
|
|
|
|
|
return get_domain (-1, false, false,
|
|
|
|
|
1024, true, false);
|
|
|
|
|
case BUILT_IN_EXP10F:
|
|
|
|
|
case BUILT_IN_POW10F:
|
|
|
|
|
/* exp10f: (-inf, 38) */
|
|
|
|
|
return get_domain (-1, false, false,
|
|
|
|
|
38, true, false);
|
|
|
|
|
case BUILT_IN_EXP10:
|
|
|
|
|
case BUILT_IN_POW10:
|
|
|
|
|
case BUILT_IN_EXP10L:
|
|
|
|
|
case BUILT_IN_POW10L:
|
|
|
|
|
/* exp10: (-inf, 308) */
|
|
|
|
|
return get_domain (-1, false, false,
|
|
|
|
|
308, true, false);
|
|
|
|
|
/* sqrt: [0, +inf) */
|
|
|
|
|
CASE_FLT_FN (BUILT_IN_SQRT):
|
|
|
|
|
return get_domain (0, true, true,
|
|
|
|
|
0, false, false);
|
|
|
|
|
default:
|
|
|
|
|
gcc_unreachable ();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
gcc_unreachable ();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* The function to generate shrink wrap conditions for a partially
|
|
|
|
|
dead builtin call whose return value is not used anywhere,
|
|
|
|
|
but has to be kept live due to potential error condition.
|
|
|
|
|
BI_CALL is the builtin call, CONDS is the vector of statements
|
|
|
|
|
for condition code, NCODES is the pointer to the number of
|
|
|
|
|
logical conditions. Statements belonging to different logical
|
|
|
|
|
condition are separated by NULL tree in the vector. */
|
|
|
|
|
|
|
|
|
|
static void
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gen_shrink_wrap_conditions (gimple bi_call, VEC (gimple, heap) *conds,
|
2008-06-04 23:49:45 +02:00
|
|
|
|
unsigned int *nconds)
|
|
|
|
|
{
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple call;
|
|
|
|
|
tree fn;
|
2008-06-04 23:49:45 +02:00
|
|
|
|
enum built_in_function fnc;
|
|
|
|
|
|
|
|
|
|
gcc_assert (nconds && conds);
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gcc_assert (VEC_length (gimple, conds) == 0);
|
|
|
|
|
gcc_assert (is_gimple_call (bi_call));
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
call = bi_call;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
fn = gimple_call_fndecl (call);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
gcc_assert (fn && DECL_BUILT_IN (fn));
|
|
|
|
|
fnc = DECL_FUNCTION_CODE (fn);
|
|
|
|
|
*nconds = 0;
|
|
|
|
|
|
|
|
|
|
if (fnc == BUILT_IN_POW)
|
|
|
|
|
gen_conditions_for_pow (call, conds, nconds);
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
tree arg;
|
|
|
|
|
inp_domain domain = get_no_error_domain (fnc);
|
|
|
|
|
*nconds = 0;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
arg = gimple_call_arg (bi_call, 0);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
gen_conditions_for_domain (arg, domain, conds, nconds);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Probability of the branch (to the call) is taken. */
|
|
|
|
|
#define ERR_PROB 0.01
|
|
|
|
|
|
|
|
|
|
/* The function to shrink wrap a partially dead builtin call
|
|
|
|
|
whose return value is not used anywhere, but has to be kept
|
|
|
|
|
live due to potential error condition. Returns true if the
|
|
|
|
|
transformation actually happens. */
|
|
|
|
|
|
|
|
|
|
static bool
|
2008-07-28 16:33:56 +02:00
|
|
|
|
shrink_wrap_one_built_in_call (gimple bi_call)
|
2008-06-04 23:49:45 +02:00
|
|
|
|
{
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple_stmt_iterator bi_call_bsi;
|
2008-06-04 23:49:45 +02:00
|
|
|
|
basic_block bi_call_bb, join_tgt_bb, guard_bb, guard_bb0;
|
|
|
|
|
edge join_tgt_in_edge_from_call, join_tgt_in_edge_fall_thru;
|
|
|
|
|
edge bi_call_in_edge0, guard_bb_in_edge;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
VEC (gimple, heap) *conds;
|
2008-06-04 23:49:45 +02:00
|
|
|
|
unsigned tn_cond_stmts, nconds;
|
|
|
|
|
unsigned ci;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple cond_expr = NULL;
|
|
|
|
|
gimple cond_expr_start;
|
2008-06-04 23:49:45 +02:00
|
|
|
|
tree bi_call_label_decl;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple bi_call_label;
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
2008-07-28 16:33:56 +02:00
|
|
|
|
conds = VEC_alloc (gimple, heap, 12);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
gen_shrink_wrap_conditions (bi_call, conds, &nconds);
|
|
|
|
|
|
|
|
|
|
/* This can happen if the condition generator decides
|
|
|
|
|
it is not beneficial to do the transformation. Just
|
|
|
|
|
return false and do not do any transformation for
|
|
|
|
|
the call. */
|
|
|
|
|
if (nconds == 0)
|
|
|
|
|
return false;
|
|
|
|
|
|
2008-07-28 16:33:56 +02:00
|
|
|
|
bi_call_bb = gimple_bb (bi_call);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
/* Now find the join target bb -- split
|
|
|
|
|
bi_call_bb if needed. */
|
2008-07-28 16:33:56 +02:00
|
|
|
|
bi_call_bsi = gsi_for_stmt (bi_call);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
join_tgt_in_edge_from_call = split_block (bi_call_bb, bi_call);
|
2008-07-28 16:33:56 +02:00
|
|
|
|
bi_call_bsi = gsi_for_stmt (bi_call);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
join_tgt_bb = join_tgt_in_edge_from_call->dest;
|
|
|
|
|
|
|
|
|
|
/* Now it is time to insert the first conditional expression
|
|
|
|
|
into bi_call_bb and split this bb so that bi_call is
|
|
|
|
|
shrink-wrapped. */
|
2008-07-28 16:33:56 +02:00
|
|
|
|
tn_cond_stmts = VEC_length (gimple, conds);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
cond_expr = NULL;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
cond_expr_start = VEC_index (gimple, conds, 0);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
for (ci = 0; ci < tn_cond_stmts; ci++)
|
|
|
|
|
{
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple c = VEC_index (gimple, conds, ci);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
gcc_assert (c || ci != 0);
|
|
|
|
|
if (!c)
|
|
|
|
|
break;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gsi_insert_before (&bi_call_bsi, c, GSI_SAME_STMT);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
cond_expr = c;
|
|
|
|
|
}
|
|
|
|
|
nconds--;
|
|
|
|
|
ci++;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gcc_assert (cond_expr && gimple_code (cond_expr) == GIMPLE_COND);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
/* Now the label. */
|
|
|
|
|
bi_call_label_decl = create_artificial_label ();
|
2008-07-28 16:33:56 +02:00
|
|
|
|
bi_call_label = gimple_build_label (bi_call_label_decl);
|
|
|
|
|
gsi_insert_before (&bi_call_bsi, bi_call_label, GSI_SAME_STMT);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
bi_call_in_edge0 = split_block (bi_call_bb, cond_expr);
|
|
|
|
|
bi_call_in_edge0->flags &= ~EDGE_FALLTHRU;
|
|
|
|
|
bi_call_in_edge0->flags |= EDGE_TRUE_VALUE;
|
|
|
|
|
guard_bb0 = bi_call_bb;
|
|
|
|
|
bi_call_bb = bi_call_in_edge0->dest;
|
|
|
|
|
join_tgt_in_edge_fall_thru = make_edge (guard_bb0, join_tgt_bb,
|
|
|
|
|
EDGE_FALSE_VALUE);
|
|
|
|
|
|
|
|
|
|
bi_call_in_edge0->probability = REG_BR_PROB_BASE * ERR_PROB;
|
|
|
|
|
join_tgt_in_edge_fall_thru->probability =
|
|
|
|
|
REG_BR_PROB_BASE - bi_call_in_edge0->probability;
|
|
|
|
|
|
|
|
|
|
/* Code generation for the rest of the conditions */
|
|
|
|
|
guard_bb = guard_bb0;
|
|
|
|
|
while (nconds > 0)
|
|
|
|
|
{
|
|
|
|
|
unsigned ci0;
|
|
|
|
|
edge bi_call_in_edge;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple_stmt_iterator guard_bsi = gsi_for_stmt (cond_expr_start);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
ci0 = ci;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
cond_expr_start = VEC_index (gimple, conds, ci0);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
for (; ci < tn_cond_stmts; ci++)
|
|
|
|
|
{
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple c = VEC_index (gimple, conds, ci);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
gcc_assert (c || ci != ci0);
|
|
|
|
|
if (!c)
|
|
|
|
|
break;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gsi_insert_before (&guard_bsi, c, GSI_SAME_STMT);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
cond_expr = c;
|
|
|
|
|
}
|
|
|
|
|
nconds--;
|
|
|
|
|
ci++;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gcc_assert (cond_expr && gimple_code (cond_expr) == GIMPLE_COND);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
guard_bb_in_edge = split_block (guard_bb, cond_expr);
|
|
|
|
|
guard_bb_in_edge->flags &= ~EDGE_FALLTHRU;
|
|
|
|
|
guard_bb_in_edge->flags |= EDGE_FALSE_VALUE;
|
|
|
|
|
|
|
|
|
|
bi_call_in_edge = make_edge (guard_bb, bi_call_bb, EDGE_TRUE_VALUE);
|
|
|
|
|
|
|
|
|
|
bi_call_in_edge->probability = REG_BR_PROB_BASE * ERR_PROB;
|
|
|
|
|
guard_bb_in_edge->probability =
|
|
|
|
|
REG_BR_PROB_BASE - bi_call_in_edge->probability;
|
|
|
|
|
}
|
|
|
|
|
|
2008-07-28 16:33:56 +02:00
|
|
|
|
VEC_free (gimple, heap, conds);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
if (dump_file && (dump_flags & TDF_DETAILS))
|
|
|
|
|
{
|
|
|
|
|
location_t loc;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
loc = gimple_location (bi_call);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
fprintf (dump_file,
|
|
|
|
|
"%s:%d: note: function call is shrink-wrapped"
|
|
|
|
|
" into error conditions.\n",
|
|
|
|
|
LOCATION_FILE (loc), LOCATION_LINE (loc));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* The top level function for conditional dead code shrink
|
|
|
|
|
wrapping transformation. */
|
|
|
|
|
|
|
|
|
|
static bool
|
2008-09-10 10:00:40 +02:00
|
|
|
|
shrink_wrap_conditional_dead_built_in_calls (VEC (gimple, heap) *calls)
|
2008-06-04 23:49:45 +02:00
|
|
|
|
{
|
|
|
|
|
bool changed = false;
|
|
|
|
|
unsigned i = 0;
|
|
|
|
|
|
2008-09-10 10:00:40 +02:00
|
|
|
|
unsigned n = VEC_length (gimple, calls);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
if (n == 0)
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
for (; i < n ; i++)
|
|
|
|
|
{
|
2008-09-10 10:00:40 +02:00
|
|
|
|
gimple bi_call = VEC_index (gimple, calls, i);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
changed |= shrink_wrap_one_built_in_call (bi_call);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return changed;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Pass entry points. */
|
|
|
|
|
|
|
|
|
|
static unsigned int
|
|
|
|
|
tree_call_cdce (void)
|
|
|
|
|
{
|
|
|
|
|
basic_block bb;
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple_stmt_iterator i;
|
2008-06-04 23:49:45 +02:00
|
|
|
|
bool something_changed = false;
|
2008-09-10 10:00:40 +02:00
|
|
|
|
VEC (gimple, heap) *cond_dead_built_in_calls = NULL;
|
2008-06-04 23:49:45 +02:00
|
|
|
|
FOR_EACH_BB (bb)
|
|
|
|
|
{
|
|
|
|
|
/* Collect dead call candidates. */
|
2008-07-28 16:33:56 +02:00
|
|
|
|
for (i = gsi_start_bb (bb); !gsi_end_p (i); gsi_next (&i))
|
2008-06-04 23:49:45 +02:00
|
|
|
|
{
|
2008-07-28 16:33:56 +02:00
|
|
|
|
gimple stmt = gsi_stmt (i);
|
|
|
|
|
if (is_gimple_call (stmt)
|
2008-06-04 23:49:45 +02:00
|
|
|
|
&& is_call_dce_candidate (stmt))
|
|
|
|
|
{
|
|
|
|
|
if (dump_file && (dump_flags & TDF_DETAILS))
|
|
|
|
|
{
|
|
|
|
|
fprintf (dump_file, "Found conditional dead call: ");
|
2008-07-28 16:33:56 +02:00
|
|
|
|
print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
fprintf (dump_file, "\n");
|
|
|
|
|
}
|
2008-09-10 10:00:40 +02:00
|
|
|
|
if (cond_dead_built_in_calls == NULL)
|
|
|
|
|
cond_dead_built_in_calls = VEC_alloc (gimple, heap, 64);
|
|
|
|
|
VEC_safe_push (gimple, heap, cond_dead_built_in_calls, stmt);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2008-09-10 10:00:40 +02:00
|
|
|
|
if (cond_dead_built_in_calls == NULL)
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
something_changed
|
|
|
|
|
= shrink_wrap_conditional_dead_built_in_calls (cond_dead_built_in_calls);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
2008-07-28 16:33:56 +02:00
|
|
|
|
VEC_free (gimple, heap, cond_dead_built_in_calls);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
|
|
|
|
|
if (something_changed)
|
|
|
|
|
{
|
|
|
|
|
free_dominance_info (CDI_DOMINATORS);
|
|
|
|
|
free_dominance_info (CDI_POST_DOMINATORS);
|
re PR middle-end/13146 (inheritance for nonoverlapping_component_refs_p)
2009-04-03 Richard Guenther <rguenther@suse.de>
PR middle-end/13146
PR tree-optimization/23940
PR tree-optimization/33237
PR middle-end/33974
PR middle-end/34093
PR tree-optimization/36201
PR tree-optimization/36230
PR tree-optimization/38049
PR tree-optimization/38207
PR tree-optimization/38230
PR tree-optimization/38301
PR tree-optimization/38585
PR middle-end/38895
PR tree-optimization/38985
PR tree-optimization/39299
* tree-ssa-structalias.h: Remove.
* tree-ssa-operands.h (NULL_USE_OPERAND_P): Make of type use_operand_p.
(NULL_DEF_OPERAND_P): Make of type def_operand_p.
(struct vuse_element_d): Remove.
(struct vuse_vec_d): Likewise.
(VUSE_VECT_NUM_ELEM, VUSE_VECT_ELEMENT_NC, VUSE_ELEMENT_PTR_NC,
VUSE_ELEMENT_VAR_NC, VUSE_VECT_ELEMENT, VUSE_ELEMENT_PTR,
SET_VUSE_VECT_ELEMENT, SET_VUSE_ELEMENT_VAR, SET_VUSE_ELEMENT_PTR,
VUSE_ELEMENT_VAR): Likewise.
(struct voptype_d): Likewise.
(NUM_VOP_FREE_BUCKETS): Likewise.
(struct ssa_operands): Remove vop_free_buckets and mpt_table fields.
(struct stmt_operands_d): Remove.
(VUSE_OP_PTR, VUSE_OP, SET_VUSE_OP, VUSE_NUM, VUSE_VECT,
VDEF_RESULT_PTR, VDEF_RESULT, VDEF_OP_PTR, VDEF_OP, SET_VDEF_OP,
VDEF_NUM, VDEF_VECT): Likewise.
(copy_virtual_operands): Remove.
(operand_build_cmp): Likewise.
(create_ssa_artificial_load_stmt): Likewise.
(enum ssa_op_iter_type): Remove ssa_op_iter_vdef.
(struct ssa_operand_iterator_d): Remove vuses, vdefs, mayusesm
vuse_index and mayuse_index members. Pack and move done and iter_type
members to the front.
(SSA_OP_VMAYUSE): Remove.
(SSA_OP_VIRTUAL_USES): Adjust.
(FOR_EACH_SSA_VDEF_OPERAND): Remove.
(unlink_stmt_vdef): Declare.
(add_to_addressable_set): Remove.
* tree-vrp.c (stmt_interesting_for_vrp): Adjust.
(vrp_visit_stmt): Likewise.
* doc/tree-ssa.texi (Alias analysis): Update.
* doc/invoke.texi (max-aliased-vops): Remove docs.
(avg-aliased-vops): Likewise.
* tree-into-ssa.c (syms_to_rename): Remove.
(need_to_update_vops_p): Likewise.
(need_to_initialize_update_ssa_p): Rename to ...
(update_ssa_initialized_fn): ... this. Track function we are
initialized for.
(symbol_marked_for_renaming): Simplify.
(add_new_name_mapping): Do not set need_to_update_vops_p.
(dump_currdefs): Use SYMS_TO_RENAME.
(rewrite_update_stmt): Always walk all uses/defs.
(dump_update_ssa): Adjust.
(init_update_ssa): Take function argument. Track what we are
initialized for.
(delete_update_ssa): Reset SYMS_TO_RENAME and update_ssa_initialized_fn.
(create_new_def_for): Initialize for cfun, assert we are initialized
for cfun.
(mark_sym_for_renaming): Simplify.
(mark_set_for_renaming): Do not initialize update-ssa.
(need_ssa_update_p): Simplify. Take function argument.
(name_mappings_registered_p): Assert we ask for the correct function.
(name_registered_for_update_p): Likewise.
(ssa_names_to_replace): Likewise.
(release_ssa_name_after_update_ssa): Likewise.
(update_ssa): Likewise. Use SYMS_TO_RENAME.
(dump_decl_set): Do not print a newline.
(debug_decl_set): Do it here.
(dump_update_ssa): And here.
* tree-ssa-loop-im.c (move_computations): Adjust.
(movement_possibility): Likewise.
(determine_max_movement): Likewise.
(gather_mem_refs_stmt): Likewise.
* tree-dump.c (dequeue_and_dump): Do not handle SYMBOL_MEMORY_TAG
or NAME_MEMORY_TAG.
* tree-complex.c (update_all_vops): Remove.
(expand_complex_move): Adjust.
* tree-ssa-loop-niter.c (chain_of_csts_start): Use NULL_TREE.
Simplify test for memory referencing statement. Exclude
non-invariant ADDR_EXPRs.
* tree-pretty-print.c (dump_generic_node): Do not handle memory tags.
* tree-loop-distribution.c (generate_memset_zero): Adjust.
(rdg_flag_uses): Likewise.
* tree-tailcall.c (suitable_for_tail_opt_p): Remove memory-tag
related code.
(tree_optimize_tail_calls_1): Also split the
edge from the entry block if we have degenerate PHI nodes in
the first basic block.
* tree.c (init_ttree): Remove memory-tag related code.
(tree_code_size): Likewise.
(tree_node_structure): Likewise.
(build7_stat): Re-write to be build6_stat.
* tree.h (MTAG_P, TREE_MEMORY_TAG_CHECK, TMR_TAG): Remove.
(SSA_VAR_P): Adjust.
(struct tree_memory_tag): Remove.
(struct tree_memory_partition_tag): Likewise.
(union tree_node): Adjust.
(build7): Re-write to be build6.
* tree-pass.h (pass_reset_cc_flags): Remove.
(TODO_update_address_taken): New flag.
(pass_simple_dse): Remove.
* ipa-cp.c (ipcp_update_callgraph): Update SSA form.
* params.h (MAX_ALIASED_VOPS): Remove.
(AVG_ALIASED_VOPS): Likewise.
* omp-low.c (expand_omp_taskreg): Update SSA form.
* tree-ssa-dse.c (dse_optimize_stmt): Properly query if the rhs
aliases the lhs in a copy stmt.
* tree-ssa-dse.c (struct address_walk_data): Remove.
(memory_ssa_name_same): Likewise.
(memory_address_same): Likewise.
(get_kill_of_stmt_lhs): Likewise.
(dse_possible_dead_store_p): Simplify, use the oracle. Handle
unused stores. Look through PHI nodes into post-dominated regions.
(dse_optimize_stmt): Simplify. Properly remove stores.
(tree_ssa_dse): Compute dominators.
(execute_simple_dse): Remove.
(pass_simple_dse): Likewise.
* ipa-reference.c (scan_stmt_for_static_refs): Open-code
gimple_loaded_syms and gimple_stored_syms computation.
* toplev.c (dump_memory_report): Dump alias and pta stats.
* tree-ssa-sccvn.c (vn_reference_compute_hash): Simplify.
(vn_reference_eq): Likewise.
(vuses_to_vec, copy_vuses_from_stmt, vdefs_to_vec,
copy_vdefs_from_stmt, shared_lookup_vops, shared_vuses_from_stmt,
valueize_vuses): Remove.
(get_def_ref_stmt_vuses): Simplify. Rename to ...
(get_def_ref_stmt_vuse): ... this.
(vn_reference_lookup_2): New function.
(vn_reference_lookup_pieces): Use walk_non_aliased_vuses for
walking equivalent vuses. Simplify.
(vn_reference_lookup): Likewise.
(vn_reference_insert): Likewise.
(vn_reference_insert_pieces): Likewise.
(visit_reference_op_call): Simplify.
(visit_reference_op_load): Likewise.
(visit_reference_op_store): Likewise.
(init_scc_vn): Remove shared_lookup_vuses initialization.
(free_scc_vn): Remove shared_lookup_vuses freeing.
(sort_vuses, sort_vuses_heap): Remove.
(get_ref_from_reference_ops): Export.
* tree-ssa-sccvn.h (struct vn_reference_s): Replace vuses
vector with single vuse pointer.
(vn_reference_lookup_pieces, vn_reference_lookup,
vn_reference_insert, vn_reference_insert_pieces): Adjust prototypes.
(shared_vuses_from_stmt): Remove.
(get_ref_from_reference_ops): Declare.
* tree-ssa-loop-manip.c (slpeel_can_duplicate_loop_p): Adjust.
* tree-ssa-copyrename.c (copy_rename_partition_coalesce): Remove
memory-tag related code.
* tree-ssa-ccp.c (get_symbol_constant_value): Remove memory-tag code.
(likely_value): Add comment, skip static-chain of call statements.
(surely_varying_stmt_p): Adjust.
(gimplify_and_update_call_from_tree): Likewise.
(execute_fold_all_builtins): Do not rebuild alias info.
(gimplify_and_update_call_from_tree): Properly update VOPs.
* tree-ssa-loop-ivopts.c (get_ref_tag): Remove.
(copy_ref_info): Remove memory-tag related code.
* tree-call-cdce.c (tree_call_cdce): Rename the VOP.
* ipa-pure-const.c (check_decl): Remove memory-tag related code.
(check_stmt): Open-code gimple_loaded_syms and gimple_stored_syms
computation.
* tree-ssa-dom.c (gimple_p): Remove typedef.
(eliminate_redundant_computations): Adjust.
(record_equivalences_from_stmt): Likewise.
(avail_expr_hash): Likewise.
(avail_expr_eq): Likewise.
* tree-ssa-propagate.c (update_call_from_tree): Properly
update VOPs.
(stmt_makes_single_load): Likewise.
(stmt_makes_single_store): Likewise.
* tree-ssa-alias.c: Rewrite completely.
(debug_memory_partitions, dump_mem_ref_stats, debug_mem_ref_stats,
debug_mem_sym_stats, dump_mem_sym_stats_for_var,
debug_all_mem_sym_stats, debug_mp_info, update_mem_sym_stats_from_stmt,
delete_mem_ref_stats, create_tag_raw, dump_points_to_info,
dump_may_aliases_for, debug_may_aliases_for, new_type_alias):
Remove public functions.
(pass_reset_cc_flags): Remove.
(pass_build_alias): Move ...
* tree-ssa-structalias.c (pass_build_alias): ... here.
* tree-ssa-alias.c (may_be_aliased): Move ...
* tree-flow-inline.h (may_be_aliased): ... here.
tree-ssa-alias.c (struct count_ptr_d, count_ptr_derefs,
count_uses_and_derefs): Move ...
* gimple.c: ... here.
* gimple.h (count_uses_and_derefs): Declare.
* tree-ssa-alias.c (dump_alias_stats, ptr_deref_may_alias_global_p,
ptr_deref_may_alias_decl_p, ptr_derefs_may_alias_p,
same_type_for_tbaa, nonaliasing_component_refs_p, decl_refs_may_alias_p,
indirect_ref_may_alias_decl_p, indirect_refs_may_alias_p,
ref_maybe_used_by_call_p, ref_maybe_used_by_stmt_p,
call_may_clobber_ref_p, stmt_may_clobber_ref_p, maybe_skip_until,
get_continuation_for_phi, walk_non_aliased_vuses, walk_aliased_vdefs):
New functions.
* tree-dfa.c (refs_may_alias_p): Move ...
* tree-ssa-alias.c (refs_may_alias_p): ... here. Extend.
* tree-ssa-alias.h: New file.
* tree-ssa-sink.c (is_hidden_global_store): Adjust.
(statement_sink_location): Likewise.
* opts.c (decode_options): Do not adjust max-aliased-vops or
avg-aliased-vops values.
* timevar.def (TV_TREE_MAY_ALIAS): Remove.
(TV_CALL_CLOBBER): Likewise.
(TV_FLOW_SENSITIVE): Likewise.
(TV_FLOW_INSENSITIVE): Likewise.
(TV_MEMORY_PARTITIONING): Likewise.
(TV_ALIAS_STMT_WALK): New timevar.
* tree-ssa-loop-ivcanon.c (empty_loop_p): Adjust.
* tree-ssa-address.c (create_mem_ref_raw): Use build6.
(get_address_description): Remove memory-tag related code.
* tree-ssa-ifcombine.c (bb_no_side_effects_p): Adjust.
* treestruct.def (TS_MEMORY_TAG, TS_MEMORY_PARTITION_TAG): Remove.
* tree-eh.c (cleanup_empty_eh): Do not leave stale SSA_NAMEs
and immediate uses in statements. Document.
* gimple-pretty-print.c (dump_gimple_mem_ops): Adjust.
(dump_symbols): Remove.
(dump_gimple_mem_ops): Do not dump loaded or stored syms.
* alias.c (get_deref_alias_set): New function split out from ...
(get_alias_set): ... here.
* alias.h (get_deref_alias_set): Declare.
* tree-vect-data-refs.c (vect_create_data_ref_ptr): Remove unused
type parameter. Remove restrict pointer handling. Create a
ref-all pointer in case type-based alias sets do not conflict.
(vect_analyze_data_refs): Remove SMT related code.
* tree-vect-stmts.c (vectorizable_store): Re-instantiate TBAA assert.
(vectorizable_load): Likewise.
* tree-data-ref.h (struct dr_alias): Remove symbol_tag field.
(DR_SYMBOL_TAG, DR_VOPS): Remove.
* tree-data-ref.c (dr_may_alias_p): Use the alias-oracle.
Ignore vops and SMTs.
(dr_analyze_alias): Likewise..
(free_data_ref): Likewise.
(create_data_ref): Likewise.
(analyze_all_data_dependences): Likewise.
(get_references_in_stmt): Adjust.
* tree-flow-inline.h (gimple_aliases_computed_p,
gimple_addressable_vars, gimple_call_clobbered_vars,
gimple_call_used_vars, gimple_global_var, may_aliases, memory_partition,
factoring_name_p, mark_call_clobbered, clear_call_clobbered,
compare_ssa_operands_equal, symbol_mem_tag, set_symbol_mem_tag,
gimple_mem_ref_stats): Remove.
(gimple_vop): New function.
(op_iter_next_use): Remove vuses and mayuses cases.
(op_iter_next_def): Remove vdefs case.
(op_iter_next_tree): Remove vuses, mayuses and vdefs cases.
(clear_and_done_ssa_iter): Do not set removed fields.
(op_iter_init): Likewise. Skip vuse and/or vdef if requested.
Assert we are not iterating over vuses or vdefs if not also
iterating over uses or defs.
(op_iter_init_use): Likewise.
(op_iter_init_def): Likewise.
(op_iter_next_vdef): Remove.
(op_iter_next_mustdef): Likewise.
(op_iter_init_vdef): Likewise.
(compare_ssa_operands_equal): Likewise.
(link_use_stmts_after): Handle vuse operand.
(is_call_used): Use is_call_clobbered.
(is_call_clobbered): Global variables are always call clobbered,
query the call-clobbers bitmap.
(mark_call_clobbered): Ignore global variables.
(clear_call_clobbered): Likewise.
* tree-ssa-coalesce.c (create_outofssa_var_map): Adjust
virtual operands sanity check.
* tree.def (NAME_MEMORY_TAG, SYMBOL_MEMORY_TAG, MEMORY_PARTITION_TAG):
Remove.
(TARGET_MEM_REF): Remove TMR_TAG operand.
* tree-dfa.c (add_referenced_var): Initialize call-clobber state.
Remove call-clobber related code.
(remove_referenced_var): Likewise. Do not clear mpt or symbol_mem_tag.
(dump_variable): Do not dump SMTs, memory stats, may-aliases or
partitions or escape reason.
(get_single_def_stmt, get_single_def_stmt_from_phi,
get_single_def_stmt_with_phi): Remove.
(dump_referenced_vars): Tidy.
(get_ref_base_and_extent): Allow bare decls.
(collect_dfa_stats): Adjust.
* graphite.c (rename_variables_in_stmt): Adjust.
(graphite_copy_stmts_from_block): Likewise.
(translate_clast): Likewise.
* tree-ssa-pre.c (struct bb_bitmap_sets): Add expr_dies bitmap.
(EXPR_DIES): New.
(translate_vuse_through_block): Use the oracle.
(phi_translate_1): Adjust.
(value_dies_in_block_x): Use the oracle. Cache the outcome
in EXPR_DIES.
(valid_in_sets): Check if the VUSE for
a REFERENCE is available.
(eliminate): Do not remove stmts during elimination,
instead queue and remove them afterwards.
(do_pre): Do not rebuild alias info.
(pass_pre): Run TODO_rebuild_alias before PRE.
* tree-ssa-live.c (remove_unused_locals): Remove memory-tag code.
* tree-sra.c (sra_walk_function): Use gimple_references_memory_p.
(mark_all_v_defs_stmt): Remove.
(mark_all_v_defs_seq): Adjust.
(sra_replace): Likewise.
(scalarize_use): Likewise.
(scalarize_copy): Likewise.
(scalarize_init): Likewise.
(scalarize_ldst): Likewise.
(todoflags): Remove.
(tree_sra): Do not rebuild alias info.
(tree_sra_early): Adjust.
(pass_sra): Run TODO_update_address_taken before SRA.
* tree-predcom.c (set_alias_info): Remove.
(prepare_initializers_chain): Do not call it.
(mark_virtual_ops_for_renaming): Adjust.
(mark_virtual_ops_for_renaming_list): Remove.
(initialize_root_vars): Adjust.
(initialize_root_vars_lm): Likewise.
(prepare_initializers_chain): Likewise.
* tree-ssa-copy.c (may_propagate_copy): Remove memory-tag related code.
(may_propagate_copy_into_stmt): Likewise.
(merge_alias_info): Do nothing for now.
(propagate_tree_value_into_stmt): Adjust.
(stmt_may_generate_copy): Likewise.
* tree-ssa-forwprop.c (tidy_after_forward_propagate_addr): Do
not mark symbols for renaming.
(forward_propagate_addr_expr): Match up push/pop_stmt_changes
with the same statement, make sure to update the new pointed-to one.
* tree-ssa-dce.c (eliminate_unnecessary_stmts): Do not copy
call statements, do not mark symbols for renaming.
(mark_operand_necessary): Dump something.
(ref_may_be_aliased): New function.
(mark_aliased_reaching_defs_necessary_1): New helper function.
(mark_aliased_reaching_defs_necessary): Likewise.
(mark_all_reaching_defs_necessary_1): Likewise.
(mark_all_reaching_defs_necessary): Likewise.
(propagate_necessity): Do not process virtual PHIs. For
non-aliased loads mark all reaching definitions as necessary.
For aliased loads and stores mark the immediate dominating
aliased clobbers as necessary.
(visited): New global static.
(perform_tree_ssa_dce): Free visited bitmap after propagating
necessity.
(remove_dead_phis): Perform simple dead virtual PHI removal.
(remove_dead_stmt): Properly unlink virtual operands when
removing stores.
(eliminate_unnecessary_stmts): Schedule PHI removal after
stmt removal.
* tree-ssa-ter.c (is_replaceable_p): Adjust.
(process_replaceable): Likewise.
(find_replaceable_in_bb): Likewise.
* tree-ssa.c (verify_ssa_name): Verify all VOPs are
based on the single gimple vop.
(verify_flow_insensitive_alias_info): Remove.
(verify_flow_sensitive_alias_info): Likewise.
(verify_call_clobbering): Likewise.
(verify_memory_partitions): Likewise.
(verify_alias_info): Likewise.
(verify_ssa): Adjust..
(execute_update_addresses_taken): Export. Update SSA
manually. Optimize only when optimizing. Use a local bitmap.
(pass_update_address_taken): Remove TODO_update_ssa, add
TODO_dump_func.
(pass_update_address_taken): Just use TODO_update_address_taken.
(init_tree_ssa): Do not initialize addressable_vars.
(verify_ssa): Verify new VUSE / VDEF properties.
Verify that all stmts definitions have the stmt as SSA_NAME_DEF_STMT.
Do not call verify_alias_info.
(delete_tree_ssa): Clear the VUSE, VDEF operands.
Do not free the loaded and stored syms bitmaps. Reset the escaped
and callused solutions. Do not free addressable_vars.
Remove memory-tag related code.
(warn_uninitialized_var): Aliases are always available.
* tree-ssa-loop-prefetch.c (gather_memory_references): Adjust.
* lambda-code.c (can_put_in_inner_loop): Adjust.
(can_put_after_inner_loop): Likewise.
(perfect_nestify): Likewise.
* tree-vect-stmts.c (vect_stmt_relevant_p): Adjust.
(vect_gen_widened_results_half): Remove CALL_EXPR handling.
(vectorizable_conversion): Do not mark symbols for renaming.
* tree-inline.c (remap_gimple_stmt): Clear VUSE/VDEF.
(expand_call_inline): Unlink the calls virtual operands before
replacing it.
(tree_function_versioning): Do not call update_ssa if we are not
updating clones. Simplify.
* tree-ssa-phiprop.c (phivn_valid_p): Adjust.
(propagate_with_phi): Likewise..
* tree-outof-ssa.c (create_temp): Remove memory tag and call
clobber code. Assert we are not aliased or global.
* tree-flow.h: Include tree-ssa-alias.h
(enum escape_type): Remove.
(struct mem_sym_stats_d): Likewise.
(struct mem_ref_stats_d): Likewise.
(struct gimple_df): Add vop member. Remove global_var,
call_clobbered_vars, call_used_vars, addressable_vars,
aliases_compted_p and mem_ref_stats members. Add syms_to_rename,
escaped and callused members.
(struct ptr_info_def): Remove all members, add points-to solution
member pt.
(struct var_ann_d): Remove in_vuse_list, in_vdef_list,
call_clobbered, escape_mask, mpt and symbol_mem_tag members.
* Makefile.in (TREE_FLOW_H): Add tree-ssa-alias.h.
(tree-ssa-structalias.o): Remove tree-ssa-structalias.h.
(tree-ssa-alias.o): Likewise.
(toplev.o): Add tree-ssa-alias.h
(GTFILES): Remove tree-ssa-structalias.h, add tree-ssa-alias.h.
* gimple.c (gimple_set_bb): Fix off-by-one error.
(is_gimple_reg): Do not handle memory tags.
(gimple_copy): Also copy virtual operands.
Delay updating the statement. Do not reset loaded and stored syms.
(gimple_set_stored_syms): Remove.
(gimple_set_loaded_syms): Likewise.
(gimple_call_copy_skip_args): Copy the virtual operands
and mark the new statement modified.
* tree-ssa-structalias.c (may_alias_p): Remove.
(set_uids_in_ptset): Take the alias set to prune with as
parameter. Fold in the alias test of may_alias_p.
(compute_points_to_sets): Compute whether a ptr is dereferenced
in a local sbitmap.
(process_constraint): Deal with &ANYTHING on the lhs, reject all
other ADDRESSOF constraints on the lhs.
(get_constraint_for_component_ref): Assert that we don't get
ADDRESSOF constraints from the base of the reference.
Properly generate UNKNOWN_OFFSET for DEREF if needed.
(struct variable_info): Remove collapsed_to member.
(get_varinfo_fc): Remove.
(new_var_info): Do not set collapsed_to.
(dump_constraint): Do not follow cycles.
(dump_constraint_graph): Likewise.
(build_pred_graph): Likewise.
(build_succ_graph): Likewise.
(rewrite_constraints): Likewise.
(do_simple_structure_copy): Remove.
(do_rhs_deref_structure_copy): Remove.
(do_lhs_deref_structure_copy): Remove.
(collapse_rest_of_var): Remove.
(do_structure_copy): Re-implement.
(pta_stats): New global variable.
(dump_pta_stats): New function.
(struct constraint_expr): Make offset signed.
(UNKNOWN_OFFSET): Define special value.
(dump_constraint): Dump UNKNOWN_OFFSET as UNKNOWN.
(solution_set_expand): New helper function split out from ...
(do_sd_constraint): ... here.
(solution_set_add): Handle UNKNOWN_OFFSET. Handle negative offsets.
(do_ds_constraint): Likewise.
(do_sd_constraint): Likewise. Do not special-case ESCAPED = *ESCAPED
and CALLUSED = *CALLUSED.
(set_union_with_increment): Make inc argument signed.
(type_safe): Remove.
(get_constraint_for_ptr_offset): Handle unknown and negative
constant offsets.
(first_vi_for_offset): Handle offsets before start. Bail
out early for offsets beyond the variable extent.
(first_or_preceding_vi_for_offset): New function.
(init_base_vars): Add ESCAPED = ESCAPED + UNKNOWN_OFFSET constraint.
Together with ESCAPED = *ESCAPED this properly computes reachability.
(find_what_var_points_to): New function.
(find_what_p_points_to): Implement in terms of find_what_var_points_to.
(pt_solution_reset, pt_solution_empty_p, pt_solution_includes_global,
pt_solution_includes_1, pt_solution_includes, pt_solutions_intersect_1,
pt_solutions_intersect): New functions.
(compute_call_used_vars): Remove.
(compute_may_aliases): New main entry into PTA computation.
* gimple.h (gimple_p): New typedef.
(struct gimple_statement_base): Remove references_memory_p.
(struct gimple_statement_with_memory_ops_base): Remove
vdef_ops, vuse_ops, stores and loads members. Add vdef and vuse
members.
(gimple_vuse_ops, gimple_set_vuse_ops, gimple_vdef_ops,
gimple_set_vdef_ops, gimple_loaded_syms, gimple_stored_syms,
gimple_set_references_memory): Remove.
(gimple_vuse_op, gimple_vdef_op, gimple_vuse, gimple_vdef,
gimple_vuse_ptr, gimple_vdef_ptri, gimple_set_vuse, gimple_set_vdef):
New functions.
* tree-cfg.c (move_block_to_fn): Fix off-by-one error.
(verify_expr): Allow RESULT_DECL.
(gimple_duplicate_bb): Do not copy virtual operands.
(gimple_duplicate_sese_region): Adjust.
(gimple_duplicate_sese_tail): Likewise.
(mark_virtual_ops_in_region): Remove.
(move_sese_region_to_fn): Do not call it.
* passes.c (init_optimization_passes): Remove pass_reset_cc_flags
and pass_simple_dse.
(execute_function_todo): Handle TODO_update_address_taken,
call execute_update_addresses_taken for TODO_rebuild_alias.
(execute_todo): Adjust.
(execute_one_pass): Init dump files early.
* ipa-struct-reorg.c (finalize_var_creation): Do not mark vars
call-clobbered.
(create_general_new_stmt): Clear vops.
* tree-ssa-reassoc.c (get_rank): Adjust.
* tree-vect-slp.c (vect_create_mask_and_perm): Do not mark
symbols for renaming.
* params.def (PARAM_MAX_ALIASED_VOPS): Remove.
(PARAM_AVG_ALIASED_VOPS): Likewise.
* tree-ssanames.c (init_ssanames): Allocate SYMS_TO_RENAME.
(duplicate_ssa_name_ptr_info): No need to copy the shared bitmaps.
* tree-ssa-operands.c: Simplify for new virtual operand
representation.
(operand_build_cmp, copy_virtual_operands,
create_ssa_artificial_load_stmt, add_to_addressable_set,
gimple_add_to_addresses_taken): Remove public functions.
(unlink_stmt_vdef): New function.
* gcc.dg/pr19633-1.c: Adjust.
* gcc.dg/torture/pta-callused-1.c: Likewise.
* gcc.dg/torture/pr39074-2.c: Likewise.
* gcc.dg/torture/pr39074.c: Likewise.
* gcc.dg/torture/pta-ptrarith-3.c: New testcase.
* gcc.dg/torture/pr30375.c: Adjust.
* gcc.dg/torture/pr33563.c: Likewise.
* gcc.dg/torture/pr33870.c: Likewise.
* gcc.dg/torture/pr33560.c: Likewise.
* gcc.dg/torture/pta-structcopy-1.c: New testcase.
* gcc.dg/torture/ssa-pta-fn-1.c: Likewise.
* gcc.dg/tree-ssa/alias-15.c: Remove.
* gcc.dg/tree-ssa/ssa-dce-4.c: New testcase.
* gcc.dg/tree-ssa/pr26421.c: Adjust.
* gcc.dg/tree-ssa/ssa-fre-10.c: XFAIL.
* gcc.dg/tree-ssa/ssa-dce-5.c: New testcase.
* gcc.dg/tree-ssa/pr23382.c: Adjust.
* gcc.dg/tree-ssa/ssa-fre-20.c: New testcase.
* gcc.dg/tree-ssa/alias-16.c: Adjust.
* gcc.dg/tree-ssa/ssa-fre-13.c: Likewise.
* gcc.dg/tree-ssa/ssa-fre-14.c: Likewise.
* gcc.dg/tree-ssa/alias-18.c: Likewise.
* gcc.dg/tree-ssa/ssa-fre-15.c: Likewise.
* gcc.dg/tree-ssa/ssa-lim-3.c: Likewise.
* gcc.dg/tree-ssa/alias-19.c: Likewise.
* gcc.dg/tree-ssa/pta-ptrarith-1.c: New testcase.
* gcc.dg/tree-ssa/pr13146.c: Likewise.
* gcc.dg/tree-ssa/ssa-pre-23.c: Likewise.
* gcc.dg/tree-ssa/pta-ptrarith-2.c: Likewise.
* gcc.dg/tree-ssa/ssa-fre-18.c: Likewise.
* gcc.dg/tree-ssa/ssa-pre-24.c: New XFAILed testcase.
* gcc.dg/tree-ssa/ssa-fre-19.c: New testcase.
* gcc.dg/tree-ssa/alias-20.c: Likewise.
* gcc.dg/tree-ssa/ssa-dse-12.c: Likewise.
* gcc.dg/tree-ssa/pr38895.c: Likewise.
* gcc.dg/uninit-B.c: XFAIL.
* gcc.dg/vect/no-vfa-vect-43.c: Adjust.
* gcc.dg/uninit-pr19430.c: XFAIL.
* g++.dg/tree-ssa/pr13146.C: New testcase.
* g++.dg/opt/pr36187.C: Adjust.
* g++.dg/torture/20090329-1.C: New testcase.
From-SVN: r145494
2009-04-03 12:24:28 +02:00
|
|
|
|
/* As we introduced new control-flow we need to insert PHI-nodes
|
|
|
|
|
for the call-clobbers of the remaining call. */
|
|
|
|
|
mark_sym_for_renaming (gimple_vop (cfun));
|
2008-06-04 23:49:45 +02:00
|
|
|
|
return (TODO_update_ssa | TODO_cleanup_cfg | TODO_ggc_collect
|
|
|
|
|
| TODO_remove_unused_locals);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static bool
|
|
|
|
|
gate_call_cdce (void)
|
|
|
|
|
{
|
|
|
|
|
/* The limit constants used in the implementation
|
|
|
|
|
assume IEEE floating point format. Other formats
|
|
|
|
|
can be supported in the future if needed. */
|
2008-08-30 12:38:55 +02:00
|
|
|
|
return flag_tree_builtin_call_dce != 0 && optimize_function_for_speed_p (cfun);
|
2008-06-04 23:49:45 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct gimple_opt_pass pass_call_cdce =
|
|
|
|
|
{
|
|
|
|
|
{
|
|
|
|
|
GIMPLE_PASS,
|
|
|
|
|
"cdce", /* name */
|
|
|
|
|
gate_call_cdce, /* gate */
|
|
|
|
|
tree_call_cdce, /* execute */
|
|
|
|
|
NULL, /* sub */
|
|
|
|
|
NULL, /* next */
|
|
|
|
|
0, /* static_pass_number */
|
|
|
|
|
TV_TREE_CALL_CDCE, /* tv_id */
|
|
|
|
|
PROP_cfg | PROP_ssa, /* properties_required */
|
|
|
|
|
0, /* properties_provided */
|
|
|
|
|
0, /* properties_destroyed */
|
|
|
|
|
0, /* todo_flags_start */
|
|
|
|
|
TODO_dump_func | TODO_verify_ssa /* todo_flags_finish */
|
|
|
|
|
}
|
|
|
|
|
};
|