64 lines
3.2 KiB
C
64 lines
3.2 KiB
C
|
/****************************************************************
|
||
|
|
* *
|
||
|
|
* Copyright 2001, 2011 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_MNAME_H
|
||
|
|
#define HASHTAB_MNAME_H
|
||
|
|
|
||
|
|
#include "hashtab.h" /* needed for STR_HASH (in COMPUTE_HASH_MNAME) */
|
||
|
|
|
||
|
|
typedef struct
|
||
|
|
{
|
||
|
|
mname_entry key;
|
||
|
|
void *value;
|
||
|
|
} ht_ent_mname;
|
||
|
|
|
||
|
|
typedef struct hash_table_mname_struct
|
||
|
|
{
|
||
|
|
ht_ent_mname *base; /* base of array of hent_* entries */
|
||
|
|
ht_ent_mname *top; /* top of array of hent_* entries */
|
||
|
|
unsigned int size; /* Hash table size */
|
||
|
|
unsigned int initial_size; /* Hash table initial size */
|
||
|
|
ht_ent_mname *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_mname;
|
||
|
|
|
||
|
|
#define HTENT_EMPTY_MNAME(tabent, type, htvalue) (!(tabent)->key.var_name.len)
|
||
|
|
#define HTENT_MARK_EMPTY_MNAME(tabent) (tabent)->key.var_name.len = 0
|
||
|
|
#define HTENT_VALID_MNAME(tabent, type, htvalue) ((!HTENT_EMPTY_MNAME(tabent, type, htvalue)) && \
|
||
|
|
(HT_DELETED_ENTRY != (htvalue = (type *)(tabent)->value)))
|
||
|
|
#define COMPUTE_HASH_MNAME(hkey) \
|
||
|
|
{ \
|
||
|
|
assert((0 < (hkey)->var_name.len) && (MAX_MIDENT_LEN >= (hkey)->var_name.len)); \
|
||
|
|
STR_HASH((hkey)->var_name.addr, (hkey)->var_name.len, ((hkey)->hash_code), 0); \
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Prototypes for mname hash routines. See hashtab_implementation.h for detail interface and implementation */
|
||
|
|
void init_hashtab_mname(hash_table_mname *table, int minsize, boolean_t dont_compact, boolean_t dont_keep_spare_table);
|
||
|
|
void expand_hashtab_mname(hash_table_mname *table, int minsize);
|
||
|
|
boolean_t add_hashtab_mname(hash_table_mname *table, mname_entry *key, void *value, ht_ent_mname **tabentptr);
|
||
|
|
boolean_t add_hashtab_mname_symval(hash_table_mname *table, mname_entry *key, void *value, ht_ent_mname **tabentptr);
|
||
|
|
void *lookup_hashtab_mname(hash_table_mname *table, mname_entry *key);
|
||
|
|
void delete_hashtab_ent_mname(hash_table_mname *table, ht_ent_mname *tabent);
|
||
|
|
boolean_t delete_hashtab_mname(hash_table_mname *table, mname_entry *key);
|
||
|
|
void free_hashtab_mname(hash_table_mname *table);
|
||
|
|
void reinitialize_hashtab_mname(hash_table_mname *table);
|
||
|
|
void compact_hashtab_mname(hash_table_mname *table);
|
||
|
|
#endif
|