diff options
author | Simon Pilgrim <llvm-dev@redking.me.uk> | 2017-03-30 14:13:19 +0000 |
---|---|---|
committer | Simon Pilgrim <llvm-dev@redking.me.uk> | 2017-03-30 14:13:19 +0000 |
commit | 2c51880a828ec68ea11353c27ba42ab75ac85a45 (patch) | |
tree | f0e919019a8720ae3cb1f8faf36014faddd9e768 /clang/lib/Analysis/ThreadSafetyTIL.cpp | |
parent | 2aa23e892c14487e6703bbf48c356694b98d47eb (diff) | |
download | bcm5719-llvm-2c51880a828ec68ea11353c27ba42ab75ac85a45.tar.gz bcm5719-llvm-2c51880a828ec68ea11353c27ba42ab75ac85a45.zip |
Spelling mistakes in comments. NFCI. (PR27635)
llvm-svn: 299083
Diffstat (limited to 'clang/lib/Analysis/ThreadSafetyTIL.cpp')
-rw-r--r-- | clang/lib/Analysis/ThreadSafetyTIL.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/clang/lib/Analysis/ThreadSafetyTIL.cpp b/clang/lib/Analysis/ThreadSafetyTIL.cpp index 2923f7e66a6..83aa90435e2 100644 --- a/clang/lib/Analysis/ThreadSafetyTIL.cpp +++ b/clang/lib/Analysis/ThreadSafetyTIL.cpp @@ -186,8 +186,8 @@ int BasicBlock::topologicalSort(SimpleArray<BasicBlock*>& Blocks, int ID) { // // This sort assumes that (1) dominators have been computed, (2) there are no // critical edges, and (3) the entry block is reachable from the exit block -// and no blocks are accessable via traversal of back-edges from the exit that -// weren't accessable via forward edges from the entry. +// and no blocks are accessible via traversal of back-edges from the exit that +// weren't accessible via forward edges from the entry. int BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock*>& Blocks, int ID) { // Visited is assumed to have been set by the topologicalSort. This pass // assumes !Visited means that we've visited this node before. |