ipa-prop.c (ipa_print_node_jump_functions, [...]): Print info about missing summaries.
authorJan Hubicka <hubicka@ucw.cz>
Wed, 13 Nov 2019 10:11:59 +0000 (11:11 +0100)
committerJan Hubicka <hubicka@gcc.gnu.org>
Wed, 13 Nov 2019 10:11:59 +0000 (10:11 +0000)
* ipa-prop.c (ipa_print_node_jump_functions,
ipa_print_node_params): Print info about missing summaries.

From-SVN: r278127

gcc/ChangeLog
gcc/ipa-prop.c

index 047052835f0ea1d06a77e3d5350a0f767302b180..c7066ab662f976aa58665179ec8e4a3a8cd30250 100644 (file)
@@ -1,3 +1,8 @@
+2019-11-13  Jan Hubicka  <hubicka@ucw.cz>
+
+       * ipa-prop.c (ipa_print_node_jump_functions,
+       ipa_print_node_params): Print info about missing summaries.
+
 2019-11-13  Richard Sandiford  <richard.sandiford@arm.com>
 
        * tree-vect-loop.c (vect_estimate_min_profitable_iters): Include
index daf6302e056e3b56bff8605cadb6fb9255ba8f74..35f0dbba59315caab8a9dd3488eb594188d8a6ae 100644 (file)
@@ -422,20 +422,19 @@ ipa_print_node_jump_functions (FILE *f, struct cgraph_node *node)
   fprintf (f, "  Jump functions of caller  %s:\n", node->dump_name ());
   for (cs = node->callees; cs; cs = cs->next_callee)
     {
-      if (!ipa_edge_args_info_available_for_edge_p (cs))
-       continue;
 
       fprintf (f, "    callsite  %s -> %s : \n",
               node->dump_name (),
               cs->callee->dump_name ());
-      ipa_print_node_jump_functions_for_edge (f, cs);
+      if (!ipa_edge_args_info_available_for_edge_p (cs))
+       fprintf (f, "       no arg info\n");
+      else
+        ipa_print_node_jump_functions_for_edge (f, cs);
     }
 
   for (cs = node->indirect_calls; cs; cs = cs->next_callee)
     {
       class cgraph_indirect_call_info *ii;
-      if (!ipa_edge_args_info_available_for_edge_p (cs))
-       continue;
 
       ii = cs->indirect_info;
       if (ii->agg_contents)
@@ -459,7 +458,10 @@ ipa_print_node_jump_functions (FILE *f, struct cgraph_node *node)
        fprintf (f, "\n");
       if (ii->polymorphic)
        ii->context.dump (f);
-      ipa_print_node_jump_functions_for_edge (f, cs);
+      if (!ipa_edge_args_info_available_for_edge_p (cs))
+       fprintf (f, "       no arg info\n");
+      else
+        ipa_print_node_jump_functions_for_edge (f, cs);
     }
 }
 
@@ -4081,6 +4083,11 @@ ipa_print_node_params (FILE *f, struct cgraph_node *node)
     return;
   info = IPA_NODE_REF (node);
   fprintf (f, "  function  %s parameter descriptors:\n", node->dump_name ());
+  if (!info)
+    {
+      fprintf (f, " no params return\n");
+      return;
+    }
   count = ipa_get_param_count (info);
   for (i = 0; i < count; i++)
     {