mtree_spec.h

Go to the documentation of this file.

#include "../src/ceptr.h"
#include "../src/receptor.h"
#include "http_example.h"

/*
#define TT(t) ((t) && (*((int *)t) == matrixImpl))
#define TE(t,te,me) ((TT(t)) ? (me):(te))
#define TNEW(impl,parent,symbol,surface,size) ((impl == matrixImpl) ? (GT)_m_new(parent,symbol,surface,size) : (GT)_t_new(parent,symbol,surface,size))
#define TFREE(t) TE(t,_t_free((T*)t),_m_free((M*)t))
#define TSIZE(t) TE(t,_t_size((T *)t),_m_size((M *)t))
#define TKIDS(t) TE(t,_t_children((T *)t),_m_children((M *)t))
#define TSURFACE(t) TE(t,_t_surface((T *)t),_m_surface((M *)t))

void testCreateTreeNodesT() {
    uint32_t impl;
    for(impl=FIRST_TREE_IMPL_TYPE;impl != 0;impl++) {
    GT t = TNEW(impl,0,TEST_STR_SYMBOL,"hello",6);
    spec_is_long_equal(TSIZE(t),(size_t)6);
    spec_is_equal(TKIDS(t),0);
    spec_is_str_equal((char *)TSURFACE(t),"hello");

    TFREE(t);
    }
}
*/

void mtd(H h) {
    H hh;
    int i;
    printf("\n");
    for(i=0;i<h.m->levels;i++) {
    hh.m = h.m;
    hh.a.l = i;
    L *l = _GET_LEVEL(h,i);
    int j;
    printf("%d(%d):",i,l->nodes);
    for(j=0;j<l->nodes;j++) {
        hh.a.i = j;
        N *n = _GET_NODE(h,l,j);
        if (!(n->flags & TFLAG_DELETED))
        printf("%s:%d, ",(char *)_m_surface(hh),n->parenti);
        else
        printf("X, ");
    }
    printf("\n");
    }
}


void _walkfn(H h,N *n,void *data,MwalkState *state,Maddr ap) {
    char *s = (char *)data;
    s += strlen(s);
    //    sprintf(s,(char *)"%d.%d:%s, ",ac.l,ac.i,(char *) (on->flags &TFLAG_ALLOCATED?on->surface:&on->surface));
    sprintf(s,(char *)"%d.%d, ",h.a.l,h.a.i);
}
void testCreateTreeNodesM(){

    H h,h1,h11,h2,h21,h22,h3;

    // test adding a new root
    h = _m_new(null_H,TEST_STR_SYMBOL,"hello",6);
    spec_is_equal(h.a.l,0);
    spec_is_equal(h.a.i,0);
    spec_is_equal(h.m->levels,1);
    spec_is_long_equal(_m_size(h),(size_t)6);
    spec_is_equal(_m_children(h),0);
    spec_is_str_equal((char *)_m_surface(h),"hello");
    spec_is_maddr_equal(_m_parent(h),null_H.a);
    spec_is_maddr_equal(_m_child(h,1),null_H.a);
    spec_is_maddr_equal(_m_child(h,NULL_ADDR),null_H.a);
    spec_is_true(semeq(_m_symbol(h),TEST_STR_SYMBOL));

    // test adding first child
    h1 = _m_new(h,TEST_STR_SYMBOL,"t1",3);
    spec_is_equal(h.m->levels,2);
    spec_is_str_equal((char *)_m_surface(h1),"t1");
    spec_is_maddr_equal(_m_parent(h1),h.a);
    spec_is_equal(_m_children(h),1);
    spec_is_maddr_equal(_m_child(h,1),h1.a);
    spec_is_maddr_equal(_m_child(h,NULL_ADDR),h1.a);
    spec_is_maddr_equal(_m_child(h1,NULL_ADDR),null_H.a);

    // test adding second child
    h2 = _m_new(h,TEST_STR_SYMBOL,"t2",3);
    spec_is_equal(h.m->levels,2);
    spec_is_str_equal((char *)_m_surface(h2),"t2");
    spec_is_maddr_equal(_m_parent(h2),h.a);
    spec_is_equal(_m_children(h),2);
    spec_is_maddr_equal(_m_child(h,2),h2.a);
    spec_is_maddr_equal(_m_child(h,NULL_ADDR),h2.a);
    spec_is_equal(_m_children(h2),0);

    // test adding child to second child
    h21 = _m_new(h2,TEST_STR_SYMBOL,"t21",4);
    spec_is_equal(h21.a.l,2);
    spec_is_equal(h21.a.i,0);
    spec_is_equal(h.m->levels,3);
    spec_is_str_equal((char *)_m_surface(h21),"t21");
    spec_is_maddr_equal(_m_parent(h21),h2.a);
    spec_is_equal(_m_children(h2),1);
    spec_is_maddr_equal(_m_child(h2,1),h21.a);
    spec_is_maddr_equal(_m_child(h2,NULL_ADDR),h21.a);

    // now adding in a child to the first child (i.e. out of order)
    spec_is_maddr_equal(_m_child(h1,NULL_ADDR),null_H.a);
    h11 = _m_new(h1,TEST_STR_SYMBOL,"t11",4);
    spec_is_equal(h11.a.l,2);
    spec_is_equal(h11.a.i,1);  //should be inserted after the t21 node
    spec_is_equal(h.m->levels,3);
    spec_is_str_equal((char *)_m_surface(h11),"t11");
    spec_is_maddr_equal(_m_parent(h11),h1.a);
    spec_is_equal(_m_children(h1),1);
    spec_is_maddr_equal(_m_child(h1,1),h11.a);
    spec_is_maddr_equal(_m_child(h1,NULL_ADDR),h11.a);

    // this test is here because it makes sure that things work even
    // if nodes are inserted out of order
    h22 = _m_new(h2,TEST_STR_SYMBOL,"t22",4);
    spec_is_equal(h22.a.l,2);
    spec_is_equal(h22.a.i,2);  //should be inserted after the t11 node
    spec_is_equal(h.m->levels,3);
    spec_is_str_equal((char *)_m_surface(h22),"t22");
    spec_is_maddr_equal(_m_parent(h22),h2.a);
    spec_is_equal(_m_children(h2),2);
    spec_is_maddr_equal(_m_child(h2,2),h22.a);
    spec_is_maddr_equal(_m_child(h2,NULL_ADDR),h22.a);

    Symbol s99 = {0,0,99};

    // test adding in non allocated integer surface
    h3 = _m_newi(h,s99,101);
    spec_is_maddr_equal(_m_parent(h3),h.a);
    spec_is_equal(_m_children(h),3);
    spec_is_equal(*(int *)_m_surface(h3),101);

    // test next sibling
    spec_is_maddr_equal(_m_next_sibling(h1),h2.a);
    spec_is_maddr_equal(_m_next_sibling(h2),h3.a);
    spec_is_maddr_equal(_m_next_sibling(h3),null_H.a);
    spec_is_maddr_equal(_m_next_sibling(h),null_H.a);

    h21.a = _m_child(h2,1); // we have to do this because the h21 handle is stale
    spec_is_maddr_equal(_m_next_sibling(h21),h22.a);
    spec_is_maddr_equal(_m_next_sibling(h11),null_H.a);

    // test add
    H h12 = _m_new(null_H,TEST_TREE_SYMBOL,"t12",4);
    spec_is_str_equal((char *)_m_surface(h12),"t12");
    _m_new(h12,TEST_STR_SYMBOL,"t121",5);
    H h221 = _m_new(h22,TEST_STR_SYMBOL,"t221",5);
    spec_is_equal(h221.a.l,3);
    spec_is_equal(h221.a.i,0);  //should be first and only node on third level
    spec_is_equal(GET_LEVEL(h221)->nodes,1);

    //mtd(h);
    char buf[2000] ={0};
    Maddr ac = {0,0};

    _m_walk(h,_walkfn,buf);
    spec_is_str_equal(buf,"0.0, 1.0, 2.1, 1.1, 2.0, 2.2, 3.0, 1.2, ");

    h12 = _m_add(h1,h12);
    spec_is_equal(h12.a.l,2);
    spec_is_equal(h12.a.i,3);  //should have been appended
    // mtd(h);
    spec_is_equal(_m_children(h1),2);
    spec_is_maddr_equal(_m_child(h1,2),h12.a);
    h22.a = _m_child(h2,2);
    spec_is_equal(h22.a.l,2);
    spec_is_equal(h22.a.i,2);  //should remain the same

    spec_is_equal(GET_LEVEL(h221)->nodes,2);
    spec_is_str_equal((char *)_m_surface(h221),"t221");

    h221.a = _m_child(h22,1);
    spec_is_str_equal((char *)_m_surface(h221),"t221");

    H h121;
    h121.m = h.m;
    h121.a = _m_child(h12,1);
    char *xx = (char *)_m_surface(h121);
    spec_is_str_equal(xx,"t121");
    spec_is_equal(h121.a.l,3);
    spec_is_equal(h121.a.i,1);  //should be last because it was appended by add


    //S *s = _m_serialize(h.m);
    //    writeFile("web/test1.cmt",s,size);
    //free(s);

    buf[0] = 0;
    _m_walk(h2,_walkfn,buf);
    spec_is_str_equal(buf,"1.1, 2.0, 2.2, 3.0, ");

    spec_is_equal(_m_children(h),3);
    h2 = _m_detatch(h2);
    spec_is_maddr_equal(_m_parent(h2),null_H.a);
    //    mtd(h2);
    //    mtd(h);

    spec_is_true(h2.m != h.m);
    spec_is_equal(_m_children(h2),2);
    spec_is_equal(_m_children(h),2);
    _m_free(h2);

    _m_free(h);
}

void testMTreeOrthogonal() {
    H h = _m_new(null_H,TEST_STR_SYMBOL,"hello",6);
    H h1 = _m_newi(null_H,TEST_INT_SYMBOL,314);
    _m_newt(h,TEST_TREE_SYMBOL,h1);

    T *t = _t_new_from_m(h);
    spec_is_str_equal(t2s(t),"(TEST_STR_SYMBOL:hello (TEST_TREE_SYMBOL:{(TEST_INT_SYMBOL:314)}))");
    _m_free(h);

    // now make sure converting works for orthogonal trees in the other direction too.

    h = _m_new_from_t(t);
    _t_free(t);

    t = _t_new_from_m(h);
    spec_is_str_equal(t2s(t),"(TEST_STR_SYMBOL:hello (TEST_TREE_SYMBOL:{(TEST_INT_SYMBOL:314)}))");

    _t_free(t);
    _m_free(h);

}

void testMTreeReceptor() {
    Receptor *r = _r_new(G_sem,TEST_RECEPTOR);
    T *t = _t_newi(0,TEST_INT_SYMBOL,0);
    T *tr = _t_new_receptor(t,TEST_RECEPTOR,r);

    H hr = _m_new_from_t(tr);

    T *t2 = _t_new_from_m(hr);
    spec_is_ptr_equal(*(Receptor **)_m_surface(hr),r);
    spec_is_ptr_equal(_t_surface(t2),r);

    spec_is_str_equal(t2s(t2),"(TEST_RECEPTOR:{(RECEPTOR_INSTANCE (INSTANCE_OF:TEST_RECEPTOR) (CONTEXT_NUM:3) (PARENT_CONTEXT_NUM:0) (RECEPTOR_STATE (FLUX (DEFAULT_ASPECT (EXPECTATIONS) (SIGNALS))) (PENDING_SIGNALS) (PENDING_RESPONSES) (CONVERSATIONS) (RECEPTOR_ELAPSED_TIME:0)))})");

    _t_free(t);
    _t_free(t2);
    _m_free(hr);
}

void testMTreeWalk() {
    T *t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0
    // puts(__t2s(G_sem,t,INDENT));
    H h = _m_new_from_t(t);
    char buf[2000] ={0};
    Maddr ac = {0,0};
    _m_walk(h,_walkfn,buf);
    spec_is_str_equal(buf,"0.0, 1.0, 2.0, 2.1, 1.1, 1.2, 2.2, 3.0, 3.1, 2.3, 3.2, 3.3, 2.4, 3.4, 4.0, 5.0, 5.1, 4.1, 5.2, 5.3, ");

    //start walk from a node
    h.a.l = 1;
    h.a.i = 2;
    buf[0] = 0;
    _m_walk(h,_walkfn,buf);
    spec_is_str_equal(buf,"1.2, 2.2, 3.0, 3.1, 2.3, 3.2, 3.3, 2.4, 3.4, 4.0, 5.0, 5.1, 4.1, 5.2, 5.3, ");

    _m_free(h);
    _t_free(t);
}

void testTreeConvert() {
    T *t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0
    H h = _m_new_from_t(t);

    spec_is_symbol_equal(0,_m_symbol(h),HTTP_REQUEST_LINE);
    H hh = h;
    hh.a.l = 1;
    spec_is_symbol_equal(0,_m_symbol(hh),HTTP_REQUEST_VERSION);
    hh.a.l = 5;
    hh.a.i = 2;
    spec_is_str_equal((char *)_m_surface(hh),"page");
    //    mtd(h);
    //    puts(__t2s(G_sem,t,INDENT));
    T *t1 = _t_new_from_m(h);

    char buf[2000] = {0};
    char buf1[2000] = {0};

    __t_dump(G_sem,t,0,buf);
    __t_dump(G_sem,t1,0,buf1);

    spec_is_str_equal(buf1,buf);

    _m_free(h);
    _t_free(t);
    _t_free(t1);

    // test that converting run-trees works too

    T *n = _t_newr(0,ADD_INT);
    _t_newi(n,TEST_INT_SYMBOL,99);
    _t_newi(n,TEST_INT_SYMBOL,100);

    T *c = _t_rclone(n);
    t = _t_new_root(RUN_TREE);
    _t_add(t,c);

    h = _m_new_from_t(t);
    _t_free(t);
    t = _t_new_from_m(h);

    spec_is_str_equal(t2s(t),"(RUN_TREE (process:ADD_INT (TEST_INT_SYMBOL:99) (TEST_INT_SYMBOL:100)))");
    //debug_enable(D_REDUCE+D_REDUCEV);
    _p_reduce(G_sem,t);
    debug_disable(D_REDUCE+D_REDUCEV);
    spec_is_str_equal(t2s(t),"(RUN_TREE (TEST_INT_SYMBOL:199))");

    _m_free(h);
    _t_free(n);
    _t_free(t);
}

void testMTreeSerialize() {
    T *t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0
    H h = _m_new_from_t(t);

    S *s = _m_serialize(h.m);

    spec_is_equal(s->magic,h.m->magic);
    spec_is_equal(s->total_size,929);
    spec_is_equal(s->levels,h.m->levels);
    spec_is_equal(s->level_offsets[0],0);
    L *l = GET_LEVEL(h);
    spec_is_equal(s->level_offsets[1], (int)SERIALIZED_LEVEL_SIZE(l));

    H h1 = _m_unserialize(s);
    T *t1 = _t_new_from_m(h1);

    char buf[2000] = {0};
    char buf1[2000] = {0};

    __t_dump(G_sem,t,0,buf);
    __t_dump(G_sem,t1,0,buf1);

    spec_is_str_equal(buf1,buf);

    writeFile("web/test.cmt",s,s->total_size);
    _m_free(h);free(s);

    h = _m_new_from_t(__sem_get_defs(G_sem,SEM_TYPE_STRUCTURE,INTERNET_CONTEXT));
    s = _m_serialize(h.m);
    writeFile("web/httpstructures.cmt",s,s->total_size);
    _m_free(h);free(s);

    h = _m_new_from_t(__sem_get_defs(G_sem,SEM_TYPE_SYMBOL,INTERNET_CONTEXT));
    s = _m_serialize(h.m);
    writeFile("web/httpsymbols.cmt",s,s->total_size);
    _m_free(h);free(s);

    h = _m_new_from_t(__sem_get_defs(G_sem,SEM_TYPE_STRUCTURE,SYS_CONTEXT));
    s = _m_serialize(h.m);
    writeFile("web/sysstructures.cmt",s,s->total_size);
    _m_free(h);free(s);

    h = _m_new_from_t(__sem_get_defs(G_sem,SEM_TYPE_SYMBOL,SYS_CONTEXT));
    s = _m_serialize(h.m);
    writeFile("web/syssymbols.cmt",s,s->total_size);
    _m_free(h);free(s);

    _m_free(h1);
    _t_free(t1);
    _t_free(t);

    // test serialization of orthogonal trees
    h1 = _m_newr(null_H,ADD_INT);
    _m_newi(h1,TEST_INT_SYMBOL,314);
    _m_newi(h1,TEST_INT_SYMBOL,1000);
    H h2 = _m_newt(null_H,TEST_TREE_SYMBOL,h1);
    h = _m_newt(null_H,TEST_TREE_SYMBOL,h2);

    s = _m_serialize(h.m);
    h1 = _m_unserialize(s);
    t = _t_new_from_m(h1);

    spec_is_str_equal(t2s(t),"(TEST_TREE_SYMBOL:{(TEST_TREE_SYMBOL:{(process:ADD_INT (TEST_INT_SYMBOL:314) (TEST_INT_SYMBOL:1000))})})");

    free(s);
    _t_free(t);
    _m_free(h);
    _m_free(h1);
}


void testMTree() {
    testCreateTreeNodesM();
    testMTreeOrthogonal();
    testMTreeReceptor();
    testMTreeWalk();
    testTreeConvert();
    testMTreeSerialize();
}