dc45444e |
1 | #ifdef PEG |
2 | struct T_SRC { |
3 | char *fl; int ln; |
4 | } T_SRC[NTRANS]; |
5 | |
6 | void |
7 | tr_2_src(int m, char *file, int ln) |
8 | { T_SRC[m].fl = file; |
9 | T_SRC[m].ln = ln; |
10 | } |
11 | |
12 | void |
13 | putpeg(int n, int m) |
14 | { printf("%5d trans %4d ", m, n); |
15 | printf("file %s line %3d\n", |
16 | T_SRC[n].fl, T_SRC[n].ln); |
17 | } |
18 | #endif |
19 | |
20 | void |
21 | settable(void) |
22 | { Trans *T; |
23 | Trans *settr(int, int, int, int, int, char *, int, int, int); |
24 | |
25 | trans = (Trans ***) emalloc(7*sizeof(Trans **)); |
26 | |
27 | /* proctype 5: :never: */ |
28 | |
29 | trans[5] = (Trans **) emalloc(15*sizeof(Trans *)); |
30 | |
31 | T = trans[5][5] = settr(167,0,0,0,0,"IF", 0, 2, 0); |
32 | T = T->nxt = settr(167,0,1,0,0,"IF", 0, 2, 0); |
33 | T->nxt = settr(167,0,3,0,0,"IF", 0, 2, 0); |
34 | trans[5][1] = settr(163,0,13,3,0,"((((4+1)<=4)&&(events_lost!=0)))", 1, 2, 0); |
35 | trans[5][2] = settr(164,0,13,1,0,"goto accept_all", 0, 2, 0); |
36 | trans[5][6] = settr(168,0,11,1,0,".(goto)", 0, 2, 0); |
37 | trans[5][3] = settr(165,0,11,4,0,"(((4+1)<=4))", 0, 2, 0); |
38 | trans[5][4] = settr(166,0,11,1,0,"goto T0_S3", 0, 2, 0); |
39 | T = trans[5][11] = settr(173,0,0,0,0,"IF", 0, 2, 0); |
40 | T = T->nxt = settr(173,0,7,0,0,"IF", 0, 2, 0); |
41 | T->nxt = settr(173,0,9,0,0,"IF", 0, 2, 0); |
42 | trans[5][7] = settr(169,0,13,5,0,"((events_lost!=0))", 1, 2, 0); |
43 | trans[5][8] = settr(170,0,13,1,0,"goto accept_all", 0, 2, 0); |
44 | trans[5][12] = settr(174,0,13,1,0,".(goto)", 0, 2, 0); |
45 | trans[5][9] = settr(171,0,11,1,0,"(1)", 0, 2, 0); |
46 | trans[5][10] = settr(172,0,11,1,0,"goto T0_S3", 0, 2, 0); |
47 | trans[5][13] = settr(175,0,14,1,0,"(1)", 0, 2, 0); |
48 | trans[5][14] = settr(176,0,0,6,6,"-end-", 0, 3500, 0); |
49 | |
50 | /* proctype 4: :init: */ |
51 | |
52 | trans[4] = (Trans **) emalloc(44*sizeof(Trans *)); |
53 | |
54 | T = trans[ 4][42] = settr(161,2,0,0,0,"ATOMIC", 1, 2, 0); |
55 | T->nxt = settr(161,2,1,0,0,"ATOMIC", 1, 2, 0); |
56 | trans[4][1] = settr(120,2,7,7,7,"i = 0", 1, 2, 0); |
57 | trans[4][8] = settr(127,2,7,1,0,".(goto)", 1, 2, 0); |
58 | T = trans[4][7] = settr(126,2,0,0,0,"DO", 1, 2, 0); |
59 | T = T->nxt = settr(126,2,2,0,0,"DO", 1, 2, 0); |
60 | T->nxt = settr(126,2,5,0,0,"DO", 1, 2, 0); |
61 | trans[4][2] = settr(121,2,7,8,8,"((i<2))", 1, 2, 0); /* m: 3 -> 7,0 */ |
62 | reached4[3] = 1; |
63 | trans[4][3] = settr(0,0,0,0,0,"commit_count[i] = 0",0,0,0); |
64 | trans[4][4] = settr(0,0,0,0,0,"i = (i+1)",0,0,0); |
65 | trans[4][5] = settr(124,2,17,9,9,"((i>=2))", 1, 2, 0); /* m: 10 -> 17,0 */ |
66 | reached4[10] = 1; |
67 | trans[4][6] = settr(125,2,10,1,0,"goto :b6", 1, 2, 0); /* m: 10 -> 0,17 */ |
68 | reached4[10] = 1; |
69 | trans[4][9] = settr(128,2,10,1,0,"break", 1, 2, 0); |
70 | trans[4][10] = settr(129,2,17,10,10,"_commit_sum = 0", 1, 2, 0); /* m: 11 -> 0,17 */ |
71 | reached4[11] = 1; |
72 | trans[4][11] = settr(0,0,0,0,0,"i = 0",0,0,0); |
73 | trans[4][18] = settr(137,2,17,1,0,".(goto)", 1, 2, 0); |
74 | T = trans[4][17] = settr(136,2,0,0,0,"DO", 1, 2, 0); |
75 | T = T->nxt = settr(136,2,12,0,0,"DO", 1, 2, 0); |
76 | T->nxt = settr(136,2,15,0,0,"DO", 1, 2, 0); |
77 | trans[4][12] = settr(131,2,17,11,11,"((i<4))", 1, 2, 0); /* m: 13 -> 17,0 */ |
78 | reached4[13] = 1; |
79 | trans[4][13] = settr(0,0,0,0,0,"buffer_use[i] = 0",0,0,0); |
80 | trans[4][14] = settr(0,0,0,0,0,"i = (i+1)",0,0,0); |
81 | trans[4][15] = settr(134,2,20,12,12,"((i>=4))", 1, 2, 0); |
82 | trans[4][16] = settr(135,2,20,1,0,"goto :b7", 1, 2, 0); |
83 | trans[4][19] = settr(138,2,20,1,0,"break", 1, 2, 0); |
84 | trans[4][20] = settr(139,2,21,13,13,"(run reader())", 1, 2, 0); |
85 | trans[4][21] = settr(140,2,29,14,14,"(run cleaner())", 1, 2, 0); /* m: 22 -> 29,0 */ |
86 | reached4[22] = 1; |
87 | trans[4][22] = settr(0,0,0,0,0,"i = 0",0,0,0); |
88 | trans[4][30] = settr(149,2,29,1,0,".(goto)", 1, 2, 0); |
89 | T = trans[4][29] = settr(148,2,0,0,0,"DO", 1, 2, 0); |
90 | T = T->nxt = settr(148,2,23,0,0,"DO", 1, 2, 0); |
91 | T->nxt = settr(148,2,27,0,0,"DO", 1, 2, 0); |
92 | trans[4][23] = settr(142,2,25,15,15,"((i<4))", 1, 2, 0); /* m: 24 -> 25,0 */ |
93 | reached4[24] = 1; |
94 | trans[4][24] = settr(0,0,0,0,0,"refcount = (refcount+1)",0,0,0); |
95 | trans[4][25] = settr(144,2,29,16,16,"(run tracer())", 1, 2, 0); /* m: 26 -> 29,0 */ |
96 | reached4[26] = 1; |
97 | trans[4][26] = settr(0,0,0,0,0,"i = (i+1)",0,0,0); |
98 | trans[4][27] = settr(146,2,39,17,17,"((i>=4))", 1, 2, 0); /* m: 32 -> 39,0 */ |
99 | reached4[32] = 1; |
100 | trans[4][28] = settr(147,2,32,1,0,"goto :b8", 1, 2, 0); /* m: 32 -> 0,39 */ |
101 | reached4[32] = 1; |
102 | trans[4][31] = settr(150,2,32,1,0,"break", 1, 2, 0); |
103 | trans[4][32] = settr(151,2,39,18,18,"i = 0", 1, 2, 0); |
104 | trans[4][40] = settr(159,2,39,1,0,".(goto)", 1, 2, 0); |
105 | T = trans[4][39] = settr(158,2,0,0,0,"DO", 1, 2, 0); |
106 | T = T->nxt = settr(158,2,33,0,0,"DO", 1, 2, 0); |
107 | T->nxt = settr(158,2,37,0,0,"DO", 1, 2, 0); |
108 | trans[4][33] = settr(152,2,35,19,19,"((i<1))", 1, 2, 0); /* m: 34 -> 35,0 */ |
109 | reached4[34] = 1; |
110 | trans[4][34] = settr(0,0,0,0,0,"refcount = (refcount+1)",0,0,0); |
111 | trans[4][35] = settr(154,2,39,20,20,"(run switcher())", 1, 2, 0); /* m: 36 -> 39,0 */ |
112 | reached4[36] = 1; |
113 | trans[4][36] = settr(0,0,0,0,0,"i = (i+1)",0,0,0); |
114 | trans[4][37] = settr(156,2,41,21,21,"((i>=1))", 1, 2, 0); /* m: 38 -> 41,0 */ |
115 | reached4[38] = 1; |
116 | trans[4][38] = settr(157,2,41,1,0,"goto :b9", 1, 2, 0); |
117 | trans[4][41] = settr(160,0,43,1,0,"break", 1, 2, 0); |
118 | trans[4][43] = settr(162,0,0,22,22,"-end-", 0, 3500, 0); |
119 | |
120 | /* proctype 3: cleaner */ |
121 | |
122 | trans[3] = (Trans **) emalloc(10*sizeof(Trans *)); |
123 | |
124 | T = trans[ 3][8] = settr(118,2,0,0,0,"ATOMIC", 1, 2, 0); |
125 | T->nxt = settr(118,2,5,0,0,"ATOMIC", 1, 2, 0); |
126 | trans[3][6] = settr(116,2,5,1,0,".(goto)", 1, 2, 0); |
127 | T = trans[3][5] = settr(115,2,0,0,0,"DO", 1, 2, 0); |
128 | T->nxt = settr(115,2,1,0,0,"DO", 1, 2, 0); |
129 | trans[3][1] = settr(111,2,3,23,23,"((refcount==0))", 1, 2, 0); /* m: 2 -> 3,0 */ |
130 | reached3[2] = 1; |
131 | trans[3][2] = settr(0,0,0,0,0,"refcount = (refcount+1)",0,0,0); |
132 | trans[3][3] = settr(113,2,7,24,24,"(run switcher())", 1, 2, 0); /* m: 4 -> 7,0 */ |
133 | reached3[4] = 1; |
134 | trans[3][4] = settr(114,2,7,1,0,"goto :b5", 1, 2, 0); |
135 | trans[3][7] = settr(117,0,9,1,0,"break", 1, 2, 0); |
136 | trans[3][9] = settr(119,0,0,25,25,"-end-", 0, 3500, 0); |
137 | |
138 | /* proctype 2: reader */ |
139 | |
140 | trans[2] = (Trans **) emalloc(30*sizeof(Trans *)); |
141 | |
142 | trans[2][27] = settr(108,0,26,1,0,".(goto)", 0, 2, 0); |
143 | T = trans[2][26] = settr(107,0,0,0,0,"DO", 0, 2, 0); |
144 | T = T->nxt = settr(107,0,1,0,0,"DO", 0, 2, 0); |
145 | T->nxt = settr(107,0,24,0,0,"DO", 0, 2, 0); |
146 | trans[2][1] = settr(82,0,12,26,0,"((((((write_off/(4/2))-(read_off/(4/2)))>0)&&(((write_off/(4/2))-(read_off/(4/2)))<(255/2)))&&(((commit_count[((read_off%4)/(4/2))]-(4/2))-(((read_off/4)*4)/2))==0)))", 1, 2, 0); |
147 | T = trans[ 2][12] = settr(93,2,0,0,0,"ATOMIC", 1, 2, 0); |
148 | T->nxt = settr(93,2,2,0,0,"ATOMIC", 1, 2, 0); |
149 | trans[2][2] = settr(83,2,9,27,27,"i = 0", 1, 2, 0); |
150 | trans[2][10] = settr(91,2,9,1,0,".(goto)", 1, 2, 0); |
151 | T = trans[2][9] = settr(90,2,0,0,0,"DO", 1, 2, 0); |
152 | T = T->nxt = settr(90,2,3,0,0,"DO", 1, 2, 0); |
153 | T->nxt = settr(90,2,7,0,0,"DO", 1, 2, 0); |
154 | trans[2][3] = settr(84,2,9,28,28,"((i<(4/2)))", 1, 2, 0); /* m: 4 -> 9,0 */ |
155 | reached2[4] = 1; |
156 | trans[2][4] = settr(0,0,0,0,0,"assert((buffer_use[((read_off+i)%4)]==0))",0,0,0); |
157 | trans[2][5] = settr(0,0,0,0,0,"buffer_use[((read_off+i)%4)] = 1",0,0,0); |
158 | trans[2][6] = settr(0,0,0,0,0,"i = (i+1)",0,0,0); |
159 | trans[2][7] = settr(88,2,11,29,29,"((i>=(4/2)))", 1, 2, 0); /* m: 8 -> 11,0 */ |
160 | reached2[8] = 1; |
161 | trans[2][8] = settr(89,2,11,1,0,"goto :b3", 1, 2, 0); |
162 | trans[2][11] = settr(92,0,23,1,0,"break", 1, 2, 0); |
163 | T = trans[ 2][23] = settr(104,2,0,0,0,"ATOMIC", 1, 2, 0); |
164 | T->nxt = settr(104,2,13,0,0,"ATOMIC", 1, 2, 0); |
165 | trans[2][13] = /* c */ settr(94,2,19,27,27,"i = 0", 1, 2, 0); |
166 | trans[2][20] = settr(101,2,19,1,0,".(goto)", 1, 2, 0); |
167 | T = trans[2][19] = settr(100,2,0,0,0,"DO", 1, 2, 0); |
168 | T = T->nxt = settr(100,2,14,0,0,"DO", 1, 2, 0); |
169 | T->nxt = settr(100,2,17,0,0,"DO", 1, 2, 0); |
170 | trans[2][14] = settr(95,2,19,30,30,"((i<(4/2)))", 1, 2, 0); /* m: 15 -> 19,0 */ |
171 | reached2[15] = 1; |
172 | trans[2][15] = settr(0,0,0,0,0,"buffer_use[((read_off+i)%4)] = 0",0,0,0); |
173 | trans[2][16] = settr(0,0,0,0,0,"i = (i+1)",0,0,0); |
174 | trans[2][17] = settr(98,2,21,31,31,"((i>=(4/2)))", 1, 2, 0); |
175 | trans[2][18] = settr(99,2,21,1,0,"goto :b4", 1, 2, 0); |
176 | trans[2][21] = settr(102,2,22,1,0,"break", 1, 2, 0); |
177 | trans[2][22] = settr(103,0,26,32,32,"read_off = (read_off+(4/2))", 1, 2, 0); |
178 | trans[2][24] = settr(105,0,29,33,0,"((read_off>=(4-events_lost)))", 1, 2, 0); |
179 | trans[2][25] = settr(106,0,29,1,0,"goto :b2", 0, 2, 0); |
180 | trans[2][28] = settr(109,0,29,1,0,"break", 0, 2, 0); |
181 | trans[2][29] = settr(110,0,0,34,34,"-end-", 0, 3500, 0); |
182 | |
183 | /* proctype 1: tracer */ |
184 | |
185 | trans[1] = (Trans **) emalloc(52*sizeof(Trans *)); |
186 | |
187 | T = trans[ 1][3] = settr(33,2,0,0,0,"ATOMIC", 1, 2, 0); |
188 | T->nxt = settr(33,2,1,0,0,"ATOMIC", 1, 2, 0); |
189 | trans[1][1] = settr(31,4,10,35,35,"prev_off = write_off", 1, 2, 0); /* m: 2 -> 0,10 */ |
190 | reached1[2] = 1; |
191 | trans[1][2] = settr(0,0,0,0,0,"new_off = (prev_off+size)",0,0,0); |
192 | T = trans[ 1][10] = settr(40,2,0,0,0,"ATOMIC", 1, 2, 0); |
193 | T->nxt = settr(40,2,8,0,0,"ATOMIC", 1, 2, 0); |
194 | T = trans[1][8] = settr(38,2,0,0,0,"IF", 1, 2, 0); |
195 | T = T->nxt = settr(38,2,4,0,0,"IF", 1, 2, 0); |
196 | T->nxt = settr(38,2,6,0,0,"IF", 1, 2, 0); |
197 | trans[1][4] = settr(34,2,48,36,36,"((((new_off-read_off)>4)&&((new_off-read_off)<(255/2))))", 1, 2, 0); |
198 | trans[1][5] = settr(35,2,48,1,0,"goto lost", 1, 2, 0); |
199 | trans[1][9] = settr(39,0,27,1,0,".(goto)", 1, 2, 0); |
200 | trans[1][6] = settr(36,2,7,2,0,"else", 1, 2, 0); |
201 | trans[1][7] = settr(37,4,27,37,37,"(1)", 1, 2, 0); /* m: 9 -> 27,0 */ |
202 | reached1[9] = 1; |
203 | T = trans[ 1][27] = settr(57,2,0,0,0,"ATOMIC", 1, 2, 0); |
204 | T->nxt = settr(57,2,15,0,0,"ATOMIC", 1, 2, 0); |
205 | T = trans[1][15] = settr(45,2,0,0,0,"IF", 1, 2, 0); |
206 | T = T->nxt = settr(45,2,11,0,0,"IF", 1, 2, 0); |
207 | T->nxt = settr(45,2,13,0,0,"IF", 1, 2, 0); |
208 | trans[1][11] = settr(41,4,3,38,38,"((prev_off!=write_off))", 1, 2, 0); /* m: 12 -> 3,0 */ |
209 | reached1[12] = 1; |
210 | trans[1][12] = settr(42,0,3,1,0,"goto cmpxchg_loop", 1, 2, 0); |
211 | trans[1][16] = settr(46,2,17,1,0,".(goto)", 1, 2, 0); /* m: 17 -> 0,24 */ |
212 | reached1[17] = 1; |
213 | trans[1][13] = settr(43,2,14,2,0,"else", 1, 2, 0); |
214 | trans[1][14] = settr(44,2,24,39,39,"write_off = new_off", 1, 2, 0); /* m: 17 -> 0,24 */ |
215 | reached1[17] = 1; |
216 | trans[1][17] = settr(47,2,24,40,40,"i = 0", 1, 2, 0); |
217 | trans[1][25] = settr(55,2,24,1,0,".(goto)", 1, 2, 0); |
218 | T = trans[1][24] = settr(54,2,0,0,0,"DO", 1, 2, 0); |
219 | T = T->nxt = settr(54,2,18,0,0,"DO", 1, 2, 0); |
220 | T->nxt = settr(54,2,22,0,0,"DO", 1, 2, 0); |
221 | trans[1][18] = settr(48,2,24,41,41,"((i<size))", 1, 2, 0); /* m: 19 -> 24,0 */ |
222 | reached1[19] = 1; |
223 | trans[1][19] = settr(0,0,0,0,0,"assert((buffer_use[((prev_off+i)%4)]==0))",0,0,0); |
224 | trans[1][20] = settr(0,0,0,0,0,"buffer_use[((prev_off+i)%4)] = 1",0,0,0); |
225 | trans[1][21] = settr(0,0,0,0,0,"i = (i+1)",0,0,0); |
226 | trans[1][22] = settr(52,2,26,42,42,"((i>=size))", 1, 2, 0); /* m: 23 -> 26,0 */ |
227 | reached1[23] = 1; |
228 | trans[1][23] = settr(53,2,26,1,0,"goto :b0", 1, 2, 0); |
229 | trans[1][26] = settr(56,0,46,1,0,"break", 1, 2, 0); |
230 | T = trans[ 1][46] = settr(76,2,0,0,0,"ATOMIC", 1, 2, 0); |
231 | T->nxt = settr(76,2,28,0,0,"ATOMIC", 1, 2, 0); |
232 | trans[1][28] = settr(58,2,34,43,43,"i = 0", 1, 2, 0); |
233 | trans[1][35] = settr(65,2,34,1,0,".(goto)", 1, 2, 0); |
234 | T = trans[1][34] = settr(64,2,0,0,0,"DO", 1, 2, 0); |
235 | T = T->nxt = settr(64,2,29,0,0,"DO", 1, 2, 0); |
236 | T->nxt = settr(64,2,32,0,0,"DO", 1, 2, 0); |
237 | trans[1][29] = settr(59,2,34,44,44,"((i<size))", 1, 2, 0); /* m: 30 -> 34,0 */ |
238 | reached1[30] = 1; |
239 | trans[1][30] = settr(0,0,0,0,0,"buffer_use[((prev_off+i)%4)] = 0",0,0,0); |
240 | trans[1][31] = settr(0,0,0,0,0,"i = (i+1)",0,0,0); |
241 | trans[1][32] = settr(62,2,44,45,45,"((i>=size))", 1, 2, 0); /* m: 37 -> 44,0 */ |
242 | reached1[37] = 1; |
243 | trans[1][33] = settr(63,2,37,1,0,"goto :b1", 1, 2, 0); /* m: 37 -> 0,44 */ |
244 | reached1[37] = 1; |
245 | trans[1][36] = settr(66,2,37,1,0,"break", 1, 2, 0); |
246 | trans[1][37] = settr(67,2,44,46,46,"tmp_commit = (commit_count[((prev_off%4)/(4/2))]+size)", 1, 2, 0); /* m: 38 -> 0,44 */ |
247 | reached1[38] = 1; |
248 | trans[1][38] = settr(0,0,0,0,0,"_commit_sum = ((_commit_sum-commit_count[((prev_off%4)/(4/2))])+tmp_commit)",0,0,0); |
249 | trans[1][39] = settr(0,0,0,0,0,"commit_count[((prev_off%4)/(4/2))] = tmp_commit",0,0,0); |
250 | T = trans[1][44] = settr(74,2,0,0,0,"IF", 1, 2, 0); |
251 | T = T->nxt = settr(74,2,40,0,0,"IF", 1, 2, 0); |
252 | T->nxt = settr(74,2,42,0,0,"IF", 1, 2, 0); |
253 | trans[1][40] = settr(70,4,50,47,47,"((((((prev_off/4)*4)/2)+(4/2))-tmp_commit))", 1, 2, 0); /* m: 41 -> 50,0 */ |
254 | reached1[41] = 1; |
255 | trans[1][41] = settr(0,0,0,0,0,"deliver = 1",0,0,0); |
256 | trans[1][45] = settr(75,0,50,48,48,".(goto)", 1, 2, 0); |
257 | trans[1][42] = settr(72,2,43,2,0,"else", 1, 2, 0); |
258 | trans[1][43] = settr(73,4,50,49,49,"(1)", 1, 2, 0); /* m: 45 -> 50,0 */ |
259 | reached1[45] = 1; |
260 | T = trans[ 1][50] = settr(80,2,0,0,0,"ATOMIC", 1, 2, 0); |
261 | T->nxt = settr(80,2,47,0,0,"ATOMIC", 1, 2, 0); |
262 | trans[1][47] = settr(77,2,49,1,0,"goto end", 1, 2, 0); |
263 | trans[1][48] = settr(78,2,49,50,50,"events_lost = (events_lost+1)", 1, 2, 0); |
264 | trans[1][49] = settr(79,0,51,51,51,"refcount = (refcount-1)", 1, 2, 0); |
265 | trans[1][51] = settr(81,0,0,52,52,"-end-", 0, 3500, 0); |
266 | |
267 | /* proctype 0: switcher */ |
268 | |
269 | trans[0] = (Trans **) emalloc(32*sizeof(Trans *)); |
270 | |
271 | T = trans[ 0][11] = settr(10,2,0,0,0,"ATOMIC", 1, 2, 0); |
272 | T->nxt = settr(10,2,1,0,0,"ATOMIC", 1, 2, 0); |
273 | trans[0][1] = settr(0,2,9,53,53,"prev_off = write_off", 1, 2, 0); /* m: 2 -> 0,9 */ |
274 | reached0[2] = 1; |
275 | trans[0][2] = settr(0,0,0,0,0,"size = ((4/2)-(prev_off%(4/2)))",0,0,0); |
276 | trans[0][3] = settr(0,0,0,0,0,"new_off = (prev_off+size)",0,0,0); |
277 | T = trans[0][9] = settr(8,2,0,0,0,"IF", 1, 2, 0); |
278 | T = T->nxt = settr(8,2,4,0,0,"IF", 1, 2, 0); |
279 | T->nxt = settr(8,2,7,0,0,"IF", 1, 2, 0); |
280 | trans[0][4] = settr(3,4,30,54,54,"(((((new_off-read_off)>4)&&((new_off-read_off)<(255/2)))||(size==(4/2))))", 1, 2, 0); /* m: 5 -> 30,0 */ |
281 | reached0[5] = 1; |
282 | trans[0][5] = settr(0,0,0,0,0,"refcount = (refcount-1)",0,0,0); |
283 | trans[0][6] = settr(5,0,30,1,0,"goto not_needed", 1, 2, 0); |
284 | trans[0][10] = settr(9,0,18,1,0,".(goto)", 1, 2, 0); |
285 | trans[0][7] = settr(6,2,8,2,0,"else", 1, 2, 0); |
286 | trans[0][8] = settr(7,4,18,55,55,"(1)", 1, 2, 0); /* m: 10 -> 18,0 */ |
287 | reached0[10] = 1; |
288 | T = trans[ 0][18] = settr(17,2,0,0,0,"ATOMIC", 1, 2, 0); |
289 | T->nxt = settr(17,2,16,0,0,"ATOMIC", 1, 2, 0); |
290 | T = trans[0][16] = settr(15,2,0,0,0,"IF", 1, 2, 0); |
291 | T = T->nxt = settr(15,2,12,0,0,"IF", 1, 2, 0); |
292 | T->nxt = settr(15,2,14,0,0,"IF", 1, 2, 0); |
293 | trans[0][12] = settr(11,4,11,56,56,"((prev_off!=write_off))", 1, 2, 0); /* m: 13 -> 11,0 */ |
294 | reached0[13] = 1; |
295 | trans[0][13] = settr(12,0,11,1,0,"goto cmpxchg_loop", 1, 2, 0); |
296 | trans[0][17] = settr(16,0,29,57,57,".(goto)", 1, 2, 0); |
297 | trans[0][14] = settr(13,2,15,2,0,"else", 1, 2, 0); |
298 | trans[0][15] = settr(14,4,29,58,58,"write_off = new_off", 1, 2, 0); /* m: 17 -> 0,29 */ |
299 | reached0[17] = 1; |
300 | T = trans[ 0][29] = settr(28,2,0,0,0,"ATOMIC", 1, 2, 0); |
301 | T->nxt = settr(28,2,19,0,0,"ATOMIC", 1, 2, 0); |
302 | trans[0][19] = settr(18,2,26,59,59,"tmp_commit = (commit_count[((prev_off%4)/(4/2))]+size)", 1, 2, 0); /* m: 20 -> 0,26 */ |
303 | reached0[20] = 1; |
304 | trans[0][20] = settr(0,0,0,0,0,"_commit_sum = ((_commit_sum-commit_count[((prev_off%4)/(4/2))])+tmp_commit)",0,0,0); |
305 | trans[0][21] = settr(0,0,0,0,0,"commit_count[((prev_off%4)/(4/2))] = tmp_commit",0,0,0); |
306 | T = trans[0][26] = settr(25,2,0,0,0,"IF", 1, 2, 0); |
307 | T = T->nxt = settr(25,2,22,0,0,"IF", 1, 2, 0); |
308 | T->nxt = settr(25,2,24,0,0,"IF", 1, 2, 0); |
309 | trans[0][22] = settr(21,4,30,60,60,"((((((prev_off/4)*4)/2)+(4/2))-tmp_commit))", 1, 2, 0); /* m: 23 -> 30,0 */ |
310 | reached0[23] = 1; |
311 | trans[0][23] = settr(0,0,0,0,0,"deliver = 1",0,0,0); |
312 | trans[0][27] = settr(26,4,30,61,61,".(goto)", 1, 2, 0); /* m: 28 -> 0,30 */ |
313 | reached0[28] = 1; |
314 | trans[0][24] = settr(23,2,25,2,0,"else", 1, 2, 0); |
315 | trans[0][25] = settr(24,4,30,62,62,"(1)", 1, 2, 0); /* m: 27 -> 30,0 */ |
316 | reached0[27] = 1; |
317 | trans[0][28] = settr(0,0,0,0,0,"refcount = (refcount-1)",0,0,0); |
318 | trans[0][30] = settr(29,0,31,1,0,"(1)", 0, 2, 0); |
319 | trans[0][31] = settr(30,0,0,63,63,"-end-", 0, 3500, 0); |
320 | /* np_ demon: */ |
321 | trans[_NP_] = (Trans **) emalloc(2*sizeof(Trans *)); |
322 | T = trans[_NP_][0] = settr(9997,0,1,_T5,0,"(np_)", 1,2,0); |
323 | T->nxt = settr(9998,0,0,_T2,0,"(1)", 0,2,0); |
324 | T = trans[_NP_][1] = settr(9999,0,1,_T5,0,"(np_)", 1,2,0); |
325 | } |
326 | |
327 | Trans * |
328 | settr( int t_id, int a, int b, int c, int d, |
329 | char *t, int g, int tpe0, int tpe1) |
330 | { Trans *tmp = (Trans *) emalloc(sizeof(Trans)); |
331 | |
332 | tmp->atom = a&(6|32); /* only (2|8|32) have meaning */ |
333 | if (!g) tmp->atom |= 8; /* no global references */ |
334 | tmp->st = b; |
335 | tmp->tpe[0] = tpe0; |
336 | tmp->tpe[1] = tpe1; |
337 | tmp->tp = t; |
338 | tmp->t_id = t_id; |
339 | tmp->forw = c; |
340 | tmp->back = d; |
341 | return tmp; |
342 | } |
343 | |
344 | Trans * |
345 | cpytr(Trans *a) |
346 | { Trans *tmp = (Trans *) emalloc(sizeof(Trans)); |
347 | |
348 | int i; |
349 | tmp->atom = a->atom; |
350 | tmp->st = a->st; |
351 | #ifdef HAS_UNLESS |
352 | tmp->e_trans = a->e_trans; |
353 | for (i = 0; i < HAS_UNLESS; i++) |
354 | tmp->escp[i] = a->escp[i]; |
355 | #endif |
356 | tmp->tpe[0] = a->tpe[0]; |
357 | tmp->tpe[1] = a->tpe[1]; |
358 | for (i = 0; i < 6; i++) |
359 | { tmp->qu[i] = a->qu[i]; |
360 | tmp->ty[i] = a->ty[i]; |
361 | } |
362 | tmp->tp = (char *) emalloc(strlen(a->tp)+1); |
363 | strcpy(tmp->tp, a->tp); |
364 | tmp->t_id = a->t_id; |
365 | tmp->forw = a->forw; |
366 | tmp->back = a->back; |
367 | return tmp; |
368 | } |
369 | |
370 | #ifndef NOREDUCE |
371 | int |
372 | srinc_set(int n) |
373 | { if (n <= 2) return LOCAL; |
374 | if (n <= 2+ DELTA) return Q_FULL_F; /* 's' or nfull */ |
375 | if (n <= 2+2*DELTA) return Q_EMPT_F; /* 'r' or nempty */ |
376 | if (n <= 2+3*DELTA) return Q_EMPT_T; /* empty */ |
377 | if (n <= 2+4*DELTA) return Q_FULL_T; /* full */ |
378 | if (n == 5*DELTA) return GLOBAL; |
379 | if (n == 6*DELTA) return TIMEOUT_F; |
380 | if (n == 7*DELTA) return ALPHA_F; |
381 | Uerror("cannot happen srinc_class"); |
382 | return BAD; |
383 | } |
384 | int |
385 | srunc(int n, int m) |
386 | { switch(m) { |
387 | case Q_FULL_F: return n-2; |
388 | case Q_EMPT_F: return n-2-DELTA; |
389 | case Q_EMPT_T: return n-2-2*DELTA; |
390 | case Q_FULL_T: return n-2-3*DELTA; |
391 | case ALPHA_F: |
392 | case TIMEOUT_F: return 257; /* non-zero, and > MAXQ */ |
393 | } |
394 | Uerror("cannot happen srunc"); |
395 | return 0; |
396 | } |
397 | #endif |
398 | int cnt; |
399 | #ifdef HAS_UNLESS |
400 | int |
401 | isthere(Trans *a, int b) |
402 | { Trans *t; |
403 | for (t = a; t; t = t->nxt) |
404 | if (t->t_id == b) |
405 | return 1; |
406 | return 0; |
407 | } |
408 | #endif |
409 | #ifndef NOREDUCE |
410 | int |
411 | mark_safety(Trans *t) /* for conditional safety */ |
412 | { int g = 0, i, j, k; |
413 | |
414 | if (!t) return 0; |
415 | if (t->qu[0]) |
416 | return (t->qu[1])?2:1; /* marked */ |
417 | |
418 | for (i = 0; i < 2; i++) |
419 | { j = srinc_set(t->tpe[i]); |
420 | if (j >= GLOBAL && j != ALPHA_F) |
421 | return -1; |
422 | if (j != LOCAL) |
423 | { k = srunc(t->tpe[i], j); |
424 | if (g == 0 |
425 | || t->qu[0] != k |
426 | || t->ty[0] != j) |
427 | { t->qu[g] = k; |
428 | t->ty[g] = j; |
429 | g++; |
430 | } } } |
431 | return g; |
432 | } |
433 | #endif |
434 | void |
435 | retrans(int n, int m, int is, short srcln[], uchar reach[], uchar lstate[]) |
436 | /* process n, with m states, is=initial state */ |
437 | { Trans *T0, *T1, *T2, *T3; |
438 | int i, k; |
439 | #ifndef NOREDUCE |
440 | int g, h, j, aa; |
441 | #endif |
442 | #ifdef HAS_UNLESS |
443 | int p; |
444 | #endif |
445 | if (state_tables >= 4) |
446 | { printf("STEP 1 proctype %s\n", |
447 | procname[n]); |
448 | for (i = 1; i < m; i++) |
449 | for (T0 = trans[n][i]; T0; T0 = T0->nxt) |
450 | crack(n, i, T0, srcln); |
451 | return; |
452 | } |
453 | do { |
454 | for (i = 1, cnt = 0; i < m; i++) |
455 | { T2 = trans[n][i]; |
456 | T1 = T2?T2->nxt:(Trans *)0; |
457 | /* prescan: */ for (T0 = T1; T0; T0 = T0->nxt) |
458 | /* choice in choice */ { if (T0->st && trans[n][T0->st] |
459 | && trans[n][T0->st]->nxt) |
460 | break; |
461 | } |
462 | #if 0 |
463 | if (T0) |
464 | printf("\tstate %d / %d: choice in choice\n", |
465 | i, T0->st); |
466 | #endif |
467 | if (T0) |
468 | for (T0 = T1; T0; T0 = T0->nxt) |
469 | { T3 = trans[n][T0->st]; |
470 | if (!T3->nxt) |
471 | { T2->nxt = cpytr(T0); |
472 | T2 = T2->nxt; |
473 | imed(T2, T0->st, n, i); |
474 | continue; |
475 | } |
476 | do { T3 = T3->nxt; |
477 | T2->nxt = cpytr(T3); |
478 | T2 = T2->nxt; |
479 | imed(T2, T0->st, n, i); |
480 | } while (T3->nxt); |
481 | cnt++; |
482 | } |
483 | } |
484 | } while (cnt); |
485 | if (state_tables >= 3) |
486 | { printf("STEP 2 proctype %s\n", |
487 | procname[n]); |
488 | for (i = 1; i < m; i++) |
489 | for (T0 = trans[n][i]; T0; T0 = T0->nxt) |
490 | crack(n, i, T0, srcln); |
491 | return; |
492 | } |
493 | for (i = 1; i < m; i++) |
494 | { if (trans[n][i] && trans[n][i]->nxt) /* optimize */ |
495 | { T1 = trans[n][i]->nxt; |
496 | #if 0 |
497 | printf("\t\tpull %d (%d) to %d\n", |
498 | T1->st, T1->forw, i); |
499 | #endif |
500 | if (!trans[n][T1->st]) continue; |
501 | T0 = cpytr(trans[n][T1->st]); |
502 | trans[n][i] = T0; |
503 | reach[T1->st] = 1; |
504 | imed(T0, T1->st, n, i); |
505 | for (T1 = T1->nxt; T1; T1 = T1->nxt) |
506 | { |
507 | #if 0 |
508 | printf("\t\tpull %d (%d) to %d\n", |
509 | T1->st, T1->forw, i); |
510 | #endif |
511 | if (!trans[n][T1->st]) continue; |
512 | T0->nxt = cpytr(trans[n][T1->st]); |
513 | T0 = T0->nxt; |
514 | reach[T1->st] = 1; |
515 | imed(T0, T1->st, n, i); |
516 | } } } |
517 | if (state_tables >= 2) |
518 | { printf("STEP 3 proctype %s\n", |
519 | procname[n]); |
520 | for (i = 1; i < m; i++) |
521 | for (T0 = trans[n][i]; T0; T0 = T0->nxt) |
522 | crack(n, i, T0, srcln); |
523 | return; |
524 | } |
525 | #ifdef HAS_UNLESS |
526 | for (i = 1; i < m; i++) |
527 | { if (!trans[n][i]) continue; |
528 | /* check for each state i if an |
529 | * escape to some state p is defined |
530 | * if so, copy and mark p's transitions |
531 | * and prepend them to the transition- |
532 | * list of state i |
533 | */ |
534 | if (!like_java) /* the default */ |
535 | { for (T0 = trans[n][i]; T0; T0 = T0->nxt) |
536 | for (k = HAS_UNLESS-1; k >= 0; k--) |
537 | { if (p = T0->escp[k]) |
538 | for (T1 = trans[n][p]; T1; T1 = T1->nxt) |
539 | { if (isthere(trans[n][i], T1->t_id)) |
540 | continue; |
541 | T2 = cpytr(T1); |
542 | T2->e_trans = p; |
543 | T2->nxt = trans[n][i]; |
544 | trans[n][i] = T2; |
545 | } } |
546 | } else /* outermost unless checked first */ |
547 | { Trans *T4; |
548 | T4 = T3 = (Trans *) 0; |
549 | for (T0 = trans[n][i]; T0; T0 = T0->nxt) |
550 | for (k = HAS_UNLESS-1; k >= 0; k--) |
551 | { if (p = T0->escp[k]) |
552 | for (T1 = trans[n][p]; T1; T1 = T1->nxt) |
553 | { if (isthere(trans[n][i], T1->t_id)) |
554 | continue; |
555 | T2 = cpytr(T1); |
556 | T2->nxt = (Trans *) 0; |
557 | T2->e_trans = p; |
558 | if (T3) T3->nxt = T2; |
559 | else T4 = T2; |
560 | T3 = T2; |
561 | } } |
562 | if (T4) |
563 | { T3->nxt = trans[n][i]; |
564 | trans[n][i] = T4; |
565 | } |
566 | } |
567 | } |
568 | #endif |
569 | #ifndef NOREDUCE |
570 | for (i = 1; i < m; i++) |
571 | { if (a_cycles) |
572 | { /* moves through these states are visible */ |
573 | #if PROG_LAB>0 && defined(HAS_NP) |
574 | if (progstate[n][i]) |
575 | goto degrade; |
576 | for (T1 = trans[n][i]; T1; T1 = T1->nxt) |
577 | if (progstate[n][T1->st]) |
578 | goto degrade; |
579 | #endif |
580 | if (accpstate[n][i] || visstate[n][i]) |
581 | goto degrade; |
582 | for (T1 = trans[n][i]; T1; T1 = T1->nxt) |
583 | if (accpstate[n][T1->st]) |
584 | goto degrade; |
585 | } |
586 | T1 = trans[n][i]; |
587 | if (!T1) continue; |
588 | g = mark_safety(T1); /* V3.3.1 */ |
589 | if (g < 0) goto degrade; /* global */ |
590 | /* check if mixing of guards preserves reduction */ |
591 | if (T1->nxt) |
592 | { k = 0; |
593 | for (T0 = T1; T0; T0 = T0->nxt) |
594 | { if (!(T0->atom&8)) |
595 | goto degrade; |
596 | for (aa = 0; aa < 2; aa++) |
597 | { j = srinc_set(T0->tpe[aa]); |
598 | if (j >= GLOBAL && j != ALPHA_F) |
599 | goto degrade; |
600 | if (T0->tpe[aa] |
601 | && T0->tpe[aa] |
602 | != T1->tpe[0]) |
603 | k = 1; |
604 | } } |
605 | /* g = 0; V3.3.1 */ |
606 | if (k) /* non-uniform selection */ |
607 | for (T0 = T1; T0; T0 = T0->nxt) |
608 | for (aa = 0; aa < 2; aa++) |
609 | { j = srinc_set(T0->tpe[aa]); |
610 | if (j != LOCAL) |
611 | { k = srunc(T0->tpe[aa], j); |
612 | for (h = 0; h < 6; h++) |
613 | if (T1->qu[h] == k |
614 | && T1->ty[h] == j) |
615 | break; |
616 | if (h >= 6) |
617 | { T1->qu[g%6] = k; |
618 | T1->ty[g%6] = j; |
619 | g++; |
620 | } } } |
621 | if (g > 6) |
622 | { T1->qu[0] = 0; /* turn it off */ |
623 | printf("pan: warning, line %d, ", |
624 | srcln[i]); |
625 | printf("too many stmnt types (%d)", |
626 | g); |
627 | printf(" in selection\n"); |
628 | goto degrade; |
629 | } |
630 | } |
631 | /* mark all options global if >=1 is global */ |
632 | for (T1 = trans[n][i]; T1; T1 = T1->nxt) |
633 | if (!(T1->atom&8)) break; |
634 | if (T1) |
635 | degrade: for (T1 = trans[n][i]; T1; T1 = T1->nxt) |
636 | T1->atom &= ~8; /* mark as unsafe */ |
637 | /* can only mix 'r's or 's's if on same chan */ |
638 | /* and not mixed with other local operations */ |
639 | T1 = trans[n][i]; |
640 | if (!T1 || T1->qu[0]) continue; |
641 | j = T1->tpe[0]; |
642 | if (T1->nxt && T1->atom&8) |
643 | { if (j == 5*DELTA) |
644 | { printf("warning: line %d ", srcln[i]); |
645 | printf("mixed condition "); |
646 | printf("(defeats reduction)\n"); |
647 | goto degrade; |
648 | } |
649 | for (T0 = T1; T0; T0 = T0->nxt) |
650 | for (aa = 0; aa < 2; aa++) |
651 | if (T0->tpe[aa] && T0->tpe[aa] != j) |
652 | { printf("warning: line %d ", srcln[i]); |
653 | printf("[%d-%d] mixed %stion ", |
654 | T0->tpe[aa], j, |
655 | (j==5*DELTA)?"condi":"selec"); |
656 | printf("(defeats reduction)\n"); |
657 | printf(" '%s' <-> '%s'\n", |
658 | T1->tp, T0->tp); |
659 | goto degrade; |
660 | } } |
661 | } |
662 | #endif |
663 | for (i = 1; i < m; i++) |
664 | { T2 = trans[n][i]; |
665 | if (!T2 |
666 | || T2->nxt |
667 | || strncmp(T2->tp, ".(goto)", 7) |
668 | || !stopstate[n][i]) |
669 | continue; |
670 | stopstate[n][T2->st] = 1; |
671 | } |
672 | if (state_tables) |
673 | { printf("proctype "); |
674 | if (!strcmp(procname[n], ":init:")) |
675 | printf("init\n"); |
676 | else |
677 | printf("%s\n", procname[n]); |
678 | for (i = 1; i < m; i++) |
679 | reach[i] = 1; |
680 | tagtable(n, m, is, srcln, reach); |
681 | } else |
682 | for (i = 1; i < m; i++) |
683 | { int nrelse; |
684 | if (strcmp(procname[n], ":never:") != 0) |
685 | { for (T0 = trans[n][i]; T0; T0 = T0->nxt) |
686 | { if (T0->st == i |
687 | && strcmp(T0->tp, "(1)") == 0) |
688 | { printf("error: proctype '%s' ", |
689 | procname[n]); |
690 | printf("line %d, state %d: has un", |
691 | srcln[i], i); |
692 | printf("conditional self-loop\n"); |
693 | pan_exit(1); |
694 | } } } |
695 | nrelse = 0; |
696 | for (T0 = trans[n][i]; T0; T0 = T0->nxt) |
697 | { if (strcmp(T0->tp, "else") == 0) |
698 | nrelse++; |
699 | } |
700 | if (nrelse > 1) |
701 | { printf("error: proctype '%s' state", |
702 | procname[n]); |
703 | printf(" %d, inherits %d", i, nrelse); |
704 | printf(" 'else' stmnts\n"); |
705 | pan_exit(1); |
706 | } } |
707 | if (!state_tables && strcmp(procname[n], ":never:") == 0) |
708 | { int h = 0; |
709 | for (i = 1; i < m; i++) |
710 | for (T0 = trans[n][i]; T0; T0 = T0->nxt) |
711 | if (T0->forw > h) h = T0->forw; |
712 | h++; |
713 | frm_st0 = (short *) emalloc(h * sizeof(short)); |
714 | for (i = 1; i < m; i++) |
715 | for (T0 = trans[n][i]; T0; T0 = T0->nxt) |
716 | frm_st0[T0->forw] = i; |
717 | } |
718 | #ifndef LOOPSTATE |
719 | if (state_tables) |
720 | #endif |
721 | do_dfs(n, m, is, srcln, reach, lstate); |
722 | #ifdef T_REVERSE |
723 | /* process n, with m states, is=initial state -- reverse list */ |
724 | if (!state_tables && strcmp(procname[n], ":never:") != 0) |
725 | { for (i = 1; i < m; i++) |
726 | { Trans *T4 = (Trans *) 0; |
727 | T1 = (Trans *) 0; |
728 | T2 = (Trans *) 0; |
729 | T3 = (Trans *) 0; |
730 | for (T0 = trans[n][i]; T0; T0 = T4) |
731 | { T4 = T0->nxt; |
732 | if (strcmp(T0->tp, "else") == 0) |
733 | { T3 = T0; |
734 | T0->nxt = (Trans *) 0; |
735 | } else |
736 | { T0->nxt = T1; |
737 | if (!T1) { T2 = T0; } |
738 | T1 = T0; |
739 | } } |
740 | if (T2 && T3) { T2->nxt = T3; } |
741 | trans[n][i] = T1; /* reversed -- else at end */ |
742 | } } |
743 | #endif |
744 | } |
745 | void |
746 | imed(Trans *T, int v, int n, int j) /* set intermediate state */ |
747 | { progstate[n][T->st] |= progstate[n][v]; |
748 | accpstate[n][T->st] |= accpstate[n][v]; |
749 | stopstate[n][T->st] |= stopstate[n][v]; |
750 | mapstate[n][j] = T->st; |
751 | } |
752 | void |
753 | tagtable(int n, int m, int is, short srcln[], uchar reach[]) |
754 | { Trans *z; |
755 | |
756 | if (is >= m || !trans[n][is] |
757 | || is <= 0 || reach[is] == 0) |
758 | return; |
759 | reach[is] = 0; |
760 | if (state_tables) |
761 | for (z = trans[n][is]; z; z = z->nxt) |
762 | crack(n, is, z, srcln); |
763 | for (z = trans[n][is]; z; z = z->nxt) |
764 | { |
765 | #ifdef HAS_UNLESS |
766 | int i, j; |
767 | #endif |
768 | tagtable(n, m, z->st, srcln, reach); |
769 | #ifdef HAS_UNLESS |
770 | for (i = 0; i < HAS_UNLESS; i++) |
771 | { j = trans[n][is]->escp[i]; |
772 | if (!j) break; |
773 | tagtable(n, m, j, srcln, reach); |
774 | } |
775 | #endif |
776 | } |
777 | } |
778 | void |
779 | dfs_table(int n, int m, int is, short srcln[], uchar reach[], uchar lstate[]) |
780 | { Trans *z; |
781 | |
782 | if (is >= m || is <= 0 || !trans[n][is]) |
783 | return; |
784 | if ((reach[is] & (4|8|16)) != 0) |
785 | { if ((reach[is] & (8|16)) == 16) /* on stack, not yet recorded */ |
786 | { lstate[is] = 1; |
787 | reach[is] |= 8; /* recorded */ |
788 | if (state_tables) |
789 | { printf("state %d line %d is a loopstate\n", is, srcln[is]); |
790 | } } |
791 | return; |
792 | } |
793 | reach[is] |= (4|16); /* visited | onstack */ |
794 | for (z = trans[n][is]; z; z = z->nxt) |
795 | { |
796 | #ifdef HAS_UNLESS |
797 | int i, j; |
798 | #endif |
799 | dfs_table(n, m, z->st, srcln, reach, lstate); |
800 | #ifdef HAS_UNLESS |
801 | for (i = 0; i < HAS_UNLESS; i++) |
802 | { j = trans[n][is]->escp[i]; |
803 | if (!j) break; |
804 | dfs_table(n, m, j, srcln, reach, lstate); |
805 | } |
806 | #endif |
807 | } |
808 | reach[is] &= ~16; /* no longer on stack */ |
809 | } |
810 | void |
811 | do_dfs(int n, int m, int is, short srcln[], uchar reach[], uchar lstate[]) |
812 | { int i; |
813 | dfs_table(n, m, is, srcln, reach, lstate); |
814 | for (i = 0; i < m; i++) |
815 | reach[i] &= ~(4|8|16); |
816 | } |
817 | void |
818 | crack(int n, int j, Trans *z, short srcln[]) |
819 | { int i; |
820 | |
821 | if (!z) return; |
822 | printf(" state %3d -(tr %3d)-> state %3d ", |
823 | j, z->forw, z->st); |
824 | printf("[id %3d tp %3d", z->t_id, z->tpe[0]); |
825 | if (z->tpe[1]) printf(",%d", z->tpe[1]); |
826 | #ifdef HAS_UNLESS |
827 | if (z->e_trans) |
828 | printf(" org %3d", z->e_trans); |
829 | else if (state_tables >= 2) |
830 | for (i = 0; i < HAS_UNLESS; i++) |
831 | { if (!z->escp[i]) break; |
832 | printf(" esc %d", z->escp[i]); |
833 | } |
834 | #endif |
835 | printf("]"); |
836 | printf(" [%s%s%s%s%s] line %d => ", |
837 | z->atom&6?"A":z->atom&32?"D":"-", |
838 | accpstate[n][j]?"a" :"-", |
839 | stopstate[n][j]?"e" : "-", |
840 | progstate[n][j]?"p" : "-", |
841 | z->atom & 8 ?"L":"G", |
842 | srcln[j]); |
843 | for (i = 0; z->tp[i]; i++) |
844 | if (z->tp[i] == '\n') |
845 | printf("\\n"); |
846 | else |
847 | putchar(z->tp[i]); |
848 | if (z->qu[0]) |
849 | { printf("\t["); |
850 | for (i = 0; i < 6; i++) |
851 | if (z->qu[i]) |
852 | printf("(%d,%d)", |
853 | z->qu[i], z->ty[i]); |
854 | printf("]"); |
855 | } |
856 | printf("\n"); |
857 | fflush(stdout); |
858 | } |
859 | |
860 | #ifdef VAR_RANGES |
861 | #define BYTESIZE 32 /* 2^8 : 2^3 = 256:8 = 32 */ |
862 | |
863 | typedef struct Vr_Ptr { |
864 | char *nm; |
865 | uchar vals[BYTESIZE]; |
866 | struct Vr_Ptr *nxt; |
867 | } Vr_Ptr; |
868 | Vr_Ptr *ranges = (Vr_Ptr *) 0; |
869 | |
870 | void |
871 | logval(char *s, int v) |
872 | { Vr_Ptr *tmp; |
873 | |
874 | if (v<0 || v > 255) return; |
875 | for (tmp = ranges; tmp; tmp = tmp->nxt) |
876 | if (!strcmp(tmp->nm, s)) |
877 | goto found; |
878 | tmp = (Vr_Ptr *) emalloc(sizeof(Vr_Ptr)); |
879 | tmp->nxt = ranges; |
880 | ranges = tmp; |
881 | tmp->nm = s; |
882 | found: |
883 | tmp->vals[(v)/8] |= 1<<((v)%8); |
884 | } |
885 | |
886 | void |
887 | dumpval(uchar X[], int range) |
888 | { int w, x, i, j = -1; |
889 | |
890 | for (w = i = 0; w < range; w++) |
891 | for (x = 0; x < 8; x++, i++) |
892 | { |
893 | from: if ((X[w] & (1<<x))) |
894 | { printf("%d", i); |
895 | j = i; |
896 | goto upto; |
897 | } } |
898 | return; |
899 | for (w = 0; w < range; w++) |
900 | for (x = 0; x < 8; x++, i++) |
901 | { |
902 | upto: if (!(X[w] & (1<<x))) |
903 | { if (i-1 == j) |
904 | printf(", "); |
905 | else |
906 | printf("-%d, ", i-1); |
907 | goto from; |
908 | } } |
909 | if (j >= 0 && j != 255) |
910 | printf("-255"); |
911 | } |
912 | |
913 | void |
914 | dumpranges(void) |
915 | { Vr_Ptr *tmp; |
916 | printf("\nValues assigned within "); |
917 | printf("interval [0..255]:\n"); |
918 | for (tmp = ranges; tmp; tmp = tmp->nxt) |
919 | { printf("\t%s\t: ", tmp->nm); |
920 | dumpval(tmp->vals, BYTESIZE); |
921 | printf("\n"); |
922 | } |
923 | } |
924 | #endif |