mirror of
https://git.huckle.dev/Huckles-Minecraft-Archive/jpexs-decompiler.git
synced 2026-09-25 13:00:47 +00:00
Code formatting
This commit is contained in:
Jindra Pet��k
@@ -14,7 +14,6 @@
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
package com.jpexs.asdec.abc.avm2.flowgraph;
|
||||
|
||||
import com.jpexs.asdec.abc.avm2.AVM2Code;
|
||||
@@ -40,179 +39,177 @@ import java.util.logging.Logger;
|
||||
*/
|
||||
public class Graph {
|
||||
|
||||
public GraphPart head;
|
||||
public List<Integer> ignored = new ArrayList<Integer>();
|
||||
private int trueReg = -1;
|
||||
private int falseReg = -1;
|
||||
public GraphPart head;
|
||||
public List<Integer> ignored = new ArrayList<Integer>();
|
||||
private int trueReg = -1;
|
||||
private int falseReg = -1;
|
||||
|
||||
public Graph(AVM2Code code) {
|
||||
int start = checkSWFSecureStart(code);
|
||||
head=makeGraph(new Stack<Boolean>(), code, start, new ArrayList<GraphPart>());
|
||||
}
|
||||
public Graph(AVM2Code code) {
|
||||
int start = checkSWFSecureStart(code);
|
||||
head = makeGraph(new Stack<Boolean>(), code, start, new ArrayList<GraphPart>());
|
||||
}
|
||||
|
||||
private int checkSWFSecureStart(AVM2Code code) {
|
||||
if (code.code.size() < 2) {
|
||||
return 0;
|
||||
}
|
||||
if (!((code.code.get(0).definition instanceof PushFalseIns) || (code.code.get(0).definition instanceof PushTrueIns))) {
|
||||
return 0;
|
||||
}
|
||||
if (!((code.code.get(1).definition instanceof PushFalseIns) || (code.code.get(1).definition instanceof PushTrueIns))) {
|
||||
return 0;
|
||||
}
|
||||
int pos = 2;
|
||||
Stack<Boolean> myStack = new Stack<Boolean>();
|
||||
int ip = 0;
|
||||
int setCount = 0;
|
||||
while (ip < code.code.size()) {
|
||||
if (code.code.get(ip).definition instanceof PushFalseIns) {
|
||||
myStack.push(Boolean.FALSE);
|
||||
} else if (code.code.get(ip).definition instanceof PushTrueIns) {
|
||||
myStack.push(Boolean.TRUE);
|
||||
private int checkSWFSecureStart(AVM2Code code) {
|
||||
if (code.code.size() < 2) {
|
||||
return 0;
|
||||
}
|
||||
if (!((code.code.get(0).definition instanceof PushFalseIns) || (code.code.get(0).definition instanceof PushTrueIns))) {
|
||||
return 0;
|
||||
}
|
||||
if (!((code.code.get(1).definition instanceof PushFalseIns) || (code.code.get(1).definition instanceof PushTrueIns))) {
|
||||
return 0;
|
||||
}
|
||||
int pos = 2;
|
||||
Stack<Boolean> myStack = new Stack<Boolean>();
|
||||
int ip = 0;
|
||||
int setCount = 0;
|
||||
while (ip < code.code.size()) {
|
||||
if (code.code.get(ip).definition instanceof PushFalseIns) {
|
||||
myStack.push(Boolean.FALSE);
|
||||
} else if (code.code.get(ip).definition instanceof PushTrueIns) {
|
||||
myStack.push(Boolean.TRUE);
|
||||
} else if (code.code.get(ip).definition instanceof SwapIns) {
|
||||
Boolean b1 = myStack.pop();
|
||||
Boolean b2 = myStack.pop();
|
||||
myStack.push(b1);
|
||||
myStack.push(b2);
|
||||
} else if (code.code.get(ip).definition instanceof JumpIns) {
|
||||
try {
|
||||
ip = code.adr2pos(code.pos2adr(ip + 1) + code.code.get(ip).operands[0]);
|
||||
} catch (ConvertException ex) {
|
||||
Logger.getLogger(Graph.class.getName()).log(Level.SEVERE, null, ex);
|
||||
}
|
||||
continue;
|
||||
} else if (code.code.get(ip).definition instanceof SetLocalTypeIns) {
|
||||
Boolean val = myStack.pop();
|
||||
if (val == true) {
|
||||
trueReg = ((SetLocalTypeIns) code.code.get(ip).definition).getRegisterId(code.code.get(ip));
|
||||
} else {
|
||||
falseReg = ((SetLocalTypeIns) code.code.get(ip).definition).getRegisterId(code.code.get(ip));
|
||||
}
|
||||
setCount++;
|
||||
if (setCount == 2) {
|
||||
return ip + 1;
|
||||
}
|
||||
}
|
||||
ip++;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
private GraphPart makeGraph(Stack<Boolean> myStack, AVM2Code code, int start, List<GraphPart> allBlocks) {
|
||||
GraphPart ret = new GraphPart(start, -1);
|
||||
ret.instanceCount = 1;
|
||||
allBlocks.add(ret);
|
||||
GraphPart actual = ret;
|
||||
try {
|
||||
int ip = start;
|
||||
while (ip < code.code.size()) {
|
||||
for (GraphPart block : allBlocks) {
|
||||
if (block.containsIP(ip)) {
|
||||
if (block.start < ip) {
|
||||
int oldEnd = block.end;
|
||||
block.end = ip - 1;
|
||||
GraphPart newBlock = new GraphPart(ip, oldEnd);
|
||||
newBlock.nextParts.addAll(block.nextParts);
|
||||
newBlock.instanceCount = 1;
|
||||
block.nextParts.clear();
|
||||
block.nextParts.add(newBlock);
|
||||
allBlocks.add(newBlock);
|
||||
block = newBlock;
|
||||
}
|
||||
block.instanceCount++;
|
||||
if (start < ip) {
|
||||
actual.end = ip - 1;
|
||||
actual.nextParts.add(block);
|
||||
return ret;
|
||||
} else {
|
||||
return block;
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
boolean forceJump = false;
|
||||
boolean forceSkip = false;
|
||||
if (code.code.get(ip).definition instanceof IfTrueIns) {
|
||||
if (!myStack.empty()) {
|
||||
if (myStack.pop() == true) {
|
||||
forceJump = true;
|
||||
} else {
|
||||
forceSkip = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (code.code.get(ip).definition instanceof IfFalseIns) {
|
||||
if (!myStack.empty()) {
|
||||
if (myStack.pop() == false) {
|
||||
forceJump = true;
|
||||
} else {
|
||||
forceSkip = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (code.code.get(ip).definition instanceof GetLocalTypeIns) {
|
||||
int locreg = ((GetLocalTypeIns) code.code.get(ip).definition).getRegisterId(code.code.get(ip));
|
||||
if (locreg == trueReg) {
|
||||
myStack.push(Boolean.TRUE);
|
||||
ignored.add(ip);
|
||||
}
|
||||
if (locreg == falseReg) {
|
||||
myStack.push(Boolean.FALSE);
|
||||
ignored.add(ip);
|
||||
}
|
||||
} else if (code.code.get(ip).definition instanceof PopIns) {
|
||||
if (!myStack.empty()) {
|
||||
myStack.pop();
|
||||
ignored.add(ip);
|
||||
}
|
||||
} else if (code.code.get(ip).definition instanceof SwapIns) {
|
||||
Boolean b1 = myStack.pop();
|
||||
Boolean b2 = myStack.pop();
|
||||
myStack.push(b1);
|
||||
myStack.push(b2);
|
||||
} else if (code.code.get(ip).definition instanceof JumpIns) {
|
||||
try {
|
||||
ip = code.adr2pos(code.pos2adr(ip + 1) + code.code.get(ip).operands[0]);
|
||||
} catch (ConvertException ex) {
|
||||
Logger.getLogger(Graph.class.getName()).log(Level.SEVERE, null, ex);
|
||||
}
|
||||
continue;
|
||||
} else if (code.code.get(ip).definition instanceof SetLocalTypeIns) {
|
||||
Boolean val = myStack.pop();
|
||||
if (val == true) {
|
||||
trueReg = ((SetLocalTypeIns) code.code.get(ip).definition).getRegisterId(code.code.get(ip));
|
||||
} else {
|
||||
falseReg = ((SetLocalTypeIns) code.code.get(ip).definition).getRegisterId(code.code.get(ip));
|
||||
}
|
||||
setCount++;
|
||||
if (setCount == 2) {
|
||||
return ip + 1;
|
||||
}
|
||||
if (myStack.size() >= 2) {
|
||||
Boolean b1 = myStack.pop();
|
||||
Boolean b2 = myStack.pop();
|
||||
myStack.push(b1);
|
||||
myStack.push(b2);
|
||||
ignored.add(ip);
|
||||
}
|
||||
} else if (code.code.get(ip).definition instanceof DupIns) {
|
||||
if (!myStack.empty()) {
|
||||
Boolean b = myStack.pop();
|
||||
myStack.push(b);
|
||||
myStack.push(b);
|
||||
ignored.add(ip);
|
||||
}
|
||||
} else if ((code.code.get(ip).definition instanceof JumpIns) || forceJump) {
|
||||
|
||||
int jumpIp = code.adr2pos(code.pos2adr(ip + 1) + code.code.get(ip).operands[0]);
|
||||
actual.end = ip;
|
||||
GraphPart newActual = makeGraph(myStack, code, jumpIp, allBlocks);
|
||||
actual.nextParts.add(newActual);
|
||||
return ret;
|
||||
} else if (code.code.get(ip).definition instanceof IfTypeIns) {
|
||||
if (forceSkip) {
|
||||
ip++;
|
||||
continue;
|
||||
}
|
||||
|
||||
actual.end = ip;
|
||||
int jumpIp = code.adr2pos(code.pos2adr(ip + 1) + code.code.get(ip).operands[0]);
|
||||
GraphPart onTrue = makeGraph(myStack, code, jumpIp, allBlocks);
|
||||
actual.nextParts.add(onTrue);
|
||||
GraphPart onFalse = makeGraph(myStack, code, ip + 1, allBlocks);
|
||||
actual.nextParts.add(onFalse);
|
||||
return ret;
|
||||
} else if ((code.code.get(ip).definition instanceof ReturnValueIns) || (code.code.get(ip).definition instanceof ReturnVoidIns)) {
|
||||
ip++;
|
||||
break;
|
||||
}
|
||||
ip++;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
private GraphPart makeGraph(Stack<Boolean> myStack,AVM2Code code, int start, List<GraphPart> allBlocks) {
|
||||
GraphPart ret=new GraphPart(start,-1);
|
||||
ret.instanceCount=1;
|
||||
allBlocks.add(ret);
|
||||
GraphPart actual=ret;
|
||||
try {
|
||||
int ip = start;
|
||||
while (ip < code.code.size()) {
|
||||
for (GraphPart block : allBlocks) {
|
||||
if (block.containsIP(ip)) {
|
||||
if(block.start<ip){
|
||||
int oldEnd=block.end;
|
||||
block.end=ip-1;
|
||||
GraphPart newBlock=new GraphPart(ip,oldEnd);
|
||||
newBlock.nextParts.addAll(block.nextParts);
|
||||
newBlock.instanceCount=1;
|
||||
block.nextParts.clear();
|
||||
block.nextParts.add(newBlock);
|
||||
allBlocks.add(newBlock);
|
||||
block=newBlock;
|
||||
}
|
||||
block.instanceCount++;
|
||||
if(start<ip){
|
||||
actual.end=ip-1;
|
||||
actual.nextParts.add(block);
|
||||
return ret;
|
||||
}else{
|
||||
return block;
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
boolean forceJump = false;
|
||||
boolean forceSkip = false;
|
||||
if (code.code.get(ip).definition instanceof IfTrueIns) {
|
||||
if (!myStack.empty()) {
|
||||
if (myStack.pop() == true) {
|
||||
forceJump = true;
|
||||
} else {
|
||||
forceSkip = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (code.code.get(ip).definition instanceof IfFalseIns) {
|
||||
if (!myStack.empty()) {
|
||||
if (myStack.pop() == false) {
|
||||
forceJump = true;
|
||||
} else {
|
||||
forceSkip = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (code.code.get(ip).definition instanceof GetLocalTypeIns) {
|
||||
int locreg = ((GetLocalTypeIns) code.code.get(ip).definition).getRegisterId(code.code.get(ip));
|
||||
if (locreg == trueReg) {
|
||||
myStack.push(Boolean.TRUE);
|
||||
ignored.add(ip);
|
||||
}
|
||||
if (locreg == falseReg) {
|
||||
myStack.push(Boolean.FALSE);
|
||||
ignored.add(ip);
|
||||
}
|
||||
} else if (code.code.get(ip).definition instanceof PopIns) {
|
||||
if (!myStack.empty()) {
|
||||
myStack.pop();
|
||||
ignored.add(ip);
|
||||
}
|
||||
} else if (code.code.get(ip).definition instanceof SwapIns) {
|
||||
if (myStack.size() >= 2) {
|
||||
Boolean b1 = myStack.pop();
|
||||
Boolean b2 = myStack.pop();
|
||||
myStack.push(b1);
|
||||
myStack.push(b2);
|
||||
ignored.add(ip);
|
||||
}
|
||||
} else if (code.code.get(ip).definition instanceof DupIns) {
|
||||
if (!myStack.empty()) {
|
||||
Boolean b = myStack.pop();
|
||||
myStack.push(b);
|
||||
myStack.push(b);
|
||||
ignored.add(ip);
|
||||
}
|
||||
} else if ((code.code.get(ip).definition instanceof JumpIns) || forceJump) {
|
||||
|
||||
int jumpIp = code.adr2pos(code.pos2adr(ip + 1) + code.code.get(ip).operands[0]);
|
||||
actual.end=ip;
|
||||
GraphPart newActual=makeGraph(myStack,code,jumpIp,allBlocks);
|
||||
actual.nextParts.add(newActual);
|
||||
return ret;
|
||||
} else if (code.code.get(ip).definition instanceof IfTypeIns) {
|
||||
if (forceSkip) {
|
||||
ip++;
|
||||
continue;
|
||||
}
|
||||
|
||||
actual.end=ip;
|
||||
int jumpIp = code.adr2pos(code.pos2adr(ip + 1) + code.code.get(ip).operands[0]);
|
||||
GraphPart onTrue=makeGraph(myStack,code, jumpIp, allBlocks);
|
||||
actual.nextParts.add(onTrue);
|
||||
GraphPart onFalse=makeGraph(myStack,code, ip + 1, allBlocks);
|
||||
actual.nextParts.add(onFalse);
|
||||
return ret;
|
||||
} else if ((code.code.get(ip).definition instanceof ReturnValueIns) || (code.code.get(ip).definition instanceof ReturnVoidIns)) {
|
||||
ip++;
|
||||
break;
|
||||
}
|
||||
ip++;
|
||||
}
|
||||
actual.end=ip-1;
|
||||
return ret;
|
||||
} catch (ConvertException ex) {
|
||||
Logger.getLogger(Graph.class.getName()).log(Level.SEVERE, null, ex);
|
||||
}
|
||||
return null;
|
||||
}
|
||||
|
||||
}
|
||||
actual.end = ip - 1;
|
||||
return ret;
|
||||
} catch (ConvertException ex) {
|
||||
Logger.getLogger(Graph.class.getName()).log(Level.SEVERE, null, ex);
|
||||
}
|
||||
return null;
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user