2004-02-09 23:22:54 +00:00
|
|
|
/*-
|
2007-01-09 08:05:56 +00:00
|
|
|
* Copyright (c) 2003-2007 Tim Kientzle
|
2004-02-09 23:22:54 +00:00
|
|
|
* 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
|
2007-01-09 08:05:56 +00:00
|
|
|
* notice, this list of conditions and the following disclaimer.
|
2004-02-09 23:22:54 +00:00
|
|
|
* 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(S) ``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(S) 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.
|
|
|
|
*/
|
|
|
|
|
2004-03-09 19:50:41 +00:00
|
|
|
#include "archive_platform.h"
|
2004-02-09 23:22:54 +00:00
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Basic resizable string support, to simplify manipulating arbitrary-sized
|
|
|
|
* strings while minimizing heap activity.
|
|
|
|
*/
|
|
|
|
|
2006-11-10 06:39:46 +00:00
|
|
|
#ifdef HAVE_STDLIB_H
|
2004-02-09 23:22:54 +00:00
|
|
|
#include <stdlib.h>
|
2006-11-10 06:39:46 +00:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_STRING_H
|
2004-02-09 23:22:54 +00:00
|
|
|
#include <string.h>
|
2006-11-10 06:39:46 +00:00
|
|
|
#endif
|
2004-02-09 23:22:54 +00:00
|
|
|
|
2004-08-14 03:45:45 +00:00
|
|
|
#include "archive_private.h"
|
2004-02-09 23:22:54 +00:00
|
|
|
#include "archive_string.h"
|
|
|
|
|
|
|
|
struct archive_string *
|
|
|
|
__archive_string_append(struct archive_string *as, const char *p, size_t s)
|
|
|
|
{
|
|
|
|
__archive_string_ensure(as, as->length + s + 1);
|
|
|
|
memcpy(as->s + as->length, p, s);
|
|
|
|
as->s[as->length + s] = 0;
|
|
|
|
as->length += s;
|
|
|
|
return (as);
|
|
|
|
}
|
|
|
|
|
2007-05-29 01:00:21 +00:00
|
|
|
void
|
|
|
|
__archive_string_copy(struct archive_string *dest, struct archive_string *src)
|
|
|
|
{
|
|
|
|
__archive_string_ensure(dest, src->length + 1);
|
|
|
|
memcpy(dest->s, src->s, src->length);
|
|
|
|
dest->length = src->length;
|
|
|
|
dest->s[dest->length] = 0;
|
|
|
|
}
|
|
|
|
|
2004-02-09 23:22:54 +00:00
|
|
|
void
|
|
|
|
__archive_string_free(struct archive_string *as)
|
|
|
|
{
|
|
|
|
as->length = 0;
|
|
|
|
as->buffer_length = 0;
|
|
|
|
if (as->s != NULL)
|
|
|
|
free(as->s);
|
|
|
|
}
|
|
|
|
|
|
|
|
struct archive_string *
|
|
|
|
__archive_string_ensure(struct archive_string *as, size_t s)
|
|
|
|
{
|
|
|
|
if (as->s && (s <= as->buffer_length))
|
|
|
|
return (as);
|
|
|
|
|
|
|
|
if (as->buffer_length < 32)
|
|
|
|
as->buffer_length = 32;
|
|
|
|
while (as->buffer_length < s)
|
|
|
|
as->buffer_length *= 2;
|
2006-11-10 06:39:46 +00:00
|
|
|
as->s = (char *)realloc(as->s, as->buffer_length);
|
2004-08-14 03:45:45 +00:00
|
|
|
/* TODO: Return null instead and fix up all of our callers to
|
|
|
|
* handle this correctly. */
|
2004-02-09 23:22:54 +00:00
|
|
|
if (as->s == NULL)
|
2004-08-14 03:45:45 +00:00
|
|
|
__archive_errx(1, "Out of memory");
|
2004-02-09 23:22:54 +00:00
|
|
|
return (as);
|
|
|
|
}
|
|
|
|
|
|
|
|
struct archive_string *
|
|
|
|
__archive_strncat(struct archive_string *as, const char *p, size_t n)
|
|
|
|
{
|
|
|
|
size_t s;
|
|
|
|
const char *pp;
|
|
|
|
|
|
|
|
/* Like strlen(p), except won't examine positions beyond p[n]. */
|
|
|
|
s = 0;
|
|
|
|
pp = p;
|
|
|
|
while (*pp && s < n) {
|
|
|
|
pp++;
|
|
|
|
s++;
|
|
|
|
}
|
|
|
|
return (__archive_string_append(as, p, s));
|
|
|
|
}
|
|
|
|
|
|
|
|
struct archive_string *
|
|
|
|
__archive_strappend_char(struct archive_string *as, char c)
|
|
|
|
{
|
|
|
|
return (__archive_string_append(as, &c, 1));
|
|
|
|
}
|
2004-12-22 06:12:40 +00:00
|
|
|
|
|
|
|
struct archive_string *
|
|
|
|
__archive_strappend_int(struct archive_string *as, int d, int base)
|
|
|
|
{
|
2007-01-13 03:30:14 +00:00
|
|
|
static const char *digits = "0123456789abcdef";
|
2004-12-22 06:12:40 +00:00
|
|
|
|
|
|
|
if (d < 0) {
|
|
|
|
__archive_strappend_char(as, '-');
|
|
|
|
d = -d;
|
|
|
|
}
|
|
|
|
if (d >= base)
|
|
|
|
__archive_strappend_int(as, d/base, base);
|
|
|
|
__archive_strappend_char(as, digits[d % base]);
|
|
|
|
return (as);
|
|
|
|
}
|