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
|
/*******************************************************************************
* Copyright (c) 2015 Jeff Martin.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the GNU Lesser General Public
* License v3.0 which accompanies this distribution, and is available at
* http://www.gnu.org/licenses/lgpl.html
* <p>
* Contributors:
* Jeff Martin - initial API and implementation
******************************************************************************/
package cuchaz.enigma.analysis;
import com.google.common.collect.HashMultimap;
import com.google.common.collect.Multimap;
import com.strobel.assembler.metadata.MemberReference;
import com.strobel.assembler.metadata.MethodReference;
import com.strobel.assembler.metadata.ParameterDefinition;
import com.strobel.assembler.metadata.TypeReference;
import com.strobel.decompiler.languages.TextLocation;
import com.strobel.decompiler.languages.java.ast.*;
import cuchaz.enigma.mapping.*;
import cuchaz.enigma.mapping.entry.*;
import java.util.HashMap;
import java.util.Map;
public class SourceIndexMethodVisitor extends SourceIndexVisitor {
private final ReferencedEntryPool entryPool;
private final ProcyonEntryFactory entryFactory;
private MethodDefEntry methodEntry;
// TODO: Really fix Procyon index problem with inner classes
private int argumentPosition;
private int localsPosition;
private Multimap<String, Identifier> unmatchedIdentifier = HashMultimap.create();
private Map<String, Entry> identifierEntryCache = new HashMap<>();
public SourceIndexMethodVisitor(ReferencedEntryPool entryPool, MethodDefEntry methodEntry, boolean isEnum) {
super(entryPool);
this.entryPool = entryPool;
this.entryFactory = new ProcyonEntryFactory(entryPool);
this.methodEntry = methodEntry;
this.argumentPosition = isEnum ? 2 : 0;
this.localsPosition = 0;
}
@Override
public Void visitInvocationExpression(InvocationExpression node, SourceIndex index) {
MemberReference ref = node.getUserData(Keys.MEMBER_REFERENCE);
// get the behavior entry
ClassEntry classEntry = entryPool.getClass(ref.getDeclaringType().getInternalName());
MethodEntry methodEntry = null;
if (ref instanceof MethodReference) {
methodEntry = entryPool.getMethod(classEntry, ref.getName(), ref.getErasedSignature());
}
if (methodEntry != null) {
// get the node for the token
AstNode tokenNode = null;
if (node.getTarget() instanceof MemberReferenceExpression) {
tokenNode = ((MemberReferenceExpression) node.getTarget()).getMemberNameToken();
} else if (node.getTarget() instanceof SuperReferenceExpression) {
tokenNode = node.getTarget();
} else if (node.getTarget() instanceof ThisReferenceExpression) {
tokenNode = node.getTarget();
}
if (tokenNode != null) {
index.addReference(tokenNode, methodEntry, this.methodEntry);
}
}
// Check for identifier
node.getArguments().stream().filter(expression -> expression instanceof IdentifierExpression)
.forEach(expression -> this.checkIdentifier((IdentifierExpression) expression, index));
return recurse(node, index);
}
@Override
public Void visitMemberReferenceExpression(MemberReferenceExpression node, SourceIndex index) {
MemberReference ref = node.getUserData(Keys.MEMBER_REFERENCE);
if (ref != null) {
// make sure this is actually a field
String erasedSignature = ref.getErasedSignature();
if (erasedSignature.indexOf('(') >= 0) {
throw new Error("Expected a field here! got " + ref);
}
ClassEntry classEntry = entryPool.getClass(ref.getDeclaringType().getInternalName());
FieldEntry fieldEntry = entryPool.getField(classEntry, ref.getName(), new TypeDescriptor(erasedSignature));
if (fieldEntry == null) {
throw new Error("Failed to find field " + ref.getName() + " on " + classEntry.getName());
}
index.addReference(node.getMemberNameToken(), fieldEntry, this.methodEntry);
}
return recurse(node, index);
}
@Override
public Void visitSimpleType(SimpleType node, SourceIndex index) {
TypeReference ref = node.getUserData(Keys.TYPE_REFERENCE);
if (node.getIdentifierToken().getStartLocation() != TextLocation.EMPTY) {
ClassEntry classEntry = entryPool.getClass(ref.getInternalName());
index.addReference(node.getIdentifierToken(), classEntry, this.methodEntry);
}
return recurse(node, index);
}
@Override
public Void visitParameterDeclaration(ParameterDeclaration node, SourceIndex index) {
ParameterDefinition def = node.getUserData(Keys.PARAMETER_DEFINITION);
if (def.getMethod() instanceof MemberReference && def.getMethod() instanceof MethodReference) {
MethodEntry methodEntry = entryFactory.getMethodEntry((MethodReference) def.getMethod());
LocalVariableEntry localVariableEntry = new LocalVariableEntry(methodEntry, argumentPosition++, node.getName());
Identifier identifier = node.getNameToken();
// cache the argument entry and the identifier
identifierEntryCache.put(identifier.getName(), localVariableEntry);
index.addDeclaration(identifier, localVariableEntry);
}
return recurse(node, index);
}
@Override
public Void visitIdentifierExpression(IdentifierExpression node, SourceIndex index) {
MemberReference ref = node.getUserData(Keys.MEMBER_REFERENCE);
if (ref != null) {
ClassEntry classEntry = entryPool.getClass(ref.getDeclaringType().getInternalName());
FieldEntry fieldEntry = entryPool.getField(classEntry, ref.getName(), new TypeDescriptor(ref.getErasedSignature()));
if (fieldEntry == null) {
throw new Error("Failed to find field " + ref.getName() + " on " + classEntry.getName());
}
index.addReference(node.getIdentifierToken(), fieldEntry, this.methodEntry);
} else
this.checkIdentifier(node, index);
return recurse(node, index);
}
private void checkIdentifier(IdentifierExpression node, SourceIndex index) {
if (identifierEntryCache.containsKey(node.getIdentifier())) // If it's in the argument cache, create a token!
index.addDeclaration(node.getIdentifierToken(), identifierEntryCache.get(node.getIdentifier()));
else
unmatchedIdentifier.put(node.getIdentifier(), node.getIdentifierToken()); // Not matched actually, put it!
}
private void addDeclarationToUnmatched(String key, SourceIndex index) {
Entry entry = identifierEntryCache.get(key);
// This cannot happened in theory
if (entry == null)
return;
for (Identifier identifier : unmatchedIdentifier.get(key))
index.addDeclaration(identifier, entry);
unmatchedIdentifier.removeAll(key);
}
@Override
public Void visitObjectCreationExpression(ObjectCreationExpression node, SourceIndex index) {
MemberReference ref = node.getUserData(Keys.MEMBER_REFERENCE);
if (ref != null) {
ClassEntry classEntry = entryPool.getClass(ref.getDeclaringType().getInternalName());
MethodEntry constructorEntry = entryPool.getMethod(classEntry, "<init>", ref.getErasedSignature());
if (node.getType() instanceof SimpleType) {
SimpleType simpleTypeNode = (SimpleType) node.getType();
index.addReference(simpleTypeNode.getIdentifierToken(), constructorEntry, this.methodEntry);
}
}
return recurse(node, index);
}
@Override
public Void visitForEachStatement(ForEachStatement node, SourceIndex index) {
if (node.getVariableType() instanceof SimpleType) {
Identifier identifier = node.getVariableNameToken();
LocalVariableEntry localVariableEntry = new LocalVariableEntry(methodEntry, argumentPosition + localsPosition++, identifier.getName());
identifierEntryCache.put(identifier.getName(), localVariableEntry);
addDeclarationToUnmatched(identifier.getName(), index);
index.addDeclaration(identifier, localVariableEntry);
}
return recurse(node, index);
}
@Override
public Void visitVariableDeclaration(VariableDeclarationStatement node, SourceIndex index) {
AstNodeCollection<VariableInitializer> variables = node.getVariables();
// Single assignation
if (variables.size() == 1) {
VariableInitializer initializer = variables.firstOrNullObject();
if (initializer != null && node.getType() instanceof SimpleType) {
Identifier identifier = initializer.getNameToken();
LocalVariableEntry localVariableEntry = new LocalVariableEntry(methodEntry, argumentPosition + localsPosition++, initializer.getName());
identifierEntryCache.put(identifier.getName(), localVariableEntry);
addDeclarationToUnmatched(identifier.getName(), index);
index.addDeclaration(identifier, localVariableEntry);
}
}
return recurse(node, index);
}
}
|
