rework -C (perfect candidate for using hash tables, really):
authorespie <espie@openbsd.org>
Fri, 16 May 2014 16:18:33 +0000 (16:18 +0000)
committerespie <espie@openbsd.org>
Fri, 16 May 2014 16:18:33 +0000 (16:18 +0000)
commite96025a183d0d6ef0ecd68a317e35a8ae21bb8c9
treeceda64b41849e2e760d1b7e9c56f8f8c6e43e11d
parenteb96cf48e35fa7028e903963e60266c3a5a69282
rework -C (perfect candidate for using hash tables, really):

insert files we want to check into a hash,
parse SHA256 message on the fly, delete entries whose checksum match,
then display entries that failed.

This completely avoids allocating temporary storage for file names and checksums
and removes the quadratic match (argv[i] vs line[n]).

okay tedu@
usr.bin/signify/signify.c