KJ16609/gcc
1
0
Fork 0
mirror of https://gcc.gnu.org/git/gcc.git synced 2026-02-22 03:46:53 -05:00
Code Issues Packages Projects Releases Wiki Activity

ipa-inline.c (cgraph_flatten_node): Replace leafify with flatten.

Browse Source 
2006-12-13  Richard Guenther  <rguenther@suse.de>

	* ipa-inline.c (cgraph_flatten_node): Replace leafify with
	flatten.
	(cgraph_decide_inlining): Likewise.

From-SVN: r119828
This commit is contained in:
Richard Guenther
2006-12-13 12:17:52 +00:00
committed by Richard Biener
parent 4120939fdd
commit 33fce0d1c2
2 changed files with 8 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
gcc/ChangeLog
View File

@@ -1,3 +1,9 @@
2006-12-13 Richard Guenther <rguenther@suse.de>
* ipa-inline.c (cgraph_flatten_node): Replace leafify with
flatten.
(cgraph_decide_inlining): Likewise.
2006-12-13 Richard Guenther <rguenther@suse.de>
* ipa-reference.c (scan_for_static_refs): Also scan

4
gcc/ipa-inline.c
View File

@@ -536,7 +536,7 @@ cgraph_find_cycles (struct cgraph_node *node, htab_t cycles)
node->aux = 0;
}
/* Leafify the cgraph node. We have to be careful in recursing
/* Flatten the cgraph node. We have to be careful in recursing
as to not run endlessly in circles of the callgraph.
We do so by using a hashtab of cycle entering nodes as generated
by cgraph_find_cycles. */
@@ -961,7 +961,7 @@ cgraph_decide_inlining (void)
htab_t cycles;
if (dump_file)
fprintf (dump_file,
"Leafifying %s\n", cgraph_node_name (node));
"Flattening %s\n", cgraph_node_name (node));
cycles = htab_create (7, htab_hash_pointer, htab_eq_pointer, NULL);
cgraph_find_cycles (node, cycles);
cgraph_flatten_node (node, cycles);