mirror of
https://github.com/autc04/Retro68.git
synced 2024-09-28 18:56:06 +00:00
863 lines
22 KiB
C
863 lines
22 KiB
C
/* Preamble and helpers for the autogenerated gimple-match.c file.
|
|
Copyright (C) 2014-2015 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/>. */
|
|
|
|
#include "config.h"
|
|
#include "system.h"
|
|
#include "coretypes.h"
|
|
#include "tm.h"
|
|
#include "hash-set.h"
|
|
#include "machmode.h"
|
|
#include "vec.h"
|
|
#include "double-int.h"
|
|
#include "input.h"
|
|
#include "alias.h"
|
|
#include "symtab.h"
|
|
#include "options.h"
|
|
#include "wide-int.h"
|
|
#include "inchash.h"
|
|
#include "tree.h"
|
|
#include "fold-const.h"
|
|
#include "stringpool.h"
|
|
#include "stor-layout.h"
|
|
#include "flags.h"
|
|
#include "hard-reg-set.h"
|
|
#include "function.h"
|
|
#include "predict.h"
|
|
#include "basic-block.h"
|
|
#include "tree-ssa-alias.h"
|
|
#include "internal-fn.h"
|
|
#include "gimple-expr.h"
|
|
#include "is-a.h"
|
|
#include "gimple.h"
|
|
#include "gimple-ssa.h"
|
|
#include "tree-ssanames.h"
|
|
#include "gimple-fold.h"
|
|
#include "gimple-iterator.h"
|
|
#include "hashtab.h"
|
|
#include "rtl.h"
|
|
#include "statistics.h"
|
|
#include "real.h"
|
|
#include "fixed-value.h"
|
|
#include "insn-config.h"
|
|
#include "expmed.h"
|
|
#include "dojump.h"
|
|
#include "explow.h"
|
|
#include "calls.h"
|
|
#include "emit-rtl.h"
|
|
#include "varasm.h"
|
|
#include "stmt.h"
|
|
#include "expr.h"
|
|
#include "tree-dfa.h"
|
|
#include "builtins.h"
|
|
#include "tree-phinodes.h"
|
|
#include "ssa-iterators.h"
|
|
#include "dumpfile.h"
|
|
#include "gimple-match.h"
|
|
|
|
|
|
/* Forward declarations of the private auto-generated matchers.
|
|
They expect valueized operands in canonical order and do not
|
|
perform simplification of all-constant operands. */
|
|
static bool gimple_simplify (code_helper *, tree *,
|
|
gimple_seq *, tree (*)(tree),
|
|
code_helper, tree, tree);
|
|
static bool gimple_simplify (code_helper *, tree *,
|
|
gimple_seq *, tree (*)(tree),
|
|
code_helper, tree, tree, tree);
|
|
static bool gimple_simplify (code_helper *, tree *,
|
|
gimple_seq *, tree (*)(tree),
|
|
code_helper, tree, tree, tree, tree);
|
|
|
|
|
|
/* Return whether T is a constant that we'll dispatch to fold to
|
|
evaluate fully constant expressions. */
|
|
|
|
static inline bool
|
|
constant_for_folding (tree t)
|
|
{
|
|
return (CONSTANT_CLASS_P (t)
|
|
/* The following is only interesting to string builtins. */
|
|
|| (TREE_CODE (t) == ADDR_EXPR
|
|
&& TREE_CODE (TREE_OPERAND (t, 0)) == STRING_CST));
|
|
}
|
|
|
|
|
|
/* Helper that matches and simplifies the toplevel result from
|
|
a gimple_simplify run (where we don't want to build
|
|
a stmt in case it's used in in-place folding). Replaces
|
|
*RES_CODE and *RES_OPS with a simplified and/or canonicalized
|
|
result and returns whether any change was made. */
|
|
|
|
static bool
|
|
gimple_resimplify1 (gimple_seq *seq,
|
|
code_helper *res_code, tree type, tree *res_ops,
|
|
tree (*valueize)(tree))
|
|
{
|
|
if (constant_for_folding (res_ops[0]))
|
|
{
|
|
tree tem = NULL_TREE;
|
|
if (res_code->is_tree_code ())
|
|
tem = const_unop (*res_code, type, res_ops[0]);
|
|
else
|
|
{
|
|
tree decl = builtin_decl_implicit (*res_code);
|
|
if (decl)
|
|
{
|
|
tem = fold_builtin_n (UNKNOWN_LOCATION, decl, res_ops, 1, false);
|
|
if (tem)
|
|
{
|
|
/* fold_builtin_n wraps the result inside a NOP_EXPR. */
|
|
STRIP_NOPS (tem);
|
|
tem = fold_convert (type, tem);
|
|
}
|
|
}
|
|
}
|
|
if (tem != NULL_TREE
|
|
&& CONSTANT_CLASS_P (tem))
|
|
{
|
|
res_ops[0] = tem;
|
|
res_ops[1] = NULL_TREE;
|
|
res_ops[2] = NULL_TREE;
|
|
*res_code = TREE_CODE (res_ops[0]);
|
|
return true;
|
|
}
|
|
}
|
|
|
|
code_helper res_code2;
|
|
tree res_ops2[3] = {};
|
|
if (gimple_simplify (&res_code2, res_ops2, seq, valueize,
|
|
*res_code, type, res_ops[0]))
|
|
{
|
|
*res_code = res_code2;
|
|
res_ops[0] = res_ops2[0];
|
|
res_ops[1] = res_ops2[1];
|
|
res_ops[2] = res_ops2[2];
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
/* Helper that matches and simplifies the toplevel result from
|
|
a gimple_simplify run (where we don't want to build
|
|
a stmt in case it's used in in-place folding). Replaces
|
|
*RES_CODE and *RES_OPS with a simplified and/or canonicalized
|
|
result and returns whether any change was made. */
|
|
|
|
static bool
|
|
gimple_resimplify2 (gimple_seq *seq,
|
|
code_helper *res_code, tree type, tree *res_ops,
|
|
tree (*valueize)(tree))
|
|
{
|
|
if (constant_for_folding (res_ops[0]) && constant_for_folding (res_ops[1]))
|
|
{
|
|
tree tem = NULL_TREE;
|
|
if (res_code->is_tree_code ())
|
|
tem = const_binop (*res_code, type, res_ops[0], res_ops[1]);
|
|
else
|
|
{
|
|
tree decl = builtin_decl_implicit (*res_code);
|
|
if (decl)
|
|
{
|
|
tem = fold_builtin_n (UNKNOWN_LOCATION, decl, res_ops, 2, false);
|
|
if (tem)
|
|
{
|
|
/* fold_builtin_n wraps the result inside a NOP_EXPR. */
|
|
STRIP_NOPS (tem);
|
|
tem = fold_convert (type, tem);
|
|
}
|
|
}
|
|
}
|
|
if (tem != NULL_TREE
|
|
&& CONSTANT_CLASS_P (tem))
|
|
{
|
|
res_ops[0] = tem;
|
|
res_ops[1] = NULL_TREE;
|
|
res_ops[2] = NULL_TREE;
|
|
*res_code = TREE_CODE (res_ops[0]);
|
|
return true;
|
|
}
|
|
}
|
|
|
|
/* Canonicalize operand order. */
|
|
bool canonicalized = false;
|
|
if (res_code->is_tree_code ()
|
|
&& (TREE_CODE_CLASS ((enum tree_code) *res_code) == tcc_comparison
|
|
|| commutative_tree_code (*res_code))
|
|
&& tree_swap_operands_p (res_ops[0], res_ops[1], false))
|
|
{
|
|
tree tem = res_ops[0];
|
|
res_ops[0] = res_ops[1];
|
|
res_ops[1] = tem;
|
|
if (TREE_CODE_CLASS ((enum tree_code) *res_code) == tcc_comparison)
|
|
*res_code = swap_tree_comparison (*res_code);
|
|
canonicalized = true;
|
|
}
|
|
|
|
code_helper res_code2;
|
|
tree res_ops2[3] = {};
|
|
if (gimple_simplify (&res_code2, res_ops2, seq, valueize,
|
|
*res_code, type, res_ops[0], res_ops[1]))
|
|
{
|
|
*res_code = res_code2;
|
|
res_ops[0] = res_ops2[0];
|
|
res_ops[1] = res_ops2[1];
|
|
res_ops[2] = res_ops2[2];
|
|
return true;
|
|
}
|
|
|
|
return canonicalized;
|
|
}
|
|
|
|
/* Helper that matches and simplifies the toplevel result from
|
|
a gimple_simplify run (where we don't want to build
|
|
a stmt in case it's used in in-place folding). Replaces
|
|
*RES_CODE and *RES_OPS with a simplified and/or canonicalized
|
|
result and returns whether any change was made. */
|
|
|
|
static bool
|
|
gimple_resimplify3 (gimple_seq *seq,
|
|
code_helper *res_code, tree type, tree *res_ops,
|
|
tree (*valueize)(tree))
|
|
{
|
|
if (constant_for_folding (res_ops[0]) && constant_for_folding (res_ops[1])
|
|
&& constant_for_folding (res_ops[2]))
|
|
{
|
|
tree tem = NULL_TREE;
|
|
if (res_code->is_tree_code ())
|
|
tem = fold_ternary/*_to_constant*/ (*res_code, type, res_ops[0],
|
|
res_ops[1], res_ops[2]);
|
|
else
|
|
{
|
|
tree decl = builtin_decl_implicit (*res_code);
|
|
if (decl)
|
|
{
|
|
tem = fold_builtin_n (UNKNOWN_LOCATION, decl, res_ops, 3, false);
|
|
if (tem)
|
|
{
|
|
/* fold_builtin_n wraps the result inside a NOP_EXPR. */
|
|
STRIP_NOPS (tem);
|
|
tem = fold_convert (type, tem);
|
|
}
|
|
}
|
|
}
|
|
if (tem != NULL_TREE
|
|
&& CONSTANT_CLASS_P (tem))
|
|
{
|
|
res_ops[0] = tem;
|
|
res_ops[1] = NULL_TREE;
|
|
res_ops[2] = NULL_TREE;
|
|
*res_code = TREE_CODE (res_ops[0]);
|
|
return true;
|
|
}
|
|
}
|
|
|
|
/* Canonicalize operand order. */
|
|
bool canonicalized = false;
|
|
if (res_code->is_tree_code ()
|
|
&& commutative_ternary_tree_code (*res_code)
|
|
&& tree_swap_operands_p (res_ops[0], res_ops[1], false))
|
|
{
|
|
tree tem = res_ops[0];
|
|
res_ops[0] = res_ops[1];
|
|
res_ops[1] = tem;
|
|
canonicalized = true;
|
|
}
|
|
|
|
code_helper res_code2;
|
|
tree res_ops2[3] = {};
|
|
if (gimple_simplify (&res_code2, res_ops2, seq, valueize,
|
|
*res_code, type,
|
|
res_ops[0], res_ops[1], res_ops[2]))
|
|
{
|
|
*res_code = res_code2;
|
|
res_ops[0] = res_ops2[0];
|
|
res_ops[1] = res_ops2[1];
|
|
res_ops[2] = res_ops2[2];
|
|
return true;
|
|
}
|
|
|
|
return canonicalized;
|
|
}
|
|
|
|
|
|
/* If in GIMPLE expressions with CODE go as single-rhs build
|
|
a GENERIC tree for that expression into *OP0. */
|
|
|
|
void
|
|
maybe_build_generic_op (enum tree_code code, tree type,
|
|
tree *op0, tree op1, tree op2)
|
|
{
|
|
switch (code)
|
|
{
|
|
case REALPART_EXPR:
|
|
case IMAGPART_EXPR:
|
|
case VIEW_CONVERT_EXPR:
|
|
*op0 = build1 (code, type, *op0);
|
|
break;
|
|
case BIT_FIELD_REF:
|
|
*op0 = build3 (code, type, *op0, op1, op2);
|
|
break;
|
|
default:;
|
|
}
|
|
}
|
|
|
|
/* Push the exploded expression described by RCODE, TYPE and OPS
|
|
as a statement to SEQ if necessary and return a gimple value
|
|
denoting the value of the expression. If RES is not NULL
|
|
then the result will be always RES and even gimple values are
|
|
pushed to SEQ. */
|
|
|
|
tree
|
|
maybe_push_res_to_seq (code_helper rcode, tree type, tree *ops,
|
|
gimple_seq *seq, tree res)
|
|
{
|
|
if (rcode.is_tree_code ())
|
|
{
|
|
if (!res
|
|
&& (TREE_CODE_LENGTH ((tree_code) rcode) == 0
|
|
|| ((tree_code) rcode) == ADDR_EXPR)
|
|
&& is_gimple_val (ops[0]))
|
|
return ops[0];
|
|
if (!seq)
|
|
return NULL_TREE;
|
|
/* Play safe and do not allow abnormals to be mentioned in
|
|
newly created statements. */
|
|
if ((TREE_CODE (ops[0]) == SSA_NAME
|
|
&& SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ops[0]))
|
|
|| (ops[1]
|
|
&& TREE_CODE (ops[1]) == SSA_NAME
|
|
&& SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ops[1]))
|
|
|| (ops[2]
|
|
&& TREE_CODE (ops[2]) == SSA_NAME
|
|
&& SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ops[2])))
|
|
return NULL_TREE;
|
|
if (!res)
|
|
res = make_ssa_name (type);
|
|
maybe_build_generic_op (rcode, type, &ops[0], ops[1], ops[2]);
|
|
gimple new_stmt = gimple_build_assign (res, rcode,
|
|
ops[0], ops[1], ops[2]);
|
|
gimple_seq_add_stmt_without_update (seq, new_stmt);
|
|
return res;
|
|
}
|
|
else
|
|
{
|
|
if (!seq)
|
|
return NULL_TREE;
|
|
tree decl = builtin_decl_implicit (rcode);
|
|
if (!decl)
|
|
return NULL_TREE;
|
|
unsigned nargs = type_num_arguments (TREE_TYPE (decl));
|
|
gcc_assert (nargs <= 3);
|
|
/* Play safe and do not allow abnormals to be mentioned in
|
|
newly created statements. */
|
|
if ((TREE_CODE (ops[0]) == SSA_NAME
|
|
&& SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ops[0]))
|
|
|| (nargs >= 2
|
|
&& TREE_CODE (ops[1]) == SSA_NAME
|
|
&& SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ops[1]))
|
|
|| (nargs == 3
|
|
&& TREE_CODE (ops[2]) == SSA_NAME
|
|
&& SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ops[2])))
|
|
return NULL_TREE;
|
|
if (!res)
|
|
res = make_ssa_name (type);
|
|
gimple new_stmt = gimple_build_call (decl, nargs, ops[0], ops[1], ops[2]);
|
|
gimple_call_set_lhs (new_stmt, res);
|
|
gimple_seq_add_stmt_without_update (seq, new_stmt);
|
|
return res;
|
|
}
|
|
}
|
|
|
|
|
|
/* Public API overloads follow for operation being tree_code or
|
|
built_in_function and for one to three operands or arguments.
|
|
They return NULL_TREE if nothing could be simplified or
|
|
the resulting simplified value with parts pushed to SEQ.
|
|
If SEQ is NULL then if the simplification needs to create
|
|
new stmts it will fail. If VALUEIZE is non-NULL then all
|
|
SSA names will be valueized using that hook prior to
|
|
applying simplifications. */
|
|
|
|
/* Unary ops. */
|
|
|
|
tree
|
|
gimple_simplify (enum tree_code code, tree type,
|
|
tree op0,
|
|
gimple_seq *seq, tree (*valueize)(tree))
|
|
{
|
|
if (constant_for_folding (op0))
|
|
{
|
|
tree res = const_unop (code, type, op0);
|
|
if (res != NULL_TREE
|
|
&& CONSTANT_CLASS_P (res))
|
|
return res;
|
|
}
|
|
|
|
code_helper rcode;
|
|
tree ops[3] = {};
|
|
if (!gimple_simplify (&rcode, ops, seq, valueize,
|
|
code, type, op0))
|
|
return NULL_TREE;
|
|
return maybe_push_res_to_seq (rcode, type, ops, seq);
|
|
}
|
|
|
|
/* Binary ops. */
|
|
|
|
tree
|
|
gimple_simplify (enum tree_code code, tree type,
|
|
tree op0, tree op1,
|
|
gimple_seq *seq, tree (*valueize)(tree))
|
|
{
|
|
if (constant_for_folding (op0) && constant_for_folding (op1))
|
|
{
|
|
tree res = const_binop (code, type, op0, op1);
|
|
if (res != NULL_TREE
|
|
&& CONSTANT_CLASS_P (res))
|
|
return res;
|
|
}
|
|
|
|
/* Canonicalize operand order both for matching and fallback stmt
|
|
generation. */
|
|
if ((commutative_tree_code (code)
|
|
|| TREE_CODE_CLASS (code) == tcc_comparison)
|
|
&& tree_swap_operands_p (op0, op1, false))
|
|
{
|
|
tree tem = op0;
|
|
op0 = op1;
|
|
op1 = tem;
|
|
if (TREE_CODE_CLASS (code) == tcc_comparison)
|
|
code = swap_tree_comparison (code);
|
|
}
|
|
|
|
code_helper rcode;
|
|
tree ops[3] = {};
|
|
if (!gimple_simplify (&rcode, ops, seq, valueize,
|
|
code, type, op0, op1))
|
|
return NULL_TREE;
|
|
return maybe_push_res_to_seq (rcode, type, ops, seq);
|
|
}
|
|
|
|
/* Ternary ops. */
|
|
|
|
tree
|
|
gimple_simplify (enum tree_code code, tree type,
|
|
tree op0, tree op1, tree op2,
|
|
gimple_seq *seq, tree (*valueize)(tree))
|
|
{
|
|
if (constant_for_folding (op0) && constant_for_folding (op1)
|
|
&& constant_for_folding (op2))
|
|
{
|
|
tree res = fold_ternary/*_to_constant */ (code, type, op0, op1, op2);
|
|
if (res != NULL_TREE
|
|
&& CONSTANT_CLASS_P (res))
|
|
return res;
|
|
}
|
|
|
|
/* Canonicalize operand order both for matching and fallback stmt
|
|
generation. */
|
|
if (commutative_ternary_tree_code (code)
|
|
&& tree_swap_operands_p (op0, op1, false))
|
|
{
|
|
tree tem = op0;
|
|
op0 = op1;
|
|
op1 = tem;
|
|
}
|
|
|
|
code_helper rcode;
|
|
tree ops[3] = {};
|
|
if (!gimple_simplify (&rcode, ops, seq, valueize,
|
|
code, type, op0, op1, op2))
|
|
return NULL_TREE;
|
|
return maybe_push_res_to_seq (rcode, type, ops, seq);
|
|
}
|
|
|
|
/* Builtin function with one argument. */
|
|
|
|
tree
|
|
gimple_simplify (enum built_in_function fn, tree type,
|
|
tree arg0,
|
|
gimple_seq *seq, tree (*valueize)(tree))
|
|
{
|
|
if (constant_for_folding (arg0))
|
|
{
|
|
tree decl = builtin_decl_implicit (fn);
|
|
if (decl)
|
|
{
|
|
tree res = fold_builtin_n (UNKNOWN_LOCATION, decl, &arg0, 1, false);
|
|
if (res)
|
|
{
|
|
/* fold_builtin_n wraps the result inside a NOP_EXPR. */
|
|
STRIP_NOPS (res);
|
|
res = fold_convert (type, res);
|
|
if (CONSTANT_CLASS_P (res))
|
|
return res;
|
|
}
|
|
}
|
|
}
|
|
|
|
code_helper rcode;
|
|
tree ops[3] = {};
|
|
if (!gimple_simplify (&rcode, ops, seq, valueize,
|
|
fn, type, arg0))
|
|
return NULL_TREE;
|
|
return maybe_push_res_to_seq (rcode, type, ops, seq);
|
|
}
|
|
|
|
/* Builtin function with two arguments. */
|
|
|
|
tree
|
|
gimple_simplify (enum built_in_function fn, tree type,
|
|
tree arg0, tree arg1,
|
|
gimple_seq *seq, tree (*valueize)(tree))
|
|
{
|
|
if (constant_for_folding (arg0)
|
|
&& constant_for_folding (arg1))
|
|
{
|
|
tree decl = builtin_decl_implicit (fn);
|
|
if (decl)
|
|
{
|
|
tree args[2];
|
|
args[0] = arg0;
|
|
args[1] = arg1;
|
|
tree res = fold_builtin_n (UNKNOWN_LOCATION, decl, args, 2, false);
|
|
if (res)
|
|
{
|
|
/* fold_builtin_n wraps the result inside a NOP_EXPR. */
|
|
STRIP_NOPS (res);
|
|
res = fold_convert (type, res);
|
|
if (CONSTANT_CLASS_P (res))
|
|
return res;
|
|
}
|
|
}
|
|
}
|
|
|
|
code_helper rcode;
|
|
tree ops[3] = {};
|
|
if (!gimple_simplify (&rcode, ops, seq, valueize,
|
|
fn, type, arg0, arg1))
|
|
return NULL_TREE;
|
|
return maybe_push_res_to_seq (rcode, type, ops, seq);
|
|
}
|
|
|
|
/* Builtin function with three arguments. */
|
|
|
|
tree
|
|
gimple_simplify (enum built_in_function fn, tree type,
|
|
tree arg0, tree arg1, tree arg2,
|
|
gimple_seq *seq, tree (*valueize)(tree))
|
|
{
|
|
if (constant_for_folding (arg0)
|
|
&& constant_for_folding (arg1)
|
|
&& constant_for_folding (arg2))
|
|
{
|
|
tree decl = builtin_decl_implicit (fn);
|
|
if (decl)
|
|
{
|
|
tree args[3];
|
|
args[0] = arg0;
|
|
args[1] = arg1;
|
|
args[2] = arg2;
|
|
tree res = fold_builtin_n (UNKNOWN_LOCATION, decl, args, 3, false);
|
|
if (res)
|
|
{
|
|
/* fold_builtin_n wraps the result inside a NOP_EXPR. */
|
|
STRIP_NOPS (res);
|
|
res = fold_convert (type, res);
|
|
if (CONSTANT_CLASS_P (res))
|
|
return res;
|
|
}
|
|
}
|
|
}
|
|
|
|
code_helper rcode;
|
|
tree ops[3] = {};
|
|
if (!gimple_simplify (&rcode, ops, seq, valueize,
|
|
fn, type, arg0, arg1, arg2))
|
|
return NULL_TREE;
|
|
return maybe_push_res_to_seq (rcode, type, ops, seq);
|
|
}
|
|
|
|
|
|
/* The main STMT based simplification entry. It is used by the fold_stmt
|
|
and the fold_stmt_to_constant APIs. */
|
|
|
|
bool
|
|
gimple_simplify (gimple stmt,
|
|
code_helper *rcode, tree *ops,
|
|
gimple_seq *seq, tree (*valueize)(tree))
|
|
{
|
|
switch (gimple_code (stmt))
|
|
{
|
|
case GIMPLE_ASSIGN:
|
|
{
|
|
enum tree_code code = gimple_assign_rhs_code (stmt);
|
|
tree type = TREE_TYPE (gimple_assign_lhs (stmt));
|
|
switch (gimple_assign_rhs_class (stmt))
|
|
{
|
|
case GIMPLE_SINGLE_RHS:
|
|
if (code == REALPART_EXPR
|
|
|| code == IMAGPART_EXPR
|
|
|| code == VIEW_CONVERT_EXPR)
|
|
{
|
|
tree op0 = TREE_OPERAND (gimple_assign_rhs1 (stmt), 0);
|
|
if (valueize && TREE_CODE (op0) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (op0);
|
|
if (tem)
|
|
op0 = tem;
|
|
}
|
|
*rcode = code;
|
|
ops[0] = op0;
|
|
return gimple_resimplify1 (seq, rcode, type, ops, valueize);
|
|
}
|
|
else if (code == BIT_FIELD_REF)
|
|
{
|
|
tree rhs1 = gimple_assign_rhs1 (stmt);
|
|
tree op0 = TREE_OPERAND (rhs1, 0);
|
|
if (valueize && TREE_CODE (op0) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (op0);
|
|
if (tem)
|
|
op0 = tem;
|
|
}
|
|
*rcode = code;
|
|
ops[0] = op0;
|
|
ops[1] = TREE_OPERAND (rhs1, 1);
|
|
ops[2] = TREE_OPERAND (rhs1, 2);
|
|
return gimple_resimplify3 (seq, rcode, type, ops, valueize);
|
|
}
|
|
else if (code == SSA_NAME
|
|
&& valueize)
|
|
{
|
|
tree op0 = gimple_assign_rhs1 (stmt);
|
|
tree valueized = valueize (op0);
|
|
if (!valueized || op0 == valueized)
|
|
return false;
|
|
ops[0] = valueized;
|
|
*rcode = TREE_CODE (op0);
|
|
return true;
|
|
}
|
|
break;
|
|
case GIMPLE_UNARY_RHS:
|
|
{
|
|
tree rhs1 = gimple_assign_rhs1 (stmt);
|
|
if (valueize && TREE_CODE (rhs1) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (rhs1);
|
|
if (tem)
|
|
rhs1 = tem;
|
|
}
|
|
*rcode = code;
|
|
ops[0] = rhs1;
|
|
return gimple_resimplify1 (seq, rcode, type, ops, valueize);
|
|
}
|
|
case GIMPLE_BINARY_RHS:
|
|
{
|
|
tree rhs1 = gimple_assign_rhs1 (stmt);
|
|
if (valueize && TREE_CODE (rhs1) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (rhs1);
|
|
if (tem)
|
|
rhs1 = tem;
|
|
}
|
|
tree rhs2 = gimple_assign_rhs2 (stmt);
|
|
if (valueize && TREE_CODE (rhs2) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (rhs2);
|
|
if (tem)
|
|
rhs2 = tem;
|
|
}
|
|
*rcode = code;
|
|
ops[0] = rhs1;
|
|
ops[1] = rhs2;
|
|
return gimple_resimplify2 (seq, rcode, type, ops, valueize);
|
|
}
|
|
case GIMPLE_TERNARY_RHS:
|
|
{
|
|
tree rhs1 = gimple_assign_rhs1 (stmt);
|
|
if (valueize && TREE_CODE (rhs1) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (rhs1);
|
|
if (tem)
|
|
rhs1 = tem;
|
|
}
|
|
tree rhs2 = gimple_assign_rhs2 (stmt);
|
|
if (valueize && TREE_CODE (rhs2) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (rhs2);
|
|
if (tem)
|
|
rhs2 = tem;
|
|
}
|
|
tree rhs3 = gimple_assign_rhs3 (stmt);
|
|
if (valueize && TREE_CODE (rhs3) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (rhs3);
|
|
if (tem)
|
|
rhs3 = tem;
|
|
}
|
|
*rcode = code;
|
|
ops[0] = rhs1;
|
|
ops[1] = rhs2;
|
|
ops[2] = rhs3;
|
|
return gimple_resimplify3 (seq, rcode, type, ops, valueize);
|
|
}
|
|
default:
|
|
gcc_unreachable ();
|
|
}
|
|
break;
|
|
}
|
|
|
|
case GIMPLE_CALL:
|
|
/* ??? This way we can't simplify calls with side-effects. */
|
|
if (gimple_call_lhs (stmt) != NULL_TREE)
|
|
{
|
|
tree fn = gimple_call_fn (stmt);
|
|
/* ??? Internal function support missing. */
|
|
if (!fn)
|
|
return false;
|
|
if (valueize && TREE_CODE (fn) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (fn);
|
|
if (tem)
|
|
fn = tem;
|
|
}
|
|
if (!fn
|
|
|| TREE_CODE (fn) != ADDR_EXPR
|
|
|| TREE_CODE (TREE_OPERAND (fn, 0)) != FUNCTION_DECL
|
|
|| DECL_BUILT_IN_CLASS (TREE_OPERAND (fn, 0)) != BUILT_IN_NORMAL
|
|
|| !builtin_decl_implicit (DECL_FUNCTION_CODE (TREE_OPERAND (fn, 0)))
|
|
|| !gimple_builtin_call_types_compatible_p (stmt,
|
|
TREE_OPERAND (fn, 0)))
|
|
return false;
|
|
|
|
tree decl = TREE_OPERAND (fn, 0);
|
|
tree type = TREE_TYPE (gimple_call_lhs (stmt));
|
|
switch (gimple_call_num_args (stmt))
|
|
{
|
|
case 1:
|
|
{
|
|
tree arg1 = gimple_call_arg (stmt, 0);
|
|
if (valueize && TREE_CODE (arg1) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (arg1);
|
|
if (tem)
|
|
arg1 = tem;
|
|
}
|
|
*rcode = DECL_FUNCTION_CODE (decl);
|
|
ops[0] = arg1;
|
|
return gimple_resimplify1 (seq, rcode, type, ops, valueize);
|
|
}
|
|
case 2:
|
|
{
|
|
tree arg1 = gimple_call_arg (stmt, 0);
|
|
if (valueize && TREE_CODE (arg1) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (arg1);
|
|
if (tem)
|
|
arg1 = tem;
|
|
}
|
|
tree arg2 = gimple_call_arg (stmt, 1);
|
|
if (valueize && TREE_CODE (arg2) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (arg2);
|
|
if (tem)
|
|
arg2 = tem;
|
|
}
|
|
*rcode = DECL_FUNCTION_CODE (decl);
|
|
ops[0] = arg1;
|
|
ops[1] = arg2;
|
|
return gimple_resimplify2 (seq, rcode, type, ops, valueize);
|
|
}
|
|
case 3:
|
|
{
|
|
tree arg1 = gimple_call_arg (stmt, 0);
|
|
if (valueize && TREE_CODE (arg1) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (arg1);
|
|
if (tem)
|
|
arg1 = tem;
|
|
}
|
|
tree arg2 = gimple_call_arg (stmt, 1);
|
|
if (valueize && TREE_CODE (arg2) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (arg2);
|
|
if (tem)
|
|
arg2 = tem;
|
|
}
|
|
tree arg3 = gimple_call_arg (stmt, 2);
|
|
if (valueize && TREE_CODE (arg3) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (arg3);
|
|
if (tem)
|
|
arg3 = tem;
|
|
}
|
|
*rcode = DECL_FUNCTION_CODE (decl);
|
|
ops[0] = arg1;
|
|
ops[1] = arg2;
|
|
ops[2] = arg3;
|
|
return gimple_resimplify3 (seq, rcode, type, ops, valueize);
|
|
}
|
|
default:
|
|
return false;
|
|
}
|
|
}
|
|
break;
|
|
|
|
case GIMPLE_COND:
|
|
{
|
|
tree lhs = gimple_cond_lhs (stmt);
|
|
if (valueize && TREE_CODE (lhs) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (lhs);
|
|
if (tem)
|
|
lhs = tem;
|
|
}
|
|
tree rhs = gimple_cond_rhs (stmt);
|
|
if (valueize && TREE_CODE (rhs) == SSA_NAME)
|
|
{
|
|
tree tem = valueize (rhs);
|
|
if (tem)
|
|
rhs = tem;
|
|
}
|
|
*rcode = gimple_cond_code (stmt);
|
|
ops[0] = lhs;
|
|
ops[1] = rhs;
|
|
return gimple_resimplify2 (seq, rcode, boolean_type_node, ops, valueize);
|
|
}
|
|
|
|
default:
|
|
break;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
/* Helper for the autogenerated code, valueize OP. */
|
|
|
|
inline tree
|
|
do_valueize (tree (*valueize)(tree), tree op)
|
|
{
|
|
if (valueize && TREE_CODE (op) == SSA_NAME)
|
|
return valueize (op);
|
|
return op;
|
|
}
|
|
|