projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Turn alloca() with fixed size into array.
[libfirm]
/
ir
/
be
/
becopyilp2.c
diff --git
a/ir/be/becopyilp2.c
b/ir/be/becopyilp2.c
index
8344b49
..
768e47d
100644
(file)
--- a/
ir/be/becopyilp2.c
+++ b/
ir/be/becopyilp2.c
@@
-44,9
+44,7
@@
*
* x_nc, y_ij \in N, w_ij \in R^+
*/
*
* x_nc, y_ij \in N, w_ij \in R^+
*/
-#ifdef HAVE_CONFIG_H
#include "config.h"
#include "config.h"
-#endif /* HAVE_CONFIG_H */
#ifdef WITH_ILP
#ifdef WITH_ILP
@@
-91,7
+89,7
@@
static void build_coloring_cstr(ilp_env_t *ienv) {
pmap_insert(lenv->nr_2_irn, INT_TO_PTR(node_nr), irn);
pmap_insert(lenv->nr_2_irn, INT_TO_PTR(node_nr), irn);
- req = arch_get_register_req
(irn, -1
);
+ req = arch_get_register_req
_out(irn
);
bitset_clear_all(colors);
bitset_clear_all(colors);
@@
-230,7
+228,7
@@
static int compare_edge_t(const void *k1, const void *k2, size_t size) {
#define HASH_EDGE(e) (hash_irn((e)->n1) ^ hash_irn((e)->n2))
#define HASH_EDGE(e) (hash_irn((e)->n1) ^ hash_irn((e)->n2))
-static
INLINE
edge_t *add_edge(set *edges, ir_node *n1, ir_node *n2, int *counter) {
+static
inline
edge_t *add_edge(set *edges, ir_node *n1, ir_node *n2, int *counter) {
edge_t new_edge;
if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) {
edge_t new_edge;
if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) {
@@
-244,7
+242,7
@@
static INLINE edge_t *add_edge(set *edges, ir_node *n1, ir_node *n2, int *counte
return set_insert(edges, &new_edge, sizeof(new_edge), HASH_EDGE(&new_edge));
}
return set_insert(edges, &new_edge, sizeof(new_edge), HASH_EDGE(&new_edge));
}
-static
INLINE
edge_t *find_edge(set *edges, ir_node *n1, ir_node *n2) {
+static
inline
edge_t *find_edge(set *edges, ir_node *n1, ir_node *n2) {
edge_t new_edge;
if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) {
edge_t new_edge;
if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) {
@@
-257,7
+255,7
@@
static INLINE edge_t *find_edge(set *edges, ir_node *n1, ir_node *n2) {
return set_find(edges, &new_edge, sizeof(new_edge), HASH_EDGE(&new_edge));
}
return set_find(edges, &new_edge, sizeof(new_edge), HASH_EDGE(&new_edge));
}
-static
INLINE
void remove_edge(set *edges, ir_node *n1, ir_node *n2, int *counter) {
+static
inline
void remove_edge(set *edges, ir_node *n1, ir_node *n2, int *counter) {
edge_t new_edge, *e;
if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) {
edge_t new_edge, *e;
if (PTR_TO_INT(n1) < PTR_TO_INT(n2)) {
@@
-571,7
+569,7
@@
int co_solve_ilp2(copy_opt_t *co) {
#else /* WITH_ILP */
#else /* WITH_ILP */
-static
INLINE
void only_that_you_can_compile_without_WITH_ILP_defined(void) {
+static
inline
void only_that_you_can_compile_without_WITH_ILP_defined(void) {
}
#endif /* WITH_ILP */
}
#endif /* WITH_ILP */