BRBloomFilter.c

//
//  BRBloomFilter.c
//
//  Created by Aaron Voisine on 9/2/15.
//  Copyright (c) 2015 breadwallet LLC.
//
//  Permission is hereby granted, free of charge, to any person obtaining a copy
//  of this software and associated documentation files (the "Software"), to deal
//  in the Software without restriction, including without limitation the rights
//  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
//  copies of the Software, and to permit persons to whom the Software is
//  furnished to do so, subject to the following conditions:
//
//  The above copyright notice and this permission notice shall be included in
//  all copies or substantial portions of the Software.
//
//  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
//  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
//  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
//  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
//  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
//  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
//  THE SOFTWARE.

#include "BRBloomFilter.h"
#include "BRCrypto.h"
#include "BRAddress.h"
#include "BRInt.h"
#include <stdlib.h>
#include <float.h>
#include <math.h>
#include <assert.h>

#define BLOOM_MAX_HASH_FUNCS 50

inline static uint32_t _BRBloomFilterHash(const BRBloomFilter *filter, const uint8_t *data, size_t dataLen,
        uint32_t hashNum) {
    return BRMurmur3_32(data, dataLen, hashNum*0xfba4c795 + filter->tweak) % (filter->length*8);
}

// returns a newly allocated bloom filter struct that must be freed by calling BRBloomFilterFree()
BRBloomFilter *BRBloomFilterNew(double falsePositiveRate, size_t elemCount, uint32_t tweak, uint8_t flags) {
    BRBloomFilter *filter = calloc(1, sizeof(*filter));

    assert(filter != NULL);
    filter->length = (falsePositiveRate < DBL_EPSILON) ? BLOOM_MAX_FILTER_LENGTH :
                     (-1.0/(M_LN2*M_LN2))*elemCount*log(falsePositiveRate)/8.0;
    if (filter->length > BLOOM_MAX_FILTER_LENGTH) filter->length = BLOOM_MAX_FILTER_LENGTH;
    if (filter->length < 1) filter->length = 1;
    filter->filter = calloc(filter->length, sizeof(*(filter->filter)));
    assert(filter->filter != NULL);
    filter->hashFuncs = ((filter->length*8.0)/elemCount)*M_LN2;
    if (filter->hashFuncs > BLOOM_MAX_HASH_FUNCS) filter->hashFuncs = BLOOM_MAX_HASH_FUNCS;
    filter->tweak = tweak;
    filter->flags = flags;

    if (! filter->filter) {
        free(filter);
        filter = NULL;
    }

    return filter;
}

// buf must contain a serialized filter
// returns a bloom filter struct that must be freed by calling BRBloomFilterFree()
BRBloomFilter *BRBloomFilterParse(const uint8_t *buf, size_t bufLen) {
    BRBloomFilter *filter = calloc(1, sizeof(*filter));
    size_t off = 0, len = 0;

    assert(filter != NULL);
    assert(buf != NULL || bufLen == 0);

    if (buf) {
        filter->length = (size_t)BRVarInt(&buf[off], (off <= bufLen ? bufLen - off : 0), &len);
        off += len;
        filter->filter = (filter->length <= BLOOM_MAX_FILTER_LENGTH && off + filter->length <= bufLen) ?
                         malloc(filter->length) : NULL;
        if (filter->filter) memcpy(filter->filter, &buf[off], filter->length);
        off += filter->length;
        filter->hashFuncs = (off + sizeof(uint32_t) <= bufLen) ? UInt32GetLE(&buf[off]) : 0;
        off += sizeof(uint32_t);
        filter->tweak = (off + sizeof(uint32_t) <= bufLen) ? UInt32GetLE(&buf[off]) : 0;
        off += sizeof(uint32_t);
        filter->flags = (off + sizeof(uint8_t) <= bufLen) ? buf[off] : 0;
        off += sizeof(uint8_t);
    }

    if (! filter->filter) {
        free(filter);
        filter = NULL;
    }

    return filter;
}

// returns number of bytes written to buf, or total bufLen needed if buf is NULL
size_t BRBloomFilterSerialize(const BRBloomFilter *filter, uint8_t *buf, size_t bufLen) {
    size_t off = 0,
           len = BRVarIntSize(filter->length) + filter->length + sizeof(uint32_t) + sizeof(uint32_t) + sizeof(uint8_t);

    assert(filter != NULL);
    assert(buf != NULL || bufLen == 0);

    if (buf && len <= bufLen) {
        off += BRVarIntSet(&buf[off], (off <= bufLen ? bufLen - off : 0), filter->length);
        memcpy(&buf[off], filter->filter, filter->length);
        off += filter->length;
        UInt32SetLE(&buf[off], filter->hashFuncs);
        off += sizeof(uint32_t);
        UInt32SetLE(&buf[off], filter->tweak);
        off += sizeof(uint32_t);
        buf[off] = filter->flags;
        off += sizeof(uint8_t);
    }

    return (! buf || len <= bufLen) ? len : 0;
}

// true if data is matched by filter
int BRBloomFilterContainsData(const BRBloomFilter *filter, const uint8_t *data, size_t dataLen) {
    uint32_t i, idx;

    assert(filter != NULL);
    assert(data != NULL || dataLen == 0);

    for (i = 0; data && i < filter->hashFuncs; i++) {
        idx = _BRBloomFilterHash(filter, data, dataLen, i);
        if (! (filter->filter[idx >> 3] & (1 << (7 & idx)))) return 0;
    }

    return (data) ? 1 : 0;
}

// add data to filter
void BRBloomFilterInsertData(BRBloomFilter *filter, const uint8_t *data, size_t dataLen) {
    uint32_t i, idx;

    assert(filter != NULL);
    assert(data != NULL || dataLen == 0);

    for (i = 0; data && i < filter->hashFuncs; i++) {
        idx = _BRBloomFilterHash(filter, data, dataLen, i);
        filter->filter[idx >> 3] |= (1 << (7 & idx));
    }

    if (data) filter->elemCount++;
}

// frees memory allocated for filter
void BRBloomFilterFree(BRBloomFilter *filter) {
    assert(filter != NULL);
    if (filter->filter) free(filter->filter);
    free(filter);
}