X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeutil.h;h=122e217fc0238dcf9d40fad23c4dd01ccfdfffa6;hb=23b71abac8014aa6bfee3b47648fdb8fe8687b8f;hp=3c2c50e24531c3091bf97ca2cccd6bf3973c0125;hpb=9b060a71a2667ced8d103023eda0ff710e799867;p=libfirm diff --git a/ir/be/beutil.h b/ir/be/beutil.h index 3c2c50e24..122e217fc 100644 --- a/ir/be/beutil.h +++ b/ir/be/beutil.h @@ -2,14 +2,41 @@ #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 +/** + * Convenient block getter. + * Works also, if the given node is a block. + * @param irn The node. + * @return The block of the node, or the node itself, if the node is a + * block. + */ +static INLINE const ir_node *get_block(const ir_node *irn) +{ + return is_Block(irn) ? irn : get_nodes_block(irn); +} + +static INLINE int is_firm_be_mode(const ir_mode *mode) +{ + return mode_is_data(mode); +} + /** * Check, if a node produces or consumes a data value. * If it does, it is significant for scheduling and register allocation. @@ -23,13 +50,13 @@ static INLINE int is_data_node(const ir_node *irn) int i, n; /* If the node produces a data value, return immediately. */ - if(mode_is_datab(get_irn_mode(irn))) + if(is_firm_be_mode(get_irn_mode(irn))) return 1; /* else check, if it takes a data value, if that is so, return */ for(i = 0, n = get_irn_arity(irn); i < n; ++i) { ir_node *op = get_irn_n(irn, i); - if(mode_is_datab(get_irn_mode(op))) + if(is_firm_be_mode(get_irn_mode(op))) return 1; } @@ -37,7 +64,48 @@ static INLINE int is_data_node(const ir_node *irn) return 0; } +/** + * Make each constant local to its use. + * This duplicates all constants in order to simulate a realistic + * register pressure. + * @param irg The graph. + */ +void localize_consts(ir_graph *irg); + +/** + * Dump a vcg graph containing the controlflow graph, the schedule and + * allocated registers. + * @param irg The irg. Note that scheduling, register allocation must + * have been performed. + */ +void dump_allocated_irg(arch_env_t *env, ir_graph *irg, char *suffix); + +void be_clear_links(ir_graph *irg); + +static INLINE FILE *ffopen(const char *base, const char *ext, const char *mode) { + FILE *out; + char buf[1024]; + + snprintf(buf, sizeof(buf), "%s.%s", base, ext); + if (! (out = fopen(buf, mode))) { + fprintf(stderr, "Cannot open file %s in mode %s\n", buf, mode); + return NULL; + } + return out; +} -void dump_allocated_irg(ir_graph *irg); +/** + * Dump a graph with schedule edges. + * @param irg The graph. + * @param suffix A suffix to its file name. + */ +void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix); #endif + +/** + * 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);