pangen3.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390
  1. /***** spin: pangen3.c *****/
  2. /* Copyright (c) 1991-2000 by Lucent Technologies - Bell Laboratories */
  3. /* All Rights Reserved. This software is for educational purposes only. */
  4. /* Permission is given to distribute this code provided that this intro- */
  5. /* ductory message is not removed and no monies are exchanged. */
  6. /* No guarantee is expressed or implied by the distribution of this code. */
  7. /* Software written by Gerard J. Holzmann as part of the book: */
  8. /* `Design and Validation of Computer Protocols,' ISBN 0-13-539925-4, */
  9. /* Prentice Hall, Englewood Cliffs, NJ, 07632. */
  10. /* Send bug-reports and/or questions to: gerard@research.bell-labs.com */
  11. #include "spin.h"
  12. #ifdef PC
  13. #include "y_tab.h"
  14. #else
  15. #include "y.tab.h"
  16. #endif
  17. extern FILE *th;
  18. extern int claimnr, eventmapnr;
  19. typedef struct SRC {
  20. short ln, st; /* linenr, statenr */
  21. Symbol *fn; /* filename */
  22. struct SRC *nxt;
  23. } SRC;
  24. static int col;
  25. static Symbol *lastfnm;
  26. static Symbol lastdef;
  27. static int lastfrom;
  28. static SRC *frst = (SRC *) 0;
  29. static SRC *skip = (SRC *) 0;
  30. extern void sr_mesg(FILE *, int, int);
  31. static void
  32. putnr(int n)
  33. {
  34. if (col++ == 8)
  35. { fprintf(th, "\n\t");
  36. col = 1;
  37. }
  38. fprintf(th, "%3d, ", n);
  39. }
  40. static void
  41. putfnm(int j, Symbol *s)
  42. {
  43. if (lastfnm && lastfnm == s && j != -1)
  44. return;
  45. if (lastfnm)
  46. fprintf(th, "{ %s, %d, %d },\n\t",
  47. lastfnm->name,
  48. lastfrom,
  49. j-1);
  50. lastfnm = s;
  51. lastfrom = j;
  52. }
  53. static void
  54. putfnm_flush(int j)
  55. {
  56. fprintf(th, "{ %s, %d, %d }\n",
  57. lastfnm->name,
  58. lastfrom, j);
  59. }
  60. void
  61. putskip(int m) /* states that need not be reached */
  62. { SRC *tmp;
  63. for (tmp = skip; tmp; tmp = tmp->nxt)
  64. if (tmp->st == m)
  65. return;
  66. tmp = (SRC *) emalloc(sizeof(SRC));
  67. tmp->st = (short) m;
  68. tmp->nxt = skip;
  69. skip = tmp;
  70. }
  71. void
  72. unskip(int m) /* a state that needs to be reached after all */
  73. { SRC *tmp, *lst=(SRC *)0;
  74. for (tmp = skip; tmp; lst = tmp, tmp = tmp->nxt)
  75. if (tmp->st == m)
  76. { if (tmp == skip)
  77. skip = skip->nxt;
  78. else
  79. lst->nxt = tmp->nxt;
  80. break;
  81. }
  82. }
  83. void
  84. putsrc(Element *e) /* match states to source lines */
  85. { SRC *tmp;
  86. int n, m;
  87. if (!e || !e->n) return;
  88. n = e->n->ln;
  89. m = e->seqno;
  90. for (tmp = frst; tmp; tmp = tmp->nxt)
  91. if (tmp->st == m)
  92. { if (tmp->ln != n || tmp->fn != e->n->fn)
  93. printf("putsrc mismatch %d - %d, file %s\n", n,
  94. tmp->ln, tmp->fn);
  95. return;
  96. }
  97. tmp = (SRC *) emalloc(sizeof(SRC));
  98. tmp->ln = (short) n;
  99. tmp->st = (short) m;
  100. tmp->fn = e->n->fn;
  101. tmp->nxt = frst;
  102. frst = tmp;
  103. }
  104. static void
  105. dumpskip(int n, int m)
  106. { SRC *tmp, *lst;
  107. int j;
  108. fprintf(th, "uchar reached%d [] = {\n\t", m);
  109. for (j = 0, col = 0; j <= n; j++)
  110. { lst = (SRC *) 0;
  111. for (tmp = skip; tmp; lst = tmp, tmp = tmp->nxt)
  112. if (tmp->st == j)
  113. { putnr(1);
  114. if (lst)
  115. lst->nxt = tmp->nxt;
  116. else
  117. skip = tmp->nxt;
  118. break;
  119. }
  120. if (!tmp)
  121. putnr(0);
  122. }
  123. fprintf(th, "};\n");
  124. if (m == claimnr)
  125. fprintf(th, "#define reached_claim reached%d\n", m);
  126. if (m == eventmapnr)
  127. fprintf(th, "#define reached_event reached%d\n", m);
  128. skip = (SRC *) 0;
  129. }
  130. void
  131. dumpsrc(int n, int m)
  132. { SRC *tmp, *lst;
  133. int j;
  134. fprintf(th, "short src_ln%d [] = {\n\t", m);
  135. for (j = 0, col = 0; j <= n; j++)
  136. { lst = (SRC *) 0;
  137. for (tmp = frst; tmp; lst = tmp, tmp = tmp->nxt)
  138. if (tmp->st == j)
  139. { putnr(tmp->ln);
  140. #if 0
  141. if (lst)
  142. lst->nxt = tmp->nxt;
  143. else
  144. frst = tmp->nxt;
  145. #endif
  146. break;
  147. }
  148. if (!tmp)
  149. putnr(0);
  150. }
  151. fprintf(th, "};\n");
  152. lastfnm = (Symbol *) 0;
  153. lastdef.name = "\"-\"";
  154. fprintf(th, "S_F_MAP src_file%d [] = {\n\t", m);
  155. for (j = 0, col = 0; j <= n; j++)
  156. { lst = (SRC *) 0;
  157. for (tmp = frst; tmp; lst = tmp, tmp = tmp->nxt)
  158. if (tmp->st == j)
  159. { putfnm(j, tmp->fn);
  160. if (lst)
  161. lst->nxt = tmp->nxt;
  162. else
  163. frst = tmp->nxt;
  164. break;
  165. }
  166. if (!tmp)
  167. putfnm(j, &lastdef);
  168. }
  169. putfnm_flush(j);
  170. fprintf(th, "};\n");
  171. if (m == claimnr)
  172. fprintf(th, "#define src_claim src_ln%d\n", m);
  173. if (m == eventmapnr)
  174. fprintf(th, "#define src_event src_ln%d\n", m);
  175. frst = (SRC *) 0;
  176. dumpskip(n, m);
  177. }
  178. #define Cat0(x) comwork(fd,now->lft,m); fprintf(fd, x); \
  179. comwork(fd,now->rgt,m)
  180. #define Cat1(x) fprintf(fd,"("); Cat0(x); fprintf(fd,")")
  181. #define Cat2(x,y) fprintf(fd,x); comwork(fd,y,m)
  182. #define Cat3(x,y,z) fprintf(fd,x); comwork(fd,y,m); fprintf(fd,z)
  183. static int
  184. symbolic(FILE *fd, Lextok *tv)
  185. { Lextok *n; extern Lextok *Mtype;
  186. int cnt = 1;
  187. if (tv->ismtyp)
  188. for (n = Mtype; n; n = n->rgt, cnt++)
  189. if (cnt == tv->val)
  190. { fprintf(fd, "%s", n->lft->sym->name);
  191. return 1;
  192. }
  193. return 0;
  194. }
  195. static void
  196. comwork(FILE *fd, Lextok *now, int m)
  197. { Lextok *v;
  198. int i, j;
  199. if (!now) { fprintf(fd, "0"); return; }
  200. switch (now->ntyp) {
  201. case CONST: sr_mesg(fd, now->val, now->ismtyp); break;
  202. case '!': Cat3("!(", now->lft, ")"); break;
  203. case UMIN: Cat3("-(", now->lft, ")"); break;
  204. case '~': Cat3("~(", now->lft, ")"); break;
  205. case '/': Cat1("/"); break;
  206. case '*': Cat1("*"); break;
  207. case '-': Cat1("-"); break;
  208. case '+': Cat1("+"); break;
  209. case '%': Cat1("%%"); break;
  210. case '&': Cat1("&"); break;
  211. case '^': Cat1("^"); break;
  212. case '|': Cat1("|"); break;
  213. case LE: Cat1("<="); break;
  214. case GE: Cat1(">="); break;
  215. case GT: Cat1(">"); break;
  216. case LT: Cat1("<"); break;
  217. case NE: Cat1("!="); break;
  218. case EQ: Cat1("=="); break;
  219. case OR: Cat1("||"); break;
  220. case AND: Cat1("&&"); break;
  221. case LSHIFT: Cat1("<<"); break;
  222. case RSHIFT: Cat1(">>"); break;
  223. case RUN: fprintf(fd, "run %s(", now->sym->name);
  224. for (v = now->lft; v; v = v->rgt)
  225. if (v == now->lft)
  226. { comwork(fd, v->lft, m);
  227. } else
  228. { Cat2(",", v->lft);
  229. }
  230. fprintf(fd, ")");
  231. break;
  232. case LEN: putname(fd, "len(", now->lft, m, ")");
  233. break;
  234. case FULL: putname(fd, "full(", now->lft, m, ")");
  235. break;
  236. case EMPTY: putname(fd, "empty(", now->lft, m, ")");
  237. break;
  238. case NFULL: putname(fd, "nfull(", now->lft, m, ")");
  239. break;
  240. case NEMPTY: putname(fd, "nempty(", now->lft, m, ")");
  241. break;
  242. case 's': putname(fd, "", now->lft, m, now->val?"!!":"!");
  243. for (v = now->rgt, i=0; v; v = v->rgt, i++)
  244. { if (v != now->rgt) fprintf(fd,",");
  245. if (!symbolic(fd, v->lft))
  246. comwork(fd,v->lft,m);
  247. }
  248. break;
  249. case 'r': putname(fd, "", now->lft, m, "?");
  250. switch (now->val) {
  251. case 0: break;
  252. case 1: fprintf(fd, "?"); break;
  253. case 2: fprintf(fd, "<"); break;
  254. case 3: fprintf(fd, "?<"); break;
  255. }
  256. for (v = now->rgt, i=0; v; v = v->rgt, i++)
  257. { if (v != now->rgt) fprintf(fd,",");
  258. if (!symbolic(fd, v->lft))
  259. comwork(fd,v->lft,m);
  260. }
  261. if (now->val >= 2)
  262. fprintf(fd, ">");
  263. break;
  264. case 'R': putname(fd, "", now->lft, m, now->val?"??[":"?[");
  265. for (v = now->rgt, i=0; v; v = v->rgt, i++)
  266. { if (v != now->rgt) fprintf(fd,",");
  267. if (!symbolic(fd, v->lft))
  268. comwork(fd,v->lft,m);
  269. }
  270. fprintf(fd, "]");
  271. break;
  272. case ENABLED: Cat3("enabled(", now->lft, ")");
  273. break;
  274. case EVAL: Cat3("eval(", now->lft, ")");
  275. break;
  276. case NONPROGRESS:
  277. fprintf(fd, "np_");
  278. break;
  279. case PC_VAL: Cat3("pc_value(", now->lft, ")");
  280. break;
  281. case 'c': Cat3("(", now->lft, ")");
  282. break;
  283. case '?': Cat3("( (", now->lft, ") -> ");
  284. Cat3("(", now->rgt->lft, ") : ");
  285. Cat3("(", now->rgt->rgt, ") )");
  286. break;
  287. case ASGN: comwork(fd,now->lft,m);
  288. fprintf(fd," = ");
  289. comwork(fd,now->rgt,m);
  290. break;
  291. case PRINT: { char c, buf[512];
  292. strncpy(buf, now->sym->name, 510);
  293. for (i = j = 0; i < 510; i++, j++)
  294. { c = now->sym->name[i];
  295. buf[j] = c;
  296. if (c == '\\') buf[++j] = c;
  297. if (c == '\"') buf[j] = '\'';
  298. if (c == '\0') break;
  299. }
  300. if (now->ntyp == PRINT)
  301. fprintf(fd, "printf");
  302. else
  303. fprintf(fd, "annotate");
  304. fprintf(fd, "(%s", buf);
  305. }
  306. for (v = now->lft; v; v = v->rgt)
  307. { Cat2(",", v->lft);
  308. }
  309. fprintf(fd, ")");
  310. break;
  311. case NAME: putname(fd, "", now, m, "");
  312. break;
  313. case 'p': putremote(fd, now, m);
  314. break;
  315. case 'q': fprintf(fd, "%s", now->sym->name);
  316. break;
  317. case ASSERT: Cat3("assert(", now->lft, ")");
  318. break;
  319. case '.': fprintf(fd, ".(goto)"); break;
  320. case GOTO: fprintf(fd, "goto %s", now->sym->name); break;
  321. case BREAK: fprintf(fd, "break"); break;
  322. case ELSE: fprintf(fd, "else"); break;
  323. case '@': fprintf(fd, "-end-"); break;
  324. case D_STEP: fprintf(fd, "D_STEP"); break;
  325. case ATOMIC: fprintf(fd, "ATOMIC"); break;
  326. case NON_ATOMIC: fprintf(fd, "sub-sequence"); break;
  327. case IF: fprintf(fd, "IF"); break;
  328. case DO: fprintf(fd, "DO"); break;
  329. case UNLESS: fprintf(fd, "unless"); break;
  330. case TIMEOUT: fprintf(fd, "timeout"); break;
  331. default: if (isprint(now->ntyp))
  332. fprintf(fd, "'%c'", now->ntyp);
  333. else
  334. fprintf(fd, "%d", now->ntyp);
  335. break;
  336. }
  337. }
  338. void
  339. comment(FILE *fd, Lextok *now, int m)
  340. { extern short terse, nocast;
  341. terse=nocast=1;
  342. comwork(fd, now, m);
  343. terse=nocast=0;
  344. }