mirror of
https://https.git.savannah.gnu.org/git/gnulib.git
synced 2026-05-13 15:13:36 +00:00
298 lines
7.8 KiB
C
298 lines
7.8 KiB
C
/* A buffer that accumulates a string by piecewise concatenation.
|
|
Copyright (C) 2021-2023 Free Software Foundation, Inc.
|
|
|
|
This file 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 3 of the
|
|
License, or (at your option) any later version.
|
|
|
|
This file 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 program. If not, see <https://www.gnu.org/licenses/>. */
|
|
|
|
/* Written by Bruno Haible <bruno@clisp.org>, 2021. */
|
|
|
|
#include <config.h>
|
|
|
|
/* Specification. */
|
|
#include "string-buffer.h"
|
|
|
|
#include <stdarg.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
void
|
|
sb_init (struct string_buffer *buffer)
|
|
{
|
|
buffer->data = buffer->space;
|
|
buffer->length = 0;
|
|
buffer->allocated = sizeof (buffer->space);
|
|
buffer->error = false;
|
|
}
|
|
|
|
/* Ensures that INCREMENT bytes are available beyond the current used length
|
|
of BUFFER.
|
|
Returns 0, or -1 in case of out-of-memory error. */
|
|
static int
|
|
sb_ensure_more_bytes (struct string_buffer *buffer, size_t increment)
|
|
{
|
|
size_t incremented_length = buffer->length + increment;
|
|
if (incremented_length < increment)
|
|
/* Overflow. */
|
|
return -1;
|
|
|
|
if (buffer->allocated < incremented_length)
|
|
{
|
|
size_t new_allocated = 2 * buffer->allocated;
|
|
if (new_allocated < buffer->allocated)
|
|
/* Overflow. */
|
|
return -1;
|
|
if (new_allocated < incremented_length)
|
|
new_allocated = incremented_length;
|
|
|
|
char *new_data;
|
|
if (buffer->data == buffer->space)
|
|
{
|
|
new_data = (char *) malloc (new_allocated);
|
|
if (new_data == NULL)
|
|
/* Out-of-memory. */
|
|
return -1;
|
|
memcpy (new_data, buffer->data, buffer->length);
|
|
}
|
|
else
|
|
{
|
|
new_data = (char *) realloc (buffer->data, new_allocated);
|
|
if (new_data == NULL)
|
|
/* Out-of-memory. */
|
|
return -1;
|
|
}
|
|
buffer->data = new_data;
|
|
buffer->allocated = new_allocated;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
sb_append (struct string_buffer *buffer, const char *str)
|
|
{
|
|
size_t len = strlen (str);
|
|
if (sb_ensure_more_bytes (buffer, len) < 0)
|
|
{
|
|
buffer->error = true;
|
|
return -1;
|
|
}
|
|
memcpy (buffer->data + buffer->length, str, len);
|
|
buffer->length += len;
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
sb_appendvf (struct string_buffer *buffer, const char *formatstring,
|
|
va_list list)
|
|
{
|
|
va_list list_copy;
|
|
|
|
/* Make a bit of room, so that the probability that the first vsnprintf() call
|
|
succeeds is high. */
|
|
size_t room = buffer->allocated - buffer->length;
|
|
if (room < 64)
|
|
{
|
|
if (sb_ensure_more_bytes (buffer, 64) < 0)
|
|
{
|
|
buffer->error = true;
|
|
return -1;
|
|
}
|
|
room = buffer->allocated - buffer->length;
|
|
}
|
|
|
|
va_copy (list_copy, list);
|
|
|
|
/* First vsnprintf() call. */
|
|
int ret = vsnprintf (buffer->data + buffer->length, room, formatstring, list);
|
|
if (ret < 0)
|
|
{
|
|
/* Failed. */
|
|
buffer->error = true;
|
|
ret = -1;
|
|
}
|
|
else
|
|
{
|
|
if ((size_t) ret <= room)
|
|
{
|
|
/* The result has fit into room bytes. */
|
|
buffer->length += (size_t) ret;
|
|
ret = 0;
|
|
}
|
|
else
|
|
{
|
|
/* The result was truncated. Make more room, for a second vsnprintf()
|
|
call. */
|
|
if (sb_ensure_more_bytes (buffer, (size_t) ret) < 0)
|
|
{
|
|
buffer->error = true;
|
|
ret = -1;
|
|
}
|
|
else
|
|
{
|
|
/* Second vsnprintf() call. */
|
|
room = buffer->allocated - buffer->length;
|
|
ret = vsnprintf (buffer->data + buffer->length, room,
|
|
formatstring, list_copy);
|
|
if (ret < 0)
|
|
{
|
|
/* Failed. */
|
|
buffer->error = true;
|
|
ret = -1;
|
|
}
|
|
else
|
|
{
|
|
if ((size_t) ret <= room)
|
|
{
|
|
/* The result has fit into room bytes. */
|
|
buffer->length += (size_t) ret;
|
|
ret = 0;
|
|
}
|
|
else
|
|
/* The return values of the vsnprintf() calls are not
|
|
consistent. */
|
|
abort ();
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
va_end (list_copy);
|
|
return ret;
|
|
}
|
|
|
|
int
|
|
sb_appendf (struct string_buffer *buffer, const char *formatstring, ...)
|
|
{
|
|
va_list args;
|
|
|
|
/* Make a bit of room, so that the probability that the first vsnprintf() call
|
|
succeeds is high. */
|
|
size_t room = buffer->allocated - buffer->length;
|
|
if (room < 64)
|
|
{
|
|
if (sb_ensure_more_bytes (buffer, 64) < 0)
|
|
{
|
|
buffer->error = true;
|
|
return -1;
|
|
}
|
|
room = buffer->allocated - buffer->length;
|
|
}
|
|
|
|
va_start (args, formatstring);
|
|
|
|
/* First vsnprintf() call. */
|
|
int ret = vsnprintf (buffer->data + buffer->length, room, formatstring, args);
|
|
if (ret < 0)
|
|
{
|
|
/* Failed. */
|
|
buffer->error = true;
|
|
ret = -1;
|
|
}
|
|
else
|
|
{
|
|
if ((size_t) ret <= room)
|
|
{
|
|
/* The result has fit into room bytes. */
|
|
buffer->length += (size_t) ret;
|
|
ret = 0;
|
|
}
|
|
else
|
|
{
|
|
/* The result was truncated. Make more room, for a second vsnprintf()
|
|
call. */
|
|
if (sb_ensure_more_bytes (buffer, (size_t) ret) < 0)
|
|
{
|
|
buffer->error = true;
|
|
ret = -1;
|
|
}
|
|
else
|
|
{
|
|
/* Second vsnprintf() call. */
|
|
room = buffer->allocated - buffer->length;
|
|
va_end (args);
|
|
va_start (args, formatstring);
|
|
ret = vsnprintf (buffer->data + buffer->length, room,
|
|
formatstring, args);
|
|
if (ret < 0)
|
|
{
|
|
/* Failed. */
|
|
buffer->error = true;
|
|
ret = -1;
|
|
}
|
|
else
|
|
{
|
|
if ((size_t) ret <= room)
|
|
{
|
|
/* The result has fit into room bytes. */
|
|
buffer->length += (size_t) ret;
|
|
ret = 0;
|
|
}
|
|
else
|
|
/* The return values of the vsnprintf() calls are not
|
|
consistent. */
|
|
abort ();
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
va_end (args);
|
|
return ret;
|
|
}
|
|
|
|
void
|
|
sb_free (struct string_buffer *buffer)
|
|
{
|
|
if (buffer->data != buffer->space)
|
|
free (buffer->data);
|
|
}
|
|
|
|
/* Returns the contents of BUFFER, and frees all other memory held
|
|
by BUFFER. Returns NULL upon failure or if there was an error earlier. */
|
|
char *
|
|
sb_dupfree (struct string_buffer *buffer)
|
|
{
|
|
if (buffer->error)
|
|
goto fail;
|
|
|
|
if (sb_ensure_more_bytes (buffer, 1) < 0)
|
|
goto fail;
|
|
buffer->data[buffer->length] = '\0';
|
|
buffer->length++;
|
|
|
|
if (buffer->data == buffer->space)
|
|
{
|
|
char *copy = (char *) malloc (buffer->length);
|
|
if (copy == NULL)
|
|
goto fail;
|
|
memcpy (copy, buffer->data, buffer->length);
|
|
return copy;
|
|
}
|
|
else
|
|
{
|
|
/* Shrink the string before returning it. */
|
|
char *contents = buffer->data;
|
|
if (buffer->length < buffer->allocated)
|
|
{
|
|
contents = realloc (contents, buffer->length);
|
|
if (contents == NULL)
|
|
goto fail;
|
|
}
|
|
return contents;
|
|
}
|
|
|
|
fail:
|
|
sb_free (buffer);
|
|
return NULL;
|
|
}
|