2 * Author: Daniel Grund, Sebastian Hack, Matthias Braun
4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
10 #include "firm_types.h"
15 #include "bechordal.h"
20 typedef struct _spill_env_t spill_env_t;
23 * Creates a new spill environment.
25 spill_env_t *be_new_spill_env(const be_chordal_env_t *chordal);
28 * Deletes a spill environment.
30 void be_delete_spill_env(spill_env_t *senv);
33 * Sets the debug module of a spill environment.
35 DEBUG_ONLY(void be_set_spill_env_dbg_module(spill_env_t *env, firm_dbg_module_t *dbg));
38 * Inserts a new entry into the list of reloads to place (the real nodes will
39 * be created when be_insert_spills_reloads is run). You don't have to
40 * explicitely create spill nodes, they will be created automatically after
41 * the definition of a value as soon as a reload is created. (we should add a
42 * possibility for explicit spill placement in the future)
44 void be_add_reload(spill_env_t *senv, ir_node *to_spill, ir_node *before);
47 * Analog to be_add_reload, but places the reload "on an edge" between 2 blocks
49 void be_add_reload_on_edge(spill_env_t *senv, ir_node *to_spill, ir_node *bl, int pos);
52 * The main function that places real spills/reloads (or rematerializes values)
53 * for all values where be_add_reload was called. It then rebuilds the
54 * SSA-form and updates liveness information
56 void be_insert_spills_reloads(spill_env_t *senv);
59 * There are 2 possibilities to spill a phi node: Only it's value, or replacing
60 * the whole phi-node with a memory phi. Normally only the value of a phi will
61 * be spilled unless you mark the phi with be_spill_phi.
62 * (Remember that each phi needs a register, so you have to spill phis when
63 * there are more phis than registers in a block)
65 void be_spill_phi(spill_env_t *env, ir_node *node);
68 * Returns the estimated costs if a node would get reloaded at a specific place
69 * This usually returns the cost of spill + reload operation. But might return
70 * smaller values if the value has already been spilled in a former run or
71 * when it is possible to rematerialize the value.
73 int be_get_reload_costs(spill_env_t *env, ir_node *to_spill, ir_node *before);
76 * Analog to be_get_reload_costs but returns the cost if the reload would be
77 * placed "on an edge" between 2 blocks
79 int be_get_reload_costs_on_edge(spill_env_t *env, ir_node *to_spill, ir_node *block, int pos);