// $Id$
#include "Options.h"
#include "new.h"
#include "Hash_Table.h"

Hash_Table::Hash_Table (void): current_ptr (0), current_index (0), hash_table_size (HASH_TABLE_SIZE)
{
  this->hash_table = new (PRIVATE_POOL) Protocol_Record *[this->hash_table_size];

  ACE_OS::memset (this->hash_table,
                  0,
                  this->hash_table_size * sizeof *this->hash_table);
}

/* Hash using the "Hash PJW" algorithm. */

unsigned int
Hash_Table::hash (char *s)
{
  char		*temp = s;
  unsigned	g;
  unsigned	hash = 0;

  for (int i = 0; i < MAXUSERIDNAMELEN && *temp != 0; i++)
    {
      hash = (hash << 4) + (*temp++ * 13);
      if (g = hash & 0xf0000000) 
        {
          hash ^= (g >> 24);
          hash ^= g;
        }
    }

  return hash % this->hash_table_size;
}

/* Iterate through the hash table returning one node at a time... */

Protocol_Record *
Hash_Table::get_next_entry (void)
{
  /* Reset the iterator if we are starting from the beginning. */

  if (this->current_index == -1)
    this->current_index = 0;

  if (this->current_ptr == 0)
    {

      for (; 
	   this->current_index < this->hash_table_size; 
	   this->current_index++)
	if (this->hash_table[this->current_index] != 0)
	  {
	    Protocol_Record *frp = this->hash_table[this->current_index++];
	    this->current_ptr  = frp->next;
	    return frp;
	  }
      this->current_index = -1;
      return 0;
    }
  else 
    {
      Protocol_Record *frp = this->current_ptr;
      this->current_ptr	 = this->current_ptr->next;
      return frp;
    }
}

Protocol_Record *
Hash_Table::get_each_entry (void)
{
  return this->get_next_entry ();
}

/* Frees up all the dynamic memory in the hash table. */

Hash_Table::~Hash_Table (void)
{
  if (Options::get_opt (Options::DEBUG))
    fprintf (stderr, "disposing Hash_Table\n");

  for (int i = 0; i < this->hash_table_size; i++)
    for (Protocol_Record *frp = this->hash_table[i]; frp != 0; )
      {
	Protocol_Record *tmp = frp;
	frp	           = frp->next;
      }

}