OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

tree.h (tree_invariant_p): Declare. 

2015-12-02  Richard Biener  <rguenther@suse.de>

	* tree.h (tree_invariant_p): Declare.
	* tree.c (tree_invariant_p): Export.
	* genmatch.c (dt_simplify::gen_1): For GENERIC code-gen never
	create SAVE_EXPRs but reject patterns if we would need to.

From-SVN: r231178
This commit is contained in:
Richard Biener 2015-12-02 14:50:32 +00:00 committed by Richard Biener
parent 694e5e4bae
commit 7b2eca0029
4 changed files with 14 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
gcc/ChangeLog
View File

@ -1,3 +1,10 @@
2015-12-02 Richard Biener <rguenther@suse.de>
* tree.h (tree_invariant_p): Declare.
* tree.c (tree_invariant_p): Export.
* genmatch.c (dt_simplify::gen_1): For GENERIC code-gen never
create SAVE_EXPRs but reject patterns if we would need to.
2015-12-02 Tom de Vries <tom@codesourcery.com>
* tree-ssa-structalias.c (find_func_aliases_for_builtin_call)

4
gcc/genmatch.c
View File

@ -3119,8 +3119,8 @@ dt_simplify::gen_1 (FILE *f, int indent, bool gimple, operand *result)
if (cinfo.info[i].result_use_count
> cinfo.info[i].match_use_count)
fprintf_indent (f, indent,
"captures[%d] = save_expr (captures[%d]);\n",
i, i);
"if (! tree_invariant_p (captures[%d])) "
"return NULL_TREE;\n", i);
}
for (unsigned j = 0; j < e->ops.length (); ++j)
{

4
gcc/tree.c
View File

@ -3231,8 +3231,6 @@ decl_address_ip_invariant_p (const_tree op)
not handle arithmetic; that's handled in skip_simple_arithmetic and
tree_invariant_p). */
static bool tree_invariant_p (tree t);
static bool
tree_invariant_p_1 (tree t)
{
@ -3282,7 +3280,7 @@ tree_invariant_p_1 (tree t)
/* Return true if T is function-invariant. */
static bool
bool
tree_invariant_p (tree t)
{
tree inner = skip_simple_arithmetic (t);

4
gcc/tree.h
View File

@ -4320,6 +4320,10 @@ extern tree staticp (tree);
extern tree save_expr (tree);
/* Return true if T is function-invariant. */
extern bool tree_invariant_p (tree);
/* Look inside EXPR into any simple arithmetic operations. Return the
outermost non-arithmetic or non-invariant node. */