diff options
| author | Rui Ueyama <ruiu@google.com> | 2015-09-15 00:35:41 +0000 |
|---|---|---|
| committer | Rui Ueyama <ruiu@google.com> | 2015-09-15 00:35:41 +0000 |
| commit | c48f78ca5a04a63b73a70b40df0aca1ffa2fcc32 (patch) | |
| tree | d924fa2fdee17c7d9e603762d17cff3fcff76414 | |
| parent | 13563d8645306e03b05ea01c41d2758d62158966 (diff) | |
| download | bcm5719-llvm-c48f78ca5a04a63b73a70b40df0aca1ffa2fcc32.tar.gz bcm5719-llvm-c48f78ca5a04a63b73a70b40df0aca1ffa2fcc32.zip | |
Fix typo.
llvm-svn: 247645
| -rw-r--r-- | lld/COFF/ICF.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lld/COFF/ICF.cpp b/lld/COFF/ICF.cpp index e1ff2f0726e..9a677026096 100644 --- a/lld/COFF/ICF.cpp +++ b/lld/COFF/ICF.cpp @@ -17,7 +17,7 @@ // isomorphic subgraphs as possible, if we consider sections as vertices and // relocations as edges. This may be a bit more complicated problem than you // might think. The order of processing sections matters since merging two -// sections can make other sections, whose relocations now point to the +// sections can make other sections, whose relocations now point to the same // section, mergeable. Graphs may contain cycles, which is common in COFF. // We need a sophisticated algorithm to do this properly and efficiently. // |
