maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Test commit: fix typos 

Just fixing a few typos in comments to test commit access.

llvm-svn: 304149
This commit is contained in:
Mattias Eriksson 2017-05-29 11:46:44 +00:00
parent 8bb436eb26
commit b808e99a55
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
llvm/include/llvm/CodeGen/ScheduleDAG.h
View File

@ -52,14 +52,14 @@ class TargetRegisterInfo;
/// These are the different kinds of scheduling dependencies. /// These are the different kinds of scheduling dependencies.
enum Kind { enum Kind {
Data, ///< Regular data dependence (aka true-dependence). 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). Output, ///< A register output-dependence (aka WAW).
Order ///< Any other ordering dependency. Order ///< Any other ordering dependency.
}; };
// Strong dependencies must be respected by the scheduler. Artificial // Strong dependencies must be respected by the scheduler. Artificial
// dependencies may be removed only if they are redundant with another // 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 // Weak dependencies may be violated by the scheduling strategy, but only if
// the strategy can prove it is correct to do so. // 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 /// BoundaryNodes can have DAG edges, including Data edges, but they do not
/// correspond to schedulable entities (e.g. instructions) and do not have a /// correspond to schedulable entities (e.g. instructions) and do not have a
/// valid ID. Consequently, always check for boundary nodes before accessing /// 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; } bool isBoundaryNode() const { return NodeNum == BoundaryID; }
/// Assigns the representative SDNode for this SUnit. This may be used /// Assigns the representative SDNode for this SUnit. This may be used