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.Assembler;
0N/Aimport sun.tools.asm.Label;
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 ConditionalExpression extends BinaryExpression {
0N/A Expression cond;
0N/A
0N/A /**
0N/A * Constructor
0N/A */
0N/A public ConditionalExpression(long where, Expression cond, Expression left, Expression right) {
0N/A super(COND, where, Type.tError, left, right);
0N/A this.cond = cond;
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() > cond.precedence()) {
0N/A UnaryExpression e = (UnaryExpression)cond;
0N/A cond = 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 the expression
0N/A */
0N/A public Vset checkValue(Environment env, Context ctx, Vset vset, Hashtable exp) {
0N/A ConditionVars cvars = cond.checkCondition(env, ctx, vset, exp);
0N/A vset = left.checkValue(env, ctx, cvars.vsTrue, exp).join(
0N/A right.checkValue(env, ctx, cvars.vsFalse, exp) );
0N/A cond = convert(env, ctx, Type.tBoolean, cond);
0N/A
0N/A int tm = left.type.getTypeMask() | right.type.getTypeMask();
0N/A if ((tm & TM_ERROR) != 0) {
0N/A type = Type.tError;
0N/A return vset;
0N/A }
0N/A if (left.type.equals(right.type)) {
0N/A type = left.type;
0N/A } else if ((tm & TM_DOUBLE) != 0) {
0N/A type = Type.tDouble;
0N/A } else if ((tm & TM_FLOAT) != 0) {
0N/A type = Type.tFloat;
0N/A } else if ((tm & TM_LONG) != 0) {
0N/A type = Type.tLong;
0N/A } else if ((tm & TM_REFERENCE) != 0) {
0N/A try {
0N/A // This is wrong. We should be using their most common
0N/A // ancestor, instead.
0N/A type = env.implicitCast(right.type, left.type)
0N/A ? left.type : right.type;
0N/A } catch (ClassNotFound e) {
0N/A type = Type.tError;
0N/A }
0N/A } else if (((tm & TM_CHAR) != 0) && left.fitsType(env, ctx, Type.tChar) && right.fitsType(env, ctx, Type.tChar)) {
0N/A type = Type.tChar;
0N/A } else if (((tm & TM_SHORT) != 0) && left.fitsType(env, ctx, Type.tShort) && right.fitsType(env, ctx, Type.tShort)) {
0N/A type = Type.tShort;
0N/A } else if (((tm & TM_BYTE) != 0) && left.fitsType(env, ctx, Type.tByte) && right.fitsType(env, ctx, Type.tByte)) {
0N/A type = Type.tByte;
0N/A } else {
0N/A type = Type.tInt;
0N/A }
0N/A
0N/A left = convert(env, ctx, type, left);
0N/A right = convert(env, ctx, type, right);
0N/A return vset;
0N/A }
0N/A
0N/A public Vset check(Environment env, Context ctx, Vset vset, Hashtable exp) {
0N/A vset = cond.checkValue(env, ctx, vset, exp);
0N/A cond = convert(env, ctx, Type.tBoolean, cond);
0N/A return left.check(env, ctx, vset.copy(), exp).join(right.check(env, ctx, vset, exp));
0N/A }
0N/A
0N/A /**
0N/A * Check if constant
0N/A */
0N/A public boolean isConstant() {
0N/A return cond.isConstant() && left.isConstant() && right.isConstant();
0N/A }
0N/A
0N/A /**
0N/A * Simplify
0N/A */
0N/A Expression simplify() {
0N/A if (cond.equals(true)) {
0N/A return left;
0N/A }
0N/A if (cond.equals(false)) {
0N/A return right;
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 if ((left == null) && (right == null)) {
0N/A return cond.inline(env, ctx);
0N/A }
0N/A if (left == null) {
0N/A left = right;
0N/A right = null;
0N/A cond = new NotExpression(where, cond);
0N/A }
0N/A cond = cond.inlineValue(env, ctx);
0N/A return simplify();
0N/A }
0N/A
0N/A public Expression inlineValue(Environment env, Context ctx) {
0N/A cond = cond.inlineValue(env, ctx);
0N/A left = left.inlineValue(env, ctx);
0N/A right = right.inlineValue(env, ctx);
0N/A return simplify();
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 // We need to check if right is null in case costInline()
0N/A // is called after this expression has been inlined.
0N/A // This call can happen, for example, in MemberDefinition#cleanup().
0N/A // (Fix for 4069861).
0N/A return 1 +
0N/A cond.costInline(thresh, env, ctx) +
0N/A left.costInline(thresh, env, ctx) +
0N/A ((right == null) ? 0 : right.costInline(thresh, env, ctx));
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 ConditionalExpression e = (ConditionalExpression)clone();
0N/A e.cond = cond.copyInline(ctx);
0N/A e.left = left.copyInline(ctx);
0N/A
0N/A // If copyInline() is called after inlining is complete,
0N/A // right could be null.
0N/A e.right = (right == null) ? null : right.copyInline(ctx);
0N/A
0N/A return e;
0N/A }
0N/A
0N/A /**
0N/A * Code
0N/A */
0N/A public void codeValue(Environment env, Context ctx, Assembler asm) {
0N/A Label l1 = new Label();
0N/A Label l2 = new Label();
0N/A
0N/A cond.codeBranch(env, ctx, asm, l1, false);
0N/A left.codeValue(env, ctx, asm);
0N/A asm.add(where, opc_goto, l2);
0N/A asm.add(l1);
0N/A right.codeValue(env, ctx, asm);
0N/A asm.add(l2);
0N/A }
0N/A public void code(Environment env, Context ctx, Assembler asm) {
0N/A Label l1 = new Label();
0N/A cond.codeBranch(env, ctx, asm, l1, false);
0N/A left.code(env, ctx, asm);
0N/A if (right != null) {
0N/A Label l2 = new Label();
0N/A asm.add(where, opc_goto, l2);
0N/A asm.add(l1);
0N/A right.code(env, ctx, asm);
0N/A asm.add(l2);
0N/A } else {
0N/A asm.add(l1);
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 cond.print(out);
0N/A out.print(" ");
0N/A left.print(out);
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}