int rpcbuf::read_request() {
if (!_mystream) {
return EOF;
}
if (!_actualWidth) {
char* orig = pptr();
const int length = 0;
mystream().width(FIELDWIDTH);
mystream() << length;
_actualWidth = pptr() - orig;
pbump(orig - pptr());
}
int navail = in_avail();
if (navail < _actualWidth) {
return EOF;
}
char* orig = gptr();
int length = 0;
mystream() >> length;
gbump(orig - gptr());
if (length <= 0) {
error("rpcbuf::read_request: zero or negative length");
return EOF;
}
if (length > ebuf() - eback() && !expand_g(length * 2)) {
error("rpcbuf::read_request: out of memory");
return EOF;
}
if (navail < length) {
return EOF;
} else {
return 0;
}
}
void
trans(Node *p)
{ Node *op;
Graph *g;
if (!p || tl_errs) return;
p = twocases(p);
if (tl_verbose || tl_terse)
{ fprintf(tl_out, "\t/* Normlzd: ");
dump(p);
fprintf(tl_out, " */\n");
}
if (tl_terse)
return;
op = dupnode(p);
ng(ZS, getsym(tl_lookup("init")), p, ZN, ZN);
while ((g = Nodes_Stack) != (Graph *) 0)
{ Nodes_Stack = g->nxt;
expand_g(g);
}
if (newstates)
return;
fixinit(p);
liveness(flatten(op)); /* was: liveness(op); */
mkbuchi();
if (tl_verbose)
{ printf("/*\n");
printf(" * %d states in Streett automaton\n", Base);
printf(" * %d Streett acceptance conditions\n", Max_Red);
printf(" * %d Buchi states\n", Total);
printf(" */\n");
}
}
