Moving SLAB_ALLOC and SLAB_FREE to its own header file
svn path=/trunk/; revision=9139
This commit is contained in:
parent
77ae9aa55a
commit
917c9da95e
26
epan/proto.c
26
epan/proto.c
|
@ -1,7 +1,7 @@
|
|||
/* proto.c
|
||||
* Routines for protocol tree
|
||||
*
|
||||
* $Id: proto.c,v 1.116 2003/11/26 12:22:22 sahlberg Exp $
|
||||
* $Id: proto.c,v 1.117 2003/12/02 09:11:15 sahlberg Exp $
|
||||
*
|
||||
* Ethereal - Network traffic analyzer
|
||||
* By Gerald Combs <gerald@ethereal.com>
|
||||
|
@ -44,6 +44,7 @@
|
|||
#include "proto.h"
|
||||
#include "int-64bit.h"
|
||||
#include "epan_dissect.h"
|
||||
#include "slab.h"
|
||||
|
||||
#define cVALS(x) (const value_string*)(x)
|
||||
|
||||
|
@ -178,29 +179,6 @@ static item_label_t *item_label_free_list = NULL;
|
|||
|
||||
|
||||
|
||||
/* we never free any memory we have allocated, when it is returned to us
|
||||
we just store it in the free list until (hopefully) it gets used again
|
||||
*/
|
||||
#define SLAB_ALLOC(item, next, list) \
|
||||
if(!list){ \
|
||||
int i; \
|
||||
void *tmp; \
|
||||
tmp=g_malloc(100*sizeof(*item)); \
|
||||
for(i=0;i<100;i++){ \
|
||||
item=tmp; \
|
||||
item=&item[i]; \
|
||||
next=list; \
|
||||
list=item; \
|
||||
} \
|
||||
} \
|
||||
item=list; \
|
||||
list=next;
|
||||
|
||||
#define SLAB_FREE(item, next, list) \
|
||||
next=list; \
|
||||
list=item;
|
||||
|
||||
|
||||
/* List which stores protocols and fields that have been registered */
|
||||
typedef struct _gpa_hfinfo_t {
|
||||
guint32 len;
|
||||
|
|
|
@ -0,0 +1,50 @@
|
|||
/* slab.h
|
||||
* Definitions for very simple slab handling
|
||||
*
|
||||
* $Id: slab.h,v 1.1 2003/12/02 09:11:16 sahlberg Exp $
|
||||
*
|
||||
* Ethereal - Network traffic analyzer
|
||||
* By Gerald Combs <gerald@ethereal.com>
|
||||
* Copyright 1998 Gerald Combs
|
||||
*
|
||||
* This program 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.
|
||||
*
|
||||
* This program 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.
|
||||
*/
|
||||
|
||||
#ifndef __SLAB_H__
|
||||
#define __SLAB_H__
|
||||
|
||||
/* we never free any memory we have allocated, when it is returned to us
|
||||
we just store it in the free list until (hopefully) it gets used again
|
||||
*/
|
||||
#define SLAB_ALLOC(item, next, list) \
|
||||
if(!list){ \
|
||||
int i; \
|
||||
void *tmp; \
|
||||
tmp=g_malloc(100*sizeof(*item)); \
|
||||
for(i=0;i<100;i++){ \
|
||||
item=tmp; \
|
||||
item=&item[i]; \
|
||||
next=list; \
|
||||
list=item; \
|
||||
} \
|
||||
} \
|
||||
item=list; \
|
||||
list=next;
|
||||
|
||||
#define SLAB_FREE(item, next, list) \
|
||||
next=list; \
|
||||
list=item;
|
||||
|
||||
#endif /* slab.h */
|
Loading…
Reference in New Issue