pool.c

具有IDE功能的编辑器

/* pool.c - create a file in memeory to write to
   Copyright (C) 1996-2000 Paul Sheer

   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.
*/

#include <config.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include "stringtools.h"
#include "pool.h"
#include "mad.h"

#define min(x,y) ((x)<=(y)?(x):(y))

/* returns NULL on error */
#ifdef HAVE_MAD
POOL *mad_pool_init (char *file, int line)
#else
POOL *pool_init (void)
#endif
{
    POOL *p;
    p = malloc (sizeof (POOL));
    if (!p)
	return 0;
#ifdef HAVE_MAD
    p->current = p->start = mad_alloc (START_SIZE, file, line);
#else
    p->current = p->start = malloc (START_SIZE);
#endif
    if (!p->start)
	return 0;
    p->end = p->start + START_SIZE;
    p->length = START_SIZE;
    return p;
}

/* free's a pool except for the actual data which is returned */
/* result must be free'd by the caller even if the pool_length is zero */
unsigned char *pool_break (POOL * p)
{
    unsigned char *d;
    d = p->start;
    free (p);
    return d;
}

/* free's a pool and all its data */
void pool_free (POOL * p)
{
    if (!p)
	return;
    if (p->start)
	free (p->start);
    free (p);
}

/* make space for a forthcoming write of l bytes. leaves current untouched */
#ifdef HAVE_MAD
unsigned long mad_pool_advance (POOL * p, unsigned long l, char *file, int line)
#else
unsigned long pool_advance (POOL * p, unsigned long l)
#endif
{
    if ((unsigned long) p->current + l > (unsigned long) p->end) {
	unsigned char *t;
	unsigned long old_length;
	old_length = p->length;
	do {
	    p->length *= 2;
	    p->end = p->start + p->length;
	} while ((unsigned long) p->current + l > (unsigned long) p->end);
#ifdef HAVE_MAD
	t = mad_alloc (p->length, file, line);
#else
	t = malloc (p->length);
#endif
	if (!t)
	    return 0;
	memcpy (t, p->start, old_length);
	p->current = t + (unsigned long) p->current - (unsigned long) p->start;
	free (p->start);
	p->start = t;
	p->end = p->start + p->length;
    }
    return l;
}

/* returns the number of bytes written into p */
#ifdef HAVE_MAD
unsigned long mad_pool_write (POOL * p, unsigned char *d, unsigned long l, char *file, int line)
#else
unsigned long pool_write (POOL * p, unsigned char *d, unsigned long l)
#endif
{
    unsigned long a;
#ifdef HAVE_MAD
    a = mad_pool_advance (p, l, file, line);
#else
    a = pool_advance (p, l);
#endif
    memcpy (p->current, d, a);
    p->current += a;
    return a;
}

/* returns the number of bytes read into d */
unsigned long pool_read (POOL * p, unsigned char *d, unsigned long l)
{
    unsigned long m;
    m = min (l, (unsigned long) p->end - (unsigned long) p->current);
    memcpy (d, p->current, m);
    p->current += m;
    return m;
}

/* sets the position in the pool */
unsigned long pool_seek (POOL * p, unsigned long l)
{
    unsigned long m;
    m = min (l, p->length);
    p->current = p->start + m;
    return m;
}

/* used like sprintf */
unsigned long pool_printf (POOL * p, const char *fmt,...)
{
    unsigned long l;
    va_list ap;
    va_start (ap, fmt);
    l = vfmtlen (fmt, ap) + 1;
    va_end (ap);
    if (pool_advance (p, l) != l)
	return 0;
    va_start (ap, fmt);
    vsprintf ((char *) p->current, fmt, ap);
    va_end (ap);
    l = strlen ((char *) p->current);
    p->current += l;
    return l;
}

/* zero the char after the last char written/read */
int pool_null (POOL * p)
{
    if (pool_advance (p, 1 != 1))
	return 0;
    p->current[0] = 0;
    return 1;
}