diff options
| author | Chris Lattner <sabre@nondot.org> | 2003-08-21 22:05:57 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2003-08-21 22:05:57 +0000 |
| commit | e287cfdfd0815ac5c80c72c0913a45ca98993a28 (patch) | |
| tree | 4bc37aeeadeb5de31e49c895db9a9313ee0af2db /lib | |
| parent | 36bc6424f2fef97ef8a2b7150e3fb9147c5901c8 (diff) | |
| download | llvm-e287cfdfd0815ac5c80c72c0913a45ca98993a28.tar.gz llvm-e287cfdfd0815ac5c80c72c0913a45ca98993a28.tar.bz2 llvm-e287cfdfd0815ac5c80c72c0913a45ca98993a28.tar.xz | |
Fix spello
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8029 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib')
| -rw-r--r-- | lib/CodeGen/ModuloScheduling/ModuloSchedGraph.cpp | 2 | ||||
| -rw-r--r-- | lib/Target/SparcV9/ModuloScheduling/ModuloSchedGraph.cpp | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/lib/CodeGen/ModuloScheduling/ModuloSchedGraph.cpp b/lib/CodeGen/ModuloScheduling/ModuloSchedGraph.cpp index b135ff2ddf..a29722aa61 100644 --- a/lib/CodeGen/ModuloScheduling/ModuloSchedGraph.cpp +++ b/lib/CodeGen/ModuloScheduling/ModuloSchedGraph.cpp @@ -1064,7 +1064,7 @@ ModuloSchedGraph::computeRecII(const BasicBlock *bb){ //FIXME: only deal with circuits starting at the first node: the phi node //nodeId=2; - //search all elementary circuits in the dependance graph + //search all elementary circuits in the dependence graph //assume maximum number of nodes is MAXNODE unsigned path[MAXNODE]; diff --git a/lib/Target/SparcV9/ModuloScheduling/ModuloSchedGraph.cpp b/lib/Target/SparcV9/ModuloScheduling/ModuloSchedGraph.cpp index b135ff2ddf..a29722aa61 100644 --- a/lib/Target/SparcV9/ModuloScheduling/ModuloSchedGraph.cpp +++ b/lib/Target/SparcV9/ModuloScheduling/ModuloSchedGraph.cpp @@ -1064,7 +1064,7 @@ ModuloSchedGraph::computeRecII(const BasicBlock *bb){ //FIXME: only deal with circuits starting at the first node: the phi node //nodeId=2; - //search all elementary circuits in the dependance graph + //search all elementary circuits in the dependence graph //assume maximum number of nodes is MAXNODE unsigned path[MAXNODE]; |