1 | |
|
2 | |
|
3 | |
|
4 | |
|
5 | |
|
6 | |
|
7 | |
|
8 | |
|
9 | |
|
10 | |
|
11 | |
|
12 | |
|
13 | |
|
14 | |
|
15 | |
|
16 | |
|
17 | |
package org.apache.commons.javaflow.bytecode.transformation.asm; |
18 | |
|
19 | |
import java.util.ArrayList; |
20 | |
import java.util.HashMap; |
21 | |
import java.util.Iterator; |
22 | |
import java.util.List; |
23 | |
import java.util.Map; |
24 | |
import java.util.Set; |
25 | |
|
26 | |
|
27 | |
import org.objectweb.asm.ClassVisitor; |
28 | |
import org.objectweb.asm.Label; |
29 | |
import org.objectweb.asm.MethodVisitor; |
30 | |
import org.objectweb.asm.Opcodes; |
31 | |
import org.objectweb.asm.Type; |
32 | |
import org.objectweb.asm.tree.AbstractInsnNode; |
33 | |
import org.objectweb.asm.tree.InsnNode; |
34 | |
import org.objectweb.asm.tree.MethodInsnNode; |
35 | |
import org.objectweb.asm.tree.MethodNode; |
36 | |
import org.objectweb.asm.tree.VarInsnNode; |
37 | |
import org.objectweb.asm.tree.analysis.Analyzer; |
38 | |
import org.objectweb.asm.tree.analysis.AnalyzerException; |
39 | |
import org.objectweb.asm.tree.analysis.DataflowInterpreter; |
40 | |
import org.objectweb.asm.tree.analysis.DataflowValue; |
41 | |
import org.objectweb.asm.tree.analysis.Frame; |
42 | |
import org.objectweb.asm.tree.analysis.SimpleVerifier; |
43 | |
|
44 | |
|
45 | |
|
46 | |
|
47 | |
|
48 | |
|
49 | |
|
50 | |
public class ContinuationMethodAnalyzer extends MethodNode implements Opcodes { |
51 | |
protected final String className; |
52 | |
protected final ClassVisitor cv; |
53 | |
protected final MethodVisitor mv; |
54 | |
|
55 | 0 | protected final List labels = new ArrayList(); |
56 | 0 | protected final List nodes = new ArrayList(); |
57 | 0 | protected final List methods = new ArrayList(); |
58 | |
|
59 | |
protected Analyzer analyzer; |
60 | |
public int stackRecorderVar; |
61 | |
|
62 | |
|
63 | |
public ContinuationMethodAnalyzer(String className, ClassVisitor cv, |
64 | |
MethodVisitor mv, int access, String name, String desc, String signature, String[] exceptions) { |
65 | 0 | super(access, name, desc, signature, exceptions); |
66 | 0 | this.className = className; |
67 | 0 | this.cv = cv; |
68 | 0 | this.mv = mv; |
69 | 0 | } |
70 | |
|
71 | |
public void visitMethodInsn(int opcode, String owner, String name, String desc) { |
72 | 0 | MethodInsnNode mnode = new MethodInsnNode(opcode, owner, name, desc); |
73 | 0 | if (opcode == INVOKESPECIAL || "<init>".equals(name)) { |
74 | 0 | methods.add(mnode); |
75 | |
} |
76 | 0 | if (needsFrameGuard(opcode, owner, name, desc) ) { |
77 | 0 | Label label = new Label(); |
78 | 0 | super.visitLabel(label); |
79 | 0 | labels.add(label); |
80 | 0 | nodes.add(mnode); |
81 | |
} |
82 | 0 | instructions.add(mnode); |
83 | 0 | } |
84 | |
|
85 | |
public void visitEnd() { |
86 | 0 | if (instructions.size() == 0 || labels.size() == 0) { |
87 | 0 | accept(mv); |
88 | 0 | return; |
89 | |
} |
90 | |
|
91 | 0 | this.stackRecorderVar = maxLocals; |
92 | |
try { |
93 | 0 | moveNew(); |
94 | |
|
95 | |
|
96 | |
|
97 | |
|
98 | |
|
99 | |
|
100 | |
|
101 | |
|
102 | |
|
103 | |
|
104 | 0 | analyzer = new Analyzer(new SimpleVerifier() { |
105 | 0 | protected Class getClass(Type t) { |
106 | |
try { |
107 | 0 | if (t.getSort() == Type.ARRAY) { |
108 | 0 | return Class.forName(t.getDescriptor().replace('/', '.'), true, Thread.currentThread().getContextClassLoader()); |
109 | |
} |
110 | 0 | return Class.forName(t.getClassName(), true, Thread.currentThread().getContextClassLoader()); |
111 | 0 | } catch (ClassNotFoundException e) { |
112 | 0 | throw new RuntimeException(e.toString()); |
113 | |
} |
114 | |
} |
115 | |
}); |
116 | 0 | analyzer.analyze(className, this); |
117 | 0 | accept(new ContinuationMethodAdapter(this)); |
118 | |
|
119 | 0 | } catch (AnalyzerException ex) { |
120 | |
|
121 | 0 | ex.printStackTrace(); |
122 | 0 | accept(mv); |
123 | |
|
124 | 0 | } |
125 | 0 | } |
126 | |
|
127 | |
void moveNew() throws AnalyzerException { |
128 | 0 | DataflowInterpreter i = new DataflowInterpreter(); |
129 | 0 | Analyzer a = new Analyzer(i); |
130 | 0 | a.analyze(className, this); |
131 | |
|
132 | 0 | HashMap movable = new HashMap(); |
133 | |
|
134 | 0 | Frame[] frames = a.getFrames(); |
135 | 0 | for (int j = 0; j < methods.size(); j++) { |
136 | 0 | MethodInsnNode mnode = (MethodInsnNode) methods.get(j); |
137 | |
|
138 | 0 | int n = a.getIndex(mnode); |
139 | 0 | Frame f = frames[n]; |
140 | 0 | Type[] args = Type.getArgumentTypes(mnode.desc); |
141 | |
|
142 | 0 | DataflowValue v = (DataflowValue) f.getStack(f.getStackSize() - args.length - 1); |
143 | 0 | Set insns = v.insns; |
144 | 0 | for (Iterator it = insns.iterator(); it.hasNext();) { |
145 | 0 | AbstractInsnNode ins = (AbstractInsnNode) it.next(); |
146 | 0 | if (ins.getOpcode() == NEW) { |
147 | 0 | movable.put(ins, mnode); |
148 | 0 | } else { |
149 | |
|
150 | 0 | int n1 = a.getIndex(ins); |
151 | 0 | if (ins.getOpcode() == DUP) { |
152 | 0 | AbstractInsnNode ins1 = (AbstractInsnNode) instructions.get(n1 - 1); |
153 | 0 | if (ins1.getOpcode() == NEW) { |
154 | 0 | movable.put(ins1, mnode); |
155 | |
} |
156 | 0 | } else if (ins.getOpcode() == SWAP) { |
157 | 0 | AbstractInsnNode ins1 = (AbstractInsnNode) instructions.get(n1 - 1); |
158 | 0 | AbstractInsnNode ins2 = (AbstractInsnNode) instructions.get(n1 - 2); |
159 | 0 | if (ins1.getOpcode() == DUP_X1 && ins2.getOpcode() == NEW) { |
160 | 0 | movable.put(ins2, mnode); |
161 | |
} |
162 | |
} |
163 | |
} |
164 | 0 | } |
165 | |
} |
166 | |
|
167 | 0 | int updateMaxStack = 0; |
168 | 0 | for (Iterator it = movable.entrySet().iterator(); it.hasNext();) { |
169 | 0 | Map.Entry e = (Map.Entry) it.next(); |
170 | 0 | AbstractInsnNode node1 = (AbstractInsnNode) e.getKey(); |
171 | 0 | int n1 = instructions.indexOf(node1); |
172 | 0 | AbstractInsnNode node2 = (AbstractInsnNode) instructions.get(n1 + 1); |
173 | 0 | AbstractInsnNode node3 = (AbstractInsnNode) instructions.get(n1 + 2); |
174 | 0 | int producer = node2.getOpcode(); |
175 | |
|
176 | 0 | instructions.remove(node1); |
177 | 0 | boolean requireDup = false; |
178 | 0 | if (producer == DUP) { |
179 | 0 | instructions.remove(node2); |
180 | 0 | requireDup = true; |
181 | 0 | } else if (producer == DUP_X1) { |
182 | 0 | instructions.remove(node2); |
183 | 0 | instructions.remove(node3); |
184 | 0 | requireDup = true; |
185 | |
} |
186 | |
|
187 | 0 | MethodInsnNode mnode = (MethodInsnNode) e.getValue(); |
188 | 0 | int nm = instructions.indexOf(mnode); |
189 | |
|
190 | 0 | int varOffset = stackRecorderVar + 1; |
191 | 0 | Type[] args = Type.getArgumentTypes(mnode.desc); |
192 | |
|
193 | |
|
194 | 0 | if (args.length == 0) { |
195 | 0 | instructions.add(nm++, node1); |
196 | 0 | if (requireDup) { |
197 | 0 | instructions.add(nm++, new InsnNode(DUP)); |
198 | 0 | } |
199 | |
continue; |
200 | |
} |
201 | |
|
202 | 0 | if (args.length == 1 && args[0].getSize() == 1) { |
203 | 0 | instructions.add(nm++, node1); |
204 | 0 | if (requireDup) { |
205 | 0 | instructions.add(nm++, new InsnNode(DUP)); |
206 | 0 | instructions.add(nm++, new InsnNode(DUP2_X1)); |
207 | 0 | instructions.add(nm++, new InsnNode(POP2)); |
208 | 0 | updateMaxStack = updateMaxStack < 2 ? 2 : updateMaxStack; |
209 | 0 | } else { |
210 | 0 | instructions.add(nm++, new InsnNode(SWAP)); |
211 | |
} |
212 | 0 | continue; |
213 | |
} |
214 | |
|
215 | |
|
216 | 0 | if ((args.length == 1 && args[0].getSize() == 2) || |
217 | |
(args.length == 2 && args[0].getSize() == 1 && args[1].getSize() == 1)) { |
218 | 0 | instructions.add(nm++, node1); |
219 | 0 | if (requireDup) { |
220 | 0 | instructions.add(nm++, new InsnNode(DUP)); |
221 | 0 | instructions.add(nm++, new InsnNode(DUP2_X2)); |
222 | 0 | instructions.add(nm++, new InsnNode(POP2)); |
223 | 0 | updateMaxStack = updateMaxStack < 2 ? 2 : updateMaxStack; |
224 | 0 | } else { |
225 | 0 | instructions.add(nm++, new InsnNode(DUP_X2)); |
226 | 0 | instructions.add(nm++, new InsnNode(POP)); |
227 | 0 | updateMaxStack = updateMaxStack < 1 ? 1 : updateMaxStack; |
228 | |
} |
229 | 0 | continue; |
230 | |
} |
231 | |
|
232 | |
|
233 | |
|
234 | 0 | for (int j = args.length - 1; j >= 0; j--) { |
235 | 0 | Type type = args[j]; |
236 | 0 | instructions.add(nm++, new VarInsnNode(type.getOpcode(ISTORE), varOffset)); |
237 | 0 | varOffset += type.getSize(); |
238 | |
} |
239 | 0 | if (varOffset > maxLocals) { |
240 | 0 | maxLocals = varOffset; |
241 | |
} |
242 | |
|
243 | 0 | instructions.add(nm++, node1); |
244 | 0 | if (requireDup) { |
245 | 0 | instructions.add(nm++, new InsnNode(DUP)); |
246 | |
} |
247 | |
|
248 | |
|
249 | 0 | for (int j = 0; j < args.length; j++) { |
250 | 0 | Type type = args[j]; |
251 | 0 | varOffset -= type.getSize(); |
252 | 0 | instructions.add(nm++, new VarInsnNode(type.getOpcode(ILOAD), varOffset)); |
253 | |
|
254 | 0 | if (type.getSort() == Type.OBJECT || type.getSort() == Type.ARRAY) { |
255 | 0 | updateMaxStack = updateMaxStack < 1 ? 1 : updateMaxStack; |
256 | 0 | instructions.add(nm++, new InsnNode(ACONST_NULL)); |
257 | 0 | instructions.add(nm++, new VarInsnNode(type.getOpcode(ISTORE), varOffset)); |
258 | |
} |
259 | |
} |
260 | 0 | } |
261 | |
|
262 | 0 | maxStack += updateMaxStack; |
263 | 0 | } |
264 | |
|
265 | |
|
266 | |
boolean needsFrameGuard(int opcode, String owner, String name, String desc) { |
267 | 0 | if (opcode == Opcodes.INVOKEINTERFACE || |
268 | |
(opcode == Opcodes.INVOKESPECIAL && !"<init>".equals(name)) || |
269 | |
opcode == Opcodes.INVOKESTATIC || |
270 | |
opcode == Opcodes.INVOKEVIRTUAL) { |
271 | 0 | return true; |
272 | |
} |
273 | 0 | return false; |
274 | |
} |
275 | |
|
276 | |
} |