/home/leaf/crossfire/server/branches/1.12/plugins/common/hashtable.c

Go to the documentation of this file.

/*****************************************************************************/
/* hashtable.c                                                               */
/* Author: Alex Schultz, 2006                                                */
/* Based upon shstr.c, origionally written by Kjetil T. Homme, Oslo 1992.    */
/*****************************************************************************/
/* This is a pointer association hash table library for plugins to use with  */
/* a simple interface. This file is named as it is for other hash table      */
/* types to be added if people wish to.                                      */
/*****************************************************************************/
/* That code is placed under the GNU General Public Licence (GPL)            */
/* (C)2001-2005 by Chachkoff Yann (Feel free to deliver your complaints)     */
/*****************************************************************************/
/*  CrossFire, A Multiplayer game for X-windows                              */
/*                                                                           */
/*  Copyright (C) 2000 Mark Wedel                                            */
/*  Copyright (C) 1992 Frank Tore Johansen                                   */
/*                                                                           */
/*  This program 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.                                      */
/*                                                                           */
/*  This program 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., 675 Mass Ave, Cambridge, MA 02139, USA.                */
/*                                                                           */
/*****************************************************************************/

#include <string.h>
#include <stdlib.h>

#ifdef WIN32
#include <global.h>
typedef UINT_PTR uintptr_t;
#include <malloc.h>
#else
#include <stdint.h>
#include <autoconf.h>
#endif
#ifdef HAVE_LIBDMALLOC
#include <dmalloc.h>
#endif

#include <hashtable.h>

void init_ptr_assoc_table(ptr_assoc **hash_table) {
    (void)memset((void *)hash_table, 0, PTR_ASSOC_TABLESIZE*sizeof(ptr_assoc *));
}

static int hashptr(void *ptr) {
    return (int)((uintptr_t)ptr%PTR_ASSOC_TABLESIZE);
}

static ptr_assoc *new_ptr_assoc(void *key, void *value) {
    ptr_assoc *assoc;

    assoc = (ptr_assoc *)malloc(sizeof(ptr_assoc));
    assoc->previous = NULL;
    assoc->array = NULL;
    assoc->next = NULL;
    assoc->key = key;
    assoc->value = value;
    return assoc;
}

void add_ptr_assoc(ptr_assoc **hash_table, void *key, void *value) {
    ptr_assoc *assoc;
    int ind;

    ind = hashptr(key);
    assoc = hash_table[ind];

    /* Is there an entry for that hash? */
    if (assoc) {
        /* Simple case first: See if the first pointer matches. */
        if (key != assoc->key) {
            /* Apparantly, a association with the same hash value has this
             * slot. We must see in the list if this perticular key has
             * been registered before.
             */
            while (assoc->next) {
                assoc = assoc->next;
                if (key != assoc->key) {
                    /* This wasn't the right key... */
                    continue;
                }
                /* We found an entry for this key. Make sure the value
                 * is set as we want it.
                 */
                assoc->value = value;
                return;
            }
            /* There are no occurences of this key in the hash table. */
            {
                ptr_assoc *new_assoc;

                new_assoc = new_ptr_assoc(key, value);
                assoc->next = new_assoc;
                new_assoc->previous = assoc;
                return;
            }
        }
        return;
    } else {
        /* The string isn't registered, and the slot is empty. */
        hash_table[ind] = new_ptr_assoc(key, value);

        hash_table[ind]->array = &(hash_table[ind]);

        return;
    }
}

static ptr_assoc *find_ptr_assoc(ptr_assoc **hash_table, void *key) {
    ptr_assoc *assoc;
    int ind;

    ind = hashptr(key);
    assoc = hash_table[ind];

    /* Is there an entry for that hash? */
    if (assoc) {
        /* Simple case first: Is the first key the right one? */
        if (assoc->key == key) {
            return assoc;
        } else {
            /* Recurse through the linked list, if there's one. */
            while (assoc->next) {
                assoc = assoc->next;
                if (assoc->key == key) {
                    return assoc;
                }
            }
            /* No match. Fall through. */
        }
    }
    return NULL;
}

void *find_assoc_value(ptr_assoc **hash_table, void *key) {
    ptr_assoc *assoc;

    assoc = find_ptr_assoc(hash_table, key);
    if (!assoc)
        return NULL;
    return assoc->value;
}

void free_ptr_assoc(ptr_assoc **hash_table, void *key) {
    ptr_assoc *assoc;

    assoc = find_ptr_assoc(hash_table, key);
    if (!assoc)
        return;

    if (assoc->array) {
        /* We must put a new value into the hash_table[].
         */
        if (assoc->next) {
            *(assoc->array) = assoc->next;
            assoc->next->previous = NULL;
            assoc->next->array = assoc->array;
        } else {
            *(assoc->array) = NULL;
        }
         free(assoc);
    } else {
        /* Relink and free this struct.
         */
        if (assoc->next)
            assoc->next->previous = assoc->previous;
        assoc->previous->next = assoc->next;
        free(assoc);
    }
}

---