Java ForNode.getTest方法代码示例

import jdk.nashorn.internal.ir.ForNode; //导入方法依赖的package包/类
@Override
public Node leaveForNode(final ForNode forNode) {
    ForNode newForNode = forNode;

    final Expression test = forNode.getTest();
    if (!forNode.isForIn() && isAlwaysTrue(test)) {
        newForNode = forNode.setTest(lc, null);
    }

    newForNode = checkEscape(newForNode);
    if(newForNode.isForIn()) {
        // Wrap it in a block so its internally created iterator is restricted in scope
        addStatementEnclosedInBlock(newForNode);
    } else {
        addStatement(newForNode);
    }
    return newForNode;
}
 

import jdk.nashorn.internal.ir.ForNode; //导入方法依赖的package包/类
@Override
public Node leaveForNode(final ForNode forNode) {
    ForNode newForNode = forNode;

    final Expression test = forNode.getTest();
    if (!forNode.isForInOrOf() && isAlwaysTrue(test)) {
        newForNode = forNode.setTest(lc, null);
    }

    newForNode = checkEscape(newForNode);
    if(!es6 && newForNode.isForInOrOf()) {
        // Wrap it in a block so its internally created iterator is restricted in scope, unless we are running
        // in ES6 mode, in which case the parser already created a block to capture let/const declarations.
        addStatementEnclosedInBlock(newForNode);
    } else {
        addStatement(newForNode);
    }
    return newForNode;
}
 

import jdk.nashorn.internal.ir.ForNode; //导入方法依赖的package包/类
@Override
public Node leaveForNode(final ForNode forNode) {
    ForNode newForNode = forNode;

    final Node  test = forNode.getTest();
    if (!forNode.isForIn() && conservativeAlwaysTrue(test)) {
        newForNode = forNode.setTest(lc, null);
    }

    return addStatement(checkEscape(newForNode));
}
 

import jdk.nashorn.internal.ir.ForNode; //导入方法依赖的package包/类
private void enterFor(final ForNode forNode) {
    final Expression init   = forNode.getInit();
    final Expression test   = forNode.getTest();
    final Block      body   = forNode.getBody();
    final Expression modify = forNode.getModify();

    if (init != null) {
        init.accept(this);
    }

    final Label loopLabel = new Label("loop");
    final Label testLabel = new Label("test");

    method._goto(testLabel);
    method.label(loopLabel);
    body.accept(this);
    method.label(forNode.getContinueLabel());

    if (!body.isTerminal() && modify != null) {
        load(modify);
    }

    method.label(testLabel);
    if (test != null) {
        new BranchOptimizer(this, method).execute(test, loopLabel, true);
    } else {
        method._goto(loopLabel);
    }

    method.label(forNode.getBreakLabel());
}
 

import jdk.nashorn.internal.ir.ForNode; //导入方法依赖的package包/类
private void enterForIn(final ForNode forNode) {
    loadExpression(forNode.getModify(), TypeBounds.OBJECT);
    method.invoke(forNode.isForEach() ? ScriptRuntime.TO_VALUE_ITERATOR : ScriptRuntime.TO_PROPERTY_ITERATOR);
    final Symbol iterSymbol = forNode.getIterator();
    final int iterSlot = iterSymbol.getSlot(Type.OBJECT);
    method.store(iterSymbol, ITERATOR_TYPE);

    method.beforeJoinPoint(forNode);

    final Label continueLabel = forNode.getContinueLabel();
    final Label breakLabel    = forNode.getBreakLabel();

    method.label(continueLabel);
    method.load(ITERATOR_TYPE, iterSlot);
    method.invoke(interfaceCallNoLookup(ITERATOR_CLASS, "hasNext", boolean.class));
    final JoinPredecessorExpression test = forNode.getTest();
    final Block body = forNode.getBody();
    if(LocalVariableConversion.hasLiveConversion(test)) {
        final Label afterConversion = new Label("for_in_after_test_conv");
        method.ifne(afterConversion);
        method.beforeJoinPoint(test);
        method._goto(breakLabel);
        method.label(afterConversion);
    } else {
        method.ifeq(breakLabel);
    }

    new Store<Expression>(forNode.getInit()) {
        @Override
        protected void storeNonDiscard() {
            // This expression is neither part of a discard, nor needs to be left on the stack after it was
            // stored, so we override storeNonDiscard to be a no-op.
        }

        @Override
        protected void evaluate() {
            new OptimisticOperation((Optimistic)forNode.getInit(), TypeBounds.UNBOUNDED) {
                @Override
                void loadStack() {
                    method.load(ITERATOR_TYPE, iterSlot);
                }

                @Override
                void consumeStack() {
                    method.invoke(interfaceCallNoLookup(ITERATOR_CLASS, "next", Object.class));
                    convertOptimisticReturnValue();
                }
            }.emit();
        }
    }.store();
    body.accept(this);

    if(method.isReachable()) {
        method._goto(continueLabel);
    }
    method.label(breakLabel);
}