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 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 BinaryAssignExpression extends BinaryExpression {
0N/A Expression implementation;
0N/A
0N/A /**
0N/A * Constructor
0N/A */
0N/A BinaryAssignExpression(int op, long where, Expression left, Expression right) {
0N/A super(op, where, left.type, left, right);
0N/A }
0N/A
0N/A public Expression getImplementation() {
0N/A if (implementation != null)
0N/A return implementation;
0N/A return this;
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 void expression
0N/A */
0N/A public Vset check(Environment env, Context ctx, Vset vset, Hashtable exp) {
0N/A return checkValue(env, ctx, vset, exp);
0N/A }
0N/A
0N/A /**
0N/A * Inline
0N/A */
0N/A public Expression inline(Environment env, Context ctx) {
0N/A if (implementation != null)
0N/A return implementation.inline(env, ctx);
0N/A return inlineValue(env, ctx);
0N/A }
0N/A public Expression inlineValue(Environment env, Context ctx) {
0N/A if (implementation != null)
0N/A return implementation.inlineValue(env, ctx);
0N/A left = left.inlineLHS(env, ctx);
0N/A right = right.inlineValue(env, ctx);
0N/A return this;
0N/A }
0N/A
0N/A public Expression copyInline(Context ctx) {
0N/A if (implementation != null)
0N/A return implementation.copyInline(ctx);
0N/A return super.copyInline(ctx);
0N/A }
0N/A
0N/A public int costInline(int thresh, Environment env, Context ctx) {
0N/A if (implementation != null)
0N/A return implementation.costInline(thresh, env, ctx);
0N/A return super.costInline(thresh, env, ctx);
0N/A }
0N/A}