com.google.javascript.jscomp

Class ControlFlowAnalysis.AstControlFlowGraph

java.lang.Object

com.google.javascript.jscomp.graph.Graph<N,E>

com.google.javascript.jscomp.graph.DiGraph<N,E>

com.google.javascript.jscomp.graph.LinkedDirectedGraph<N,ControlFlowGraph.Branch>

com.google.javascript.jscomp.ControlFlowGraph<Node>

com.google.javascript.jscomp.ControlFlowAnalysis.AstControlFlowGraph

All Implemented Interfaces:

AdjacencyGraph<Node,ControlFlowGraph.Branch>, GraphvizGraph

Enclosing class:

ControlFlowAnalysis

private static class ControlFlowAnalysis.AstControlFlowGraph
extends ControlFlowGraph<Node>

A ControlFlowGraph which provides a node comparator based on the pre-order traversal of the AST.

Nested Class Summary

Nested classes/interfaces inherited from class com.google.javascript.jscomp.ControlFlowGraph

ControlFlowGraph.AbstractCfgNodeTraversalCallback, ControlFlowGraph.Branch

Nested classes/interfaces inherited from class com.google.javascript.jscomp.graph.LinkedDirectedGraph

LinkedDirectedGraph.LinkedDirectedGraphNode<N,E>

Nested classes/interfaces inherited from class com.google.javascript.jscomp.graph.DiGraph

DiGraph.DiGraphEdge<N,E>, DiGraph.DiGraphNode<N,E>

Nested classes/interfaces inherited from class com.google.javascript.jscomp.graph.Graph

Graph.GraphEdge<N,E>

Nested classes/interfaces inherited from interface com.google.javascript.jscomp.graph.GraphvizGraph

GraphvizGraph.GraphvizEdge, GraphvizGraph.GraphvizNode

Field Summary

Fields

Modifier and Type	Field and Description
private java.util.Map<DiGraph.DiGraphNode<Node,ControlFlowGraph.Branch>,java.lang.Integer>	priorities

Fields inherited from class com.google.javascript.jscomp.graph.LinkedDirectedGraph

nodes

Constructor Summary

Constructors

Modifier	Constructor and Description
private	AstControlFlowGraph(Node entry, java.util.Map<DiGraph.DiGraphNode<Node,ControlFlowGraph.Branch>,java.lang.Integer> priorities, boolean edgeAnnotations) Constructor.

Method Summary

Modifier and Type	Method and Description
java.util.Comparator<DiGraph.DiGraphNode<Node,ControlFlowGraph.Branch>>	getOptionalNodeComparator(boolean isForward) Gets a comparator for the nodes.
private int	getPosition(DiGraph.DiGraphNode<Node,ControlFlowGraph.Branch> n) Gets the pre-order traversal position of the given node.

Methods inherited from class com.google.javascript.jscomp.ControlFlowGraph

getEntry, getImplicitReturn, isEnteringNewCfgNode, isImplicitReturn, toString

Methods inherited from class com.google.javascript.jscomp.graph.LinkedDirectedGraph

connect, connect, connectIfNotConnectedInDirection, create, createDirectedGraphNode, createNode, createWithoutAnnotations, disconnect, disconnectInDirection, getDirectedGraphEdges, getDirectedGraphNode, getDirectedGraphNodes, getDirectedPredNodes, getDirectedPredNodes, getDirectedSuccNodes, getDirectedSuccNodes, getEdges, getEdges, getFirstEdge, getGraphvizEdges, getGraphvizNodes, getInEdges, getName, getNeighborNodes, getNode, getNodeDegree, getNodes, getOutEdges, isConnectedInDirection, isConnectedInDirection, isConnectedInDirection, isDirected, newSubGraph

Methods inherited from class com.google.javascript.jscomp.graph.DiGraph

isConnected, isConnected

Methods inherited from class com.google.javascript.jscomp.graph.Graph

clearEdgeAnnotations, clearNodeAnnotations, connectIfNotFound, getWeight, hasNode, popEdgeAnnotations, popNodeAnnotations, pushEdgeAnnotations, pushNodeAnnotations

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

priorities

private final java.util.Map<DiGraph.DiGraphNode<Node,ControlFlowGraph.Branch>,java.lang.Integer> priorities

Constructor Detail

AstControlFlowGraph

private AstControlFlowGraph(Node entry,
                            java.util.Map<DiGraph.DiGraphNode<Node,ControlFlowGraph.Branch>,java.lang.Integer> priorities,
                            boolean edgeAnnotations)

Constructor.

Parameters:

entry - The entry node.

priorities - The map from nodes to position in the AST (to be filled by the ControlFlowAnalysis.shouldTraverse(com.google.javascript.jscomp.NodeTraversal, com.google.javascript.rhino.Node, com.google.javascript.rhino.Node)).

Method Detail

getOptionalNodeComparator

public java.util.Comparator<DiGraph.DiGraphNode<Node,ControlFlowGraph.Branch>> getOptionalNodeComparator(boolean isForward)

Description copied from class: ControlFlowGraph

Gets a comparator for the nodes. The default implementation returns null. See ControlFlowGraph.getOptionalNodeComparator(boolean).

Overrides:

getOptionalNodeComparator in class ControlFlowGraph<Node>

Parameters:

isForward - Whether the comparator sorts the nodes in the direction of the flow.

Returns:

a comparator or null (in particular, if not overridden)

getPosition

private int getPosition(DiGraph.DiGraphNode<Node,ControlFlowGraph.Branch> n)

Gets the pre-order traversal position of the given node.

Returns:

An arbitrary counter used for comparing positions.