X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbespill.h;h=018f52f1e3d94024598b596691ca44ba5c354e43;hb=93da909d12b7bec51aa36ee5f05966c331f90fb9;hp=e53ff0ac1bff5d1d7ccce1523f9d7a24e4b5f3f8;hpb=ae515d01cd46334273438ce4019847f4ba05ab3d;p=libfirm diff --git a/ir/be/bespill.h b/ir/be/bespill.h index e53ff0ac1..018f52f1e 100644 --- a/ir/be/bespill.h +++ b/ir/be/bespill.h @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -19,7 +19,8 @@ /** * @file - * @brief Main spill driver. + * @brief higher level abstraction for the creation of spill and reload + * instructions and rematerialisation of values. * @author Daniel Grund, Sebastian Hack, Matthias Braun * @date 29.09.2005 * @version $Id$ @@ -45,6 +46,16 @@ spill_env_t *be_new_spill_env(be_irg_t *birg); */ void be_delete_spill_env(spill_env_t *senv); +/** + * Return the last control flow node of a block. + */ +ir_node *be_get_end_of_block_insertion_point(const ir_node *block); + +/** + * Marks a point until which a node must be spilled. + */ +void be_add_spill(spill_env_t *senv, ir_node *to_spill, ir_node *after); + /** * Inserts a new entry into the list of reloads to place (the real nodes will * be created when be_insert_spills_reloads is run). You don't have to @@ -56,22 +67,36 @@ void be_delete_spill_env(spill_env_t *senv); * @param to_spill The node which is about to be spilled * @param before The node before the reload should be added * @param reload_cls The register class the reloaded value will be put into - * @param allow_remat Set to 1 if the node may be rematerialized instead of reloaded + * @param allow_remat Set to 1 if the node may be rematerialized instead of + * reloaded */ void be_add_reload(spill_env_t *senv, ir_node *to_spill, ir_node *before, - const arch_register_class_t *reload_cls, int allow_remat); + const arch_register_class_t *reload_cls, int allow_remat); + +void be_add_reload2(spill_env_t *senv, ir_node *to_spill, ir_node *before, ir_node *can_spill_after, + const arch_register_class_t *reload_cls, int allow_remat); + +/** + * Add a reload at the end of a block. + * Similar to be_add_reload_on_edge(). + */ +void be_add_reload_at_end(spill_env_t *env, ir_node *to_spill, const ir_node *block, + const arch_register_class_t *reload_cls, + int allow_remat); /** * Analog to be_add_reload, but places the reload "on an edge" between 2 blocks * @see be_add_reload */ -void be_add_reload_on_edge(spill_env_t *senv, ir_node *to_spill, ir_node *bl, int pos, - const arch_register_class_t *reload_cls, int allow_remat); +void be_add_reload_on_edge(spill_env_t *senv, ir_node *to_spill, ir_node *bl, + int pos, const arch_register_class_t *reload_cls, + int allow_remat); /** * Analog to be_add_reload but adds an already created rematerialized node. */ -void be_add_remat(spill_env_t *env, ir_node *to_spill, ir_node *before, ir_node *rematted_node); +void be_add_remat(spill_env_t *env, ir_node *to_spill, ir_node *before, + ir_node *rematted_node); /** * The main function that places real spills/reloads (or rematerializes values) @@ -89,18 +114,62 @@ void be_insert_spills_reloads(spill_env_t *senv); */ void be_spill_phi(spill_env_t *env, ir_node *node); +/** + * Returns the estimated costs if a node would ge spilled. This does only return + * the costs for the spill instructions, not the costs for needed reload + * instructions. The value is weighted by the estimated execution frequency of + * the spill. + */ +double be_get_spill_costs(spill_env_t *env, ir_node *to_spill, ir_node *before); + /** * Returns the estimated costs if a node would get reloaded at a specific place - * This usually returns the cost of spill + reload operation. But might return - * smaller values if the value has already been spilled in a former run or - * when it is possible to rematerialize the value. + * This returns the costs for a reload instructions, or when possible the costs + * for a rematerialisation. The value is weighted by the estimated execution + * frequency of the reload/rematerialisation. */ -int be_get_reload_costs(spill_env_t *env, ir_node *to_spill, ir_node *before); +double be_get_reload_costs(spill_env_t *env, ir_node *to_spill, + ir_node *before); + +unsigned be_get_reload_costs_no_weight(spill_env_t *env, const ir_node *to_spill, + const ir_node *before); + /** * Analog to be_get_reload_costs but returns the cost if the reload would be * placed "on an edge" between 2 blocks */ -int be_get_reload_costs_on_edge(spill_env_t *env, ir_node *to_spill, ir_node *block, int pos); +double be_get_reload_costs_on_edge(spill_env_t *env, ir_node *to_spill, + ir_node *block, int pos); + +typedef struct { + unsigned n_spills; + unsigned n_reloads; + double spill_costs; + double reload_costs; +} be_total_spill_costs_t; + +/** + * Insert a spill after the definition of the given node if there is a reload that is not dominated by some spill. + * This function checks whether there is a reload that is not dominated by some spill for that node. + * If so, it inserts a spill right after the definition of the node. + * @param env The spill environment. + * @param irn The node to check for. + */ +void make_spill_locations_dominate_irn(spill_env_t *env, ir_node *irn); + +/** + * Collect spill/reload cost statistics for a graph. + * @param birg The backend graph. + * @param costs A struct which will be filled with the costs. + */ +void be_get_total_spill_costs(be_irg_t *birg, be_total_spill_costs_t *costs); + +/** + * Check, if a node is rematerializable. + * @param env The spill env. + + */ +int be_is_rematerializable(spill_env_t *env, const ir_node *to_remat, const ir_node *before); -#endif /* FIRM_BE_BESPILL_H */ +#endif