X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;f=lib%2Fbitsig.c;h=8ffe8dbc9340d5f441afb0b92ffbc2df07855e17;hb=5a78c3505ae7fa76a061e26676450049ec5946d5;hp=304ee002f5cde0973eab00b47ca1a49492816d9d;hpb=318a88602c0c1b46da4a5aea6d7f376c2fcd8829;p=libucw.git diff --git a/lib/bitsig.c b/lib/bitsig.c index 304ee002..8ffe8dbc 100644 --- a/lib/bitsig.c +++ b/lib/bitsig.c @@ -1,5 +1,5 @@ /* - * Bit Array Signatures -- A Dubious Detector of Duplicates + * UCW Library -- Bit Array Signatures -- A Dubious Detector of Duplicates * * (c) 2002 Martin Mares * @@ -36,6 +36,9 @@ * We leave L and an upper bound for N as parameters set during * creation of the structure. Currently, the structure is limited * to 4 Gb = 512 MB. + * + * This software may be freely distributed and used according to the terms + * of the GNU Lesser General Public License. */ #include "lib/lib.h" @@ -43,7 +46,6 @@ #include "lib/md5.h" #include -#include struct bitsig { uns l, m, n, maxn, max_m_mult; @@ -70,7 +72,7 @@ bitsig_init(uns perrlog, uns maxn) b->maxn = maxn; b->max_m_mult = (0xffffffff / m) * m; bzero(b->array, mbytes); - log(L_DEBUG, "Initialized bitsig array with l=%d, m=%u (%u KB), expecting %d items", b->l, b->m, (mbytes+1023)/1024, maxn); + msg(L_DEBUG, "Initialized bitsig array with l=%d, m=%u (%u KB), expecting %d items", b->l, b->m, (mbytes+1023)/1024, maxn); return b; } @@ -137,7 +139,7 @@ bitsig_insert(struct bitsig *b, byte *item) } } if (!was && b->n++ == b->maxn+1) - log(L_ERROR, "bitsig: Too many items inserted, error rate will be higher than estimated!"); + msg(L_ERROR, "bitsig: Too many items inserted, error rate will be higher than estimated!"); return was; }