|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Node | |
---|---|
tip | Provides the main classes for the TIP compiler, including the main entry class Main. |
tip.analysis | Provides the analysis utility classes for the TIP ASTs. |
tip.cfg | Provides the basic framework for performing fixed-point analyses of TIP programs. |
tip.cfg.dfa | Provides a collection of data flow analyses for TIP programs. |
tip.display | Provides classes for display ASTs and CFGs of TIP programs. |
tip.node | Provides node classes for representing the TIP ASTs. |
tip.util | Provides utility classes for the TIP compiler. |
Uses of Node in tip |
---|
Methods in tip with parameters of type Node | ||
---|---|---|
static
|
Util.findNode(Node start,
Class<T> cl)
Search up the AST for an ancestor node of a specific type. |
Uses of Node in tip.analysis |
---|
Methods in tip.analysis with parameters of type Node | |
---|---|
void |
TreeDisplay.defaultIn(Node node)
|
void |
ReversedDepthFirstAdapter.defaultIn(Node node)
Default case for in -calls. |
void |
DepthFirstAdapter.defaultIn(Node node)
Default case for in -calls. |
A |
AnswerAdapter.defaultNode(Node node)
Returns the default answer for a Node . |
void |
AnalysisAdapter.defaultNode(Node node)
Base case for all nodes. |
A |
QuestionAnswerAdapter.defaultNode(Node node,
Q question)
Returns the default answer for a Node . |
void |
QuestionAdapter.defaultNode(Node node,
Q question)
Default action for a question to a Node . |
void |
TreeDisplay.defaultOut(Node node)
|
void |
ReversedDepthFirstAdapter.defaultOut(Node node)
Default case for out -calls. |
void |
DepthFirstAdapter.defaultOut(Node node)
Default case for out -calls. |
Object |
AnalysisAdapter.getIn(Node node)
Returns the Object associated with the Node node in the in map. |
Object |
Analysis.getIn(Node node)
Returns the Object associated with the Node node in the in map. |
Object |
AnalysisAdapter.getOut(Node node)
Returns the Object associated with the Node node in the out map. |
Object |
Analysis.getOut(Node node)
Returns the Object associated with the Node node in the out map. |
void |
AnalysisAdapter.setIn(Node node,
Object o)
Sets the Object o to be a associated with the Node node in the in map. |
void |
Analysis.setIn(Node node,
Object o)
Sets the Object o to be a associated with the Node node in the in map. |
void |
AnalysisAdapter.setOut(Node node,
Object o)
Sets the Object o to be a associated with the Node node in the out map. |
void |
Analysis.setOut(Node node,
Object o)
Sets the Object o to be a associated with the Node node in the out map. |
Uses of Node in tip.cfg |
---|
Methods in tip.cfg with type parameters of type Node | ||
---|---|---|
|
ICFG.getNodeDescendants(Class<T> classType)
Returns a collection of descendants to the nodes associated to the program points in this control flow graph. |
|
|
CCFG.getNodeDescendants(Class<T> classType)
Returns a collection of descendants to the nodes associated to the program points in this control flow graph. |
|
|
ICFG.getNodeDescendants(Collection<T> collection,
NodeFilter<T> filter)
Adds children to the nodes associated to the program points in this control flow graph to collection . |
|
|
CCFG.getNodeDescendants(Collection<T> collection,
NodeFilter<T> filter)
Adds descendants to the nodes associated to the program points in this control flow graph to collection . |
|
|
ICFG.getNodeDescendants(NodeFilter<T> filter)
Returns a collection of descendants to the nodes associated to the program points in this control flow graph. |
|
|
CCFG.getNodeDescendants(NodeFilter<T> filter)
Returns a collection of descendants to the nodes associated to the program points in this control flow graph. |
Methods in tip.cfg that return Node | |
---|---|
Node |
IProgramPoint.getNode()
Returns the Node in the AST associated with this program point. |
Node |
AProgramPoint.getNode()
Returns the Node in the AST associated with this program point. |
Node |
Target.getTarget()
Returns the node representing the target. |
Methods in tip.cfg with parameters of type Node | |
---|---|
boolean |
ICFGAnalysis.caseEntryPoint(Node node,
EntryPoint point)
caseEntryPoint is called by a EntryPoint from
EntryPoint.apply(ICFGAnalysis) . |
A |
CFGAnswerAdapter.caseEntryPoint(Node node,
EntryPoint point)
Default implementation. |
A |
CFGAnswer.caseEntryPoint(Node node,
EntryPoint point)
caseEntryPoint is called by a EntryPoint from
EntryPoint.apply(CFGAnswer) . |
boolean |
CFGAnalysisAdapter.caseEntryPoint(Node node,
EntryPoint point)
Default implementation. |
A |
CFGQuestionAnswerAdapter.caseEntryPoint(Node node,
EntryPoint point,
Q question)
Default implementation. |
A |
CFGQuestionAnswer.caseEntryPoint(Node node,
EntryPoint point,
Q question)
caseEntryPoint is called by a EntryPoint from
EntryPoint.apply(CFGQuestionAnswer,Object) . |
boolean |
ICFGAnalysis.caseExitPoint(Node node,
ExitPoint point)
caseExitPoint is called by a ExitPoint from
ExitPoint.apply(ICFGAnalysis) . |
A |
CFGAnswerAdapter.caseExitPoint(Node node,
ExitPoint point)
Default implementation. |
A |
CFGAnswer.caseExitPoint(Node node,
ExitPoint point)
caseExitPoint is called by a ExitPoint from
ExitPoint.apply(CFGAnswer) . |
boolean |
CFGAnalysisAdapter.caseExitPoint(Node node,
ExitPoint point)
Default implementation. |
A |
CFGQuestionAnswerAdapter.caseExitPoint(Node node,
ExitPoint point,
Q question)
Default implementation. |
A |
CFGQuestionAnswer.caseExitPoint(Node node,
ExitPoint point,
Q question)
caseExitPoint is called by a ExitPoint from
ExitPoint.apply(CFGQuestionAnswer,Object) . |
static ICFGCollection |
CFGBuilder.createCFGCollection(Node node)
Creates a collection of control flow graphs based on a traversal starting in node . |
static ICFGCollection |
CFGBuilder.createCFGCollection(Node node,
NodeFilter filter)
Creates a collection of control flow graphs based on a traversal starting in node using filter to decide which program point such
appear in the resulting control flow graphs. |
A |
CFGAnswerAdapter.defaultNode(Node node,
IProgramPoint point)
Base implementation for all case -methods. |
boolean |
CFGAnalysisAdapter.defaultNode(Node node,
IProgramPoint point)
Base implementation for all case -methods. |
boolean |
FlowAnalysis.defaultNode(Node node,
IProgramPoint point)
Default implementation for program points: The variable for point
is updated to be the join of the points in its dependency set. |
A |
CFGQuestionAnswerAdapter.defaultNode(Node node,
IProgramPoint point,
Q question)
Base implementation for all case -methods. |
Constructors in tip.cfg with parameters of type Node | |
---|---|
AProgramPoint(Node _node_)
Creates a new program point associated with _node_ . |
|
EntryPoint(Node _node_)
Creates a new entry point associated with _node_ . |
|
ExitPoint(Node _node_)
Creates a new exit point associated with _node_ . |
Uses of Node in tip.cfg.dfa |
---|
Methods in tip.cfg.dfa with parameters of type Node | |
---|---|
boolean |
SignAnalysis.caseEntryPoint(Node node,
EntryPoint point)
|
boolean |
NullPointerAnalysis.caseEntryPoint(Node node,
EntryPoint point)
|
boolean |
IntervalAnalysis.caseEntryPoint(Node node,
EntryPoint point)
|
boolean |
ConstantPropagationAnalysis.caseEntryPoint(Node node,
EntryPoint point)
|
boolean |
AvailableExpressionsAnalysis.caseEntryPoint(Node node,
EntryPoint point)
Computes the variable for the entry point point . |
boolean |
VeryBusyExpressionsAnalysis.caseExitPoint(Node node,
ExitPoint point)
|
boolean |
DivisionAnalysis.caseExitPoint(Node node,
ExitPoint point)
|
IntervalAnalysis.Interval |
IntervalAnalysis.Evaluator.defaultNode(Node node,
EqualityMap<ALocalDecl,IntervalAnalysis.Interval> sigma)
|
SignAnalysis.Sign |
SignAnalysis.Evaluator.defaultNode(Node node,
EqualityMap<ALocalDecl,SignAnalysis.Sign> map)
|
boolean |
IntervalAnalysis.defaultNode(Node node,
IProgramPoint point)
|
boolean |
DivisionAnalysis.defaultNode(Node node,
IProgramPoint point)
|
ConstantPropagationAnalysis.Const |
ConstantPropagationAnalysis.Evaluator.defaultNode(Node node,
Map<ALocalDecl,ConstantPropagationAnalysis.Const> env)
|
Uses of Node in tip.display |
---|
Classes in tip.display with type parameters of type Node | |
---|---|
class |
NodeText<T extends Node>
NodeText implements the Answer and Stringifier
interfaces to support a custom textual representation of nodes. |
Methods in tip.display with parameters of type Node | |
---|---|
void |
ASTDisplay.defaultIn(Node node)
As we come across nonterminals, push them onto the stack |
String |
NodeText.defaultNode(Node node)
|
void |
ASTDisplay.defaultOut(Node node)
As we leave a non terminal, it's parent is the node before it on the stack, so we pop it off and add it to that node |
Method parameters in tip.display with type arguments of type Node | |
---|---|
static void |
CFGDisplay.displayCFGs(ICFGCollection cfgList,
NodeText<Node> _nodeText,
Collection<FixedPointAnalysis<?>> analyses,
Collection<PointsToMap> pointsToMaps,
int vicinity)
|
Uses of Node in tip.node |
---|
Classes in tip.node with type parameters of type Node | |
---|---|
class |
NodeList<E extends Node>
A list of AST nodes where all operations preserve the single-parent property of the AST. |
class |
RoutingAutomaton<S extends Node,T extends Node>
|
class |
RoutingAutomaton<S extends Node,T extends Node>
|
Subclasses of Node in tip.node | |
---|---|
class |
ABinopExp
ABinopExp represents the binop alternative of the exp production in the AST. |
class |
ABlock
ABlock represents the alternative of the block production in the AST. |
class |
ABlockStm
ABlockStm represents the block alternative of the stm production in the AST. |
class |
ABody
ABody represents the alternative of the body production in the AST. |
class |
ADeclStm
ADeclStm represents the decl alternative of the stm production in the AST. |
class |
ADerefExp
ADerefExp represents the deref alternative of the exp production in the AST. |
class |
ADivideBinop
ADivideBinop represents the divide alternative of the binop production in the AST. |
class |
AEqBinop
AEqBinop represents the eq alternative of the binop production in the AST. |
class |
AFuncDecl
AFuncDecl represents the func alternative of the decl production in the AST. |
class |
AFunctionCallExp
AFunctionCallExp represents the function_call alternative of the exp production in the AST. |
class |
AFunctionPtrCallExp
AFunctionPtrCallExp represents the function_ptr_call alternative of the exp production in the AST. |
class |
AGtBinop
AGtBinop represents the gt alternative of the binop production in the AST. |
class |
AIfThenElseStm
AIfThenElseStm represents the if_then_else alternative of the stm production in the AST. |
class |
AIfThenStm
AIfThenStm represents the if_then alternative of the stm production in the AST. |
class |
AInputExp
AInputExp represents the input alternative of the exp production in the AST. |
class |
AIntConstExp
AIntConstExp represents the int_const alternative of the exp production in the AST. |
class |
ALocalDecl
ALocalDecl represents the local alternative of the decl production in the AST. |
class |
AMallocExp
AMallocExp represents the malloc alternative of the exp production in the AST. |
class |
AMinusBinop
AMinusBinop represents the minus alternative of the binop production in the AST. |
class |
ANullExp
ANullExp represents the null alternative of the exp production in the AST. |
class |
AOutputStm
AOutputStm represents the output alternative of the stm production in the AST. |
class |
APlusBinop
APlusBinop represents the plus alternative of the binop production in the AST. |
class |
APointerExp
APointerExp represents the pointer alternative of the exp production in the AST. |
class |
AProgram
AProgram represents the alternative of the program production in the AST. |
class |
AReturnStm
AReturnStm represents the return alternative of the stm production in the AST. |
class |
ATimesBinop
ATimesBinop represents the times alternative of the binop production in the AST. |
class |
AVarExp
AVarExp represents the var alternative of the exp production in the AST. |
class |
AWhileStm
AWhileStm represents the while alternative of the stm production in the AST. |
class |
EOF
The EOF token represents the end-of-file marker from an input-file. |
class |
PBinop
PBinop is the super class of all binop classes. |
class |
PBlock
PBlock is the super class of all block classes. |
class |
PBody
PBody is the super class of all body classes. |
class |
PDecl
PDecl is the super class of all decl classes. |
class |
PExp
PExp is the super class of all exp classes. |
class |
PProgram
PProgram is the super class of all program classes. |
class |
PStm
PStm is the super class of all stm classes. |
class |
Start
The Start node is the topmost node in the AST. |
class |
TAnd
TAnd represents a '&' token from the input file. |
class |
TAssign
TAssign represents a '=' token from the input file. |
class |
TComma
TComma represents a ',' token from the input file. |
class |
TCommentBlock
TCommentBlock represents a comment block token from the input file. |
class |
TCommentSingle
TCommentSingle represents a comment single token from the input file. |
class |
TDiv
TDiv represents a '/' token from the input file. |
class |
TElse
TElse represents a 'else' token from the input file. |
class |
TEq
TEq represents a '==' token from the input file. |
class |
TGt
TGt represents a '>' token from the input file. |
class |
TIdentifier
TIdentifier represents a identifier token from the input file. |
class |
TIf
TIf represents a 'if' token from the input file. |
class |
TInput
TInput represents a 'input' token from the input file. |
class |
TIntegerConst
TIntegerConst represents a integer const token from the input file. |
class |
TLBrace
TLBrace represents a '{' token from the input file. |
class |
TLPar
TLPar represents a '(' token from the input file. |
class |
TMalloc
TMalloc represents a 'malloc' token from the input file. |
class |
TMinus
TMinus represents a '-' token from the input file. |
class |
TNull
TNull represents a 'null' token from the input file. |
class |
Token
Token is the superclass of all tokens is the AST. |
class |
TOutput
TOutput represents a 'output' token from the input file. |
class |
TPlus
TPlus represents a '+' token from the input file. |
class |
TRBrace
TRBrace represents a '}' token from the input file. |
class |
TReturn
TReturn represents a 'return' token from the input file. |
class |
TRPar
TRPar represents a ')' token from the input file. |
class |
TSemicolon
TSemicolon represents a ';' token from the input file. |
class |
TStar
TStar represents a '*' token from the input file. |
class |
TVar
TVar represents a 'var' token from the input file. |
class |
TWhile
TWhile represents a 'while' token from the input file. |
class |
TWhiteSpace
TWhiteSpace represents a white space token from the input file. |
class |
AAssignPtrStm
AAssignPtrStm represents the assign_ptr alternative of the stm production in the AST. |
class |
AAssignVarStm
AAssignVarStm represents the assign_var alternative of the stm production in the AST. |
Methods in tip.node that return Node | |
---|---|
Node |
NodeInterface.clone()
|
abstract Node |
Node.clone()
|
Node |
NodeInterface.clone(Map<Node,Node> oldToNewMap)
|
abstract Node |
Node.clone(Map<Node,Node> oldToNewMap)
|
Node |
TreeInvariantException.getNode()
|
Node |
NodeInterface.parent()
Returns the parent node of this node. |
Node |
Node.parent()
Returns the parent node of this node. |
Methods in tip.node with parameters of type Node | |
---|---|
boolean |
SubTypeFilter.accept(Node node)
Returns true if node is a subtype of the class given in
the constructor. |
boolean |
NodeFilter.accept(Node node)
Returns true if node is accepted by the
NodeFilter . |
boolean |
GuardedSubTypeFilter.accept(Node node)
Returns true if node is a subtype of the class given in
the constructor. |
boolean |
SubTypeFilter.guard(Node node)
Returns true if node guards further processesing. |
boolean |
NodeFilter.guard(Node node)
Returns true if node guards further processesing. |
boolean |
GuardedSubTypeFilter.guard(Node node)
Returns true if node guards further processesing. |
void |
NodeInterface.replaceBy(Node node)
Replaces this node by node in the AST. |
void |
Node.replaceBy(Node node)
Replaces this node by node in the AST. |
static void |
RoutingAutomaton.updateTree(Node root)
|
Method parameters in tip.node with type arguments of type Node | |
---|---|
TWhiteSpace |
TWhiteSpace.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TWhiteSpace token while putting all
old node-new node relations in the map oldToNewMap . |
TWhiteSpace |
TWhiteSpace.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TWhiteSpace token while putting all
old node-new node relations in the map oldToNewMap . |
TWhile |
TWhile.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TWhile token while putting all
old node-new node relations in the map oldToNewMap . |
TWhile |
TWhile.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TWhile token while putting all
old node-new node relations in the map oldToNewMap . |
TVar |
TVar.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TVar token while putting all
old node-new node relations in the map oldToNewMap . |
TVar |
TVar.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TVar token while putting all
old node-new node relations in the map oldToNewMap . |
TStar |
TStar.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TStar token while putting all
old node-new node relations in the map oldToNewMap . |
TStar |
TStar.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TStar token while putting all
old node-new node relations in the map oldToNewMap . |
TSemicolon |
TSemicolon.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TSemicolon token while putting all
old node-new node relations in the map oldToNewMap . |
TSemicolon |
TSemicolon.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TSemicolon token while putting all
old node-new node relations in the map oldToNewMap . |
TRPar |
TRPar.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TRPar token while putting all
old node-new node relations in the map oldToNewMap . |
TRPar |
TRPar.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TRPar token while putting all
old node-new node relations in the map oldToNewMap . |
TReturn |
TReturn.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TReturn token while putting all
old node-new node relations in the map oldToNewMap . |
TReturn |
TReturn.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TReturn token while putting all
old node-new node relations in the map oldToNewMap . |
TRBrace |
TRBrace.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TRBrace token while putting all
old node-new node relations in the map oldToNewMap . |
TRBrace |
TRBrace.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TRBrace token while putting all
old node-new node relations in the map oldToNewMap . |
TPlus |
TPlus.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TPlus token while putting all
old node-new node relations in the map oldToNewMap . |
TPlus |
TPlus.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TPlus token while putting all
old node-new node relations in the map oldToNewMap . |
TOutput |
TOutput.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TOutput token while putting all
old node-new node relations in the map oldToNewMap . |
TOutput |
TOutput.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TOutput token while putting all
old node-new node relations in the map oldToNewMap . |
abstract Token |
Token.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this Token node while putting all
old node-new node relations in the map oldToNewMap . |
abstract Token |
Token.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this Token node while putting all
old node-new node relations in the map oldToNewMap . |
TNull |
TNull.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TNull token while putting all
old node-new node relations in the map oldToNewMap . |
TNull |
TNull.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TNull token while putting all
old node-new node relations in the map oldToNewMap . |
TMinus |
TMinus.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TMinus token while putting all
old node-new node relations in the map oldToNewMap . |
TMinus |
TMinus.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TMinus token while putting all
old node-new node relations in the map oldToNewMap . |
TMalloc |
TMalloc.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TMalloc token while putting all
old node-new node relations in the map oldToNewMap . |
TMalloc |
TMalloc.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TMalloc token while putting all
old node-new node relations in the map oldToNewMap . |
TLPar |
TLPar.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TLPar token while putting all
old node-new node relations in the map oldToNewMap . |
TLPar |
TLPar.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TLPar token while putting all
old node-new node relations in the map oldToNewMap . |
TLBrace |
TLBrace.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TLBrace token while putting all
old node-new node relations in the map oldToNewMap . |
TLBrace |
TLBrace.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TLBrace token while putting all
old node-new node relations in the map oldToNewMap . |
TIntegerConst |
TIntegerConst.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TIntegerConst token while putting all
old node-new node relations in the map oldToNewMap . |
TIntegerConst |
TIntegerConst.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TIntegerConst token while putting all
old node-new node relations in the map oldToNewMap . |
TInput |
TInput.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TInput token while putting all
old node-new node relations in the map oldToNewMap . |
TInput |
TInput.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TInput token while putting all
old node-new node relations in the map oldToNewMap . |
TIf |
TIf.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TIf token while putting all
old node-new node relations in the map oldToNewMap . |
TIf |
TIf.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TIf token while putting all
old node-new node relations in the map oldToNewMap . |
TIdentifier |
TIdentifier.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TIdentifier token while putting all
old node-new node relations in the map oldToNewMap . |
TIdentifier |
TIdentifier.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TIdentifier token while putting all
old node-new node relations in the map oldToNewMap . |
TGt |
TGt.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TGt token while putting all
old node-new node relations in the map oldToNewMap . |
TGt |
TGt.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TGt token while putting all
old node-new node relations in the map oldToNewMap . |
TEq |
TEq.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TEq token while putting all
old node-new node relations in the map oldToNewMap . |
TEq |
TEq.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TEq token while putting all
old node-new node relations in the map oldToNewMap . |
TElse |
TElse.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TElse token while putting all
old node-new node relations in the map oldToNewMap . |
TElse |
TElse.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TElse token while putting all
old node-new node relations in the map oldToNewMap . |
TDiv |
TDiv.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TDiv token while putting all
old node-new node relations in the map oldToNewMap . |
TDiv |
TDiv.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TDiv token while putting all
old node-new node relations in the map oldToNewMap . |
TCommentSingle |
TCommentSingle.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TCommentSingle token while putting all
old node-new node relations in the map oldToNewMap . |
TCommentSingle |
TCommentSingle.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TCommentSingle token while putting all
old node-new node relations in the map oldToNewMap . |
TCommentBlock |
TCommentBlock.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TCommentBlock token while putting all
old node-new node relations in the map oldToNewMap . |
TCommentBlock |
TCommentBlock.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TCommentBlock token while putting all
old node-new node relations in the map oldToNewMap . |
TComma |
TComma.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TComma token while putting all
old node-new node relations in the map oldToNewMap . |
TComma |
TComma.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TComma token while putting all
old node-new node relations in the map oldToNewMap . |
TAssign |
TAssign.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TAssign token while putting all
old node-new node relations in the map oldToNewMap . |
TAssign |
TAssign.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TAssign token while putting all
old node-new node relations in the map oldToNewMap . |
TAnd |
TAnd.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TAnd token while putting all
old node-new node relations in the map oldToNewMap . |
TAnd |
TAnd.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this TAnd token while putting all
old node-new node relations in the map oldToNewMap . |
Start |
Start.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this Start node while putting all
old node-new node relations in the map oldToNewMap . |
Start |
Start.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this Start node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PStm |
PStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PStm node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PStm |
PStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PStm node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PProgram |
PProgram.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PProgram node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PProgram |
PProgram.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PProgram node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PExp |
PExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PExp node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PExp |
PExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PExp node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PDecl |
PDecl.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PDecl node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PDecl |
PDecl.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PDecl node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PBody |
PBody.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PBody node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PBody |
PBody.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PBody node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PBlock |
PBlock.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PBlock node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PBlock |
PBlock.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PBlock node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PBinop |
PBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PBinop node while putting all
old node-new node relations in the map oldToNewMap . |
abstract PBinop |
PBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this PBinop node while putting all
old node-new node relations in the map oldToNewMap . |
Node |
NodeInterface.clone(Map<Node,Node> oldToNewMap)
|
Node |
NodeInterface.clone(Map<Node,Node> oldToNewMap)
|
abstract Node |
Node.clone(Map<Node,Node> oldToNewMap)
|
abstract Node |
Node.clone(Map<Node,Node> oldToNewMap)
|
EOF |
EOF.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this EOF token while putting all
old node-new node relations in the map oldToNewMap . |
EOF |
EOF.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this EOF token while putting all
old node-new node relations in the map oldToNewMap . |
AWhileStm |
AWhileStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AWhileStm node while putting all
old node-new node relations in the map oldToNewMap . |
AWhileStm |
AWhileStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AWhileStm node while putting all
old node-new node relations in the map oldToNewMap . |
AVarExp |
AVarExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AVarExp node while putting all
old node-new node relations in the map oldToNewMap . |
AVarExp |
AVarExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AVarExp node while putting all
old node-new node relations in the map oldToNewMap . |
ATimesBinop |
ATimesBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ATimesBinop node while putting all
old node-new node relations in the map oldToNewMap . |
ATimesBinop |
ATimesBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ATimesBinop node while putting all
old node-new node relations in the map oldToNewMap . |
AReturnStm |
AReturnStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AReturnStm node while putting all
old node-new node relations in the map oldToNewMap . |
AReturnStm |
AReturnStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AReturnStm node while putting all
old node-new node relations in the map oldToNewMap . |
AProgram |
AProgram.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AProgram node while putting all
old node-new node relations in the map oldToNewMap . |
AProgram |
AProgram.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AProgram node while putting all
old node-new node relations in the map oldToNewMap . |
APointerExp |
APointerExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this APointerExp node while putting all
old node-new node relations in the map oldToNewMap . |
APointerExp |
APointerExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this APointerExp node while putting all
old node-new node relations in the map oldToNewMap . |
APlusBinop |
APlusBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this APlusBinop node while putting all
old node-new node relations in the map oldToNewMap . |
APlusBinop |
APlusBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this APlusBinop node while putting all
old node-new node relations in the map oldToNewMap . |
AOutputStm |
AOutputStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AOutputStm node while putting all
old node-new node relations in the map oldToNewMap . |
AOutputStm |
AOutputStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AOutputStm node while putting all
old node-new node relations in the map oldToNewMap . |
ANullExp |
ANullExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ANullExp node while putting all
old node-new node relations in the map oldToNewMap . |
ANullExp |
ANullExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ANullExp node while putting all
old node-new node relations in the map oldToNewMap . |
AMinusBinop |
AMinusBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AMinusBinop node while putting all
old node-new node relations in the map oldToNewMap . |
AMinusBinop |
AMinusBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AMinusBinop node while putting all
old node-new node relations in the map oldToNewMap . |
AMallocExp |
AMallocExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AMallocExp node while putting all
old node-new node relations in the map oldToNewMap . |
AMallocExp |
AMallocExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AMallocExp node while putting all
old node-new node relations in the map oldToNewMap . |
ALocalDecl |
ALocalDecl.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ALocalDecl node while putting all
old node-new node relations in the map oldToNewMap . |
ALocalDecl |
ALocalDecl.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ALocalDecl node while putting all
old node-new node relations in the map oldToNewMap . |
AIntConstExp |
AIntConstExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AIntConstExp node while putting all
old node-new node relations in the map oldToNewMap . |
AIntConstExp |
AIntConstExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AIntConstExp node while putting all
old node-new node relations in the map oldToNewMap . |
AInputExp |
AInputExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AInputExp node while putting all
old node-new node relations in the map oldToNewMap . |
AInputExp |
AInputExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AInputExp node while putting all
old node-new node relations in the map oldToNewMap . |
AIfThenStm |
AIfThenStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AIfThenStm node while putting all
old node-new node relations in the map oldToNewMap . |
AIfThenStm |
AIfThenStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AIfThenStm node while putting all
old node-new node relations in the map oldToNewMap . |
AIfThenElseStm |
AIfThenElseStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AIfThenElseStm node while putting all
old node-new node relations in the map oldToNewMap . |
AIfThenElseStm |
AIfThenElseStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AIfThenElseStm node while putting all
old node-new node relations in the map oldToNewMap . |
AGtBinop |
AGtBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AGtBinop node while putting all
old node-new node relations in the map oldToNewMap . |
AGtBinop |
AGtBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AGtBinop node while putting all
old node-new node relations in the map oldToNewMap . |
AFunctionPtrCallExp |
AFunctionPtrCallExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AFunctionPtrCallExp node while putting all
old node-new node relations in the map oldToNewMap . |
AFunctionPtrCallExp |
AFunctionPtrCallExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AFunctionPtrCallExp node while putting all
old node-new node relations in the map oldToNewMap . |
AFunctionCallExp |
AFunctionCallExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AFunctionCallExp node while putting all
old node-new node relations in the map oldToNewMap . |
AFunctionCallExp |
AFunctionCallExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AFunctionCallExp node while putting all
old node-new node relations in the map oldToNewMap . |
AFuncDecl |
AFuncDecl.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AFuncDecl node while putting all
old node-new node relations in the map oldToNewMap . |
AFuncDecl |
AFuncDecl.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AFuncDecl node while putting all
old node-new node relations in the map oldToNewMap . |
AEqBinop |
AEqBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AEqBinop node while putting all
old node-new node relations in the map oldToNewMap . |
AEqBinop |
AEqBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AEqBinop node while putting all
old node-new node relations in the map oldToNewMap . |
ADivideBinop |
ADivideBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ADivideBinop node while putting all
old node-new node relations in the map oldToNewMap . |
ADivideBinop |
ADivideBinop.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ADivideBinop node while putting all
old node-new node relations in the map oldToNewMap . |
ADerefExp |
ADerefExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ADerefExp node while putting all
old node-new node relations in the map oldToNewMap . |
ADerefExp |
ADerefExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ADerefExp node while putting all
old node-new node relations in the map oldToNewMap . |
ADeclStm |
ADeclStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ADeclStm node while putting all
old node-new node relations in the map oldToNewMap . |
ADeclStm |
ADeclStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ADeclStm node while putting all
old node-new node relations in the map oldToNewMap . |
ABody |
ABody.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ABody node while putting all
old node-new node relations in the map oldToNewMap . |
ABody |
ABody.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ABody node while putting all
old node-new node relations in the map oldToNewMap . |
ABlockStm |
ABlockStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ABlockStm node while putting all
old node-new node relations in the map oldToNewMap . |
ABlockStm |
ABlockStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ABlockStm node while putting all
old node-new node relations in the map oldToNewMap . |
ABlock |
ABlock.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ABlock node while putting all
old node-new node relations in the map oldToNewMap . |
ABlock |
ABlock.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ABlock node while putting all
old node-new node relations in the map oldToNewMap . |
ABinopExp |
ABinopExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ABinopExp node while putting all
old node-new node relations in the map oldToNewMap . |
ABinopExp |
ABinopExp.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this ABinopExp node while putting all
old node-new node relations in the map oldToNewMap . |
AAssignVarStm |
AAssignVarStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AAssignVarStm node while putting all
old node-new node relations in the map oldToNewMap . |
AAssignVarStm |
AAssignVarStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AAssignVarStm node while putting all
old node-new node relations in the map oldToNewMap . |
AAssignPtrStm |
AAssignPtrStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AAssignPtrStm node while putting all
old node-new node relations in the map oldToNewMap . |
AAssignPtrStm |
AAssignPtrStm.clone(Map<Node,Node> oldToNewMap)
Creates a deep clone of this AAssignPtrStm node while putting all
old node-new node relations in the map oldToNewMap . |
Constructors in tip.node with parameters of type Node | |
---|---|
NodeList(Node parent,
String name,
boolean empty_allowed)
|
|
NodeList(Node parent,
String name,
boolean empty_allowed,
Collection<? extends E> c)
|
|
TreeInvariantException(Node node,
String message)
|
Uses of Node in tip.util |
---|
Classes in tip.util with type parameters of type Node | |
---|---|
class |
SubExpressions<T extends Node>
SubExpressions implements the CFGAnswerAdapter to retrieve
child nodes accepted by a NodeFilter in subexpressions of nodes
associated with program points in a control flow graph. |
Methods in tip.util with parameters of type Node | |
---|---|
Collection<T> |
SubExpressions.caseEntryPoint(Node node,
EntryPoint point)
Returns an empty set of nodes. |
Collection<T> |
SubExpressions.caseExitPoint(Node node,
ExitPoint point)
Returns an empty set of nodes. |
static Collection<PDecl> |
DeclCollector.collectDecls(Node node)
Collects all PDecl nodes referred to in the subtree of node . |
static Collection<ALocalDecl> |
LocalDeclCollector.collectLocalDecls(Node node)
Collects all ALocalDecl nodes referred to in the subtree of
node . |
Collection<T> |
SubExpressions.defaultNode(Node node,
IProgramPoint point)
Returns all child nodes of node accepted by the filter. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |