260 lines
7.2 KiB
C
260 lines
7.2 KiB
C
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include <stdarg.h>
|
|
#include <string.h>
|
|
#include <assert.h>
|
|
#include <sys/types.h>
|
|
#include "llt.h"
|
|
#include "flisp.h"
|
|
|
|
// comparable tag
|
|
#define cmptag(v) (isfixnum(v) ? TAG_NUM : tag(v))
|
|
|
|
static value_t eq_class(ptrhash_t *table, value_t key)
|
|
{
|
|
value_t c = (value_t)ptrhash_get(table, (void*)key);
|
|
if (c == (value_t)PH_NOTFOUND)
|
|
return NIL;
|
|
if (c == key)
|
|
return c;
|
|
return eq_class(table, c);
|
|
}
|
|
|
|
static void eq_union(ptrhash_t *table, value_t a, value_t b,
|
|
value_t c, value_t cb)
|
|
{
|
|
value_t ca = (c==NIL ? a : c);
|
|
if (cb != NIL)
|
|
ptrhash_put(table, (void*)cb, (void*)ca);
|
|
ptrhash_put(table, (void*)a, (void*)ca);
|
|
ptrhash_put(table, (void*)b, (void*)ca);
|
|
}
|
|
|
|
// ordered comparison
|
|
|
|
// a is a fixnum, b is a cvalue
|
|
static value_t compare_num_cvalue(value_t a, value_t b)
|
|
{
|
|
cvalue_t *bcv = (cvalue_t*)ptr(b);
|
|
numerictype_t bt;
|
|
if (valid_numtype(bt=cv_numtype(bcv))) {
|
|
fixnum_t ia = numval(a);
|
|
void *bptr = cv_data(bcv);
|
|
if (cmp_eq(&ia, T_FIXNUM, bptr, bt))
|
|
return fixnum(0);
|
|
if (cmp_lt(&ia, T_FIXNUM, bptr, bt))
|
|
return fixnum(-1);
|
|
}
|
|
else {
|
|
return fixnum(-1);
|
|
}
|
|
return fixnum(1);
|
|
}
|
|
|
|
static value_t bounded_compare(value_t a, value_t b, int bound);
|
|
static value_t cyc_compare(value_t a, value_t b, ptrhash_t *table);
|
|
|
|
static value_t bounded_vector_compare(value_t a, value_t b, int bound)
|
|
{
|
|
size_t la = vector_size(a);
|
|
size_t lb = vector_size(b);
|
|
size_t m, i;
|
|
m = la < lb ? la : lb;
|
|
for (i = 0; i < m; i++) {
|
|
value_t d = bounded_compare(vector_elt(a,i), vector_elt(b,i), bound-1);
|
|
if (d==NIL || numval(d)!=0) return d;
|
|
}
|
|
if (la < lb) return fixnum(-1);
|
|
if (la > lb) return fixnum(1);
|
|
return fixnum(0);
|
|
}
|
|
|
|
// strange comparisons are resolved arbitrarily but consistently.
|
|
// ordering: number < builtin < cvalue < vector < symbol < cons
|
|
static value_t bounded_compare(value_t a, value_t b, int bound)
|
|
{
|
|
value_t d;
|
|
|
|
compare_top:
|
|
if (a == b) return fixnum(0);
|
|
if (bound <= 0)
|
|
return NIL;
|
|
int taga = tag(a);
|
|
int tagb = cmptag(b);
|
|
switch (taga) {
|
|
case TAG_NUM :
|
|
case TAG_NUM1:
|
|
if (isfixnum(b)) {
|
|
return (numval(a) < numval(b)) ? fixnum(-1) : fixnum(1);
|
|
}
|
|
if (iscvalue(b)) {
|
|
return compare_num_cvalue(a, b);
|
|
}
|
|
return fixnum(-1);
|
|
case TAG_SYM:
|
|
if (tagb < TAG_SYM) return fixnum(1);
|
|
if (tagb > TAG_SYM) return fixnum(-1);
|
|
return fixnum(strcmp(symbol_name(a), symbol_name(b)));
|
|
case TAG_VECTOR:
|
|
if (isvector(b))
|
|
return bounded_vector_compare(a, b, bound);
|
|
break;
|
|
case TAG_CVALUE:
|
|
if (iscvalue(b)) {
|
|
cvalue_t *acv=(cvalue_t*)ptr(a), *bcv=(cvalue_t*)ptr(b);
|
|
numerictype_t at, bt;
|
|
if (valid_numtype(at=cv_numtype(acv)) &&
|
|
valid_numtype(bt=cv_numtype(bcv))) {
|
|
void *aptr = cv_data(acv);
|
|
void *bptr = cv_data(bcv);
|
|
if (cmp_eq(aptr, at, bptr, bt))
|
|
return fixnum(0);
|
|
if (cmp_lt(aptr, at, bptr, bt))
|
|
return fixnum(-1);
|
|
return fixnum(1);
|
|
}
|
|
return cvalue_compare(a, b);
|
|
}
|
|
else if (isfixnum(b)) {
|
|
return fixnum(-numval(compare_num_cvalue(b, a)));
|
|
}
|
|
break;
|
|
case TAG_BUILTIN:
|
|
if (tagb == TAG_BUILTIN) {
|
|
return (uintval(a) < uintval(b)) ? fixnum(-1) : fixnum(1);
|
|
}
|
|
break;
|
|
case TAG_CONS:
|
|
if (tagb < TAG_CONS) return fixnum(1);
|
|
d = bounded_compare(car_(a), car_(b), bound-1);
|
|
if (d==NIL || numval(d) != 0) return d;
|
|
a = cdr_(a); b = cdr_(b);
|
|
bound--;
|
|
goto compare_top;
|
|
}
|
|
return (taga < tagb) ? fixnum(-1) : fixnum(1);
|
|
}
|
|
|
|
static value_t cyc_vector_compare(value_t a, value_t b, ptrhash_t *table)
|
|
{
|
|
size_t la = vector_size(a);
|
|
size_t lb = vector_size(b);
|
|
size_t m, i;
|
|
value_t d, xa, xb, ca, cb;
|
|
|
|
// first try to prove them different with no recursion
|
|
m = la < lb ? la : lb;
|
|
for (i = 0; i < m; i++) {
|
|
xa = vector_elt(a,i);
|
|
xb = vector_elt(b,i);
|
|
if (leafp(xa) || leafp(xb)) {
|
|
d = bounded_compare(xa, xb, 1);
|
|
if (numval(d)!=0) return d;
|
|
}
|
|
else if (cmptag(xa) < cmptag(xb)) {
|
|
return fixnum(-1);
|
|
}
|
|
else if (cmptag(xa) > cmptag(xb)) {
|
|
return fixnum(1);
|
|
}
|
|
}
|
|
|
|
ca = eq_class(table, a);
|
|
cb = eq_class(table, b);
|
|
if (ca!=NIL && ca==cb)
|
|
return fixnum(0);
|
|
|
|
eq_union(table, a, b, ca, cb);
|
|
|
|
for (i = 0; i < m; i++) {
|
|
xa = vector_elt(a,i);
|
|
xb = vector_elt(b,i);
|
|
if (!leafp(xa) && !leafp(xb)) {
|
|
d = cyc_compare(xa, xb, table);
|
|
if (numval(d)!=0)
|
|
return d;
|
|
}
|
|
}
|
|
|
|
if (la < lb) return fixnum(-1);
|
|
if (la > lb) return fixnum(1);
|
|
return fixnum(0);
|
|
}
|
|
|
|
static value_t cyc_compare(value_t a, value_t b, ptrhash_t *table)
|
|
{
|
|
if (a==b)
|
|
return fixnum(0);
|
|
if (iscons(a)) {
|
|
if (iscons(b)) {
|
|
value_t aa = car_(a); value_t da = cdr_(a);
|
|
value_t ab = car_(b); value_t db = cdr_(b);
|
|
int tagaa = cmptag(aa); int tagda = cmptag(da);
|
|
int tagab = cmptag(ab); int tagdb = cmptag(db);
|
|
value_t d, ca, cb;
|
|
if (leafp(aa) || leafp(ab)) {
|
|
d = bounded_compare(aa, ab, 1);
|
|
if (numval(d)!=0) return d;
|
|
}
|
|
else if (tagaa < tagab)
|
|
return fixnum(-1);
|
|
else if (tagaa > tagab)
|
|
return fixnum(1);
|
|
if (leafp(da) || leafp(db)) {
|
|
d = bounded_compare(da, db, 1);
|
|
if (numval(d)!=0) return d;
|
|
}
|
|
else if (tagda < tagdb)
|
|
return fixnum(-1);
|
|
else if (tagda > tagdb)
|
|
return fixnum(1);
|
|
|
|
ca = eq_class(table, a);
|
|
cb = eq_class(table, b);
|
|
if (ca!=NIL && ca==cb)
|
|
return fixnum(0);
|
|
|
|
eq_union(table, a, b, ca, cb);
|
|
d = cyc_compare(aa, ab, table);
|
|
if (numval(d)!=0) return d;
|
|
return cyc_compare(da, db, table);
|
|
}
|
|
else {
|
|
return fixnum(1);
|
|
}
|
|
}
|
|
else if (isvector(a) && isvector(b)) {
|
|
return cyc_vector_compare(a, b, table);
|
|
}
|
|
return bounded_compare(a, b, 1);
|
|
}
|
|
|
|
static ptrhash_t equal_eq_hashtable;
|
|
void comparehash_init()
|
|
{
|
|
ptrhash_new(&equal_eq_hashtable, 512);
|
|
}
|
|
|
|
value_t compare(value_t a, value_t b)
|
|
{
|
|
value_t guess = bounded_compare(a, b, 2048);
|
|
if (guess == NIL) {
|
|
guess = cyc_compare(a, b, &equal_eq_hashtable);
|
|
ptrhash_reset(&equal_eq_hashtable, 512);
|
|
}
|
|
return guess;
|
|
}
|
|
|
|
value_t equal(value_t a, value_t b)
|
|
{
|
|
return (numval(compare(a,b))==0 ? T : NIL);
|
|
}
|
|
|
|
/*
|
|
optimizations:
|
|
- use hash updates instead of calling lookup then insert. i.e. get the
|
|
bp once and use it twice.
|
|
* preallocate hash table and call reset() instead of new/free
|
|
* less redundant tag checking, 3-bit tags
|
|
*/
|