diff options
author | Hiroshi Inoue <inouehrs@jp.ibm.com> | 2019-02-05 08:30:48 +0000 |
---|---|---|
committer | Hiroshi Inoue <inouehrs@jp.ibm.com> | 2019-02-05 08:30:48 +0000 |
commit | 02a2bb2f54659e7830946bd20ee121ce7d80ff65 (patch) | |
tree | 8a5e425f5eaeb24395609d5934f142f58fa9c67d /llvm/lib/Analysis/MemorySSAUpdater.cpp | |
parent | ccd4e5e01684f7f05ea329a475a0b7a62b311039 (diff) | |
download | bcm5719-llvm-02a2bb2f54659e7830946bd20ee121ce7d80ff65.tar.gz bcm5719-llvm-02a2bb2f54659e7830946bd20ee121ce7d80ff65.zip |
[NFC] fix trivial typos in comments
llvm-svn: 353147
Diffstat (limited to 'llvm/lib/Analysis/MemorySSAUpdater.cpp')
-rw-r--r-- | llvm/lib/Analysis/MemorySSAUpdater.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/llvm/lib/Analysis/MemorySSAUpdater.cpp b/llvm/lib/Analysis/MemorySSAUpdater.cpp index 54cd265aaa9..53950be58db 100644 --- a/llvm/lib/Analysis/MemorySSAUpdater.cpp +++ b/llvm/lib/Analysis/MemorySSAUpdater.cpp @@ -598,7 +598,7 @@ void MemorySSAUpdater::applyUpdates(ArrayRef<CFGUpdate> Updates, if (!RevDeleteUpdates.empty()) { // Update for inserted edges: use newDT and snapshot CFG as if deletes had - // not occured. + // not occurred. // FIXME: This creates a new DT, so it's more expensive to do mix // delete/inserts vs just inserts. We can do an incremental update on the DT // to revert deletes, than re-delete the edges. Teaching DT to do this, is @@ -696,7 +696,7 @@ void MemorySSAUpdater::applyInsertUpdates(ArrayRef<CFGUpdate> Updates, // Map a BB to its predecessors: added + previously existing. To get a // deterministic order, store predecessors as SetVectors. The order in each - // will be defined by teh order in Updates (fixed) and the order given by + // will be defined by the order in Updates (fixed) and the order given by // children<> (also fixed). Since we further iterate over these ordered sets, // we lose the information of multiple edges possibly existing between two // blocks, so we'll keep and EdgeCount map for that. |