projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Do not mark the transformed as visited. It makes no sense at all.
[libfirm]
/
ir
/
be
/
beifg.c
diff --git
a/ir/be/beifg.c
b/ir/be/beifg.c
index
8aec249
..
1827de1
100644
(file)
--- a/
ir/be/beifg.c
+++ b/
ir/be/beifg.c
@@
-30,8
+30,8
@@
#include <stdlib.h>
#include <stdlib.h>
-#include
<libcore/lc_opts.h>
-#include
<libcore/lc_opts_enum.h>
+#include
"lc_opts.h"
+#include
"lc_opts_enum.h"
#include "timing.h"
#include "bitset.h"
#include "timing.h"
#include "bitset.h"
@@
-184,7
+184,7
@@
int be_ifg_is_simplicial(const be_ifg_t *ifg, const ir_node *irn)
int degree = be_ifg_degree(ifg, irn);
void *iter = be_ifg_neighbours_iter_alloca(ifg);
int degree = be_ifg_degree(ifg, irn);
void *iter = be_ifg_neighbours_iter_alloca(ifg);
- ir_node **neighbours =
xmalloc(degree * sizeof(neighbours[0])
);
+ ir_node **neighbours =
XMALLOCN(ir_node*, degree
);
ir_node *curr;
int i, j;
ir_node *curr;
int i, j;
@@
-276,7
+276,7
@@
void be_ifg_check_sorted(const be_ifg_t *ifg)
const int node_count = be_ifg_check_get_node_count(ifg);
int i = 0;
const int node_count = be_ifg_check_get_node_count(ifg);
int i = 0;
- ir_node **all_nodes =
xmalloc(node_count * sizeof(all_nodes[0])
);
+ ir_node **all_nodes =
XMALLOCN(ir_node*, node_count
);
be_ifg_foreach_node(ifg, iter1, n)
{
be_ifg_foreach_node(ifg, iter1, n)
{
@@
-294,7
+294,7
@@
void be_ifg_check_sorted(const be_ifg_t *ifg)
for (i = 0; i < node_count; i++)
{
for (i = 0; i < node_count; i++)
{
- ir_node **neighbours =
xmalloc(node_count * sizeof(neighbours[0])
);
+ ir_node **neighbours =
XMALLOCN(ir_node*, node_count
);
int j = 0;
int k = 0;
int degree = 0;
int j = 0;
int k = 0;
int degree = 0;
@@
-334,7
+334,7
@@
void be_ifg_check_sorted_to_file(const be_ifg_t *ifg, FILE *f)
const int node_count = be_ifg_check_get_node_count(ifg);
int i = 0;
const int node_count = be_ifg_check_get_node_count(ifg);
int i = 0;
- ir_node **all_nodes =
xmalloc(node_count * sizeof(all_nodes[0])
);
+ ir_node **all_nodes =
XMALLOCN(ir_node*, node_count
);
be_ifg_foreach_node(ifg, iter1, n)
{
be_ifg_foreach_node(ifg, iter1, n)
{
@@
-352,7
+352,7
@@
void be_ifg_check_sorted_to_file(const be_ifg_t *ifg, FILE *f)
for (i = 0; i < node_count; i++)
{
for (i = 0; i < node_count; i++)
{
- ir_node **neighbours =
xmalloc(node_count * sizeof(neighbours[0])
);
+ ir_node **neighbours =
XMALLOCN(ir_node*, node_count
);
int j = 0;
int k = 0;
int degree = 0;
int j = 0;
int k = 0;
int degree = 0;