summaryrefslogtreecommitdiff
path: root/perllib
diff options
context:
space:
mode:
authorH. Peter Anvin <hpa@zytor.com>2008-05-25 18:44:44 -0700
committerH. Peter Anvin <hpa@zytor.com>2008-05-25 18:44:44 -0700
commit1df0b9ee2d7f87e5e194343227cfe9cdcc41ac12 (patch)
tree7057af455e700d12d28e427ab48b5ec0bc6571cf /perllib
parent14f9ea2925de991f74b2a66518a270a3529bebab (diff)
downloadnasm-1df0b9ee2d7f87e5e194343227cfe9cdcc41ac12.tar.gz
nasm-1df0b9ee2d7f87e5e194343227cfe9cdcc41ac12.tar.bz2
nasm-1df0b9ee2d7f87e5e194343227cfe9cdcc41ac12.zip
phash: canonicalize order, fix handling of ignored duplicates
Canonicalize the order of the prehash entries, so we don't have to worry about looking up both pairs of edges. When we find a collision that we decide to ignore, there is no point in adding the same edge into the array again; instead, just skip the current edge.
Diffstat (limited to 'perllib')
-rw-r--r--perllib/phash.ph5
1 files changed, 4 insertions, 1 deletions
diff --git a/perllib/phash.ph b/perllib/phash.ph
index 4efc651..8feb6b7 100644
--- a/perllib/phash.ph
+++ b/perllib/phash.ph
@@ -79,11 +79,14 @@ sub gen_hash_n($$$$) {
%edges = ();
foreach $k (@keys) {
my ($pf1, $pf2) = prehash($k, $n, $sv);
+ ($pf1,$pf2) = ($pf2,$pf1) if ($pf1 > $pf2); # Canonicalize order
+
my $pf = "$pf1,$pf2";
my $e = ${$href}{$k};
my $xkey;
- if (defined($xkey = $edges{$pf}) && ${$href}{$xkey} != $e) {
+ if (defined($xkey = $edges{$pf})) {
+ next if ($e == ${$href}{$xkey}); # Duplicate hash, safe to ignore
if (defined($run)) {
print STDERR "$run: Collision: $pf: $k with $xkey\n";
}