data_lump.c
831faabf
 /* $Id$
  *
7dd0b342
  *
  * 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
831faabf
  */
 
7dd0b342
 
831faabf
 #include "data_lump.h"
 #include "dprint.h"
dda9dab1
 #include "mem/mem.h"
1400b772
 #include "globals.h"
 #include "error.h"
831faabf
 
 #include <stdlib.h>
e22bbdb8
 #include <string.h>
831faabf
 
 #ifdef DEBUG_DMALLOC
 #include <dmalloc.h>
 #endif
 
e61f4ba3
 /* WARNING: all lump add/insert operations excpect a pkg_malloc'ed char* 
  * pointer the will be DEALLOCATED when the sip_msg is destroyed! */
 
831faabf
 
 /* 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));
 
22d4aa5d
 	tmp=pkg_malloc(sizeof(struct lump));
831faabf
 	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;
 
22d4aa5d
 	tmp=pkg_malloc(sizeof(struct lump));
831faabf
 	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;
 
22d4aa5d
 	tmp=pkg_malloc(sizeof(struct lump));
831faabf
 	if (tmp==0){
1400b772
 		ser_error=E_OUT_OF_MEM;
831faabf
 		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;
 
22d4aa5d
 	tmp=pkg_malloc(sizeof(struct lump));
831faabf
 	if (tmp==0){
1400b772
 		ser_error=E_OUT_OF_MEM;
831faabf
 		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;
 
22d4aa5d
 	tmp=pkg_malloc(sizeof(struct lump));
831faabf
 	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;
 
22d4aa5d
 	tmp=pkg_malloc(sizeof(struct lump));
831faabf
 	if (tmp==0){
1400b772
 		ser_error=E_OUT_OF_MEM;
831faabf
 		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)){
22d4aa5d
 		if (lmp->u.value) pkg_free(lmp->u.value);
831faabf
 		lmp->u.value=0;
 		lmp->len=0;
 	}
 }
 
 
 
 void free_lump_list(struct lump* l)
 {
5ada8f8a
 	struct lump* t, *r, *foo,*crt;
831faabf
 	t=l;
 	while(t){
 		crt=t;
 		t=t->next;
5ada8f8a
 	/*
 		 dangerous recursive clean
831faabf
 		if (crt->before) free_lump_list(crt->before);
 		if (crt->after)  free_lump_list(crt->after);
5ada8f8a
 	*/
 		/* no more recursion, clean after and before and that's it */
 		r=crt->before;
 		while(r){
 			foo=r; r=r->before;
6fa79282
 			free_lump(foo);
22d4aa5d
 			pkg_free(foo);
5ada8f8a
 		}
 		r=crt->after;
 		while(r){
 			foo=r; r=r->after;
6fa79282
 			free_lump(foo);
22d4aa5d
 			pkg_free(foo);
5ada8f8a
 		}
 		
831faabf
 		/*clean current elem*/
6fa79282
 		free_lump(crt);
22d4aa5d
 		pkg_free(crt);
831faabf
 	}
 }