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.
122 lines
2.8 KiB
122 lines
2.8 KiB
/*
|
|
* $Id$
|
|
*
|
|
* dmq module - distributed message queue
|
|
*
|
|
* Copyright (C) 2011 Bucur Marius - Ovidiu
|
|
*
|
|
* 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
|
|
*
|
|
*/
|
|
|
|
#include "peer.h"
|
|
#include "dmq.h"
|
|
|
|
/**
|
|
* @brief init peer list
|
|
*/
|
|
dmq_peer_list_t* init_peer_list()
|
|
{
|
|
dmq_peer_list_t* peer_list;
|
|
peer_list = shm_malloc(sizeof(dmq_peer_list_t));
|
|
if(peer_list==NULL) {
|
|
LM_ERR("no more shm\n");
|
|
return NULL;
|
|
}
|
|
memset(peer_list, 0, sizeof(dmq_peer_list_t));
|
|
lock_init(&peer_list->lock);
|
|
return peer_list;
|
|
}
|
|
|
|
/**
|
|
* @brief search peer list
|
|
*/
|
|
dmq_peer_t* search_peer_list(dmq_peer_list_t* peer_list, dmq_peer_t* peer)
|
|
{
|
|
dmq_peer_t* crt;
|
|
int len;
|
|
crt = peer_list->peers;
|
|
while(crt) {
|
|
/* len - the minimum length of the two strings */
|
|
len = (crt->peer_id.len < peer->peer_id.len)
|
|
? crt->peer_id.len:peer->peer_id.len;
|
|
if(strncasecmp(crt->peer_id.s, peer->peer_id.s, len) == 0) {
|
|
return crt;
|
|
}
|
|
crt = crt->next;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/**
|
|
* @brief add peer
|
|
*/
|
|
dmq_peer_t* add_peer(dmq_peer_list_t* peer_list, dmq_peer_t* peer)
|
|
{
|
|
dmq_peer_t* new_peer = NULL;
|
|
|
|
new_peer = shm_malloc(sizeof(dmq_peer_t));
|
|
if(new_peer==NULL) {
|
|
LM_ERR("no more shm\n");
|
|
return NULL;
|
|
}
|
|
*new_peer = *peer;
|
|
|
|
/* copy the str's */
|
|
new_peer->peer_id.s = shm_malloc(peer->peer_id.len);
|
|
if(new_peer->peer_id.s==NULL) {
|
|
LM_ERR("no more shm\n");
|
|
shm_free(new_peer);
|
|
return NULL;
|
|
}
|
|
memcpy(new_peer->peer_id.s, peer->peer_id.s, peer->peer_id.len);
|
|
new_peer->peer_id.len = peer->peer_id.len;
|
|
|
|
new_peer->description.s = shm_malloc(peer->description.len);
|
|
if(new_peer->description.s==NULL) {
|
|
LM_ERR("no more shm\n");
|
|
shm_free(new_peer->peer_id.s);
|
|
shm_free(new_peer);
|
|
return NULL;
|
|
}
|
|
memcpy(new_peer->peer_id.s, peer->peer_id.s, peer->peer_id.len);
|
|
new_peer->peer_id.len = peer->peer_id.len;
|
|
|
|
new_peer->next = peer_list->peers;
|
|
peer_list->peers = new_peer;
|
|
return new_peer;
|
|
}
|
|
|
|
/**
|
|
* @brief find peer by id
|
|
*/
|
|
dmq_peer_t* find_peer(str peer_id)
|
|
{
|
|
dmq_peer_t foo_peer;
|
|
foo_peer.peer_id = peer_id;
|
|
return search_peer_list(peer_list, &foo_peer);
|
|
}
|
|
|
|
/**
|
|
* @empty callback
|
|
*/
|
|
int empty_peer_callback(struct sip_msg* msg, peer_reponse_t* resp)
|
|
{
|
|
return 0;
|
|
}
|
|
|