2005-07-22 07:46:58 +00:00
|
|
|
/* emem.c
|
|
|
|
* Ethereal memory management and garbage collection functions
|
|
|
|
* Ronnie Sahlberg 2005
|
|
|
|
*
|
2005-07-22 17:55:47 +00:00
|
|
|
* $Id$
|
2005-07-22 07:46:58 +00:00
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
2005-07-24 01:21:38 +00:00
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
#include "config.h"
|
|
|
|
#endif
|
2005-07-22 07:46:58 +00:00
|
|
|
|
|
|
|
#include <stdio.h>
|
2005-07-22 23:38:51 +00:00
|
|
|
#include <stdlib.h>
|
2005-07-24 00:29:57 +00:00
|
|
|
#include <string.h>
|
|
|
|
#include <stdarg.h>
|
2005-07-22 07:46:58 +00:00
|
|
|
#include <glib.h>
|
2005-07-24 01:21:38 +00:00
|
|
|
#include <proto.h>
|
2005-07-22 07:46:58 +00:00
|
|
|
#include "emem.h"
|
|
|
|
|
|
|
|
/* When required, allocate more memory from the OS in this size chunks */
|
|
|
|
#define EMEM_PACKET_CHUNK_SIZE 10485760
|
|
|
|
|
2005-08-26 15:45:31 +00:00
|
|
|
/*
|
|
|
|
* Tools like Valgrind and ElectricFence don't work well with memchunks.
|
|
|
|
* Uncomment the defines below to make {ep|se}_alloc() allocate each
|
|
|
|
* object individually.
|
|
|
|
*/
|
|
|
|
/* #define EP_DEBUG_FREE 1 */
|
|
|
|
/* #define SE_DEBUG_FREE 1 */
|
|
|
|
|
2005-07-22 07:46:58 +00:00
|
|
|
typedef struct _emem_chunk_t {
|
|
|
|
struct _emem_chunk_t *next;
|
|
|
|
unsigned int amount_free;
|
|
|
|
unsigned int free_offset;
|
|
|
|
char *buf;
|
|
|
|
} emem_chunk_t;
|
|
|
|
|
|
|
|
typedef struct _emem_header_t {
|
|
|
|
emem_chunk_t *free_list;
|
|
|
|
emem_chunk_t *used_list;
|
|
|
|
} emem_header_t;
|
|
|
|
|
2005-08-12 08:51:08 +00:00
|
|
|
static emem_header_t ep_packet_mem;
|
|
|
|
static emem_header_t se_packet_mem;
|
2005-07-22 07:46:58 +00:00
|
|
|
|
|
|
|
/* Initialize the packet-lifetime memory allocation pool.
|
|
|
|
* This function should be called only once when Etehreal or Tethereal starts
|
|
|
|
* up.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
ep_init_chunk(void)
|
|
|
|
{
|
2005-08-12 08:51:08 +00:00
|
|
|
ep_packet_mem.free_list=NULL;
|
|
|
|
ep_packet_mem.used_list=NULL;
|
|
|
|
}
|
|
|
|
/* Initialize the capture-lifetime memory allocation pool.
|
|
|
|
* This function should be called only once when Etehreal or Tethereal starts
|
|
|
|
* up.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
se_init_chunk(void)
|
|
|
|
{
|
|
|
|
se_packet_mem.free_list=NULL;
|
|
|
|
se_packet_mem.used_list=NULL;
|
2005-07-22 07:46:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* allocate 'size' amount of memory with an allocation lifetime until the
|
|
|
|
* next packet.
|
|
|
|
*/
|
|
|
|
void *
|
|
|
|
ep_alloc(size_t size)
|
|
|
|
{
|
|
|
|
void *buf;
|
|
|
|
|
2005-08-26 15:45:31 +00:00
|
|
|
#ifndef EP_DEBUG_FREE
|
2005-07-22 07:46:58 +00:00
|
|
|
/* round up to 8 byte boundary */
|
|
|
|
if(size&0x07){
|
|
|
|
size=(size+7)&0xfffffff8;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* make sure we dont try to allocate too much (arbitrary limit) */
|
2005-07-24 01:21:38 +00:00
|
|
|
DISSECTOR_ASSERT(size<(EMEM_PACKET_CHUNK_SIZE>>2));
|
2005-07-22 07:46:58 +00:00
|
|
|
|
|
|
|
/* we dont have any free data, so we must allocate a new one */
|
2005-08-12 08:51:08 +00:00
|
|
|
if(!ep_packet_mem.free_list){
|
|
|
|
emem_chunk_t *npc;
|
|
|
|
npc=g_malloc(sizeof(emem_chunk_t));
|
|
|
|
npc->next=NULL;
|
|
|
|
npc->amount_free=EMEM_PACKET_CHUNK_SIZE;
|
|
|
|
npc->free_offset=0;
|
|
|
|
npc->buf=g_malloc(EMEM_PACKET_CHUNK_SIZE);
|
|
|
|
ep_packet_mem.free_list=npc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* oops, we need to allocate more memory to serve this request
|
|
|
|
* than we have free. move this node to the used list and try again
|
|
|
|
*/
|
|
|
|
if(size>ep_packet_mem.free_list->amount_free){
|
|
|
|
emem_chunk_t *npc;
|
|
|
|
npc=ep_packet_mem.free_list;
|
|
|
|
ep_packet_mem.free_list=ep_packet_mem.free_list->next;
|
|
|
|
npc->next=ep_packet_mem.used_list;
|
|
|
|
ep_packet_mem.used_list=npc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* we dont have any free data, so we must allocate a new one */
|
|
|
|
if(!ep_packet_mem.free_list){
|
|
|
|
emem_chunk_t *npc;
|
|
|
|
npc=g_malloc(sizeof(emem_chunk_t));
|
|
|
|
npc->next=NULL;
|
|
|
|
npc->amount_free=EMEM_PACKET_CHUNK_SIZE;
|
|
|
|
npc->free_offset=0;
|
|
|
|
npc->buf=g_malloc(EMEM_PACKET_CHUNK_SIZE);
|
|
|
|
ep_packet_mem.free_list=npc;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
buf=ep_packet_mem.free_list->buf+ep_packet_mem.free_list->free_offset;
|
|
|
|
|
|
|
|
ep_packet_mem.free_list->amount_free-=size;
|
|
|
|
ep_packet_mem.free_list->free_offset+=size;
|
|
|
|
|
2005-08-26 15:45:31 +00:00
|
|
|
#else /* EP_DEBUG_FREE */
|
|
|
|
emem_chunk_t *npc;
|
|
|
|
|
|
|
|
npc=g_malloc(sizeof(emem_chunk_t));
|
|
|
|
npc->next=ep_packet_mem.used_list;
|
|
|
|
npc->amount_free=size;
|
|
|
|
npc->free_offset=0;
|
|
|
|
npc->buf=g_malloc(size);
|
|
|
|
buf = npc->buf;
|
|
|
|
ep_packet_mem.used_list=npc;
|
|
|
|
#endif /* EP_DEBUG_FREE */
|
|
|
|
|
2005-08-12 08:51:08 +00:00
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
/* allocate 'size' amount of memory with an allocation lifetime until the
|
|
|
|
* next capture.
|
|
|
|
*/
|
|
|
|
void *
|
|
|
|
se_alloc(size_t size)
|
|
|
|
{
|
|
|
|
void *buf;
|
|
|
|
|
2005-08-26 15:45:31 +00:00
|
|
|
#ifndef SE_DEBUG_FREE
|
2005-08-12 08:51:08 +00:00
|
|
|
/* round up to 8 byte boundary */
|
|
|
|
if(size&0x07){
|
|
|
|
size=(size+7)&0xfffffff8;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* make sure we dont try to allocate too much (arbitrary limit) */
|
|
|
|
DISSECTOR_ASSERT(size<(EMEM_PACKET_CHUNK_SIZE>>2));
|
|
|
|
|
|
|
|
/* we dont have any free data, so we must allocate a new one */
|
|
|
|
if(!se_packet_mem.free_list){
|
2005-07-22 07:46:58 +00:00
|
|
|
emem_chunk_t *npc;
|
|
|
|
npc=g_malloc(sizeof(emem_chunk_t));
|
|
|
|
npc->next=NULL;
|
|
|
|
npc->amount_free=EMEM_PACKET_CHUNK_SIZE;
|
|
|
|
npc->free_offset=0;
|
|
|
|
npc->buf=g_malloc(EMEM_PACKET_CHUNK_SIZE);
|
2005-08-12 08:51:08 +00:00
|
|
|
se_packet_mem.free_list=npc;
|
2005-07-22 07:46:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* oops, we need to allocate more memory to serve this request
|
|
|
|
* than we have free. move this node to the used list and try again
|
|
|
|
*/
|
2005-08-12 08:51:08 +00:00
|
|
|
if(size>se_packet_mem.free_list->amount_free){
|
2005-07-22 07:46:58 +00:00
|
|
|
emem_chunk_t *npc;
|
2005-08-12 08:51:08 +00:00
|
|
|
npc=se_packet_mem.free_list;
|
|
|
|
se_packet_mem.free_list=se_packet_mem.free_list->next;
|
|
|
|
npc->next=se_packet_mem.used_list;
|
|
|
|
se_packet_mem.used_list=npc;
|
2005-07-22 07:46:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* we dont have any free data, so we must allocate a new one */
|
2005-08-12 08:51:08 +00:00
|
|
|
if(!se_packet_mem.free_list){
|
2005-07-22 07:46:58 +00:00
|
|
|
emem_chunk_t *npc;
|
|
|
|
npc=g_malloc(sizeof(emem_chunk_t));
|
|
|
|
npc->next=NULL;
|
|
|
|
npc->amount_free=EMEM_PACKET_CHUNK_SIZE;
|
|
|
|
npc->free_offset=0;
|
|
|
|
npc->buf=g_malloc(EMEM_PACKET_CHUNK_SIZE);
|
2005-08-12 08:51:08 +00:00
|
|
|
se_packet_mem.free_list=npc;
|
2005-07-22 07:46:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-08-12 08:51:08 +00:00
|
|
|
buf=se_packet_mem.free_list->buf+se_packet_mem.free_list->free_offset;
|
2005-07-22 07:46:58 +00:00
|
|
|
|
2005-08-12 08:51:08 +00:00
|
|
|
se_packet_mem.free_list->amount_free-=size;
|
|
|
|
se_packet_mem.free_list->free_offset+=size;
|
2005-07-22 07:46:58 +00:00
|
|
|
|
2005-08-26 15:45:31 +00:00
|
|
|
#else /* SE_DEBUG_FREE */
|
|
|
|
emem_chunk_t *npc;
|
|
|
|
|
|
|
|
npc=g_malloc(sizeof(emem_chunk_t));
|
2005-09-02 19:50:01 +00:00
|
|
|
npc->next=se_packet_mem.used_list;
|
2005-08-26 15:45:31 +00:00
|
|
|
npc->amount_free=size;
|
|
|
|
npc->free_offset=0;
|
|
|
|
npc->buf=g_malloc(size);
|
|
|
|
buf = npc->buf;
|
|
|
|
se_packet_mem.used_list=npc;
|
|
|
|
#endif /* SE_DEBUG_FREE */
|
|
|
|
|
2005-07-22 07:46:58 +00:00
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
2005-08-12 08:51:08 +00:00
|
|
|
|
2005-07-26 18:32:12 +00:00
|
|
|
void* ep_alloc0(size_t size) {
|
|
|
|
return memset(ep_alloc(size),'\0',size);
|
|
|
|
}
|
2005-07-24 00:29:57 +00:00
|
|
|
|
|
|
|
gchar* ep_strdup(const gchar* src) {
|
|
|
|
guint len = strlen(src);
|
|
|
|
gchar* dst;
|
|
|
|
|
|
|
|
dst = strncpy(ep_alloc(len+1), src, len);
|
|
|
|
|
|
|
|
dst[len] = '\0';
|
|
|
|
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
|
|
|
gchar* ep_strndup(const gchar* src, size_t len) {
|
2005-10-08 12:35:51 +00:00
|
|
|
gchar* dst = ep_alloc(len+1);
|
2005-10-10 08:24:56 +00:00
|
|
|
guint i;
|
2005-10-08 12:35:51 +00:00
|
|
|
|
|
|
|
for (i = 0; src[i] && i < len; i++)
|
2005-10-10 08:24:56 +00:00
|
|
|
dst[i] = src[i];
|
2005-10-08 12:35:51 +00:00
|
|
|
|
|
|
|
dst[i] = '\0';
|
2005-07-24 00:29:57 +00:00
|
|
|
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
|
|
|
guint8* ep_memdup(const guint8* src, size_t len) {
|
|
|
|
return memcpy(ep_alloc(len), src, len);
|
|
|
|
}
|
|
|
|
|
2005-10-10 08:24:56 +00:00
|
|
|
gchar* ep_strdup_vprintf(const gchar* fmt, va_list ap) {
|
|
|
|
va_list ap2;
|
|
|
|
guint len;
|
|
|
|
gchar* dst;
|
|
|
|
|
|
|
|
G_VA_COPY(ap2, ap);
|
|
|
|
|
|
|
|
len = g_printf_string_upper_bound(fmt, ap);
|
|
|
|
|
|
|
|
dst = ep_alloc(len+1);
|
|
|
|
g_vsnprintf (dst, len, fmt, ap2);
|
|
|
|
va_end(ap2);
|
|
|
|
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
2005-07-24 00:29:57 +00:00
|
|
|
gchar* ep_strdup_printf(const gchar* fmt, ...) {
|
|
|
|
va_list ap;
|
|
|
|
gchar* dst;
|
|
|
|
|
|
|
|
va_start(ap,fmt);
|
2005-10-10 08:24:56 +00:00
|
|
|
dst = ep_strdup_vprintf(fmt, ap);
|
2005-07-24 00:29:57 +00:00
|
|
|
va_end(ap);
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
2005-07-26 18:32:12 +00:00
|
|
|
gchar** ep_strsplit(const gchar* string, const gchar* sep, int max_tokens) {
|
|
|
|
gchar* splitted;
|
|
|
|
gchar* s;
|
|
|
|
guint tokens;
|
2005-07-27 00:45:02 +00:00
|
|
|
guint str_len;
|
|
|
|
guint sep_len;
|
2005-07-26 18:32:12 +00:00
|
|
|
guint i;
|
|
|
|
gchar** vec;
|
|
|
|
enum { AT_START, IN_PAD, IN_TOKEN } state;
|
|
|
|
guint curr_tok = 0;
|
|
|
|
|
|
|
|
if ( ! string
|
|
|
|
|| ! sep
|
|
|
|
|| ! sep[0])
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
s = splitted = ep_strdup(string);
|
|
|
|
str_len = strlen(splitted);
|
|
|
|
sep_len = strlen(sep);
|
|
|
|
|
|
|
|
if (max_tokens < 1) max_tokens = INT_MAX;
|
|
|
|
|
|
|
|
tokens = 1;
|
|
|
|
|
|
|
|
|
|
|
|
while (tokens <= (guint)max_tokens && ( s = strstr(s,sep) )) {
|
|
|
|
tokens++;
|
|
|
|
|
|
|
|
for(i=0; i < sep_len; i++ )
|
|
|
|
s[i] = '\0';
|
|
|
|
|
|
|
|
s += sep_len;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2005-07-27 00:45:02 +00:00
|
|
|
vec = ep_alloc_array(gchar*,tokens+1);
|
2005-07-26 18:32:12 +00:00
|
|
|
state = AT_START;
|
|
|
|
|
|
|
|
for (i=0; i< str_len; i++) {
|
|
|
|
switch(state) {
|
|
|
|
case AT_START:
|
|
|
|
switch(splitted[i]) {
|
|
|
|
case '\0':
|
|
|
|
state = IN_PAD;
|
|
|
|
continue;
|
|
|
|
default:
|
|
|
|
vec[curr_tok] = &(splitted[i]);
|
|
|
|
curr_tok++;
|
|
|
|
state = IN_TOKEN;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
case IN_TOKEN:
|
|
|
|
switch(splitted[i]) {
|
|
|
|
case '\0':
|
|
|
|
state = IN_PAD;
|
|
|
|
default:
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
case IN_PAD:
|
|
|
|
switch(splitted[i]) {
|
|
|
|
default:
|
|
|
|
vec[curr_tok] = &(splitted[i]);
|
|
|
|
curr_tok++;
|
|
|
|
state = IN_TOKEN;
|
|
|
|
case '\0':
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
vec[curr_tok] = NULL;
|
|
|
|
|
|
|
|
return vec;
|
|
|
|
}
|
2005-07-24 00:29:57 +00:00
|
|
|
|
2005-08-16 00:55:08 +00:00
|
|
|
|
|
|
|
|
|
|
|
void* se_alloc0(size_t size) {
|
|
|
|
return memset(se_alloc(size),'\0',size);
|
|
|
|
}
|
|
|
|
|
|
|
|
gchar* se_strdup(const gchar* src) {
|
|
|
|
guint len = strlen(src);
|
|
|
|
gchar* dst;
|
|
|
|
|
|
|
|
dst = strncpy(se_alloc(len+1), src, len);
|
|
|
|
|
|
|
|
dst[len] = '\0';
|
|
|
|
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
|
|
|
gchar* se_strndup(const gchar* src, size_t len) {
|
2005-10-08 12:35:51 +00:00
|
|
|
gchar* dst = se_alloc(len+1);
|
2005-10-10 08:24:56 +00:00
|
|
|
guint i;
|
2005-10-08 12:35:51 +00:00
|
|
|
|
|
|
|
for (i = 0; src[i] && i < len; i++)
|
2005-10-10 08:24:56 +00:00
|
|
|
dst[i] = src[i];
|
2005-10-08 12:35:51 +00:00
|
|
|
|
|
|
|
dst[i] = '\0';
|
2005-08-16 00:55:08 +00:00
|
|
|
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
|
|
|
guint8* se_memdup(const guint8* src, size_t len) {
|
|
|
|
return memcpy(se_alloc(len), src, len);
|
|
|
|
}
|
|
|
|
|
2005-10-10 08:24:56 +00:00
|
|
|
gchar* se_strdup_vprintf(const gchar* fmt, va_list ap) {
|
|
|
|
va_list ap2;
|
|
|
|
guint len;
|
|
|
|
gchar* dst;
|
|
|
|
|
|
|
|
G_VA_COPY(ap2, ap);
|
|
|
|
|
|
|
|
len = g_printf_string_upper_bound(fmt, ap);
|
|
|
|
|
|
|
|
dst = se_alloc(len+1);
|
|
|
|
g_vsnprintf (dst, len, fmt, ap2);
|
|
|
|
va_end(ap2);
|
|
|
|
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
2005-08-16 00:55:08 +00:00
|
|
|
gchar* se_strdup_printf(const gchar* fmt, ...) {
|
|
|
|
va_list ap;
|
|
|
|
gchar* dst;
|
|
|
|
|
|
|
|
va_start(ap,fmt);
|
2005-10-10 08:24:56 +00:00
|
|
|
dst = se_strdup_vprintf(fmt, ap);
|
2005-08-16 00:55:08 +00:00
|
|
|
va_end(ap);
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
2005-07-22 07:46:58 +00:00
|
|
|
/* release all allocated memory back to the pool.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
ep_free_all(void)
|
|
|
|
{
|
|
|
|
emem_chunk_t *npc;
|
|
|
|
|
2005-08-26 15:45:31 +00:00
|
|
|
/* move all used chunks over to the free list */
|
2005-08-12 08:51:08 +00:00
|
|
|
while(ep_packet_mem.used_list){
|
|
|
|
npc=ep_packet_mem.used_list;
|
|
|
|
ep_packet_mem.used_list=ep_packet_mem.used_list->next;
|
|
|
|
npc->next=ep_packet_mem.free_list;
|
|
|
|
ep_packet_mem.free_list=npc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* clear them all out */
|
2005-08-26 15:45:31 +00:00
|
|
|
npc = ep_packet_mem.free_list;
|
|
|
|
while (npc != NULL) {
|
|
|
|
#ifndef EP_DEBUG_FREE
|
2005-08-12 08:51:08 +00:00
|
|
|
npc->amount_free=EMEM_PACKET_CHUNK_SIZE;
|
|
|
|
npc->free_offset=0;
|
2005-08-26 15:45:31 +00:00
|
|
|
npc = npc->next;
|
|
|
|
#else /* EP_DEBUG_FREE */
|
|
|
|
emem_chunk_t *next = npc->next;
|
|
|
|
|
|
|
|
g_free(npc->buf);
|
|
|
|
g_free(npc);
|
|
|
|
npc = next;
|
|
|
|
#endif /* EP_DEBUG_FREE */
|
2005-08-12 08:51:08 +00:00
|
|
|
}
|
2005-08-26 15:45:31 +00:00
|
|
|
|
|
|
|
#ifdef EP_DEBUG_FREE
|
|
|
|
ep_init_chunk();
|
|
|
|
#endif
|
2005-08-12 08:51:08 +00:00
|
|
|
}
|
|
|
|
/* release all allocated memory back to the pool.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
se_free_all(void)
|
|
|
|
{
|
|
|
|
emem_chunk_t *npc;
|
|
|
|
|
|
|
|
/* move all used chunks ove to the free list */
|
|
|
|
while(se_packet_mem.used_list){
|
|
|
|
npc=se_packet_mem.used_list;
|
|
|
|
se_packet_mem.used_list=se_packet_mem.used_list->next;
|
|
|
|
npc->next=se_packet_mem.free_list;
|
|
|
|
se_packet_mem.free_list=npc;
|
2005-07-22 07:46:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* clear them all out */
|
2005-08-26 15:45:31 +00:00
|
|
|
npc = se_packet_mem.free_list;
|
|
|
|
while (npc != NULL) {
|
|
|
|
#ifndef SE_DEBUG_FREE
|
2005-07-22 07:46:58 +00:00
|
|
|
npc->amount_free=EMEM_PACKET_CHUNK_SIZE;
|
|
|
|
npc->free_offset=0;
|
2005-08-26 15:45:31 +00:00
|
|
|
npc = npc->next;
|
|
|
|
#else /* SE_DEBUG_FREE */
|
|
|
|
emem_chunk_t *next = npc->next;
|
|
|
|
|
|
|
|
g_free(npc->buf);
|
|
|
|
g_free(npc);
|
|
|
|
npc = next;
|
|
|
|
#endif /* SE_DEBUG_FREE */
|
2005-07-22 07:46:58 +00:00
|
|
|
}
|
2005-08-26 15:45:31 +00:00
|
|
|
|
|
|
|
#ifdef SE_DEBUG_FREE
|
|
|
|
se_init_chunk();
|
|
|
|
#endif
|
2005-07-22 07:46:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-10-01 10:36:57 +00:00
|
|
|
ep_stack_t ep_stack_new(void) {
|
|
|
|
ep_stack_t s = ep_new(struct _ep_stack_frame_t*);
|
|
|
|
*s = ep_new0(struct _ep_stack_frame_t);
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* for ep_stack_t we'll keep the popped frames so we reuse them instead
|
|
|
|
of allocating new ones.
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
void* ep_stack_push(ep_stack_t stack, void* data) {
|
|
|
|
struct _ep_stack_frame_t* frame;
|
|
|
|
struct _ep_stack_frame_t* head = (*stack);
|
|
|
|
|
|
|
|
if (head->above) {
|
|
|
|
frame = head->above;
|
|
|
|
} else {
|
|
|
|
frame = ep_new(struct _ep_stack_frame_t);
|
|
|
|
head->above = frame;
|
|
|
|
frame->below = head;
|
|
|
|
frame->above = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
frame->payload = data;
|
|
|
|
(*stack) = frame;
|
|
|
|
|
|
|
|
return data;
|
|
|
|
}
|
|
|
|
|
|
|
|
void* ep_stack_pop(ep_stack_t stack) {
|
|
|
|
|
|
|
|
if ((*stack)->below) {
|
|
|
|
(*stack) = (*stack)->below;
|
|
|
|
return (*stack)->above->payload;
|
|
|
|
} else {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|