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);
49 ir_node *be_get_end_of_block_insertion_point(const ir_node *block);
52 * marks a point until which a node must be spilled
54 void be_add_spill(spill_env_t *senv, ir_node *to_spill, ir_node *before);
57 * Inserts a new entry into the list of reloads to place (the real nodes will
58 * be created when be_insert_spills_reloads is run). You don't have to
59 * explicitly create spill nodes, they will be created automatically after
60 * the definition of a value as soon as a reload is created. (we should add a
61 * possibility for explicit spill placement in the future)
63 * @param senv The spill environment
64 * @param to_spill The node which is about to be spilled
65 * @param before The node before the reload should be added
66 * @param reload_cls The register class the reloaded value will be put into
67 * @param allow_remat Set to 1 if the node may be rematerialized instead of
70 void be_add_reload(spill_env_t *senv, ir_node *to_spill, ir_node *before,
71 const arch_register_class_t *reload_cls, int allow_remat);
73 void be_add_reload2(spill_env_t *senv, ir_node *to_spill, ir_node *before, ir_node *can_spill_after,
74 const arch_register_class_t *reload_cls, int allow_remat);
77 * Add a reload at the end of a block.
78 * Similar to be_add_reload_on_edge().
80 void be_add_reload_at_end(spill_env_t *env, ir_node *to_spill, const ir_node *block,
81 const arch_register_class_t *reload_cls,
85 * Analog to be_add_reload, but places the reload "on an edge" between 2 blocks
88 void be_add_reload_on_edge(spill_env_t *senv, ir_node *to_spill, ir_node *bl,
89 int pos, const arch_register_class_t *reload_cls,
93 * Analog to be_add_reload but adds an already created rematerialized node.
95 void be_add_remat(spill_env_t *env, ir_node *to_spill, ir_node *before,
96 ir_node *rematted_node);
99 * The main function that places real spills/reloads (or rematerializes values)
100 * for all values where be_add_reload was called. It then rebuilds the
101 * SSA-form and updates liveness information
103 void be_insert_spills_reloads(spill_env_t *senv);
106 * There are 2 possibilities to spill a phi node: Only it's value, or replacing
107 * the whole phi-node with a memory phi. Normally only the value of a phi will
108 * be spilled unless you mark the phi with be_spill_phi.
109 * (Remember that each phi needs a register, so you have to spill phis when
110 * there are more phis than registers in a block)
112 void be_spill_phi(spill_env_t *env, ir_node *node);
115 * Returns the estimated costs if a node would ge spilled. This does only return
116 * the costs for the spill instructions, not the costs for needed reload
117 * instructions. The value is weighted by the estimated execution frequency of
120 double be_get_spill_costs(spill_env_t *env, ir_node *to_spill, ir_node *before);
123 * Returns the estimated costs if a node would get reloaded at a specific place
124 * This returns the costs for a reload instructions, or when possible the costs
125 * for a rematerialisation. The value is weighted by the estimated execution
126 * frequency of the reload/rematerialisation.
128 double be_get_reload_costs(spill_env_t *env, ir_node *to_spill,
131 unsigned be_get_reload_costs_no_weight(spill_env_t *env, const ir_node *to_spill,
132 const ir_node *before);
136 * Analog to be_get_reload_costs but returns the cost if the reload would be
137 * placed "on an edge" between 2 blocks
139 double be_get_reload_costs_on_edge(spill_env_t *env, ir_node *to_spill,
140 ir_node *block, int pos);
147 } be_total_spill_costs_t;
150 * Collect spill/reload cost statistics for a graph.
151 * @param birg The backend graph.
152 * @param costs A struct which will be filled with the costs.
154 void be_get_total_spill_costs(be_irg_t *birg, be_total_spill_costs_t *costs);
157 * Check, if a node is rematerializable.
158 * @param env The spill env.
161 int be_is_rematerializable(spill_env_t *env, const ir_node *to_remat, const ir_node *before);