FCH algorithm added but not tested...
This commit is contained in:
fc_botelho
parent
6b9ee06643
commit
ee06e15f43
|
|
@ -19,7 +19,9 @@ libcmph_la_SOURCES = debug.h\
|
||||||
bmz8.h bmz8_structs.h bmz8.c\
|
bmz8.h bmz8_structs.h bmz8.c\
|
||||||
buffer_manager.h buffer_manager.c\
|
buffer_manager.h buffer_manager.c\
|
||||||
buffer_entry.h buffer_entry.c\
|
buffer_entry.h buffer_entry.c\
|
||||||
brz.h brz_structs.h brz.c
|
brz.h brz_structs.h brz.c\
|
||||||
|
fch.h fch_structs.h fch.c\
|
||||||
|
fch_buckets.h fch_buckets.c
|
||||||
|
|
||||||
libcmph_la_LDFLAGS = -version-info 0:0:0
|
libcmph_la_LDFLAGS = -version-info 0:0:0
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -468,6 +468,7 @@ int bmz_dump(cmph_t *mphf, FILE *fd)
|
||||||
|
|
||||||
fwrite(data->g, sizeof(cmph_uint32)*(data->n), 1, fd);
|
fwrite(data->g, sizeof(cmph_uint32)*(data->n), 1, fd);
|
||||||
#ifdef DEBUG
|
#ifdef DEBUG
|
||||||
|
cmph_uint32 i;
|
||||||
fprintf(stderr, "G: ");
|
fprintf(stderr, "G: ");
|
||||||
for (i = 0; i < data->n; ++i) fprintf(stderr, "%u ", data->g[i]);
|
for (i = 0; i < data->n; ++i) fprintf(stderr, "%u ", data->g[i]);
|
||||||
fprintf(stderr, "\n");
|
fprintf(stderr, "\n");
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,395 @@
|
||||||
|
#include "fch.h"
|
||||||
|
#include "cmph_structs.h"
|
||||||
|
#include "fch_structs.h"
|
||||||
|
#include "hash.h"
|
||||||
|
#include "bitbool.h"
|
||||||
|
#include "fch_buckets.h"
|
||||||
|
//#include <sys/time.h>
|
||||||
|
#include <time.h>
|
||||||
|
#include <math.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <assert.h>
|
||||||
|
#include <string.h>
|
||||||
|
#define INDEX 0 /* alignment index within a bucket */
|
||||||
|
//#define DEBUG
|
||||||
|
#include "debug.h"
|
||||||
|
|
||||||
|
static cmph_uint32 mixh10h11h12(cmph_uint32 b, cmph_float32 p1, cmph_float32 p2, cmph_uint32 initial_index);
|
||||||
|
static void calc_parameters(fch_config_data_t *fch);
|
||||||
|
static fch_buckets_t * mapping(cmph_config_t *mph);
|
||||||
|
static cmph_uint32 * ordering(fch_buckets_t * buckets);
|
||||||
|
static cmph_uint8 check_for_collisions_h2(fch_config_data_t *fch, fch_buckets_t * buckets);
|
||||||
|
static void permut(cmph_uint32 * vector, cmph_uint32 n);
|
||||||
|
static cmph_uint8 searching(fch_config_data_t *fch, fch_buckets_t *buckets, cmph_uint32 *sorted_indexes);
|
||||||
|
|
||||||
|
fch_config_data_t *fch_config_new()
|
||||||
|
{
|
||||||
|
fch_config_data_t *fch;
|
||||||
|
fch = (fch_config_data_t *)malloc(sizeof(fch_config_data_t));
|
||||||
|
assert(fch);
|
||||||
|
memset(fch, 0, sizeof(fch_config_data_t));
|
||||||
|
fch->hashfuncs[0] = CMPH_HASH_JENKINS;
|
||||||
|
fch->hashfuncs[1] = CMPH_HASH_JENKINS;
|
||||||
|
fch->m = fch->b = 0;
|
||||||
|
fch->c = fch->p1 = fch->p2 = 0;
|
||||||
|
fch->g = NULL;
|
||||||
|
fch->h1 = NULL;
|
||||||
|
fch->h2 = NULL;
|
||||||
|
return fch;
|
||||||
|
}
|
||||||
|
|
||||||
|
void fch_config_destroy(cmph_config_t *mph)
|
||||||
|
{
|
||||||
|
fch_config_data_t *data = (fch_config_data_t *)mph->data;
|
||||||
|
//DEBUGP("Destroying algorithm dependent data\n");
|
||||||
|
free(data);
|
||||||
|
}
|
||||||
|
|
||||||
|
void fch_config_set_hashfuncs(cmph_config_t *mph, CMPH_HASH *hashfuncs)
|
||||||
|
{
|
||||||
|
fch_config_data_t *fch = (fch_config_data_t *)mph->data;
|
||||||
|
CMPH_HASH *hashptr = hashfuncs;
|
||||||
|
cmph_uint32 i = 0;
|
||||||
|
while(*hashptr != CMPH_HASH_COUNT)
|
||||||
|
{
|
||||||
|
if (i >= 2) break; //fch only uses two hash functions
|
||||||
|
fch->hashfuncs[i] = *hashptr;
|
||||||
|
++i, ++hashptr;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static cmph_uint32 mixh10h11h12(cmph_uint32 b, cmph_float32 p1, cmph_float32 p2, cmph_uint32 initial_index)
|
||||||
|
{
|
||||||
|
if (initial_index < p1) initial_index %= (cmph_uint32)p2; /* h11 o h10 */
|
||||||
|
else { /* h12 o h10 */
|
||||||
|
initial_index %= b;
|
||||||
|
if(initial_index < p2) initial_index += (cmph_uint32)p2;
|
||||||
|
}
|
||||||
|
return initial_index;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void calc_parameters(fch_config_data_t *fch)
|
||||||
|
{
|
||||||
|
fch->b = (cmph_uint32)ceil((fch->c*fch->m)/(log(fch->m)/log(2) + 1));
|
||||||
|
fch->p1 = ceil(0.6*fch->m);
|
||||||
|
fch->p2 = ceil(0.3*fch->b);
|
||||||
|
}
|
||||||
|
|
||||||
|
static fch_buckets_t * mapping(cmph_config_t *mph)
|
||||||
|
{
|
||||||
|
// struct timeval seed;
|
||||||
|
cmph_uint32 i = 0;
|
||||||
|
fch_buckets_t *buckets = NULL;
|
||||||
|
fch_config_data_t *fch = (fch_config_data_t *)mph->data;
|
||||||
|
// gettimeofday(&seed,NULL);
|
||||||
|
// srand((cmph_uint32)((seed.tv_sec + 1001*seed.tv_usec)));
|
||||||
|
srand((cmph_uint32)time(NULL));
|
||||||
|
if (fch->h1) hash_state_destroy(fch->h1);
|
||||||
|
fch->h1 = hash_state_new(fch->hashfuncs[0], fch->m);
|
||||||
|
calc_parameters (fch);
|
||||||
|
buckets = fch_buckets_new(fch->b);
|
||||||
|
|
||||||
|
mph->key_source->rewind(mph->key_source->data);
|
||||||
|
for(i = 0; i < fch->m; i++)
|
||||||
|
{
|
||||||
|
cmph_uint32 h1, keylen;
|
||||||
|
char *key = NULL;
|
||||||
|
mph->key_source->read(mph->key_source->data, &key, &keylen);
|
||||||
|
h1 = hash(fch->h1, key, keylen) % fch->m;
|
||||||
|
h1 = mixh10h11h12 (fch->b, fch->p1, fch->p2, h1);
|
||||||
|
fch_buckets_insert(buckets, h1, key, keylen);
|
||||||
|
key = NULL; // transger memory ownership
|
||||||
|
|
||||||
|
}
|
||||||
|
return buckets;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
// returns the buckets indexes sorted by their sizes.
|
||||||
|
static cmph_uint32 * ordering(fch_buckets_t * buckets)
|
||||||
|
{
|
||||||
|
return fch_buckets_get_indexes_sorted_by_size(buckets);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Check whether function h2 causes collisions among the keys of each bucket */
|
||||||
|
static cmph_uint8 check_for_collisions_h2(fch_config_data_t *fch, fch_buckets_t * buckets)
|
||||||
|
{
|
||||||
|
//cmph_uint32 max_size = fch_buckets_get_max_size(buckets);
|
||||||
|
cmph_uint8 * hashtable = (cmph_uint8 *)calloc(fch->m, sizeof(cmph_uint8));
|
||||||
|
cmph_uint32 nbuckets = fch_buckets_get_nbuckets(buckets);
|
||||||
|
cmph_uint32 i = 0, index = 0, j =0;
|
||||||
|
for (i = 0; i < nbuckets; i++)
|
||||||
|
{
|
||||||
|
cmph_uint32 nkeys = fch_buckets_get_size(buckets, i);
|
||||||
|
memset(hashtable, 0, fch->m);
|
||||||
|
for (j = 0; j < nkeys; j++)
|
||||||
|
{
|
||||||
|
char * key = fch_buckets_get_key(buckets, i, j);
|
||||||
|
cmph_uint32 keylen = fch_buckets_get_keylength(buckets, i, j);
|
||||||
|
index = hash(fch->h2, key, keylen) % fch->m;
|
||||||
|
if(hashtable[index]) { // collision detected
|
||||||
|
free(hashtable);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
hashtable[index] = 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
free(hashtable);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void permut(cmph_uint32 * vector, cmph_uint32 n)
|
||||||
|
{
|
||||||
|
cmph_uint32 i, j, b;
|
||||||
|
srand((cmph_uint32)time(NULL));
|
||||||
|
for (i = 0; i < n; i++) {
|
||||||
|
j = rand() % n;
|
||||||
|
b = vector[i];
|
||||||
|
vector[i] = vector[j];
|
||||||
|
vector[j] = b;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static cmph_uint8 searching(fch_config_data_t *fch, fch_buckets_t *buckets, cmph_uint32 *sorted_indexes)
|
||||||
|
{
|
||||||
|
cmph_uint32 * random_table = (cmph_uint32 *) calloc(fch->m, sizeof(cmph_uint32));
|
||||||
|
cmph_uint32 * map_table = (cmph_uint32 *) calloc(fch->m, sizeof(cmph_uint32));
|
||||||
|
cmph_uint32 iteration_to_generate_h2 = 0;
|
||||||
|
cmph_uint32 searching_iterations = 0;
|
||||||
|
cmph_uint8 restart = 0;
|
||||||
|
cmph_uint32 nbuckets = fch_buckets_get_nbuckets(buckets);
|
||||||
|
cmph_uint32 i, j, z, counter = 0, filled_count = 0;
|
||||||
|
if (fch->g) free (fch->g);
|
||||||
|
fch->g = (cmph_uint32 *) calloc(fch->b, sizeof(cmph_uint32));
|
||||||
|
|
||||||
|
for(i = 0; i < fch->m; i++)
|
||||||
|
{
|
||||||
|
random_table[i] = i;
|
||||||
|
}
|
||||||
|
permut(random_table, fch->m);
|
||||||
|
for(i = 0; i < fch->m; i++)
|
||||||
|
{
|
||||||
|
map_table[random_table[i]] = i;
|
||||||
|
}
|
||||||
|
|
||||||
|
//DEBUGP("max bucket size: %u\n", fch_buckets_get_max_size(buckets));
|
||||||
|
|
||||||
|
do {
|
||||||
|
srand((cmph_uint32)time(NULL));
|
||||||
|
if (fch->h2) hash_state_destroy(fch->h2);
|
||||||
|
fch->h2 = hash_state_new(fch->hashfuncs[1], fch->m);
|
||||||
|
restart = check_for_collisions_h2(fch, buckets);
|
||||||
|
filled_count = 0;
|
||||||
|
if (!restart) searching_iterations++;
|
||||||
|
else iteration_to_generate_h2++;
|
||||||
|
for(i = 0; (i < nbuckets) && !restart; i++) {
|
||||||
|
restart = 1; // true
|
||||||
|
for(z = 0; (z < (fch->m - filled_count)) && restart; z++) {
|
||||||
|
char * key = fch_buckets_get_key(buckets, sorted_indexes[i], INDEX);
|
||||||
|
cmph_uint32 keylen = fch_buckets_get_keylength(buckets, sorted_indexes[i], INDEX);
|
||||||
|
cmph_uint32 h2 = hash(fch->h2, key, keylen) % fch->m;
|
||||||
|
cmph_uint32 bucketsize = fch_buckets_get_size(buckets, sorted_indexes[i]);
|
||||||
|
counter = 0;
|
||||||
|
restart = 0; // false
|
||||||
|
fch->g[sorted_indexes[i]] = (fch->m + random_table[filled_count + z] - h2) % fch->m;
|
||||||
|
j = INDEX;
|
||||||
|
do {
|
||||||
|
cmph_uint32 index = 0;
|
||||||
|
key = fch_buckets_get_key(buckets, sorted_indexes[i], j);
|
||||||
|
keylen = fch_buckets_get_keylength(buckets, sorted_indexes[i], j);
|
||||||
|
h2 = hash(fch->h2, key, keylen) % fch->m;
|
||||||
|
index = (h2 + fch->g[sorted_indexes[i]]) % fch->m;
|
||||||
|
if (map_table[index] >= filled_count) {
|
||||||
|
cmph_uint32 y = map_table[index];
|
||||||
|
cmph_uint32 ry = random_table[y];
|
||||||
|
random_table[y] = random_table[filled_count];
|
||||||
|
random_table[filled_count] = ry;
|
||||||
|
map_table[random_table[y]] = y;
|
||||||
|
map_table[random_table[filled_count]] = filled_count;
|
||||||
|
filled_count++;
|
||||||
|
counter ++;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
restart = 1; // true
|
||||||
|
filled_count = filled_count - counter;
|
||||||
|
counter = 0;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
j = (j + 1) % bucketsize;
|
||||||
|
} while(j % bucketsize != INDEX);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} while(restart && (searching_iterations < 100000));
|
||||||
|
free(map_table);
|
||||||
|
free(random_table);
|
||||||
|
return restart;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
cmph_t *fch_new(cmph_config_t *mph, float c)
|
||||||
|
{
|
||||||
|
cmph_t *mphf = NULL;
|
||||||
|
fch_data_t *fchf = NULL;
|
||||||
|
cmph_uint32 iterations = 100;
|
||||||
|
cmph_uint8 restart_mapping = 0;
|
||||||
|
fch_buckets_t * buckets = NULL;
|
||||||
|
cmph_uint32 * sorted_indexes = NULL;
|
||||||
|
fch_config_data_t *fch = (fch_config_data_t *)mph->data;
|
||||||
|
fch->m = mph->key_source->nkeys;
|
||||||
|
//DEBUGP("m: %f\n", fch->m);
|
||||||
|
fch->c = c;
|
||||||
|
//DEBUGP("c: %f\n", fch->c);
|
||||||
|
fch->h1 = NULL;
|
||||||
|
fch->h2 = NULL;
|
||||||
|
fch->g = NULL;
|
||||||
|
do
|
||||||
|
{
|
||||||
|
if (mph->verbosity)
|
||||||
|
{
|
||||||
|
fprintf(stderr, "Entering mapping step for mph creation of %u keys\n", fch->m);
|
||||||
|
}
|
||||||
|
if (buckets) fch_buckets_destroy(buckets);
|
||||||
|
buckets = mapping(mph);
|
||||||
|
if (mph->verbosity)
|
||||||
|
{
|
||||||
|
fprintf(stderr, "Starting ordering step\n");
|
||||||
|
}
|
||||||
|
if (sorted_indexes) free (sorted_indexes);
|
||||||
|
sorted_indexes = ordering(buckets);
|
||||||
|
if (mph->verbosity)
|
||||||
|
{
|
||||||
|
fprintf(stderr, "Starting searching step.\n");
|
||||||
|
}
|
||||||
|
restart_mapping = searching(fch, buckets, sorted_indexes);
|
||||||
|
|
||||||
|
} while(restart_mapping && iterations > 0);
|
||||||
|
if (buckets) fch_buckets_destroy(buckets);
|
||||||
|
if (sorted_indexes) free (sorted_indexes);
|
||||||
|
if (iterations == 0) return NULL;
|
||||||
|
mphf = (cmph_t *)malloc(sizeof(cmph_t));
|
||||||
|
mphf->algo = mph->algo;
|
||||||
|
fchf = (fch_data_t *)malloc(sizeof(fch_data_t));
|
||||||
|
fchf->g = fch->g;
|
||||||
|
fch->g = NULL; //transfer memory ownership
|
||||||
|
fchf->h1 = fch->h1;
|
||||||
|
fch->h1 = NULL; //transfer memory ownership
|
||||||
|
fchf->h2 = fch->h2;
|
||||||
|
fch->h2 = NULL; //transfer memory ownership
|
||||||
|
fchf->p2 = fch->p2;
|
||||||
|
fchf->p1 = fch->p1;
|
||||||
|
fchf->b = fch->b;
|
||||||
|
fchf->c = fch->c;
|
||||||
|
fchf->m = fch->m;
|
||||||
|
mphf->data = fchf;
|
||||||
|
mphf->size = fch->m;
|
||||||
|
//DEBUGP("Successfully generated minimal perfect hash\n");
|
||||||
|
if (mph->verbosity)
|
||||||
|
{
|
||||||
|
fprintf(stderr, "Successfully generated minimal perfect hash function\n");
|
||||||
|
}
|
||||||
|
return mphf;
|
||||||
|
}
|
||||||
|
|
||||||
|
int fch_dump(cmph_t *mphf, FILE *fd)
|
||||||
|
{
|
||||||
|
char *buf = NULL;
|
||||||
|
cmph_uint32 buflen;
|
||||||
|
fch_data_t *data = (fch_data_t *)mphf->data;
|
||||||
|
__cmph_dump(mphf, fd);
|
||||||
|
|
||||||
|
hash_state_dump(data->h1, &buf, &buflen);
|
||||||
|
//DEBUGP("Dumping hash state with %u bytes to disk\n", buflen);
|
||||||
|
fwrite(&buflen, sizeof(cmph_uint32), 1, fd);
|
||||||
|
fwrite(buf, buflen, 1, fd);
|
||||||
|
free(buf);
|
||||||
|
|
||||||
|
hash_state_dump(data->h2, &buf, &buflen);
|
||||||
|
//DEBUGP("Dumping hash state with %u bytes to disk\n", buflen);
|
||||||
|
fwrite(&buflen, sizeof(cmph_uint32), 1, fd);
|
||||||
|
fwrite(buf, buflen, 1, fd);
|
||||||
|
free(buf);
|
||||||
|
|
||||||
|
fwrite(&(data->m), sizeof(cmph_uint32), 1, fd);
|
||||||
|
fwrite(&(data->c), sizeof(cmph_float32), 1, fd);
|
||||||
|
fwrite(&(data->b), sizeof(cmph_uint32), 1, fd);
|
||||||
|
fwrite(&(data->p1), sizeof(cmph_float32), 1, fd);
|
||||||
|
fwrite(&(data->p2), sizeof(cmph_float32), 1, fd);
|
||||||
|
|
||||||
|
fwrite(data->g, sizeof(cmph_uint32)*(data->b), 1, fd);
|
||||||
|
#ifdef DEBUG
|
||||||
|
cmph_uint32 i;
|
||||||
|
fprintf(stderr, "G: ");
|
||||||
|
for (i = 0; i < data->b; ++i) fprintf(stderr, "%u ", data->g[i]);
|
||||||
|
fprintf(stderr, "\n");
|
||||||
|
#endif
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
void fch_load(FILE *f, cmph_t *mphf)
|
||||||
|
{
|
||||||
|
char *buf = NULL;
|
||||||
|
cmph_uint32 buflen;
|
||||||
|
fch_data_t *fch = (fch_data_t *)malloc(sizeof(fch_data_t));
|
||||||
|
|
||||||
|
//DEBUGP("Loading fch mphf\n");
|
||||||
|
mphf->data = fch;
|
||||||
|
//DEBUGP("Reading h1\n");
|
||||||
|
fch->h1 = NULL;
|
||||||
|
fread(&buflen, sizeof(cmph_uint32), 1, f);
|
||||||
|
//DEBUGP("Hash state of h1 has %u bytes\n", buflen);
|
||||||
|
buf = (char *)malloc(buflen);
|
||||||
|
fread(buf, buflen, 1, f);
|
||||||
|
fch->h1 = hash_state_load(buf, buflen);
|
||||||
|
free(buf);
|
||||||
|
|
||||||
|
//DEBUGP("Loading fch mphf\n");
|
||||||
|
mphf->data = fch;
|
||||||
|
//DEBUGP("Reading h2\n");
|
||||||
|
fch->h2 = NULL;
|
||||||
|
fread(&buflen, sizeof(cmph_uint32), 1, f);
|
||||||
|
//DEBUGP("Hash state of h2 has %u bytes\n", buflen);
|
||||||
|
buf = (char *)malloc(buflen);
|
||||||
|
fread(buf, buflen, 1, f);
|
||||||
|
fch->h2 = hash_state_load(buf, buflen);
|
||||||
|
free(buf);
|
||||||
|
|
||||||
|
|
||||||
|
//DEBUGP("Reading m and n\n");
|
||||||
|
fread(&(fch->m), sizeof(cmph_uint32), 1, f);
|
||||||
|
fread(&(fch->c), sizeof(cmph_float32), 1, f);
|
||||||
|
fread(&(fch->b), sizeof(cmph_uint32), 1, f);
|
||||||
|
fread(&(fch->p1), sizeof(cmph_float32), 1, f);
|
||||||
|
fread(&(fch->p2), sizeof(cmph_float32), 1, f);
|
||||||
|
|
||||||
|
fch->g = (cmph_uint32 *)malloc(sizeof(cmph_uint32)*fch->b);
|
||||||
|
fread(fch->g, fch->b*sizeof(cmph_uint32), 1, f);
|
||||||
|
#ifdef DEBUG
|
||||||
|
cmph_uint32 i;
|
||||||
|
fprintf(stderr, "G: ");
|
||||||
|
for (i = 0; i < fch->b; ++i) fprintf(stderr, "%u ", fch->g[i]);
|
||||||
|
fprintf(stderr, "\n");
|
||||||
|
#endif
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
cmph_uint32 fch_search(cmph_t *mphf, const char *key, cmph_uint32 keylen)
|
||||||
|
{
|
||||||
|
fch_data_t *fch = mphf->data;
|
||||||
|
cmph_uint32 h1 = hash(fch->h1, key, keylen) % fch->m;
|
||||||
|
cmph_uint32 h2 = hash(fch->h2, key, keylen) % fch->m;
|
||||||
|
h1 = hash(fch->h1, key, keylen) % fch->m;
|
||||||
|
h1 = mixh10h11h12 (fch->b, fch->p1, fch->p2, h1);
|
||||||
|
//DEBUGP("key: %s h1: %u h2: %u g[h1]: %u\n", key, h1, h2, fch->g[h1]);
|
||||||
|
return (h2 + fch->g[h1]) % fch->m;
|
||||||
|
}
|
||||||
|
void fch_destroy(cmph_t *mphf)
|
||||||
|
{
|
||||||
|
fch_data_t *data = (fch_data_t *)mphf->data;
|
||||||
|
free(data->g);
|
||||||
|
hash_state_destroy(data->h1);
|
||||||
|
hash_state_destroy(data->h2);
|
||||||
|
free(data);
|
||||||
|
free(mphf);
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,18 @@
|
||||||
|
#ifndef __CMPH_FCH_H__
|
||||||
|
#define __CMPH_FCH_H__
|
||||||
|
|
||||||
|
#include "cmph.h"
|
||||||
|
|
||||||
|
typedef struct __fch_data_t fch_data_t;
|
||||||
|
typedef struct __fch_config_data_t fch_config_data_t;
|
||||||
|
|
||||||
|
fch_config_data_t *fch_config_new();
|
||||||
|
void fch_config_set_hashfuncs(cmph_config_t *mph, CMPH_HASH *hashfuncs);
|
||||||
|
void fch_config_destroy(cmph_config_t *mph);
|
||||||
|
cmph_t *fch_new(cmph_config_t *mph, float c);
|
||||||
|
|
||||||
|
void fch_load(FILE *f, cmph_t *mphf);
|
||||||
|
int fch_dump(cmph_t *mphf, FILE *f);
|
||||||
|
void fch_destroy(cmph_t *mphf);
|
||||||
|
cmph_uint32 fch_search(cmph_t *mphf, const char *key, cmph_uint32 keylen);
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,214 @@
|
||||||
|
#include "vqueue.h"
|
||||||
|
#include "fch_buckets.h"
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <assert.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
//#define DEBUG
|
||||||
|
#include "debug.h"
|
||||||
|
|
||||||
|
typedef struct __fch_bucket_entry_t
|
||||||
|
{
|
||||||
|
char * value;
|
||||||
|
cmph_uint32 length;
|
||||||
|
} fch_bucket_entry_t;
|
||||||
|
|
||||||
|
typedef struct __fch_bucket_t
|
||||||
|
{
|
||||||
|
fch_bucket_entry_t * entries;
|
||||||
|
cmph_uint32 capacity, size;
|
||||||
|
} fch_bucket_t;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
static void fch_bucket_new(fch_bucket_t *bucket)
|
||||||
|
{
|
||||||
|
assert(bucket);
|
||||||
|
bucket->size = 0;
|
||||||
|
bucket->entries = NULL;
|
||||||
|
bucket->capacity = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void fch_bucket_destroy(fch_bucket_t *bucket)
|
||||||
|
{
|
||||||
|
cmph_uint32 i;
|
||||||
|
assert(bucket);
|
||||||
|
for (i = 0; i < bucket->size; i++)
|
||||||
|
{
|
||||||
|
free((bucket->entries + i)->value);
|
||||||
|
}
|
||||||
|
free(bucket->entries);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static void fch_bucket_reserve(fch_bucket_t *bucket, cmph_uint32 size)
|
||||||
|
{
|
||||||
|
assert(bucket);
|
||||||
|
if (bucket->capacity < size)
|
||||||
|
{
|
||||||
|
cmph_uint32 new_capacity = bucket->capacity + 1;
|
||||||
|
DEBUGP("Increasing current capacity %u to %u\n", bucket->capacity, size);
|
||||||
|
while (new_capacity < size)
|
||||||
|
{
|
||||||
|
new_capacity *= 2;
|
||||||
|
}
|
||||||
|
bucket->entries = (fch_bucket_entry_t *)realloc(bucket->entries, sizeof(fch_bucket_entry_t)*new_capacity);
|
||||||
|
assert(bucket->entries);
|
||||||
|
bucket->capacity = new_capacity;
|
||||||
|
DEBUGP("Increased\n");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static void fch_bucket_insert(fch_bucket_t *bucket, char *val, cmph_uint32 val_length)
|
||||||
|
{
|
||||||
|
assert(bucket);
|
||||||
|
fch_bucket_reserve(bucket, bucket->size + 1);
|
||||||
|
(bucket->entries + bucket->size)->value = val;
|
||||||
|
(bucket->entries + bucket->size)->length = val_length;
|
||||||
|
++(bucket->size);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static cmph_uint8 fch_bucket_is_empty(fch_bucket_t *bucket)
|
||||||
|
{
|
||||||
|
assert(bucket);
|
||||||
|
return bucket->size == 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static cmph_uint32 fch_bucket_size(fch_bucket_t *bucket)
|
||||||
|
{
|
||||||
|
assert(bucket);
|
||||||
|
return bucket->size;
|
||||||
|
}
|
||||||
|
|
||||||
|
static char * fch_bucket_get_key(fch_bucket_t *bucket, cmph_uint32 index_key)
|
||||||
|
{
|
||||||
|
assert(bucket); assert(index_key < bucket->size);
|
||||||
|
return (bucket->entries + index_key)->value;
|
||||||
|
}
|
||||||
|
|
||||||
|
static cmph_uint32 fch_bucket_get_length(fch_bucket_t *bucket, cmph_uint32 index_key)
|
||||||
|
{
|
||||||
|
assert(bucket); assert(index_key < bucket->size);
|
||||||
|
return (bucket->entries + index_key)->length;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void fch_bucket_print(fch_bucket_t * bucket, cmph_uint32 index)
|
||||||
|
{
|
||||||
|
cmph_uint32 i;
|
||||||
|
assert(bucket);
|
||||||
|
fprintf(stderr, "Printing bucket %u ...\n", index);
|
||||||
|
for (i = 0; i < bucket->size; i++)
|
||||||
|
{
|
||||||
|
fprintf(stderr, " key: %s\n", (bucket->entries + i)->value);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
//////////////////////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
struct __fch_buckets_t
|
||||||
|
{
|
||||||
|
fch_bucket_t * values;
|
||||||
|
cmph_uint32 nbuckets, max_size;
|
||||||
|
|
||||||
|
};
|
||||||
|
|
||||||
|
fch_buckets_t * fch_buckets_new(cmph_uint32 nbuckets)
|
||||||
|
{
|
||||||
|
cmph_uint32 i;
|
||||||
|
fch_buckets_t *buckets = (fch_buckets_t *)malloc(sizeof(fch_buckets_t));
|
||||||
|
assert(buckets);
|
||||||
|
buckets->values = (fch_bucket_t *)calloc(nbuckets, sizeof(fch_bucket_t));
|
||||||
|
for (i = 0; i < nbuckets; i++) fch_bucket_new(buckets->values + i);
|
||||||
|
assert(buckets->values);
|
||||||
|
buckets->nbuckets = nbuckets;
|
||||||
|
buckets->max_size = 0;
|
||||||
|
return buckets;
|
||||||
|
}
|
||||||
|
|
||||||
|
cmph_uint8 fch_buckets_is_empty(fch_buckets_t * buckets, cmph_uint32 index)
|
||||||
|
{
|
||||||
|
assert(index < buckets->nbuckets);
|
||||||
|
return fch_bucket_is_empty(buckets->values + index);
|
||||||
|
}
|
||||||
|
|
||||||
|
void fch_buckets_insert(fch_buckets_t * buckets, cmph_uint32 index, char * key, cmph_uint32 length)
|
||||||
|
{
|
||||||
|
assert(index < buckets->nbuckets);
|
||||||
|
fch_bucket_insert(buckets->values + index, key, length);
|
||||||
|
if (fch_bucket_size(buckets->values + index) > buckets->max_size)
|
||||||
|
{
|
||||||
|
buckets->max_size = fch_bucket_size(buckets->values + index);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
cmph_uint32 fch_buckets_get_size(fch_buckets_t * buckets, cmph_uint32 index)
|
||||||
|
{
|
||||||
|
assert(index < buckets->nbuckets);
|
||||||
|
return fch_bucket_size(buckets->values + index);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
char * fch_buckets_get_key(fch_buckets_t * buckets, cmph_uint32 index, cmph_uint32 index_key)
|
||||||
|
{
|
||||||
|
assert(index < buckets->nbuckets);
|
||||||
|
return fch_bucket_get_key(buckets->values + index, index_key);
|
||||||
|
}
|
||||||
|
|
||||||
|
cmph_uint32 fch_buckets_get_keylength(fch_buckets_t * buckets, cmph_uint32 index, cmph_uint32 index_key)
|
||||||
|
{
|
||||||
|
assert(index < buckets->nbuckets);
|
||||||
|
return fch_bucket_get_length(buckets->values + index, index_key);
|
||||||
|
}
|
||||||
|
|
||||||
|
cmph_uint32 fch_buckets_get_max_size(fch_buckets_t * buckets)
|
||||||
|
{
|
||||||
|
return buckets->nbuckets;
|
||||||
|
}
|
||||||
|
|
||||||
|
cmph_uint32 fch_buckets_get_nbuckets(fch_buckets_t * buckets)
|
||||||
|
{
|
||||||
|
return buckets->max_size;
|
||||||
|
}
|
||||||
|
|
||||||
|
cmph_uint32 * fch_buckets_get_indexes_sorted_by_size(fch_buckets_t * buckets)
|
||||||
|
{
|
||||||
|
int i = 0;
|
||||||
|
cmph_uint32 sum = 0, value;
|
||||||
|
cmph_uint32 *nbuckets_size = (cmph_uint32 *) calloc(buckets->max_size + 1, sizeof(cmph_uint32));
|
||||||
|
cmph_uint32 * sorted_indexes = (cmph_uint32 *) calloc(buckets->nbuckets, sizeof(cmph_uint32));
|
||||||
|
|
||||||
|
// collect how many buckets for each size.
|
||||||
|
for(i = 0; i < buckets->nbuckets; i++) nbuckets_size[fch_bucket_size(buckets->values + i)] ++;
|
||||||
|
|
||||||
|
// calculating offset considering a decreasing order of buckets size.
|
||||||
|
value = nbuckets_size[buckets->max_size];
|
||||||
|
nbuckets_size[buckets->max_size] = sum;
|
||||||
|
for(i = buckets->max_size - 1; i >= 0; i--)
|
||||||
|
{
|
||||||
|
sum += value;
|
||||||
|
value = nbuckets_size[i];
|
||||||
|
nbuckets_size[i] = sum;
|
||||||
|
|
||||||
|
}
|
||||||
|
for(i = 0; i < buckets->nbuckets; i++)
|
||||||
|
{
|
||||||
|
sorted_indexes[nbuckets_size[fch_bucket_size(buckets->values + i)]] = i;
|
||||||
|
nbuckets_size[fch_bucket_size(buckets->values + i)] ++;
|
||||||
|
}
|
||||||
|
free(nbuckets_size);
|
||||||
|
return sorted_indexes;
|
||||||
|
}
|
||||||
|
|
||||||
|
void fch_buckets_print(fch_buckets_t * buckets)
|
||||||
|
{
|
||||||
|
cmph_uint32 i;
|
||||||
|
for (i = 0; i < buckets->nbuckets; i++) fch_bucket_print(buckets->values + i, i);
|
||||||
|
}
|
||||||
|
|
||||||
|
void fch_buckets_destroy(fch_buckets_t * buckets)
|
||||||
|
{
|
||||||
|
cmph_uint32 i;
|
||||||
|
for (i = 0; i < buckets->nbuckets; i++) fch_bucket_destroy(buckets->values + i);
|
||||||
|
free(buckets->values);
|
||||||
|
free(buckets);
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,30 @@
|
||||||
|
#ifndef __CMPH_FCH_BUCKETS_H__
|
||||||
|
#define __CMPH_FCH_BUCKETS_H__
|
||||||
|
|
||||||
|
#include "cmph_types.h"
|
||||||
|
typedef struct __fch_buckets_t fch_buckets_t;
|
||||||
|
|
||||||
|
fch_buckets_t * fch_buckets_new(cmph_uint32 nbuckets);
|
||||||
|
|
||||||
|
cmph_uint8 fch_buckets_is_empty(fch_buckets_t * buckets, cmph_uint32 index);
|
||||||
|
|
||||||
|
void fch_buckets_insert(fch_buckets_t * buckets, cmph_uint32 index, char * key, cmph_uint32 length);
|
||||||
|
|
||||||
|
cmph_uint32 fch_buckets_get_size(fch_buckets_t * buckets, cmph_uint32 index);
|
||||||
|
|
||||||
|
char * fch_buckets_get_key(fch_buckets_t * buckets, cmph_uint32 index, cmph_uint32 index_key);
|
||||||
|
|
||||||
|
cmph_uint32 fch_buckets_get_keylength(fch_buckets_t * buckets, cmph_uint32 index, cmph_uint32 index_key);
|
||||||
|
|
||||||
|
// returns the size of biggest bucket.
|
||||||
|
cmph_uint32 fch_buckets_get_max_size(fch_buckets_t * buckets);
|
||||||
|
|
||||||
|
// returns the number of buckets.
|
||||||
|
cmph_uint32 fch_buckets_get_nbuckets(fch_buckets_t * buckets);
|
||||||
|
|
||||||
|
cmph_uint32 * fch_buckets_get_indexes_sorted_by_size(fch_buckets_t * buckets);
|
||||||
|
|
||||||
|
void fch_buckets_print(fch_buckets_t * buckets);
|
||||||
|
|
||||||
|
void fch_buckets_destroy(fch_buckets_t * buckets);
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,30 @@
|
||||||
|
#ifndef __CMPH_FCH_STRUCTS_H__
|
||||||
|
#define __CMPH_FCH_STRUCTS_H__
|
||||||
|
|
||||||
|
#include "hash_state.h"
|
||||||
|
|
||||||
|
struct __fch_data_t
|
||||||
|
{
|
||||||
|
cmph_uint32 m; // words count
|
||||||
|
cmph_float32 c; // constant c
|
||||||
|
cmph_uint32 b; // parameter b = ceil(c*m/(log(m)/log(2) + 1)). Don't need to be stored
|
||||||
|
cmph_float32 p1; // constant p1 = ceil(0.6*m). Don't need to be stored
|
||||||
|
cmph_float32 p2; // constant p2 = ceil(0.3*b). Don't need to be stored
|
||||||
|
cmph_uint32 *g; // g function.
|
||||||
|
hash_state_t *h1; // h10 function.
|
||||||
|
hash_state_t *h2; // h20 function.
|
||||||
|
};
|
||||||
|
|
||||||
|
struct __fch_config_data_t
|
||||||
|
{
|
||||||
|
CMPH_HASH hashfuncs[2];
|
||||||
|
cmph_uint32 m; // words count
|
||||||
|
cmph_float32 c; // constant c
|
||||||
|
cmph_uint32 b; // parameter b = ceil(c*m/(log(m)/log(2) + 1)). Don't need to be stored
|
||||||
|
cmph_float32 p1; // constant p1 = ceil(0.6*m). Don't need to be stored
|
||||||
|
cmph_float32 p2; // constant p2 = ceil(0.3*b). Don't need to be stored
|
||||||
|
cmph_uint32 *g; // g function.
|
||||||
|
hash_state_t *h1; // h10 function.
|
||||||
|
hash_state_t *h2; // h20 function.
|
||||||
|
};
|
||||||
|
#endif
|
||||||
Loading…
Reference in New Issue