Java BinaryNode.isAssignment方法代码示例

import jdk.nashorn.internal.ir.BinaryNode; //导入方法依赖的package包/类
@Override
public boolean enterBinaryNode(final BinaryNode binaryNode) {
    if(binaryNode.isAssignment()) {
        final Expression lhs = binaryNode.lhs();
        if(!binaryNode.isSelfModifying()) {
            tagNeverOptimistic(lhs);
        }
        if(lhs instanceof IdentNode) {
            final Symbol symbol = ((IdentNode)lhs).getSymbol();
            // Assignment to internal symbols is never optimistic, except for self-assignment expressions
            if(symbol.isInternal() && !binaryNode.rhs().isSelfModifying()) {
                tagNeverOptimistic(binaryNode.rhs());
            }
        }
    } else if(binaryNode.isTokenType(TokenType.INSTANCEOF)) {
        tagNeverOptimistic(binaryNode.lhs());
        tagNeverOptimistic(binaryNode.rhs());
    }
    return true;
}
 

import jdk.nashorn.internal.ir.BinaryNode; //导入方法依赖的package包/类
@Override
public boolean enterBinaryNode(final BinaryNode binaryNode) {
    if (binaryNode.isAssignment()) {
        final ExpressionTree srcTree = translateExpr(binaryNode.getAssignmentSource());
        final ExpressionTree destTree = translateExpr(binaryNode.getAssignmentDest());

        if (binaryNode.isTokenType(TokenType.ASSIGN)) {
            curExpr = new AssignmentTreeImpl(binaryNode, destTree, srcTree);
        } else {
            curExpr = new CompoundAssignmentTreeImpl(binaryNode, destTree, srcTree);
        }
    } else {
        final ExpressionTree leftTree = translateExpr(binaryNode.lhs());
        final ExpressionTree rightTree = translateExpr(binaryNode.rhs());

        if (binaryNode.isTokenType(TokenType.INSTANCEOF)) {
            curExpr = new InstanceOfTreeImpl(binaryNode, leftTree, rightTree);
        } else {
            curExpr = new BinaryTreeImpl(binaryNode, leftTree, rightTree);
        }
    }

    return false;
}
 

import jdk.nashorn.internal.ir.BinaryNode; //导入方法依赖的package包/类
@Override
public boolean enterBinaryNode(final BinaryNode binaryNode) {
    if(binaryNode.isAssignment()) {
        final Expression lhs = binaryNode.lhs();
        if(!binaryNode.isSelfModifying()) {
            tagNeverOptimistic(lhs);
        }
        if(lhs instanceof IdentNode) {
            final Symbol symbol = ((IdentNode)lhs).getSymbol();
            // Assignment to internal symbols is never optimistic, except for self-assignment expressions
            if(symbol.isInternal() && !binaryNode.rhs().isSelfModifying()) {
                tagNeverOptimistic(binaryNode.rhs());
            }
        }
    } else if(binaryNode.isTokenType(TokenType.INSTANCEOF)
            || binaryNode.isTokenType(TokenType.EQ_STRICT)
            || binaryNode.isTokenType(TokenType.NE_STRICT)) {
        tagNeverOptimistic(binaryNode.lhs());
        tagNeverOptimistic(binaryNode.rhs());
    }
    return true;
}
 

import jdk.nashorn.internal.ir.BinaryNode; //导入方法依赖的package包/类
@Override
public boolean enterBinaryNode(final BinaryNode binaryNode) {
    enterDefault(binaryNode);

    final String name;
    if (binaryNode.isAssignment()) {
        name = "AssignmentExpression";
    } else if (binaryNode.isLogical()) {
        name = "LogicalExpression";
    } else {
        name = "BinaryExpression";
    }

    type(name);
    comma();

    property("operator", binaryNode.tokenType().getName());
    comma();

    property("left");
    binaryNode.lhs().accept(this);
    comma();

    property("right");
    binaryNode.rhs().accept(this);

    return leave();
}
 

import jdk.nashorn.internal.ir.BinaryNode; //导入方法依赖的package包/类
@Override
public Node leaveBinaryNode(final BinaryNode binaryNode) {
    if (binaryNode.isAssignment() && binaryNode.lhs() instanceof IdentNode) {
        checkConstAssignment((IdentNode) binaryNode.lhs());
    }
    switch (binaryNode.tokenType()) {
    case ASSIGN:
        return leaveASSIGN(binaryNode);
    default:
        return super.leaveBinaryNode(binaryNode);
    }
}
 

import jdk.nashorn.internal.ir.BinaryNode; //导入方法依赖的package包/类
@Override
public boolean enterBinaryNode(final BinaryNode binaryNode) {
    // NOTE: regardless of operator's lexical associativity, lhs is always evaluated first.
    final Expression lhs = binaryNode.lhs();
    final LvarType lhsType;
    if (!(lhs instanceof IdentNode && binaryNode.isTokenType(TokenType.ASSIGN))) {
        lhsType = visitExpression(lhs);
    } else {
        // Can't visit IdentNode on LHS of a simple assignment, as visits imply use, and this is def.
        // The type is irrelevant, as only RHS is used to determine the type anyway.
        lhsType = LvarType.UNDEFINED;
    }

    final boolean isLogical = binaryNode.isLogical();
    final Label joinLabel = isLogical ? new Label("") : null;
    if(isLogical) {
        jumpToLabel((JoinPredecessor)lhs, joinLabel);
    }

    final Expression rhs = binaryNode.rhs();
    final LvarType rhsType = visitExpression(rhs);
    if(isLogical) {
        jumpToLabel((JoinPredecessor)rhs, joinLabel);
    }
    joinOnLabel(joinLabel);

    final LvarType type = toLvarType(binaryNode.setOperands(lhsType.typeExpression, rhsType.typeExpression).getType());

    if(binaryNode.isAssignment() && lhs instanceof IdentNode) {
        if(binaryNode.isSelfModifying()) {
            onSelfAssignment((IdentNode)lhs, type);
        } else {
            onAssignment((IdentNode)lhs, type);
        }
    }
    typeStack.push(type);
    return false;
}