Lines Matching refs:printf
130 printf(":%s:L:", s->context->name); in AST_var()
132 printf("G:"); in AST_var()
134 printf("%s", s->name); /* array indices ignored */ in AST_var()
137 { printf(":"); in AST_var()
421 printf("%s -- (par) -- ", p->n->name); in AST_para()
423 printf(" => <<"); in AST_para()
427 printf(">>\n"); in AST_para()
440 printf("<<"); in AST_haschan()
442 printf(">>\n"); in AST_haschan()
478 printf("%s:", s->name);
561 printf("type = %d\n", t->step->n->ntyp); in AST_other()
572 { printf("\npossible aliases of "); in AST_aliases()
574 printf("\n\t"); in AST_aliases()
577 printf("no valid name "); in AST_aliases()
580 printf("<"); in AST_aliases()
581 if (ca->origin & 1) printf("RUN "); in AST_aliases()
582 if (ca->origin & 2) printf("ASGN "); in AST_aliases()
583 if (ca->origin & 4) printf("RCV "); in AST_aliases()
584 printf("[%s]", AST_isini(ca->cnm)?"Initzd":"Name"); in AST_aliases()
585 printf(">"); in AST_aliases()
586 if (ca->nxt) printf(", "); in AST_aliases()
588 printf("\n"); in AST_aliases()
590 printf("\n"); in AST_aliases()
606 { printf("\tDR %s [[ ", pn); in AST_indirect()
608 printf("]]\n\t\tfully relevant %s", cause); in AST_indirect()
609 if (uin) { printf(" due to "); AST_var(uin->n, uin->n->sym, 1); } in AST_indirect()
610 printf("\n"); in AST_indirect()
616 { printf("\t\t\tuses(%d): ", u->special); in AST_indirect()
618 printf("\n"); in AST_indirect()
678 { printf("<<ast_relevant (ntyp=%d) ", n->ntyp); in AST_relevant()
680 printf(">>\n"); in AST_relevant()
716 { printf("proctype %s relevant, due to symbol ", s); in AST_relpar()
718 printf("\n"); in AST_relpar()
818 printf("spin: redundant in proctype %s (for given property):\n", in AST_report()
821 printf(" %s:%d (state %d)", in AST_report()
825 printf(" ["); in AST_report()
827 printf("]\n"); in AST_report()
853 case 0: printf(" "); break; in AST_edge_dump()
854 case 1: printf("*%3d ", t->round); break; in AST_edge_dump()
855 case 2: printf("+%3d ", t->round); break; in AST_edge_dump()
856 case 3: printf("#%3d ", t->round); break; in AST_edge_dump()
857 default: printf("? "); break; in AST_edge_dump()
860 printf("%d\t->\t%d\t", f->from, t->to); in AST_edge_dump()
864 printf("Unless"); in AST_edge_dump()
867 { printf(" <"); in AST_edge_dump()
869 printf(":%d>", u->special); in AST_edge_dump()
871 printf("\n"); in AST_edge_dump()
921 printf("AST_START %s from %d\n", a->p->n->name, a->i_st); in AST_dump()
943 printf("%s -- (%d->%d) -- ", in AST_sends()
946 printf(" -> chanlist\n"); in AST_sends()
1009 printf("AST_name: "); in name_AST_track()
1011 printf(" -- %d\n", code); in name_AST_track()
1014 { printf("spin: error: DEF and USE of same var in rcv stmnt: "); in name_AST_track()
1016 printf(" -- %d\n", code); in name_AST_track()
1160 printf("AST_track, NOT EXPECTED ntyp: %d\n", now->ntyp); in AST_track()
1173 { printf("Relevant variables:\n"); in AST_dump_rel()
1175 { printf("\t"); in AST_dump_rel()
1177 printf("\n"); in AST_dump_rel()
1195 printf("spin: redundant vars (for given property):\n"); in AST_dump_rel()
1197 printf("\t"); in AST_dump_rel()
1222 printf("spin: consider using predicate"); in AST_suggestions()
1223 printf(" abstraction to replace:\n"); in AST_suggestions()
1225 printf("\t"); in AST_suggestions()
1265 { printf("spin: proctype %s defines a %s process\n", in AST_suggestions()
1270 { printf("spin: proctype %s mimics a buffer\n", in AST_suggestions()
1276 { printf("\tto reduce complexity, consider merging the code of\n"); in AST_suggestions()
1277 printf("\teach source process into the code of its target\n"); in AST_suggestions()
1280 { printf("\tto reduce complexity, consider merging the code of\n"); in AST_suggestions()
1281 printf("\teach sink process into the code of its source\n"); in AST_suggestions()
1284 printf("\tto reduce complexity, avoid buffer processes\n"); in AST_suggestions()
1334 { printf("spin: slice criterion "); in AST_data_dep()
1336 printf(" type=%d\n", Sym_typ(sc->n)); in AST_data_dep()
1473 { printf("spin: possibly redundant parameters in: "); in AST_shouldconsider()
1475 printf("\n"); in AST_shouldconsider()
1502 { printf("\t\t\t\tcritical(%d) ", t->relevant); in FSM_critical()
1504 printf("\n"); in FSM_critical()
1511 { printf("\t\t\t\tnot-crit "); in FSM_critical()
1513 printf("\n"); in FSM_critical()
1531 printf("CTL -- %s\n", a->p->n->name); in AST_ctrl()
1546 { printf("\tpremark "); in AST_ctrl()
1548 printf("\n"); in AST_ctrl()
1566 { printf("\t\tnomark "); in AST_ctrl()
1569 printf("\n"); in AST_ctrl()
1599 { printf("\t\t\tliftmark "); in AST_ctrl()
1602 printf("\n"); in AST_ctrl()
1659 printf("\n\nROUND %d -- changes %d\n", in AST_criteria()
1689 { printf("spin: warning: no slice criteria found (no assertions and no claim)\n"); in AST_slice()
1714 printf("spin: no redundancies found (for given property)\n"); in AST_slice()
1859 printf("\nExplicit List:\n"); in show_expl()
1863 printf("%s", t->relevant?"*":" "); in show_expl()
1864 printf("%3d", t->round); in show_expl()
1866 { printf("\t<"); in show_expl()
1868 printf(":%d>, ", u->special); in show_expl()
1870 printf("\n"); in show_expl()
1872 printf("==\n"); in show_expl()
1874 printf("End\n"); in show_expl()
1910 if (verbose&32) printf("X[%d:%d:%d] ", f->from, upto, f->scratch); in bad_scratch()
1914 printf("\tbad scratch: %d\n", f->from); in bad_scratch()
1965 printf(" inspect pair %d %d\n", p->b, p->h->from); in AST_checkpairs()
1968 printf("subgraph: %d .. %d\n", p->b, p->h->from); in AST_checkpairs()
1990 printf("possible pair %d %d -- %d\n", in subgraph()
2111 printf("Curtail %s:\n", a->p->n->name); in curtail()
2141 printf("prescratch %d -- %d %d %d %d -- %d\n", in curtail()
2150 printf("scratch %d -- %d %d %d %d\n", in curtail()
2284 { printf("%s (%d): ", a->p->n->name, a->i_st); in AST_dominant()
2285 printf("states=%d (max %d), words = %d, bpw %d, overflow %d\n", in AST_dominant()