2017-07-03 17:44:58 +00:00
|
|
|
/*
|
2018-05-18 03:41:20 +00:00
|
|
|
* Copyright (c) 2018 Calvin Rose
|
2017-07-03 17:44:58 +00:00
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to
|
|
|
|
* deal in the Software without restriction, including without limitation the
|
|
|
|
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
|
|
|
* sell copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
|
|
|
* IN THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
2017-11-06 03:05:47 +00:00
|
|
|
#include <dst/dst.h>
|
2017-12-21 04:03:34 +00:00
|
|
|
#include "gc.h"
|
2018-01-06 16:09:15 +00:00
|
|
|
#include "util.h"
|
2018-06-12 18:24:45 +00:00
|
|
|
#include "state.h"
|
2017-11-01 21:53:43 +00:00
|
|
|
|
|
|
|
/* Begin building a string */
|
2017-11-28 23:27:55 +00:00
|
|
|
uint8_t *dst_string_begin(int32_t length) {
|
2018-01-06 16:09:15 +00:00
|
|
|
char *data = dst_gcalloc(DST_MEMORY_STRING, 2 * sizeof(int32_t) + length + 1);
|
2017-11-28 23:27:55 +00:00
|
|
|
uint8_t *str = (uint8_t *) (data + 2 * sizeof(int32_t));
|
2017-11-01 21:53:43 +00:00
|
|
|
dst_string_length(str) = length;
|
2018-01-06 16:09:15 +00:00
|
|
|
str[length] = 0;
|
2017-11-01 21:53:43 +00:00
|
|
|
return str;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Finish building a string */
|
2017-11-06 03:05:47 +00:00
|
|
|
const uint8_t *dst_string_end(uint8_t *str) {
|
|
|
|
dst_string_hash(str) = dst_string_calchash(str, dst_string_length(str));
|
2017-11-27 19:03:34 +00:00
|
|
|
return str;
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Load a buffer as a string */
|
2017-11-28 23:27:55 +00:00
|
|
|
const uint8_t *dst_string(const uint8_t *buf, int32_t len) {
|
|
|
|
int32_t hash = dst_string_calchash(buf, len);
|
2018-01-06 16:09:15 +00:00
|
|
|
char *data = dst_gcalloc(DST_MEMORY_STRING, 2 * sizeof(int32_t) + len + 1);
|
2017-11-28 23:27:55 +00:00
|
|
|
uint8_t *str = (uint8_t *) (data + 2 * sizeof(int32_t));
|
2017-11-27 19:03:34 +00:00
|
|
|
memcpy(str, buf, len);
|
2018-01-06 16:09:15 +00:00
|
|
|
str[len] = 0;
|
2017-11-27 19:03:34 +00:00
|
|
|
dst_string_length(str) = len;
|
|
|
|
dst_string_hash(str) = hash;
|
|
|
|
return str;
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
|
|
|
|
2017-11-27 19:03:34 +00:00
|
|
|
/* Compare two strings */
|
|
|
|
int dst_string_compare(const uint8_t *lhs, const uint8_t *rhs) {
|
2017-11-28 23:27:55 +00:00
|
|
|
int32_t xlen = dst_string_length(lhs);
|
|
|
|
int32_t ylen = dst_string_length(rhs);
|
|
|
|
int32_t len = xlen > ylen ? ylen : xlen;
|
|
|
|
int32_t i;
|
2017-11-27 19:03:34 +00:00
|
|
|
for (i = 0; i < len; ++i) {
|
|
|
|
if (lhs[i] == rhs[i]) {
|
|
|
|
continue;
|
|
|
|
} else if (lhs[i] < rhs[i]) {
|
|
|
|
return -1; /* x is less than y */
|
|
|
|
} else {
|
|
|
|
return 1; /* y is less than x */
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
|
|
|
}
|
2017-11-27 19:03:34 +00:00
|
|
|
if (xlen == ylen) {
|
|
|
|
return 0;
|
|
|
|
} else {
|
|
|
|
return xlen < ylen ? -1 : 1;
|
|
|
|
}
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
|
|
|
|
2017-11-27 19:03:34 +00:00
|
|
|
/* Compare a dst string with a piece of memory */
|
2017-11-28 23:27:55 +00:00
|
|
|
int dst_string_equalconst(const uint8_t *lhs, const uint8_t *rhs, int32_t rlen, int32_t rhash) {
|
|
|
|
int32_t index;
|
|
|
|
int32_t lhash = dst_string_hash(lhs);
|
|
|
|
int32_t llen = dst_string_length(lhs);
|
2017-11-27 19:03:34 +00:00
|
|
|
if (lhs == rhs)
|
|
|
|
return 1;
|
|
|
|
if (lhash != rhash || llen != rlen)
|
|
|
|
return 0;
|
|
|
|
for (index = 0; index < llen; index++) {
|
|
|
|
if (lhs[index] != rhs[index])
|
|
|
|
return 0;
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
2017-11-27 19:03:34 +00:00
|
|
|
return 1;
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
|
|
|
|
2017-11-27 19:03:34 +00:00
|
|
|
/* Check if two strings are equal */
|
|
|
|
int dst_string_equal(const uint8_t *lhs, const uint8_t *rhs) {
|
|
|
|
return dst_string_equalconst(lhs, rhs,
|
|
|
|
dst_string_length(rhs), dst_string_hash(rhs));
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Load a c string */
|
2017-11-06 03:05:47 +00:00
|
|
|
const uint8_t *dst_cstring(const char *str) {
|
2017-11-28 23:27:55 +00:00
|
|
|
int32_t len = 0;
|
2017-11-01 21:53:43 +00:00
|
|
|
while (str[len]) ++len;
|
2017-11-06 03:05:47 +00:00
|
|
|
return dst_string((const uint8_t *)str, len);
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
2017-07-03 17:44:58 +00:00
|
|
|
|
|
|
|
/* Temporary buffer size */
|
2018-05-08 23:40:28 +00:00
|
|
|
#define BUFSIZE 64
|
2017-07-03 17:44:58 +00:00
|
|
|
|
2017-11-28 23:27:55 +00:00
|
|
|
static int32_t real_to_string_impl(uint8_t *buf, double x) {
|
2018-01-31 22:47:59 +00:00
|
|
|
/* Use 16 decimal places to ignore one ulp errors for now */
|
2018-03-22 00:53:39 +00:00
|
|
|
int count = snprintf((char *) buf, BUFSIZE, "%.16gR", x);
|
2017-11-28 23:27:55 +00:00
|
|
|
return (int32_t) count;
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
|
|
|
|
2017-11-06 03:05:47 +00:00
|
|
|
static void real_to_string_b(DstBuffer *buffer, double x) {
|
2018-03-22 00:53:39 +00:00
|
|
|
dst_buffer_ensure(buffer, buffer->count + BUFSIZE);
|
2017-11-01 21:53:43 +00:00
|
|
|
buffer->count += real_to_string_impl(buffer->data + buffer->count, x);
|
2017-07-03 17:44:58 +00:00
|
|
|
}
|
|
|
|
|
2017-11-06 03:05:47 +00:00
|
|
|
static const uint8_t *real_to_string(double x) {
|
2018-03-22 00:53:39 +00:00
|
|
|
uint8_t buf[BUFSIZE];
|
2017-11-06 03:05:47 +00:00
|
|
|
return dst_string(buf, real_to_string_impl(buf, x));
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
|
|
|
|
2018-01-12 21:25:24 +00:00
|
|
|
static int32_t integer_to_string_impl(uint8_t *buf, int32_t x) {
|
2018-01-25 23:48:12 +00:00
|
|
|
int neg = 1;
|
2017-07-03 17:44:58 +00:00
|
|
|
uint8_t *hi, *low;
|
2017-11-28 23:27:55 +00:00
|
|
|
int32_t count = 0;
|
2017-11-01 21:53:43 +00:00
|
|
|
if (x == 0) {
|
|
|
|
buf[0] = '0';
|
|
|
|
return 1;
|
|
|
|
}
|
2018-01-25 23:48:12 +00:00
|
|
|
if (x > 0) {
|
|
|
|
neg = 0;
|
2017-07-03 17:44:58 +00:00
|
|
|
x = -x;
|
|
|
|
}
|
2018-01-25 23:48:12 +00:00
|
|
|
while (x < 0) {
|
|
|
|
uint8_t digit = (uint8_t) -(x % 10);
|
2017-07-03 17:44:58 +00:00
|
|
|
buf[count++] = '0' + digit;
|
|
|
|
x /= 10;
|
|
|
|
}
|
|
|
|
if (neg)
|
|
|
|
buf[count++] = '-';
|
|
|
|
/* Reverse */
|
|
|
|
hi = buf + count - 1;
|
|
|
|
low = buf;
|
|
|
|
while (hi > low) {
|
|
|
|
uint8_t temp = *low;
|
|
|
|
*low++ = *hi;
|
|
|
|
*hi-- = temp;
|
|
|
|
}
|
2017-11-01 21:53:43 +00:00
|
|
|
return count;
|
2017-07-03 17:44:58 +00:00
|
|
|
}
|
|
|
|
|
2018-01-12 21:25:24 +00:00
|
|
|
static void integer_to_string_b(DstBuffer *buffer, int32_t x) {
|
2018-03-22 00:53:39 +00:00
|
|
|
dst_buffer_extra(buffer, BUFSIZE);
|
2017-11-01 21:53:43 +00:00
|
|
|
buffer->count += integer_to_string_impl(buffer->data + buffer->count, x);
|
|
|
|
}
|
2017-07-03 17:44:58 +00:00
|
|
|
|
2018-01-12 21:25:24 +00:00
|
|
|
static const uint8_t *integer_to_string(int32_t x) {
|
2018-03-22 00:53:39 +00:00
|
|
|
uint8_t buf[BUFSIZE];
|
2017-11-06 03:05:47 +00:00
|
|
|
return dst_string(buf, integer_to_string_impl(buf, x));
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
|
|
|
|
2017-11-27 19:03:34 +00:00
|
|
|
#define HEX(i) (((uint8_t *) dst_base64)[(i)])
|
2017-11-01 21:53:43 +00:00
|
|
|
|
|
|
|
/* Returns a string description for a pointer. Truncates
|
|
|
|
* title to 12 characters */
|
2017-11-28 23:27:55 +00:00
|
|
|
static int32_t string_description_impl(uint8_t *buf, const char *title, void *pointer) {
|
2017-07-03 17:44:58 +00:00
|
|
|
uint8_t *c = buf;
|
2017-11-28 23:27:55 +00:00
|
|
|
int32_t i;
|
2017-07-03 17:44:58 +00:00
|
|
|
union {
|
|
|
|
uint8_t bytes[sizeof(void *)];
|
|
|
|
void *p;
|
|
|
|
} pbuf;
|
|
|
|
|
|
|
|
pbuf.p = pointer;
|
|
|
|
*c++ = '<';
|
2018-05-08 23:40:28 +00:00
|
|
|
/* Maximum of 32 bytes for abstract type name */
|
|
|
|
for (i = 0; title[i] && i < 32; ++i)
|
2017-07-03 17:44:58 +00:00
|
|
|
*c++ = ((uint8_t *)title) [i];
|
|
|
|
*c++ = ' ';
|
|
|
|
*c++ = '0';
|
|
|
|
*c++ = 'x';
|
2018-03-22 21:38:37 +00:00
|
|
|
#if defined(DST_64)
|
|
|
|
#define POINTSIZE 6
|
|
|
|
#else
|
|
|
|
#define POINTSIZE (sizeof(void *))
|
|
|
|
#endif
|
|
|
|
for (i = POINTSIZE; i > 0; --i) {
|
2017-07-03 17:44:58 +00:00
|
|
|
uint8_t byte = pbuf.bytes[i - 1];
|
|
|
|
*c++ = HEX(byte >> 4);
|
|
|
|
*c++ = HEX(byte & 0xF);
|
|
|
|
}
|
|
|
|
*c++ = '>';
|
2017-11-28 23:27:55 +00:00
|
|
|
return (int32_t) (c - buf);
|
2018-03-22 21:38:37 +00:00
|
|
|
#undef POINTSIZE
|
2017-07-03 17:44:58 +00:00
|
|
|
}
|
|
|
|
|
2017-11-06 03:05:47 +00:00
|
|
|
static void string_description_b(DstBuffer *buffer, const char *title, void *pointer) {
|
2018-03-22 00:53:39 +00:00
|
|
|
dst_buffer_ensure(buffer, buffer->count + BUFSIZE);
|
2017-11-01 21:53:43 +00:00
|
|
|
buffer->count += string_description_impl(buffer->data + buffer->count, title, pointer);
|
|
|
|
}
|
2017-07-03 17:44:58 +00:00
|
|
|
|
2018-05-20 01:16:00 +00:00
|
|
|
/* Describes a pointer with a title (string_description("bork", myp) returns
|
2017-11-06 03:05:47 +00:00
|
|
|
* a string "<bork 0x12345678>") */
|
|
|
|
static const uint8_t *string_description(const char *title, void *pointer) {
|
2018-03-22 00:53:39 +00:00
|
|
|
uint8_t buf[BUFSIZE];
|
2017-11-06 03:05:47 +00:00
|
|
|
return dst_string(buf, string_description_impl(buf, title, pointer));
|
2017-07-03 17:44:58 +00:00
|
|
|
}
|
|
|
|
|
2017-11-01 21:53:43 +00:00
|
|
|
#undef HEX
|
2018-03-22 00:53:39 +00:00
|
|
|
#undef BUFSIZE
|
2017-07-03 17:44:58 +00:00
|
|
|
|
2018-05-20 01:16:00 +00:00
|
|
|
/* TODO - add more characters to escape.
|
2018-01-17 16:36:10 +00:00
|
|
|
*
|
|
|
|
* When more escapes are added, they must correspond
|
|
|
|
* to dst_escape_string_impl exactly or a buffer overrun could occur. */
|
|
|
|
static int32_t dst_escape_string_length(const uint8_t *str, int32_t slen) {
|
2017-11-28 23:27:55 +00:00
|
|
|
int32_t len = 2;
|
|
|
|
int32_t i;
|
2018-01-17 16:36:10 +00:00
|
|
|
for (i = 0; i < slen; ++i) {
|
2017-11-01 21:53:43 +00:00
|
|
|
switch (str[i]) {
|
|
|
|
case '"':
|
|
|
|
case '\n':
|
|
|
|
case '\r':
|
|
|
|
case '\0':
|
2018-01-18 22:25:45 +00:00
|
|
|
case '\\':
|
2017-11-01 21:53:43 +00:00
|
|
|
len += 2;
|
|
|
|
break;
|
|
|
|
default:
|
2018-06-12 18:24:45 +00:00
|
|
|
if (str[i] < 32 || str[i] > 127)
|
|
|
|
len += 4;
|
|
|
|
else
|
|
|
|
len += 1;
|
2017-11-01 21:53:43 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
2018-01-17 16:36:10 +00:00
|
|
|
static void dst_escape_string_impl(uint8_t *buf, const uint8_t *str, int32_t len) {
|
2017-11-28 23:27:55 +00:00
|
|
|
int32_t i, j;
|
2017-11-01 21:53:43 +00:00
|
|
|
buf[0] = '"';
|
2018-01-17 16:36:10 +00:00
|
|
|
for (i = 0, j = 1; i < len; ++i) {
|
2017-07-03 17:44:58 +00:00
|
|
|
uint8_t c = str[i];
|
|
|
|
switch (c) {
|
|
|
|
case '"':
|
2017-11-01 21:53:43 +00:00
|
|
|
buf[j++] = '\\';
|
|
|
|
buf[j++] = '"';
|
2017-07-03 17:44:58 +00:00
|
|
|
break;
|
|
|
|
case '\n':
|
2017-11-01 21:53:43 +00:00
|
|
|
buf[j++] = '\\';
|
|
|
|
buf[j++] = 'n';
|
2017-07-03 17:44:58 +00:00
|
|
|
break;
|
|
|
|
case '\r':
|
2017-11-01 21:53:43 +00:00
|
|
|
buf[j++] = '\\';
|
|
|
|
buf[j++] = 'r';
|
2017-07-03 17:44:58 +00:00
|
|
|
break;
|
|
|
|
case '\0':
|
2017-11-01 21:53:43 +00:00
|
|
|
buf[j++] = '\\';
|
|
|
|
buf[j++] = '0';
|
2017-07-03 17:44:58 +00:00
|
|
|
break;
|
2018-01-18 22:25:45 +00:00
|
|
|
case '\\':
|
|
|
|
buf[j++] = '\\';
|
|
|
|
buf[j++] = '\\';
|
|
|
|
break;
|
2017-07-03 17:44:58 +00:00
|
|
|
default:
|
2018-06-12 18:24:45 +00:00
|
|
|
if (c < 32 || c > 127) {
|
|
|
|
buf[j++] = '\\';
|
|
|
|
buf[j++] = 'h';
|
|
|
|
buf[j++] = dst_base64[(c >> 4) & 0xF];
|
|
|
|
buf[j++] = dst_base64[c & 0xF];
|
|
|
|
} else {
|
|
|
|
buf[j++] = c;
|
|
|
|
}
|
2017-07-03 17:44:58 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2017-11-01 21:53:43 +00:00
|
|
|
buf[j++] = '"';
|
|
|
|
}
|
|
|
|
|
2017-11-06 03:05:47 +00:00
|
|
|
void dst_escape_string_b(DstBuffer *buffer, const uint8_t *str) {
|
2018-01-17 16:36:10 +00:00
|
|
|
int32_t len = dst_string_length(str);
|
|
|
|
int32_t elen = dst_escape_string_length(str, len);
|
|
|
|
dst_buffer_extra(buffer, elen);
|
|
|
|
dst_escape_string_impl(buffer->data + buffer->count, str, len);
|
|
|
|
buffer->count += elen;
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
|
|
|
|
2017-11-06 03:05:47 +00:00
|
|
|
const uint8_t *dst_escape_string(const uint8_t *str) {
|
2018-01-17 16:36:10 +00:00
|
|
|
int32_t len = dst_string_length(str);
|
|
|
|
int32_t elen = dst_escape_string_length(str, len);
|
|
|
|
uint8_t *buf = dst_string_begin(elen);
|
2018-05-20 01:16:00 +00:00
|
|
|
dst_escape_string_impl(buf, str, len);
|
2017-11-06 03:05:47 +00:00
|
|
|
return dst_string_end(buf);
|
2017-07-03 17:44:58 +00:00
|
|
|
}
|
|
|
|
|
2018-03-14 17:37:08 +00:00
|
|
|
static void dst_escape_buffer_b(DstBuffer *buffer, DstBuffer *bx) {
|
2018-01-17 16:36:10 +00:00
|
|
|
int32_t elen = dst_escape_string_length(bx->data, bx->count);
|
|
|
|
dst_buffer_push_u8(buffer, '@');
|
|
|
|
dst_buffer_extra(buffer, elen);
|
|
|
|
dst_escape_string_impl(
|
|
|
|
buffer->data + buffer->count,
|
|
|
|
bx->data,
|
|
|
|
bx->count);
|
|
|
|
buffer->count += elen;
|
|
|
|
}
|
|
|
|
|
2018-03-14 17:37:08 +00:00
|
|
|
void dst_description_b(DstBuffer *buffer, Dst x) {
|
2017-11-28 23:27:55 +00:00
|
|
|
switch (dst_type(x)) {
|
2017-11-01 21:53:43 +00:00
|
|
|
case DST_NIL:
|
2017-11-06 03:05:47 +00:00
|
|
|
dst_buffer_push_cstring(buffer, "nil");
|
2017-11-01 21:53:43 +00:00
|
|
|
return;
|
2017-11-28 23:27:55 +00:00
|
|
|
case DST_TRUE:
|
|
|
|
dst_buffer_push_cstring(buffer, "true");
|
|
|
|
return;
|
|
|
|
case DST_FALSE:
|
|
|
|
dst_buffer_push_cstring(buffer, "false");
|
2017-11-01 21:53:43 +00:00
|
|
|
return;
|
|
|
|
case DST_REAL:
|
2017-11-28 23:27:55 +00:00
|
|
|
real_to_string_b(buffer, dst_unwrap_real(x));
|
2017-11-01 21:53:43 +00:00
|
|
|
return;
|
|
|
|
case DST_INTEGER:
|
2017-11-28 23:27:55 +00:00
|
|
|
integer_to_string_b(buffer, dst_unwrap_integer(x));
|
2017-11-01 21:53:43 +00:00
|
|
|
return;
|
|
|
|
case DST_SYMBOL:
|
2018-05-20 01:16:00 +00:00
|
|
|
dst_buffer_push_bytes(buffer,
|
|
|
|
dst_unwrap_string(x),
|
2018-01-04 02:36:10 +00:00
|
|
|
dst_string_length(dst_unwrap_string(x)));
|
2017-11-01 21:53:43 +00:00
|
|
|
return;
|
|
|
|
case DST_STRING:
|
2017-11-28 23:27:55 +00:00
|
|
|
dst_escape_string_b(buffer, dst_unwrap_string(x));
|
2017-11-01 21:53:43 +00:00
|
|
|
return;
|
2018-01-17 16:36:10 +00:00
|
|
|
case DST_BUFFER:
|
|
|
|
dst_escape_buffer_b(buffer, dst_unwrap_buffer(x));
|
|
|
|
return;
|
2018-01-04 02:36:10 +00:00
|
|
|
case DST_ABSTRACT:
|
2018-02-04 05:54:38 +00:00
|
|
|
{
|
|
|
|
const char *n = dst_abstract_type(dst_unwrap_abstract(x))->name;
|
2018-05-20 01:16:00 +00:00
|
|
|
return string_description_b(buffer,
|
2018-02-04 05:54:38 +00:00
|
|
|
n[0] == ':' ? n + 1 : n,
|
|
|
|
dst_unwrap_abstract(x));
|
|
|
|
}
|
2018-06-12 18:24:45 +00:00
|
|
|
case DST_CFUNCTION:
|
|
|
|
{
|
|
|
|
Dst check = dst_table_get(dst_vm_registry, x);
|
|
|
|
if (dst_checktype(x, DST_SYMBOL)) {
|
|
|
|
dst_buffer_push_cstring(buffer, "<cfunction ");
|
|
|
|
dst_buffer_push_bytes(buffer,
|
|
|
|
dst_unwrap_symbol(check),
|
|
|
|
dst_string_length(dst_unwrap_symbol(check)));
|
|
|
|
dst_buffer_push_u8(buffer, '>');
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
goto fallthrough;
|
|
|
|
}
|
|
|
|
fallthrough:
|
2017-11-01 21:53:43 +00:00
|
|
|
default:
|
2018-02-03 18:55:55 +00:00
|
|
|
string_description_b(buffer, dst_type_names[dst_type(x)] + 1, dst_unwrap_pointer(x));
|
2017-11-01 21:53:43 +00:00
|
|
|
break;
|
|
|
|
}
|
2017-09-09 18:39:51 +00:00
|
|
|
}
|
|
|
|
|
2018-04-01 22:24:04 +00:00
|
|
|
void dst_to_string_b(DstBuffer *buffer, Dst x) {
|
|
|
|
switch (dst_type(x)) {
|
|
|
|
default:
|
|
|
|
dst_description_b(buffer, x);
|
|
|
|
break;
|
|
|
|
case DST_BUFFER:
|
2018-05-20 01:16:00 +00:00
|
|
|
dst_buffer_push_bytes(buffer,
|
2018-04-01 22:24:04 +00:00
|
|
|
dst_unwrap_buffer(x)->data,
|
|
|
|
dst_unwrap_buffer(x)->count);
|
|
|
|
break;
|
|
|
|
case DST_STRING:
|
|
|
|
case DST_SYMBOL:
|
2018-05-20 01:16:00 +00:00
|
|
|
dst_buffer_push_bytes(buffer,
|
2018-04-01 22:24:04 +00:00
|
|
|
dst_unwrap_string(x),
|
|
|
|
dst_string_length(dst_unwrap_string(x)));
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-03-14 17:37:08 +00:00
|
|
|
const uint8_t *dst_description(Dst x) {
|
|
|
|
switch (dst_type(x)) {
|
|
|
|
case DST_NIL:
|
|
|
|
return dst_cstring("nil");
|
|
|
|
case DST_TRUE:
|
|
|
|
return dst_cstring("true");
|
|
|
|
case DST_FALSE:
|
|
|
|
return dst_cstring("false");
|
|
|
|
case DST_REAL:
|
|
|
|
return real_to_string(dst_unwrap_real(x));
|
|
|
|
case DST_INTEGER:
|
|
|
|
return integer_to_string(dst_unwrap_integer(x));
|
|
|
|
case DST_SYMBOL:
|
|
|
|
return dst_unwrap_symbol(x);
|
|
|
|
case DST_STRING:
|
|
|
|
return dst_escape_string(dst_unwrap_string(x));
|
|
|
|
case DST_BUFFER:
|
|
|
|
{
|
|
|
|
DstBuffer b;
|
|
|
|
const uint8_t *ret;
|
|
|
|
dst_buffer_init(&b, 3);
|
|
|
|
dst_escape_buffer_b(&b, dst_unwrap_buffer(x));
|
|
|
|
ret = dst_string(b.data, b.count);
|
|
|
|
dst_buffer_deinit(&b);
|
|
|
|
return ret;
|
2017-11-21 02:39:44 +00:00
|
|
|
}
|
2018-03-14 17:37:08 +00:00
|
|
|
case DST_ABSTRACT:
|
|
|
|
{
|
|
|
|
const char *n = dst_abstract_type(dst_unwrap_abstract(x))->name;
|
2018-05-20 01:16:00 +00:00
|
|
|
return string_description(
|
2018-03-14 17:37:08 +00:00
|
|
|
n[0] == ':' ? n + 1 : n,
|
|
|
|
dst_unwrap_abstract(x));
|
2017-11-21 02:39:44 +00:00
|
|
|
}
|
2018-06-12 18:24:45 +00:00
|
|
|
case DST_CFUNCTION:
|
|
|
|
{
|
|
|
|
Dst check = dst_table_get(dst_vm_registry, x);
|
2018-06-26 17:57:49 +00:00
|
|
|
if (dst_checktype(check, DST_SYMBOL)) {
|
2018-06-12 18:24:45 +00:00
|
|
|
return dst_formatc("<cfunction %V>", check);
|
|
|
|
}
|
|
|
|
goto fallthrough;
|
|
|
|
}
|
|
|
|
fallthrough:
|
2018-03-14 17:37:08 +00:00
|
|
|
default:
|
|
|
|
return string_description(dst_type_names[dst_type(x)] + 1, dst_unwrap_pointer(x));
|
2017-11-21 02:39:44 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-11-06 03:05:47 +00:00
|
|
|
/* Convert any value to a dst string. Similar to description, but
|
|
|
|
* strings, symbols, and buffers will return their content. */
|
2018-01-06 16:09:15 +00:00
|
|
|
const uint8_t *dst_to_string(Dst x) {
|
2017-11-28 23:27:55 +00:00
|
|
|
switch (dst_type(x)) {
|
2017-11-01 21:53:43 +00:00
|
|
|
default:
|
2018-03-14 17:37:08 +00:00
|
|
|
return dst_description(x);
|
2018-01-17 16:36:10 +00:00
|
|
|
case DST_BUFFER:
|
|
|
|
return dst_string(dst_unwrap_buffer(x)->data, dst_unwrap_buffer(x)->count);
|
2017-11-01 21:53:43 +00:00
|
|
|
case DST_STRING:
|
|
|
|
case DST_SYMBOL:
|
2017-11-28 23:27:55 +00:00
|
|
|
return dst_unwrap_string(x);
|
2017-11-21 02:39:44 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Helper function for formatting strings. Useful for generating error messages and the like.
|
|
|
|
* Similiar to printf, but specialized for operating with dst. */
|
|
|
|
const uint8_t *dst_formatc(const char *format, ...) {
|
|
|
|
va_list args;
|
2017-11-28 23:27:55 +00:00
|
|
|
int32_t len = 0;
|
|
|
|
int32_t i;
|
2017-11-21 02:39:44 +00:00
|
|
|
const uint8_t *ret;
|
2017-12-08 20:57:02 +00:00
|
|
|
DstBuffer buffer;
|
|
|
|
DstBuffer *bufp = &buffer;
|
2018-05-20 01:16:00 +00:00
|
|
|
|
2017-11-21 02:39:44 +00:00
|
|
|
/* Calculate length */
|
|
|
|
while (format[len]) len++;
|
|
|
|
|
|
|
|
/* Initialize buffer */
|
|
|
|
dst_buffer_init(bufp, len);
|
|
|
|
|
|
|
|
/* Start args */
|
|
|
|
va_start(args, format);
|
|
|
|
|
|
|
|
/* Iterate length */
|
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
uint8_t c = format[i];
|
|
|
|
switch (c) {
|
|
|
|
default:
|
|
|
|
dst_buffer_push_u8(bufp, c);
|
|
|
|
break;
|
|
|
|
case '%':
|
|
|
|
{
|
|
|
|
if (i + 1 >= len)
|
|
|
|
break;
|
|
|
|
switch (format[++i]) {
|
2018-05-20 01:16:00 +00:00
|
|
|
default:
|
2017-11-21 02:39:44 +00:00
|
|
|
dst_buffer_push_u8(bufp, format[i]);
|
|
|
|
break;
|
2018-05-20 01:16:00 +00:00
|
|
|
case 'f':
|
2017-11-21 02:39:44 +00:00
|
|
|
real_to_string_b(bufp, va_arg(args, double));
|
|
|
|
break;
|
2018-05-20 01:16:00 +00:00
|
|
|
case 'd':
|
2018-01-12 21:25:24 +00:00
|
|
|
integer_to_string_b(bufp, va_arg(args, int32_t));
|
2017-11-21 02:39:44 +00:00
|
|
|
break;
|
|
|
|
case 'S':
|
|
|
|
{
|
|
|
|
const uint8_t *str = va_arg(args, const uint8_t *);
|
|
|
|
dst_buffer_push_bytes(bufp, str, dst_string_length(str));
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case 's':
|
|
|
|
dst_buffer_push_cstring(bufp, va_arg(args, const char *));
|
|
|
|
break;
|
|
|
|
case 'c':
|
2018-01-12 21:25:24 +00:00
|
|
|
dst_buffer_push_u8(bufp, va_arg(args, long));
|
2017-11-21 02:39:44 +00:00
|
|
|
break;
|
|
|
|
case 'q':
|
|
|
|
{
|
2017-12-15 00:33:45 +00:00
|
|
|
const uint8_t *str = va_arg(args, const uint8_t *);
|
2017-11-21 02:39:44 +00:00
|
|
|
dst_escape_string_b(bufp, str);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case 't':
|
|
|
|
{
|
2018-05-13 00:31:28 +00:00
|
|
|
dst_buffer_push_cstring(bufp, dst_type_names[va_arg(args, DstType)] + 1);
|
2017-11-21 02:39:44 +00:00
|
|
|
break;
|
|
|
|
}
|
2018-05-20 01:16:00 +00:00
|
|
|
case 'V':
|
2018-04-01 22:24:04 +00:00
|
|
|
{
|
|
|
|
dst_to_string_b(bufp, va_arg(args, Dst));
|
|
|
|
break;
|
|
|
|
}
|
2018-05-20 01:16:00 +00:00
|
|
|
case 'v':
|
2017-11-21 02:39:44 +00:00
|
|
|
{
|
2018-03-14 17:37:08 +00:00
|
|
|
dst_description_b(bufp, va_arg(args, Dst));
|
2017-11-21 02:39:44 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
va_end(args);
|
|
|
|
|
2017-12-08 20:57:02 +00:00
|
|
|
ret = dst_string(buffer.data, buffer.count);
|
|
|
|
dst_buffer_deinit(&buffer);
|
2017-11-21 02:39:44 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Print string to stdout */
|
|
|
|
void dst_puts(const uint8_t *str) {
|
2017-11-28 23:27:55 +00:00
|
|
|
int32_t i;
|
|
|
|
int32_t len = dst_string_length(str);
|
2017-11-21 02:39:44 +00:00
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
putc(str[i], stdout);
|
2017-07-03 17:44:58 +00:00
|
|
|
}
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
2018-05-18 03:41:20 +00:00
|
|
|
|
2018-05-18 18:19:57 +00:00
|
|
|
/* Knuth Morris Pratt Algorithm */
|
|
|
|
|
|
|
|
struct kmp_state {
|
|
|
|
int32_t i;
|
|
|
|
int32_t j;
|
|
|
|
int32_t textlen;
|
|
|
|
int32_t patlen;
|
|
|
|
int32_t *lookup;
|
|
|
|
const uint8_t *text;
|
|
|
|
const uint8_t *pat;
|
|
|
|
};
|
|
|
|
|
|
|
|
static void kmp_init(
|
|
|
|
struct kmp_state *s,
|
|
|
|
const uint8_t *text, int32_t textlen,
|
|
|
|
const uint8_t *pat, int32_t patlen) {
|
|
|
|
int32_t *lookup = calloc(patlen, sizeof(int32_t));
|
|
|
|
if (!lookup) {
|
|
|
|
DST_OUT_OF_MEMORY;
|
|
|
|
}
|
|
|
|
s->lookup = lookup;
|
|
|
|
s->i = 0;
|
|
|
|
s->j = 0;
|
|
|
|
s->text = text;
|
|
|
|
s->pat = pat;
|
|
|
|
s->textlen = textlen;
|
|
|
|
s->patlen = patlen;
|
|
|
|
/* Init state machine */
|
|
|
|
{
|
|
|
|
int32_t i, j;
|
|
|
|
for (i = 1, j = 0; i < patlen; i++) {
|
|
|
|
while (j && pat[j] != pat[i]) j = lookup[j - 1];
|
|
|
|
if (pat[j] == pat[i]) j++;
|
|
|
|
lookup[i] = j;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void kmp_deinit(struct kmp_state *state) {
|
|
|
|
free(state->lookup);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int32_t kmp_next(struct kmp_state *state) {
|
|
|
|
int32_t i = state->i;
|
|
|
|
int32_t j = state->j;
|
|
|
|
int32_t textlen = state->textlen;
|
|
|
|
int32_t patlen = state->patlen;
|
|
|
|
const uint8_t *text = state->text;
|
|
|
|
const uint8_t *pat = state->pat;
|
|
|
|
int32_t *lookup = state->lookup;
|
|
|
|
while (i < textlen) {
|
|
|
|
if (text[i] == pat[j]) {
|
|
|
|
if (j == patlen - 1) {
|
|
|
|
state->i = i + 1;
|
|
|
|
state->j = lookup[j];
|
|
|
|
return i - j;
|
|
|
|
} else {
|
|
|
|
i++;
|
|
|
|
j++;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (j > 0) {
|
|
|
|
j = lookup[j - 1];
|
|
|
|
} else {
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2018-05-18 03:41:20 +00:00
|
|
|
/* CFuns */
|
|
|
|
|
|
|
|
static int cfun_slice(DstArgs args) {
|
|
|
|
const uint8_t *data;
|
|
|
|
int32_t len, start, end;
|
|
|
|
const uint8_t *ret;
|
|
|
|
DST_MINARITY(args, 1);
|
|
|
|
DST_MAXARITY(args, 3);
|
|
|
|
DST_ARG_BYTES(data, len, args, 0);
|
|
|
|
/* Get start */
|
|
|
|
if (args.n < 2) {
|
|
|
|
start = 0;
|
|
|
|
} else if (dst_checktype(args.v[1], DST_INTEGER)) {
|
|
|
|
start = dst_unwrap_integer(args.v[1]);
|
|
|
|
} else {
|
|
|
|
DST_THROW(args, "expected integer");
|
|
|
|
}
|
|
|
|
/* Get end */
|
|
|
|
if (args.n < 3) {
|
|
|
|
end = -1;
|
|
|
|
} else if (dst_checktype(args.v[2], DST_INTEGER)) {
|
|
|
|
end = dst_unwrap_integer(args.v[2]);
|
|
|
|
} else {
|
|
|
|
DST_THROW(args, "expected integer");
|
|
|
|
}
|
|
|
|
if (start < 0) start = len + start;
|
|
|
|
if (end < 0) end = len + end + 1;
|
|
|
|
if (end >= start) {
|
|
|
|
ret = dst_string(data + start, end - start);
|
|
|
|
} else {
|
|
|
|
ret = dst_cstring("");
|
|
|
|
}
|
|
|
|
DST_RETURN_STRING(args, ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfun_repeat(DstArgs args) {
|
|
|
|
const uint8_t *data;
|
|
|
|
uint8_t *newbuf, *p, *end;
|
|
|
|
int32_t len, rep;
|
|
|
|
int64_t mulres;
|
|
|
|
DST_FIXARITY(args, 2);
|
|
|
|
DST_ARG_BYTES(data, len, args, 0);
|
|
|
|
DST_ARG_INTEGER(rep, args, 1);
|
|
|
|
if (rep < 0) {
|
|
|
|
DST_THROW(args, "expected non-negative number of repetitions");
|
|
|
|
} else if (rep == 0) {
|
|
|
|
DST_RETURN_CSTRING(args, "");
|
|
|
|
}
|
|
|
|
mulres = (int64_t) rep * len;
|
|
|
|
if (mulres > INT32_MAX) {
|
|
|
|
DST_THROW(args, "result string is too long");
|
|
|
|
}
|
|
|
|
newbuf = dst_string_begin((int32_t) mulres);
|
|
|
|
end = newbuf + mulres;
|
|
|
|
for (p = newbuf; p < end; p += len) {
|
|
|
|
memcpy(p, data, len);
|
|
|
|
}
|
|
|
|
DST_RETURN_STRING(args, dst_string_end(newbuf));
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfun_bytes(DstArgs args) {
|
|
|
|
const uint8_t *str;
|
|
|
|
int32_t strlen, i;
|
|
|
|
Dst *tup;
|
|
|
|
DST_FIXARITY(args, 1);
|
|
|
|
DST_ARG_BYTES(str, strlen, args, 0);
|
|
|
|
tup = dst_tuple_begin(strlen);
|
|
|
|
for (i = 0; i < strlen; i++) {
|
|
|
|
tup[i] = dst_wrap_integer((int32_t) str[i]);
|
|
|
|
}
|
|
|
|
DST_RETURN_TUPLE(args, dst_tuple_end(tup));
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfun_frombytes(DstArgs args) {
|
|
|
|
int32_t i;
|
|
|
|
uint8_t *buf;
|
|
|
|
for (i = 0; i < args.n; i++) {
|
|
|
|
DST_CHECK(args, i, DST_INTEGER);
|
|
|
|
}
|
|
|
|
buf = dst_string_begin(args.n);
|
|
|
|
for (i = 0; i < args.n; i++) {
|
|
|
|
int32_t c;
|
|
|
|
DST_ARG_INTEGER(c, args, i);
|
|
|
|
buf[i] = c & 0xFF;
|
|
|
|
}
|
|
|
|
DST_RETURN_STRING(args, dst_string_end(buf));
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfun_asciilower(DstArgs args) {
|
|
|
|
const uint8_t *str;
|
|
|
|
uint8_t *buf;
|
|
|
|
int32_t len, i;
|
|
|
|
DST_FIXARITY(args, 1);
|
|
|
|
DST_ARG_BYTES(str, len, args, 0);
|
|
|
|
buf = dst_string_begin(len);
|
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
uint8_t c = str[i];
|
|
|
|
if (c >= 65 && c <= 90) {
|
|
|
|
buf[i] = c + 32;
|
|
|
|
} else {
|
|
|
|
buf[i] = c;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
DST_RETURN_STRING(args, dst_string_end(buf));
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfun_asciiupper(DstArgs args) {
|
|
|
|
const uint8_t *str;
|
|
|
|
uint8_t *buf;
|
|
|
|
int32_t len, i;
|
|
|
|
DST_FIXARITY(args, 1);
|
|
|
|
DST_ARG_BYTES(str, len, args, 0);
|
|
|
|
buf = dst_string_begin(len);
|
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
uint8_t c = str[i];
|
|
|
|
if (c >= 97 && c <= 122) {
|
|
|
|
buf[i] = c - 32;
|
|
|
|
} else {
|
|
|
|
buf[i] = c;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
DST_RETURN_STRING(args, dst_string_end(buf));
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfun_reverse(DstArgs args) {
|
|
|
|
const uint8_t *str;
|
|
|
|
uint8_t *buf;
|
|
|
|
int32_t len, i, j;
|
|
|
|
DST_FIXARITY(args, 1);
|
|
|
|
DST_ARG_BYTES(str, len, args, 0);
|
|
|
|
buf = dst_string_begin(len);
|
|
|
|
for (i = 0, j = len - 1; i < len; i++, j--) {
|
|
|
|
buf[i] = str[j];
|
|
|
|
}
|
|
|
|
DST_RETURN_STRING(args, dst_string_end(buf));
|
|
|
|
}
|
|
|
|
|
2018-05-18 20:24:09 +00:00
|
|
|
static int findsetup(DstArgs args, struct kmp_state *s, int32_t extra) {
|
2018-05-18 18:19:57 +00:00
|
|
|
const uint8_t *text, *pat;
|
|
|
|
int32_t textlen, patlen, start;
|
|
|
|
DST_MINARITY(args, 2);
|
2018-05-18 20:24:09 +00:00
|
|
|
DST_MAXARITY(args, 3 + extra);
|
2018-05-18 18:19:57 +00:00
|
|
|
DST_ARG_BYTES(pat, patlen, args, 0);
|
|
|
|
DST_ARG_BYTES(text, textlen, args, 1);
|
2018-05-18 20:24:09 +00:00
|
|
|
if (args.n >= 3) {
|
2018-05-18 18:19:57 +00:00
|
|
|
DST_ARG_INTEGER(start, args, 2);
|
|
|
|
if (start < 0) {
|
|
|
|
DST_THROW(args, "expected non-negative start index");
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
start = 0;
|
|
|
|
}
|
|
|
|
kmp_init(s, text, textlen, pat, patlen);
|
|
|
|
s->i = start;
|
|
|
|
return DST_SIGNAL_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfun_find(DstArgs args) {
|
|
|
|
int32_t result;
|
|
|
|
struct kmp_state state;
|
2018-05-18 20:24:09 +00:00
|
|
|
int status = findsetup(args, &state, 0);
|
2018-05-18 18:19:57 +00:00
|
|
|
if (status) return status;
|
|
|
|
result = kmp_next(&state);
|
|
|
|
kmp_deinit(&state);
|
|
|
|
DST_RETURN(args, result < 0
|
|
|
|
? dst_wrap_nil()
|
|
|
|
: dst_wrap_integer(result));
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfun_findall(DstArgs args) {
|
|
|
|
int32_t result;
|
|
|
|
DstArray *array;
|
|
|
|
struct kmp_state state;
|
2018-05-18 20:24:09 +00:00
|
|
|
int status = findsetup(args, &state, 0);
|
2018-05-18 18:19:57 +00:00
|
|
|
if (status) return status;
|
|
|
|
array = dst_array(0);
|
|
|
|
while ((result = kmp_next(&state)) >= 0) {
|
|
|
|
dst_array_push(array, dst_wrap_integer(result));
|
|
|
|
}
|
|
|
|
kmp_deinit(&state);
|
|
|
|
DST_RETURN_ARRAY(args, array);
|
|
|
|
}
|
|
|
|
|
|
|
|
struct replace_state {
|
|
|
|
struct kmp_state kmp;
|
|
|
|
const uint8_t *subst;
|
|
|
|
int32_t substlen;
|
|
|
|
};
|
|
|
|
|
|
|
|
static int replacesetup(DstArgs args, struct replace_state *s) {
|
|
|
|
const uint8_t *text, *pat, *subst;
|
|
|
|
int32_t textlen, patlen, substlen, start;
|
|
|
|
DST_MINARITY(args, 3);
|
|
|
|
DST_MAXARITY(args, 4);
|
|
|
|
DST_ARG_BYTES(pat, patlen, args, 0);
|
|
|
|
DST_ARG_BYTES(subst, substlen, args, 1);
|
|
|
|
DST_ARG_BYTES(text, textlen, args, 2);
|
|
|
|
if (args.n == 4) {
|
|
|
|
DST_ARG_INTEGER(start, args, 3);
|
|
|
|
if (start < 0) {
|
|
|
|
DST_THROW(args, "expected non-negative start index");
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
start = 0;
|
|
|
|
}
|
|
|
|
kmp_init(&s->kmp, text, textlen, pat, patlen);
|
|
|
|
s->kmp.i = start;
|
|
|
|
s->subst = subst;
|
|
|
|
s->substlen = substlen;
|
|
|
|
return DST_SIGNAL_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfun_replace(DstArgs args) {
|
|
|
|
int32_t result;
|
|
|
|
struct replace_state s;
|
|
|
|
uint8_t *buf;
|
|
|
|
int status = replacesetup(args, &s);
|
|
|
|
if (status) return status;
|
|
|
|
result = kmp_next(&s.kmp);
|
|
|
|
if (result < 0) {
|
|
|
|
kmp_deinit(&s.kmp);
|
2018-05-18 20:24:09 +00:00
|
|
|
DST_RETURN_STRING(args, dst_string(s.kmp.text, s.kmp.textlen));
|
2018-05-18 18:19:57 +00:00
|
|
|
}
|
2018-05-18 20:24:09 +00:00
|
|
|
buf = dst_string_begin(s.kmp.textlen - s.kmp.patlen + s.substlen);
|
|
|
|
memcpy(buf, s.kmp.text, result);
|
2018-05-18 18:19:57 +00:00
|
|
|
memcpy(buf + result, s.subst, s.substlen);
|
|
|
|
memcpy(buf + result + s.substlen,
|
2018-05-18 20:24:09 +00:00
|
|
|
s.kmp.text + result + s.kmp.patlen,
|
|
|
|
s.kmp.textlen - result - s.kmp.patlen);
|
2018-05-18 18:19:57 +00:00
|
|
|
kmp_deinit(&s.kmp);
|
|
|
|
DST_RETURN_STRING(args, dst_string_end(buf));
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cfun_replaceall(DstArgs args) {
|
|
|
|
int32_t result;
|
|
|
|
struct replace_state s;
|
|
|
|
DstBuffer b;
|
|
|
|
const uint8_t *ret;
|
|
|
|
int32_t lastindex = 0;
|
|
|
|
int status = replacesetup(args, &s);
|
|
|
|
if (status) return status;
|
2018-05-18 20:24:09 +00:00
|
|
|
dst_buffer_init(&b, s.kmp.textlen);
|
2018-05-18 18:19:57 +00:00
|
|
|
while ((result = kmp_next(&s.kmp)) >= 0) {
|
2018-05-18 20:24:09 +00:00
|
|
|
dst_buffer_push_bytes(&b, s.kmp.text + lastindex, result - lastindex);
|
2018-05-18 18:19:57 +00:00
|
|
|
dst_buffer_push_bytes(&b, s.subst, s.substlen);
|
2018-05-18 20:24:09 +00:00
|
|
|
lastindex = result + s.kmp.patlen;
|
2018-05-18 18:19:57 +00:00
|
|
|
}
|
2018-05-18 20:24:09 +00:00
|
|
|
dst_buffer_push_bytes(&b, s.kmp.text + lastindex, s.kmp.textlen - lastindex);
|
2018-05-18 18:19:57 +00:00
|
|
|
ret = dst_string(b.data, b.count);
|
|
|
|
dst_buffer_deinit(&b);
|
|
|
|
kmp_deinit(&s.kmp);
|
|
|
|
DST_RETURN_STRING(args, ret);
|
|
|
|
}
|
|
|
|
|
2018-05-18 20:24:09 +00:00
|
|
|
static int cfun_split(DstArgs args) {
|
|
|
|
int32_t result;
|
|
|
|
DstArray *array;
|
|
|
|
struct kmp_state state;
|
|
|
|
int32_t limit = -1, lastindex = 0;
|
|
|
|
if (args.n == 4) {
|
|
|
|
DST_ARG_INTEGER(limit, args, 3);
|
|
|
|
}
|
|
|
|
int status = findsetup(args, &state, 1);
|
|
|
|
if (status) return status;
|
|
|
|
array = dst_array(0);
|
|
|
|
while ((result = kmp_next(&state)) >= 0 && limit--) {
|
|
|
|
const uint8_t *slice = dst_string(state.text + lastindex, result - lastindex);
|
|
|
|
dst_array_push(array, dst_wrap_string(slice));
|
|
|
|
lastindex = result + state.patlen;
|
|
|
|
}
|
|
|
|
{
|
|
|
|
const uint8_t *slice = dst_string(state.text + lastindex, state.textlen - lastindex);
|
|
|
|
dst_array_push(array, dst_wrap_string(slice));
|
|
|
|
}
|
|
|
|
kmp_deinit(&state);
|
|
|
|
DST_RETURN_ARRAY(args, array);
|
|
|
|
}
|
|
|
|
|
2018-05-20 01:16:00 +00:00
|
|
|
static int cfun_checkset(DstArgs args) {
|
|
|
|
const uint8_t *set, *str;
|
|
|
|
int32_t setlen, strlen, i;
|
|
|
|
uint32_t bitset[8] = {0, 0, 0, 0, 0, 0, 0, 0};
|
|
|
|
DST_MINARITY(args, 2);
|
|
|
|
DST_MAXARITY(args, 3);
|
|
|
|
DST_ARG_BYTES(set, setlen, args, 0);
|
|
|
|
DST_ARG_BYTES(str, strlen, args, 1);
|
|
|
|
/* Populate set */
|
|
|
|
for (i = 0; i < setlen; i++) {
|
|
|
|
int index = set[i] >> 5;
|
|
|
|
uint32_t mask = 1 << (set[i] & 7);
|
|
|
|
bitset[index] |= mask;
|
|
|
|
}
|
|
|
|
if (args.n == 3) {
|
|
|
|
int invert;
|
|
|
|
DST_ARG_BOOLEAN(invert, args, 2);
|
|
|
|
if (invert) {
|
|
|
|
for (i = 0; i < 8; i++)
|
|
|
|
bitset[i] = ~bitset[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* Check set */
|
|
|
|
for (i = 0; i < strlen; i++) {
|
|
|
|
int index = str[i] >> 5;
|
|
|
|
uint32_t mask = 1 << (str[i] & 7);
|
|
|
|
if (!(bitset[index] & mask)) {
|
|
|
|
DST_RETURN_FALSE(args);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
DST_RETURN_TRUE(args);
|
|
|
|
}
|
|
|
|
|
2018-05-24 02:08:36 +00:00
|
|
|
static int cfun_join(DstArgs args) {
|
|
|
|
const Dst *parts;
|
|
|
|
const uint8_t *joiner;
|
|
|
|
uint8_t *buf, *out;
|
|
|
|
int32_t joinerlen, partslen, finallen, i;
|
|
|
|
DST_MINARITY(args, 1);
|
|
|
|
DST_MAXARITY(args, 2);
|
|
|
|
DST_ARG_INDEXED(parts, partslen, args, 0);
|
|
|
|
if (args.n == 2) {
|
|
|
|
DST_ARG_BYTES(joiner, joinerlen, args, 1);
|
|
|
|
} else {
|
|
|
|
joiner = NULL;
|
|
|
|
joinerlen = 0;
|
|
|
|
}
|
|
|
|
/* Check args */
|
|
|
|
finallen = 0;
|
|
|
|
for (i = 0; i < partslen; i++) {
|
|
|
|
const uint8_t *chunk;
|
|
|
|
int32_t chunklen = 0;
|
2018-07-04 17:15:52 +00:00
|
|
|
if (!dst_bytes_view(parts[i], &chunk, &chunklen)) {
|
2018-05-24 02:08:36 +00:00
|
|
|
DST_THROW(args, "expected string|symbol|buffer");
|
|
|
|
}
|
|
|
|
if (i) finallen += joinerlen;
|
|
|
|
finallen += chunklen;
|
|
|
|
}
|
|
|
|
out = buf = dst_string_begin(finallen);
|
|
|
|
for (i = 0; i < partslen; i++) {
|
|
|
|
const uint8_t *chunk = NULL;
|
|
|
|
int32_t chunklen = 0;
|
|
|
|
if (i) {
|
|
|
|
memcpy(out, joiner, joinerlen);
|
|
|
|
out += joinerlen;
|
|
|
|
}
|
2018-07-04 17:15:52 +00:00
|
|
|
dst_bytes_view(parts[i], &chunk, &chunklen);
|
2018-05-24 02:08:36 +00:00
|
|
|
memcpy(out, chunk, chunklen);
|
|
|
|
out += chunklen;
|
|
|
|
}
|
|
|
|
DST_RETURN_STRING(args, dst_string_end(buf));
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2018-05-18 03:41:20 +00:00
|
|
|
static const DstReg cfuns[] = {
|
|
|
|
{"string.slice", cfun_slice},
|
|
|
|
{"string.repeat", cfun_repeat},
|
|
|
|
{"string.bytes", cfun_bytes},
|
|
|
|
{"string.from-bytes", cfun_frombytes},
|
|
|
|
{"string.ascii-lower", cfun_asciilower},
|
|
|
|
{"string.ascii-upper", cfun_asciiupper},
|
|
|
|
{"string.reverse", cfun_reverse},
|
2018-05-18 18:19:57 +00:00
|
|
|
{"string.find", cfun_find},
|
|
|
|
{"string.find-all", cfun_findall},
|
|
|
|
{"string.replace", cfun_replace},
|
|
|
|
{"string.replace-all", cfun_replaceall},
|
2018-05-18 20:24:09 +00:00
|
|
|
{"string.split", cfun_split},
|
2018-05-20 01:16:00 +00:00
|
|
|
{"string.check-set", cfun_checkset},
|
2018-05-24 02:08:36 +00:00
|
|
|
{"string.join", cfun_join},
|
2018-05-18 03:41:20 +00:00
|
|
|
{NULL, NULL}
|
|
|
|
};
|
|
|
|
|
|
|
|
/* Module entry point */
|
|
|
|
int dst_lib_string(DstArgs args) {
|
|
|
|
DstTable *env = dst_env_arg(args);
|
|
|
|
dst_env_cfuns(env, cfuns);
|
|
|
|
return 0;
|
|
|
|
}
|