pangen3.c 8.7 KB

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