1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
|
/*
* Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package jdk.nashorn.internal.ir;
import static jdk.nashorn.internal.parser.TokenType.BIT_NOT;
import static jdk.nashorn.internal.parser.TokenType.CONVERT;
import static jdk.nashorn.internal.parser.TokenType.DECPOSTFIX;
import static jdk.nashorn.internal.parser.TokenType.INCPOSTFIX;
import jdk.nashorn.internal.codegen.types.Type;
import jdk.nashorn.internal.ir.visitor.NodeVisitor;
import jdk.nashorn.internal.parser.Token;
import jdk.nashorn.internal.parser.TokenType;
import jdk.nashorn.internal.runtime.Source;
/**
* UnaryNode nodes represent single operand operations.
*/
public class UnaryNode extends Node implements Assignment<Node> {
/** Right hand side argument. */
private Node rhs;
/**
* Constructor
*
* @param source the source
* @param token token
* @param rhs expression
*/
public UnaryNode(final Source source, final long token, final Node rhs) {
super(source, token, Token.descPosition(token));
this.start = Math.min(rhs.getStart(), Token.descPosition(token));
this.finish = Math.max(Token.descPosition(token) + Token.descLength(token), rhs.getFinish());
this.rhs = rhs;
}
/**
* Copy constructor
*
* @param unaryNode source node
* @param cs copy state
*/
protected UnaryNode(final UnaryNode unaryNode, final CopyState cs) {
super(unaryNode);
this.rhs = cs.existingOrCopy(unaryNode.rhs);
}
/**
* Is this an assignment - i.e. that mutates something such as a++
*
* @return true if assignment
*/
@Override
public boolean isAssignment() {
switch (tokenType()) {
case DECPOSTFIX:
case DECPREFIX:
case INCPOSTFIX:
case INCPREFIX:
return true;
default:
return false;
}
}
@Override
public boolean isSelfModifying() {
return isAssignment();
}
@Override
public Type getWidestOperationType() {
return isAssignment() ? Type.NUMBER : Type.OBJECT;
}
@Override
public Node getAssignmentDest() {
return isAssignment() ? rhs() : null;
}
@Override
public Node setAssignmentDest(Node n) {
return setRHS(n);
}
@Override
public Node getAssignmentSource() {
return getAssignmentDest();
}
@Override
public boolean equals(final Object other) {
if (!super.equals(other)) {
return false;
}
return rhs.equals(((UnaryNode)other).rhs());
}
@Override
public int hashCode() {
return super.hashCode() ^ rhs().hashCode();
}
@Override
protected Node copy(final CopyState cs) {
return new UnaryNode(this, cs);
}
/**
* Assist in IR navigation.
* @param visitor IR navigating visitor.
*/
@Override
public Node accept(final NodeVisitor visitor) {
if (visitor.enterUnaryNode(this) != null) {
return visitor.leaveUnaryNode(setRHS(rhs.accept(visitor)));
}
return this;
}
@Override
public void toString(final StringBuilder sb) {
final TokenType type = tokenType();
final String name = type.getName();
final boolean isPostfix = type == DECPOSTFIX || type == INCPOSTFIX;
final boolean isConvert = type == CONVERT && getSymbol() != null;
boolean rhsParen = type.needsParens(rhs().tokenType(), false);
int convertPos = 0;
if (isConvert) {
convertPos = sb.length();
sb.append("(");
sb.append(getType());
sb.append(")(");
}
if (!isPostfix && !isConvert) {
if (name == null) {
sb.append(type.name());
rhsParen = true;
} else {
sb.append(name);
if (type.ordinal() > BIT_NOT.ordinal()) {
sb.append(' ');
}
}
}
if (rhsParen) {
sb.append('(');
}
rhs().toString(sb);
if (rhsParen) {
sb.append(')');
}
if (isPostfix) {
sb.append(type == DECPOSTFIX ? "--" : "++");
}
if (isConvert) {
// strip extra cast parenthesis which makes the printout harder to read
final boolean endsWithParenthesis = sb.charAt(sb.length() - 1) == ')';
if (!endsWithParenthesis) {
sb.append(')');
} else {
sb.setCharAt(convertPos, ' ');
}
}
}
/**
* Get the right hand side of this if it is inherited by a binary expression,
* or just the expression itself if still Unary
*
* @see BinaryNode
*
* @return right hand side or expression node
*/
public Node rhs() {
return rhs;
}
/**
* Reset the right hand side of this if it is inherited by a binary expression,
* or just the expression itself if still Unary
*
* @see BinaryNode
*
* @param rhs right hand side or expression node
* @return a node equivalent to this one except for the requested change.
*/
public UnaryNode setRHS(final Node rhs) {
if(this.rhs == rhs) return this;
final UnaryNode n = (UnaryNode)clone();
n.rhs = rhs;
return n;
}
}
|
