forked from quarkusio/gizmo
-
Notifications
You must be signed in to change notification settings - Fork 0
/
EnumSwitchImpl.java
205 lines (176 loc) · 8.53 KB
/
EnumSwitchImpl.java
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
package io.quarkus.gizmo;
import static org.objectweb.asm.Opcodes.ACC_PRIVATE;
import static org.objectweb.asm.Opcodes.ACC_STATIC;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Objects;
import java.util.Set;
import java.util.function.Consumer;
import org.objectweb.asm.Label;
import org.objectweb.asm.MethodVisitor;
class EnumSwitchImpl<E extends Enum<E>> extends AbstractSwitch<E> implements Switch.EnumSwitch<E> {
private final Map<Integer, BytecodeCreatorImpl> ordinalToCaseBlocks;
public EnumSwitchImpl(ResultHandle value, Class<E> enumClass, BytecodeCreatorImpl enclosing) {
super(enclosing);
this.ordinalToCaseBlocks = new LinkedHashMap<>();
MethodDescriptor enumOrdinal = MethodDescriptor.ofMethod(enumClass, "ordinal", int.class);
ResultHandle ordinal = invokeVirtualMethod(enumOrdinal, value);
// Generate the int[] switch table needed for binary compatibility
ResultHandle switchTable;
MethodCreatorImpl methodCreator = findMethodCreator(enclosing);
if (methodCreator != null) {
// Generate a static method that returns the switch table
char sep = '$';
ClassCreator classCreator = methodCreator.getClassCreator();
// $GIZMO_SWITCH_TABLE$org$acme$MyEnum()
StringBuilder methodName = new StringBuilder();
methodName.append(sep).append("GIZMO_SWITCH_TABLE");
for (String part : enumClass.getName().split("\\.")) {
methodName.append(sep).append(part);
}
MethodDescriptor gizmoSwitchTableDescriptor = MethodDescriptor.ofMethod(classCreator.getClassName(),
methodName.toString(), int[].class);
if (!classCreator.getExistingMethods()
.contains(gizmoSwitchTableDescriptor)) {
MethodCreator gizmoSwitchTable = classCreator.getMethodCreator(gizmoSwitchTableDescriptor)
.setModifiers(ACC_PRIVATE | ACC_STATIC);
gizmoSwitchTable.returnValue(generateSwitchTable(enumClass, gizmoSwitchTable, enumOrdinal));
}
switchTable = invokeStaticMethod(gizmoSwitchTableDescriptor);
} else {
// This is suboptimal - the switch table is generated for each switch construct
switchTable = generateSwitchTable(enumClass, methodCreator, enumOrdinal);
}
ResultHandle effectiveOrdinal = readArrayValue(switchTable, ordinal);
Set<ResultHandle> inputHandles = new HashSet<>();
inputHandles.add(effectiveOrdinal);
operations.add(new Operation() {
@Override
void writeBytecode(MethodVisitor methodVisitor) {
E[] constants = enumClass.getEnumConstants();
Map<Integer, Label> ordinalToLabel = new HashMap<>();
List<BytecodeCreatorImpl> caseBlocks = new ArrayList<>();
// Initialize the case blocks
for (Entry<Integer, BytecodeCreatorImpl> caseEntry : ordinalToCaseBlocks.entrySet()) {
BytecodeCreatorImpl caseBlock = caseEntry.getValue();
if (caseBlock != null && !fallThrough) {
caseBlock.breakScope(EnumSwitchImpl.this);
} else if (caseBlock == null) {
// Add empty fall through block
caseBlock = new BytecodeCreatorImpl(EnumSwitchImpl.this);
caseEntry.setValue(caseBlock);
}
caseBlocks.add(caseBlock);
ordinalToLabel.put(caseEntry.getKey(), caseBlock.getTop());
}
int min = ordinalToLabel.keySet().stream().mapToInt(Integer::intValue).min().orElse(0);
int max = ordinalToLabel.keySet().stream().mapToInt(Integer::intValue).max().orElse(0);
// Add empty blocks for missing ordinals
// This would be suboptimal for cases if there is a large number of missing ordinals
for (int i = 0; i < constants.length; i++) {
if (i >= min && i <= max) {
if (ordinalToLabel.get(i) == null) {
BytecodeCreatorImpl emptyCaseBlock = new BytecodeCreatorImpl(EnumSwitchImpl.this);
caseBlocks.add(emptyCaseBlock);
ordinalToLabel.put(i, emptyCaseBlock.getTop());
}
}
}
// Load the ordinal of the tested value
loadResultHandle(methodVisitor, effectiveOrdinal, EnumSwitchImpl.this, "I");
int[] ordinals = ordinalToLabel.keySet().stream().mapToInt(Integer::intValue).sorted().toArray();
Label[] labels = new Label[ordinals.length];
for (int i = 0; i < ordinals.length; i++) {
labels[i] = ordinalToLabel.get(ordinals[i]);
}
methodVisitor.visitTableSwitchInsn(min, max, defaultBlock.getTop(), labels);
// Write the case blocks
for (BytecodeCreatorImpl caseBlock : caseBlocks) {
caseBlock.writeOperations(methodVisitor);
}
// Write the default block
defaultBlock.writeOperations(methodVisitor);
}
@Override
ResultHandle getTopResultHandle() {
return null;
}
@Override
ResultHandle getOutgoingResultHandle() {
return null;
}
@Override
Set<ResultHandle> getInputResultHandles() {
return inputHandles;
}
});
}
@Override
public void caseOf(E value, Consumer<BytecodeCreator> caseBlockConsumer) {
Objects.requireNonNull(value);
Objects.requireNonNull(caseBlockConsumer);
addCaseBlock(value, caseBlockConsumer);
}
@Override
public void caseOf(List<E> values, Consumer<BytecodeCreator> caseBlockConsumer) {
Objects.requireNonNull(values);
Objects.requireNonNull(caseBlockConsumer);
for (Iterator<E> it = values.iterator(); it.hasNext();) {
E e = it.next();
if (it.hasNext()) {
addCaseBlock(e, null);
} else {
addCaseBlock(e, caseBlockConsumer);
}
}
}
@Override
void findActiveResultHandles(final Set<ResultHandle> handlesToAllocate) {
super.findActiveResultHandles(handlesToAllocate);
for (BytecodeCreatorImpl caseBlock : ordinalToCaseBlocks.values()) {
if (caseBlock != null) {
caseBlock.findActiveResultHandles(handlesToAllocate);
}
}
defaultBlock.findActiveResultHandles(handlesToAllocate);
}
private void addCaseBlock(E value, Consumer<BytecodeCreator> caseBlockConsumer) {
int ordinal = value.ordinal();
if (ordinalToCaseBlocks.containsKey(ordinal)) {
throw new IllegalArgumentException("A case block for the enum value [" + value + "] already exists");
}
BytecodeCreatorImpl caseBlock = null;
if (caseBlockConsumer != null) {
caseBlock = new BytecodeCreatorImpl(this);
caseBlockConsumer.accept(caseBlock);
}
ordinalToCaseBlocks.put(ordinal, caseBlock);
}
private MethodCreatorImpl findMethodCreator(BytecodeCreatorImpl enclosing) {
if (enclosing instanceof MethodCreatorImpl) {
return (MethodCreatorImpl) enclosing;
}
if (enclosing.getOwner() != null) {
return findMethodCreator(enclosing.getOwner());
}
return null;
}
private ResultHandle generateSwitchTable(Class<E> enumClass, BytecodeCreator bytecodeCreator,
MethodDescriptor enumOrdinal) {
E[] constants = enumClass.getEnumConstants();
ResultHandle switchTable = bytecodeCreator.newArray(int.class, constants.length);
for (int i = 0; i < constants.length; i++) {
ResultHandle currentConstant = bytecodeCreator
.readStaticField(FieldDescriptor.of(enumClass, constants[i].name(), enumClass));
ResultHandle currentOrdinal = bytecodeCreator.invokeVirtualMethod(enumOrdinal, currentConstant);
bytecodeCreator.writeArrayValue(switchTable, i, currentOrdinal);
}
return switchTable;
}
}