|
|
@@ -42,13 +42,7 @@
|
|
|
#define L_FREE luat_heap_free
|
|
|
#define L_REALLOC luat_heap_realloc
|
|
|
|
|
|
-static void die(const char *fmt, ...)
|
|
|
-{
|
|
|
- LLOGD("%s", fmt);
|
|
|
- exit(-1);
|
|
|
-}
|
|
|
-
|
|
|
-void strbuf_init(strbuf_t *s, int len)
|
|
|
+int strbuf_init(strbuf_t *s, int len)
|
|
|
{
|
|
|
int size;
|
|
|
|
|
|
@@ -62,25 +56,31 @@ void strbuf_init(strbuf_t *s, int len)
|
|
|
s->length = 0;
|
|
|
s->increment = STRBUF_DEFAULT_INCREMENT;
|
|
|
s->dynamic = 0;
|
|
|
- s->reallocs = 0;
|
|
|
- s->debug = 0;
|
|
|
+ // s->reallocs = 0;
|
|
|
+ // s->debug = 0;
|
|
|
|
|
|
s->buf = (char *)L_MALLOC(size);
|
|
|
if (!s->buf)
|
|
|
- die("Out of memory");
|
|
|
+ return -1;
|
|
|
|
|
|
strbuf_ensure_null(s);
|
|
|
+ return 0;
|
|
|
}
|
|
|
|
|
|
strbuf_t *strbuf_new(int len)
|
|
|
{
|
|
|
strbuf_t *s;
|
|
|
+ int ret = 0;
|
|
|
|
|
|
s = (strbuf_t *)L_MALLOC(sizeof(strbuf_t));
|
|
|
if (!s)
|
|
|
- die("Out of memory");
|
|
|
+ return NULL;
|
|
|
|
|
|
- strbuf_init(s, len);
|
|
|
+ ret = strbuf_init(s, len);
|
|
|
+ if (ret) {
|
|
|
+ L_FREE(s);
|
|
|
+ return NULL;
|
|
|
+ }
|
|
|
|
|
|
/* Dynamic strbuf allocation / deallocation */
|
|
|
s->dynamic = 1;
|
|
|
@@ -88,29 +88,11 @@ strbuf_t *strbuf_new(int len)
|
|
|
return s;
|
|
|
}
|
|
|
|
|
|
-void strbuf_set_increment(strbuf_t *s, int increment)
|
|
|
-{
|
|
|
- /* Increment > 0: Linear buffer growth rate
|
|
|
- * Increment < -1: Exponential buffer growth rate */
|
|
|
- if (increment == 0 || increment == -1)
|
|
|
- die("BUG: Invalid string increment");
|
|
|
-
|
|
|
- s->increment = increment;
|
|
|
-}
|
|
|
-
|
|
|
-static inline void debug_stats(strbuf_t *s)
|
|
|
-{
|
|
|
- if (s->debug) {
|
|
|
- fprintf(stderr, "strbuf(%lx) reallocs: %d, length: %d, size: %d\n",
|
|
|
- (long)s, s->reallocs, s->length, s->size);
|
|
|
- }
|
|
|
-}
|
|
|
-
|
|
|
/* If strbuf_t has not been dynamically allocated, strbuf_free() can
|
|
|
* be called any number of times strbuf_init() */
|
|
|
void strbuf_free(strbuf_t *s)
|
|
|
{
|
|
|
- debug_stats(s);
|
|
|
+ // debug_stats(s);
|
|
|
|
|
|
if (s->buf) {
|
|
|
L_FREE (s->buf);
|
|
|
@@ -120,30 +102,12 @@ void strbuf_free(strbuf_t *s)
|
|
|
L_FREE (s);
|
|
|
}
|
|
|
|
|
|
-char *strbuf_free_to_string(strbuf_t *s, int *len)
|
|
|
-{
|
|
|
- char *buf;
|
|
|
-
|
|
|
- debug_stats(s);
|
|
|
-
|
|
|
- strbuf_ensure_null(s);
|
|
|
-
|
|
|
- buf = s->buf;
|
|
|
- if (len)
|
|
|
- *len = s->length;
|
|
|
-
|
|
|
- if (s->dynamic)
|
|
|
- L_FREE (s);
|
|
|
-
|
|
|
- return buf;
|
|
|
-}
|
|
|
-
|
|
|
static int calculate_new_size(strbuf_t *s, int len)
|
|
|
{
|
|
|
int reqsize, newsize;
|
|
|
|
|
|
- if (len <= 0)
|
|
|
- die("BUG: Invalid strbuf length requested");
|
|
|
+ // if (len <= 0)
|
|
|
+ // die("BUG: Invalid strbuf length requested");
|
|
|
|
|
|
/* Ensure there is room for optional NULL termination */
|
|
|
reqsize = len + 1;
|
|
|
@@ -153,16 +117,11 @@ static int calculate_new_size(strbuf_t *s, int len)
|
|
|
return reqsize;
|
|
|
|
|
|
newsize = s->size;
|
|
|
- if (s->increment < 0) {
|
|
|
- /* Exponential sizing */
|
|
|
- while (newsize < reqsize)
|
|
|
- newsize *= -s->increment;
|
|
|
- } else {
|
|
|
- /* Linear sizing */
|
|
|
- newsize = ((newsize + s->increment - 1) / s->increment) * s->increment;
|
|
|
+ if (reqsize - s->size < 1023) {
|
|
|
+ reqsize = s->size + 1023;
|
|
|
}
|
|
|
|
|
|
- return newsize;
|
|
|
+ return reqsize + 1;
|
|
|
}
|
|
|
|
|
|
|
|
|
@@ -171,24 +130,28 @@ static int calculate_new_size(strbuf_t *s, int len)
|
|
|
void strbuf_resize(strbuf_t *s, int len)
|
|
|
{
|
|
|
int newsize;
|
|
|
+ void* ptr;
|
|
|
+
|
|
|
+ if (s->is_err)
|
|
|
+ return;
|
|
|
|
|
|
newsize = calculate_new_size(s, len);
|
|
|
|
|
|
- if (s->debug > 1) {
|
|
|
- fprintf(stderr, "strbuf(%lx) resize: %d => %d\n",
|
|
|
- (long)s, s->size, newsize);
|
|
|
+ ptr = (char *)L_REALLOC(s->buf, newsize);
|
|
|
+ if (ptr == NULL) {
|
|
|
+ s->is_err = 1;
|
|
|
+ }
|
|
|
+ else {
|
|
|
+ s->size = newsize;
|
|
|
+ s->buf = ptr;
|
|
|
}
|
|
|
-
|
|
|
- s->size = newsize;
|
|
|
- s->buf = (char *)L_REALLOC(s->buf, s->size);
|
|
|
- if (!s->buf)
|
|
|
- die("Out of memory");
|
|
|
- s->reallocs++;
|
|
|
}
|
|
|
|
|
|
void strbuf_append_string(strbuf_t *s, const char *str)
|
|
|
{
|
|
|
int space, i;
|
|
|
+ if (s->is_err)
|
|
|
+ return;
|
|
|
|
|
|
space = strbuf_empty_length(s);
|
|
|
|
|
|
@@ -203,56 +166,3 @@ void strbuf_append_string(strbuf_t *s, const char *str)
|
|
|
space--;
|
|
|
}
|
|
|
}
|
|
|
-
|
|
|
-/* strbuf_append_fmt() should only be used when an upper bound
|
|
|
- * is known for the output string. */
|
|
|
-void strbuf_append_fmt(strbuf_t *s, int len, const char *fmt, ...)
|
|
|
-{
|
|
|
- va_list arg;
|
|
|
- int fmt_len;
|
|
|
-
|
|
|
- strbuf_ensure_empty_length(s, len);
|
|
|
-
|
|
|
- va_start(arg, fmt);
|
|
|
- fmt_len = vsnprintf(s->buf + s->length, len, fmt, arg);
|
|
|
- va_end(arg);
|
|
|
-
|
|
|
- if (fmt_len < 0)
|
|
|
- die("BUG: Unable to convert number"); /* This should never happen.. */
|
|
|
-
|
|
|
- s->length += fmt_len;
|
|
|
-}
|
|
|
-
|
|
|
-/* strbuf_append_fmt_retry() can be used when the there is no known
|
|
|
- * upper bound for the output string. */
|
|
|
-void strbuf_append_fmt_retry(strbuf_t *s, const char *fmt, ...)
|
|
|
-{
|
|
|
- va_list arg;
|
|
|
- int fmt_len, try;
|
|
|
- int empty_len;
|
|
|
-
|
|
|
- /* If the first attempt to append fails, resize the buffer appropriately
|
|
|
- * and try again */
|
|
|
- for (try = 0; ; try++) {
|
|
|
- va_start(arg, fmt);
|
|
|
- /* Append the new formatted string */
|
|
|
- /* fmt_len is the length of the string required, excluding the
|
|
|
- * trailing NULL */
|
|
|
- empty_len = strbuf_empty_length(s);
|
|
|
- /* Add 1 since there is also space to store the terminating NULL. */
|
|
|
- fmt_len = vsnprintf(s->buf + s->length, empty_len + 1, fmt, arg);
|
|
|
- va_end(arg);
|
|
|
-
|
|
|
- if (fmt_len <= empty_len)
|
|
|
- break; /* SUCCESS */
|
|
|
- if (try > 0)
|
|
|
- die("BUG: length of formatted string changed");
|
|
|
-
|
|
|
- strbuf_resize(s, s->length + fmt_len);
|
|
|
- }
|
|
|
-
|
|
|
- s->length += fmt_len;
|
|
|
-}
|
|
|
-
|
|
|
-/* vi:ai et sw=4 ts=4:
|
|
|
- */
|