![JAR search and dependency download from the Maven repository](/logo.png)
soot.dava.toolkits.base.AST.traversals.ASTParentNodeFinder Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of soot Show documentation
Show all versions of soot Show documentation
A Java Optimization Framework
package soot.dava.toolkits.base.AST.traversals;
/*-
* #%L
* Soot - a J*va Optimization Framework
* %%
* Copyright (C) 2005 Nomair A. Naeem
* %%
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 2.1 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Lesser Public License for more details.
*
* You should have received a copy of the GNU General Lesser Public
* License along with this program. If not, see
* .
* #L%
*/
import java.util.HashMap;
import java.util.Stack;
import soot.Unit;
import soot.dava.internal.AST.ASTDoWhileNode;
import soot.dava.internal.AST.ASTForLoopNode;
import soot.dava.internal.AST.ASTIfElseNode;
import soot.dava.internal.AST.ASTIfNode;
import soot.dava.internal.AST.ASTLabeledBlockNode;
import soot.dava.internal.AST.ASTMethodNode;
import soot.dava.internal.AST.ASTNode;
import soot.dava.internal.AST.ASTStatementSequenceNode;
import soot.dava.internal.AST.ASTSwitchNode;
import soot.dava.internal.AST.ASTSynchronizedBlockNode;
import soot.dava.internal.AST.ASTTryNode;
import soot.dava.internal.AST.ASTUnconditionalLoopNode;
import soot.dava.internal.AST.ASTWhileNode;
import soot.dava.internal.javaRep.DVariableDeclarationStmt;
import soot.dava.toolkits.base.AST.analysis.DepthFirstAdapter;
import soot.jimple.DefinitionStmt;
import soot.jimple.InvokeStmt;
import soot.jimple.ReturnStmt;
import soot.jimple.Stmt;
import soot.jimple.ThrowStmt;
/*
* This traversal class is responsible to gather information
* regarding the different nodes and statements in the AST.
* The class produces a HashMap between the node/statement given as
* key and the parent of this construct (value)
*
* November 23rd, 2005. (Nomair) It is used for instance in the CopyPropagation algorithm
* to be able to remove a particular copy
* stmt for instance from its parent.
*/
public class ASTParentNodeFinder extends DepthFirstAdapter {
HashMap parentOf;
Stack parentStack;
public ASTParentNodeFinder() {
parentOf = new HashMap();
parentStack = new Stack();
}
public ASTParentNodeFinder(boolean verbose) {
super(verbose);
parentOf = new HashMap();
parentStack = new Stack();
}
public void inASTMethodNode(ASTMethodNode node) {
parentOf.put(node, null);
parentStack.push(node);
}
public void outASTMethodNode(ASTMethodNode node) {
parentStack.pop();
}
public void inASTSynchronizedBlockNode(ASTSynchronizedBlockNode node) {
parentOf.put(node, parentStack.peek());
parentStack.push(node);
}
public void outASTSynchronizedBlockNode(ASTSynchronizedBlockNode node) {
parentStack.pop();
}
public void inASTLabeledBlockNode(ASTLabeledBlockNode node) {
parentOf.put(node, parentStack.peek());
parentStack.push(node);
}
public void outASTLabeledBlockNode(ASTLabeledBlockNode node) {
parentStack.pop();
}
public void inASTUnconditionalLoopNode(ASTUnconditionalLoopNode node) {
parentOf.put(node, parentStack.peek());
parentStack.push(node);
}
public void outASTUnconditionalLoopNode(ASTUnconditionalLoopNode node) {
parentStack.pop();
}
public void inASTSwitchNode(ASTSwitchNode node) {
parentOf.put(node, parentStack.peek());
parentStack.push(node);
}
public void outASTSwitchNode(ASTSwitchNode node) {
parentStack.pop();
}
public void inASTIfNode(ASTIfNode node) {
parentOf.put(node, parentStack.peek());
parentStack.push(node);
}
public void outASTIfNode(ASTIfNode node) {
parentStack.pop();
}
public void inASTIfElseNode(ASTIfElseNode node) {
parentOf.put(node, parentStack.peek());
parentStack.push(node);
}
public void outASTIfElseNode(ASTIfElseNode node) {
parentStack.pop();
}
public void inASTWhileNode(ASTWhileNode node) {
parentOf.put(node, parentStack.peek());
parentStack.push(node);
}
public void outASTWhileNode(ASTWhileNode node) {
parentStack.pop();
}
public void inASTForLoopNode(ASTForLoopNode node) {
parentOf.put(node, parentStack.peek());
parentStack.push(node);
}
public void outASTForLoopNode(ASTForLoopNode node) {
parentStack.pop();
}
public void inASTDoWhileNode(ASTDoWhileNode node) {
parentOf.put(node, parentStack.peek());
parentStack.push(node);
}
public void outASTDoWhileNode(ASTDoWhileNode node) {
parentStack.pop();
}
public void inASTTryNode(ASTTryNode node) {
parentOf.put(node, parentStack.peek());
parentStack.push(node);
}
public void outASTTryNode(ASTTryNode node) {
parentStack.pop();
}
public void inASTStatementSequenceNode(ASTStatementSequenceNode node) {
parentOf.put(node, parentStack.peek());
parentStack.push(node);
}
public void outASTStatementSequenceNode(ASTStatementSequenceNode node) {
parentStack.pop();
}
public void inDefinitionStmt(DefinitionStmt s) {
parentOf.put(s, parentStack.peek());
}
public void inReturnStmt(ReturnStmt s) {
parentOf.put(s, parentStack.peek());
}
public void inInvokeStmt(InvokeStmt s) {
parentOf.put(s, parentStack.peek());
}
public void inThrowStmt(ThrowStmt s) {
parentOf.put(s, parentStack.peek());
}
public void inDVariableDeclarationStmt(DVariableDeclarationStmt s) {
parentOf.put(s, parentStack.peek());
}
public void inStmt(Stmt s) {
parentOf.put(s, parentStack.peek());
}
/*
* This is the method which should be invoked by classes needing parent information. When the method is invoked with a
* statement or node as input it returns the parent of that object. The parent can safely be casted to ASTNode as long as
* the parent returned is non null
*/
public Object getParentOf(Object statementOrNode) {
return parentOf.get(statementOrNode);
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy