fis-gtm/sr_port/hashtab_int8.h

62 lines
3.0 KiB
C

/****************************************************************
* *
* Copyright 2001, 2010 Fidelity Information Services, Inc *
* *
* This source code contains the intellectual property *
* of its copyright holder(s), and is made available *
* under a license. If you do not know the terms of *
* the license, please stop and do not read further. *
* *
****************************************************************/
#ifndef HASHTAB_INT8_H
#define HASHTAB_INT8_H
/* Note that hashtab_addr has #define references to all items in this header file. Changes/additions
should be reflected there as well.
*/
typedef struct
{
gtm_uint64_t key;
void *value;
NON_GTM64_ONLY(uint4 filler;) /* To make it 16 byte for all platforms and aligned */
} ht_ent_int8;
typedef struct hash_table_int8_struct
{
ht_ent_int8 *base; /* base of array of hent_* entries */
ht_ent_int8 *top; /* top of array of hent_* entries */
unsigned int size; /* Hash table size */
unsigned int initial_size; /* Hash table initial size */
ht_ent_int8 *spare_base; /* spare array of hent_* entries */
unsigned int spare_base_size;/* size of spare array */
boolean_t dont_compact; /* if set, never perform compaction */
boolean_t dont_keep_spare_table; /* if set, don't keep a spare table */
boolean_t defer_base_release; /* if set don't release base, caller will free_base...() later */
unsigned int count; /* Number of valid entries */
unsigned int del_count; /* Number of entries marked deleted. */
unsigned int exp_trigger_size;/* When exp_trigger_size entried are used, expand table */
unsigned int cmp_trigger_size;/* When cmp_trigger_size reached compact table */
sm_uc_ptr_t entry_passed_thru;/* Bit vector used to determine whether a particular */
/* ht_ent has been involved in a collision (meaning that */
/* this value can't be marked empty on delete */
} hash_table_int8;
#define HTENT_EMPTY_INT8(tabent, type, htvalue) (!(htvalue = (type *)(tabent)->value))
#define HTENT_MARK_EMPTY_INT8(tabent) (tabent)->value = (void *)0L
#define HTENT_VALID_INT8(tabent, type, htvalue) ((!HTENT_EMPTY_INT8(tabent, type, htvalue)) && (HT_DELETED_ENTRY != htvalue))
#define COMPUTE_HASH_INT8(hkey, hash) hash = (((*hkey) & 0xFFFFFFFF) ^ (*hkey) >> 31)
/* Prototypes for int8 hash routines. See hashtab_implementation.h for detail interface and implementation */
void init_hashtab_int8(hash_table_int8 *table, int minsize, boolean_t dont_compact, boolean_t dont_keep_spare_table);
void expand_hashtab_int8(hash_table_int8 *table, int minsize);
boolean_t add_hashtab_int8(hash_table_int8 *table, gtm_uint64_t *key, void *value, ht_ent_int8 **tabentptr);
void *lookup_hashtab_int8(hash_table_int8 *table, gtm_uint64_t *key);
void delete_hashtab_ent_int8(hash_table_int8 *table, ht_ent_int8 *tabent);
boolean_t delete_hashtab_int8(hash_table_int8 *table, gtm_uint64_t *key);
void free_hashtab_int8(hash_table_int8 *table);
void reinitialize_hashtab_int8(hash_table_int8 *table);
void compact_hashtab_int8(hash_table_int8 *table);
#endif