mirror of https://github.com/sipwise/kamailio.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
658 lines
14 KiB
658 lines
14 KiB
/*
|
|
* $Id: hash.c 2583 2007-08-08 11:33:25Z anca_vamanu $
|
|
*
|
|
* presence module - presence server implementation
|
|
*
|
|
* Copyright (C) 2007 Voice Sistem S.R.L.
|
|
*
|
|
* 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:
|
|
* --------
|
|
* 2007-08-20 initial version (Anca Vamanu)
|
|
*/
|
|
|
|
/*! \file
|
|
* \brief Kamailio presence module
|
|
* \ingroup presence
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include "../../mem/shm_mem.h"
|
|
#include "../../hashes.h"
|
|
#include "../../dprint.h"
|
|
#include "../../str.h"
|
|
#include "../pua/hash.h"
|
|
#include "presence.h"
|
|
#include "hash.h"
|
|
#include "notify.h"
|
|
|
|
shtable_t new_shtable(int hash_size)
|
|
{
|
|
shtable_t htable= NULL;
|
|
int i, j;
|
|
|
|
i = 0;
|
|
htable= (subs_entry_t*)shm_malloc(hash_size* sizeof(subs_entry_t));
|
|
if(htable== NULL)
|
|
{
|
|
ERR_MEM(SHARE_MEM);
|
|
}
|
|
memset(htable, 0, hash_size* sizeof(subs_entry_t));
|
|
for(i= 0; i< hash_size; i++)
|
|
{
|
|
if(lock_init(&htable[i].lock)== 0)
|
|
{
|
|
LM_ERR("initializing lock [%d]\n", i);
|
|
goto error;
|
|
}
|
|
htable[i].entries= (subs_t*)shm_malloc(sizeof(subs_t));
|
|
if(htable[i].entries== NULL)
|
|
{
|
|
lock_destroy(&htable[i].lock);
|
|
ERR_MEM(SHARE_MEM);
|
|
}
|
|
memset(htable[i].entries, 0, sizeof(subs_t));
|
|
htable[i].entries->next= NULL;
|
|
}
|
|
|
|
return htable;
|
|
|
|
error:
|
|
if(htable)
|
|
{
|
|
for(j=0; j< i; j++)
|
|
{
|
|
lock_destroy(&htable[j].lock);
|
|
shm_free(htable[j].entries);
|
|
}
|
|
shm_free(htable);
|
|
}
|
|
return NULL;
|
|
|
|
}
|
|
|
|
void destroy_shtable(shtable_t htable, int hash_size)
|
|
{
|
|
int i;
|
|
|
|
if(htable== NULL)
|
|
return;
|
|
|
|
for(i= 0; i< hash_size; i++)
|
|
{
|
|
lock_destroy(&htable[i].lock);
|
|
free_subs_list(htable[i].entries->next, SHM_MEM_TYPE, 1);
|
|
shm_free(htable[i].entries);
|
|
}
|
|
shm_free(htable);
|
|
htable= NULL;
|
|
}
|
|
|
|
subs_t* search_shtable(shtable_t htable,str callid,str to_tag,
|
|
str from_tag,unsigned int hash_code)
|
|
{
|
|
subs_t* s;
|
|
|
|
s= htable[hash_code].entries->next;
|
|
|
|
while(s)
|
|
{
|
|
if(s->callid.len==callid.len &&
|
|
strncmp(s->callid.s, callid.s, callid.len)==0 &&
|
|
s->to_tag.len== to_tag.len &&
|
|
strncmp(s->to_tag.s, to_tag.s, to_tag.len)==0 &&
|
|
s->from_tag.len== from_tag.len &&
|
|
strncmp(s->from_tag.s, from_tag.s, from_tag.len)== 0)
|
|
return s;
|
|
s= s->next;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
subs_t* mem_copy_subs(subs_t* s, int mem_type)
|
|
{
|
|
int size;
|
|
subs_t* dest;
|
|
|
|
size= sizeof(subs_t)+ (s->pres_uri.len+ s->to_user.len
|
|
+ s->to_domain.len+ s->from_user.len+ s->from_domain.len+ s->callid.len
|
|
+ s->to_tag.len+ s->from_tag.len+s->sockinfo_str.len+s->event_id.len
|
|
+ s->local_contact.len+ s->contact.len+ s->record_route.len
|
|
+ s->reason.len+ s->watcher_user.len+ s->watcher_domain.len
|
|
+ 1)*sizeof(char);
|
|
|
|
if(mem_type & PKG_MEM_TYPE)
|
|
dest= (subs_t*)pkg_malloc(size);
|
|
else
|
|
dest= (subs_t*)shm_malloc(size);
|
|
|
|
if(dest== NULL)
|
|
{
|
|
ERR_MEM((mem_type==PKG_MEM_TYPE)?PKG_MEM_STR:SHARE_MEM);
|
|
}
|
|
memset(dest, 0, size);
|
|
size= sizeof(subs_t);
|
|
|
|
CONT_COPY(dest, dest->pres_uri, s->pres_uri)
|
|
CONT_COPY(dest, dest->to_user, s->to_user)
|
|
CONT_COPY(dest, dest->to_domain, s->to_domain)
|
|
CONT_COPY(dest, dest->from_user, s->from_user)
|
|
CONT_COPY(dest, dest->from_domain, s->from_domain)
|
|
CONT_COPY(dest, dest->watcher_user, s->watcher_user)
|
|
CONT_COPY(dest, dest->watcher_domain, s->watcher_domain)
|
|
CONT_COPY(dest, dest->to_tag, s->to_tag)
|
|
CONT_COPY(dest, dest->from_tag, s->from_tag)
|
|
CONT_COPY(dest, dest->callid, s->callid)
|
|
CONT_COPY(dest, dest->sockinfo_str, s->sockinfo_str)
|
|
CONT_COPY(dest, dest->local_contact, s->local_contact)
|
|
CONT_COPY(dest, dest->contact, s->contact)
|
|
CONT_COPY(dest, dest->record_route, s->record_route)
|
|
if(s->event_id.s)
|
|
CONT_COPY(dest, dest->event_id, s->event_id)
|
|
if(s->reason.s)
|
|
CONT_COPY(dest, dest->reason, s->reason)
|
|
|
|
dest->event= s->event;
|
|
dest->local_cseq= s->local_cseq;
|
|
dest->remote_cseq= s->remote_cseq;
|
|
dest->status= s->status;
|
|
dest->version= s->version;
|
|
dest->send_on_cback= s->send_on_cback;
|
|
dest->expires= s->expires;
|
|
dest->db_flag= s->db_flag;
|
|
|
|
return dest;
|
|
|
|
error:
|
|
if(dest)
|
|
{
|
|
if(mem_type & PKG_MEM_TYPE)
|
|
pkg_free(dest);
|
|
else
|
|
shm_free(dest);
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
|
|
subs_t* mem_copy_subs_noc(subs_t* s)
|
|
{
|
|
int size;
|
|
subs_t* dest;
|
|
|
|
size= sizeof(subs_t)+ (s->pres_uri.len+ s->to_user.len
|
|
+ s->to_domain.len+ s->from_user.len+ s->from_domain.len+ s->callid.len
|
|
+ s->to_tag.len+ s->from_tag.len+s->sockinfo_str.len+s->event_id.len
|
|
+ s->local_contact.len + s->record_route.len+
|
|
+ s->reason.len+ s->watcher_user.len+ s->watcher_domain.len
|
|
+ 1)*sizeof(char);
|
|
|
|
dest= (subs_t*)shm_malloc(size);
|
|
if(dest== NULL)
|
|
{
|
|
ERR_MEM(SHARE_MEM);
|
|
}
|
|
memset(dest, 0, size);
|
|
size= sizeof(subs_t);
|
|
|
|
CONT_COPY(dest, dest->pres_uri, s->pres_uri)
|
|
CONT_COPY(dest, dest->to_user, s->to_user)
|
|
CONT_COPY(dest, dest->to_domain, s->to_domain)
|
|
CONT_COPY(dest, dest->from_user, s->from_user)
|
|
CONT_COPY(dest, dest->from_domain, s->from_domain)
|
|
CONT_COPY(dest, dest->watcher_user, s->watcher_user)
|
|
CONT_COPY(dest, dest->watcher_domain, s->watcher_domain)
|
|
CONT_COPY(dest, dest->to_tag, s->to_tag)
|
|
CONT_COPY(dest, dest->from_tag, s->from_tag)
|
|
CONT_COPY(dest, dest->callid, s->callid)
|
|
CONT_COPY(dest, dest->sockinfo_str, s->sockinfo_str)
|
|
CONT_COPY(dest, dest->local_contact, s->local_contact)
|
|
CONT_COPY(dest, dest->record_route, s->record_route)
|
|
if(s->event_id.s)
|
|
CONT_COPY(dest, dest->event_id, s->event_id)
|
|
if(s->reason.s)
|
|
CONT_COPY(dest, dest->reason, s->reason)
|
|
|
|
dest->event= s->event;
|
|
dest->local_cseq= s->local_cseq;
|
|
dest->remote_cseq= s->remote_cseq;
|
|
dest->status= s->status;
|
|
dest->version= s->version;
|
|
dest->send_on_cback= s->send_on_cback;
|
|
dest->expires= s->expires;
|
|
dest->db_flag= s->db_flag;
|
|
|
|
dest->contact.s= (char*)shm_malloc(s->contact.len* sizeof(char));
|
|
if(dest->contact.s== NULL)
|
|
{
|
|
ERR_MEM(SHARE_MEM);
|
|
}
|
|
memcpy(dest->contact.s, s->contact.s, s->contact.len);
|
|
dest->contact.len= s->contact.len;
|
|
|
|
return dest;
|
|
|
|
error:
|
|
if(dest)
|
|
shm_free(dest);
|
|
return NULL;
|
|
}
|
|
|
|
int insert_shtable(shtable_t htable,unsigned int hash_code, subs_t* subs)
|
|
{
|
|
subs_t* new_rec= NULL;
|
|
|
|
new_rec= mem_copy_subs_noc(subs);
|
|
if(new_rec== NULL)
|
|
{
|
|
LM_ERR("copying in share memory a subs_t structure\n");
|
|
return -1;
|
|
}
|
|
new_rec->expires+= (int)time(NULL);
|
|
|
|
lock_get(&htable[hash_code].lock);
|
|
new_rec->next= htable[hash_code].entries->next;
|
|
htable[hash_code].entries->next= new_rec;
|
|
lock_release(&htable[hash_code].lock);
|
|
|
|
return 0;
|
|
}
|
|
|
|
int delete_shtable(shtable_t htable,unsigned int hash_code,str to_tag)
|
|
{
|
|
subs_t* s= NULL, *ps= NULL;
|
|
int found= -1;
|
|
|
|
lock_get(&htable[hash_code].lock);
|
|
|
|
ps= htable[hash_code].entries;
|
|
s= ps->next;
|
|
|
|
while(s)
|
|
{
|
|
if(s->to_tag.len== to_tag.len &&
|
|
strncmp(s->to_tag.s, to_tag.s, to_tag.len)== 0)
|
|
{
|
|
found= s->local_cseq +1;
|
|
ps->next= s->next;
|
|
if(s->contact.s!=NULL)
|
|
shm_free(s->contact.s);
|
|
shm_free(s);
|
|
break;
|
|
}
|
|
ps= s;
|
|
s= s->next;
|
|
}
|
|
lock_release(&htable[hash_code].lock);
|
|
return found;
|
|
}
|
|
|
|
void free_subs_list(subs_t* s_array, int mem_type, int ic)
|
|
{
|
|
subs_t* s;
|
|
|
|
while(s_array)
|
|
{
|
|
s= s_array;
|
|
s_array= s_array->next;
|
|
if(mem_type & PKG_MEM_TYPE)
|
|
{
|
|
if(ic)
|
|
pkg_free(s->contact.s);
|
|
pkg_free(s);
|
|
}
|
|
else
|
|
{
|
|
if(ic)
|
|
shm_free(s->contact.s);
|
|
shm_free(s);
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
int update_shtable(shtable_t htable,unsigned int hash_code,
|
|
subs_t* subs, int type)
|
|
{
|
|
subs_t* s;
|
|
|
|
lock_get(&htable[hash_code].lock);
|
|
|
|
s= search_shtable(htable,subs->callid, subs->to_tag, subs->from_tag,
|
|
hash_code);
|
|
if(s== NULL)
|
|
{
|
|
LM_DBG("record not found in hash table\n");
|
|
lock_release(&htable[hash_code].lock);
|
|
return -1;
|
|
}
|
|
|
|
if(type & REMOTE_TYPE)
|
|
{
|
|
s->expires= subs->expires+ (int)time(NULL);
|
|
s->remote_cseq= subs->remote_cseq;
|
|
}
|
|
else
|
|
{
|
|
subs->local_cseq = ++s->local_cseq;
|
|
subs->version = ++s->version;
|
|
}
|
|
|
|
if(strncmp(s->contact.s, subs->contact.s, subs->contact.len))
|
|
{
|
|
shm_free(s->contact.s);
|
|
s->contact.s= (char*)shm_malloc(subs->contact.len* sizeof(char));
|
|
if(s->contact.s== NULL)
|
|
{
|
|
lock_release(&htable[hash_code].lock);
|
|
LM_ERR("no more shared memory\n");
|
|
return -1;
|
|
}
|
|
memcpy(s->contact.s, subs->contact.s, subs->contact.len);
|
|
s->contact.len= subs->contact.len;
|
|
}
|
|
|
|
s->status= subs->status;
|
|
s->event= subs->event;
|
|
subs->db_flag= s->db_flag;
|
|
|
|
if(s->db_flag & NO_UPDATEDB_FLAG)
|
|
s->db_flag= UPDATEDB_FLAG;
|
|
|
|
lock_release(&htable[hash_code].lock);
|
|
|
|
return 0;
|
|
}
|
|
|
|
phtable_t* new_phtable(void)
|
|
{
|
|
phtable_t* htable= NULL;
|
|
int i, j;
|
|
|
|
i = 0;
|
|
htable= (phtable_t*)shm_malloc(phtable_size* sizeof(phtable_t));
|
|
if(htable== NULL)
|
|
{
|
|
ERR_MEM(SHARE_MEM);
|
|
}
|
|
memset(htable, 0, phtable_size* sizeof(phtable_t));
|
|
|
|
for(i= 0; i< phtable_size; i++)
|
|
{
|
|
if(lock_init(&htable[i].lock)== 0)
|
|
{
|
|
LM_ERR("initializing lock [%d]\n", i);
|
|
goto error;
|
|
}
|
|
htable[i].entries= (pres_entry_t*)shm_malloc(sizeof(pres_entry_t));
|
|
if(htable[i].entries== NULL)
|
|
{
|
|
ERR_MEM(SHARE_MEM);
|
|
}
|
|
memset(htable[i].entries, 0, sizeof(pres_entry_t));
|
|
htable[i].entries->next= NULL;
|
|
}
|
|
|
|
return htable;
|
|
|
|
error:
|
|
if(htable)
|
|
{
|
|
for(j=0; j< i; j++)
|
|
{
|
|
if(htable[i].entries)
|
|
shm_free(htable[i].entries);
|
|
else
|
|
break;
|
|
lock_destroy(&htable[i].lock);
|
|
}
|
|
shm_free(htable);
|
|
}
|
|
return NULL;
|
|
|
|
}
|
|
|
|
void destroy_phtable(void)
|
|
{
|
|
int i;
|
|
pres_entry_t* p, *prev_p;
|
|
|
|
if(pres_htable== NULL)
|
|
return;
|
|
|
|
for(i= 0; i< phtable_size; i++)
|
|
{
|
|
lock_destroy(&pres_htable[i].lock);
|
|
p= pres_htable[i].entries;
|
|
while(p)
|
|
{
|
|
prev_p= p;
|
|
p= p->next;
|
|
if(prev_p->sphere)
|
|
shm_free(prev_p->sphere);
|
|
shm_free(prev_p);
|
|
}
|
|
}
|
|
shm_free(pres_htable);
|
|
}
|
|
/* entry must be locked before calling this function */
|
|
|
|
pres_entry_t* search_phtable(str* pres_uri,int event, unsigned int hash_code)
|
|
{
|
|
pres_entry_t* p;
|
|
|
|
LM_DBG("pres_uri= %.*s\n", pres_uri->len, pres_uri->s);
|
|
p= pres_htable[hash_code].entries->next;
|
|
while(p)
|
|
{
|
|
if(p->event== event && p->pres_uri.len== pres_uri->len &&
|
|
strncmp(p->pres_uri.s, pres_uri->s, pres_uri->len)== 0 )
|
|
return p;
|
|
p= p->next;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
int insert_phtable(str* pres_uri, int event, char* sphere)
|
|
{
|
|
unsigned int hash_code;
|
|
pres_entry_t* p= NULL;
|
|
int size;
|
|
|
|
hash_code= core_hash(pres_uri, NULL, phtable_size);
|
|
|
|
lock_get(&pres_htable[hash_code].lock);
|
|
|
|
p= search_phtable(pres_uri, event, hash_code);
|
|
if(p)
|
|
{
|
|
p->publ_count++;
|
|
lock_release(&pres_htable[hash_code].lock);
|
|
return 0;
|
|
}
|
|
size= sizeof(pres_entry_t)+ pres_uri->len* sizeof(char);
|
|
|
|
p= (pres_entry_t*)shm_malloc(size);
|
|
if(p== NULL)
|
|
{
|
|
lock_release(&pres_htable[hash_code].lock);
|
|
ERR_MEM(SHARE_MEM);
|
|
}
|
|
memset(p, 0, size);
|
|
|
|
size= sizeof(pres_entry_t);
|
|
p->pres_uri.s= (char*)p+ size;
|
|
memcpy(p->pres_uri.s, pres_uri->s, pres_uri->len);
|
|
p->pres_uri.len= pres_uri->len;
|
|
|
|
if(sphere)
|
|
{
|
|
p->sphere= (char*)shm_malloc((strlen(sphere)+ 1)*sizeof(char));
|
|
if(p->sphere== NULL)
|
|
{
|
|
lock_release(&pres_htable[hash_code].lock);
|
|
ERR_MEM(SHARE_MEM);
|
|
}
|
|
strcpy(p->sphere, sphere);
|
|
}
|
|
|
|
p->event= event;
|
|
|
|
|
|
p->next= pres_htable[hash_code].entries->next;
|
|
pres_htable[hash_code].entries->next= p;
|
|
|
|
lock_release(&pres_htable[hash_code].lock);
|
|
|
|
return 0;
|
|
|
|
error:
|
|
return -1;
|
|
}
|
|
|
|
int delete_phtable(str* pres_uri, int event)
|
|
{
|
|
unsigned int hash_code;
|
|
pres_entry_t* p= NULL, *prev_p= NULL;
|
|
|
|
hash_code= core_hash(pres_uri, NULL, phtable_size);
|
|
|
|
lock_get(&pres_htable[hash_code].lock);
|
|
|
|
p= search_phtable(pres_uri, event, hash_code);
|
|
if(p== NULL)
|
|
{
|
|
LM_DBG("record not found\n");
|
|
lock_release(&pres_htable[hash_code].lock);
|
|
return 0;
|
|
}
|
|
|
|
p->publ_count--;
|
|
if(p->publ_count== 0)
|
|
{
|
|
/* delete record */
|
|
prev_p= pres_htable[hash_code].entries;
|
|
while(prev_p->next)
|
|
{
|
|
if(prev_p->next== p)
|
|
break;
|
|
prev_p= prev_p->next;
|
|
}
|
|
if(prev_p->next== NULL)
|
|
{
|
|
LM_ERR("record not found\n");
|
|
lock_release(&pres_htable[hash_code].lock);
|
|
return -1;
|
|
}
|
|
prev_p->next= p->next;
|
|
if(p->sphere)
|
|
shm_free(p->sphere);
|
|
|
|
shm_free(p);
|
|
}
|
|
lock_release(&pres_htable[hash_code].lock);
|
|
|
|
return 0;
|
|
}
|
|
|
|
int update_phtable(presentity_t* presentity, str pres_uri, str body)
|
|
{
|
|
char* sphere= NULL;
|
|
unsigned int hash_code;
|
|
pres_entry_t* p;
|
|
int ret= 0;
|
|
str* xcap_doc= NULL;
|
|
|
|
/* get new sphere */
|
|
sphere= extract_sphere(body);
|
|
if(sphere==NULL)
|
|
{
|
|
LM_DBG("no sphere defined in new body\n");
|
|
return 0;
|
|
}
|
|
|
|
/* search for record in hash table */
|
|
hash_code= core_hash(&pres_uri, NULL, phtable_size);
|
|
|
|
lock_get(&pres_htable[hash_code].lock);
|
|
|
|
p= search_phtable(&pres_uri, presentity->event->evp->type, hash_code);
|
|
if(p== NULL)
|
|
{
|
|
lock_release(&pres_htable[hash_code].lock);
|
|
goto done;
|
|
}
|
|
|
|
if(p->sphere)
|
|
{
|
|
if(strcmp(p->sphere, sphere)!= 0)
|
|
{
|
|
/* new sphere definition */
|
|
shm_free(p->sphere);
|
|
}
|
|
else
|
|
{
|
|
/* no change in sphere definition */
|
|
lock_release(&pres_htable[hash_code].lock);
|
|
pkg_free(sphere);
|
|
return 0;
|
|
}
|
|
|
|
}
|
|
|
|
|
|
p->sphere= (char*)shm_malloc((strlen(sphere)+ 1)*sizeof(char));
|
|
if(p->sphere== NULL)
|
|
{
|
|
lock_release(&pres_htable[hash_code].lock);
|
|
ret= -1;
|
|
goto done;
|
|
}
|
|
strcpy(p->sphere, sphere);
|
|
|
|
lock_release(&pres_htable[hash_code].lock);
|
|
|
|
/* call for watchers status update */
|
|
|
|
if(presentity->event->get_rules_doc(&presentity->user, &presentity->domain,
|
|
&xcap_doc)< 0)
|
|
{
|
|
LM_ERR("failed to retreive xcap document\n");
|
|
ret= -1;
|
|
goto done;
|
|
}
|
|
|
|
update_watchers_status(pres_uri, presentity->event, xcap_doc);
|
|
|
|
|
|
done:
|
|
|
|
if(xcap_doc)
|
|
{
|
|
if(xcap_doc->s)
|
|
pkg_free(xcap_doc->s);
|
|
pkg_free(xcap_doc);
|
|
}
|
|
|
|
if(sphere)
|
|
pkg_free(sphere);
|
|
return ret;
|
|
}
|