summaryrefslogtreecommitdiffstats
path: root/src/org/jetbrains/java/decompiler/modules/decompiler/decompose/DominatorTreeExceptionFilter.java
diff options
context:
space:
mode:
Diffstat (limited to 'src/org/jetbrains/java/decompiler/modules/decompiler/decompose/DominatorTreeExceptionFilter.java')
-rw-r--r--src/org/jetbrains/java/decompiler/modules/decompiler/decompose/DominatorTreeExceptionFilter.java344
1 files changed, 170 insertions, 174 deletions
diff --git a/src/org/jetbrains/java/decompiler/modules/decompiler/decompose/DominatorTreeExceptionFilter.java b/src/org/jetbrains/java/decompiler/modules/decompiler/decompose/DominatorTreeExceptionFilter.java
index cf9e90c..c11d5bf 100644
--- a/src/org/jetbrains/java/decompiler/modules/decompiler/decompose/DominatorTreeExceptionFilter.java
+++ b/src/org/jetbrains/java/decompiler/modules/decompiler/decompose/DominatorTreeExceptionFilter.java
@@ -1,188 +1,184 @@
/*
- * Fernflower - The Analytical Java Decompiler
- * http://www.reversed-java.com
+ * Copyright 2000-2014 JetBrains s.r.o.
*
- * (C) 2008 - 2010, Stiver
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
*
- * This software is NEITHER public domain NOR free software
- * as per GNU License. See license.txt for more details.
+ * http://www.apache.org/licenses/LICENSE-2.0
*
- * This software is distributed WITHOUT ANY WARRANTY; without
- * even the implied warranty of MERCHANTABILITY or FITNESS FOR
- * A PARTICULAR PURPOSE.
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
*/
-
package org.jetbrains.java.decompiler.modules.decompiler.decompose;
-import java.util.HashMap;
-import java.util.HashSet;
-import java.util.List;
-import java.util.Map;
-import java.util.Set;
-import java.util.Map.Entry;
-
import org.jetbrains.java.decompiler.modules.decompiler.StatEdge;
import org.jetbrains.java.decompiler.modules.decompiler.stats.Statement;
import org.jetbrains.java.decompiler.util.VBStyleCollection;
+import java.util.*;
+import java.util.Map.Entry;
+
public class DominatorTreeExceptionFilter {
- private Statement statement;
-
- // idom, nodes
- private Map<Integer, Set<Integer>> mapTreeBranches = new HashMap<Integer, Set<Integer>>();
-
- // handler, range nodes
- private Map<Integer, Set<Integer>> mapExceptionRanges = new HashMap<Integer, Set<Integer>>();
-
- // handler, head dom
- private Map<Integer, Integer> mapExceptionDoms = new HashMap<Integer, Integer>();
-
- // statement, handler, exit nodes
- private Map<Integer, Map<Integer, Integer>> mapExceptionRangeUniqueExit = new HashMap<Integer, Map<Integer, Integer>>();
-
- private DominatorEngine domEngine;
-
- public DominatorTreeExceptionFilter(Statement statement) {
- this.statement = statement;
- }
-
- public void initialize() {
-
- domEngine = new DominatorEngine(statement);
- domEngine.initialize();
-
- buildDominatorTree();
-
- buildExceptionRanges();
-
- buildFilter(statement.getFirst().id);
-
- // free resources
- mapTreeBranches.clear();
- mapExceptionRanges.clear();
-
- }
-
- public boolean acceptStatementPair(Integer head, Integer exit) {
-
- Map<Integer, Integer> filter = mapExceptionRangeUniqueExit.get(head);
- for(Entry<Integer, Integer> entry : filter.entrySet()) {
- if(!head.equals(mapExceptionDoms.get(entry.getKey()))) {
- Integer filterExit = entry.getValue();
- if(filterExit.intValue() == -1 || !filterExit.equals(exit)) {
- return false;
- }
- }
- }
-
- return true;
- }
-
- private void buildDominatorTree() {
-
- VBStyleCollection<Integer, Integer> orderedIDoms = domEngine.getOrderedIDoms();
-
- List<Integer> lstKeys = orderedIDoms.getLstKeys();
- for(int index = lstKeys.size()-1;index>=0;index--) {
- Integer key = lstKeys.get(index);
- Integer idom = orderedIDoms.get(index);
-
- Set<Integer> set = mapTreeBranches.get(idom);
- if(set == null) {
- mapTreeBranches.put(idom, set = new HashSet<Integer>());
- }
- set.add(key);
- }
-
- Integer firstid = statement.getFirst().id;
- mapTreeBranches.get(firstid).remove(firstid);
- }
-
- private void buildExceptionRanges() {
-
- for(Statement stat : statement.getStats()) {
- List<Statement> lstPreds = stat.getNeighbours(StatEdge.TYPE_EXCEPTION, Statement.DIRECTION_BACKWARD);
- if(!lstPreds.isEmpty()) {
-
- Set<Integer> set = new HashSet<Integer>();
-
- for(Statement st : lstPreds) {
- set.add(st.id);
- }
-
- mapExceptionRanges.put(stat.id, set);
- }
- }
-
- mapExceptionDoms = buildExceptionDoms(statement.getFirst().id);
- }
-
- private Map<Integer, Integer> buildExceptionDoms(Integer id) {
-
- Map<Integer, Integer> map = new HashMap<Integer, Integer>();
-
- Set<Integer> children = mapTreeBranches.get(id);
- if(children != null) {
- for(Integer childid : children) {
- Map<Integer, Integer> mapChild = buildExceptionDoms(childid);
- for(Integer handler : mapChild.keySet()) {
- map.put(handler, map.containsKey(handler)?id:mapChild.get(handler));
- }
- }
- }
-
- for(Entry<Integer, Set<Integer>> entry : mapExceptionRanges.entrySet()) {
- if(entry.getValue().contains(id)) {
- map.put(entry.getKey(), id);
- }
- }
-
- return map;
- }
-
-
- private void buildFilter(Integer id) {
-
- Map<Integer, Integer> map = new HashMap<Integer, Integer>();
-
- Set<Integer> children = mapTreeBranches.get(id);
- if(children != null) {
- for(Integer childid : children) {
-
- buildFilter(childid);
-
- Map<Integer, Integer> mapChild = mapExceptionRangeUniqueExit.get(childid);
-
- for(Entry<Integer, Set<Integer>> entry : mapExceptionRanges.entrySet()) {
-
- Integer handler = entry.getKey();
- Set<Integer> range = entry.getValue();
-
- if(range.contains(id)) {
-
- Integer exit = null;
-
- if(!range.contains(childid)) {
- exit = childid;
- } else {
- // exit = map.containsKey(handler)?-1:mapChild.get(handler); FIXME: Eclipse bug?
- exit = map.containsKey(handler)?new Integer(-1):mapChild.get(handler);
- }
-
- if(exit != null) {
- map.put(handler, exit);
- }
- }
- }
- }
- }
-
- mapExceptionRangeUniqueExit.put(id, map);
- }
-
- public DominatorEngine getDomEngine() {
- return domEngine;
- }
-
+ private Statement statement;
+
+ // idom, nodes
+ private Map<Integer, Set<Integer>> mapTreeBranches = new HashMap<Integer, Set<Integer>>();
+
+ // handler, range nodes
+ private Map<Integer, Set<Integer>> mapExceptionRanges = new HashMap<Integer, Set<Integer>>();
+
+ // handler, head dom
+ private Map<Integer, Integer> mapExceptionDoms = new HashMap<Integer, Integer>();
+
+ // statement, handler, exit nodes
+ private Map<Integer, Map<Integer, Integer>> mapExceptionRangeUniqueExit = new HashMap<Integer, Map<Integer, Integer>>();
+
+ private DominatorEngine domEngine;
+
+ public DominatorTreeExceptionFilter(Statement statement) {
+ this.statement = statement;
+ }
+
+ public void initialize() {
+
+ domEngine = new DominatorEngine(statement);
+ domEngine.initialize();
+
+ buildDominatorTree();
+
+ buildExceptionRanges();
+
+ buildFilter(statement.getFirst().id);
+
+ // free resources
+ mapTreeBranches.clear();
+ mapExceptionRanges.clear();
+ }
+
+ public boolean acceptStatementPair(Integer head, Integer exit) {
+
+ Map<Integer, Integer> filter = mapExceptionRangeUniqueExit.get(head);
+ for (Entry<Integer, Integer> entry : filter.entrySet()) {
+ if (!head.equals(mapExceptionDoms.get(entry.getKey()))) {
+ Integer filterExit = entry.getValue();
+ if (filterExit.intValue() == -1 || !filterExit.equals(exit)) {
+ return false;
+ }
+ }
+ }
+
+ return true;
+ }
+
+ private void buildDominatorTree() {
+
+ VBStyleCollection<Integer, Integer> orderedIDoms = domEngine.getOrderedIDoms();
+
+ List<Integer> lstKeys = orderedIDoms.getLstKeys();
+ for (int index = lstKeys.size() - 1; index >= 0; index--) {
+ Integer key = lstKeys.get(index);
+ Integer idom = orderedIDoms.get(index);
+
+ Set<Integer> set = mapTreeBranches.get(idom);
+ if (set == null) {
+ mapTreeBranches.put(idom, set = new HashSet<Integer>());
+ }
+ set.add(key);
+ }
+
+ Integer firstid = statement.getFirst().id;
+ mapTreeBranches.get(firstid).remove(firstid);
+ }
+
+ private void buildExceptionRanges() {
+
+ for (Statement stat : statement.getStats()) {
+ List<Statement> lstPreds = stat.getNeighbours(StatEdge.TYPE_EXCEPTION, Statement.DIRECTION_BACKWARD);
+ if (!lstPreds.isEmpty()) {
+
+ Set<Integer> set = new HashSet<Integer>();
+
+ for (Statement st : lstPreds) {
+ set.add(st.id);
+ }
+
+ mapExceptionRanges.put(stat.id, set);
+ }
+ }
+
+ mapExceptionDoms = buildExceptionDoms(statement.getFirst().id);
+ }
+
+ private Map<Integer, Integer> buildExceptionDoms(Integer id) {
+
+ Map<Integer, Integer> map = new HashMap<Integer, Integer>();
+
+ Set<Integer> children = mapTreeBranches.get(id);
+ if (children != null) {
+ for (Integer childid : children) {
+ Map<Integer, Integer> mapChild = buildExceptionDoms(childid);
+ for (Integer handler : mapChild.keySet()) {
+ map.put(handler, map.containsKey(handler) ? id : mapChild.get(handler));
+ }
+ }
+ }
+
+ for (Entry<Integer, Set<Integer>> entry : mapExceptionRanges.entrySet()) {
+ if (entry.getValue().contains(id)) {
+ map.put(entry.getKey(), id);
+ }
+ }
+
+ return map;
+ }
+
+
+ private void buildFilter(Integer id) {
+
+ Map<Integer, Integer> map = new HashMap<Integer, Integer>();
+
+ Set<Integer> children = mapTreeBranches.get(id);
+ if (children != null) {
+ for (Integer childid : children) {
+
+ buildFilter(childid);
+
+ Map<Integer, Integer> mapChild = mapExceptionRangeUniqueExit.get(childid);
+
+ for (Entry<Integer, Set<Integer>> entry : mapExceptionRanges.entrySet()) {
+
+ Integer handler = entry.getKey();
+ Set<Integer> range = entry.getValue();
+
+ if (range.contains(id)) {
+
+ Integer exit = null;
+
+ if (!range.contains(childid)) {
+ exit = childid;
+ }
+ else {
+ // exit = map.containsKey(handler)?-1:mapChild.get(handler); FIXME: Eclipse bug?
+ exit = map.containsKey(handler) ? new Integer(-1) : mapChild.get(handler);
+ }
+
+ if (exit != null) {
+ map.put(handler, exit);
+ }
+ }
+ }
+ }
+ }
+
+ mapExceptionRangeUniqueExit.put(id, map);
+ }
+
+ public DominatorEngine getDomEngine() {
+ return domEngine;
+ }
}
generated by cgit v1.2.3 (git 2.25.1) at 2024-07-05 07:55:30 +0000