• René Scharfe's avatar
    sha1-lookup: handle duplicates in sha1_pos() · 0eb0fb88
    René Scharfe authored
    If the first 18 bytes of the SHA1's of all entries are the same then
    sha1_pos() dies and reports that the lower and upper limits of the
    binary search were the same that this wasn't supposed to happen.  This
    is wrong because the remaining two bytes could still differ.
    Furthermore: It wouldn't be a problem if they actually were the same,
    i.e. if all entries have the same SHA1.  The code already handles
    duplicates just fine.  Simply remove the erroneous check.
    Signed-off-by: default avatarRene Scharfe <l.s.r@web.de>
    Acked-by: default avatarJeff King <peff@peff.net>
    Signed-off-by: default avatarJunio C Hamano <gitster@pobox.com>
sha1-lookup.c 9.2 KB