RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-22 11:39:35 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fix up link and a couple small edits.

Browse Source 
llvm-svn: 152094
This commit is contained in:
Eric Christopher 2012-03-06 02:25:41 +00:00
parent 258d2080f5
commit fec0accf3d
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
docs/SourceLevelDebugging.html
View File

@ -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: