diff options
Diffstat (limited to 'src/cuchaz/enigma/analysis/BehaviorReferenceTreeNode.java')
| -rw-r--r-- | src/cuchaz/enigma/analysis/BehaviorReferenceTreeNode.java | 93 |
1 files changed, 93 insertions, 0 deletions
diff --git a/src/cuchaz/enigma/analysis/BehaviorReferenceTreeNode.java b/src/cuchaz/enigma/analysis/BehaviorReferenceTreeNode.java new file mode 100644 index 0000000..353a4bf --- /dev/null +++ b/src/cuchaz/enigma/analysis/BehaviorReferenceTreeNode.java | |||
| @@ -0,0 +1,93 @@ | |||
| 1 | /******************************************************************************* | ||
| 2 | * Copyright (c) 2015 Jeff Martin. | ||
| 3 | * All rights reserved. This program and the accompanying materials | ||
| 4 | * are made available under the terms of the GNU Lesser General Public | ||
| 5 | * License v3.0 which accompanies this distribution, and is available at | ||
| 6 | * http://www.gnu.org/licenses/lgpl.html | ||
| 7 | * | ||
| 8 | * Contributors: | ||
| 9 | * Jeff Martin - initial API and implementation | ||
| 10 | ******************************************************************************/ | ||
| 11 | package cuchaz.enigma.analysis; | ||
| 12 | |||
| 13 | import java.util.Set; | ||
| 14 | |||
| 15 | import javax.swing.tree.DefaultMutableTreeNode; | ||
| 16 | import javax.swing.tree.TreeNode; | ||
| 17 | |||
| 18 | import com.google.common.collect.Sets; | ||
| 19 | |||
| 20 | import cuchaz.enigma.mapping.BehaviorEntry; | ||
| 21 | import cuchaz.enigma.mapping.Entry; | ||
| 22 | import cuchaz.enigma.mapping.Translator; | ||
| 23 | |||
| 24 | public class BehaviorReferenceTreeNode extends DefaultMutableTreeNode implements ReferenceTreeNode<BehaviorEntry,BehaviorEntry> { | ||
| 25 | |||
| 26 | private static final long serialVersionUID = -3658163700783307520L; | ||
| 27 | |||
| 28 | private Translator m_deobfuscatingTranslator; | ||
| 29 | private BehaviorEntry m_entry; | ||
| 30 | private EntryReference<BehaviorEntry,BehaviorEntry> m_reference; | ||
| 31 | private Access m_access; | ||
| 32 | |||
| 33 | public BehaviorReferenceTreeNode(Translator deobfuscatingTranslator, BehaviorEntry entry) { | ||
| 34 | m_deobfuscatingTranslator = deobfuscatingTranslator; | ||
| 35 | m_entry = entry; | ||
| 36 | m_reference = null; | ||
| 37 | } | ||
| 38 | |||
| 39 | public BehaviorReferenceTreeNode(Translator deobfuscatingTranslator, EntryReference<BehaviorEntry,BehaviorEntry> reference, Access access) { | ||
| 40 | m_deobfuscatingTranslator = deobfuscatingTranslator; | ||
| 41 | m_entry = reference.entry; | ||
| 42 | m_reference = reference; | ||
| 43 | m_access = access; | ||
| 44 | } | ||
| 45 | |||
| 46 | @Override | ||
| 47 | public BehaviorEntry getEntry() { | ||
| 48 | return m_entry; | ||
| 49 | } | ||
| 50 | |||
| 51 | @Override | ||
| 52 | public EntryReference<BehaviorEntry,BehaviorEntry> getReference() { | ||
| 53 | return m_reference; | ||
| 54 | } | ||
| 55 | |||
| 56 | @Override | ||
| 57 | public String toString() { | ||
| 58 | if (m_reference != null) { | ||
| 59 | return String.format("%s (%s)", m_deobfuscatingTranslator.translateEntry(m_reference.context), m_access); | ||
| 60 | } | ||
| 61 | return m_deobfuscatingTranslator.translateEntry(m_entry).toString(); | ||
| 62 | } | ||
| 63 | |||
| 64 | public void load(JarIndex index, boolean recurse) { | ||
| 65 | // get all the child nodes | ||
| 66 | for (EntryReference<BehaviorEntry,BehaviorEntry> reference : index.getBehaviorReferences(m_entry)) { | ||
| 67 | add(new BehaviorReferenceTreeNode(m_deobfuscatingTranslator, reference, index.getAccess(m_entry))); | ||
| 68 | } | ||
| 69 | |||
| 70 | if (recurse && children != null) { | ||
| 71 | for (Object child : children) { | ||
| 72 | if (child instanceof BehaviorReferenceTreeNode) { | ||
| 73 | BehaviorReferenceTreeNode node = (BehaviorReferenceTreeNode)child; | ||
| 74 | |||
| 75 | // don't recurse into ancestor | ||
| 76 | Set<Entry> ancestors = Sets.newHashSet(); | ||
| 77 | TreeNode n = (TreeNode)node; | ||
| 78 | while (n.getParent() != null) { | ||
| 79 | n = n.getParent(); | ||
| 80 | if (n instanceof BehaviorReferenceTreeNode) { | ||
| 81 | ancestors.add( ((BehaviorReferenceTreeNode)n).getEntry()); | ||
| 82 | } | ||
| 83 | } | ||
| 84 | if (ancestors.contains(node.getEntry())) { | ||
| 85 | continue; | ||
| 86 | } | ||
| 87 | |||
| 88 | node.load(index, true); | ||
| 89 | } | ||
| 90 | } | ||
| 91 | } | ||
| 92 | } | ||
| 93 | } | ||