Fix up comment to be more clear.
authorEric Christopher <echristo@gmail.com>
Mon, 8 Oct 2012 23:53:45 +0000 (23:53 +0000)
committerEric Christopher <echristo@gmail.com>
Mon, 8 Oct 2012 23:53:45 +0000 (23:53 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@165463 91177308-0d34-0410-b5e6-96231b3b80d8

lib/CodeGen/AsmPrinter/DwarfAccelTable.cpp

index 454a923c13e06864a16bc6a626fb9640f1a85175..05e0f2fb63b3d271f4ec956c0843404b5ccf05cf 100644 (file)
@@ -133,8 +133,8 @@ void DwarfAccelTable::EmitHeader(AsmPrinter *Asm) {
   }
 }
 
-// Walk through and emit the buckets for the table. This will look
-// like a list of numbers of how many elements are in each bucket.
+// Walk through and emit the buckets for the table. Each index is
+// an offset into the list of hashes.
 void DwarfAccelTable::EmitBuckets(AsmPrinter *Asm) {
   unsigned index = 0;
   for (size_t i = 0, e = Buckets.size(); i < e; ++i) {