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
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
|
/*******************************************************************************
* 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.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.jar.JarFile;
import com.google.common.collect.ArrayListMultimap;
import com.google.common.collect.BiMap;
import com.google.common.collect.HashBiMap;
import com.google.common.collect.Lists;
import com.google.common.collect.Maps;
import com.google.common.collect.Multimap;
import com.google.common.collect.Sets;
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.MappingParseException;
import cuchaz.enigma.mapping.Mappings;
import cuchaz.enigma.mapping.MappingsReader;
import cuchaz.enigma.mapping.MappingsWriter;
import cuchaz.enigma.mapping.MethodEntry;
import cuchaz.enigma.mapping.MethodMapping;
public class ClassMatcher {
public static void main(String[] args)
throws IOException, MappingParseException {
// setup files
File home = new File(System.getProperty("user.home"));
JarFile sourceJar = new JarFile(new File(home, ".minecraft/versions/1.8/1.8.jar"));
JarFile destJar = new JarFile(new File(home, ".minecraft/versions/1.8.3/1.8.3.jar"));
File inMappingsFile = new File("../Enigma Mappings/1.8.mappings");
File outMappingsFile = new File("../Enigma Mappings/1.8.3.mappings");
// define a matching to use when the automated system cannot find a match
Map<String,String> fallbackMatching = Maps.newHashMap();
/*
fallbackMatching.put("none/ayb", "none/ayf");
fallbackMatching.put("none/ayd", "none/ayd");
fallbackMatching.put("none/bgk", "unknown/bgk");
*/
// do the conversion
Mappings mappings = new MappingsReader().read(new FileReader(inMappingsFile));
convertMappings(sourceJar, destJar, mappings, fallbackMatching);
// write out the converted mappings
FileWriter writer = new FileWriter(outMappingsFile);
new MappingsWriter().write(writer, mappings);
writer.close();
System.out.println("Wrote converted mappings to:\n\t" + outMappingsFile.getAbsolutePath());
}
private static void convertMappings(JarFile sourceJar, JarFile destJar, Mappings mappings, Map<String,String> fallbackMatching) {
// 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);
// get all the obf class names used in the mappings
Set<ClassEntry> usedClasses = Sets.newHashSet();
for (String className : mappings.getAllObfClassNames()) {
usedClasses.add(new ClassEntry(className));
}
System.out.println("Mappings reference " + usedClasses.size() + " classes");
// see what the used classes map to
BiMap<ClassEntry,ClassEntry> uniqueUsedMatches = HashBiMap.create();
Map<ClassEntry,ClassMatch> ambiguousUsedMatches = Maps.newHashMap();
Set<ClassEntry> unmatchedUsedClasses = Sets.newHashSet();
for (ClassMatch match : matching.matches()) {
Set<ClassEntry> matchUsedClasses = match.intersectSourceClasses(usedClasses);
if (matchUsedClasses.isEmpty()) {
continue;
}
// classify the match
if (!match.isMatched()) {
// unmatched
unmatchedUsedClasses.addAll(matchUsedClasses);
} else {
if (match.isAmbiguous()) {
// ambiguously matched
for (ClassEntry matchUsedClass : matchUsedClasses) {
ambiguousUsedMatches.put(matchUsedClass, match);
}
} else {
// uniquely matched
uniqueUsedMatches.put(match.getUniqueSource(), match.getUniqueDest());
}
}
}
// get unmatched dest classes
Set<ClassEntry> unmatchedDestClasses = Sets.newHashSet();
for (ClassMatch match : matching.matches()) {
if (!match.isMatched()) {
unmatchedDestClasses.addAll(match.destClasses);
}
}
// warn about the ambiguous used matches
if (ambiguousUsedMatches.size() > 0) {
System.out.println(String.format("%d source classes have ambiguous mappings", ambiguousUsedMatches.size()));
List<ClassMatch> ambiguousMatchesList = Lists.newArrayList(Sets.newHashSet(ambiguousUsedMatches.values()));
Collections.sort(ambiguousMatchesList, new Comparator<ClassMatch>() {
@Override
public int compare(ClassMatch a, ClassMatch b) {
String aName = a.sourceClasses.iterator().next().getName();
String bName = b.sourceClasses.iterator().next().getName();
return aName.compareTo(bName);
}
});
for (ClassMatch match : ambiguousMatchesList) {
System.out.println("Ambiguous matching:");
System.out.println("\tSource: " + getClassNames(match.sourceClasses));
System.out.println("\tDest: " + getClassNames(match.destClasses));
}
}
// warn about unmatched used classes
for (ClassEntry unmatchedUsedClass : unmatchedUsedClasses) {
System.out.println("No exact match for source class " + unmatchedUsedClass.getClassEntry());
// rank all the unmatched dest classes against the used class
ClassIdentity sourceIdentity = matching.getSourceIdentifier().identify(unmatchedUsedClass);
Multimap<Integer,ClassEntry> scoredDestClasses = ArrayListMultimap.create();
for (ClassEntry unmatchedDestClass : unmatchedDestClasses) {
ClassIdentity destIdentity = matching.getDestIdentifier().identify(unmatchedDestClass);
scoredDestClasses.put(sourceIdentity.getMatchScore(destIdentity), unmatchedDestClass);
}
List<Integer> scores = new ArrayList<Integer>(scoredDestClasses.keySet());
Collections.sort(scores, Collections.reverseOrder());
printScoredMatches(sourceIdentity.getMaxMatchScore(), scores, scoredDestClasses);
/* TODO: re-enable auto-pick logic
// does the best match have a non-zero score and the same name?
int bestScore = scores.get(0);
Collection<ClassIdentity> bestMatches = scoredMatches.get(bestScore);
if (bestScore > 0 && bestMatches.size() == 1) {
ClassIdentity bestMatch = bestMatches.iterator().next();
if (bestMatch.getClassEntry().equals(sourceClass.getClassEntry())) {
// use it
System.out.println("\tAutomatically choosing likely match: " + bestMatch.getClassEntry().getName());
destClasses.clear();
destClasses.add(bestMatch);
}
}
*/
}
// bail if there were unmatched classes
if (!unmatchedUsedClasses.isEmpty()) {
throw new Error("There were " + unmatchedUsedClasses.size() + " unmatched classes!");
}
// 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
BiMap<ClassEntry,ClassEntry> unsortedChanges = HashBiMap.create(uniqueUsedMatches);
LinkedHashMap<ClassEntry,ClassEntry> sortedChanges = Maps.newLinkedHashMap();
int numChangesLeft = unsortedChanges.size();
while (!unsortedChanges.isEmpty()) {
Iterator<Map.Entry<ClassEntry,ClassEntry>> iter = unsortedChanges.entrySet().iterator();
while (iter.hasNext()) {
Map.Entry<ClassEntry,ClassEntry> change = iter.next();
if (unsortedChanges.containsKey(change.getValue())) {
sortedChanges.put(change.getKey(), change.getValue());
iter.remove();
}
}
// did we remove any changes?
if (numChangesLeft - unsortedChanges.size() > 0) {
// keep going
numChangesLeft = unsortedChanges.size();
} else {
// can't sort anymore. There must be a loop
break;
}
}
if (!unsortedChanges.isEmpty()) {
throw new Error(String.format("Unable to sort %d/%d class changes!", unsortedChanges.size(), uniqueUsedMatches.size()));
}
// convert the mappings in the correct class order
for (Map.Entry<ClassEntry,ClassEntry> entry : sortedChanges.entrySet()) {
mappings.renameObfClass(entry.getKey().getName(), entry.getValue().getName());
}
// 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!");
}
public static ClassMatching computeMatching(JarFile sourceJar, JarIndex sourceIndex, JarFile destJar, JarIndex destIndex) {
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 (lastMatching == null) {
// search all classes
matching.match(sourceIndex.getObfClassEntries(), destIndex.getObfClassEntries());
} else {
// we already know about these matches
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;
}
private static void printScoredMatches(int maxScore, List<Integer> scores, Multimap<Integer,ClassEntry> scoredMatches) {
int numScoredMatchesShown = 0;
for (int score : scores) {
for (ClassEntry classEntry : scoredMatches.get(score)) {
System.out.println(String.format("\tScore: %3d %3.0f%% %s",
score, 100.0 * score / maxScore, classEntry.getName()
));
if (numScoredMatchesShown++ > 10) {
return;
}
}
}
}
private static List<String> getClassNames(Collection<ClassEntry> classes) {
List<String> out = Lists.newArrayList();
for (ClassEntry c : classes) {
out.add(c.getName());
}
Collections.sort(out);
return out;
}
/* DEBUG
private static String decompile(TranslatingTypeLoader loader, ClassEntry classEntry) {
PlainTextOutput output = new PlainTextOutput();
DecompilerSettings settings = DecompilerSettings.javaDefaults();
settings.setForceExplicitImports(true);
settings.setShowSyntheticMembers(true);
settings.setTypeLoader(loader);
Decompiler.decompile(classEntry.getName(), output, settings);
return output.toString();
}
*/
}
|