* $Id$
 * Copyright (C) 2012 Smile Communications, jason.penton@smilecoms.com
 * Copyright (C) 2012 Smile Communications, richard.good@smilecoms.com
 * The initial version of this code was written by Dragos Vingarzan
 * (dragos(dot)vingarzan(at)fokus(dot)fraunhofer(dot)de and the
 * Fruanhofer Institute. It was and still is maintained in a separate
 * branch of the original SER. We are therefore migrating it to
 * Kamailio/SR and look forward to maintaining it from here on out.
 * 2011/2012 Smile Communications, Pty. Ltd.
 * ported/maintained/improved by 
 * Jason Penton (jason(dot)penton(at)smilecoms.com and
 * Richard Good (richard(dot)good(at)smilecoms.com) as part of an 
 * effort to add full IMS support to Kamailio/SR using a new and
 * improved architecture
 * NB: Alot of this code was originally part of OpenIMSCore,
 * FhG Fokus. 
 * Copyright (C) 2004-2006 FhG Fokus
 * Thanks for great work! This is an effort to 
 * break apart the various CSCF functions into logically separate
 * components. We hope this will drive wider use. We also feel
 * that in this way the architecture is more complete and thereby easier
 * to manage in the Kamailio/SR environment
 * 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
 * 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., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA

#ifndef HSLOTSP_H
#define HSLOTSP_H

#include "../../locking.h"

#include "usrloc.h"

typedef struct hslot_sp {
	int n;                  			/*!< Number of elements in the collision slot */
	struct ims_subscription_s* first;	/*!< First element in the list */
	struct ims_subscription_s* last;	/*!< Last element in the list */
	gen_lock_t *lock;       			/*!< Lock for hash entry - fastlock */
	int lockidx;            			/*!< Lock index for hash entry - the rest*/
} hslot_sp_t;

/*! \brief
 * Initialize slot structure
void subs_init_slot(hslot_sp_t* _s, int n);

/*! \brief
 * Deinitialize given slot structure
void subs_deinit_slot(hslot_sp_t* _s);

/*! \brief
 * Add an element to slot linked list
void subs_slot_add(hslot_sp_t* _s, struct ims_subscription_s* _r);

/*! \brief
 * Remove an element from slot linked list
void subs_slot_rem(hslot_sp_t* _s, struct ims_subscription_s* _r);

 * \brief Initialize locks for the hash table
 * \return 0 on success, -1 on failure
int subs_init_locks(void);

 * \brief Destroy all locks on the list
void subs_unlock_locks(void);
void subs_destroy_locks(void);

void subs__lock_idx(int idx);
void subs__release_idx(int idx);

#endif /* HSLOTSP_H */