/* * Copyright (c) 2002, The Tendra Project * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice unmodified, this list of conditions, and the following * disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * Crown Copyright (c) 1997 * * This TenDRA(r) Computer Program is subject to Copyright * owned by the United Kingdom Secretary of State for Defence * acting through the Defence Evaluation and Research Agency * (DERA). It is made available to Recipients with a * royalty-free licence for its use, reproduction, transfer * to other parties and amendment for any purpose not excluding * product development provided that any such use et cetera * shall be deemed to be acceptance of the following conditions:- * * (1) Its Recipients shall ensure that this Notice is * reproduced upon any copies or amended versions of it; * * (2) Any amended version of it shall be clearly marked to * show both the nature of and the organisation responsible * for the relevant amendment or amendments; * * (3) Its onward transfer from a recipient to another * party shall be deemed to be that party's acceptance of * these conditions; * * (4) DERA gives no warranty or assurance as to its * quality or suitability for any purpose and DERA accepts * no liability whatsoever in relation to any use to which * it may be put. * * $TenDRA: tendra/src/producers/common/utility/buffer.c,v 1.12 2004/08/15 11:13:37 bp Exp $ */ #include "config.h" #include "producer.h" #include #include "fmm.h" #include "msgcat.h" #include "c_types.h" #include "error.h" #include "buffer.h" #include "ustring.h" /* * FREE A BUFFER * * This routine frees the contents of the buffer bf. */ void free_buffer(BUFFER *bf) { xfree (bf->start); bf->start = NULL; bf->posn = NULL; bf->end = NULL; return; } /* * CLEAR A BUFFER * * This routine sets the current position of the buffer bf to the start * of the buffer and sets the buffer file to f. It returns bf. */ BUFFER *clear_buffer(BUFFER *bf, FILE *f) { bf->posn = bf->start; bf->file = f; return (bf); } /* * OUTPUT THE CONTENTS OF A BUFFER * * This routine outputs the content of the buffer bf to the associated * file and resets the position to the start of the buffer. If fl is * true then the file is flushed. */ void output_buffer(BUFFER *bf, int fl) { FILE *f = bf->file; if (f) { string s = bf->start; size_t n = (size_t) (bf->posn - s); if (n) { IGNORE fwrite (s, sizeof (character), n, f); if (fl) IGNORE fflush_v (f); bf->posn = s; } } return; } /* * EXTEND A BUFFER * * This routine extends the buffer bf. s gives a pointer into the buffer, * the corresponding position in the extended buffer is returned. */ string extend_buffer(BUFFER *bf, string s) { string p = bf->start; size_t m = (size_t) (s - p); size_t n = (size_t) (bf->end - p) + 500; p = xrealloc (p, sizeof(*p) * (n + 12)); bf->start = p; bf->end = p + n; return (p + m); } /* * MAKE SPACE IN A BUFFER * * This routine makes space for at least m + 1 characters in the buffer * bf following the position s. It returns the corresponding position * in the extended buffer. */ string stretch_buffer(BUFFER *bf, string s, size_t m) { size_t n = (size_t) (bf->end - s); while (m >= n) { s = extend_buffer (bf, s); n = (size_t) (bf->end - s); } return (s); } /* * ADD A CHARACTER TO A BUFFER * * This routine adds the character c to the buffer bf. Note that bf will * not necessarily be null terminated after this routine. */ void bfputc(BUFFER *bf, int c) { string p = bf->posn; if (p == bf->end) p = extend_buffer (bf, p); *p = (character) c; bf->posn = p + 1; return; } /* * ADD A STRING TO A BUFFER * * This routine adds the string s to the buffer bf. Note that this * guarantees that bf will be null terminated. */ void bfputs(BUFFER *bf, string s) { size_t m = ustrlen (s); string p = stretch_buffer (bf, bf->posn, m); ustrcpy_v (p, s); bf->posn = p + m; return; } /* * ADD A FORMATTED STRING TO A BUFFER * * This routine adds the string s to the buffer bf, using printf-like * format characters to print the extra arguments. Note that this * guarantees that bf will be null terminated. */ void bfprintf(BUFFER *bf, const char *s, ...) /* VARARGS */ { char c; string p; size_t m; va_list args; va_start (args, s); m = strlen (s); p = stretch_buffer (bf, bf->posn, m); /* Scan through format string */ while (c = *(s++), c != 0) { if (c == '%') { int ext = 0; c = *(s++); if (c == 'l') { c = *(s++); ext = 1; } switch (c) { case 'c' : { /* '%c' -> character (passed as int) */ int ac = va_arg (args, int); *(p++) = (character) ac; break; } case 'd' : { p = stretch_buffer (bf, p, (size_t) 50); if (ext) { /* '%ld' -> long */ long al = va_arg (args, long); sprintf_v (strlit (p), "%ld", al); } else { /* '%d' -> int */ int ad = va_arg (args, int); sprintf_v (strlit (p), "%d", ad); } p = p + ustrlen (p); break; } case 's' : { /* '%s' -> string */ string as = va_arg (args, string); if (as) { m = ustrlen (as); p = stretch_buffer (bf, p, m); ustrcpy_v (p, as); p += m; } break; } case 'u' : { p = stretch_buffer (bf, p, (size_t) 50); if (ext) { /* '%lu' -> unsigned long */ unsigned long al = va_arg (args, unsigned long); sprintf_v (strlit (p), "%lu", al); } else { /* '%u' -> unsigned */ unsigned au = va_arg (args, unsigned); sprintf_v (strlit (p), "%u", au); } p = p + ustrlen (p); break; } case 'x' : { /* '%x' -> char * */ char *ax = va_arg (args, char *); if (ax) { m = strlen (ax); p = stretch_buffer (bf, p, m); ustrcpy_v (p, ustrlit (ax)); p += m; } break; } case '%' : { /* '%%' -> percent */ *(p++) = (character) c; break; } default : { /* Other characters */ FAIL (Unknown format character); s = ""; break; } } } else { *(p++) = (character) c; } } *p = 0; bf->posn = p; va_end (args); return; } /* * READ A STRING FROM A BUFFER * * This routine reads at most n characters from the buffer bf into the * string s. It returns the number of characters read. */ size_t bfread(BUFFER *bf, string s, size_t n) { string p = bf->posn; size_t m = (size_t) (bf->end - p); if (m > n) m = n; if (m) { xumemcpy (s, p, m); bf->posn = p + m; } return (m); }