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.
158 lines
3.5 KiB
158 lines
3.5 KiB
/*
|
|
* 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
|
|
*
|
|
*/
|
|
/*!
|
|
* \file
|
|
* \brief Kamailio core :: Data lump handling
|
|
* \ingroup core
|
|
* Module: \ref core
|
|
*/
|
|
|
|
|
|
|
|
#include <string.h>
|
|
#include "dprint.h"
|
|
#include "mem/mem.h"
|
|
#include "data_lump_rpl.h"
|
|
|
|
|
|
|
|
struct lump_rpl** add_lump_rpl2(struct sip_msg *msg, char *s,
|
|
int len, int flags)
|
|
{
|
|
struct lump_rpl *lump = 0;
|
|
struct lump_rpl *foo;
|
|
struct lump_rpl** ret;
|
|
|
|
/* some checking */
|
|
if ( (flags&(LUMP_RPL_HDR|LUMP_RPL_BODY))==(LUMP_RPL_HDR|LUMP_RPL_BODY)
|
|
|| (flags&(LUMP_RPL_HDR|LUMP_RPL_BODY))==0 || (flags&LUMP_RPL_SHMEM) ) {
|
|
LM_ERR("bad flags combination (%d)!\n",flags);
|
|
goto error;
|
|
}
|
|
if (len<=0 || s==0) {
|
|
LM_ERR("I won't add an empty lump!\n");
|
|
goto error;
|
|
}
|
|
|
|
/* build the lump */
|
|
lump = (struct lump_rpl*) pkg_malloc
|
|
( sizeof(struct lump_rpl) + ((flags&LUMP_RPL_NODUP)?0:len) );
|
|
if (!lump) {
|
|
LM_ERR("no free pkg memory !\n");
|
|
goto error;
|
|
}
|
|
|
|
if (flags&LUMP_RPL_NODUP) {
|
|
lump->text.s = s;
|
|
} else {
|
|
lump->text.s = ((char*)lump)+sizeof(struct lump_rpl);
|
|
memcpy( lump->text.s, s, len);
|
|
}
|
|
lump->text.len = len;
|
|
lump->flags = flags;
|
|
lump->next = 0;
|
|
|
|
/* add the lump to the msg */
|
|
if (!msg->reply_lump) {
|
|
msg->reply_lump = lump;
|
|
ret=&msg->reply_lump;
|
|
}else{
|
|
if (!(flags&LUMP_RPL_BODY))
|
|
for(foo=msg->reply_lump;foo->next;foo=foo->next);
|
|
else
|
|
for(foo=msg->reply_lump; ;foo=foo->next) {
|
|
if (foo->flags&LUMP_RPL_BODY) {
|
|
LM_ERR("LUMP_RPL_BODY already added!\n");
|
|
pkg_free(lump);
|
|
goto error;
|
|
}
|
|
if (foo->next==0)
|
|
break;
|
|
}
|
|
foo->next = lump;
|
|
ret= &(foo->next);
|
|
}
|
|
|
|
return ret;
|
|
error:
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
void free_lump_rpl(struct lump_rpl* lump)
|
|
{
|
|
if (lump) {
|
|
if (!((lump->flags)&LUMP_RPL_NOFREE) && ((lump->flags)&LUMP_RPL_NODUP)
|
|
&& lump->text.s) {
|
|
pkg_free(lump->text.s);
|
|
lump->text.s = 0;
|
|
}
|
|
pkg_free(lump);
|
|
lump = 0;
|
|
}
|
|
}
|
|
|
|
|
|
void unlink_lump_rpl(struct sip_msg * msg, struct lump_rpl* lump)
|
|
{
|
|
struct lump_rpl *foo,*prev;
|
|
|
|
/* look for the lump to be unlink */
|
|
foo = msg->reply_lump;
|
|
prev = 0;
|
|
while( foo && foo!=lump ) {
|
|
prev = foo;
|
|
foo = foo->next;
|
|
}
|
|
|
|
/* if the lump was found into the list -> unlink it */
|
|
if (foo) {
|
|
if (prev)
|
|
prev->next = foo->next;
|
|
else
|
|
msg->reply_lump = foo->next;
|
|
}
|
|
}
|
|
|
|
void del_nonshm_lump_rpl(struct lump_rpl** list)
|
|
{
|
|
struct lump_rpl* it, *tmp;
|
|
struct lump_rpl** pred;
|
|
|
|
it = *list;
|
|
pred = list;
|
|
|
|
while(it) {
|
|
if (!(it->flags & LUMP_RPL_SHMEM)) {
|
|
tmp = it;
|
|
*pred = it->next;
|
|
it = it->next;
|
|
free_lump_rpl(tmp);
|
|
continue;
|
|
}
|
|
|
|
pred = &it->next;
|
|
it = it->next;
|
|
}
|
|
}
|
|
|