path: root/ir/be/beutil.h
diff options
authorMatthias Braun <>2006-05-24 17:14:20 +0200
committerMatthias Braun <>2006-05-24 17:14:20 +0200
commitf436f72951577e35b60e0ea1f2e6a536e4f479bb (patch)
treeccfa900bc12523c2baf4c608961fc91c8faee77d /ir/be/beutil.h
parent0c181825abe1b8159395736509bb702fa68339e6 (diff)
Initial commit of morgans spilling algorithm (spill unused values that live through
blocks or loops). Other small changes: * Added some verify functions that check for register pressure or valid schedules (replaces the broken check_pressure in bechordal_main.c) * Some style/readability improvements to the belady spill code * Some style/readability improvements to beuses.* * Fixed registerpressure stat dumper * Some improvements to bespill.c: When spilling already reloaded values, don't add a 2nd spill.
Diffstat (limited to 'ir/be/beutil.h')
1 files changed, 2 insertions, 3 deletions
diff --git a/ir/be/beutil.h b/ir/be/beutil.h
index c11eac3..d1b1eb0 100644
--- a/ir/be/beutil.h
+++ b/ir/be/beutil.h
@@ -116,12 +116,11 @@ void dump_ir_extblock_graph_sched(ir_graph *irg, const char *suffix);
void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const char *));
-#endif /* _BEUTIL_H */
* Search for an irn in @p accept.
* The search is started at @p start_point_exclusive and continues upwards the dom-tree
* @return The first node out of accept if found. Else NULL is returned.
ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive);
+#endif /* _BEUTIL_H */