X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.h;h=cc6e60b62efc8d731683648b27f4f50aff730cf2;hb=4ed245f5007168dab7850942a7ee6b6b29a19817;hp=d37632b8184274681450b93fa951a09ad8c55e41;hpb=475a94b1f36bf3ecde85816177315729dcb6b3fc;p=libfirm diff --git a/ir/be/beutil.h b/ir/be/beutil.h index d37632b81..cc6e60b62 100644 --- a/ir/be/beutil.h +++ b/ir/be/beutil.h @@ -2,13 +2,21 @@ #ifndef _BEUTIL_H #define _BEUTIL_H +#include "firm_config.h" + #include +#include "pset.h" #include "irnode.h" -#include "config.h" - #include "bearch.h" +/** + * Get an empty set. + * This function always returns the same set. + */ +pset *be_empty_set(void); + + /** Undefine this to disable debugging mode. */ #define BE_DEBUG 1 @@ -21,12 +29,12 @@ */ static INLINE const ir_node *get_block(const ir_node *irn) { - return is_Block(irn) ? irn : get_nodes_block(irn); + return is_Block(irn) ? irn : get_nodes_block(irn); } static INLINE int is_firm_be_mode(const ir_mode *mode) { - return mode_is_datab(mode); + return mode_is_data(mode); } /** @@ -79,6 +87,7 @@ static INLINE FILE *ffopen(const char *base, const char *ext, const char *mode) char buf[1024]; snprintf(buf, sizeof(buf), "%s.%s", base, ext); + buf[sizeof(buf) - 1] = '\0'; if (! (out = fopen(buf, mode))) { fprintf(stderr, "Cannot open file %s in mode %s\n", buf, mode); return NULL; @@ -93,4 +102,33 @@ static INLINE FILE *ffopen(const char *base, const char *ext, const char *mode) */ void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix); -#endif +/** + * Dump a extended block graph with schedule edges. + * @param irg The graph. + * @param suffix A suffix to its file name. + */ +void dump_ir_extblock_graph_sched(ir_graph *irg, const char *suffix); + +/** + * Dumps a graph and numbers all dumps. + * @param irg The graph + * @param suffix A suffix to its file name. + * @param dumper The dump function + */ +void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const char *)); + +/** + * Returns the number of reachable nodes in an irg. + * @param irg The irg. + * @return The number of reachable nodes. + */ +unsigned get_num_reachable_nodes(ir_graph *irg); + +/** + * 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 */