diff options
| author | David Tellenbach <david.tellenbach@arm.com> | 2019-10-30 16:28:11 +0000 |
|---|---|---|
| committer | David Tellenbach <david.tellenbach@arm.com> | 2019-10-30 16:28:11 +0000 |
| commit | fbe7f5e9729ac24374182fca92242f88baa08f90 (patch) | |
| tree | 8650a9ab99a6e2d9d4559a4bc68e3f97b1559c6c /llvm/lib/CodeGen | |
| parent | 8548e2f543ce74854da3ef0e3ae7d02b3e71b785 (diff) | |
| download | bcm5719-llvm-fbe7f5e9729ac24374182fca92242f88baa08f90.tar.gz bcm5719-llvm-fbe7f5e9729ac24374182fca92242f88baa08f90.zip | |
[NFC][MachineOutliner] Fix typo in comment
Diffstat (limited to 'llvm/lib/CodeGen')
| -rw-r--r-- | llvm/lib/CodeGen/MachineOutliner.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/llvm/lib/CodeGen/MachineOutliner.cpp b/llvm/lib/CodeGen/MachineOutliner.cpp index b51baed5086..f26ebcb44ff 100644 --- a/llvm/lib/CodeGen/MachineOutliner.cpp +++ b/llvm/lib/CodeGen/MachineOutliner.cpp @@ -1009,7 +1009,7 @@ void MachineOutliner::findCandidates( FunctionList.clear(); SuffixTree ST(Mapper.UnsignedVec); - // First, find dall of the repeated substrings in the tree of minimum length + // First, find all of the repeated substrings in the tree of minimum length // 2. std::vector<Candidate> CandidatesForRepeatedSeq; for (auto It = ST.begin(), Et = ST.end(); It != Et; ++It) { |
