hashTable.h

Go to the documentation of this file.

/*
 * $Id$
 *
 * SNMPStats Module 
 * Copyright (C) 2006 SOMA Networks, INC.
 * Written by: Jeffrey Magder (jmagder@somanetworks.com)
 *
 * This file is part of Kamailio, a free SIP server.
 *
 * Kamailio is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version
 *
 * Kamailio is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
 * USA
 *
 * History:
 * --------
 * 2006-11-23 initial version (jmagder)
 */

#ifndef HASHSLOT_H
#define HASHSLOT_H

typedef struct contactToIndexStruct 
{
        char *contactName;

        int contactIndex;

        struct contactToIndexStruct *next;

} contactToIndexStruct_t;


typedef struct aorToIndexStruct 
{
        /* Pointer to the actual address record in the given SNMP row. */
        char *aor;
        int  aorLength;

        /* Points to the user index, which is used to uniquely identify each
         * SNMP row in a table. */
        int userIndex;

        /* Each contact needs a unique index, for each user.  This value should
         * be incremented each time a contact is added.  This way, we can know
         * what index to use for the next addition to the contactList.  */
        int contactIndex;

        /* Pointer to the contact list. */
        contactToIndexStruct_t *contactList;

        struct aorToIndexStruct *prev;

        /* The structure is part of a hash table, so this element is needed so
         * that we can point to the next element in the colission slot. */
        struct aorToIndexStruct *next;

        /* This counter will be incremented when a new contact is associated
         * with this user record, and will be decremented each time an
         * associated contact is removed.  When the count reaches 0, it is safe
         * to remove this record. */
        int numContacts;

} aorToIndexStruct_t;


typedef struct hashSlot 
{
        int numberOfElements;

        struct aorToIndexStruct* first; 

        struct aorToIndexStruct* last; 

} hashSlot_t;

/*******************************************************************
* More detailed function definitions can be found in hashTable.c   */


aorToIndexStruct_t *createHashRecord(int userIndex, char *aor);


hashSlot_t  *createHashTable(int size);


int calculateHashSlot(char *theString, int hashTableSize);


aorToIndexStruct_t *findHashRecord(hashSlot_t *theTable, char *aor, int size);


void insertHashRecord(hashSlot_t *theTable, aorToIndexStruct_t *theRecord, int size); 


void printHashSlot(hashSlot_t *theTable, int index);


int deleteHashRecord(hashSlot_t *theTable, char *aor, int hashTableSize); 

void deleteUser(hashSlot_t *theTable, char *aor, int hashTableSize);

#endif