1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322
|
/* darkstat 3
* copyright (c) 2001-2007 Emil Mikulic.
*
* str.c: string buffer with pool-based reallocation
*
* Permission to use, copy, modify, and distribute this file for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#ifdef linux
# include <stdint.h> /* for uint32_t, et al */
#endif
#include "darkstat.h"
#include "conv.h"
#include "err.h"
#include "str.h"
#define INITIAL_LEN 1024
struct str {
char *buf;
size_t len, pool;
};
struct str *
str_make(void)
{
struct str *s = xmalloc(sizeof(*s));
s->len = 0;
s->pool = INITIAL_LEN;
s->buf = xmalloc(s->pool);
return (s);
}
void
str_free(struct str *s)
{
free(s->buf);
free(s);
}
/*
* Extract struct str into buffer and length, freeing the struct in the
* process.
*/
void
str_extract(struct str *s, size_t *len, char **str)
{
*len = s->len;
*str = s->buf;
free(s);
}
void
str_append2(struct str *buf, const char *s, const size_t len)
{
if (buf->pool < buf->len + len) {
/* pool has dried up */
while (buf->pool < buf->len + len)
buf->pool *= 2;
buf->buf = xrealloc(buf->buf, buf->pool);
}
memcpy(buf->buf + buf->len, s, len);
buf->len += len;
}
void
str_appendstr(struct str *buf, const struct str *s)
{
str_append2(buf, s->buf, s->len);
}
#ifndef str_append
void
str_append(struct str *buf, const char *s)
{
str_append2(buf, s, strlen(s));
}
#endif
/*
* Apparently, some wacky locales use periods, or another character that isn't
* a comma, to seperate thousands. If you are afflicted by such a locale,
* change this macro:
*/
#define COMMA ','
/* 2^32 = 4,294,967,296 (10 digits, 13 chars) */
#define I32_MAXLEN 13
/* 2^64 = 18,446,744,073,709,551,616 (20 digits, 26 chars) */
#define I64_MAXLEN 26
static void
str_append_u32(struct str *s, const uint32_t i, const int mod_sep)
{
char out[I32_MAXLEN];
int pos, len;
uint32_t rem, next;
if (i == 0) {
str_append(s, "0");
return;
}
pos = sizeof(out)-1;
len = 0;
rem = i;
while (rem > 0) {
assert(pos >= 0);
next = rem / 10;
rem = rem - next * 10;
assert(rem < 10);
out[pos] = '0' + rem;
pos--;
len++;
rem = next;
if (mod_sep && (rem > 0) && (len > 0) && (len % 3 == 0)) {
out[pos] = COMMA;
pos--;
}
}
str_append2(s, out+pos+1, sizeof(out)-1-pos);
}
static void
str_append_i32(struct str *s, int32_t i, const int mod_sep)
{
if (i < 0) {
str_append(s, "-");
i = -i;
}
str_append_u32(s, (uint32_t)i, mod_sep);
}
static void
str_append_u64(struct str *s, const uint64_t i, const int mod_sep)
{
char out[I64_MAXLEN];
int pos, len;
uint64_t rem, next;
uint32_t rem32, next32;
if (i == 0) {
str_append(s, "0");
return;
}
pos = sizeof(out)-1;
len = 0;
rem = i;
while (rem >= 4294967295U) {
assert(pos >= 0);
next = rem / 10;
rem = rem - next * 10;
assert(rem < 10);
out[pos] = '0' + rem;
pos--;
len++;
rem = next;
if (mod_sep && (rem > 0) && (len > 0) && (len % 3 == 0)) {
out[pos] = COMMA;
pos--;
}
}
/*
* Stick to 32-bit math when we can as it's faster on 32-bit platforms.
* FIXME: a tunable way to switch this off?
*/
rem32 = (uint32_t)rem;
while (rem32 > 0) {
assert(pos >= 0);
next32 = rem32 / 10;
rem32 = rem32 - next32 * 10;
assert(rem32 < 10);
out[pos] = '0' + rem32;
pos--;
len++;
rem32 = next32;
if (mod_sep && (rem32 > 0) && (len > 0) && (len % 3 == 0)) {
out[pos] = COMMA;
pos--;
}
}
str_append2(s, out+pos+1, sizeof(out)-1-pos);
}
static void
str_append_i64(struct str *s, int64_t i, const int mod_sep)
{
if (i < 0) {
str_append(s, "-");
i = -i;
}
str_append_u64(s, (uint64_t)i, mod_sep);
}
static void
str_append_hex8(struct str *s, const uint8_t b)
{
char out[2];
static const char hexset[] = "0123456789abcdef";
out[0] = hexset[ ((b >> 4) & 15) ];
out[1] = hexset[ (b & 15) ];
str_append2(s, out, 2);
}
/* accepted formats: %s %d %u %x
* accepted modifiers: q and '
*
* %x is equivalent to %02x and expects a uint8_t
*/
static void
str_vappendf(struct str *s, const char *format, va_list va)
{
size_t pos, len;
len = strlen(format);
for (pos=0; pos<len; pos++) {
size_t span_start = pos, span_len = 0;
while ((format[pos] != '\0') && (format[pos] != '%')) {
span_len++;
pos++;
}
if (span_len > 0)
str_append2(s, format+span_start, span_len);
if (format[pos] == '%') {
int mod_quad = 0, mod_sep = 0;
char *arg_str;
FORMAT:
pos++;
switch (format[pos]) {
case '%':
str_append(s, "%");
break;
case 'q':
mod_quad = 1;
goto FORMAT;
case '\'':
mod_sep = 1;
goto FORMAT;
case 's':
arg_str = va_arg(va, char*);
str_append(s, arg_str);
/* str_append can be a macro! passing it va_arg can result in
* va_arg being called twice
*/
break;
case 'd':
if (mod_quad)
str_append_i64(s, va_arg(va, int64_t), mod_sep);
else
str_append_i32(s, (int32_t)va_arg(va, int), mod_sep);
break;
case 'u':
if (mod_quad)
str_append_u64(s, va_arg(va, uint64_t), mod_sep);
else
str_append_u32(s, (uint32_t)va_arg(va, unsigned int), mod_sep);
break;
case 'x':
str_append_hex8(s, (uint8_t)va_arg(va, int));
break;
default:
errx(1, "format string is \"%s\", unknown format '%c' at %u",
format, format[pos], (unsigned int)pos);
}
}
}
}
void
str_appendf(struct str *s, const char *format, ...)
{
va_list va;
va_start(va, format);
str_vappendf(s, format, va);
va_end(va);
}
size_t
xvasprintf(char **result, const char *format, va_list va)
{
size_t len;
struct str *s = str_make();
str_vappendf(s, format, va);
str_append2(s, "", 1); /* "" still contains \0 */
str_extract(s, &len, result);
return (len-1);
}
size_t
xasprintf(char **result, const char *format, ...)
{
va_list va;
size_t ret;
va_start(va, format);
ret = xvasprintf(result, format, va);
va_end(va);
return (ret);
}
/* vim:set ts=3 sw=3 tw=78 expandtab: */
|