aboutsummaryrefslogtreecommitdiffstats
path: root/docs
diff options
context:
space:
mode:
authorEric Christopher <echristo@apple.com>2012-03-06 02:25:41 +0000
committerEric Christopher <echristo@apple.com>2012-03-06 02:25:41 +0000
commit5b7634fd747fdb5a19c71bc637d4f389bd6e7611 (patch)
tree10af41d2777b046fe5038d3c88327948bf0095f3 /docs
parent25e6329e68006abff78cea9c64d229eea8d1291e (diff)
downloadexternal_llvm-5b7634fd747fdb5a19c71bc637d4f389bd6e7611.zip
external_llvm-5b7634fd747fdb5a19c71bc637d4f389bd6e7611.tar.gz
external_llvm-5b7634fd747fdb5a19c71bc637d4f389bd6e7611.tar.bz2
Fix up link and a couple small edits.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@152094 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'docs')
-rw-r--r--docs/SourceLevelDebugging.html6
1 files changed, 3 insertions, 3 deletions
diff --git a/docs/SourceLevelDebugging.html b/docs/SourceLevelDebugging.html
index 8c7ae53..08ac4ee 100644
--- a/docs/SourceLevelDebugging.html
+++ b/docs/SourceLevelDebugging.html
@@ -2131,7 +2131,7 @@ The DWARF for this would be:
<!-- ======================================================================= -->
<!-- ======================================================================= -->
<h4>
- <a name="acceltableintro">Introduction</a>
+ <a name="acceltableintroduction">Introduction</a>
</h4>
<!-- ======================================================================= -->
<div>
@@ -2292,10 +2292,10 @@ bucket contents:
`-------------'
</pre>
</div>
-<p>The BUCKETS in the Apple tables is an index into the HASHES array. By
+<p>The BUCKETS in the name tables are an index into the HASHES array. By
making all of the full 32 bit hash values contiguous in memory, we allow
ourselves to efficiently check for a match while touching as little
- memory as possible. Most often, checking the 32 bit hash values is as far as
+ memory as possible. Most often checking the 32 bit hash values is as far as
the lookup goes. If it does match, it usually is a match with no collisions.
So for a table with "n_buckets" buckets, and "n_hashes" unique 32 bit hash
values, we can clarify the contents of the BUCKETS, HASHES and OFFSETS as: