+2020-04-16 Martin Jambor <mjambor@suse.cz>
+
+ PR ipa/93621
+ * ipa-inline.h (ipa_saved_clone_sources): Declare.
+ * ipa-inline-transform.c (ipa_saved_clone_sources): New variable.
+ (save_inline_function_body): Link the new body holder with the
+ previous one.
+ * cgraph.c: Include ipa-inline.h.
+ (cgraph_edge::redirect_call_stmt_to_callee): Try to find the decl from
+ the statement in ipa_saved_clone_sources.
+ * cgraphunit.c: Include ipa-inline.h.
+ (expand_all_functions): Free ipa_saved_clone_sources.
+
2020-04-16 Richard Sandiford <richard.sandiford@arm.com>
PR target/94606
#include "attribs.h"
#include "selftest.h"
#include "tree-into-ssa.h"
+#include "ipa-inline.h"
/* FIXME: Only for PROP_loops, but cgraph shouldn't have to know about this. */
#include "tree-pass.h"
|| decl == e->callee->decl)
return e->call_stmt;
+ if (decl && ipa_saved_clone_sources)
+ {
+ tree *p = ipa_saved_clone_sources->get (e->callee);
+ if (p && decl == *p)
+ {
+ gimple_call_set_fndecl (e->call_stmt, e->callee->decl);
+ return e->call_stmt;
+ }
+ }
+
if (flag_checking && decl)
{
cgraph_node *node = cgraph_node::get (decl);
#include "lto-section-names.h"
#include "stringpool.h"
#include "attribs.h"
+#include "ipa-inline.h"
/* Queue of cgraph nodes scheduled to be added into cgraph. This is a
secondary queue used during optimization to accommodate passes that
symtab->process_new_functions ();
free_gimplify_stack ();
-
+ delete ipa_saved_clone_sources;
+ ipa_saved_clone_sources = NULL;
free (order);
}
return new_edges_found;
}
+/* For each node that was made the holder of function body by
+ save_inline_function_body, this summary contains pointer to the previous
+ holder of the body. */
+
+function_summary <tree *> *ipa_saved_clone_sources;
/* Copy function body of NODE and redirect all inline clones to it.
This is done before inline plan is applied to NODE when there are
first_clone->next_sibling_clone = NULL;
gcc_assert (!first_clone->prev_sibling_clone);
}
+
+ tree prev_body_holder = node->decl;
+ if (!ipa_saved_clone_sources)
+ ipa_saved_clone_sources = new function_summary <tree *> (symtab);
+ else
+ {
+ tree *p = ipa_saved_clone_sources->get (node);
+ if (p)
+ {
+ prev_body_holder = *p;
+ gcc_assert (prev_body_holder);
+ }
+ }
+ *ipa_saved_clone_sources->get_create (first_clone) = prev_body_holder;
first_clone->clone_of = NULL;
/* Now node in question has no clones. */
extern int ncalls_inlined;
extern int nfunctions_inlined;
+extern function_summary <tree *> *ipa_saved_clone_sources;
/* Return estimated size of the inline sequence of EDGE. */
+2020-04-16 Martin Jambor <mjambor@suse.cz>
+
+ PR ipa/93621
+ * g++.dg/ipa/pr93621.C: New test.
+
2020-04-16 Richard Sandiford <richard.sandiford@arm.com>
PR target/94606
--- /dev/null
+// PR ipa/93621
+// { dg-do compile }
+// { dg-options "-O3 --param ipa-cp-eval-threshold=100 --param large-function-growth=60 --param large-function-insns=10 --param uninlined-thunk-insns=1000" }
+
+typedef enum { X } E;
+struct A {
+ virtual void bar ();
+};
+struct B {
+ virtual E fn (const char *, int, int *) = 0;
+};
+struct C : A, B {
+ E fn (const char *, int, int *);
+ void fn2 ();
+ B *foo;
+};
+void C::fn2 () {
+ if (!foo)
+ return;
+ foo->fn (0, 0, 0);
+}
+E
+C::fn (const char *, int, int *)
+{
+ fn2 ();
+ foo = 0;
+ fn (0, 0, 0);
+ return X;
+}