private void reduce(long op1, int operator, long op2) { switch (operator) { case BW_AND: stk.push(op1 & op2); break; case BW_OR: stk.push(op1 | op2); break; case BW_XOR: stk.push(op1 ^ op2); break; case BW_SHIFT_LEFT: stk.push(op1 << op2); break; case BW_USHIFT_LEFT: long iv2 = op1; if (iv2 < 0) iv2 *= -1; stk.push(iv2 << op2); break; case BW_SHIFT_RIGHT: stk.push(op1 >> op2); break; case BW_USHIFT_RIGHT: stk.push(op1 >>> op2); break; } }
private void reduce(int op1, int operator, int op2) { switch (operator) { case BW_AND: stk.push(op1 & op2); break; case BW_OR: stk.push(op1 | op2); break; case BW_XOR: stk.push(op1 ^ op2); break; case BW_SHIFT_LEFT: stk.push(op1 << op2); break; case BW_USHIFT_LEFT: int iv2 = op1; if (iv2 < 0) iv2 *= -1; stk.push(iv2 << op2); break; case BW_SHIFT_RIGHT: stk.push(op1 >> op2); break; case BW_USHIFT_RIGHT: stk.push(op1 >>> op2); break; } }
private void reduce(int op1, int operator, int op2) { switch (operator) { case BW_AND: stk.push(op1 & op2); break; case BW_OR: stk.push(op1 | op2); break; case BW_XOR: stk.push(op1 ^ op2); break; case BW_SHIFT_LEFT: stk.push(op1 << op2); break; case BW_USHIFT_LEFT: int iv2 = op1; if (iv2 < 0) iv2 *= -1; stk.push(iv2 << op2); break; case BW_SHIFT_RIGHT: stk.push(op1 >> op2); break; case BW_USHIFT_RIGHT: stk.push(op1 >>> op2); break; } }
private void reduce(long op1, int operator, int op2) { switch (operator) { case BW_AND: stk.push(op1 & op2); break; case BW_OR: stk.push(op1 | op2); break; case BW_XOR: stk.push(op1 ^ op2); break; case BW_SHIFT_LEFT: stk.push(op1 << op2); break; case BW_USHIFT_LEFT: long iv2 = op1; if (iv2 < 0) iv2 *= -1; stk.push(iv2 << op2); break; case BW_SHIFT_RIGHT: stk.push(op1 >> op2); break; case BW_USHIFT_RIGHT: stk.push(op1 >>> op2); break; } }
private void reduce(long op1, int operator, long op2) { switch (operator) { case BW_AND: stk.push(op1 & op2); break; case BW_OR: stk.push(op1 | op2); break; case BW_XOR: stk.push(op1 ^ op2); break; case BW_SHIFT_LEFT: stk.push(op1 << op2); break; case BW_USHIFT_LEFT: long iv2 = op1; if (iv2 < 0) iv2 *= -1; stk.push(iv2 << op2); break; case BW_SHIFT_RIGHT: stk.push(op1 >> op2); break; case BW_USHIFT_RIGHT: stk.push(op1 >>> op2); break; } }
private void reduce(int op1, int operator, long op2) { switch (operator) { case BW_AND: stk.push(op1 & op2); break; case BW_OR: stk.push(op1 | op2); break; case BW_XOR: stk.push(op1 ^ op2); break; case BW_SHIFT_LEFT: stk.push(op1 << op2); break; case BW_USHIFT_LEFT: int iv2 = op1; if (iv2 < 0) iv2 *= -1; stk.push(iv2 << op2); break; case BW_SHIFT_RIGHT: stk.push(op1 >> op2); break; case BW_USHIFT_RIGHT: stk.push(op1 >>> op2); break; } }
private void reduce(long op1, int operator, int op2) { switch (operator) { case BW_AND: stk.push(op1 & op2); break; case BW_OR: stk.push(op1 | op2); break; case BW_XOR: stk.push(op1 ^ op2); break; case BW_SHIFT_LEFT: stk.push(op1 << op2); break; case BW_USHIFT_LEFT: long iv2 = op1; if (iv2 < 0) iv2 *= -1; stk.push(iv2 << op2); break; case BW_SHIFT_RIGHT: stk.push(op1 >> op2); break; case BW_USHIFT_RIGHT: stk.push(op1 >>> op2); break; } }
private void reduce(int op1, int operator, long op2) { switch (operator) { case BW_AND: stk.push(op1 & op2); break; case BW_OR: stk.push(op1 | op2); break; case BW_XOR: stk.push(op1 ^ op2); break; case BW_SHIFT_LEFT: stk.push(op1 << op2); break; case BW_USHIFT_LEFT: int iv2 = op1; if (iv2 < 0) iv2 *= -1; stk.push(iv2 << op2); break; case BW_SHIFT_RIGHT: stk.push(op1 >> op2); break; case BW_USHIFT_RIGHT: stk.push(op1 >>> op2); break; } }
protected T initialValue() { ExecutionStack stk = new ExecutionStack(); stk.push("."); return (T) stk; } }
public ExecutionStack getRelPath() { if (relPath == null) { relPath = new ExecutionStack(); relPath.push(baseDir); } return relPath; } }
protected T initialValue() { ExecutionStack stk = new ExecutionStack(); stk.push("."); return (T) stk; } }
public ExecutionStack getRelPath() { if (relPath == null) { relPath = new ExecutionStack(); relPath.push(baseDir); } return relPath; } }
private static void push(String path) { relativePathStack.get().push(path); }
private static void push(String path) { relativePathStack.get().push(path); }
/** * This method peforms the equivilent of an XSWAP operation to flip the operator * over to the top of the stack, and loads the stored values on the d-stack onto * the main program stack. */ private void reduceRight() { if (dStack.isEmpty()) return; Object o = stk.pop(); stk.push(dStack.pop()); stk.push(o); stk.push(dStack.pop()); reduce(); }
BufferedInputStream bufstream = new BufferedInputStream(instream); runtime.getRelPath().push(file.getParent());
/** * This method peforms the equivilent of an XSWAP operation to flip the operator * over to the top of the stack, and loads the stored values on the d-stack onto * the main program stack. */ private void reduceRight() { if (dStack.isEmpty()) return; Object o = stk.pop(); stk.push(dStack.pop(), o, dStack.pop()); reduce(); }
/** * This method peforms the equivilent of an XSWAP operation to flip the operator * over to the top of the stack, and loads the stored values on the d-stack onto * the main program stack. */ private void reduceRight() { if (dStack.isEmpty()) return; Object o = stk.pop(); stk.push(dStack.pop(), o, dStack.pop()); reduce(); }
@Override public Object getReducedValueAccelerated(Object ctx, Object thisValue, VariableResolverFactory factory) { ExecutionStack stk = new ExecutionStack(); stk.push(getReducedValue(stk, thisValue, factory)); if (stk.isReduceable()) { while (true) { stk.op(); if (stk.isReduceable()) { stk.xswap(); } else { break; } } } return stk.peek(); }
@Override public Object getReducedValueAccelerated(Object ctx, Object thisValue, VariableResolverFactory factory) { ExecutionStack stk = new ExecutionStack(); stk.push(getReducedValue(stk, thisValue, factory)); if (stk.isReduceable()) { while (true) { stk.op(); if (stk.isReduceable()) { stk.xswap(); } else { break; } } } return stk.peek(); }