1 /*
2  * Copyright (c) 1994, 2003, Oracle and/or its affiliates. All rights reserved.
3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4  *
5  * This code is free software; you can redistribute it and/or modify it
6  * under the terms of the GNU General Public License version 2 only, as
7  * published by the Free Software Foundation.  Oracle designates this
8  * particular file as subject to the "Classpath" exception as provided
9  * by Oracle in the LICENSE file that accompanied this code.
10  *
11  * This code is distributed in the hope that it will be useful, but WITHOUT
12  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
14  * version 2 for more details (a copy is included in the LICENSE file that
15  * accompanied this code).
16  *
17  * You should have received a copy of the GNU General Public License version
18  * 2 along with this work; if not, write to the Free Software Foundation,
19  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20  *
21  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22  * or visit www.oracle.com if you need additional information or have any
23  * questions.
24  */
25 
26 package sun.tools.tree;
27 
28 import sun.tools.java.*;
29 import sun.tools.asm.Assembler;
30 import java.util.Hashtable;
31 
32 /**
33  * WARNING: The contents of this source file are not part of any
34  * supported API.  Code that depends on them does so at its own risk:
35  * they are subject to change or removal without notice.
36  */
37 public
38 class BinaryAssignExpression extends BinaryExpression {
39     Expression implementation;
40 
41     /**
42      * Constructor
43      */
BinaryAssignExpression(int op, long where, Expression left, Expression right)44     BinaryAssignExpression(int op, long where, Expression left, Expression right) {
45         super(op, where, left.type, left, right);
46     }
47 
getImplementation()48     public Expression getImplementation() {
49         if (implementation != null)
50             return implementation;
51         return this;
52     }
53 
54     /**
55      * Order the expression based on precedence
56      */
order()57     public Expression order() {
58         if (precedence() >= left.precedence()) {
59             UnaryExpression e = (UnaryExpression)left;
60             left = e.right;
61             e.right = order();
62             return e;
63         }
64         return this;
65     }
66 
67     /**
68      * Check void expression
69      */
check(Environment env, Context ctx, Vset vset, Hashtable<Object,Object> exp)70     public Vset check(Environment env, Context ctx, Vset vset, Hashtable<Object,Object> exp) {
71         return checkValue(env, ctx, vset, exp);
72     }
73 
74     /**
75      * Inline
76      */
inline(Environment env, Context ctx)77     public Expression inline(Environment env, Context ctx) {
78         if (implementation != null)
79             return implementation.inline(env, ctx);
80         return inlineValue(env, ctx);
81     }
inlineValue(Environment env, Context ctx)82     public Expression inlineValue(Environment env, Context ctx) {
83         if (implementation != null)
84             return implementation.inlineValue(env, ctx);
85         left = left.inlineLHS(env, ctx);
86         right = right.inlineValue(env, ctx);
87         return this;
88     }
89 
copyInline(Context ctx)90     public Expression copyInline(Context ctx) {
91         if (implementation != null)
92             return implementation.copyInline(ctx);
93         return super.copyInline(ctx);
94     }
95 
costInline(int thresh, Environment env, Context ctx)96     public int costInline(int thresh, Environment env, Context ctx) {
97         if (implementation != null)
98             return implementation.costInline(thresh, env, ctx);
99         return super.costInline(thresh, env, ctx);
100     }
101 }
102