Class CrossChunkReferenceCollector
- All Implemented Interfaces:
CompilerPass,NodeTraversal.Callback,NodeTraversal.ScopedCallback
CrossChunkCodeMotion.-
Method Summary
Modifier and TypeMethodDescriptionvoidUpdates block stack and invokes any additional behavior.voidUpdates block stack and invokes any additional behavior.voidvoidConvenience method for running this pass over a tree with this class as a callback.booleanshouldTraverse(NodeTraversal t, Node n, Node parent) Visits a node in preorder (before its children) and decides whether the node and its children should be traversed.voidvisit(NodeTraversal t, Node n, Node parent) For each node, update the block stack and reference collection as appropriate.
-
Method Details
-
process
Convenience method for running this pass over a tree with this class as a callback.- Specified by:
processin interfaceCompilerPass- Parameters:
externs- Top of external JS treeroot- Top of JS tree
-
process
-
visit
For each node, update the block stack and reference collection as appropriate.- Specified by:
visitin interfaceNodeTraversal.Callback- Parameters:
t- The current traversal.n- The current node.parent- The parent of the current node.
-
enterScope
Updates block stack and invokes any additional behavior.- Specified by:
enterScopein interfaceNodeTraversal.ScopedCallback
-
exitScope
Updates block stack and invokes any additional behavior.- Specified by:
exitScopein interfaceNodeTraversal.ScopedCallback
-
shouldTraverse
Description copied from interface:NodeTraversal.CallbackVisits a node in preorder (before its children) and decides whether the node and its children should be traversed.If this method returns true, the node will be visited by
NodeTraversal.Callback.visit(NodeTraversal, Node, Node)in postorder and its children will be visited by bothNodeTraversal.Callback.shouldTraverse(NodeTraversal, Node, Node)in preorder and byNodeTraversal.Callback.visit(NodeTraversal, Node, Node)in postorder.If this method returns false, the node will not be visited by
NodeTraversal.Callback.visit(NodeTraversal, Node, Node)and its children will neither be visited byNodeTraversal.Callback.shouldTraverse(NodeTraversal, Node, Node)norNodeTraversal.Callback.visit(NodeTraversal, Node, Node).Siblings are always visited left-to-right.
Implementations can have side-effects (e.g. modify the parse tree). Removing the current node is legal, but removing or reordering nodes above the current node may cause nodes to be visited twice or not at all.
- Specified by:
shouldTraversein interfaceNodeTraversal.Callback- Parameters:
t- The current traversal.n- The current node.parent- The parent of the current node.- Returns:
- whether the children of this node should be visited
-