0N/A/*
2362N/A * Copyright (c) 1994, 2003, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
2362N/A * published by the Free Software Foundation. Oracle designates this
0N/A * particular file as subject to the "Classpath" exception as provided
2362N/A * by Oracle in the LICENSE file that accompanied this code.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/Apackage sun.tools.tree;
0N/A
0N/Aimport sun.tools.java.*;
0N/Aimport sun.tools.asm.Label;
0N/Aimport sun.tools.asm.Assembler;
0N/Aimport java.io.PrintStream;
0N/Aimport java.util.Hashtable;
0N/A
0N/A/**
0N/A * WARNING: The contents of this source file are not part of any
0N/A * supported API. Code that depends on them does so at its own risk:
0N/A * they are subject to change or removal without notice.
0N/A */
0N/Apublic
0N/Aclass BinaryExpression extends UnaryExpression {
0N/A Expression left;
0N/A
0N/A /**
0N/A * Constructor
0N/A */
0N/A BinaryExpression(int op, long where, Type type, Expression left, Expression right) {
0N/A super(op, where, type, right);
0N/A this.left = left;
0N/A }
0N/A
0N/A /**
0N/A * Order the expression based on precedence
0N/A */
0N/A public Expression order() {
0N/A if (precedence() > left.precedence()) {
0N/A UnaryExpression e = (UnaryExpression)left;
0N/A left = e.right;
0N/A e.right = order();
0N/A return e;
0N/A }
0N/A return this;
0N/A }
0N/A
0N/A /**
0N/A * Check a binary expression
0N/A */
0N/A public Vset checkValue(Environment env, Context ctx, Vset vset, Hashtable exp) {
0N/A vset = left.checkValue(env, ctx, vset, exp);
0N/A vset = right.checkValue(env, ctx, vset, exp);
0N/A
0N/A int tm = left.type.getTypeMask() | right.type.getTypeMask();
0N/A if ((tm & TM_ERROR) != 0) {
0N/A return vset;
0N/A }
0N/A selectType(env, ctx, tm);
0N/A
0N/A if (type.isType(TC_ERROR)) {
0N/A env.error(where, "invalid.args", opNames[op]);
0N/A }
0N/A return vset;
0N/A }
0N/A
0N/A /**
0N/A * Check if constant
0N/A */
0N/A public boolean isConstant() {
0N/A switch (op) {
0N/A case MUL:
0N/A case DIV:
0N/A case REM:
0N/A case ADD:
0N/A case SUB:
0N/A case LSHIFT:
0N/A case RSHIFT:
0N/A case URSHIFT:
0N/A case LT:
0N/A case LE:
0N/A case GT:
0N/A case GE:
0N/A case EQ:
0N/A case NE:
0N/A case BITAND:
0N/A case BITXOR:
0N/A case BITOR:
0N/A case AND:
0N/A case OR:
0N/A return left.isConstant() && right.isConstant();
0N/A }
0N/A return false;
0N/A }
0N/A /**
0N/A * Evaluate
0N/A */
0N/A Expression eval(int a, int b) {
0N/A return this;
0N/A }
0N/A Expression eval(long a, long b) {
0N/A return this;
0N/A }
0N/A Expression eval(float a, float b) {
0N/A return this;
0N/A }
0N/A Expression eval(double a, double b) {
0N/A return this;
0N/A }
0N/A Expression eval(boolean a, boolean b) {
0N/A return this;
0N/A }
0N/A Expression eval(String a, String b) {
0N/A return this;
0N/A }
0N/A Expression eval() {
0N/A // See also the eval() code in BinaryShiftExpression.java.
0N/A if (left.op == right.op) {
0N/A switch (left.op) {
0N/A case BYTEVAL:
0N/A case CHARVAL:
0N/A case SHORTVAL:
0N/A case INTVAL:
0N/A return eval(((IntegerExpression)left).value, ((IntegerExpression)right).value);
0N/A case LONGVAL:
0N/A return eval(((LongExpression)left).value, ((LongExpression)right).value);
0N/A case FLOATVAL:
0N/A return eval(((FloatExpression)left).value, ((FloatExpression)right).value);
0N/A case DOUBLEVAL:
0N/A return eval(((DoubleExpression)left).value, ((DoubleExpression)right).value);
0N/A case BOOLEANVAL:
0N/A return eval(((BooleanExpression)left).value, ((BooleanExpression)right).value);
0N/A case STRINGVAL:
0N/A return eval(((StringExpression)left).value, ((StringExpression)right).value);
0N/A }
0N/A }
0N/A return this;
0N/A }
0N/A
0N/A /**
0N/A * Inline
0N/A */
0N/A public Expression inline(Environment env, Context ctx) {
0N/A left = left.inline(env, ctx);
0N/A right = right.inline(env, ctx);
0N/A return (left == null) ? right : new CommaExpression(where, left, right);
0N/A }
0N/A public Expression inlineValue(Environment env, Context ctx) {
0N/A left = left.inlineValue(env, ctx);
0N/A right = right.inlineValue(env, ctx);
0N/A try {
0N/A return eval().simplify();
0N/A } catch (ArithmeticException e) {
0N/A // Got rid of this error message. It isn't illegal to
0N/A // have a program which does a constant division by
0N/A // zero. We return `this' to make the compiler to
0N/A // generate code here.
0N/A // (bugs 4019304, 4089107).
0N/A //
0N/A // env.error(where, "arithmetic.exception");
0N/A return this;
0N/A }
0N/A }
0N/A
0N/A /**
0N/A * Create a copy of the expression for method inlining
0N/A */
0N/A public Expression copyInline(Context ctx) {
0N/A BinaryExpression e = (BinaryExpression)clone();
0N/A if (left != null) {
0N/A e.left = left.copyInline(ctx);
0N/A }
0N/A if (right != null) {
0N/A e.right = right.copyInline(ctx);
0N/A }
0N/A return e;
0N/A }
0N/A
0N/A /**
0N/A * The cost of inlining this expression
0N/A */
0N/A public int costInline(int thresh, Environment env, Context ctx) {
0N/A return 1 + ((left != null) ? left.costInline(thresh, env, ctx) : 0) +
0N/A ((right != null) ? right.costInline(thresh, env, ctx) : 0);
0N/A }
0N/A
0N/A /**
0N/A * Code
0N/A */
0N/A void codeOperation(Environment env, Context ctx, Assembler asm) {
0N/A throw new CompilerError("codeOperation: " + opNames[op]);
0N/A }
0N/A public void codeValue(Environment env, Context ctx, Assembler asm) {
0N/A if (type.isType(TC_BOOLEAN)) {
0N/A Label l1 = new Label();
0N/A Label l2 = new Label();
0N/A
0N/A codeBranch(env, ctx, asm, l1, true);
0N/A asm.add(true, where, opc_ldc, new Integer(0));
0N/A asm.add(true, where, opc_goto, l2);
0N/A asm.add(l1);
0N/A asm.add(true, where, opc_ldc, new Integer(1));
0N/A asm.add(l2);
0N/A } else {
0N/A left.codeValue(env, ctx, asm);
0N/A right.codeValue(env, ctx, asm);
0N/A codeOperation(env, ctx, asm);
0N/A }
0N/A }
0N/A
0N/A /**
0N/A * Print
0N/A */
0N/A public void print(PrintStream out) {
0N/A out.print("(" + opNames[op] + " ");
0N/A if (left != null) {
0N/A left.print(out);
0N/A } else {
0N/A out.print("<null>");
0N/A }
0N/A out.print(" ");
0N/A if (right != null) {
0N/A right.print(out);
0N/A } else {
0N/A out.print("<null>");
0N/A }
0N/A out.print(")");
0N/A }
0N/A}