From 63974fdd8a92fe76481fcf4f71379c832ed72121 Mon Sep 17 00:00:00 2001
From: Teddy <ted.sybil@gmail.com>
Date: Sun, 4 May 2014 21:31:03 +0800
Subject: remove redundant code

---
 mips.c | 15 ++-------------
 ssa.c  | 52 ----------------------------------------------------
 2 files changed, 2 insertions(+), 65 deletions(-)

diff --git a/mips.c b/mips.c
index 2ccbb3d..4c23ecc 100644
--- a/mips.c
+++ b/mips.c
@@ -446,14 +446,6 @@ void mips_generate() {
                         CType_t type = i->src1->type;
                         if (type && (type->type == CSTRUCT || type->type == CUNION))
                         {
-                            /*
-                            printf("\tsw $%d, 4($sp)\n", rs);
-                            printf("\taddiu $%d, $sp, %d\n", reg_v0, i->offset);
-                            printf("\tsw $%d, 0($sp)\n", reg_v0);
-                            printf("\tli $%d, %d\n", reg_v0, calc_size(type));
-                            printf("\tsw $%d, 8($sp)\n", reg_v0);
-                            printf("\tjal _func_memcpy\n");
-                            */
                             printf("\taddiu $%d, $sp, %d\n", reg_v1, i->offset);
                             printf("\tmove $%d, $%d\n", reg_v0, rs);
                             printf("\tli $a0, %d\n", calc_size(type));
@@ -515,7 +507,8 @@ void mips_generate() {
                             {
                                 if (rd == -1) 
                                     rd = mips_to_reg(i->dest, reg_v1);
-                                printf("\tmove $%d, $%d\n", reg_v1, rd);
+                                if (reg_v1 != rd)
+                                    printf("\tmove $%d, $%d\n", reg_v1, rd);
                                 printf("\tli $a0, %d\n", calc_size(i->dest->type));
                                 mips_memcpy();
                             }
@@ -523,10 +516,6 @@ void mips_generate() {
                             {
                                 if (rd != -1) 
                                     printf("\tmove $%d, $%d\n", rd, reg_v0);
-                                /*
-                                else
-                                    rd = reg_v0;
-                                    */
                                 if (i->dest->reg == -1 || i->dest->kind == VAR)
                                     mips_store(reg_v0, i->dest);
                             }
diff --git a/ssa.c b/ssa.c
index 81f3f2b..85b27bd 100644
--- a/ssa.c
+++ b/ssa.c
@@ -1459,15 +1459,6 @@ void calc_dominant_frontier() {
         }
     for (i = 1; i < bcnt; i++)
         dtree_add_edge(blks[ord[dom[vis[i]]]], blks[i]);
-    /*
-    for (i = 0; i < bcnt; i++)
-    {
-        CBList_t p = df[i];
-        printf("%d: ", i);
-        for (; p; p = p->next)
-            printf("%d ", p->cblk->id); puts("");
-    }
-    */
 }
 
 void insert_phi(CVList_t vars) {
@@ -1731,44 +1722,9 @@ void add_range(COpr_t opr, CBlock_t blk, int end) {
         begin = blk->first;
     add_range_(opr, begin, end);
 }
-/*
-int low[MAX_BLOCK], dfn[MAX_BLOCK], dcnt;
-int loop_tail[MAX_BLOCK];
-*/
-
-/*
-void find_loop_tail(CBlock_t u) {
-    CEdge *e;
-    low[u->id] = bcnt;
-    dfn[u->id] = dcnt++;
-    for (e = cfg.head[u->id]; e; e = e->next)
-    {
-        CBlock_t v = e->to;
-        if (dfn[v->id] == -1)
-        {
-            find_loop_tail(v);
-            if (low[v->id] < dfn[u->id] && low[v->id] < low[u->id])
-            {
-                low[u->id] = low[v->id];
-                loop_tail[u->id] = loop_tail[v->id];
-            }
-        }
-        else if (dfn[v->id] < dfn[u->id] && dfn[v->id] < low[u->id])
-        {
-            low[u->id] = dfn[v->id];
-            loop_tail[u->id] = u->id;
-        }
-    }
-}
-*/
 
 void build_intervals() {
     int i;
-    /*
-    dcnt = 0;
-    memset(dfn, -1, sizeof dfn);
-    find_loop_tail(entry);
-    */
     for (i = 0; i < bcnt; i++)
         liveset[i] = cpset_create();
     for (i = 0; i < bcnt; i++)
@@ -1861,15 +1817,7 @@ void build_intervals() {
             COList_t p;
             for (p = live[id]; p; p = p->next) 
                 if (cpset_belongs(curlive, (long)p->opr))
-                {
-                    /*
-                    int j;
-                    for (j = loop_tail[id]; j != id; j = par[j])
-                        add_range_(p->opr, blks[j]->first, blks[j]->last + 1);
-                    add_range_(p->opr, b->first, b->last + 1);
-                    */
                     add_range_(p->opr, b->first, blks[loop_tail[id]]->last + 1);
-                }
         }
     }
     for (i = 0; i < bcnt; i++)
-- 
cgit v1.2.3