simple_hashing.h

/*
 * simle_hashing.h
 *
 *  Created on: Oct 8, 2014
 *      Author: mzohner
 */

#ifndef SIMLE_HASHING_H_
#define SIMLE_HASHING_H_

#include "hashing_util.h"

struct bin_ctx {
    //hash-values of all elements mapped to this bin
    uint8_t* values;
    //number of elements stored in this bin
    uint32_t nvals;
};

typedef struct simple_hash_table_ctx {
    //pointer to the bins in the hash table
    bin_ctx* bins;
    //number bins in the hash table
    uint32_t nbins;
    //max bin size
    uint32_t maxbinsize;
    //uint32_t addrbitlen;
    //uint32_t addrbytelen;
    //uint32_t inbytelen;
    //uint32_t outbytelen;
} sht_ctx;

typedef struct simple_hash_entry_gen_ctx {
    sht_ctx* table;
    //input elements
    uint8_t* elements;
    uint32_t startpos;
    uint32_t endpos;
    //uint32_t inbytelen;
    hs_t* hs;
} sheg_ctx;



//returns a cuckoo hash table with the first dimension being the bins and the second dimension being the pointer to the elements
uint8_t* simple_hashing(uint8_t* elements, uint32_t neles, uint32_t bitlen, uint32_t* outbitlen, uint32_t* nelesinbin, uint32_t nbins,
        uint32_t* maxbinsize, uint32_t ntasks, uint32_t nhashfuns, prf_state_ctx* prf_state);
//routine for generating the entries, is invoked by the threads
void *gen_entries(void *ctx);
void init_hash_table(sht_ctx* table, uint32_t nelements, hs_t* hs);
void increase_max_bin_size(sht_ctx* table, uint32_t valbytelen);
void free_hash_table(sht_ctx* table);
inline void insert_element(sht_ctx* table, uint8_t* element, uint32_t* address, uint8_t* tmpbuf, hs_t* hs);
inline uint32_t get_max_bin_size(uint32_t nbins, uint32_t neles);


#endif /* SIMLE_HASHING_H_ */