projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
mark ebp output of leave as ignore
[libfirm]
/
ir
/
be
/
bespilldaemel.c
diff --git
a/ir/be/bespilldaemel.c
b/ir/be/bespilldaemel.c
index
bd7a7a5
..
047fab5
100644
(file)
--- a/
ir/be/bespilldaemel.c
+++ b/
ir/be/bespilldaemel.c
@@
-19,12
+19,12
@@
/**
* @file
/**
* @file
- * @brief Naiv spilling algorithm
+ * @brief Naiv
e
spilling algorithm
* @author Matthias Braun
* @date 20.09.2005
* @version $Id: bespillbelady.c 13913 2007-05-18 12:48:56Z matze $
* @summary
* @author Matthias Braun
* @date 20.09.2005
* @version $Id: bespillbelady.c 13913 2007-05-18 12:48:56Z matze $
* @summary
- * This implements a naiv
spilling algorithm. It is design
to produce similar
+ * This implements a naiv
e spilling algorithm. It is designed
to produce similar
* effects to the spill decisions produced by traditional graph coloring
* register allocators that spill while they are coloring the graph.
*
* effects to the spill decisions produced by traditional graph coloring
* register allocators that spill while they are coloring the graph.
*
@@
-33,9
+33,7
@@
* Spilling in this context means placing a spill instruction behind the
* definition of the value and a reload before each usage.
*/
* Spilling in this context means placing a spill instruction behind the
* definition of the value and a reload before each usage.
*/
-#ifdef HAVE_CONFIG_H
#include "config.h"
#include "config.h"
-#endif
#include "debug.h"
#include "debug.h"
@@
-187,7
+185,7
@@
static void do_spilling(ir_nodeset_t *live_nodes, ir_node *node)
return;
DBG((dbg, LEVEL_2, "\tspills needed after %+F: %d\n", node, spills_needed));
return;
DBG((dbg, LEVEL_2, "\tspills needed after %+F: %d\n", node, spills_needed));
- candidates =
alloca(n_live_nodes * sizeof(candidates[0])
);
+ candidates =
ALLOCAN(spill_candidate_t, n_live_nodes
);
/* construct array with spill candidates and calculate their costs */
i = 0;
/* construct array with spill candidates and calculate their costs */
i = 0;