ilyakooo0/urbit
1
0
Fork 0
mirror of https://github.com/ilyakooo0/urbit.git synced 2024-12-15 01:52:42 +03:00
Code Issues Packages Projects Releases Wiki Activity
4a1cd48ef5
urbit/pkg/urbit/noun/retrieve.c
Joe Bryan 7701b17995 Merge branch 'release/next-vere' into ipc-redux 
* release/next-vere:
  noun: don't add identical values to song_x_cape's hashtable
  nix: fix boot-ship.nix
  release: urbit-os-v1.0.28
  vere: more readable http server status
  release: urbit-os-v1.0.27
  chat-store: don't trim on %messages, either
2020-07-20 13:22:20 -07:00

1630 lines
30 KiB
C
Raw Blame History

/* g/r.c
**
*/
#include "all.h"
#include <murmur3.h>
/* _frag_word(): fast fragment/branch prediction for top word.
*/
static u3_weak
_frag_word(c3_w a_w, u3_noun b)
{
c3_assert(0 != a_w);
{
c3_w dep_w = u3x_dep(a_w);
while ( dep_w ) {
if ( c3n == u3a_is_cell(b) ) {
return u3_none;
}
else {
u3a_cell* b_u = u3a_to_ptr(b);
b = *(((u3_noun*)&(b_u->hed)) + (1 & (a_w >> (dep_w - 1))));
dep_w--;
}
}
return b;
}
}
/* _frag_deep(): fast fragment/branch for deep words.
*/
static u3_weak
_frag_deep(c3_w a_w, u3_noun b)
{
c3_w dep_w = 32;
while ( dep_w ) {
if ( c3n == u3a_is_cell(b) ) {
return u3_none;
}
else {
u3a_cell* b_u = u3a_to_ptr(b);
b = *(((u3_noun*)&(b_u->hed)) + (1 & (a_w >> (dep_w - 1))));
dep_w--;
}
}
return b;
}
/* u3r_at():
**
** Return fragment (a) of (b), or u3_none if not applicable.
*/
u3_weak
u3r_at(u3_atom a, u3_noun b)
{
c3_assert(u3_none != a);
c3_assert(u3_none != b);
u3t_on(far_o);
if ( 0 == a ) {
u3t_off(far_o);
return u3_none;
}
if ( _(u3a_is_cat(a)) ) {
u3t_off(far_o);
return _frag_word(a, b);
}
else {
if ( !_(u3a_is_pug(a)) ) {
u3t_off(far_o);
return u3_none;
}
else {
u3a_atom* a_u = u3a_to_ptr(a);
c3_w len_w = a_u->len_w;
b = _frag_word(a_u->buf_w[len_w - 1], b);
len_w -= 1;
if ( u3_none == b ) {
u3t_off(far_o);
return b;
}
while ( len_w ) {
b = _frag_deep(a_u->buf_w[len_w - 1], b);
if ( u3_none == b ) {
u3t_off(far_o);
return b;
} else {
len_w--;
}
}
u3t_off(far_o);
return b;
}
}
}
/* u3r_mean():
**
** Attempt to deconstruct `a` by axis, noun pairs; 0 terminates.
** Axes must be sorted in tree order.
*/
struct _mean_pair {
c3_w axe_w;
u3_noun* som;
};
static c3_w
_mean_cut(c3_w len_w,
struct _mean_pair* prs_m)
{
c3_w i_w, cut_t, cut_w;
cut_t = 0;
cut_w = 0;
for ( i_w = 0; i_w < len_w; i_w++ ) {
c3_w axe_w = prs_m[i_w].axe_w;
if ( (cut_t == 0) && (3 == u3x_cap(axe_w)) ) {
cut_t = 1;
cut_w = i_w;
}
prs_m[i_w].axe_w = u3x_mas(axe_w);
}
return cut_t ? cut_w : i_w;
}
static c3_o
_mean_extract(u3_noun som,
c3_w len_w,
struct _mean_pair* prs_m)
{
if ( len_w == 0 ) {
return c3y;
}
else if ( (len_w == 1) && (1 == prs_m[0].axe_w) ) {
*prs_m->som = som;
return c3y;
}
else {
if ( c3n == u3a_is_cell(som) ) {
return c3n;
} else {
c3_w cut_w = _mean_cut(len_w, prs_m);
return c3a
(_mean_extract(u3a_h(som), cut_w, prs_m),
_mean_extract(u3a_t(som), (len_w - cut_w), (prs_m + cut_w)));
}
}
}
c3_o
u3r_vmean(u3_noun som, va_list ap)
{
va_list aq;
c3_w len_w;
struct _mean_pair* prs_m;
c3_assert(u3_none != som);
// traverse copy of va_list for alloca
//
va_copy(aq, ap);
len_w = 0;
while ( 1 ) {
if ( 0 == va_arg(aq, c3_w) ) {
break;
}
va_arg(aq, u3_noun*);
len_w++;
}
va_end(aq);
c3_assert( 0 != len_w );
prs_m = alloca(len_w * sizeof(struct _mean_pair));
// traverse va_list and extract args
//
{
c3_w i_w;
for ( i_w = 0; i_w < len_w; i_w++ ) {
prs_m[i_w].axe_w = va_arg(ap, c3_w);
prs_m[i_w].som = va_arg(ap, u3_noun*);
}
va_end(ap);
}
// extract axis from som
//
return _mean_extract(som, len_w, prs_m);
}
c3_o
u3r_mean(u3_noun som, ...)
{
c3_o ret_o;
va_list ap;
va_start(ap, som);
ret_o = u3r_vmean(som, ap);
va_end(ap);
return ret_o;
}
#define SONG_NONE 0
#define SONG_HEAD 1
#define SONG_TAIL 2
typedef struct {
c3_y sat_y;
u3_noun a;
u3_noun b;
} eqframe;
static inline eqframe*
_eq_push(c3_ys mov, c3_ys off, u3_noun a, u3_noun b)
{
u3R->cap_p += mov;
eqframe* cur = u3to(eqframe, u3R->cap_p + off);
cur->sat_y = SONG_NONE;
cur->a = a;
cur->b = b;
return cur;
}
static inline eqframe*
_eq_pop(c3_ys mov, c3_ys off)
{
u3R->cap_p -= mov;
return u3to(eqframe, u3R->cap_p + off);
}
/* _song_atom(): check if atom [a] is indirect and equal to noun [b]
*/
static inline c3_o
_song_atom(u3_atom a, u3_noun b)
{
// [a] is an atom, not pointer-equal to noun [b].
// if they're not both indirect atoms, they can't be equal.
//
if ( (c3n == u3a_is_pug(a)) ||
(c3n == u3a_is_pug(b)) )
{
return c3n;
}
else {
u3a_atom* a_u = u3a_to_ptr(a);
u3a_atom* b_u = u3a_to_ptr(b);
if ( (0 != a_u->mug_w) &&
(0 != b_u->mug_w) &&
(a_u->mug_w != b_u->mug_w) )
{
return c3n;
}
else {
c3_w w_rez = a_u->len_w;
c3_w w_mox = b_u->len_w;
if ( w_rez != w_mox ) {
return c3n;
}
else {
c3_w i_w;
for ( i_w = 0; i_w < w_rez; i_w++ ) {
if ( a_u->buf_w[i_w] != b_u->buf_w[i_w] ) {
return c3n;
}
}
}
}
}
return c3y;
}
/* _song_x_cape(): unifying equality with comparison deduplication
* (tightly coupled to _song_x)
*/
static c3_o
_song_x_cape(c3_ys mov, c3_ys off,
eqframe* fam, eqframe* don,
u3p(u3h_root) har_p)
{
u3_noun a, b, key;
u3_weak got;
u3a_cell* a_u;
u3a_cell* b_u;
while ( don != fam ) {
a = fam->a;
b = fam->b;
switch ( fam->sat_y ) {
case SONG_NONE:
if ( a == b ) {
break;
}
else if ( c3y == u3a_is_atom(a) ) {
if ( c3n == _song_atom(a, b) ) {
return c3n;
}
else {
break;
}
}
else if ( c3y == u3a_is_atom(b) ) {
return c3n;
}
else {
a_u = u3a_to_ptr(a);
b_u = u3a_to_ptr(b);
if ( (0 != a_u->mug_w) &&
(0 != b_u->mug_w) &&
(a_u->mug_w != b_u->mug_w) )
{
return c3n;
}
else {
key = u3nc(u3a_to_off(a), u3a_to_off(b));
u3t_off(euq_o);
got = u3h_get(har_p, key);
u3t_on(euq_o);
u3z(key);
if ( u3_none != got ) {
fam = _eq_pop(mov, off);
continue;
}
fam->sat_y = SONG_HEAD;
fam = _eq_push(mov, off, a_u->hed, b_u->hed);
continue;
}
}
case SONG_HEAD:
a_u = u3a_to_ptr(a);
b_u = u3a_to_ptr(b);
u3a_wed(&(a_u->hed), &(b_u->hed));
fam->sat_y = SONG_TAIL;
fam = _eq_push(mov, off, a_u->tel, b_u->tel);
continue;
case SONG_TAIL:
a_u = u3a_to_ptr(a);
b_u = u3a_to_ptr(b);
u3a_wed(&(a_u->tel), &(b_u->tel));
break;
default:
c3_assert(0);
break;
}
// [har_p] is effectively a set of equal pairs.
// we cons [a] and [b] as posts so that we don't
// touch their reference counts.
//
if ( a != b ) {
key = u3nc(u3a_to_off(a), u3a_to_off(b));
u3t_off(euq_o);
u3h_put(har_p, key, c3y);
u3t_on(euq_o);
u3z(key);
}
fam = _eq_pop(mov, off);
}
return c3y;
}
/* _song_x(): yes if a and b are the same noun, use uni to unify
*/
static c3_o
_song_x(u3_noun a, u3_noun b)
{
u3p(eqframe) empty = u3R->cap_p;
c3_y wis_y = c3_wiseof(eqframe);
c3_o nor_o = u3a_is_north(u3R);
c3_ys mov = ( c3y == nor_o ? -wis_y : wis_y );
c3_ys off = ( c3y == nor_o ? 0 : -wis_y );
c3_s ovr_s = 0;
eqframe* fam = _eq_push(mov, off, a, b);
eqframe* don = u3to(eqframe, empty + off);
u3a_cell* a_u;
u3a_cell* b_u;
while ( don != fam ) {
a = fam->a;
b = fam->b;
switch ( fam->sat_y ) {
case SONG_NONE:
if ( a == b ) {
break;
}
else if ( c3y == u3a_is_atom(a) ) {
if ( c3n == _song_atom(a, b) ) {
u3R->cap_p = empty;
return c3n;
}
else {
break;
}
}
else if ( c3y == u3a_is_atom(b) ) {
u3R->cap_p = empty;
return c3n;
}
else {
a_u = u3a_to_ptr(a);
b_u = u3a_to_ptr(b);
if ( (0 != a_u->mug_w) &&
(0 != b_u->mug_w) &&
(a_u->mug_w != b_u->mug_w) )
{
u3R->cap_p = empty;
return c3n;
}
else {
fam->sat_y = SONG_HEAD;
fam = _eq_push(mov, off, a_u->hed, b_u->hed);
continue;
}
}
case SONG_HEAD:
a_u = u3a_to_ptr(a);
b_u = u3a_to_ptr(b);
u3a_wed(&(a_u->hed), &(b_u->hed));
fam->sat_y = SONG_TAIL;
fam = _eq_push(mov, off, a_u->tel, b_u->tel);
continue;
case SONG_TAIL:
a_u = u3a_to_ptr(a);
b_u = u3a_to_ptr(b);
u3a_wed(&(a_u->tel), &(b_u->tel));
break;
default:
c3_assert(0);
break;
}
// [ovr_s] counts iterations. when it overflows, we know we've hit a
// pathological case and MUST start de-duplicating comparisons.
//
if ( 0 == ++ovr_s ) {
u3p(u3h_root) har_p = u3h_new();
c3_o ret_o = _song_x_cape(mov, off, fam, don, har_p);
u3h_free(har_p);
u3R->cap_p = empty;
return ret_o;
}
fam = _eq_pop(mov, off);
}
return c3y;
}
/* u3r_sing(): Yes iff [a] and [b] are the same noun.
*/
c3_o
u3r_sing(u3_noun a, u3_noun b)
{
c3_o ret_o;
u3t_on(euq_o);
ret_o = _song_x(a, b);
u3t_off(euq_o);
return ret_o;
}
c3_o
u3r_fing(u3_noun a,
u3_noun b)
{
return (a == b) ? c3y : c3n;
}
/* u3r_sing_cell():
**
** Yes iff `[p q]` and `b` are the same noun.
*/
c3_o
u3r_sing_cell(u3_noun p,
u3_noun q,
u3_noun b)
{
return c3a(_(u3a_is_cell(b)),
c3a(u3r_sing(p, u3a_h(b)),
u3r_sing(q, u3a_t(b))));
}
c3_o
u3r_fing_cell(u3_noun p,
u3_noun q,
u3_noun b)
{
return c3a(_(u3a_is_cell(b)),
c3a(u3r_fing(p, u3a_h(b)),
u3r_fing(q, u3a_t(b))));
}
/* u3r_sing_mixt():
**
** Yes iff `[p q]` and `b` are the same noun.
*/
c3_o
u3r_sing_mixt(const c3_c* p_c,
u3_noun q,
u3_noun b)
{
return c3a(_(u3a_is_cell(b)),
c3a(u3r_sing_c(p_c, u3a_h(b)),
u3r_sing(q, u3a_t(b))));
}
c3_o
u3r_fing_mixt(const c3_c* p_c,
u3_noun q,
u3_noun b)
{
return c3a(_(u3a_is_cell(b)),
c3a(u3r_sing_c(p_c, u3a_h(b)),
u3r_fing(q, u3a_t(b))));
}
/* u3r_sing_trel():
**
** Yes iff `[p q r]` and `b` are the same noun.
*/
c3_o
u3r_sing_trel(u3_noun p,
u3_noun q,
u3_noun r,
u3_noun b)
{
return c3a(_(u3a_is_cell(b)),
c3a(u3r_sing(p, u3a_h(b)),
u3r_sing_cell(q, r, u3a_t(b))));
}
c3_o
u3r_fing_trel(u3_noun p,
u3_noun q,
u3_noun r,
u3_noun b)
{
return c3a(_(u3a_is_cell(b)),
c3a(u3r_fing(p, u3a_h(b)),
u3r_fing_cell(q, r, u3a_t(b))));
}
/* u3r_sing_qual():
**
** Yes iff `[p q r]` and `b` are the same noun.
*/
c3_o
u3r_sing_qual(u3_noun p,
u3_noun q,
u3_noun r,
u3_noun s,
u3_noun b)
{
return c3a(_(u3a_is_cell(b)),
c3a(u3r_sing(p, u3a_h(b)),
u3r_sing_trel(q, r, s, u3a_t(b))));
}
c3_o
u3r_fing_qual(u3_noun p,
u3_noun q,
u3_noun r,
u3_noun s,
u3_noun b)
{
return c3a(_(u3a_is_cell(b)),
c3a(u3r_fing(p, u3a_h(b)),
u3r_fing_trel(q, r, s, u3a_t(b))));
}
/* u3r_nord():
**
** Return 0, 1 or 2 if `a` is below, equal to, or above `b`.
*/
u3_atom
u3r_nord(u3_noun a,
u3_noun b)
{
c3_assert(u3_none != a);
c3_assert(u3_none != b);
if ( a == b ) {
return 1;
}
else {
if ( _(u3a_is_atom(a)) ) {
if ( !_(u3a_is_atom(b)) ) {
return 0;
} else {
if ( _(u3a_is_cat(a)) ) {
if ( _(u3a_is_cat(b)) ) {
return (a < b) ? 0 : 2;
}
else return 0;
}
else if ( _(u3a_is_cat(b)) ) {
return 2;
}
else {
u3a_atom* a_u = u3a_to_ptr(a);
u3a_atom* b_u = u3a_to_ptr(b);
c3_w w_rez = a_u->len_w;
c3_w w_mox = b_u->len_w;
if ( w_rez != w_mox ) {
return (w_rez < w_mox) ? 0 : 2;
}
else {
c3_w i_w;
for ( i_w = 0; i_w < w_rez; i_w++ ) {
c3_w ai_w = a_u->buf_w[i_w];
c3_w bi_w = b_u->buf_w[i_w];
if ( ai_w != bi_w ) {
return (ai_w < bi_w) ? 0 : 2;
}
}
return 1;
}
}
}
} else {
if ( _(u3a_is_atom(b)) ) {
return 2;
} else {
u3_atom c = u3r_nord(u3a_h(a), u3a_h(b));
if ( 1 == c ) {
return u3r_nord(u3a_t(a), u3a_t(b));
} else {
return c;
}
}
}
}
}
/* u3r_sing_c(): cord/C-string value equivalence.
*/
c3_o
u3r_sing_c(const c3_c* a_c,
u3_noun b)
{
c3_assert(u3_none != b);
if ( !_(u3a_is_atom(b)) ) {
return c3n;
}
else {
c3_w w_sof = strlen(a_c);
c3_w i_w;
if ( w_sof != u3r_met(3, b) ) {
return c3n;
}
for ( i_w = 0; i_w < w_sof; i_w++ ) {
if ( u3r_byte(i_w, b) != a_c[i_w] ) {
return c3n;
}
}
return c3y;
}
}
/* u3r_bush():
**
** Factor [a] as a bush [b.[p q] c].
*/
c3_o
u3r_bush(u3_noun a,
u3_noun* b,
u3_noun* c)
{
c3_assert(u3_none != a);
if ( _(u3a_is_atom(a)) ) {
return c3n;
}
else {
*b = u3a_h(a);
if ( _(u3a_is_atom(*b)) ) {
return c3n;
} else {
*c = u3a_t(a);
return c3y;
}
}
}
/* u3r_cell():
**
** Factor (a) as a cell (b c).
*/
c3_o
u3r_cell(u3_noun a,
u3_noun* b,
u3_noun* c)
{
c3_assert(u3_none != a);
if ( _(u3a_is_atom(a)) ) {
return c3n;
}
else {
if ( b ) *b = u3a_h(a);
if ( c ) *c = u3a_t(a);
return c3y;
}
}
/* u3r_p():
**
** & [0] if [a] is of the form [b *c].
*/
c3_o
u3r_p(u3_noun a,
u3_noun b,
u3_noun* c)
{
u3_noun feg, nux;
if ( (c3y == u3r_cell(a, &feg, &nux)) &&
(c3y == u3r_sing(feg, b)) )
{
*c = nux;
return c3y;
}
else return c3n;
}
/* u3r_pq():
**
** & [0] if [a] is of the form [b *c d].
*/
c3_o
u3r_pq(u3_noun a,
u3_noun b,
u3_noun* c,
u3_noun* d)
{
u3_noun nux;
if ( (c3y == u3r_p(a, b, &nux)) &&
(c3y == u3r_cell(nux, c, d)) )
{
return c3y;
}
else return c3n;
}
/* u3r_pqr():
**
** & [0] if [a] is of the form [b *c *d *e].
*/
c3_o
u3r_pqr(u3_noun a,
u3_noun b,
u3_noun* c,
u3_noun* d,
u3_noun* e)
{
u3_noun nux;
if ( (c3y == u3r_p(a, b, &nux)) &&
(c3y == u3r_trel(nux, c, d, e)) )
{
return c3y;
}
else return c3n;
}
/* u3r_pqrs():
**
** & [0] if [a] is of the form [b *c *d *e *f].
*/
c3_o
u3r_pqrs(u3_noun a,
u3_noun b,
u3_noun* c,
u3_noun* d,
u3_noun* e,
u3_noun* f)
{
u3_noun nux;
if ( (c3y == u3r_p(a, b, &nux)) &&
(c3y == u3r_qual(nux, c, d, e, f)) )
{
return c3y;
}
else return c3n;
}
/* u3r_trel():
**
** Factor (a) as a trel (b c d).
*/
c3_o
u3r_trel(u3_noun a,
u3_noun *b,
u3_noun *c,
u3_noun *d)
{
u3_noun guf;
if ( (c3y == u3r_cell(a, b, &guf)) &&
(c3y == u3r_cell(guf, c, d)) ) {
return c3y;
}
else {
return c3n;
}
}
/* u3r_qual():
**
** Factor (a) as a qual (b c d e).
*/
c3_o
u3r_qual(u3_noun a,
u3_noun* b,
u3_noun* c,
u3_noun* d,
u3_noun* e)
{
u3_noun guf;
if ( (c3y == u3r_cell(a, b, &guf)) &&
(c3y == u3r_trel(guf, c, d, e)) ) {
return c3y;
}
else return c3n;
}
/* u3r_quil():
**
** Factor (a) as a quil (b c d e f).
*/
c3_o
u3r_quil(u3_noun a,
u3_noun* b,
u3_noun* c,
u3_noun* d,
u3_noun* e,
u3_noun* f)
{
u3_noun guf;
if ( (c3y == u3r_cell(a, b, &guf)) &&
(c3y == u3r_qual(guf, c, d, e, f)) ) {
return c3y;
}
else return c3n;
}
/* u3r_hext():
**
** Factor (a) as a hext (b c d e f g)
*/
c3_o
u3r_hext(u3_noun a,
u3_noun* b,
u3_noun* c,
u3_noun* d,
u3_noun* e,
u3_noun* f,
u3_noun* g)
{
u3_noun guf;
if ( (c3y == u3r_cell(a, b, &guf)) &&
(c3y == u3r_quil(guf, c, d, e, f, g)) ) {
return c3y;
}
else return c3n;
}
/* u3r_met():
**
** Return the size of (b) in bits, rounded up to
** (1 << a_y).
**
** For example, (a_y == 3) returns the size in bytes.
*/
c3_w
u3r_met(c3_y a_y,
u3_atom b)
{
c3_assert(u3_none != b);
c3_assert(_(u3a_is_atom(b)));
if ( b == 0 ) {
return 0;
}
else {
/* gal_w: number of words besides (daz_w) in (b).
** daz_w: top word in (b).
*/
c3_w gal_w;
c3_w daz_w;
if ( _(u3a_is_cat(b)) ) {
gal_w = 0;
daz_w = b;
}
else {
u3a_atom* b_u = u3a_to_ptr(b);
gal_w = (b_u->len_w) - 1;
daz_w = b_u->buf_w[gal_w];
}
switch ( a_y ) {
case 0:
case 1:
case 2: {
/* col_w: number of bits in (daz_w)
** bif_w: number of bits in (b)
*/
c3_w bif_w, col_w;
col_w = c3_bits_word(daz_w);
bif_w = col_w + (gal_w << 5);
return (bif_w + ((1 << a_y) - 1)) >> a_y;
}
case 3: {
return (gal_w << 2)
+ ((daz_w >> 24) ? 4 : (daz_w >> 16) ? 3 : (daz_w >> 8) ? 2 : 1);
}
case 4: {
return (gal_w << 1)
+ ((daz_w >> 16) ? 2 : 1);
}
default: {
c3_y gow_y = (a_y - 5);
return ((gal_w + 1) + ((1 << gow_y) - 1)) >> gow_y;
}
}
}
}
/* u3r_bit():
**
** Return bit (a_w) of (b).
*/
c3_b
u3r_bit(c3_w a_w,
u3_atom b)
{
c3_assert(u3_none != b);
c3_assert(_(u3a_is_atom(b)));
if ( _(u3a_is_cat(b)) ) {
if ( a_w >= 31 ) {
return 0;
}
else return (1 & (b >> a_w));
}
else {
u3a_atom* b_u = u3a_to_ptr(b);
c3_y vut_y = (a_w & 31);
c3_w pix_w = (a_w >> 5);
if ( pix_w >= b_u->len_w ) {
return 0;
}
else {
c3_w nys_w = b_u->buf_w[pix_w];
return (1 & (nys_w >> vut_y));
}
}
}
/* u3r_byte():
**
** Return byte (a_w) of (b).
*/
c3_y
u3r_byte(c3_w a_w,
u3_atom b)
{
c3_assert(u3_none != b);
c3_assert(_(u3a_is_atom(b)));
if ( _(u3a_is_cat(b)) ) {
if ( a_w > 3 ) {
return 0;
}
else return (255 & (b >> (a_w << 3)));
}
else {
u3a_atom* b_u = u3a_to_ptr(b);
c3_y vut_y = (a_w & 3);
c3_w pix_w = (a_w >> 2);
if ( pix_w >= b_u->len_w ) {
return 0;
}
else {
c3_w nys_w = b_u->buf_w[pix_w];
return (255 & (nys_w >> (vut_y << 3)));
}
}
}
/* u3r_bytes():
**
** Copy bytes (a_w) through (a_w + b_w - 1) from (d) to (c).
*/
void
u3r_bytes(c3_w a_w,
c3_w b_w,
c3_y* c_y,
u3_atom d)
{
c3_assert(u3_none != d);
c3_assert(_(u3a_is_atom(d)));
if ( _(u3a_is_cat(d)) ) {
c3_w e_w = d >> (c3_min(a_w, 4) << 3);
c3_w m_w = c3_min(b_w, 4);
memcpy(c_y, (c3_y*)&e_w, m_w);
if ( b_w > 4 ) {
memset(c_y + 4, 0, b_w - 4);
}
}
else {
u3a_atom* d_u = u3a_to_ptr(d);
c3_w n_w = d_u->len_w << 2;
c3_y* x_y = (c3_y*)d_u->buf_w + a_w;
if ( a_w >= n_w ) {
memset(c_y, 0, b_w);
}
else {
c3_w z_w = c3_min(b_w, n_w - a_w);
memcpy(c_y, x_y, z_w);
if ( b_w > n_w - a_w ) {
memset(c_y + z_w, 0, b_w + a_w - n_w);
}
}
}
}
/* u3r_mp():
**
** Copy (b) into (a_mp).
*/
void
u3r_mp(mpz_t a_mp,
u3_atom b)
{
c3_assert(u3_none != b);
c3_assert(_(u3a_is_atom(b)));
if ( _(u3a_is_cat(b)) ) {
mpz_init_set_ui(a_mp, b);
}
else {
u3a_atom* b_u = u3a_to_ptr(b);
c3_w len_w = b_u->len_w;
// avoid reallocation on import, if possible
//
if ( (len_w >> 27) ) {
mpz_init(a_mp);
}
else {
mpz_init2(a_mp, len_w << 5);
}
mpz_import(a_mp, len_w, -1, sizeof(c3_w), 0, 0, b_u->buf_w);
}
}
/* u3r_word():
**
** Return word (a_w) of (b).
*/
c3_w
u3r_word(c3_w a_w,
u3_atom b)
{
c3_assert(u3_none != b);
c3_assert(_(u3a_is_atom(b)));
if ( _(u3a_is_cat(b)) ) {
if ( a_w > 0 ) {
return 0;
}
else return b;
}
else {
u3a_atom* b_u = u3a_to_ptr(b);
if ( a_w >= b_u->len_w ) {
return 0;
}
else return b_u->buf_w[a_w];
}
}
/* u3r_chub():
**
** Return double-word (a_w) of (b).
*/
c3_d
u3r_chub(c3_w a_w,
u3_atom b)
{
c3_w wlo_w = u3r_word(a_w * 2, b);
c3_w whi_w = u3r_word(1 + (a_w * 2), b);
return (((uint64_t)whi_w) << 32ULL) | ((uint64_t)wlo_w);
}
/* u3r_words():
**
** Copy words (a_w) through (a_w + b_w - 1) from (d) to (c).
*/
void
u3r_words(c3_w a_w,
c3_w b_w,
c3_w* c_w,
u3_atom d)
{
c3_assert(u3_none != d);
c3_assert(_(u3a_is_atom(d)));
if ( b_w == 0 ) {
return;
}
if ( _(u3a_is_cat(d)) ) {
if ( a_w == 0 ) {
*c_w = d;
memset((c3_y*)(c_w + 1), 0, (b_w - 1) << 2);
}
else {
memset((c3_y*)c_w, 0, b_w << 2);
}
}
else {
u3a_atom* d_u = u3a_to_ptr(d);
if ( a_w >= d_u->len_w ) {
memset((c3_y*)c_w, 0, b_w << 2);
}
else {
c3_w z_w = c3_min(b_w, d_u->len_w - a_w);
c3_w* x_w = d_u->buf_w + a_w;
memcpy((c3_y*)c_w, (c3_y*)x_w, z_w << 2);
if ( b_w > d_u->len_w - a_w ) {
memset((c3_y*)(c_w + z_w), 0, (b_w + a_w - d_u->len_w) << 2);
}
}
}
}
/* u3r_chubs():
**
** Copy double-words (a_w) through (a_w + b_w - 1) from (d) to (c).
*/
void
u3r_chubs(c3_w a_w,
c3_w b_w,
c3_d* c_d,
u3_atom d)
{
/* XX: assumes little-endian
*/
u3r_words(a_w * 2, b_w * 2, (c3_w *)c_d, d);
}
/* u3r_safe_byte(): validate and retrieve byte.
*/
c3_o
u3r_safe_byte(u3_noun dat, c3_y* out_y)
{
if ( (c3n == u3a_is_atom(dat))
|| (1 < u3r_met(3, dat)) )
{
return c3n;
}
*out_y = u3r_byte(0, dat);
return c3y;
}
/* u3r_safe_word(): validate and retrieve word.
*/
c3_o
u3r_safe_word(u3_noun dat, c3_w* out_w)
{
if ( (c3n == u3a_is_atom(dat))
|| (1 < u3r_met(5, dat)) )
{
return c3n;
}
*out_w = u3r_word(0, dat);
return c3y;
}
/* u3r_safe_chub(): validate and retrieve chub.
*/
c3_o
u3r_safe_chub(u3_noun dat, c3_d* out_d)
{
if ( (c3n == u3a_is_atom(dat))
|| (1 < u3r_met(6, dat)) )
{
return c3n;
}
*out_d = u3r_chub(0, dat);
return c3y;
}
/* u3r_chop():
**
** Into the bloq space of `met`, from position `fum` for a
** span of `wid`, to position `tou`, XOR from atom `src`
** into `dst_w`.
*/
void
u3r_chop(c3_g met_g,
c3_w fum_w,
c3_w wid_w,
c3_w tou_w,
c3_w* dst_w,
u3_atom src)
{
c3_w i_w;
c3_w len_w;
c3_w* buf_w;
c3_assert(u3_none != src);
c3_assert(_(u3a_is_atom(src)));
if ( _(u3a_is_cat(src)) ) {
len_w = src ? 1 : 0;
buf_w = &src;
}
else {
u3a_atom* src_u = u3a_to_ptr(src);
len_w = src_u->len_w;
buf_w = src_u->buf_w;
}
if ( met_g < 5 ) {
c3_w san_w = (1 << met_g);
c3_w mek_w = ((1 << san_w) - 1);
c3_w baf_w = (fum_w << met_g);
c3_w bat_w = (tou_w << met_g);
// XX: efficiency: poor. Iterate by words.
//
for ( i_w = 0; i_w < wid_w; i_w++ ) {
c3_w waf_w = (baf_w >> 5);
c3_g raf_g = (baf_w & 31);
c3_w wat_w = (bat_w >> 5);
c3_g rat_g = (bat_w & 31);
c3_w hop_w;
hop_w = (waf_w >= len_w) ? 0 : buf_w[waf_w];
hop_w = (hop_w >> raf_g) & mek_w;
dst_w[wat_w] ^= (hop_w << rat_g);
baf_w += san_w;
bat_w += san_w;
}
}
else {
c3_g hut_g = (met_g - 5);
c3_w san_w = (1 << hut_g);
c3_w j_w;
for ( i_w = 0; i_w < wid_w; i_w++ ) {
c3_w wuf_w = (fum_w + i_w) << hut_g;
c3_w wut_w = (tou_w + i_w) << hut_g;
for ( j_w = 0; j_w < san_w; j_w++ ) {
dst_w[wut_w + j_w] ^=
((wuf_w + j_w) >= len_w)
? 0
: buf_w[wuf_w + j_w];
}
}
}
}
/* u3r_string(): `a` as malloced C string.
*/
c3_c*
u3r_string(u3_atom a)
{
c3_w met_w = u3r_met(3, a);
c3_c* str_c = c3_malloc(met_w + 1);
u3r_bytes(0, met_w, (c3_y*)str_c, a);
str_c[met_w] = 0;
return str_c;
}
/* u3r_tape(): `a`, a list of bytes, as malloced C string.
*/
c3_y*
u3r_tape(u3_noun a)
{
u3_noun b;
c3_w i_w;
c3_y *a_y;
for ( i_w = 0, b=a; c3y == u3a_is_cell(b); i_w++, b=u3a_t(b) )
;
a_y = c3_malloc(i_w + 1);
for ( i_w = 0, b=a; c3y == u3a_is_cell(b); i_w++, b=u3a_t(b) ) {
a_y[i_w] = u3a_h(b);
}
a_y[i_w] = 0;
return a_y;
}
/* u3r_mug_bytes(): Compute the mug of `buf`, `len`, LSW first.
*/
c3_w
u3r_mug_bytes(const c3_y *buf_y,
c3_w len_w)
{
c3_w syd_w = 0xcafebabe;
c3_w ham_w = 0;
while ( 1 ) {
c3_w haz_w;
MurmurHash3_x86_32(buf_y, len_w, syd_w, &haz_w);
ham_w = (haz_w >> 31) ^ (haz_w & 0x7fffffff);
if ( 0 == ham_w ) {
syd_w++;
}
else {
return ham_w;
}
}
}
/* u3r_mug_chub(): Compute the mug of `num`, LSW first.
*/
c3_w
u3r_mug_chub(c3_d num_d)
{
c3_w buf_w[2];
buf_w[0] = (c3_w)(num_d & 0xffffffffULL);
buf_w[1] = (c3_w)(num_d >> 32);
return u3r_mug_words(buf_w, 2);
}
/* u3r_mug_string(): Compute the mug of `a`, LSB first.
*/
c3_w
u3r_mug_string(const c3_c *a_c)
{
return u3r_mug_bytes((c3_y*)a_c, strlen(a_c));
}
/* u3r_mug_words(): 31-bit nonzero MurmurHash3 on raw words.
*/
c3_w
u3r_mug_words(const c3_w* key_w, c3_w len_w)
{
c3_w byt_w;
// ignore trailing zeros
//
while ( len_w && !key_w[len_w - 1] ) {
len_w--;
}
// calculate byte-width a la u3r_met(3, ...)
//
if ( !len_w ) {
byt_w = 0;
}
else {
c3_w gal_w = len_w - 1;
c3_w daz_w = key_w[gal_w];
byt_w = (gal_w << 2)
+ ((daz_w >> 24) ? 4 : (daz_w >> 16) ? 3 : (daz_w >> 8) ? 2 : 1);
}
// XX: assumes little-endian
//
return u3r_mug_bytes((c3_y*)key_w, byt_w);
}
/* u3r_mug_both(): Join two mugs.
*/
c3_w
u3r_mug_both(c3_w lef_w, c3_w rit_w)
{
c3_w ham_w = lef_w ^ (0x7fffffff ^ rit_w);
return u3r_mug_words(&ham_w, 1);
}
/* u3r_mug_cell(): Compute the mug of the cell `[hed tel]`.
*/
c3_w
u3r_mug_cell(u3_noun hed,
u3_noun tel)
{
c3_w lus_w = u3r_mug(hed);
c3_w biq_w = u3r_mug(tel);
return u3r_mug_both(lus_w, biq_w);
}
#define MUG_ROOT 0
#define MUG_HEAD 1
#define MUG_TAIL 2
// stack frame for recording head vs tail iteration
//
// In Hoon, this structure would be as follows:
//
// $% [%root ~]
// [%head cell=^]
// [%tail cell=^ hed-mug=@]
// ==
//
typedef struct mugframe
{
c3_y tag_y;
u3a_cell* cel_u;
c3_w mug_w;
} mugframe;
static inline void
_mug_push(c3_ys mov,
c3_ys off,
c3_y tag_y,
u3a_cell* cel_u,
c3_w mug_w)
{
u3R->cap_p += mov;
// ensure we haven't overflowed the stack
// (off==0 means we're on a north road)
//
if ( 0 == off ) {
if( !(u3R->cap_p > u3R->hat_p) ) {
u3m_bail(c3__meme);
}
}
else {
if( !(u3R->cap_p < u3R->hat_p) ) {
u3m_bail(c3__meme);
}
}
mugframe* fam_u = u3to(mugframe, u3R->cap_p + off);
fam_u->tag_y = tag_y;
fam_u->cel_u = cel_u;
fam_u->mug_w = mug_w;
}
static inline mugframe
_mug_pop(c3_ys mov, c3_ys off)
{
mugframe* fam_u = u3to(mugframe, u3R->cap_p + off);
u3R->cap_p -= mov;
return *fam_u;
}
// u3r_mug(): statefully mug a noun using a 31-bit MurmurHash3
//
c3_w
u3r_mug(u3_noun veb)
{
// sanity check (makes a clear error message)
//
c3_assert( u3_none != veb );
// initialize signed stack offsets (relative to north/south road)
//
c3_ys mov, off;
{
c3_y wis_y = c3_wiseof(mugframe);
c3_o nor_o = u3a_is_north(u3R);
mov = ( c3y == nor_o ? -wis_y : wis_y );
off = ( c3y == nor_o ? 0 : -wis_y );
}
// stash the current stack post
//
u3p(mugframe) cap_p = u3R->cap_p;
// push the (only) ROOT stack frame (our termination condition)
//
_mug_push(mov, off, MUG_ROOT, 0, 0);
c3_w mug_w;
// read from the current noun .veb
//
advance: {
// veb is a direct atom, mug is not memoized
//
if ( _(u3a_is_cat(veb)) ) {
mug_w = u3r_mug_words(&veb, 1);
goto retreat;
}
// veb is indirect, a pointer into the loom
//
else {
u3a_noun* veb_u = u3a_to_ptr(veb);
// veb has already been mugged, return memoized value
//
if ( 0 != veb_u->mug_w ) {
mug_w = veb_u->mug_w;
goto retreat;
}
// veb is an indirect atom, mug its bytes and memoize
//
else if ( _(u3a_is_atom(veb)) ) {
u3a_atom* vat_u = (u3a_atom*)veb_u;
mug_w = u3r_mug_words(vat_u->buf_w, vat_u->len_w);
vat_u->mug_w = mug_w;
goto retreat;
}
// veb is a cell, push a stack frame to mark head-recursion
// and read the head
//
else {
u3a_cell* cel_u = (u3a_cell*)veb_u;
_mug_push(mov, off, MUG_HEAD, cel_u, 0);
veb = cel_u->hed;
goto advance;
}
}
}
// consume the popped stack frame and mug from above
//
retreat: {
mugframe fam_u = _mug_pop(mov, off);
switch ( fam_u.tag_y ) {
default: {
c3_assert(0);
}
// we done
//
case MUG_ROOT: {
break;
}
// mug_w is the mug of the head of cel_u
// push a stack frame to mark tail recursion,
// record the mug of the head, and read the tail
//
case MUG_HEAD: {
_mug_push(mov, off, MUG_TAIL, fam_u.cel_u, mug_w);
veb = fam_u.cel_u->tel;
goto advance;
}
// mug_w is the mug of the tail of cel_u
// combine the mugs, memoize the value, and recur
//
case MUG_TAIL: {
u3a_cell* cel_u = fam_u.cel_u;
mug_w = u3r_mug_both(fam_u.mug_w, mug_w);
cel_u->mug_w = mug_w;
goto retreat;
}
}
}
// sanity check
//
c3_assert( u3R->cap_p == cap_p );
return mug_w;
}
Reference in New Issue View Git Blame Copy Permalink