public StackState dupX2() { if (contents.size() < 3) { throw new InvalidBytecodeException("cannot dup_x1, stack does not have enough items"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup_x1 wide type"); } ArrayList<StackEntry> ret = new ArrayList<StackEntry>(1 + contents.size()); for (int i = 0; i < contents.size(); ++i) { if (i == contents.size() - 3) { ret.add(top()); } ret.add(contents.get(i)); } return new StackState(ret, constPool); }
public StackState dup2() { if (contents.size() <2) { throw new InvalidBytecodeException("cannot dup2, stack size is " + contents.size() + " " + toString()); } StackEntry t1 = top(); StackEntry t2 = top_1(); if (t2.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup2 when second type on stack is wide: " + toString()); } return newStack(t2, t1); }
public StackState dup2() { if (contents.size() <2) { throw new InvalidBytecodeException("cannot dup2, stack size is " + contents.size() + " " + toString()); } StackEntry t1 = top(); StackEntry t2 = top_1(); if (t2.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup2 when second type on stack is wide: " + toString()); } return newStack(t2, t1); }
public StackState dupX1() { if (contents.size() < 2) { throw new InvalidBytecodeException("cannot dup_x1, stack does not have enough items"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup_x1 wide type"); } ArrayList<StackEntry> ret = new ArrayList<StackEntry>(1 + contents.size()); for (int i = 0; i < contents.size(); ++i) { if (i == contents.size() - 2) { ret.add(top()); } ret.add(contents.get(i)); } return new StackState(ret, constPool); }
public StackState dup2() { if (contents.size() <2) { throw new InvalidBytecodeException("cannot dup2, stack size is " + contents.size() + " " + toString()); } StackEntry t1 = top(); StackEntry t2 = top_1(); if (t2.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup2 when second type on stack is wide: " + toString()); } return newStack(t2, t1); }
public StackState dupX2() { if (contents.size() < 3) { throw new InvalidBytecodeException("cannot dup_x1, stack does not have enough items"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup_x1 wide type"); } ArrayList<StackEntry> ret = new ArrayList<StackEntry>(1 + contents.size()); for (int i = 0; i < contents.size(); ++i) { if (i == contents.size() - 3) { ret.add(top()); } ret.add(contents.get(i)); } return new StackState(ret, constPool); }
public StackState dup2() { if (contents.size() <2) { throw new InvalidBytecodeException("cannot dup2, stack size is " + contents.size() + " " + toString()); } StackEntry t1 = top(); StackEntry t2 = top_1(); if (t2.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup2 when second type on stack is wide: " + toString()); } return newStack(t2, t1); }
public StackState dupX2() { if (contents.size() < 3) { throw new InvalidBytecodeException("cannot dup_x1, stack does not have enough items"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup_x1 wide type"); } ArrayList<StackEntry> ret = new ArrayList<StackEntry>(1 + contents.size()); for (int i = 0; i < contents.size(); ++i) { if (i == contents.size() - 3) { ret.add(top()); } ret.add(contents.get(i)); } return new StackState(ret, constPool); }
public StackState dup2() { if (contents.size() <2) { throw new InvalidBytecodeException("cannot dup2, stack size is " + contents.size() + " " + toString()); } StackEntry t1 = top(); StackEntry t2 = top_1(); if (t2.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup2 when second type on stack is wide: " + toString()); } return newStack(t2, t1); }
public StackState dupX2() { if (contents.size() < 3) { throw new InvalidBytecodeException("cannot dup_x1, stack does not have enough items"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup_x1 wide type"); } ArrayList<StackEntry> ret = new ArrayList<StackEntry>(1 + contents.size()); for (int i = 0; i < contents.size(); ++i) { if (i == contents.size() - 3) { ret.add(top()); } ret.add(contents.get(i)); } return new StackState(ret, constPool); }
public StackState dupX1() { if (contents.size() < 2) { throw new InvalidBytecodeException("cannot dup_x1, stack does not have enough items"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup_x1 wide type"); } ArrayList<StackEntry> ret = new ArrayList<StackEntry>(1 + contents.size()); for (int i = 0; i < contents.size(); ++i) { if (i == contents.size() - 2) { ret.add(top()); } ret.add(contents.get(i)); } return new StackState(ret, constPool); }
public StackState dupX1() { if (contents.size() < 2) { throw new InvalidBytecodeException("cannot dup_x1, stack does not have enough items"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup_x1 wide type"); } ArrayList<StackEntry> ret = new ArrayList<StackEntry>(1 + contents.size()); for (int i = 0; i < contents.size(); ++i) { if (i == contents.size() - 2) { ret.add(top()); } ret.add(contents.get(i)); } return new StackState(ret, constPool); }
public StackState dupX1() { if (contents.size() < 2) { throw new InvalidBytecodeException("cannot dup_x1, stack does not have enough items"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup_x1 wide type"); } ArrayList<StackEntry> ret = new ArrayList<StackEntry>(1 + contents.size()); for (int i = 0; i < contents.size(); ++i) { if (i == contents.size() - 2) { ret.add(top()); } ret.add(contents.get(i)); } return new StackState(ret, constPool); }
public StackState dupX1() { if (contents.size() < 2) { throw new InvalidBytecodeException("cannot dup_x1, stack does not have enough items"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup_x1 wide type"); } ArrayList<StackEntry> ret = new ArrayList<StackEntry>(1 + contents.size()); for (int i = 0; i < contents.size(); ++i) { if (i == contents.size() - 2) { ret.add(top()); } ret.add(contents.get(i)); } return new StackState(ret, constPool); }
public StackState dupX2() { if (contents.size() < 3) { throw new InvalidBytecodeException("cannot dup_x1, stack does not have enough items"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup_x1 wide type"); } ArrayList<StackEntry> ret = new ArrayList<StackEntry>(1 + contents.size()); for (int i = 0; i < contents.size(); ++i) { if (i == contents.size() - 3) { ret.add(top()); } ret.add(contents.get(i)); } return new StackState(ret, constPool); }
public StackState dup() { if (contents.isEmpty()) { throw new InvalidBytecodeException("cannot dup empty stack"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup wide type"); } return newStack(type); }
public StackState dup() { if (contents.isEmpty()) { throw new InvalidBytecodeException("cannot dup empty stack"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup wide type"); } return newStack(type); }
public StackState dup() { if (contents.isEmpty()) { throw new InvalidBytecodeException("cannot dup empty stack"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup wide type"); } return newStack(type); }
public StackState dup() { if (contents.isEmpty()) { throw new InvalidBytecodeException("cannot dup empty stack"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup wide type"); } return newStack(type); }
public StackState dup() { if (contents.isEmpty()) { throw new InvalidBytecodeException("cannot dup empty stack"); } StackEntry type = top(); if (type.getType() == StackEntryType.TOP) { throw new InvalidBytecodeException("Cannot dup wide type"); } return newStack(type); }