blob: f0fd1d28476726c4eb9224562e01b3da6e89d1d4 (
plain) (
blame)
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
|
/*******************************************************************************
* 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.Lists;
import cuchaz.enigma.analysis.index.EntryIndex;
import cuchaz.enigma.analysis.index.InheritanceIndex;
import cuchaz.enigma.analysis.index.JarIndex;
import cuchaz.enigma.translation.Translator;
import cuchaz.enigma.translation.representation.entry.ClassEntry;
import cuchaz.enigma.translation.representation.entry.MethodEntry;
import javax.swing.tree.DefaultMutableTreeNode;
import java.util.List;
public class MethodInheritanceTreeNode extends DefaultMutableTreeNode {
private final Translator translator;
private MethodEntry entry;
private boolean isImplemented;
public MethodInheritanceTreeNode(Translator translator, MethodEntry entry, boolean isImplemented) {
this.translator = translator;
this.entry = entry;
this.isImplemented = isImplemented;
}
public static MethodInheritanceTreeNode findNode(MethodInheritanceTreeNode node, MethodEntry entry) {
// is this the node?
if (node.getMethodEntry().equals(entry)) {
return node;
}
// recurse
for (int i = 0; i < node.getChildCount(); i++) {
MethodInheritanceTreeNode foundNode = findNode((MethodInheritanceTreeNode) node.getChildAt(i), entry);
if (foundNode != null) {
return foundNode;
}
}
return null;
}
public MethodEntry getMethodEntry() {
return this.entry;
}
public boolean isImplemented() {
return this.isImplemented;
}
@Override
public String toString() {
MethodEntry translatedEntry = translator.translate(entry);
String className = translatedEntry.getContainingClass().getFullName();
if (!this.isImplemented) {
return className;
} else {
String methodName = translatedEntry.getName();
return className + "." + methodName + "()";
}
}
public void load(JarIndex index, boolean recurse) {
// get all the child nodes
List<MethodInheritanceTreeNode> nodes = Lists.newArrayList();
EntryIndex entryIndex = index.getEntryIndex();
InheritanceIndex inheritanceIndex = index.getInheritanceIndex();
for (ClassEntry inheritorEntry : inheritanceIndex.getChildren(this.entry.getParent())) {
MethodEntry methodEntry = new MethodEntry(inheritorEntry, this.entry.getName(), this.entry.getDesc());
nodes.add(new MethodInheritanceTreeNode(translator, methodEntry, entryIndex.hasMethod(methodEntry)));
}
// add them to this node
nodes.forEach(this::add);
if (recurse) {
for (MethodInheritanceTreeNode node : nodes) {
node.load(index, true);
}
}
}
}
|
