ipa-fnsummary.c (evaluate_properties_for_edge): Call IPA_NODE_REF on function symbol.
authorJan Hubicka <hubicka@ucw.cz>
Sat, 9 Nov 2019 21:35:35 +0000 (22:35 +0100)
committerJan Hubicka <hubicka@gcc.gnu.org>
Sat, 9 Nov 2019 21:35:35 +0000 (21:35 +0000)
* ipa-fnsummary.c (evaluate_properties_for_edge): Call IPA_NODE_REF
on function symbol.
* gcc.dg/tree-ssa/pr46076.c: Make tested code hot.

From-SVN: r278009

gcc/ChangeLog
gcc/ipa-fnsummary.c
gcc/testsuite/ChangeLog
gcc/testsuite/gcc.dg/tree-ssa/pr46076.c

index d5a91905aeb19faca19a27ddb7220e7faf1a45bd..eb80b71668df5e142af39bf5e0b52b017f5ea5bb 100644 (file)
@@ -1,3 +1,8 @@
+2019-11-09  Jan Hubicka  <hubicka@ucw.cz>
+
+       * ipa-fnsummary.c (evaluate_properties_for_edge): Call IPA_NODE_REF
+       on function symbol.
+
 2019-11-09  Jan Hubicka  <hubicka@ucw.cz>
 
        * tree.c (fld_incomplete_type_of): Clear TYPE_FINAL_P, TYPE_EMPTY_P,
index 941e732359f2917d1cb479466e937c4b9a06f556..7b8182766eed7850f15253913d1fb739e8bfa6d0 100644 (file)
@@ -474,7 +474,7 @@ evaluate_properties_for_edge (struct cgraph_edge *e, bool inline_p,
        caller_parms_info = IPA_NODE_REF (e->caller->inlined_to);
       else
        caller_parms_info = IPA_NODE_REF (e->caller);
-      callee_pi = IPA_NODE_REF (e->callee);
+      callee_pi = IPA_NODE_REF (callee);
 
       if (count && (info->conds || known_vals_ptr))
        known_vals.safe_grow_cleared (count);
index fcad98053bc626fdffb5a472a8c8011cdc541ee3..1c9657f36059e8fcf8ccebfbbca0b8c68669e22a 100644 (file)
@@ -1,3 +1,7 @@
+2019-11-09  Jan Hubicka  <hubicka@ucw.cz>
+
+       * gcc.dg/tree-ssa/pr46076.c: Make tested code hot.
+
 2019-11-09  Jakub Jelinek  <jakub@redhat.com>
 
        PR tree-optimization/92401
index a2777a604b9b8627f274d8124660f7c68ec78d32..6e5907b499599c2e47c0e3fa5c9790146060f1a5 100644 (file)
@@ -19,9 +19,12 @@ main()
 {
   /* Make sure we perform indirect inlining of one and two and optimize
      the result to a constant.  */
-  if (print(one) != 3)
-    link_error ();
-  if (print(two) != 5)
-    link_error ();
+  for (int i = 0; i < 100; i++)
+    {
+      if (print(one) != 3)
+       link_error ();
+      if (print(two) != 5)
+       link_error ();
+    }
   return 0;
 }