/* $Id$
*
*
* Copyright (C) 2001-2003 Fhg Fokus
*
* This file is part of ser, a free SIP server.
*
* ser 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
*
* For a license to use the ser software under conditions
* other than those described here, or to purchase support for this
* software, please contact iptel.org by e-mail at the following addresses:
* info@iptel.org
*
* ser 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:
* --------
* 2003-01-19 support for duplication lump lists added (jiri)
*/
#include "data_lump.h"
#include "dprint.h"
#include "mem/mem.h"
#include "globals.h"
#include "error.h"
#include <stdlib.h>
#include <string.h>
#ifdef DEBUG_DMALLOC
#include <dmalloc.h>
#endif
/* WARNING: all lump add/insert operations expect a pkg_malloc'ed char*
* pointer the will be DEALLOCATED when the sip_msg is destroyed! */
enum lump_dir { LD_NEXT, LD_BEFORE, LD_AFTER };
/* adds a header to the end
* returns pointer on success, 0 on error */
struct lump* append_new_lump(struct lump** list, char* new_hdr,
int len, int type)
{
struct lump** t;
struct lump* tmp;
for (t=list;*t;t=&((*t)->next));
tmp=pkg_malloc(sizeof(struct lump));
if (tmp==0){
LOG(L_ERR, "ERROR: append_new_lump: out of memory\n");
return 0;
}
memset(tmp,0,sizeof(struct lump));
tmp->type=type;
tmp->op=LUMP_ADD;
tmp->u.value=new_hdr;
tmp->len=len;
*t=tmp;
return tmp;
}
/* inserts a header to the beginning
* returns pointer if success, 0 on error */
struct lump* insert_new_lump(struct lump** list, char* new_hdr,
int len, int type)
{
struct lump* tmp;
tmp=pkg_malloc(sizeof(struct lump));
if (tmp==0){
LOG(L_ERR, "ERROR: insert_new_lump: out of memory\n");
return 0;
}
memset(tmp,0,sizeof(struct lump));
tmp->next=*list;
tmp->type=type;
tmp->op=LUMP_ADD;
tmp->u.value=new_hdr;
tmp->len=len;
*list=tmp;
return tmp;
}
/* inserts a header/data lump immediately after hdr
* returns pointer on success, 0 on error */
struct lump* insert_new_lump_after( struct lump* after, char* new_hdr,
int len, int type)
{
struct lump* tmp;
tmp=pkg_malloc(sizeof(struct lump));
if (tmp==0){
ser_error=E_OUT_OF_MEM;
LOG(L_ERR, "ERROR: insert_new_lump_after: out of memory\n");
return 0;
}
memset(tmp,0,sizeof(struct lump));
tmp->after=after->after;
tmp->type=type;
tmp->op=LUMP_ADD;
tmp->u.value=new_hdr;
tmp->len=len;
after->after=tmp;
return tmp;
}
/* inserts a header/data lump immediately before "before"
* returns pointer on success, 0 on error */
struct lump* insert_new_lump_before( struct lump* before, char* new_hdr,
int len, int type)
{
struct lump* tmp;
tmp=pkg_malloc(sizeof(struct lump));
if (tmp==0){
ser_error=E_OUT_OF_MEM;
LOG(L_ERR,"ERROR: insert_new_lump_before: out of memory\n");
return 0;
}
memset(tmp,0,sizeof(struct lump));
tmp->before=before->before;
tmp->type=type;
tmp->op=LUMP_ADD;
tmp->u.value=new_hdr;
tmp->len=len;
before->before=tmp;
return tmp;
}
/* removes an already existing header/data lump */
struct lump* del_lump(struct lump** list, int offset, int len, int type)
{
struct lump* tmp;
struct lump* prev, *t;
tmp=pkg_malloc(sizeof(struct lump));
if (tmp==0){
LOG(L_ERR, "ERROR: insert_new_lump_before: out of memory\n");
return 0;
}
memset(tmp,0,sizeof(struct lump));
tmp->op=LUMP_DEL;
tmp->type=type;
tmp->u.offset=offset;
tmp->len=len;
prev=0;
for (t=*list;t; prev=t, t=t->next){
/* insert it sorted after offset */
if (((t->op==LUMP_DEL)||(t->op==LUMP_NOP))&&(t->u.offset>offset))
break;
}
tmp->next=t;
if (prev) prev->next=tmp;
else *list=tmp;
return tmp;
}
/* add an anhor */
struct lump* anchor_lump(struct lump** list, int offset, int len, int type)
{
struct lump* tmp;
struct lump* prev, *t;
tmp=pkg_malloc(sizeof(struct lump));
if (tmp==0){
ser_error=E_OUT_OF_MEM;
LOG(L_ERR, "ERROR: insert_new_lump_before: out of memory\n");
return 0;
}
memset(tmp,0,sizeof(struct lump));
tmp->op=LUMP_NOP;
tmp->type=type;
tmp->u.offset=offset;
tmp->len=len;
prev=0;
for (t=*list;t; prev=t, t=t->next){
/* insert it sorted after offset */
if (((t->op==LUMP_DEL)||(t->op==LUMP_NOP))&&(t->u.offset>offset))
break;
}
tmp->next=t;
if (prev) prev->next=tmp;
else *list=tmp;
return tmp;
}
void free_lump(struct lump* lmp)
{
if (lmp && (lmp->op==LUMP_ADD)){
if (lmp->u.value) pkg_free(lmp->u.value);
lmp->u.value=0;
lmp->len=0;
}
}
void free_lump_list(struct lump* l)
{
struct lump* t, *r, *foo,*crt;
t=l;
while(t){
crt=t;
t=t->next;
/*
dangerous recursive clean
if (crt->before) free_lump_list(crt->before);
if (crt->after) free_lump_list(crt->after);
*/
/* no more recursion, clean after and before and that's it */
r=crt->before;
while(r){
foo=r; r=r->before;
free_lump(foo);
pkg_free(foo);
}
r=crt->after;
while(r){
foo=r; r=r->after;
free_lump(foo);
pkg_free(foo);
}
/*clean current elem*/
free_lump(crt);
pkg_free(crt);
}
}
/* free (shallow-ly) a lump and its after/before lists */
static void free_shallow_lump( struct lump *l )
{
struct lump *r, *foo;
r=l->before;
while(r){
foo=r; r=r->before;
pkg_free(foo);
}
r=l->after;
while(r){
foo=r; r=r->after;
pkg_free(foo);
}
pkg_free(l);
}
/* duplicate (shallow-ly) a lump list into pkg memory */
static struct lump *dup_lump_list_r( struct lump *l,
enum lump_dir dir, int *error)
{
int deep_error;
struct lump *new_lump;
deep_error=0; /* optimist: assume success in recursion */
/* if at list end, terminate recursion successfully */
if (!l) { *error=0; return 0; }
/* otherwise duplicate current element */
new_lump=pkg_malloc(sizeof(struct lump));
if (!new_lump) { *error=1; return 0; }
memcpy(new_lump, l, sizeof(struct lump));
new_lump->flags=LUMPFLAG_DUPED;
new_lump->next=new_lump->before=new_lump->after=0;
switch(dir) {
case LD_NEXT:
new_lump->before=dup_lump_list_r(l->before,
LD_BEFORE, &deep_error);
if (deep_error) goto deeperror;
new_lump->after=dup_lump_list_r(l->after,
LD_AFTER, &deep_error);
if (deep_error) goto deeperror;
new_lump->next=dup_lump_list_r(l->next,
LD_NEXT, &deep_error);
break;
case LD_BEFORE:
new_lump->before=dup_lump_list_r(l->before,
LD_BEFORE, &deep_error);
break;
case LD_AFTER:
new_lump->after=dup_lump_list_r(l->after,
LD_AFTER, &deep_error);
break;
default:
LOG(L_CRIT, "BUG: dup_limp_list_r: unknown dir: "
"%d\n", dir );
deep_error=1;
}
if (deep_error) goto deeperror;
*error=0;
return new_lump;
deeperror:
LOG(L_ERR, "ERROR: dup_lump_list_r: out of mem\n");
free_shallow_lump(new_lump);
*error=1;
return 0;
}
/* shallow pkg copy of a lump list
*
* if either original list empty or error occur returns, 0
* is returned, pointer to the copy otherwise
*/
struct lump* dup_lump_list( struct lump *l )
{
int deep_error;
deep_error=0;
return dup_lump_list_r(l, LD_NEXT, &deep_error);
}
void free_duped_lump_list(struct lump* l)
{
struct lump *r, *foo,*crt;
while(l){
crt=l;
l=l->next;
r=crt->before;
while(r){
foo=r; r=r->before;
/* (+): if a new item was introduced to the shallow-ly
* duped list, remove it completely, preserve it
* othewise (it is still refered by original list)
*/
if (foo->flags!=LUMPFLAG_DUPED)
free_lump(foo);
pkg_free(foo);
}
r=crt->after;
while(r){
foo=r; r=r->after;
if (foo->flags!=LUMPFLAG_DUPED) /* (+) ... see above */
free_lump(foo);
pkg_free(foo);
}
/*clean current elem*/
if (crt->flags!=LUMPFLAG_DUPED) /* (+) ... see above */
free_lump(crt);
pkg_free(crt);
}
}