113 lines
3.5 KiB
C
113 lines
3.5 KiB
C
/* $Id$
|
|
|
|
Part of SWI-Prolog
|
|
|
|
Author: Jan Wielemaker
|
|
E-mail: jan@swi.psy.uva.nl
|
|
WWW: http://www.swi-prolog.org
|
|
Copyright (C): 1985-2002, University of Amsterdam
|
|
|
|
This library is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Lesser General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2.1 of the License, or (at your option) any later version.
|
|
|
|
This library 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
|
|
Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with this library; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*/
|
|
|
|
#ifndef BUFFER_H_INCLUDED
|
|
#define BUFFER_H_INCLUDED
|
|
|
|
#define STATIC_BUFFER_SIZE (512)
|
|
#define BUFFER_USES_MALLOC 1
|
|
|
|
#define BUFFER_RING_SIZE 16 /* foreign buffer ring (pl-fli.c) */
|
|
|
|
typedef struct
|
|
{ char * base; /* allocated base */
|
|
char * top; /* pointer to top */
|
|
char * max; /* current location */
|
|
char static_buffer[STATIC_BUFFER_SIZE];
|
|
} tmp_buffer, *TmpBuffer;
|
|
|
|
typedef struct
|
|
{ char * base; /* allocated base */
|
|
char * top; /* pointer to top */
|
|
char * max; /* current location */
|
|
char static_buffer[sizeof(char *)];
|
|
} buffer, *Buffer;
|
|
|
|
void growBuffer(Buffer b, size_t minfree);
|
|
|
|
Buffer findBuffer(int flags);
|
|
|
|
char *buffer_string(const char *s, int flags);
|
|
|
|
int unfindBuffer(int flags);
|
|
|
|
Buffer codes_or_chars_to_buffer(term_t l, unsigned int flags, int wide);
|
|
|
|
#define addBuffer(b, obj, type) \
|
|
do \
|
|
{ if ( (b)->top + sizeof(type) > (b)->max ) \
|
|
growBuffer((Buffer)b, sizeof(type)); \
|
|
*((type *)(b)->top) = obj; \
|
|
(b)->top += sizeof(type); \
|
|
} while(0)
|
|
|
|
#define addMultipleBuffer(b, ptr, times, type) \
|
|
do \
|
|
{ size_t _tms = (times); \
|
|
size_t _len = _tms * sizeof(type); \
|
|
type *_d, *_s = (type *)ptr; \
|
|
if ( (b)->top + _len > (b)->max ) \
|
|
growBuffer((Buffer)b, _len); \
|
|
_d = (type *)(b)->top; \
|
|
while ( _tms-- ) \
|
|
*_d++ = *_s++; \
|
|
(b)->top = (char *)_d; \
|
|
} while(0)
|
|
|
|
#define baseBuffer(b, type) ((type *) (b)->base)
|
|
#define topBuffer(b, type) ((type *) (b)->top)
|
|
#define inBuffer(b, addr) ((char *) (addr) >= (b)->base && \
|
|
(char *) (addr) < (b)->top)
|
|
#define fetchBuffer(b, i, type) (baseBuffer(b, type)[i])
|
|
|
|
#define seekBuffer(b, cnt, type) ((b)->top = sizeof(type) * (cnt) + (b)->base)
|
|
#define sizeOfBuffer(b) ((b)->top - (b)->base)
|
|
#define freeSpaceBuffer(b) ((b)->max - (b)->top)
|
|
#define entriesBuffer(b, type) (sizeOfBuffer(b) / sizeof(type))
|
|
#define initBuffer(b) ((b)->base = (b)->top = (b)->static_buffer, \
|
|
(b)->max = (b)->base + \
|
|
sizeof((b)->static_buffer))
|
|
#define emptyBuffer(b) ((b)->top = (b)->base)
|
|
#define isEmptyBuffer(b) ((b)->top == (b)->base)
|
|
|
|
#ifdef BUFFER_USES_MALLOC
|
|
#define discardBuffer(b) \
|
|
do \
|
|
{ if ( (b)->base && (b)->base != (b)->static_buffer ) \
|
|
{ free((b)->base); \
|
|
(b)->base = (b)->static_buffer; \
|
|
} \
|
|
} while(0)
|
|
#else
|
|
#define discardBuffer(b) \
|
|
do \
|
|
{ if ( (b)->base && (b)->base != (b)->static_buffer ) \
|
|
{ freeHeap((b)->base, (b)->max - (b)->base); \
|
|
(b)->base = (b)->static_buffer; \
|
|
} \
|
|
} while(0)
|
|
#endif
|
|
|
|
#endif /*BUFFER_H_INCLUDED*/
|