2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief higher level abstraction for the creation of spill and reload
23 * instructions and rematerialisation of values.
24 * @author Daniel Grund, Sebastian Hack, Matthias Braun
28 #ifndef FIRM_BE_BESPILL_H
29 #define FIRM_BE_BESPILL_H
31 #include "firm_types.h"
37 typedef struct spill_env_t spill_env_t;
40 * Creates a new spill environment.
42 spill_env_t *be_new_spill_env(be_irg_t *birg);
45 * Deletes a spill environment.
47 void be_delete_spill_env(spill_env_t *senv);
50 * Inserts a new entry into the list of reloads to place (the real nodes will
51 * be created when be_insert_spills_reloads is run). You don't have to
52 * explicitly create spill nodes, they will be created automatically after
53 * the definition of a value as soon as a reload is created. (we should add a
54 * possibility for explicit spill placement in the future)
56 * @param senv The spill environment
57 * @param to_spill The node which is about to be spilled
58 * @param before The node before the reload should be added
59 * @param reload_cls The register class the reloaded value will be put into
60 * @param allow_remat Set to 1 if the node may be rematerialized instead of
63 void be_add_reload(spill_env_t *senv, ir_node *to_spill, ir_node *before,
64 const arch_register_class_t *reload_cls, int allow_remat);
67 * Analog to be_add_reload, but places the reload "on an edge" between 2 blocks
70 void be_add_reload_on_edge(spill_env_t *senv, ir_node *to_spill, ir_node *bl,
71 int pos, const arch_register_class_t *reload_cls,
75 * Analog to be_add_reload but adds an already created rematerialized node.
77 void be_add_remat(spill_env_t *env, ir_node *to_spill, ir_node *before,
78 ir_node *rematted_node);
81 * The main function that places real spills/reloads (or rematerializes values)
82 * for all values where be_add_reload was called. It then rebuilds the
83 * SSA-form and updates liveness information
85 void be_insert_spills_reloads(spill_env_t *senv);
88 * There are 2 possibilities to spill a phi node: Only it's value, or replacing
89 * the whole phi-node with a memory phi. Normally only the value of a phi will
90 * be spilled unless you mark the phi with be_spill_phi.
91 * (Remember that each phi needs a register, so you have to spill phis when
92 * there are more phis than registers in a block)
94 void be_spill_phi(spill_env_t *env, ir_node *node);
97 * Returns the estimated costs if a node would ge spilled. This does only return
98 * the costs for the spill instructions, not the costs for needed reload
99 * instructions. The value is weighted by the estimated execution frequency of
102 double be_get_spill_costs(spill_env_t *env, ir_node *to_spill, ir_node *after);
105 * Returns the estimated costs if a node would get reloaded at a specific place
106 * This returns the costs for a reload instructions, or when possible the costs
107 * for a rematerialisation. The value is weighted by the estimated execution
108 * frequency of the reload/rematerialisation.
110 double be_get_reload_costs(spill_env_t *env, ir_node *to_spill,
114 * Analog to be_get_reload_costs but returns the cost if the reload would be
115 * placed "on an edge" between 2 blocks
117 double be_get_reload_costs_on_edge(spill_env_t *env, ir_node *to_spill,
118 ir_node *block, int pos);