diff options
| author | Trevor Saunders <tsaunders@mozilla.com> | 2013-11-18 12:18:12 +0000 |
|---|---|---|
| committer | Trevor Saunders <tbsaunde@gcc.gnu.org> | 2013-11-18 12:18:12 +0000 |
| commit | fec39fa6b010bb0a37c93412e8f147668c558f98 (patch) | |
| tree | a5a2310e101e4acec88120d4acdb8a49b8cf9bb3 /gcc/ipa-inline-analysis.c | |
| parent | 1f66e10e20b9b281a77ff85b2db40574524054ac (diff) | |
| download | gcc-fec39fa6b010bb0a37c93412e8f147668c558f98.zip gcc-fec39fa6b010bb0a37c93412e8f147668c558f98.tar.gz gcc-fec39fa6b010bb0a37c93412e8f147668c558f98.tar.bz2 | |
remove nolonger needed {cgraph,varpool}_node_{,asm_}name () functions
From-SVN: r204946
Diffstat (limited to 'gcc/ipa-inline-analysis.c')
| -rw-r--r-- | gcc/ipa-inline-analysis.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/ipa-inline-analysis.c b/gcc/ipa-inline-analysis.c index 52878b3..fb05cae 100644 --- a/gcc/ipa-inline-analysis.c +++ b/gcc/ipa-inline-analysis.c @@ -1301,7 +1301,7 @@ dump_inline_edge_summary (FILE *f, int indent, struct cgraph_node *node, fprintf (f, "%*s%s/%i %s\n%*s loop depth:%2i freq:%4i size:%2i" " time: %2i callee size:%2i stack:%2i", - indent, "", cgraph_node_name (callee), callee->order, + indent, "", callee->name (), callee->order, !edge->inline_failed ? "inlined" : cgraph_inline_failed_string (edge-> inline_failed), indent, "", es->loop_depth, edge->frequency, @@ -1366,7 +1366,7 @@ dump_inline_summary (FILE *f, struct cgraph_node *node) struct inline_summary *s = inline_summary (node); size_time_entry *e; int i; - fprintf (f, "Inline summary for %s/%i", cgraph_node_name (node), + fprintf (f, "Inline summary for %s/%i", node->name (), node->order); if (DECL_DISREGARD_INLINE_LIMITS (node->decl)) fprintf (f, " always_inline"); @@ -2383,7 +2383,7 @@ estimate_function_body_sizes (struct cgraph_node *node, bool early) if (dump_file) fprintf (dump_file, "\nAnalyzing function body size: %s\n", - cgraph_node_name (node)); + node->name ()); /* When we run into maximal number of entries, we assign everything to the constant truth case. Be sure to have it in list. */ @@ -2990,7 +2990,7 @@ estimate_node_size_and_time (struct cgraph_node *node, { bool found = false; fprintf (dump_file, " Estimating body: %s/%i\n" - " Known to be false: ", cgraph_node_name (node), + " Known to be false: ", node->name (), node->order); for (i = predicate_not_inlined_condition; @@ -3772,7 +3772,7 @@ inline_analyze_function (struct cgraph_node *node) if (dump_file) fprintf (dump_file, "\nAnalyzing function: %s/%u\n", - cgraph_node_name (node), node->order); + node->name (), node->order); if (optimize && !node->thunk.thunk_p) inline_indirect_intraprocedural_analysis (node); compute_inline_parameters (node, false); |