From d116d7b7473af856fbf5f0195f5130b98c16cdc7 Mon Sep 17 00:00:00 2001
From: jochen <jochen@379699f6-c40d-0410-875b-85095c16579e>
Date: Sat, 6 Mar 1999 21:40:59 +0000
Subject: [PATCH] mapStackToLocal / removePush added remove cases that jump to
 default

git-svn-id: https://svn.code.sf.net/p/jode/code/trunk@317 379699f6-c40d-0410-875b-85095c16579e
---
 jode/jode/flow/SwitchBlock.java | 75 ++++++++++++++++++++++++++++-----
 1 file changed, 65 insertions(+), 10 deletions(-)

diff --git a/jode/jode/flow/SwitchBlock.java b/jode/jode/flow/SwitchBlock.java
index 439b2d7..81e26c4 100644
--- a/jode/jode/flow/SwitchBlock.java
+++ b/jode/jode/flow/SwitchBlock.java
@@ -27,14 +27,26 @@ import jode.expr.Expression;
 public class SwitchBlock extends InstructionContainer 
 implements BreakableBlock {
     CaseBlock[] caseBlocks;
+    VariableStack exprStack;
+    VariableStack breakedStack;
 
     public SwitchBlock(Expression instr,
 		       int[] cases, int[] dests) {
 	super(instr);
-        this.caseBlocks = new CaseBlock[dests.length];
+
+	/* First remove all dests that jump to the default dest. */
+	int numCases = dests.length;
+	int defaultDest = dests[cases.length];
+	for (int i=0; i< cases.length; i++) {
+	    if (dests[i] == defaultDest) {
+		dests[i] = -1;
+		numCases--;
+	    }
+	}
+
+        caseBlocks = new CaseBlock[numCases];
 	int lastDest = -1;
-	boolean lastBlock = true;
-        for (int i=dests.length-1; i>=0; i--) {
+        for (int i=numCases-1; i>=0; i--) {
 	    /**
 	     * Sort the destinations by finding the greatest destAddr
 	     */
@@ -43,6 +55,7 @@ implements BreakableBlock {
 		if (dests[j] >= dests[index])
 		    index = j;
 	    }
+	    /* assert(dests[index] != -1) */
 
 	    int value;
 	    if (index == cases.length)
@@ -51,22 +64,64 @@ implements BreakableBlock {
 		value = cases[index];
 
 	    if (dests[index] == lastDest)
-		this.caseBlocks[i] = new CaseBlock(value);
+		caseBlocks[i] = new CaseBlock(value);
 	    else
-		this.caseBlocks[i] = new CaseBlock(value, 
-						   new Jump(dests[index]));
-	    this.caseBlocks[i].outer = this;
-	    this.caseBlocks[i].isLastBlock = lastBlock;
-	    lastBlock = false;
+		caseBlocks[i] = new CaseBlock(value, 
+					      new Jump(dests[index]));
+	    caseBlocks[i].outer = this;
 	    lastDest = dests[index];
 	    dests[index] = -1;
 	    if (index == cases.length)
-		this.caseBlocks[i].isDefault = true;
+		caseBlocks[i].isDefault = true;
         }
+	caseBlocks[numCases-1].isLastBlock = true;
         this.jump = null;
         isBreaked = false;
     }
 
+    /**
+     * This does take the instr into account and modifies stack
+     * accordingly.  It then calls super.mapStackToLocal.
+     * @param stack the stack before the instruction is called
+     * @return stack the stack afterwards.
+     */
+    public VariableStack mapStackToLocal(VariableStack stack) {
+	VariableStack newStack;
+	int params = instr.getOperandCount();
+	if (params > 0) {
+	    exprStack = stack.peek(params);
+	    newStack = stack.pop(params);
+	} else 
+	    newStack = stack;
+	
+	VariableStack lastStack = newStack;
+	for (int i=0; i< caseBlocks.length; i++) {
+	    if (lastStack != null)
+		newStack.merge(lastStack);
+	    lastStack = caseBlocks[i].mapStackToLocal(newStack);
+	}
+	if (lastStack != null)
+	    mergeBreakedStack(lastStack);
+	return breakedStack;
+    }
+
+    /**
+     * Is called by BreakBlock, to tell us what the stack can be after a
+     * break.
+     */
+    public void mergeBreakedStack(VariableStack stack) {
+	if (breakedStack != null)
+	    breakedStack.merge(stack);
+	else
+	    breakedStack = stack;
+    }
+
+    public void removePush() {
+	if (exprStack != null)
+	    instr = exprStack.mergeIntoExpression(instr, used);
+	super.removePush();
+    }
+
     /**
      * Find the case that jumps directly to destination.
      * @return The sub block of the case block, which jumps to destination.