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
|
/*******************************************************************************
* Copyright (c) 2014 Jeff Martin.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the GNU Public License v3.0
* which accompanies this distribution, and is available at
* http://www.gnu.org/licenses/gpl.html
*
* Contributors:
* Jeff Martin - initial API and implementation
******************************************************************************/
package cuchaz.enigma.convert;
import java.util.Arrays;
import java.util.Collections;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.jar.JarFile;
import com.beust.jcommander.internal.Lists;
import com.google.common.collect.BiMap;
import com.google.common.collect.HashMultimap;
import com.google.common.collect.Maps;
import com.google.common.collect.Multimap;
import cuchaz.enigma.Deobfuscator;
import cuchaz.enigma.analysis.JarIndex;
import cuchaz.enigma.convert.ClassNamer.SidedClassNamer;
import cuchaz.enigma.mapping.ClassEntry;
import cuchaz.enigma.mapping.ClassMapping;
import cuchaz.enigma.mapping.Mappings;
public class MappingsConverter {
public static Matches computeMatches(JarFile sourceJar, JarFile destJar, Mappings mappings) {
// index jars
System.out.println("Indexing source jar...");
JarIndex sourceIndex = new JarIndex();
sourceIndex.indexJar(sourceJar, false);
System.out.println("Indexing dest jar...");
JarIndex destIndex = new JarIndex();
destIndex.indexJar(destJar, false);
// compute the matching
ClassMatching matching = computeMatching(sourceJar, sourceIndex, destJar, destIndex, null);
return new Matches(matching.matches());
}
public static ClassMatching computeMatching(JarFile sourceJar, JarIndex sourceIndex, JarFile destJar, JarIndex destIndex, BiMap<ClassEntry,ClassEntry> knownMatches) {
System.out.println("Iteratively matching classes");
ClassMatching lastMatching = null;
int round = 0;
SidedClassNamer sourceNamer = null;
SidedClassNamer destNamer = null;
for (boolean useReferences : Arrays.asList(false, true)) {
int numUniqueMatchesLastTime = 0;
if (lastMatching != null) {
numUniqueMatchesLastTime = lastMatching.uniqueMatches().size();
}
while (true) {
System.out.println("Round " + (++round) + "...");
// init the matching with identity settings
ClassMatching matching = new ClassMatching(
new ClassIdentifier(sourceJar, sourceIndex, sourceNamer, useReferences),
new ClassIdentifier(destJar, destIndex, destNamer, useReferences)
);
if (knownMatches != null) {
matching.addKnownMatches(knownMatches);
}
if (lastMatching == null) {
// search all classes
matching.match(sourceIndex.getObfClassEntries(), destIndex.getObfClassEntries());
} else {
// we already know about these matches from last time
matching.addKnownMatches(lastMatching.uniqueMatches());
// search unmatched and ambiguously-matched classes
matching.match(lastMatching.unmatchedSourceClasses(), lastMatching.unmatchedDestClasses());
for (ClassMatch match : lastMatching.ambiguousMatches()) {
matching.match(match.sourceClasses, match.destClasses);
}
}
System.out.println(matching);
BiMap<ClassEntry,ClassEntry> uniqueMatches = matching.uniqueMatches();
// did we match anything new this time?
if (uniqueMatches.size() > numUniqueMatchesLastTime) {
numUniqueMatchesLastTime = uniqueMatches.size();
lastMatching = matching;
} else {
break;
}
// update the namers
ClassNamer namer = new ClassNamer(uniqueMatches);
sourceNamer = namer.getSourceNamer();
destNamer = namer.getDestNamer();
}
}
return lastMatching;
}
public static Mappings newMappings(Matches matches, Mappings oldMappings, Deobfuscator sourceDeobfuscator, Deobfuscator destDeobfuscator) {
// sort the unique matches by size of inner class chain
Multimap<Integer,Entry<ClassEntry,ClassEntry>> matchesByDestChainSize = HashMultimap.create();
for (Entry<ClassEntry,ClassEntry> match : matches.getUniqueMatches().entrySet()) {
int chainSize = destDeobfuscator.getJarIndex().getObfClassChain(match.getValue()).size();
matchesByDestChainSize.put(chainSize, match);
}
// build the mappings (in order of small-to-large inner chains)
Mappings newMappings = new Mappings();
List<Integer> chainSizes = Lists.newArrayList(matchesByDestChainSize.keySet());
Collections.sort(chainSizes);
for (int chainSize : chainSizes) {
for (Entry<ClassEntry,ClassEntry> match : matchesByDestChainSize.get(chainSize)) {
// get class info
ClassEntry sourceClassEntry = match.getKey();
ClassEntry deobfClassEntry = sourceDeobfuscator.deobfuscateEntry(sourceClassEntry);
ClassEntry destClassEntry = match.getValue();
List<ClassEntry> destClassChain = destDeobfuscator.getJarIndex().getObfClassChain(destClassEntry);
// find out where to make the dest class mapping
if (destClassChain.size() == 1) {
// not an inner class, add directly to mappings
newMappings.addClassMapping(new ClassMapping(destClassEntry.getName(), deobfClassEntry.getName()));
} else {
// inner class, find the outer class mapping
ClassMapping destMapping = null;
for (int i=0; i<destClassChain.size()-1; i++) {
ClassEntry destChainClassEntry = destClassChain.get(i);
if (destMapping == null) {
destMapping = newMappings.getClassByObf(destChainClassEntry);
if (destMapping == null) {
destMapping = new ClassMapping(destChainClassEntry.getName());
newMappings.addClassMapping(destMapping);
}
} else {
destMapping = destMapping.getInnerClassByObf(destChainClassEntry.getInnerClassName());
if (destMapping == null) {
destMapping = new ClassMapping(destChainClassEntry.getName());
destMapping.addInnerClassMapping(destMapping);
}
}
}
String deobfName = deobfClassEntry.isInnerClass() ? deobfClassEntry.getInnerClassName() : deobfClassEntry.getSimpleName();
destMapping.addInnerClassMapping(new ClassMapping(destClassEntry.getName(), deobfName));
}
}
}
return newMappings;
}
public static void convertMappings(Mappings mappings, BiMap<ClassEntry,ClassEntry> changes) {
// sort the changes so classes are renamed in the correct order
// ie. if we have the mappings a->b, b->c, we have to apply b->c before a->b
LinkedHashMap<ClassEntry,ClassEntry> sortedChanges = Maps.newLinkedHashMap();
int numChangesLeft = changes.size();
while (!changes.isEmpty()) {
Iterator<Map.Entry<ClassEntry,ClassEntry>> iter = changes.entrySet().iterator();
while (iter.hasNext()) {
Map.Entry<ClassEntry,ClassEntry> change = iter.next();
if (changes.containsKey(change.getValue())) {
sortedChanges.put(change.getKey(), change.getValue());
iter.remove();
}
}
// did we remove any changes?
if (numChangesLeft - changes.size() > 0) {
// keep going
numChangesLeft = changes.size();
} else {
// can't sort anymore. There must be a loop
break;
}
}
if (!changes.isEmpty()) {
throw new Error("Unable to sort class changes! There must be a cycle.");
}
// convert the mappings in the correct class order
for (Map.Entry<ClassEntry,ClassEntry> entry : sortedChanges.entrySet()) {
mappings.renameObfClass(entry.getKey().getName(), entry.getValue().getName());
}
}
/* TODO: after we get a mapping, check to see that the other entries match
public static void checkMethods() {
// check the method matches
System.out.println("Checking methods...");
for (ClassMapping classMapping : mappings.classes()) {
ClassEntry classEntry = new ClassEntry(classMapping.getObfFullName());
for (MethodMapping methodMapping : classMapping.methods()) {
// skip constructors
if (methodMapping.getObfName().equals("<init>")) {
continue;
}
MethodEntry methodEntry = new MethodEntry(
classEntry,
methodMapping.getObfName(),
methodMapping.getObfSignature()
);
if (!destIndex.containsObfBehavior(methodEntry)) {
System.err.println("WARNING: method doesn't match: " + methodEntry);
// TODO: show methods if needed
// show the available methods
System.err.println("\tAvailable dest methods:");
CtClass c = destLoader.loadClass(classMapping.getObfFullName());
for (CtBehavior behavior : c.getDeclaredBehaviors()) {
System.err.println("\t\t" + EntryFactory.getBehaviorEntry(behavior));
}
System.err.println("\tAvailable source methods:");
c = sourceLoader.loadClass(matchedClassNames.inverse().get(classMapping.getObfFullName()));
for (CtBehavior behavior : c.getDeclaredBehaviors()) {
System.err.println("\t\t" + EntryFactory.getBehaviorEntry(behavior));
}
}
}
}
System.out.println("Done!");
}
*/
}
|
