projects
/
libfirm
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (from parent 1:
98b6f5c
)
removed comments
author
Götz Lindenmaier
<goetz@ipd.info.uni-karlsruhe.de>
Tue, 15 Jun 2004 15:37:40 +0000
(15:37 +0000)
committer
Götz Lindenmaier
<goetz@ipd.info.uni-karlsruhe.de>
Tue, 15 Jun 2004 15:37:40 +0000
(15:37 +0000)
[r3099]
ir/ir/ircons.c
patch
|
blob
|
history
diff --git
a/ir/ir/ircons.c
b/ir/ir/ircons.c
index
f42ed6e
..
661dec6
100644
(file)
--- a/
ir/ir/ircons.c
+++ b/
ir/ir/ircons.c
@@
-1479,25
+1479,16
@@
new_rd_Phi_in (ir_graph *irg, ir_node *block, ir_mode *mode,
Phi node merges the same definition on several paths and therefore
is not needed. Don't consider Bad nodes! */
known = res;
Phi node merges the same definition on several paths and therefore
is not needed. Don't consider Bad nodes! */
known = res;
- //DDMNB(res); // GL
- //if (phi0) DDMN(phi0); else printf(" phi0 == NULL\n");
-
for (i=0; i < ins; ++i)
{
assert(in[i]);
for (i=0; i < ins; ++i)
{
assert(in[i]);
- // GL
- //if (get_irn_op(in[i]) == op_Id)
- //{ printf(" "); DDMN(in[i]); }
-
in[i] = skip_Id(in[i]); /* increasses the number of freed Phis. */
/* Optimize self referencing Phis: We can't detect them yet properly, as
they still refer to the Phi0 they will replace. So replace right now. */
if (phi0 && in[i] == phi0) in[i] = res;
in[i] = skip_Id(in[i]); /* increasses the number of freed Phis. */
/* Optimize self referencing Phis: We can't detect them yet properly, as
they still refer to the Phi0 they will replace. So replace right now. */
if (phi0 && in[i] == phi0) in[i] = res;
- //{ printf(" "); DDMN(in[i]); } // GL
-
if (in[i]==res || in[i]==known || is_Bad(in[i])) continue;
if (known==res)
if (in[i]==res || in[i]==known || is_Bad(in[i])) continue;
if (known==res)
@@
-1508,14
+1499,13
@@
new_rd_Phi_in (ir_graph *irg, ir_node *block, ir_mode *mode,
/* i==ins: there is at most one predecessor, we don't need a phi node. */
if (i == ins) {
/* i==ins: there is at most one predecessor, we don't need a phi node. */
if (i == ins) {
- //printf(" removing Phi node\n"); // GL
if (res != known) {
obstack_free (current_ir_graph->obst, res);
if (is_Phi(known)) {
/* If pred is a phi node we want to optmize it: If loops are matured in a bad
order, an enclosing Phi know may get superfluous. */
res = optimize_in_place_2(known);
if (res != known) {
obstack_free (current_ir_graph->obst, res);
if (is_Phi(known)) {
/* If pred is a phi node we want to optmize it: If loops are matured in a bad
order, an enclosing Phi know may get superfluous. */
res = optimize_in_place_2(known);
- if (res != known) {
/* printf("found better pred "); DDMN(res); GL */
exchange(known, res); }
+ if (res != known) { exchange(known, res); }
} else {
res = known;
}
} else {
res = known;
}
@@
-1524,10
+1514,7
@@
new_rd_Phi_in (ir_graph *irg, ir_node *block, ir_mode *mode,
res = new_Bad();
}
} else {
res = new_Bad();
}
} else {
- // GL ir_node *old = res;
- // GL dump_node (res);
res = optimize_node (res); /* This is necessary to add the node to the hash table for cse. */
res = optimize_node (res); /* This is necessary to add the node to the hash table for cse. */
- // GL if (res != old) { printf("optimize not useless!!! \n"); assert(0); }
irn_vrfy_irg (res, irg);
/* Memory Phis in endless loops must be kept alive.
As we can't distinguish these easily we keep all of them alive. */
irn_vrfy_irg (res, irg);
/* Memory Phis in endless loops must be kept alive.
As we can't distinguish these easily we keep all of them alive. */
@@
-1845,8
+1832,6
@@
mature_block (ir_node *block)
ir_node *n, **nin;
ir_node *next;
ir_node *n, **nin;
ir_node *next;
- //DDMN(block); // GL
-
assert (get_irn_opcode(block) == iro_Block);
/* @@@ should be commented in
assert (!get_Block_matured(block) && "Block already matured"); */
assert (get_irn_opcode(block) == iro_Block);
/* @@@ should be commented in
assert (!get_Block_matured(block) && "Block already matured"); */