[lld] r247645 - Fix typo.

[Rui Ueyama via llvm-commits]

Author: ruiu
Date: Mon Sep 14 19:35:41 2015
New Revision: 247645

URL: http://llvm.org/viewvc/llvm-project?rev=247645&view=rev
Log:
Fix typo.

Modified:
    lld/trunk/COFF/ICF.cpp

Modified: lld/trunk/COFF/ICF.cpp
URL: http://llvm.org/viewvc/llvm-project/lld/trunk/COFF/ICF.cpp?rev=247645&r1=247644&r2=247645&view=diff
==============================================================================
--- lld/trunk/COFF/ICF.cpp (original)
+++ lld/trunk/COFF/ICF.cpp Mon Sep 14 19:35:41 2015
@@ -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.
 //