diff options
| author | Mattias Eriksson <mattias.v.eriksson@ericsson.com> | 2017-05-29 11:46:44 +0000 |
|---|---|---|
| committer | Mattias Eriksson <mattias.v.eriksson@ericsson.com> | 2017-05-29 11:46:44 +0000 |
| commit | b808e99a558fceed89d39d76895615b584567f95 (patch) | |
| tree | f32ceef6c55e9a705c9806c3bcbe3dc7b8e6feb8 /llvm | |
| parent | 8bb436eb26425ad34086e4fae1c06b5a01da4a65 (diff) | |
| download | bcm5719-llvm-b808e99a558fceed89d39d76895615b584567f95.tar.gz bcm5719-llvm-b808e99a558fceed89d39d76895615b584567f95.zip | |
Test commit: fix typos
Just fixing a few typos in comments to test commit access.
llvm-svn: 304149
Diffstat (limited to 'llvm')
| -rw-r--r-- | llvm/include/llvm/CodeGen/ScheduleDAG.h | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/llvm/include/llvm/CodeGen/ScheduleDAG.h b/llvm/include/llvm/CodeGen/ScheduleDAG.h index 99afd8c5c9a..97aa2aace82 100644 --- a/llvm/include/llvm/CodeGen/ScheduleDAG.h +++ b/llvm/include/llvm/CodeGen/ScheduleDAG.h @@ -52,14 +52,14 @@ class TargetRegisterInfo; /// These are the different kinds of scheduling dependencies. enum Kind { Data, ///< Regular data dependence (aka true-dependence). - Anti, ///< A register anti-dependedence (aka WAR). + Anti, ///< A register anti-dependence (aka WAR). Output, ///< A register output-dependence (aka WAW). Order ///< Any other ordering dependency. }; // Strong dependencies must be respected by the scheduler. Artificial // dependencies may be removed only if they are redundant with another - // strong depedence. + // strong dependence. // // Weak dependencies may be violated by the scheduling strategy, but only if // the strategy can prove it is correct to do so. @@ -342,7 +342,7 @@ class TargetRegisterInfo; /// BoundaryNodes can have DAG edges, including Data edges, but they do not /// correspond to schedulable entities (e.g. instructions) and do not have a /// valid ID. Consequently, always check for boundary nodes before accessing - /// an assoicative data structure keyed on node ID. + /// an associative data structure keyed on node ID. bool isBoundaryNode() const { return NodeNum == BoundaryID; } /// Assigns the representative SDNode for this SUnit. This may be used |

