static inline int print_packet(active_ring_t *aring, int perpacket,
char *buf, int buflen, int offset)
{
while (perpacket) {
if (!aring->active_head) {
aring->current++;
if (aring->current >= aring->max) aring->current = 0;
aring->active_head = aring->qset[aring->current].head;
aring->qset[aring->current].head = NULL;
aring->qset[aring->current].cnt = 0;
}
if (aring->active_head) {
active_el_t *el = aring->active_head;
aring->active_head = el->next;
print_el(aring,el,buf,buflen,&offset);
reset_el(aring,el);
perpacket--;
}
}
return offset;
}
/*
* A simple walk of event sets: dispatch and print a event SET every 2 sec
*/
void walk_el(int update_time, int time_between, int verb)
{
struct el *el;
struct es *es_hd;
struct es *es;
assert (g_el->next);
assert (get_myid >= 0);
print_el();
/* initialize link set, routing table, and routing table */
create_ls();
create_rt();
init_rt_from_n2h();
for (el = g_el->next ; el != g_el ; el = el->next) {
assert(el);
es_hd = el->es_head;
assert (es_hd);
int *updated = (int *) calloc(256, sizeof(int));
struct es *myCurrES = es_hd->next;
while(myCurrES->ev != _es_null){
if(myCurrES->ev == _es_link){
if(get_myid() == myCurrES->peer0){
update_rte(myCurrES->peer1, myCurrES->cost, myCurrES->peer1);
updated[myCurrES->peer1] = 1;
}else{
update_rte(myCurrES->peer0, myCurrES->cost, myCurrES->peer0);
updated[myCurrES->peer0] = 1;
}
}else if(myCurrES->ev == _td_link){
struct link *linkToTd = find_link(myCurrES->name);
if(get_myid() == linkToTd->peer0){
update_rte(linkToTd->peer1, -1, linkToTd->peer1);
updated[myCurrES->peer1] = 1;
}else{
update_rte(linkToTd->peer0, -1, linkToTd->peer0);
updated[myCurrES->peer0] = 1;
}
}else if(myCurrES->ev == _ud_link){
struct link *linkToUd = find_link(myCurrES->name);
if(get_myid() == linkToUd->peer0){
update_rte(linkToUd->peer1, myCurrES->cost, linkToUd->peer1);
updated[myCurrES->peer1] = 1;
}else{
update_rte(linkToUd->peer0, myCurrES->cost, linkToUd->peer0);
updated[myCurrES->peer0] = 1;
}
}
myCurrES = myCurrES->next;
}
printf("[es] >>>>>>>>>> Dispatch next event set <<<<<<<<<<<<<\n");
for (es=es_hd->next ; es!=es_hd ; es=es->next) {
printf("[es] Dispatching next event ... \n");
dispatch_event(es);
}
runDVA(updated, 1);
sleep(3);
printf("[es] >>>>>>> Start dumping data stuctures <<<<<<<<<<<\n");
print_n2h();
print_ls();
print_rt();
}
}
void parser(action *lexems, int size)
{
stack<StackType> stackMemory;
StackType buf;
buf.code = S;
buf.name = "";
stackMemory.push(buf);
int i = 0;
while(!stackMemory.empty())
{
bool flag = false, f = false;
buf = stackMemory.top();
if(i < size -1 ) print_el(array[i]), cout<<" ", print_el(array[i+1]);
else print_el(array[i]);
cout<<" ? ";
print_stack(stackMemory);
stackMemory.pop();
// cout<<" "<<lexems[i].id_name<<""<<endl;
if(lexems[i].code == buf.code)
{
if(lexems[i].code == id || lexems[i].code == lable) f = true, i++;
else if(lexems[i].id_name == buf.name) f = true, i++;
}
else
switch(buf.code)
{
f = false;
case S:
if(lexems[i].code == keyword && lexems[i].id_name == "$") return;
if(lexems[i].code == semicolon ) rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "dim" ) rules1(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "set") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "do") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "for") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "if") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "cin") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "cout") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "goto") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "fail") rules2(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "select") rules2(stackMemory), f = true;
if(lexems[i].code == lable) rules2(stackMemory), f = true;
if(!f) throw InvalidBegin();
break;
case X:
if(lexems[i].code == keyword && lexems[i].id_name == "dim" ) rules3(stackMemory), f = true;
if(!f) throw InvalidDeclaringVariables();
break;
case X1:
if(lexems[i].code == semicolon)
{
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "$" ) rules6(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "dim" ) rules7(stackMemory), f = true;
if(!f) rules8(stackMemory), f = true;
//if(lexems[i+1].code == keyword && lexems[i+1].id_name == "set") rules8(stackMemory), f = true;
// if(lexems[i+1].code != keyword) rules8(stackMemory), f = true;
//else rules8(stackMemory), f = true;
}
if(!f) throw InvalidType();
break;
case G:
if(lexems[i].code == id)
{
f = true;
if(lexems[i+1].code == coma) rules10(stackMemory);
else rules9(stackMemory);
}
if(!f) throw InvalidDeclaring();
break;
case TYPE:
if(lexems[i].code == keyword)
{
if(lexems[i].id_name == "BV") rules5(stackMemory), f = true;
if(lexems[i].id_name == "INT") rules4(stackMemory), f = true;
}
if(!f) throw InvalidType();
break;
case P:
if(lexems[i].code == semicolon )
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "$" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "case" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "ni" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "otherwise" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "while" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "od" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "else" ) rules11(stackMemory), f = true;
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "fi" ) rules11(stackMemory), f = true;
if(!f) rules12(stackMemory), f = true;
if(!f) throw InvalidEnd();
break;
case O:
if(lexems[i].code == semicolon )rules13(stackMemory), f = true;
// if(lexems[i].code == keyword && lexems[i].id_name == "case") rules13(stackMemory), f = true;
// if(lexems[i].code == keyword && lexems[i].id_name == "otherwise") rules13(stackMemory), f = true;
// if(lexems[i].code == keyword && lexems[i].id_name == "ni") rules13(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "set") rules14(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "do") rules15(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "for") rules27(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "if") rules30(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "cin") rules33(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "cout") rules36(stackMemory), f = true;
if(lexems[i].code == lable)
if(lexems[i+1].code == keyword && lexems[i+1].id_name == "$") rules39(stackMemory), f = true;
else rules40(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "goto") rules41(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "fail")
if(lexems[i+1].code == semicolon) rules42(stackMemory), f = true;
else rules43(stackMemory), f = true;
// cout<<lexems[i].id_name<<endl;
if(lexems[i].code == keyword && lexems[i].id_name == "select") rules44(stackMemory), f = true;
if(!f) throw InvalidOperator();
break;
case W:
if(lexems[i].code == semicolon) rules16(stackMemory), f = true;
if(lexems[i].code == lable) rules16(stackMemory), f = true;
if(lexems[i].code == keyword)
{
if(lexems[i].id_name == "set" || lexems[i].id_name == "do" || lexems[i].id_name == "for" ) rules16(stackMemory), f = true;
if(lexems[i].id_name == "cin" || lexems[i].id_name == "cout" ) rules16(stackMemory), f = true;
if(lexems[i].id_name == "while") rules17(stackMemory), f = true;
if(lexems[i].code == lable)rules16(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "goto") rules16(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "fail") rules16(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "select") rules16(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "if") rules16(stackMemory), f = true;
}
if(!f) throw InvalidOperatorWhile();
break;
case W1:
if(lexems[i].code == semicolon) rules18(stackMemory), f = true;
if(lexems[i].code == lable) rules18(stackMemory), f = true;
if(lexems[i].code == keyword)
{
if(lexems[i].id_name == "set" || lexems[i].id_name == "do"
|| lexems[i].id_name == "for" || lexems[i].id_name == "cout"
|| lexems[i].id_name == "cin" ) rules18(stackMemory), f = true;
if(lexems[i].id_name == "goto") rules18(stackMemory), f = true;
if(lexems[i].id_name == "if") rules18(stackMemory), f = true;
if(lexems[i].id_name == "fail") rules18(stackMemory), f = true;
if(lexems[i].id_name == "select") rules18(stackMemory), f = true;
if(lexems[i].id_name == "od") rules19(stackMemory), f = true;
}
if(!f) throw InvalidOperatorWhile();
break;
case T:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs || lexems[i].code == rs
|| lexems[i].code == ls) rules20(stackMemory), f = true;
if(!f) throw InvalidTest();
break;
case T1:
if(lexems[i].code == Equal) rules21(stackMemory), f = true;
if(lexems[i].code == not_equal) rules22(stackMemory), f = true;
if(lexems[i].code == more) rules23(stackMemory), f = true;
if(lexems[i].code == Less) rules24(stackMemory), f = true;
if(lexems[i].code == more_or_equal) rules25(stackMemory), f = true;
if(lexems[i].code == less_or_equal) rules26(stackMemory), f = true;
if(!f) throw InvalidRatio();
break;
case F:
if(lexems[i].code == keyword && lexems[i].id_name == "by") rules28(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "do") rules29(stackMemory), f = true;
if(!f) throw InvalidOperatorFor();
break;
case N:
if(lexems[i].code == keyword && lexems[i].id_name == "else") rules31(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "fi") rules32(stackMemory), f = true;
if(!f) throw InvalidOperatorIf();
break;
case I:
if(lexems[i].code == semicolon ) rules34(stackMemory), f = true;
if(lexems[i].code == in ) rules35(stackMemory), f = true;
if(!f) throw InvalidOperatorCin();
break;
case U:
if(lexems[i].code == semicolon ) rules37(stackMemory), f = true;
if(lexems[i].code == out ) rules38(stackMemory), f = true;
if(!f) throw InvalidOperatorCout();
break;
case K:
if(lexems[i].code == keyword && lexems[i].id_name == "case") rules45(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "otherwise") rules46(stackMemory), f = true;
if(lexems[i].code == keyword && lexems[i].id_name == "ni") rules47(stackMemory), f = true;
if(!f) throw InvalidOperatorSelect();
break;
case E:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs || lexems[i].code == rs
|| lexems[i].code == ls) rules48(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case A:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs || lexems[i].code == rs
|| lexems[i].code == ls) rules49(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case B:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs || lexems[i].code == rs
|| lexems[i].code == ls) rules50(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case D:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs || lexems[i].code == rs
|| lexems[i].code == ls) rules51(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case H:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs || lexems[i].code == rs
|| lexems[i].code == ls) rules52(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case J:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr
|| lexems[i].code == lfs ) rules55(stackMemory), f = true;
if(lexems[i].code == rs) rules53(stackMemory), f = true;
if(lexems[i].code == ls) rules54(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case L:
if(lexems[i].code == id || lexems[i].code == CONST
|| lexems[i].code == lbr || lexems[i].code == otr) rules57(stackMemory), f = true;
if(lexems[i].code == lfs) rules56(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case Z:
if(lexems[i].code == id) rules59(stackMemory), f = true;
if(lexems[i].code == CONST) rules60(stackMemory), f = true;
if(lexems[i].code == lbr) rules61(stackMemory), f = true;
if(lexems[i].code == otr) rules58(stackMemory), f = true;
if(!f) throw InvalidExpression();
break;
case ID:
if(lexems[i].code == id)
{
if(lexems[i+1].code == AND) rules77(stackMemory), f = true;
if(lexems[i+1].code == OR) rules78(stackMemory), f = true;
if(lexems[i+1].code == Xor) rules79(stackMemory), f = true;
if(lexems[i+1].code == ssh) rules80(stackMemory), f = true;
if(lexems[i+1].code == sl) rules81(stackMemory), f = true;
if(lexems[i+1].code == conc) rules82(stackMemory), f = true;
if(lexems[i+1].code == scolar) rules83(stackMemory), f = true;
if(lexems[i+1].code == sp) rules84(stackMemory), f = true;
if(lexems[i+1].code == multy) rules85(stackMemory), f = true;
if(lexems[i+1].code == DEV) rules86(stackMemory), f = true;
if(lexems[i+1].code == MOD) rules87(stackMemory), f = true;
if(lexems[i+1].code == add) rules88(stackMemory), f = true;
if(lexems[i+1].code == sub) rules89(stackMemory), f = true;
if(!f) rules90(stackMemory), f = true;
}
if(!f) throw InvalidExpression();
break;
case C:
if(lexems[i].code == CONST)
{
if(lexems[i+1].code == AND) rules92(stackMemory), f = true;
if(lexems[i+1].code == OR) rules93(stackMemory), f = true;
if(lexems[i+1].code == Xor) rules94(stackMemory), f = true;
if(lexems[i+1].code == ssh) rules95(stackMemory), f = true;
if(lexems[i+1].code == sl) rules96(stackMemory), f = true;
if(lexems[i+1].code == conc) rules97(stackMemory), f = true;
if(lexems[i+1].code == scolar) rules98(stackMemory), f = true;
if(lexems[i+1].code == sp) rules99(stackMemory), f = true;
if(lexems[i+1].code == multy) rules100(stackMemory), f = true;
if(lexems[i+1].code == DEV) rules101(stackMemory), f = true;
if(lexems[i+1].code == MOD) rules102(stackMemory), f = true;
if(lexems[i+1].code == add) rules103(stackMemory), f = true;
if(lexems[i+1].code == sub) rules104(stackMemory), f = true;
if(!f) rules105(stackMemory), f = true;
}
if(!f) throw InvalidExpression();
break;
case SH:
if(lexems[i].code == rbr)
{
if(lexems[i+1].code == AND) rules62(stackMemory), f = true;
if(lexems[i+1].code == OR) rules63(stackMemory), f = true;
if(lexems[i+1].code == Xor) rules64(stackMemory), f = true;
if(lexems[i+1].code == ssh) rules65(stackMemory), f = true;
if(lexems[i+1].code == sl) rules66(stackMemory), f = true;
if(lexems[i+1].code == conc) rules67(stackMemory), f = true;
if(lexems[i+1].code == scolar) rules68(stackMemory), f = true;
if(lexems[i+1].code == sp) rules69(stackMemory), f = true;
if(lexems[i+1].code == multy) rules70(stackMemory), f = true;
if(lexems[i+1].code == DEV) rules71(stackMemory), f = true;
if(lexems[i+1].code == MOD) rules72(stackMemory), f = true;
if(lexems[i+1].code == add) rules73(stackMemory), f = true;
if(lexems[i+1].code == sub) rules74(stackMemory), f = true;
if(!f) rules75(stackMemory), f = true;
}
if(!f) throw InvalidExpression();
break;
case G1:
if(lexems[i].code == id)
{
f = true;
if(lexems[i+1].code == coma) rules107(stackMemory);
else rules106(stackMemory);
}
if(!f) throw InvalidDeclaring();
break;
default: cout<<"ERRRRORRRRR"<<endl; return;
}
}
cout<<lexems[i].id_name<<""<<endl;
if(lexems[i].id_name == "$" && stackMemory.empty()) cout<<"acc"<<endl;
else cout<<"fail"<<endl;
}
