+2020-01-08 Martin Liska <mliska@suse.cz>
+
+ * cgraph.c (cgraph_node::dump): Use ::dump_name or
+ ::dump_asm_name instead of (::name or ::asm_name).
+ * cgraphclones.c (symbol_table::materialize_all_clones): Likewise.
+ * cgraphunit.c (walk_polymorphic_call_targets): Likewise.
+ (analyze_functions): Likewise.
+ (expand_all_functions): Likewise.
+ * ipa-cp.c (ipcp_cloning_candidate_p): Likewise.
+ (propagate_bits_across_jump_function): Likewise.
+ (dump_profile_updates): Likewise.
+ (ipcp_store_bits_results): Likewise.
+ (ipcp_store_vr_results): Likewise.
+ * ipa-devirt.c (dump_targets): Likewise.
+ * ipa-fnsummary.c (analyze_function_body): Likewise.
+ * ipa-hsa.c (check_warn_node_versionable): Likewise.
+ (process_hsa_functions): Likewise.
+ * ipa-icf.c (sem_item_optimizer::merge_classes): Likewise.
+ (set_alias_uids): Likewise.
+ * ipa-inline-transform.c (save_inline_function_body): Likewise.
+ * ipa-inline.c (recursive_inlining): Likewise.
+ (inline_to_all_callers_1): Likewise.
+ (ipa_inline): Likewise.
+ * ipa-profile.c (ipa_propagate_frequency_1): Likewise.
+ (ipa_propagate_frequency): Likewise.
+ * ipa-prop.c (ipa_make_edge_direct_to_target): Likewise.
+ (remove_described_reference): Likewise.
+ * ipa-pure-const.c (worse_state): Likewise.
+ (check_retval_uses): Likewise.
+ (analyze_function): Likewise.
+ (propagate_pure_const): Likewise.
+ (propagate_nothrow): Likewise.
+ (dump_malloc_lattice): Likewise.
+ (propagate_malloc): Likewise.
+ (pass_local_pure_const::execute): Likewise.
+ * ipa-visibility.c (optimize_weakref): Likewise.
+ (function_and_variable_visibility): Likewise.
+ * ipa.c (symbol_table::remove_unreachable_nodes): Likewise.
+ (ipa_discover_variable_flags): Likewise.
+ * lto-streamer-out.c (output_function): Likewise.
+ (output_constructor): Likewise.
+ * tree-inline.c (copy_bb): Likewise.
+ * tree-ssa-structalias.c (ipa_pta_execute): Likewise.
+ * varpool.c (symbol_table::remove_unreferenced_decls): Likewise.
+
2020-01-08 Richard Biener <rguenther@suse.de>
PR middle-end/93199
if (tp_first_run > 0)
fprintf (f, " first_run:%" PRId64, (int64_t) tp_first_run);
if (origin)
- fprintf (f, " nested in:%s", origin->asm_name ());
+ fprintf (f, " nested in:%s", origin->dump_asm_name ());
if (gimple_has_body_p (decl))
fprintf (f, " body");
if (process)
if (symtab->dump_file)
{
fprintf (symtab->dump_file, "cloning %s to %s\n",
- xstrdup_for_dump (node->clone_of->name ()),
- xstrdup_for_dump (node->name ()));
+ node->clone_of->dump_name (), node->name ());
if (node->clone.tree_map)
{
unsigned int i;
{
dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, edge->call_stmt,
"devirtualizing call in %s to %s\n",
- edge->caller->name (), target->name ());
+ edge->caller->dump_name (),
+ target->dump_name ());
}
edge->make_direct (target);
fprintf (symtab->dump_file, "Trivially needed symbols:");
changed = true;
if (symtab->dump_file)
- fprintf (symtab->dump_file, " %s", node->asm_name ());
+ fprintf (symtab->dump_file, " %s", node->dump_asm_name ());
if (!changed && symtab->dump_file)
fprintf (symtab->dump_file, "\n");
}
if (!node->aux && !node->referred_to_p ())
{
if (symtab->dump_file)
- fprintf (symtab->dump_file, " %s", node->name ());
+ fprintf (symtab->dump_file, " %s", node->dump_name ());
/* See if the debugger can use anything before the DECL
passes away. Perhaps it can notice a DECL that is now a
if (symtab->dump_file)
fprintf (symtab->dump_file,
"Time profile order in expand_all_functions:%s:%d\n",
- node->asm_name (), node->tp_first_run);
+ node->dump_asm_name (), node->tp_first_run);
node->process = 0;
node->expand ();
}
if (dump_file)
fprintf (dump_file, "Not considering %s for cloning; "
"-fipa-cp-clone disabled.\n",
- node->name ());
+ node->dump_name ());
return false;
}
if (dump_file)
fprintf (dump_file, "Not considering %s for cloning; "
"optimizing it for size.\n",
- node->name ());
+ node->dump_name ());
return false;
}
{
if (dump_file)
fprintf (dump_file, "Considering %s for cloning; code might shrink.\n",
- node->name ());
+ node->dump_name ());
return true;
}
if (dump_file)
fprintf (dump_file, "Considering %s for cloning; "
"usually called directly.\n",
- node->name ());
+ node->dump_name ());
return true;
}
}
{
if (dump_file)
fprintf (dump_file, "Not considering %s for cloning; no hot calls.\n",
- node->name ());
+ node->dump_name ());
return false;
}
if (dump_file)
fprintf (dump_file, "Considering %s for cloning.\n",
- node->name ());
+ node->dump_name ());
return true;
}
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Setting dest_lattice to bottom, because type of "
"param %i of %s is NULL or unsuitable for bits propagation\n",
- idx, cs->callee->name ());
+ idx, cs->callee->dump_name ());
return dest_lattice->set_to_bottom ();
}
for (cs = new_node->callees; cs; cs = cs->next_callee)
{
fprintf (dump_file, " edge to %s has count ",
- cs->callee->name ());
+ cs->callee->dump_name ());
cs->count.dump (dump_file);
fprintf (dump_file, "\n");
}
for (cs = orig_node->callees; cs; cs = cs->next_callee)
{
fprintf (dump_file, " edge to %s is left with ",
- cs->callee->name ());
+ cs->callee->dump_name ());
cs->count.dump (dump_file);
fprintf (dump_file, "\n");
}
if (dump_file)
fprintf (dump_file, "Not considering %s for ipa bitwise propagation "
"; -fipa-bit-cp: disabled.\n",
- node->name ());
+ node->dump_name ());
continue;
}
if (dump_file)
fprintf (dump_file, "Not considering %s for VR discovery "
"and propagate; -fipa-ipa-vrp: disabled.\n",
- node->name ());
+ node->dump_name ());
continue;
}
char *name = NULL;
if (in_lto_p)
name = cplus_demangle_v3 (targets[i]->asm_name (), 0);
- fprintf (f, " %s/%i", name ? name : targets[i]->name (),
- targets[i]->order);
+ fprintf (f, " %s", name ? name : targets[i]->dump_name ());
if (in_lto_p)
free (name);
if (!targets[i]->definition)
if (dump_file)
fprintf (dump_file, "\nAnalyzing function body size: %s\n",
- node->name ());
+ node->dump_name ());
/* When we run into maximal number of entries, we assign everything to the
constant truth case. Be sure to have it in list. */
{
warning_at (EXPR_LOCATION (node->decl), OPT_Whsa,
"could not emit HSAIL for function %s: function cannot be "
- "cloned", node->name ());
+ "cloned", node->dump_name ());
return false;
}
return true;
if (dump_file)
fprintf (dump_file, "Created a new HSA clone: %s, type: %s\n",
- clone->name (),
+ clone->dump_name (),
s->m_kind == HSA_KERNEL ? "kernel" : "function");
}
else if (hsa_callable_function_p (node->decl)
if (dump_file)
fprintf (dump_file, "Created a new HSA function clone: %s\n",
- clone->name ());
+ clone->dump_name ());
}
}
if (dump_file)
fprintf (dump_file,
"Redirecting edge to HSA function: %s->%s\n",
- xstrdup_for_dump (e->caller->name ()),
- xstrdup_for_dump (e->callee->name ()));
+ e->caller->dump_name (),
+ e->callee->dump_name ());
}
}
{
dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, loc,
"Semantic equality hit:%s->%s\n",
- xstrdup_for_dump (source->node->name ()),
- xstrdup_for_dump (alias->node->name ()));
+ source->node->dump_name (),
+ alias->node->dump_name ());
dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, loc,
"Assembler symbol names:%s->%s\n",
- xstrdup_for_dump (source->node->asm_name ()),
- xstrdup_for_dump (alias->node->asm_name ()));
+ source->node->dump_asm_name (),
+ alias->node->dump_asm_name ());
}
if (lookup_attribute ("no_icf", DECL_ATTRIBUTES (alias->decl)))
{
if (dump_file)
fprintf (dump_file, " Setting points-to UID of [%s] as %d\n",
- xstrdup_for_dump (ref->referring->asm_name ()), uid);
+ ref->referring->dump_asm_name (), uid);
SET_DECL_PT_UID (ref->referring->decl, uid);
set_alias_uids (ref->referring, uid);
if (dump_file)
fprintf (dump_file, "\nSaving body of %s for later reuse\n",
- node->name ());
+ node->dump_name ());
gcc_assert (node == cgraph_node::get (node->decl));
if (dump_file)
fprintf (dump_file,
- " Performing recursive inlining on %s\n",
- node->name ());
+ " Performing recursive inlining on %s\n", node->dump_name ());
/* Do the inlining and update list of recursive call during process. */
while (!heap.empty ())
cgraph_node *ultimate = node->ultimate_alias_target ();
fprintf (dump_file,
"\nInlining %s size %i.\n",
- ultimate->name (),
+ ultimate->dump_name (),
ipa_size_summaries->get (ultimate)->size);
fprintf (dump_file,
" Called once from %s %i insns.\n",
- node->callers->caller->name (),
+ node->callers->caller->dump_name (),
ipa_size_summaries->get (node->callers->caller)->size);
}
if (dump_file)
fprintf (dump_file,
" Inlined into %s which now has %i size\n",
- caller->name (),
+ caller->dump_name (),
ipa_size_summaries->get (caller)->size);
if (!(*num_calls)--)
{
try to flatten itself turning it into a self-recursive
function. */
if (dump_file)
- fprintf (dump_file, "Flattening %s\n", node->name ());
+ fprintf (dump_file, "Flattening %s\n", node->dump_name ());
flatten_function (node, false, true);
}
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, " Called by %s that is executed once\n",
- edge->caller->name ());
+ edge->caller->dump_name ());
d->maybe_unlikely_executed = false;
ipa_call_summary *s = ipa_call_summaries->get (edge);
if (s != NULL && s->loop_depth)
case NODE_FREQUENCY_NORMAL:
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, " Called by %s that is normal or hot\n",
- edge->caller->name ());
+ edge->caller->dump_name ());
d->maybe_unlikely_executed = false;
d->maybe_executed_once = false;
break;
return false;
gcc_assert (node->analyzed);
if (dump_file && (dump_flags & TDF_DETAILS))
- fprintf (dump_file, "Processing frequency %s\n", node->name ());
+ fprintf (dump_file, "Processing frequency %s\n", node->dump_name ());
node->call_for_symbol_and_aliases (ipa_propagate_frequency_1, &d,
true);
node->only_called_at_startup = true;
if (dump_file)
fprintf (dump_file, "Node %s promoted to only called at startup.\n",
- node->name ());
+ node->dump_name ());
changed = true;
}
if ((d.only_called_at_exit && !d.only_called_at_startup)
node->only_called_at_exit = true;
if (dump_file)
fprintf (dump_file, "Node %s promoted to only called at exit.\n",
- node->name ());
+ node->dump_name ());
changed = true;
}
{
if (dump_file)
fprintf (dump_file, "Node %s promoted to hot.\n",
- node->name ());
+ node->dump_name ());
node->frequency = NODE_FREQUENCY_HOT;
return true;
}
{
if (dump_file)
fprintf (dump_file, "Node %s reduced to normal.\n",
- node->name ());
+ node->dump_name ());
node->frequency = NODE_FREQUENCY_NORMAL;
changed = true;
}
node->frequency = NODE_FREQUENCY_UNLIKELY_EXECUTED;
if (dump_file)
fprintf (dump_file, "Node %s promoted to unlikely executed.\n",
- node->name ());
+ node->dump_name ());
changed = true;
}
else if (d.maybe_executed_once && node->frequency != NODE_FREQUENCY_EXECUTED_ONCE)
node->frequency = NODE_FREQUENCY_EXECUTED_ONCE;
if (dump_file)
fprintf (dump_file, "Node %s promoted to executed once.\n",
- node->name ());
+ node->dump_name ());
changed = true;
}
return changed;
{
dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, ie->call_stmt,
"converting indirect call in %s to direct call to %s\n",
- ie->caller->name (), callee->name ());
+ ie->caller->dump_name (), callee->dump_name ());
}
if (!speculative)
{
to_del->remove_reference ();
if (dump_file)
fprintf (dump_file, "ipa-prop: Removed a reference from %s to %s.\n",
- origin->caller->dump_name (), xstrdup_for_dump (symbol->name ()));
+ origin->caller->dump_name (), symbol->dump_name ());
return true;
}
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Dropping state to PURE because call to %s may not "
- "bind to current def.\n", to->name ());
+ "bind to current def.\n", to->dump_name ());
state2 = IPA_PURE;
}
*state = MAX (*state, state2);
{ \
if (dump_file && (dump_flags & TDF_DETAILS)) \
fprintf (dump_file, "\n%s is not a malloc candidate, reason: %s\n", \
- (node->name()), (reason)); \
+ (node->dump_name ()), (reason)); \
return false; \
}
if (dump_file)
{
fprintf (dump_file, "\n\n local analysis of %s\n ",
- fn->name ());
+ fn->dump_name ());
}
push_cfun (DECL_STRUCT_FUNCTION (decl));
w->nonfreeing_fn = !can_free;
if (!can_free && dump_file)
fprintf (dump_file, "Function found not to call free: %s\n",
- w->name ());
+ w->dump_name ());
if (w_l->state_previously_known != IPA_NEITHER
&& this_state > w_l->state_previously_known)
if (dump_file)
fprintf (dump_file, "Function found to be %sconst: %s\n",
this_looping ? "looping " : "",
- w->name ());
+ w->dump_name ());
}
/* Turning constructor or destructor to non-looping const/pure
enables us to possibly remove the function completely. */
fprintf (dump_file,
"Declaration updated to be %sconst: %s\n",
this_looping ? "looping " : "",
- w->name ());
+ w->dump_name ());
remove_p |= has_cdtor;
}
break;
if (dump_file)
fprintf (dump_file, "Function found to be %spure: %s\n",
this_looping ? "looping " : "",
- w->name ());
+ w->dump_name ());
}
if (this_looping)
has_cdtor = false;
fprintf (dump_file,
"Declaration updated to be %spure: %s\n",
this_looping ? "looping " : "",
- w->name ());
+ w->dump_name ());
remove_p |= has_cdtor;
}
break;
w->set_nothrow_flag (true);
if (dump_file)
fprintf (dump_file, "Function found to be nothrow: %s\n",
- w->name ());
+ w->dump_name ());
}
}
else if (can_throw && !TREE_NOTHROW (w->decl))
{
funct_state fs = funct_state_summaries->get (node);
if (fs)
- fprintf (dump_file, "%s: %s\n", node->name (),
+ fprintf (dump_file, "%s: %s\n", node->dump_name (),
malloc_state_names[fs->malloc_state]);
}
}
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "Function %s found to be malloc\n",
- node->name ());
+ node->dump_name ());
bool malloc_decl_p = DECL_IS_MALLOC (node->decl);
node->set_malloc_flag (true);
changed = true;
if (dump_file)
fprintf (dump_file, "Function found to be malloc: %s\n",
- node->name ());
+ node->dump_name ());
}
free (l);
if (dump_file)
fprintf (dump_file, "Optimizing weakref %s %s\n",
- node->name(),
+ node->dump_name (),
static_alias ? "as static alias" : "as transparent alias");
if (static_alias)
fprintf (dump_file, "\nMarking local functions:");
FOR_EACH_DEFINED_FUNCTION (node)
if (node->local)
- fprintf (dump_file, " %s", node->name ());
+ fprintf (dump_file, " %s", node->dump_name ());
fprintf (dump_file, "\n\n");
fprintf (dump_file, "\nMarking externally visible functions:");
FOR_EACH_DEFINED_FUNCTION (node)
if (node->externally_visible)
- fprintf (dump_file, " %s", node->name ());
+ fprintf (dump_file, " %s", node->dump_name ());
fprintf (dump_file, "\n\n");
fprintf (dump_file, "\nMarking externally visible variables:");
FOR_EACH_DEFINED_VARIABLE (vnode)
if (vnode->externally_visible)
- fprintf (dump_file, " %s", vnode->name ());
+ fprintf (dump_file, " %s", vnode->dump_name ());
fprintf (dump_file, "\n\n");
}
symtab->function_flags_ready = true;
if (vnode->definition)
{
if (file)
- fprintf (file, " %s", vnode->name ());
+ fprintf (file, " %s", vnode->dump_name ());
changed = true;
}
/* Keep body if it may be useful for constant folding. */
(has_addr_references_p, NULL, true))
{
if (file)
- fprintf (file, " %s", node->name ());
+ fprintf (file, " %s", node->dump_name ());
node->address_taken = false;
changed = true;
if (node->local_p ()
if (!address_taken)
{
if (TREE_ADDRESSABLE (vnode->decl) && dump_file)
- fprintf (dump_file, " %s (non-addressable)", vnode->name ());
+ fprintf (dump_file, " %s (non-addressable)",
+ vnode->dump_name ());
vnode->call_for_symbol_and_aliases (clear_addressable_bit, NULL,
true);
}
&& vnode->get_section () == NULL)
{
if (!TREE_READONLY (vnode->decl) && dump_file)
- fprintf (dump_file, " %s (read-only)", vnode->name ());
+ fprintf (dump_file, " %s (read-only)", vnode->dump_name ());
vnode->call_for_symbol_and_aliases (set_readonly_bit, NULL, true);
}
if (!vnode->writeonly && !read && !address_taken && written)
{
if (dump_file)
- fprintf (dump_file, " %s (write-only)", vnode->name ());
+ fprintf (dump_file, " %s (write-only)", vnode->dump_name ());
vnode->call_for_symbol_and_aliases (set_writeonly_bit, &remove_p,
true);
}
if (streamer_dump_file)
fprintf (streamer_dump_file, "\nStreaming body of %s\n",
- node->name ());
+ node->dump_name ());
function = node->decl;
fn = DECL_STRUCT_FUNCTION (function);
destroy_output_block (ob);
if (streamer_dump_file)
fprintf (streamer_dump_file, "Finished streaming %s\n",
- node->name ());
+ node->dump_name ());
}
/* Output the body of function NODE->DECL. */
if (streamer_dump_file)
fprintf (streamer_dump_file, "\nStreaming constructor of %s\n",
- node->name ());
+ node->dump_name ());
timevar_push (TV_IPA_LTO_CTORS_OUT);
ob = create_output_block (LTO_section_function_body);
destroy_output_block (ob);
if (streamer_dump_file)
fprintf (streamer_dump_file, "Finished streaming %s\n",
- node->name ());
+ node->dump_name ());
timevar_pop (TV_IPA_LTO_CTORS_OUT);
}
2020-01-08 Martin Liska <mliska@suse.cz>
+ * lto-partition.c (add_symbol_to_partition_1): Use ::dump_name or
+ ::dump_asm_name instead of (::name or ::asm_name).
+ (lto_balanced_map): Likewise.
+ (promote_symbol): Likewise.
+ (rename_statics): Likewise.
+ * lto.c (lto_wpa_write_files): Likewise.
+
+2020-01-08 Martin Liska <mliska@suse.cz>
+
* lto-partition.c (lto_balanced_map): Use symtab_node::dump_name.
2020-01-01 Jakub Jelinek <jakub@redhat.com>
if (dump_file)
fprintf (dump_file,
"Symbol node %s now used in multiple partitions\n",
- node->name ());
+ node->dump_name ());
}
node->aux = (void *)((size_t)node->aux + 1);
{
for (unsigned i = 0; i < order.length (); i++)
fprintf (dump_file, "Balanced map symbol order:%s:%u\n",
- order[i]->name (), order[i]->tp_first_run);
+ order[i]->dump_name (), order[i]->tp_first_run);
for (unsigned i = 0; i < noreorder.length (); i++)
fprintf (dump_file, "Balanced map symbol no_reorder:%s:%u\n",
- noreorder[i]->name (), noreorder[i]->tp_first_run);
+ noreorder[i]->dump_name (), noreorder[i]->tp_first_run);
}
/* Collect all variables that should not be reordered. */
DECL_VISIBILITY_SPECIFIED (node->decl) = true;
if (dump_file)
fprintf (dump_file,
- "Promoting as hidden: %s (%s)\n", node->name (),
+ "Promoting as hidden: %s (%s)\n", node->dump_name (),
IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node->decl)));
/* Promoting a symbol also promotes all transparent aliases with exception
if (dump_file)
fprintf (dump_file,
- "Renaming statics with asm name: %s\n", node->name ());
+ "Renaming statics with asm name: %s\n", node->dump_name ());
/* Assign every symbol in the set that shares the same ASM name an unique
mangled name. */
lsei_next_in_partition (&lsei))
{
symtab_node *node = lsei_node (lsei);
- fprintf (symtab->dump_file, "%s ", node->asm_name ());
+ fprintf (symtab->dump_file, "%s ", node->dump_asm_name ());
}
fprintf (symtab->dump_file, "\n Symbols in boundary: ");
for (lsei = lsei_start (part->encoder); !lsei_end_p (lsei);
symtab_node *node = lsei_node (lsei);
if (!lto_symtab_encoder_in_partition_p (part->encoder, node))
{
- fprintf (symtab->dump_file, "%s ", node->asm_name ());
+ fprintf (symtab->dump_file, "%s ", node->dump_asm_name ());
cgraph_node *cnode = dyn_cast <cgraph_node *> (node);
if (cnode
&& lto_symtab_encoder_encode_body_p (part->encoder,
+2020-01-08 Martin Liska <mliska@suse.cz>
+
+ * gcc.dg/ipa/ipa-icf-1.c: Update expected scanned output.
+ * gcc.dg/ipa/ipa-icf-10.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-11.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-12.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-13.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-16.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-18.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-2.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-20.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-21.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-23.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-25.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-26.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-27.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-3.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-35.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-36.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-37.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-38.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-5.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-7.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-8.c: Likewise.
+ * gcc.dg/ipa/ipa-icf-merge-1.c: Likewise.
+ * gcc.dg/ipa/pr64307.c: Likewise.
+ * gcc.dg/ipa/pr90555.c: Likewise.
+ * gcc.dg/ipa/propmalloc-1.c: Likewise.
+ * gcc.dg/ipa/propmalloc-2.c: Likewise.
+ * gcc.dg/ipa/propmalloc-3.c: Likewise.
+
2020-01-08 Richard Biener <rguenther@suse.de>
PR testsuite/92997
return 0;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:x1->x2" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:x1/\[0-9+\]+->x2/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return 0;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:ferda->funkce" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:ferda/\[0-9+\]+->funkce/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return f0(argc) * f1(argc);
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:f0->f1" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:f0/\[0-9+\]+->f1/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return 0;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:gcd->nsd" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:gcd/\[0-9+\]+->nsd/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
printf("Test2: %d, %d, gdc: %d\n", a, b, nsd(a, b));
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:s1->s2" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:nsd_different_result->nsd_different_result2" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:gcd->nsd" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:s1/\[0-9+\]+->s2/\[0-9+\]+" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:nsd_different_result/\[0-9+\]+->nsd_different_result2/\[0-9+\]+" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:gcd/\[0-9+\]+->nsd/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 3" "icf" } } */
return foo() + bar();
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:foo->bar" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:foo/\[0-9+\]+->bar/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return 0;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:foo->bar" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:foo/\[0-9+\]+->bar/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return 0;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:f1->f2" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:f1/\[0-9+\]+->f2/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return 0;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:foo->bar" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:foo/\[0-9+\]+->bar/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return 2;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:foo->bar" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:foo/\[0-9+\]+->bar/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return foo(0) + bar(0);
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:foo->bar" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:foo/\[0-9+\]+->bar/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return foo() + bar();
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:foo->bar" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:zip->zap" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:foo/\[0-9+\]+->bar/\[0-9+\]+" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:zip/\[0-9+\]+->zap/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 2" "icf" } } */
return 0;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:destroy->remove" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:destroy/\[0-9+\]+->remove/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return 0;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:destroy->remove" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:destroy/\[0-9+\]+->remove/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return 0;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:foo->bar" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:foo/\[0-9+\]+->bar/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
}
/* { dg-final { scan-ipa-dump "Equal symbols: 3" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:f1->f2" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:c->d" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:a->b" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:f1/\[0-9+\]+->f2/\[0-9+\]+" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:c/\[0-9+\]+->d/\[0-9+\]+" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:a/\[0-9+\]+->b/\[0-9+\]+" "icf" } } */
}
/* { dg-final { scan-ipa-dump "Equal symbols: 6" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:a->b" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:c->d" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:e->f" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:g->h" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:i->k" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:a/\[0-9+\]+->b/\[0-9+\]+" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:c/\[0-9+\]+->d/\[0-9+\]+" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:e/\[0-9+\]+->f/\[0-9+\]+" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:g/\[0-9+\]+->h/\[0-9+\]+" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:i/\[0-9+\]+->k/\[0-9+\]+" "icf" } } */
}
/* { dg-final { scan-ipa-dump "Equal symbols: 5" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:a->b" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:c->d" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:e->f" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:g->h" "icf" } } */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:i->j" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:a/\[0-9+\]+->b/\[0-9+\]+" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:c/\[0-9+\]+->d/\[0-9+\]+" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:e/\[0-9+\]+->f/\[0-9+\]+" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:g/\[0-9+\]+->h/\[0-9+\]+" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:i/\[0-9+\]+->j/\[0-9+\]+" "icf" } } */
return 0;
}
-/* { dg-final { scan-wpa-ipa-dump "Semantic equality hit:foo->bar" "icf" } } */
+/* { dg-final { scan-wpa-ipa-dump "Semantic equality hit:foo/\[0-9+\]+->bar/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-wpa-ipa-dump "Equal symbols: 1" "icf" } } */
/* { dg-final { scan-ltrans-tree-dump "Function foo" "optimized" } } */
/* { dg-final { scan-ltrans-tree-dump-not "Function bar" "optimized" } } */
return 1;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:f1->f2" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:f1/\[0-9+\]+->f2/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return 1;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:foo->foo2" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:foo/\[0-9+\]+->foo2/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
printf("fce2: %d\n", fce2(argc, 2 * argc));
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:fce1->fce2" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:fce1/\[0-9+\]+->fce2/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
}
/* Notice the two functions are the same. */
-/* { dg-final { scan-ipa-dump "Semantic equality hit:foo->main" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:foo/\[0-9+\]+->main/\[0-9+\]+" "icf" } } */
/* Make sure we don't tail call main. */
/* { dg-final { scan-ipa-dump-not "= main \\(\\);" "icf" } } */
return r1 - r2;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:real_part->real_part_2" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:real_part/\[0-9+\]+->real_part_2/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return c2;
}
-/* { dg-final { scan-ipa-dump "Semantic equality hit:test_simduid1->test_simduid2" "icf" } } */
+/* { dg-final { scan-ipa-dump "Semantic equality hit:test_simduid1/\[0-9+\]+->test_simduid2/\[0-9+\]+" "icf" } } */
/* { dg-final { scan-ipa-dump "Equal symbols: 1" "icf" } } */
return p;
}
-/* { dg-final { scan-ipa-dump "Function f found to be malloc" "pure-const" } } */
-/* { dg-final { scan-ipa-dump "Function bar found to be malloc" "pure-const" } } */
+/* { dg-final { scan-ipa-dump "Function f/\[0-9+\]+ found to be malloc" "pure-const" } } */
+/* { dg-final { scan-ipa-dump "Function bar/\[0-9+\]+ found to be malloc" "pure-const" } } */
return p;
}
-/* { dg-final { scan-ipa-dump "Function foo found to be malloc" "pure-const" } } */
-/* { dg-final { scan-ipa-dump "Function bar found to be malloc" "pure-const" } } */
+/* { dg-final { scan-ipa-dump "Function foo/\[0-9+\]+ found to be malloc" "pure-const" } } */
+/* { dg-final { scan-ipa-dump "Function bar/\[0-9+\]+ found to be malloc" "pure-const" } } */
return p;
}
-/* { dg-final { scan-ipa-dump "Function foo found to be malloc" "pure-const" } } */
-/* { dg-final { scan-ipa-dump "Function bar found to be malloc" "pure-const" } } */
+/* { dg-final { scan-ipa-dump "Function foo/\[0-9+\]+ found to be malloc" "pure-const" } } */
+/* { dg-final { scan-ipa-dump "Function bar/\[0-9+\]+ found to be malloc" "pure-const" } } */
if (dump_file)
{
fprintf (dump_file, "Created new direct edge to %s\n",
- dest->name ());
+ dest->dump_name ());
}
}
&& from != constraints.length ())
{
fprintf (dump_file,
- "Generating intial constraints for %s", node->name ());
+ "Generating initial constraints for %s",
+ node->dump_name ());
if (DECL_ASSEMBLER_NAME_SET_P (node->decl))
fprintf (dump_file, " (%s)",
IDENTIFIER_POINTER
if (dump_file)
{
fprintf (dump_file,
- "Generating constraints for %s", node->name ());
+ "Generating constraints for %s", node->dump_name ());
if (DECL_ASSEMBLER_NAME_SET_P (node->decl))
fprintf (dump_file, " (%s)",
IDENTIFIER_POINTER
{
enqueue_node (node, &first);
if (dump_file)
- fprintf (dump_file, " %s", node->asm_name ());
+ fprintf (dump_file, " %s", node->dump_asm_name ());
}
}
while (first != (varpool_node *)(void *)1)
if (!node->aux && !node->no_reorder)
{
if (dump_file)
- fprintf (dump_file, " %s", node->asm_name ());
+ fprintf (dump_file, " %s", node->dump_asm_name ());
if (referenced.contains(node))
node->remove_initializer ();
else
projects / platform / upstream / gcc.git / commitdiff