mirror of
https://github.com/janet-lang/janet
synced 2024-11-14 12:44:49 +00:00
344 lines
11 KiB
C
344 lines
11 KiB
C
|
#include <stdlib.h>
|
||
|
|
#include <stdio.h>
|
||
|
|
#include <string.h>
|
||
|
|
#include "gc.h"
|
||
|
|
#include "vstring.h"
|
||
|
|
#include "value.h"
|
||
|
|
#include "buffer.h"
|
||
|
|
|
||
|
|
/* Print a value recursively. Used for debugging */
|
||
|
|
void ValuePrint(Value * x, uint32_t indent) {
|
||
|
|
uint32_t i;
|
||
|
|
for (i = 0; i < indent; ++i)
|
||
|
|
fputc(' ', stdout);
|
||
|
|
switch (x->type) {
|
||
|
|
case TYPE_NIL:
|
||
|
|
printf("<nil>");
|
||
|
|
break;
|
||
|
|
case TYPE_BOOLEAN:
|
||
|
|
printf(x->data.boolean ? "<true>" : "<false>");
|
||
|
|
break;
|
||
|
|
case TYPE_NUMBER:
|
||
|
|
printf("%f", x->data.number);
|
||
|
|
break;
|
||
|
|
case TYPE_FORM:
|
||
|
|
case TYPE_ARRAY:
|
||
|
|
if (x->type == TYPE_ARRAY) printf(" [\n"); else printf(" (\n");
|
||
|
|
for (i = 0; i < x->data.array->count; ++i) {
|
||
|
|
ValuePrint(x->data.array->data + i, indent + 4);
|
||
|
|
printf("\n");
|
||
|
|
}
|
||
|
|
for (i = 0; i < indent; ++i) fputc(' ', stdout);
|
||
|
|
if (x->type == TYPE_ARRAY) printf(" ]\n"); else printf(" )\n");
|
||
|
|
break;
|
||
|
|
case TYPE_STRING:
|
||
|
|
printf("\"%.*s\"", VStringSize(x->data.string), (char *) x->data.string);
|
||
|
|
break;
|
||
|
|
case TYPE_SYMBOL:
|
||
|
|
printf("%.*s", VStringSize(x->data.string), (char *) x->data.string);
|
||
|
|
break;
|
||
|
|
case TYPE_CFUNCTION:
|
||
|
|
printf("<cfunction>");
|
||
|
|
break;
|
||
|
|
case TYPE_FUNCTION:
|
||
|
|
printf("<function>");
|
||
|
|
break;
|
||
|
|
case TYPE_DICTIONARY:
|
||
|
|
printf("<dictionary>");
|
||
|
|
break;
|
||
|
|
case TYPE_BYTEBUFFER:
|
||
|
|
printf("<bytebuffer>");
|
||
|
|
break;
|
||
|
|
case TYPE_FUNCDEF:
|
||
|
|
printf("<funcdef>");
|
||
|
|
break;
|
||
|
|
case TYPE_FUNCENV:
|
||
|
|
printf("<funcenv>");
|
||
|
|
break;
|
||
|
|
case TYPE_THREAD:
|
||
|
|
printf("<thread>");
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
static uint8_t * LoadCString(GC * gc, const char * string, uint32_t len) {
|
||
|
|
uint8_t * data = GCAlloc(gc, len + 2 * sizeof(uint32_t));
|
||
|
|
data += 2 * sizeof(uint32_t);
|
||
|
|
VStringHash(data) = 0;
|
||
|
|
VStringSize(data) = len;
|
||
|
|
memcpy(data, string, len);
|
||
|
|
return data;
|
||
|
|
}
|
||
|
|
|
||
|
|
Value ValueLoadCString(GC * gc, const char * string) {
|
||
|
|
Value ret;
|
||
|
|
ret.type = TYPE_STRING;
|
||
|
|
ret.data.string = LoadCString(gc, string, strlen(string));
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
|
||
|
|
static uint8_t * NumberToString(GC * gc, Number x) {
|
||
|
|
static const uint32_t SIZE = 20;
|
||
|
|
uint8_t * data = GCAlloc(gc, SIZE + 2 * sizeof(uint32_t));
|
||
|
|
data += 2 * sizeof(uint32_t);
|
||
|
|
snprintf((char *) data, SIZE, "%.17g", x);
|
||
|
|
VStringHash(data) = 0;
|
||
|
|
VStringSize(data) = strlen((char *) data);
|
||
|
|
return data;
|
||
|
|
}
|
||
|
|
|
||
|
|
static const char * HEX_CHARACTERS = "0123456789ABCDEF";
|
||
|
|
#define HEX(i) (((uint8_t *) HEX_CHARACTERS)[(i)])
|
||
|
|
|
||
|
|
/* Returns a string description for a pointer */
|
||
|
|
static uint8_t * StringDescription(GC * gc, const char * title, uint32_t titlelen, void * pointer) {
|
||
|
|
uint32_t len = 3 + titlelen + sizeof(pointer) * 2;
|
||
|
|
uint32_t i;
|
||
|
|
uint8_t * data = GCAlloc(gc, len + 2 * sizeof(uint32_t));
|
||
|
|
uint8_t * c;
|
||
|
|
union {
|
||
|
|
uint8_t bytes[sizeof(void *)];
|
||
|
|
void * p;
|
||
|
|
} buf;
|
||
|
|
buf.p = pointer;
|
||
|
|
data += 2 * sizeof(uint32_t);
|
||
|
|
c = data;
|
||
|
|
*c++ = '<';
|
||
|
|
for (i = 0; i < titlelen; ++i) {
|
||
|
|
*c++ = ((uint8_t *)title) [i];
|
||
|
|
}
|
||
|
|
*c++ = ' ';
|
||
|
|
for (i = 0; i < sizeof(void *); ++i) {
|
||
|
|
uint8_t byte = buf.bytes[i];
|
||
|
|
*c++ = HEX(byte >> 4);
|
||
|
|
*c++ = HEX(byte & 0xF);
|
||
|
|
}
|
||
|
|
*c++ = '>';
|
||
|
|
return data;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Returns a string pointer or NULL if could not allocate memory. */
|
||
|
|
uint8_t * ValueToString(GC * gc, Value * x) {
|
||
|
|
switch (x->type) {
|
||
|
|
case TYPE_NIL:
|
||
|
|
return LoadCString(gc, "nil", 3);
|
||
|
|
case TYPE_BOOLEAN:
|
||
|
|
if (x->data.boolean) {
|
||
|
|
return LoadCString(gc, "true", 4);
|
||
|
|
} else {
|
||
|
|
return LoadCString(gc, "false", 5);
|
||
|
|
}
|
||
|
|
case TYPE_NUMBER:
|
||
|
|
return NumberToString(gc, x->data.number);
|
||
|
|
case TYPE_ARRAY:
|
||
|
|
return StringDescription(gc, "array", 5, x->data.array);
|
||
|
|
case TYPE_FORM:
|
||
|
|
return StringDescription(gc, "form", 4, x->data.array);
|
||
|
|
case TYPE_STRING:
|
||
|
|
case TYPE_SYMBOL:
|
||
|
|
return x->data.string;
|
||
|
|
case TYPE_BYTEBUFFER:
|
||
|
|
return StringDescription(gc, "buffer", 6, x->data.buffer);
|
||
|
|
case TYPE_CFUNCTION:
|
||
|
|
return StringDescription(gc, "cfunction", 9, x->data.cfunction);
|
||
|
|
case TYPE_FUNCTION:
|
||
|
|
return StringDescription(gc, "function", 8, x->data.func);
|
||
|
|
case TYPE_DICTIONARY:
|
||
|
|
return StringDescription(gc, "dictionary", 10, x->data.dict);
|
||
|
|
case TYPE_FUNCDEF:
|
||
|
|
return StringDescription(gc, "funcdef", 7, x->data.funcdef);
|
||
|
|
case TYPE_FUNCENV:
|
||
|
|
return StringDescription(gc, "funcenv", 7, x->data.funcenv);
|
||
|
|
case TYPE_THREAD:
|
||
|
|
return StringDescription(gc, "thread", 6, x->data.array);
|
||
|
|
}
|
||
|
|
return NULL;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Simple hash function */
|
||
|
|
uint32_t djb2(const uint8_t * str) {
|
||
|
|
const uint8_t * end = str + VStringSize(str);
|
||
|
|
uint32_t hash = 5381;
|
||
|
|
while (str < end)
|
||
|
|
hash = (hash << 5) + hash + *str++;
|
||
|
|
return hash;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Check if two values are equal. This is strict equality with no conversion. */
|
||
|
|
int ValueEqual(Value * x, Value * y) {
|
||
|
|
int result;
|
||
|
|
if (x->type != y->type) {
|
||
|
|
result = 0;
|
||
|
|
} else {
|
||
|
|
switch (x->type) {
|
||
|
|
case TYPE_NIL:
|
||
|
|
result = 1;
|
||
|
|
break;
|
||
|
|
case TYPE_BOOLEAN:
|
||
|
|
result = x->data.boolean == y->data.boolean;
|
||
|
|
break;
|
||
|
|
case TYPE_NUMBER:
|
||
|
|
result = x->data.number == y->data.number;
|
||
|
|
break;
|
||
|
|
/* Assume that when strings are created, equal strings
|
||
|
|
* are set to the same string */
|
||
|
|
case TYPE_STRING:
|
||
|
|
case TYPE_SYMBOL:
|
||
|
|
if (x->data.string == y->data.string) {
|
||
|
|
result = 1;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
if (ValueHash(x) != ValueHash(y) ||
|
||
|
|
VStringSize(x->data.string) != VStringSize(y->data.string)) {
|
||
|
|
result = 0;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
/* If two different strings are equal, merge them to share the same data */
|
||
|
|
if (!strncmp((char *) x->data.string, (char *) y->data.string, VStringSize(x->data.string))) {
|
||
|
|
/* Use the lower pointer in memory. This means that in long running
|
||
|
|
* programs, repeated string compares will eventually all use identical
|
||
|
|
* pointers for identical strings. */
|
||
|
|
if (x->data.string < y->data.string) {
|
||
|
|
y->data.string = x->data.string;
|
||
|
|
} else {
|
||
|
|
x->data.string = y->data.string;
|
||
|
|
}
|
||
|
|
result = 1;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
result = 0;
|
||
|
|
break;
|
||
|
|
case TYPE_ARRAY:
|
||
|
|
case TYPE_FORM:
|
||
|
|
case TYPE_BYTEBUFFER:
|
||
|
|
case TYPE_CFUNCTION:
|
||
|
|
case TYPE_DICTIONARY:
|
||
|
|
case TYPE_FUNCTION:
|
||
|
|
case TYPE_FUNCDEF:
|
||
|
|
case TYPE_FUNCENV:
|
||
|
|
case TYPE_THREAD:
|
||
|
|
/* compare pointers */
|
||
|
|
result = x->data.array == y->data.array;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Computes a hash value for a function */
|
||
|
|
uint32_t ValueHash(Value * x) {
|
||
|
|
uint32_t hash;
|
||
|
|
switch (x->type) {
|
||
|
|
case TYPE_NIL:
|
||
|
|
hash = 0;
|
||
|
|
break;
|
||
|
|
case TYPE_BOOLEAN:
|
||
|
|
hash = x->data.boolean;
|
||
|
|
break;
|
||
|
|
case TYPE_NUMBER:
|
||
|
|
{
|
||
|
|
union {
|
||
|
|
uint32_t hash;
|
||
|
|
Number number;
|
||
|
|
} u;
|
||
|
|
u.number = x->data.number;
|
||
|
|
hash = u.hash;
|
||
|
|
}
|
||
|
|
break;
|
||
|
|
/* String hashes */
|
||
|
|
case TYPE_SYMBOL:
|
||
|
|
case TYPE_STRING:
|
||
|
|
/* Assume 0 is not hashed. */
|
||
|
|
if (VStringHash(x->data.string))
|
||
|
|
hash = VStringHash(x->data.string);
|
||
|
|
else
|
||
|
|
hash = VStringHash(x->data.string) = djb2(x->data.string);
|
||
|
|
break;
|
||
|
|
case TYPE_ARRAY:
|
||
|
|
case TYPE_FORM:
|
||
|
|
case TYPE_BYTEBUFFER:
|
||
|
|
case TYPE_CFUNCTION:
|
||
|
|
case TYPE_DICTIONARY:
|
||
|
|
case TYPE_FUNCTION:
|
||
|
|
case TYPE_FUNCDEF:
|
||
|
|
case TYPE_FUNCENV:
|
||
|
|
case TYPE_THREAD:
|
||
|
|
/* Cast the pointer */
|
||
|
|
hash = (uint32_t) x->data.string;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
return hash;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Compares x to y. If they are equal retuns 0. If x is less, returns -1.
|
||
|
|
* If y is less, returns 1. All types are comparable
|
||
|
|
* and should have strict ordering. */
|
||
|
|
int ValueCompare(Value * x, Value * y) {
|
||
|
|
if (x->type == y->type) {
|
||
|
|
switch (x->type) {
|
||
|
|
case TYPE_NIL:
|
||
|
|
return 0;
|
||
|
|
case TYPE_BOOLEAN:
|
||
|
|
if (x->data.boolean == y->data.boolean) {
|
||
|
|
return 0;
|
||
|
|
} else {
|
||
|
|
return x->data.boolean ? 1 : -1;
|
||
|
|
}
|
||
|
|
case TYPE_NUMBER:
|
||
|
|
/* TODO: define behavior for NaN and infinties. */
|
||
|
|
if (x->data.number == y->data.number) {
|
||
|
|
return 0;
|
||
|
|
} else {
|
||
|
|
return x->data.number > y->data.number ? 1 : -1;
|
||
|
|
}
|
||
|
|
case TYPE_STRING:
|
||
|
|
case TYPE_SYMBOL:
|
||
|
|
if (x->data.string == y->data.string) {
|
||
|
|
return 0;
|
||
|
|
} else {
|
||
|
|
uint32_t xlen = VStringSize(x->data.string);
|
||
|
|
uint32_t ylen = VStringSize(y->data.string);
|
||
|
|
uint32_t len = xlen > ylen ? ylen : xlen;
|
||
|
|
uint32_t i;
|
||
|
|
for (i = 0; i < len; ++i) {
|
||
|
|
if (x->data.string[i] == y->data.string[i]) {
|
||
|
|
continue;
|
||
|
|
} else if (x->data.string[i] < y->data.string[i]) {
|
||
|
|
return 1; /* x is less then y */
|
||
|
|
} else {
|
||
|
|
return -1; /* y is less than x */
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (xlen == ylen) {
|
||
|
|
/* Merge the two strings */
|
||
|
|
if (x->data.string < y->data.string) {
|
||
|
|
y->data.string = x->data.string;
|
||
|
|
} else {
|
||
|
|
x->data.string = y->data.string;
|
||
|
|
}
|
||
|
|
return 0;
|
||
|
|
} else {
|
||
|
|
return xlen < ylen ? -1 : 1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
case TYPE_ARRAY:
|
||
|
|
case TYPE_FORM:
|
||
|
|
case TYPE_BYTEBUFFER:
|
||
|
|
case TYPE_CFUNCTION:
|
||
|
|
case TYPE_FUNCTION:
|
||
|
|
case TYPE_DICTIONARY:
|
||
|
|
case TYPE_FUNCDEF:
|
||
|
|
case TYPE_FUNCENV:
|
||
|
|
case TYPE_THREAD:
|
||
|
|
if (x->data.string == y->data.string) {
|
||
|
|
return 0;
|
||
|
|
} else {
|
||
|
|
return x->data.string > y->data.string ? 1 : -1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else if (x->type < y->type) {
|
||
|
|
return -1;
|
||
|
|
}
|
||
|
|
return 1;
|
||
|
|
}
|