System and method for converting control flow graph representations to control-dataflow graph representations
First Claim
1. A method of forming a control-dataflow graph comprising:
- separating a control flow graph into two or more basic blocks; and
converting said two or more basic blocks into code blocks, wherein the code blocks are formed into the control-dataflow graph.
9 Assignments
0 Petitions
Accused Products
Abstract
An embodiment of the invention includes a method of forming a control-dataflow graph that includes separating a control flow graph into two or more basic blocks, and converting said two or more basic blocks into code blocks, where the code blocks are formed into the control-dataflow graph. Another embodiment of the invention includes a method of forming a control-dataflow graph that includes separating a control flow graph into two or more basic blocks, forming a lode node in at least one of said basic blocks, forming a store node in at least one of said code blocks, inserting a delay node in at least one of said code blocks, segregating external hardware logic modules from said control flow graph, and converting said two or more basic blocks into code blocks, wherein the code blocks are formed into the control-dataflow graph.
103 Citations
5 Claims
-
1. A method of forming a control-dataflow graph comprising:
-
separating a control flow graph into two or more basic blocks; and
converting said two or more basic blocks into code blocks, wherein the code blocks are formed into the control-dataflow graph. - View Dependent Claims (2, 3, 4, 5)
-
Specification