diff options
| author | Tanya Lattner <tonic@nondot.org> | 2003-08-28 17:17:59 +0000 |
|---|---|---|
| committer | Tanya Lattner <tonic@nondot.org> | 2003-08-28 17:17:59 +0000 |
| commit | 3b6b6ba4be1fc67809e81f750f664363f947aa1c (patch) | |
| tree | f1316521a6785286f7c307e01a8b2f55d92ddc37 /lib/CodeGen/ModuloScheduling | |
| parent | 4f839ccf4905906f6cb4327614c043aa4cafe554 (diff) | |
Removing README
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8180 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/CodeGen/ModuloScheduling')
| -rw-r--r-- | lib/CodeGen/ModuloScheduling/ModuloSchedGraph.cpp | 4 | ||||
| -rw-r--r-- | lib/CodeGen/ModuloScheduling/README | 33 |
2 files changed, 2 insertions, 35 deletions
diff --git a/lib/CodeGen/ModuloScheduling/ModuloSchedGraph.cpp b/lib/CodeGen/ModuloScheduling/ModuloSchedGraph.cpp index 1bdbb1a976..68b8ee39d5 100644 --- a/lib/CodeGen/ModuloScheduling/ModuloSchedGraph.cpp +++ b/lib/CodeGen/ModuloScheduling/ModuloSchedGraph.cpp @@ -71,8 +71,8 @@ void ModuloSchedGraph::addDepEdges() { //Create edge and set delay equal to node latency //FIXME: Is it safe to do this? ModuloSchedGraph::iterator Src = find(I); - SchedGraphEdge *trueDep = new SchedGraphEdge(&*Src->second ,&*Sink->second, &*I, - SchedGraphEdge::TrueDep, + SchedGraphEdge *trueDep = new SchedGraphEdge(&*Src->second ,&*Sink->second, + &*I, SchedGraphEdge::TrueDep, Src->second->getLatency()); //Determine the iteration difference //FIXME: Will this ever happen? diff --git a/lib/CodeGen/ModuloScheduling/README b/lib/CodeGen/ModuloScheduling/README deleted file mode 100644 index 3206161ab4..0000000000 --- a/lib/CodeGen/ModuloScheduling/README +++ /dev/null @@ -1,33 +0,0 @@ -The modulo scheduling pass impliment modulo scheduling for llvm instruction. It includes two passes - - -1. building graph -The pass will build an instance of class ModuloSchedGraph for each loop-including basicblock in a function. The steps to build a graph: - a)build one node for each instruction in the basicblock - ---ModuloScheduGraph::buildNodesforBB() - b)add def-use edges - ---ModuloScheduGraph::addDefUseEdges() - c)add cd edges - ---ModuloScheduGraph::addCDEdges() - d)add mem dependency edges - ---ModuloScheduGraph::addMemEdges() - e)compute resource restriction II and recurrenct II - ---ModuloScheduGraph::computeResII() - ---ModuloScheduGraph::computeRecII() - f)compute each node's property, including ASAP,ALAP, Mov, Depth and Height. - ---ModuloScheduGraph::computeNodeProperty - g)sort all nodes - ---ModuloScheduGraph::orderNodes() - - -2. compute schedule -The second step is to compute a schule and replace the orginal basic block with three basicblocks: prelogue, kernelblock and epilog. - - a)compute the schedule according the algorithm described in the paper - ---ModuloScheduling::computeSchedule() - - b)replace the original basicblock.(to be done) - ---ModuloScheduling::constructPrologue(); - ---ModuloScheduling::constructKernel(); - ---ModuloScheduling::constructEpilogue(); - These three functions are not working yet. |