DescriptionInitial implementation of an edge-labeled instruction flow graph.
The flow graph is built by walking the AST. Edges are labeled with
instructions (AST nodes). Normal nodes have a single predecessor edge and a
single (labeled) successor edge. Branch nodes are explicit, they have a
single predecessor edge and a pair of (unlabeled) successor edges. Merge
nodes are explicit, they have a pair of predecessor edges and a single
(unlabeled) successor edge.
There is a distinguished (normal) entry node and a distinguished (special)
exit node with arbitrarily many predecessor edges and no successor edges.
The graph is intended to support graph-based analysis and transformation.
Committed: http://code.google.com/p/v8/source/detail?r=4051
Patch Set 1 #Patch Set 2 : Change to node-labeled basic block flow graph. #Patch Set 3 : Remove unused depth-first search function. #
Total comments: 4
Messages
Total messages: 3 (0 generated)
|