<a name="l32"></a>generated from a string by </span><a href="/Wb/Kernel/KHashA.HC.HTML#l254"><span class=cF4>HashStr</span></a><span class=cF0>() to index into the array of linked-lists.
<a name="l36"></a>There are various types of entries. See </span><a href="/Wb/Kernel/KernelA.HH.HTML#l686"><span class=cF4>Hash Entry Types</span></a><span class=cF0>.
<a name="l38"></a></span><span class=cF5>Symbol Look-up</span><span class=cF0> (Used many places including the </span><a href="/Wb/Compiler/Lex.HC.HTML#l499"><span class=cF4>JIT Compiler</span></a><span class=cF0> and </span><a href="/Wb/Kernel/KLoad.HC.HTML#l19"><span class=cF4>Loader</span></a><span class=cF0>.)
<a name="l39"></a>1) Symbol name is </span><a href="/Wb/Kernel/KHashA.HC.HTML#l4"><span class=cF4>hashed</span></a><span class=cF0> by adding and shifting the ASCII of all chars.
<a name="l40"></a>2) </span><a href="/Wb/Kernel/KernelA.HH.HTML#l647"><span class=cF4>hash table</span></a><span class=cF0>->body[] array is indexed.
<a name="l42"></a>4) If not found, </span><a href="/Wb/Kernel/KernelA.HH.HTML#l647"><span class=cF4>hash table</span></a><span class=cF0>->next table is searched.