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
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
|
/*
* Copyright (c) 2022, 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.
*
* 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.
*/
/*
* @test
* @bug 8289106 8293627
* @summary Tests of AccessFlag.locations(ClassFileFormatVersion)
*/
import java.lang.reflect.AccessFlag;
import static java.lang.reflect.AccessFlag.*;
import java.lang.reflect.ClassFileFormatVersion;
import java.util.HashSet;
import java.util.Set;
/*
* There are several patterns of access flag applicability. First, an
* access flag can be applied to the same set of locations for each
* class file format version. This is "invariant" usage. Second, an
* access flag can be defined for version N, therefore inapplicable
* for earlier versions, and then applied to the same locations for
* all subsequent versions. This is "step" usage. Finally, an access
* flag to have a more complicated pattern, having multiple steps of
* being allowed at more locations or even having locations removed if
* the access flag is retired.
*
* List of access flags and how they are tested:
*
* PUBLIC step
* PRIVATE step
* PROTECTED step
* STATIC step
* FINAL two-step
* SUPER invariant
* OPEN step
* TRANSITIVE step
* SYNCHRONIZED invariant
* STATIC_PHASE step
* VOLATILE invariant
* BRIDGE step
* TRANSIENT invariant
* VARARGS step
* NATIVE invariant
* INTERFACE step
* ABSTRACT step
* STRICT other
* SYNTHETIC other (three-step)
* ANNOTATION step
* ENUM step
* MANDATED two-step
* MODULE step
*/
public class VersionedLocationsTest {
public static void main(String... args) throws Exception {
testInvariantAccessFlags();
testStepFunctionAccessFlags();
testTwoStepAccessFlags();
testSynthetic();
testStrict();
testLatestMatch();
}
/**
* Invariant access flags have the same set of locations for each
* class file format version.
*/
private static void testInvariantAccessFlags() {
Set<AccessFlag> invariantAccessFlags =
Set.of(SUPER, SYNCHRONIZED, VOLATILE, TRANSIENT, NATIVE);
for(var accessFlag : invariantAccessFlags) {
Set<AccessFlag.Location> expected = accessFlag.locations();
for(var cffv : ClassFileFormatVersion.values()) {
compareLocations(accessFlag.locations(), accessFlag, cffv);
}
}
}
private static void testStepFunctionAccessFlags() {
StepFunctionTC[] testCases = {
new StepFunctionTC(PUBLIC,
removeInnerClass(PUBLIC.locations()),
ClassFileFormatVersion.RELEASE_1),
new StepFunctionTC(PRIVATE,
removeInnerClass(PRIVATE.locations()),
ClassFileFormatVersion.RELEASE_1),
new StepFunctionTC(PROTECTED,
removeInnerClass(PROTECTED.locations()),
ClassFileFormatVersion.RELEASE_1),
new StepFunctionTC(STATIC,
removeInnerClass(STATIC.locations()),
ClassFileFormatVersion.RELEASE_1),
new StepFunctionTC(OPEN,
Set.of(),
ClassFileFormatVersion.RELEASE_9),
new StepFunctionTC(TRANSITIVE,
Set.of(),
ClassFileFormatVersion.RELEASE_9),
new StepFunctionTC(STATIC_PHASE,
Set.of(),
ClassFileFormatVersion.RELEASE_9),
new StepFunctionTC(BRIDGE,
Set.of(),
ClassFileFormatVersion.RELEASE_5),
new StepFunctionTC(VARARGS,
Set.of(),
ClassFileFormatVersion.RELEASE_5),
new StepFunctionTC(INTERFACE,
removeInnerClass(INTERFACE.locations()),
ClassFileFormatVersion.RELEASE_1),
new StepFunctionTC(ABSTRACT,
removeInnerClass(ABSTRACT.locations()),
ClassFileFormatVersion.RELEASE_1),
new StepFunctionTC(ANNOTATION,
Set.of(),
ClassFileFormatVersion.RELEASE_5),
new StepFunctionTC(ENUM,
Set.of(),
ClassFileFormatVersion.RELEASE_5),
new StepFunctionTC(MODULE,
Set.of(),
ClassFileFormatVersion.RELEASE_9)
};
for (var testCase : testCases) {
for (var cffv : ClassFileFormatVersion.values()) {
compareLocations(cffv.compareTo(testCase.transition()) >= 0 ?
testCase.finalLocs() :
testCase.initialLocs(),
testCase.accessFlag, cffv);
}
}
}
private static void compareLocations(Set<AccessFlag.Location> expected,
AccessFlag accessFlag,
ClassFileFormatVersion cffv) {
var actual = accessFlag.locations(cffv);
if (!expected.equals(actual)) {
throw new RuntimeException("Unexpected locations for " +
accessFlag + " on " + cffv + "\n" +
"Expected " + expected + "; got \t" + actual);
}
}
private static Set<AccessFlag.Location> removeInnerClass(Set<AccessFlag.Location> locations) {
var s = new HashSet<>(locations);
s.remove(Location.INNER_CLASS);
return s;
}
private record StepFunctionTC(AccessFlag accessFlag,
Set<AccessFlag.Location> initialLocs,
ClassFileFormatVersion transition) {
public Set<AccessFlag.Location> finalLocs() {
return accessFlag.locations();
}
}
private record TwoStepFunctionTC(AccessFlag accessFlag,
Set<AccessFlag.Location> initialLocs,
ClassFileFormatVersion transition1,
Set<AccessFlag.Location> firstLocs,
ClassFileFormatVersion transition2) {
public Set<AccessFlag.Location> secondLocs() {
return accessFlag.locations();
}
}
private static void testTwoStepAccessFlags() {
TwoStepFunctionTC[] testCases = {
new TwoStepFunctionTC(FINAL,
Set.of(Location.CLASS, Location.FIELD, Location.METHOD),
ClassFileFormatVersion.RELEASE_1,
Set.of(Location.CLASS, Location.FIELD, Location.METHOD, Location.INNER_CLASS),
ClassFileFormatVersion.RELEASE_8),
new TwoStepFunctionTC(MANDATED,
Set.of(),
ClassFileFormatVersion.RELEASE_8,
Set.of(Location.METHOD_PARAMETER),
ClassFileFormatVersion.RELEASE_9),
};
for (var testCase : testCases) {
for (var cffv : ClassFileFormatVersion.values()) {
var transition1 = testCase.transition1();
var transition2 = testCase.transition2();
Set<AccessFlag.Location> expected;
if (cffv.compareTo(transition1) < 0) {
expected = testCase.initialLocs();
} else if (cffv.compareTo(transition1) >= 0 &&
cffv.compareTo(transition2) < 0) {
expected = testCase.firstLocs();
} else { // cffv >= transition2
expected = testCase.secondLocs();
}
compareLocations(expected, testCase.accessFlag(), cffv);
}
}
}
private static void testSynthetic() {
for (var cffv : ClassFileFormatVersion.values()) {
Set<AccessFlag.Location> expected;
if (cffv.compareTo(ClassFileFormatVersion.RELEASE_6) <= 0) {
expected = Set.of();
} else {
expected =
switch(cffv) {
case RELEASE_7 -> Set.of(Location.CLASS, Location.FIELD,
Location.METHOD,
Location.INNER_CLASS);
case RELEASE_8 -> Set.of(Location.CLASS, Location.FIELD,
Location.METHOD,
Location.INNER_CLASS,
Location.METHOD_PARAMETER);
default -> SYNTHETIC.locations();
};
}
compareLocations(expected, SYNTHETIC, cffv);
}
}
private static void testStrict() {
for (var cffv : ClassFileFormatVersion.values()) {
Set<AccessFlag.Location> expected =
(cffv.compareTo(ClassFileFormatVersion.RELEASE_2) >= 0 &&
cffv.compareTo(ClassFileFormatVersion.RELEASE_16) <= 0) ?
Set.of(Location.METHOD) :
Set.of();
compareLocations(expected, STRICT, cffv);
}
}
private static void testLatestMatch() {
// Verify accessFlag.locations() and
// accessFlag.locations(ClassFileFormatVersion.latest()) are
// consistent
var LATEST = ClassFileFormatVersion.latest();
for (var accessFlag : AccessFlag.values()) {
var locationSet = accessFlag.locations();
var locationLatestSet = accessFlag.locations(LATEST);
if (!locationSet.equals(locationLatestSet)) {
throw new RuntimeException("Unequal location sets for " + accessFlag);
}
}
}
}
|
