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
|
/*******************************************************************************
* 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.Sets;
import cuchaz.enigma.analysis.index.JarIndex;
import cuchaz.enigma.analysis.index.ReferenceIndex;
import cuchaz.enigma.translation.Translator;
import cuchaz.enigma.translation.mapping.EntryResolver;
import cuchaz.enigma.translation.representation.entry.Entry;
import cuchaz.enigma.translation.representation.entry.MethodDefEntry;
import cuchaz.enigma.translation.representation.entry.MethodEntry;
import javax.swing.tree.DefaultMutableTreeNode;
import javax.swing.tree.TreeNode;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Set;
public class MethodReferenceTreeNode extends DefaultMutableTreeNode implements ReferenceTreeNode<MethodEntry, MethodDefEntry> {
private final Translator translator;
private MethodEntry entry;
private EntryReference<MethodEntry, MethodDefEntry> reference;
public MethodReferenceTreeNode(Translator translator, MethodEntry entry) {
this.translator = translator;
this.entry = entry;
this.reference = null;
}
public MethodReferenceTreeNode(Translator translator, EntryReference<MethodEntry, MethodDefEntry> reference) {
this.translator = translator;
this.entry = reference.entry;
this.reference = reference;
}
@Override
public MethodEntry getEntry() {
return this.entry;
}
@Override
public EntryReference<MethodEntry, MethodDefEntry> getReference() {
return this.reference;
}
@Override
public String toString() {
if (this.reference != null) {
return String.format("%s", translator.translate(this.reference.context));
}
return translator.translate(this.entry).getName();
}
public void load(JarIndex index, boolean recurse, boolean recurseMethod) {
// get all the child nodes
Collection<EntryReference<MethodEntry, MethodDefEntry>> references = getReferences(index, recurseMethod);
for (EntryReference<MethodEntry, MethodDefEntry> reference : references) {
add(new MethodReferenceTreeNode(translator, reference));
}
if (recurse && this.children != null) {
for (Object child : this.children) {
if (child instanceof MethodReferenceTreeNode) {
MethodReferenceTreeNode node = (MethodReferenceTreeNode) child;
// don't recurse into ancestor
Set<Entry<?>> ancestors = Sets.newHashSet();
TreeNode n = node;
while (n.getParent() != null) {
n = n.getParent();
if (n instanceof MethodReferenceTreeNode) {
ancestors.add(((MethodReferenceTreeNode) n).getEntry());
}
}
if (ancestors.contains(node.getEntry())) {
continue;
}
node.load(index, true, false);
}
}
}
}
private Collection<EntryReference<MethodEntry, MethodDefEntry>> getReferences(JarIndex index, boolean recurseMethod) {
ReferenceIndex referenceIndex = index.getReferenceIndex();
if (recurseMethod) {
Collection<EntryReference<MethodEntry, MethodDefEntry>> references = new ArrayList<>();
EntryResolver entryResolver = index.getEntryResolver();
for (MethodEntry methodEntry : entryResolver.resolveEquivalentMethods(entry)) {
references.addAll(referenceIndex.getReferencesToMethod(methodEntry));
}
return references;
} else {
return referenceIndex.getReferencesToMethod(entry);
}
}
}
|
