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