1 files changed, 41 insertions, 8 deletions

diff --git a/backend/src/ir/structural_analysis.cpp b/backend/src/ir/structural_analysis.cpp
index 3210224c..cce3f6b1 100644
--- a/backend/src/ir/structural_analysis.cpp
+++ b/backend/src/ir/structural_analysis.cpp
@@ -59,20 +59,27 @@ namespace analysis
   }
   void ControlTree::handleSelfLoopNode(Node *loopnode, ir::LabelIndex& whileLabel)
   {
+              //NodeList::iterator child_iter = (*it)->children.begin();
     ir::BasicBlock *pbb = loopnode->getExit();
-    ir::BranchInstruction* pinsn = static_cast<ir::BranchInstruction *>(pbb->getLastInstruction());
-    ir::Register reg = pinsn->getPredicateIndex();
+    GBE_ASSERT(pbb->isLoopExit);
     ir::BasicBlock::iterator it = pbb->end();
     it--;
+    printf("block %d pbb %p node %p  node2 %p \n", pbb->getLabelIndex(), pbb, loopnode, bbmap[pbb]);
+    if (pbb->hasExtraBra) {
+      printf("has extra BRA\n");
+      it--;
+    }
+    ir::BranchInstruction* pinsn = static_cast<ir::BranchInstruction *>(&*it);
+    ir::Register reg = pinsn->getPredicateIndex();
     /* since this node is an while node, so we remove the BRA instruction at the bottom of the exit BB of 'node',
      * and insert WHILE instead
      */
-    pbb->erase(it);
     whileLabel = pinsn->getLabelIndex();
     ir::Instruction insn = ir::WHILE(whileLabel, reg);
     ir::Instruction* p_new_insn = pbb->getParent().newInstruction(insn);
-    pbb->append(*p_new_insn);
+    pbb->insertAt(it, *p_new_insn);
     pbb->whileLabel = whileLabel;
+    pbb->erase(it);
   }
 
   /* recursive mark the bbs' variable needEndif, the bbs all belong to node.*/
@@ -257,12 +264,21 @@ namespace analysis
     for(size_t i = 0; i < blocks.size(); ++i)
     {
       bbs[i] = blocks[i];
-      if(bbs[i]->getLastInstruction()->getOpcode() != ir::OP_BRA && i != blocks.size() - 1)
+      if(i != blocks.size() -1 &&
+         (bbs[i]->getLastInstruction()->getOpcode() != ir::OP_BRA ||
+         (bbs[i]->isStructureExit && bbs[i]->isLoopExit)))
       {
         ir::Instruction insn = ir::BRA(bbs[i]->getNextBlock()->getLabelIndex());
         ir::Instruction* pNewInsn = bbs[i]->getParent().newInstruction(insn);
         bbs[i]->append(*pNewInsn);
+        printf("%d isexit %d type %d %d\n", bbs[i]->getLabelIndex(), bbs[i]->isStructureExit, bbs[i]->isLoopExit);
+        if (bbs[i]->isStructureExit && bbs[i]->isLoopExit) {
+          printf("create block %d \n", bbs[i]->getLabelIndex());
+          fflush(stdout);
+          bbs[i]->hasExtraBra = true;
+        }
       }
+        printf("%d isexit %d type %d bpp %p\n", bbs[i]->getLabelIndex(), bbs[i]->isStructureExit, bbs[i]->isLoopExit, bbs[i]);
     }
 
     /* now, reorder the basic blocks to reduce the unconditional jump we inserted whose
@@ -337,6 +353,12 @@ namespace analysis
           it--;
 
           bbs[i]->erase(it);
+
+          if (bbs[i]->hasExtraBra) {
+            printf("erase block %d \n", bbs[i]->getLabelIndex());
+            fflush(stdout);
+            bbs[i]->hasExtraBra = false;
+          }
         }
       }
     }
@@ -384,9 +406,9 @@ namespace analysis
 
           case SelfLoop:
             {
-              NodeList::iterator child_iter = (*it)->children.begin();
               ir::LabelIndex whilelabel;
-              handleSelfLoopNode(*child_iter, whilelabel);
+              printf("node %p self loop children %p enxtry %p exit %p\n", *it, *(*it)->children.begin(), (*it)->getEntry(), (*it)->getExit());
+              handleSelfLoopNode(*it, whilelabel);
             }
             break;
 
@@ -739,6 +761,7 @@ namespace analysis
         iter++;
       }
 
+      printf("new blocks block %d %p  node %p\n", p->getEntry()->getLabelIndex(), p->getEntry(), p);
       return insertNode(p);
     }
 
@@ -765,6 +788,8 @@ namespace analysis
         if(node->canBeHandled == false || n->canBeHandled == false)
           p->canBeHandled = false;
 
+//        printf("new if then block %d %p  node %p block %d\n", p->getEntry()->getLabelIndex(), p->getEntry(), p, node->getEntry()->getLabelIndex());
+        printf("1 block %d \n", node->getEntry()->getLabelIndex());
         return insertNode(p);
       }
 
@@ -785,6 +810,7 @@ namespace analysis
         if(node->canBeHandled == false || m->canBeHandled == false)
           p->canBeHandled = false;
 
+        printf("2 block %d m %d n %d, m succ %d\n", node->getEntry()->getLabelIndex(), m->getEntry()->getLabelIndex(), n->getEntry()->getLabelIndex(), (*(m->succs().begin()))->getEntry()->getLabelIndex());
         return insertNode(p);
       }
 
@@ -806,6 +832,7 @@ namespace analysis
            n->canBeHandled == false)
           p->canBeHandled = false;
 
+        printf("3 block %d \n", node->getEntry()->getLabelIndex());
         return insertNode(p);
       }
 
@@ -826,6 +853,7 @@ namespace analysis
            m->canBeHandled == false ||
            n->canBeHandled == false)
           p->canBeHandled = false;
+        printf("4 block %d \n", node->getEntry()->getLabelIndex());
         return insertNode(p);
       }
     }
@@ -867,7 +895,12 @@ namespace analysis
       {
         Node* p = new SelfLoopNode(node);
 
-        p->canBeHandled = false;
+        node->getExit()->isLoopExit = true;
+        printf("loop node %p %d exit block %p \n", node, node->getExit()->getLabelIndex(), node->getExit());
+        if (node->getExit()->getLabelIndex() != 10 )
+          p->canBeHandled = false;
+        else
+          p->canBeHandled = true;
 
         return insertNode(p);
       }