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.
202 lines
4.3 KiB
202 lines
4.3 KiB
/*
|
|
* $Id$
|
|
*
|
|
* Copyright (C) 2001-2003 FhG Fokus
|
|
*
|
|
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
|
|
#ifndef _CPL_LOC_SET_H_
|
|
#define _CPL_LOC_SET_H_
|
|
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <time.h>
|
|
#include <stdlib.h>
|
|
|
|
#include "../../mem/shm_mem.h"
|
|
#include "../../str.h"
|
|
#include "../../dprint.h"
|
|
|
|
|
|
#define CPL_LOC_DUPL (1<<0)
|
|
#define CPL_LOC_NATED (1<<1)
|
|
|
|
|
|
struct location {
|
|
struct address {
|
|
str uri;
|
|
str received;
|
|
unsigned int priority;
|
|
}addr;
|
|
int flags;
|
|
struct location *next;
|
|
};
|
|
|
|
|
|
|
|
static inline void free_location( struct location *loc)
|
|
{
|
|
shm_free( loc );
|
|
}
|
|
|
|
|
|
|
|
/* insert a new location into the set maintaining order by the prio val - the
|
|
* list starts with the smallest prio!
|
|
* For locations having the same prio val, the adding order will be kept */
|
|
static inline int add_location(struct location **loc_set, str *uri,
|
|
str *received, unsigned int prio, int flags)
|
|
{
|
|
struct location *loc;
|
|
struct location *foo, *bar;
|
|
|
|
if(received && received->s && received->len)
|
|
loc = (struct location*)shm_malloc(sizeof(struct location)+
|
|
((flags&CPL_LOC_DUPL)?uri->len+1+received->len+1:0) );
|
|
else
|
|
loc = (struct location*)shm_malloc(
|
|
sizeof(struct location)+((flags&CPL_LOC_DUPL)?uri->len+1:0) );
|
|
if (!loc) {
|
|
LM_ERR("no more free shm memory!\n");
|
|
return -1;
|
|
}
|
|
|
|
if (flags&CPL_LOC_DUPL) {
|
|
loc->addr.uri.s = ((char*)loc)+sizeof(struct location);
|
|
memcpy(loc->addr.uri.s,uri->s,uri->len);
|
|
loc->addr.uri.s[uri->len] = 0;
|
|
} else {
|
|
loc->addr.uri.s = uri->s;
|
|
}
|
|
loc->addr.uri.len = uri->len;
|
|
loc->addr.priority = prio;
|
|
loc->flags = flags;
|
|
|
|
if(received && received->s && received->len) {
|
|
if (flags&CPL_LOC_DUPL) {
|
|
loc->addr.received.s = ((char*)loc)+sizeof(struct location)+
|
|
uri->len+1;
|
|
memcpy(loc->addr.received.s,received->s,received->len);
|
|
loc->addr.received.s[received->len] = 0;
|
|
}
|
|
else {
|
|
loc->addr.received.s = received->s;
|
|
}
|
|
loc->addr.received.len = received->len;
|
|
}
|
|
else {
|
|
loc->addr.received.s = 0;
|
|
loc->addr.received.len = 0;
|
|
}
|
|
|
|
/* find the proper place for the new location */
|
|
foo = *loc_set;
|
|
bar = 0;
|
|
while(foo && foo->addr.priority>prio) {
|
|
bar = foo;
|
|
foo = foo->next;
|
|
}
|
|
if (!bar) {
|
|
/* insert at the beginning */
|
|
loc->next = *loc_set;
|
|
*loc_set = loc;
|
|
} else {
|
|
/* insert after bar, before foo */
|
|
loc->next = foo;
|
|
bar->next = loc;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
static inline void remove_location(struct location **loc_set, char *uri_s,
|
|
int uri_len)
|
|
{
|
|
struct location *loc = *loc_set;
|
|
struct location *prev_loc = 0;
|
|
|
|
for( ; loc ; prev_loc=loc,loc=loc->next ) {
|
|
if (loc->addr.uri.len==uri_len &&
|
|
!strncasecmp(loc->addr.uri.s,uri_s,uri_len) )
|
|
break;
|
|
}
|
|
|
|
if (loc) {
|
|
LM_DBG("removing from loc_set <%.*s>\n",
|
|
uri_len,uri_s);
|
|
if (prev_loc)
|
|
prev_loc->next=loc->next;
|
|
else
|
|
(*loc_set)=loc->next;
|
|
shm_free( loc );
|
|
} else {
|
|
LM_DBG("no matching in loc_set for <%.*s>\n",
|
|
uri_len,uri_s);
|
|
}
|
|
}
|
|
|
|
|
|
|
|
static inline struct location *remove_first_location(struct location **loc_set)
|
|
{
|
|
struct location *loc;
|
|
|
|
if (!*loc_set)
|
|
return 0;
|
|
|
|
loc = *loc_set;
|
|
*loc_set = (*loc_set)->next;
|
|
loc->next = 0;
|
|
LM_DBG("removing <%.*s>\n",
|
|
loc->addr.uri.len,loc->addr.uri.s);
|
|
|
|
return loc;
|
|
}
|
|
|
|
|
|
|
|
static inline void empty_location_set(struct location **loc_set)
|
|
{
|
|
struct location *loc;
|
|
|
|
while (*loc_set) {
|
|
loc = (*loc_set)->next;
|
|
shm_free(*loc_set);
|
|
*loc_set = loc;
|
|
}
|
|
*loc_set = 0;
|
|
}
|
|
|
|
|
|
static inline void print_location_set(struct location *loc_set)
|
|
{
|
|
while (loc_set) {
|
|
LM_DBG("uri=<%s> received=<%s> q=%d\n",
|
|
loc_set->addr.uri.s, loc_set->addr.received.s,
|
|
loc_set->addr.priority);
|
|
loc_set=loc_set->next;
|
|
}
|
|
}
|
|
|
|
#endif
|
|
|
|
|