diff options
| author | H. Peter Anvin <hpa@zytor.com> | 2007-08-31 07:23:31 +0000 |
|---|---|---|
| committer | H. Peter Anvin <hpa@zytor.com> | 2007-08-31 07:23:31 +0000 |
| commit | 91a86cdb31f8f68f6cebd42ac6dae202adc3f8fe (patch) | |
| tree | cc8137c24bb00dca67c1ec0978ec52e5340e1086 /perllib | |
| parent | 535af831f15a2a89e726d0c9a38103005b3bce27 (diff) | |
| download | nasm-91a86cdb31f8f68f6cebd42ac6dae202adc3f8fe.tar.gz nasm-91a86cdb31f8f68f6cebd42ac6dae202adc3f8fe.tar.bz2 nasm-91a86cdb31f8f68f6cebd42ac6dae202adc3f8fe.zip | |
tokhash: Speed up the rejection of unhashed values
Speed up the rejection of unhashed values (typically identifiers) by
filling unused hash slots with a large value (but not so large that
it is likely to overflow.) This means those values will be rejected
already by the range check, not needing strcmp().
Diffstat (limited to 'perllib')
| -rw-r--r-- | perllib/phash.ph | 12 |
1 files changed, 9 insertions, 3 deletions
diff --git a/perllib/phash.ph b/perllib/phash.ph index 017155d..e17874a 100644 --- a/perllib/phash.ph +++ b/perllib/phash.ph @@ -156,10 +156,16 @@ sub gen_hash_n($$$) { # for the edge (which is our hash index.) Since the graph is # acyclic, this is always doable. for ($i = 0; $i < $gsize; $i++) { - if (!$gr->has_vertex_attribute($i, "val")) { - walk_graph($gr,$i,0); # First vertex in a cluster + if ($gr->degree($i)) { + # This vertex has neighbors (is used) + if (!$gr->has_vertex_attribute($i, "val")) { + walk_graph($gr,$i,0); # First vertex in a cluster + } + push(@g, $gr->get_vertex_attribute($i, "val")); + } else { + # Unused vertex + push(@g, undef); } - push(@g, $gr->get_vertex_attribute($i, "val")); } # for ($i = 0; $i < $n; $i++) { |