so that hashtable_find() knows which hashtable is which on a 64-bit
architecture.
struct hashtable *hashtable_create(int size, int key64)
{
struct hashtable *tbl;
struct hashtable *hashtable_create(int size, int key64)
{
struct hashtable *tbl;
- int node_size = key64 ? sizeof (struct ht_int64_node )
+ int node_size = key64 ? sizeof (struct ht_int64_node)
: sizeof (struct ht_int32_node);
/* Pick a power of 2 that can hold the requested size. */
: sizeof (struct ht_int32_node);
/* Pick a power of 2 that can hold the requested size. */
tbl->size = size;
tbl->entries = 0;
tbl->node_size = node_size;
tbl->size = size;
tbl->entries = 0;
tbl->node_size = node_size;
* already existing. Returns NULL if not allocating and not found. */
void *hashtable_find(struct hashtable *tbl, int64 key, int allocate_if_missing)
{
* already existing. Returns NULL if not allocating and not found. */
void *hashtable_find(struct hashtable *tbl, int64 key, int allocate_if_missing)
{
- int key64 = (tbl->node_size > sizeof (struct ht_int32_node));
+ int key64 = tbl->key64;
struct ht_int32_node *node;
uint32 ndx;
struct ht_int32_node *node;
uint32 ndx;
void *nodes;
int32 size, entries;
uint32 node_size;
void *nodes;
int32 size, entries;
uint32 node_size;
};
struct ht_int32_node {
};
struct ht_int32_node {