-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpan.c
14082 lines (13430 loc) · 323 KB
/
pan.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*** Generated by Spin Version 6.5.0 -- 1 July 2019 ***/
/*** From source: week7/zona_critica copy.pml ***/
#ifdef SC
#define _FILE_OFFSET_BITS 64
#endif
#include <stdio.h>
#include <signal.h>
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include <ctype.h>
#include <errno.h>
#if defined(WIN32) || defined(WIN64)
#include <time.h>
#else
#include <unistd.h>
#include <sys/times.h>
#endif
#include <sys/types.h>
#include <sys/stat.h>
#include <limits.h>
#include <fcntl.h>
#define Offsetof(X, Y) ((ulong)(&(((X *)0)->Y)))
#ifndef max
#define max(a,b) (((a)<(b)) ? (b) : (a))
#endif
#ifndef PRINTF
int Printf(const char *fmt, ...); /* prototype only */
#endif
#include "pan.h"
char *TrailFile = PanSource; /* default */
char *trailfilename;
#ifdef LOOPSTATE
double cnt_loops;
#endif
State A_Root; /* seed-state for cycles */
State now; /* the full state-vector */
#if NQS > 0
short q_flds[NQS+1];
short q_max[NQS+1];
#endif
#undef C_States
#if defined(C_States) && (HAS_TRACK==1)
void
c_update(uchar *p_t_r)
{
#ifdef VERBOSE
printf("c_update %p\n", p_t_r);
#endif
}
void
c_revert(uchar *p_t_r)
{
#ifdef VERBOSE
printf("c_revert %p\n", p_t_r);
#endif
}
#endif
void
globinit(void)
{
}
#if VECTORSZ>32000
extern int
#else
extern short
#endif
*proc_offset, *q_offset;
void
locinit1(int h)
{
}
void
locinit0(int h)
{
}
#ifdef RANDOMIZE
#define T_RAND RANDOMIZE
#endif
#ifdef CNTRSTACK
#define onstack_now() (LL[trpt->j6] && LL[trpt->j7])
#define onstack_put() LL[trpt->j6]++; LL[trpt->j7]++
#define onstack_zap() LL[trpt->j6]--; LL[trpt->j7]--
#endif
#if !defined(SAFETY) && !defined(NOCOMP)
#define V_A (((now._a_t&1)?2:1) << (now._a_t&2))
#define A_V (((now._a_t&1)?1:2) << (now._a_t&2))
int S_A = 0;
#else
#define V_A 0
#define A_V 0
#define S_A 0
#endif
#ifdef MA
#undef onstack_now
#undef onstack_put
#undef onstack_zap
#define onstack_put() ;
#define onstack_zap() g_store((char *) &now, vsize, 4)
#else
#if defined(FULLSTACK) && !defined(BITSTATE)
#define onstack_put() trpt->ostate = Lstate
#define onstack_zap() { \
if (trpt->ostate) \
trpt->ostate->tagged = \
(S_A)? (trpt->ostate->tagged&~V_A) : 0; \
}
#endif
#endif
H_el **H_tab, **S_Tab;
/* #ifndef BFS_PAR */
H_el *Lstate;
/* #endif */
Trail *trail, *trpt;
FILE *efd;
uchar *_this;
long maxdepth=10000;
long omaxdepth=10000;
#ifdef BCS
/* bitflags in trpt->bcs */
#define B_PHASE1 1
#define B_PHASE2 2
#define B_FORCED 4
int sched_max = 0;
#endif
double quota; /* time limit */
#if NCORE>1
long z_handoff = -1;
#endif
#ifdef SC
char *stackfile;
#endif
uchar *SS, *LL;
uchar reversing = 0;
uchar HASH_NR = 0;
double memcnt = (double) 0;
double memlim = (double) (1<<30); /* 1 GB */
#if NCORE>1
double mem_reserved = (double) 0;
#endif
/* for emalloc: */
static char *have;
static long left = 0L;
static double fragment = (double) 0;
static ulong grow;
unsigned int HASH_CONST[] = {
/* generated by hashgen 421 -- assumes 4 bytes per int */
0x100d4e63, 0x0fc22f87, 0xa7155c77, 0x78f2c3b9,
0xde32d207, 0xc27d305b, 0x1bb3fb2b, 0x2798c7a5,
0x9c675ffd, 0x777d9081, 0x07aef2f1, 0xae08922f,
0x5bd365b7, 0xed51c47b, 0x9b5aeea1, 0xbcc9d431,
0x396d8fff, 0xa2fd1367, 0x08616521, 0x5e84991f,
0x87495bc5, 0x2930039b, 0xceb6a593, 0xfe522d63,
0x7ff60baf, 0xf89b1fbf, 0x74c01755, 0xe0c559bf,
0x3669fc47, 0x8756d3bf, 0x14f78445, 0x24c41779,
0x0af7b129, 0xde22368d, 0x3e1c01e3, 0xaf773e49,
0x5b762459, 0x86d12911, 0x0953a3af, 0xb66dc23d,
0x96b3bd4f, 0x19b1dd51, 0xd886fbc3, 0xa7f3a025,
0xccb48e63, 0x87d8f027, 0x2bea270d, 0xdb0e9379,
0x78c09f21, 0x0cbbfe07, 0xea4bc7c3, 0x5bfbc3c9,
0x3c6e53fd, 0xab320cdd, 0x31041409, 0x416e7485,
0xe41d75fd, 0xc3c5060f, 0x201a9dc1, 0x93dee72b,
0x6461305f, 0xc571dec5, 0xa1fd21c5, 0xfb421ce1,
0x7f024b05, 0xfa518819, 0x6c9777fb, 0x0d4d9351,
0x08b33861, 0xccb9d0f3, 0x34112791, 0xe962d7c9,
0x8d742211, 0xcd9c47a1, 0x64437b69, 0x5fe40feb,
0x806113cb, 0x10e1d593, 0x821851b3, 0x057a1ff3,
0x8ededc0b, 0x90dd5b31, 0x635ff359, 0x68dbcd35,
0x1050ff4f, 0xdbb07257, 0x486336db, 0x83af1e75,
0x432f1799, 0xc1d0e7e7, 0x21f4eb5b, 0x881ec2c1,
0x23f3b539, 0x6cdfb80d, 0x71d474cf, 0x97d5d4a9,
0xf721d2e5, 0xb5ff3711, 0x3f2e58cd, 0x4e06e3d9,
0x7d711739, 0x927887df, 0x7d57ad71, 0x232eb767,
0xe3f5cc51, 0x6576b443, 0xed17bf1f, 0x8828b637,
0xc940f6ab, 0xc7b830ef, 0x11ed8a13, 0xaff20949,
0xf28a8465, 0x0da10cf9, 0xb512497d, 0x44accae1,
0x95e0929f, 0xe08c8901, 0xfd22d6c9, 0xb6a5c029,
0xaadb428d, 0x6e8a453d, 0x3d5c0195, 0x8bf4ae39,
0xbf83ab19, 0x3e9dac33, 0xc4df075d, 0x39472d71,
0xb8647725, 0x1a6d4887, 0x78a03577, 0xafd76ef7,
0xc1a1d6b3, 0x1afb33c5, 0x87896299, 0x5cc992ef,
0x7f805d0d, 0x089a039b, 0xa353cc27, 0x57b296b3,
0x52badec9, 0xc916e431, 0x09171957, 0x14996d51,
0xe87e32c7, 0xb4fdbb5d, 0xdd216a03, 0x4ddd3fff,
0x767d5c57, 0x79c97509, 0xab70543b, 0xc5feca4f,
0x8eb37b89, 0x20a2cefd, 0xf4b00b91, 0xf166593d,
0x7bf50f65, 0x753e6c8b, 0xfb5b81dd, 0xf2d45ef5,
0x9741c04f, 0x300da48d, 0x01dc4121, 0xa112cd47,
0x0223b24b, 0xa89fbce7, 0x681e1f7b, 0xe7c6aedf,
0x1fd3d523, 0x561ba723, 0xf54042fb, 0x1a516751,
0xcd085bd5, 0xe74246d5, 0x8b170b5d, 0x249985e9,
0x5b4d9cf7, 0xe9912323, 0x5fc0f339, 0x41f8f051,
0x8a296fb1, 0x62909f51, 0x2c05d695, 0x095efccb,
0xa91574f1, 0x0f5cc6c3, 0x23a2ca2b, 0xc6053ec1,
0xeb19e081, 0x3d1b3997, 0xb0c5f3cd, 0xe5d85b35,
0x1cb1bdf1, 0x0c8f278f, 0x518249c3, 0x9f61b68d,
0xade0919d, 0x779e29c3, 0xdbac9485, 0x2ce149a9,
0x254c2409, 0x205b34fb, 0xc8ab1a89, 0x6b4a2585,
0x2303d94b, 0x8fa186b9, 0x49826da5, 0xd23a37ad,
0x680b18c9, 0xa46fbd7f, 0xe42c2cf9, 0xf7cfcb5f,
0xb4842b8b, 0xe483780d, 0x66cf756b, 0x3eb73781,
0x41ca17a5, 0x59f91b0f, 0x92fb67d9, 0x0a5c330f,
0x46013fdb, 0x3b0634af, 0x9024f533, 0x96a001a7,
0x15bcd793, 0x3a311fb1, 0x78913b8b, 0x9d4a5ddf,
0x33189b31, 0xa99e8283, 0xf7cb29e9, 0x12d64a27,
0xeda770ff, 0xa7320297, 0xbd3c14a5, 0x96d0156f,
0x0115db95, 0x7f79f52b, 0xa6d52521, 0xa063d4bd,
0x9cb5e039, 0x42cf8195, 0xcb716835, 0x1bc21273,
0x5a67ad27, 0x4b3b0545, 0x162cda67, 0x0489166b,
0x85fd06a9, 0x562b037d, 0x995bc1f3, 0xe144e78b,
0x1e749f69, 0xa36df057, 0xcfee1667, 0x8c4116b7,
0x94647fe3, 0xe6899df7, 0x6d218981, 0xf1069079,
0xd1851a33, 0xf424fc83, 0x24467005, 0xad8caf59,
0x1ae5da13, 0x497612f9, 0x10f6d1ef, 0xeaf4ff05,
0x405f030b, 0x693b041d, 0x2065a645, 0x9fec71b3,
0xc3bd1b0f, 0xf29217a3, 0x0f25e15d, 0xd48c2b97,
0xce8acf2d, 0x0629489b, 0x1a5b0e01, 0x32d0c059,
0x2d3664bf, 0xc45f3833, 0xd57f551b, 0xbdd991c5,
0x9f97da9f, 0xa029c2a9, 0x5dd0cbdf, 0xe237ba41,
0x62bb0b59, 0x93e7d037, 0x7e495619, 0x51b8282f,
0x853e8ef3, 0x9b8abbeb, 0x055f66f9, 0x2736f7e5,
0x8d7e6353, 0x143abb65, 0x4e2bb5b3, 0x872e1adf,
0x8fcac853, 0xb7cf6e57, 0x12177f3d, 0x1d2da641,
0x07856425, 0xc0ed53dd, 0x252271d9, 0x79874843,
0x0aa8c9b5, 0x7e804f93, 0x2d080e09, 0x3929ddfd,
0x36433dbd, 0xd6568c17, 0xe624e939, 0xb33189ef,
0x29e68bff, 0x8aae2433, 0xe6335499, 0xc5facd9d,
0xbd5afc65, 0x7a584fa7, 0xab191435, 0x64bbdeef,
0x9f5cd8e1, 0xb3a1be05, 0xbd0c1753, 0xb00e2c7f,
0x6a96e315, 0x96a31589, 0x660af5af, 0xc0438d43,
0x17637373, 0x6460e8df, 0x7d458de9, 0xd76b923f,
0x316f045f, 0x3ccbd035, 0x63f64d81, 0xd990d969,
0x7c860a93, 0x99269ff7, 0x6fbcac8f, 0xd8cc562b,
0x67141071, 0x09f85ea3, 0x1298f2dd, 0x41fa86e5,
0xce1d7cf5, 0x6b232c9d, 0x8f093d4b, 0x3203ad4b,
0x07d70d5f, 0x38c44c75, 0x0887c9ef, 0x1833acf5,
0xa3607f85, 0x7d367573, 0x0ea4ffc3, 0xad2d09c1,
0x7a1e664f, 0xef41dff5, 0x03563491, 0x67f30a1f,
0x5ce5f9ef, 0xa2487a27, 0xe5077957, 0x9beb36fd,
0x16e41251, 0x216799ef, 0x07181f8d, 0xc191c3cf,
0xba21cab5, 0x73944eb7, 0xdf9eb69d, 0x5fef6cfd,
0xd750a6f5, 0x04f3fa43, 0x7cb2d063, 0xd3bdb369,
0x35f35981, 0x9f294633, 0x5e293517, 0x70e51d05,
0xf8db618d, 0x66ee05db, 0x835eaa77, 0x166a02c3,
0xb516f283, 0x94102293, 0x1ace50a5, 0x64072651,
0x66df7b75, 0x02e1b261, 0x8e6a73b9, 0x19dddfe7,
0xd551cf39, 0x391c17cb, 0xf4304de5, 0xcd67b8d1,
0x25873e8d, 0x115b4c71, 0x36e062f3, 0xaec0c7c9,
0xd929f79d, 0x935a661b, 0xda762b47, 0x170bd76b,
0x1a955cb5, 0x341fb0ef, 0x7f366cef, 0xc98f60c7,
0xa4181af3, 0xa94a8837, 0x5fa3bc43, 0x11c638c1,
0x4e66fabb, 0x30ab85cf, 0x250704ef, 0x8bf3bc07,
0x6d2cd5ab, 0x613ef9c3, 0xb8e62149, 0x0404fd91,
0xa04fd9b1, 0xa5e389eb, 0x9543bd23, 0xad6ca1f9,
0x210c49ab, 0xf8e9532b, 0x854fba89, 0xdc7fc6bb,
0x48a051a7, 0x6b2f383b, 0x61a4b433, 0xd3af231b,
0xc5023fc7, 0xa5aa85df, 0xa0cd1157, 0x4206f64d,
0x3fea31c3, 0x62d510a1, 0x13988957, 0x6a11a033,
0x46f2a3b7, 0x2784ef85, 0x229eb9eb, 0x9c0c3053,
0x5b7ead39, 0x82ae9afb, 0xf99e9fb3, 0x914b6459,
0xaf05edd7, 0xc82710dd, 0x8fc1ea1f, 0x7e0d7a8d,
0x7c7592e9, 0x65321017, 0xea57553f, 0x4aeb49ff,
0x5239ae4d, 0x4b4b4585, 0x94091c21, 0x7eaaf4cb,
0x6b489d6f, 0xecb9c0c3, 0x29a7af63, 0xaf117a0d,
0x969ea6cd, 0x7658a34d, 0x5fc0bba9, 0x26e99b7f,
0x7a6f260f, 0xe37c34f1, 0x1a1569bb, 0xc3bc7371,
0x8567543d, 0xad0c46a9, 0xa1264fd9, 0x16f10b29,
0x5e00dd3b, 0xf85b6bcd, 0xa2d32d8b, 0x4a3c8d43,
0x6b33b959, 0x4fd1e6c9, 0x7938b8a9, 0x1ec795c7,
0xe2ef3409, 0x83c16b9d, 0x0d3fd9eb, 0xeb461ad7,
0xb09c831d, 0xaf052001, 0x7911164d, 0x1a9dc191,
0xb52a0815, 0x0f732157, 0xc68c4831, 0x12cf3cbb };
#if NCORE>1
extern int core_id;
#endif
long mreached=0;
int done=0, errors=0, Nrun=1;
int c_init_done=0;
char *c_stack_start = (char *) 0;
double nstates=0, nlinks=0, truncs=0, truncs2=0;
double nlost=0, nShadow=0, hcmp=0, ngrabs=0;
#ifdef BFS_PAR
extern ulong bfs_punt;
#endif
#ifdef PUTPID
char *progname;
#endif
#if defined(ZAPH) && defined(BITSTATE)
double zstates = 0;
#endif
/* int c_init_run; */
#ifdef REVERSE
#define P_REVERSE
#endif
#ifdef T_REVERSE
int t_reverse = 1;
#else
int t_reverse = 0;
#endif
#ifdef BFS
double midrv=0, failedrv=0, revrv=0;
#endif
ulong nr_states=0; /* nodes in DFA */
long Fa=0, Fh=0, Zh=0, Zn=0;
long PUT=0, PROBE=0, ZAPS=0;
long Ccheck=0, Cholds=0;
int a_cycles=0, upto=1, strict=0, verbose = 0, signoff = 0;
#ifdef HAS_CODE
int gui = 0, coltrace = 0, readtrail = 0;
int whichtrail = 0, whichclaim = -1, onlyproc = -1, silent = 0;
char *claimname;
#endif
int state_tables=0, fairness=0, no_rck=0, Nr_Trails=0, dodot=0;
char simvals[256];
#ifndef INLINE
int TstOnly=0;
#endif
ulong mask, nmask;
#ifdef BITSTATE
int ssize=27; /* 16 Mb */
#else
int ssize=24; /* 16M slots */
#endif
int hmax=0, svmax=0, smax=0;
int Maxbody=0, XX;
uchar *noptr, *noqptr; /* used by Pptr(x) and Qptr(x) */
#ifdef VAR_RANGES
void logval(char *, int);
void dumpranges(void);
#endif
#ifdef MA
#define INLINE_REV
extern void dfa_init(unsigned short);
extern int dfa_member(ulong);
extern int dfa_store(uchar *);
unsigned int maxgs = 0;
#endif
#ifdef ALIGNED
State comp_now __attribute__ ((aligned (8)));
/* gcc 64-bit aligned for Itanium2 systems */
/* MAJOR runtime penalty if not used on those systems */
#else
State comp_now; /* compressed state vector */
#endif
#ifndef HC
#ifdef BFS_PAR
State tmp_msk;
#endif
State comp_msk;
uchar *Mask = (uchar *) &comp_msk;
#endif
#ifdef COLLAPSE
State comp_tmp;
static char *scratch = (char *) &comp_tmp;
#endif
_Stack *stack; /* for queues, processes */
Svtack *svtack; /* for old state vectors */
#ifdef BITSTATE
static unsigned int hfns = 3; /* new default */
#endif
static ulong j1_spin, j2_spin; /* 5.2.1: avoid nameclash with math.h */
static ulong j3_spin, j4_spin;
ulong K1, K2;
#ifdef BITSTATE
long udmem;
#endif
#ifndef BFS_PAR
static long A_depth = 0;
#endif
long depth = 0;
long depthfound = -1; /* loop detection */
#if NCORE>1
long nr_handoffs = 0;
#endif
uchar warned = 0, iterative = 0, exclusive = 0, like_java = 0, every_error = 0;
uchar noasserts = 0, noends = 0, bounded = 0;
uint s_rand = 12345; /* default seed */
#if SYNC>0 && ASYNC==0
void set_recvs(void);
int no_recvs(int);
#endif
#if SYNC
#define IfNotBlocked if (boq != -1) continue;
#define UnBlock boq = -1
#else
#define IfNotBlocked /* cannot block */
#define UnBlock /* don't bother */
#endif
#ifdef BITSTATE
int (*b_store)(char *, int);
int bstore_reg(char *, int);
int bstore_mod(char *, int);
#endif
void dfs_uerror(char *);
void dfs_Uerror(char *);
#ifdef BFS_PAR
void bfs_uerror(char *);
void bfs_Uerror(char *);
#endif
void (*uerror)(char *);
void (*Uerror)(char *);
void (*hasher)(uchar *, int);
void (*o_hash)(uchar *, int, int);
void d_hash(uchar *, int);
void m_hash(uchar *, int);
void d_sfh(uchar *, int);
void o_hash32(uchar *, int, int);
void o_hash64(uchar *, int, int);
void active_procs(void);
void cleanup(void);
void do_the_search(void);
void find_shorter(int);
void iniglobals(int);
void stopped(int);
void wrapup(void);
int *grab_ints(int);
void ungrab_ints(int *, int);
#ifdef COLLAPSE
#if (NCORE>1 && !defined(SEP_STATE)) || defined(BFS_PAR)
volatile ulong *ncomps; /* in shared memory */
#else
ulong ncomps[256+2];
#endif
#endif
Trans ***trans; /* 1 ptr per state per proctype */
#if VECTORSZ>32000
int P_o[MAXPROC], P_o_tmp[MAXPROC+1];
int Q_o[MAXQ], Q_o_tmp[MAXPROC+1];
int *proc_offset = (int *) P_o;
int *q_offset = (int *) Q_o;
#else
short P_o[MAXPROC], P_o_tmp[MAXPROC+1];
short Q_o[MAXQ], Q_o_tmp[MAXPROC+1];
short *proc_offset = (short *) P_o;
short *q_offset = (short *) Q_o;
#endif
uchar P_s[MAXPROC+1], P_s_tmp[MAXPROC+1];
uchar Q_s[MAXQ+1], Q_s_tmp[MAXQ+1];
uchar *proc_skip = (uchar *) P_s;
uchar *q_skip = (uchar *) Q_s;
#ifdef TRIX
TRIX_v6 *freebodies;
TRIX_v6 *processes[MAXPROC+1];
TRIX_v6 *channels[MAXQ+1];
long _p_count[MAXPROC];
long _c_count[MAXPROC];
#endif
ulong vsize; /* vector size in bytes */
#ifdef SVDUMP
int vprefix=0, svfd; /* runtime option -pN */
#endif
char *tprefix = "trail"; /* runtime option -tsuffix */
short boq = -1; /* blocked_on_queue status */
int _; /* predefined write-only variable */
#ifdef PEG
long peg[NTRANS];
#endif
#ifndef NOBOUNDCHECK
#define Index(x, y) Boundcheck(x, y, II, tt, t)
#else
#define Index(x, y) x
#endif
short src_ln1 [] = {
0, 29, 29, 29, 30, 32, 32, 32,
32, 33, 31, 35, 35, 41, 42, 43,
45, 45, 45, 46, 48, 48, 49, 47,
51, 51, 27, 53, 27, 53, 0, };
S_F_MAP src_file1 [] = {
{ "-", 0, 0 },
{ "week7/zona_critica copy.pml", 1, 29 },
{ "-", 30, 31 }
};
uchar reached1 [] = {
0, 1, 0, 1, 0, 1, 1, 0,
0, 1, 0, 1, 0, 0, 0, 0,
1, 0, 0, 0, 1, 0, 1, 0,
1, 0, 0, 1, 1, 0, 0, };
uchar *loopstate1;
short src_ln0 [] = {
0, 13, 13, 13, 18, 19, 20, 21,
11, 23, 11, 23, 0, };
S_F_MAP src_file0 [] = {
{ "-", 0, 0 },
{ "week7/zona_critica copy.pml", 1, 11 },
{ "-", 12, 13 }
};
uchar reached0 [] = {
0, 1, 0, 1, 0, 0, 0, 0,
0, 1, 1, 0, 0, };
uchar *loopstate0;
uchar reached2[3]; /* np_ */
uchar *loopstate2; /* np_ */
struct {
int tp; short *src;
} src_all[] = {
{ 1, &src_ln1[0] },
{ 0, &src_ln0[0] },
{ 0, (short *) 0 }
};
S_F_MAP *flref[] = {
src_file1,
src_file0
};
struct {
char *c; char *t;
} code_lookup[] = {
{ (char *) 0, "" }
};
short Air[] = { (short) Air0, (short) Air1, (short) Air2 };
char *procname[] = {
"writer",
"reader",
":np_:",
0
};
enum btypes { NONE=0, N_CLAIM=1, I_PROC=2, A_PROC=3, P_PROC=4, E_TRACE=5, N_TRACE=6 };
int Btypes[] = {
3, /* writer */
3, /* reader */
0 /* :np_: */
};
uchar spin_c_typ[NCLAIMS]; /* claim-types */
uchar *accpstate[3];
uchar *progstate[3];
uchar *loopstate[3];
uchar *reached[3];
uchar *stopstate[3];
uchar *visstate[3];
short *mapstate[3];
#ifdef HAS_CODE
int NrStates[3];
#endif
#ifdef TRIX
int what_p_size(int);
int what_q_size(int);
void
re_mark_all(int whichway)
{ int j;
#ifdef V_TRIX
printf("%d: re_mark_all channels %d\n", depth, whichway);
#endif
#ifndef BFS
for (j = 0; j < now._nr_qs; j++)
channels[j]->modified = 1; /* channel index moved */
#endif
#ifndef TRIX_ORIG
if (whichway > 0)
{ for (j = now._nr_pr + now._nr_qs - 1; j >= now._nr_pr; j--)
now._ids_[j] = now._ids_[j-1];
} else
{ for (j = now._nr_pr; j < now._nr_pr + now._nr_qs; j++)
now._ids_[j] = now._ids_[j+1];
}
#endif
}
#endif
#ifdef BFS_PAR
void
bfs_prepmask(int caller)
{
#if !defined(NOCOMP) && !defined(HC)
memcpy((char *) &tmp_msk, (const char *) Mask, sizeof(State));
Mask = (uchar *) &tmp_msk;
#endif
switch (caller) {
case 1: /* addproc */
#if VECTORSZ>32000
memcpy((char *) P_o_tmp, (const char *) proc_offset, MAXPROC*sizeof(int));
#else
memcpy((char *) P_o_tmp, (const char *) proc_offset, MAXPROC*sizeof(short));
#endif
memcpy((char *) P_s_tmp, (const char *) proc_skip, MAXPROC*sizeof(uchar));
proc_offset = P_o_tmp;
proc_skip = (uchar *) &P_s_tmp[0];
break;
case 2: /* addqueue */
#if VECTORSZ>32000
memcpy((char *) Q_o_tmp, (const char *) q_offset, MAXQ*sizeof(int));
#else
memcpy((char *) Q_o_tmp, (const char *) q_offset, MAXQ*sizeof(short));
#endif
memcpy((char *) Q_s_tmp, (const char *) q_skip, MAXQ*sizeof(uchar));
q_offset = Q_o_tmp;
q_skip = (uchar *) &Q_s_tmp[0];
break;
case 3: /* no nothing */
break;
default: /* cannot happen */
Uerror("no good");
break;
}
}
typedef struct BFS_saves BFS_saves;
struct BFS_saves {
char *m;
BFS_saves *nxt;
} *bfs_save_po,
*bfs_save_ps,
#if !defined(NOCOMP) && !defined(HC)
*bfs_save_mask,
#endif
*bfs_save_qo,
*bfs_save_qs;
extern volatile uchar *sh_malloc(ulong);
static int bfs_runs; /* 0 before local heaps are initialized */
void
bfs_swoosh(BFS_saves **where, char **what, int howmuch)
{ BFS_saves *m;
for (m = *where; m; m = m->nxt)
{ if (memcmp(m->m, *what, howmuch) == 0)
{ *what = m->m;
return;
} }
m = (BFS_saves *) emalloc(sizeof(BFS_saves));
if (bfs_runs)
{ m->m = (char *) sh_malloc(howmuch);
} else
{ m->m = (char *) sh_pre_malloc(howmuch);
}
memcpy(m->m, *what, howmuch);
m->nxt = *where;
*where = m;
*what = m->m;
}
void
bfs_fixmask(int caller)
{
#if !defined(NOCOMP) && !defined(HC)
bfs_swoosh(&bfs_save_mask, (char **) &Mask, sizeof(State));
#endif
#ifndef TRIX
switch (caller) {
case 1: /* addproc */
#if VECTORSZ>32000
bfs_swoosh(&bfs_save_po, (char **) &proc_offset, MAXPROC*sizeof(int));
#else
bfs_swoosh(&bfs_save_po, (char **) &proc_offset, MAXPROC*sizeof(short));
#endif
bfs_swoosh(&bfs_save_ps, (char **) &proc_skip, MAXPROC*sizeof(uchar));
break;
case 2: /* addqueue */
#if VECTORSZ>32000
bfs_swoosh(&bfs_save_qo, (char **) &q_offset, MAXQ*sizeof(int));
#else
bfs_swoosh(&bfs_save_qo, (char **) &q_offset, MAXQ*sizeof(short));
#endif
bfs_swoosh(&bfs_save_qs, (char **) &q_skip, MAXQ*sizeof(uchar));
break;
case 3: /* do nothing */
break;
default:
Uerror("double plus ungood");
break;
}
#endif
}
#endif
int
addproc(int calling_pid, int priority, int n)
{ int j, h = now._nr_pr;
#ifndef NOCOMP
int k;
#endif
uchar *o_this = _this;
#ifndef INLINE
if (TstOnly) return (h < MAXPROC);
#endif
#ifndef NOBOUNDCHECK
/* redefine Index only within this procedure */
#undef Index
#define Index(x, y) Boundcheck(x, y, 0, 0, 0)
#endif
if (h >= MAXPROC)
Uerror("too many processes");
#ifdef V_TRIX
printf("%4d: add process %d\n", depth, h);
#endif
switch (n) {
case 0: j = sizeof(P0); break;
case 1: j = sizeof(P1); break;
case 2: j = sizeof(P2); break;
default: Uerror("bad proc - addproc");
}
#ifdef BFS_PAR
bfs_prepmask(1); /* addproc */
#endif
#ifdef TRIX
vsize += sizeof(H_el *);
#else
if (vsize%WS)
proc_skip[h] = WS-(vsize%WS);
else
proc_skip[h] = 0;
#if !defined(NOCOMP) && !defined(HC)
for (k = vsize + (int) proc_skip[h]; k > vsize; k--)
Mask[k-1] = 1; /* align */
#endif
vsize += (int) proc_skip[h];
proc_offset[h] = vsize;
vsize += j;
#if defined(SVDUMP) && defined(VERBOSE)
if (vprefix > 0)
{ int dummy = 0;
write(svfd, (uchar *) &dummy, sizeof(int)); /* mark */
write(svfd, (uchar *) &h, sizeof(int));
write(svfd, (uchar *) &n, sizeof(int));
#if VECTORSZ>32000
write(svfd, (uchar *) &proc_offset[h], sizeof(int));
write(svfd, (uchar *) &now, vprefix-4*sizeof(int)); /* padd */
#else
write(svfd, (uchar *) &proc_offset[h], sizeof(short));
write(svfd, (uchar *) &now, vprefix-3*sizeof(int)-sizeof(short)); /* padd */
#endif
}
#endif
#endif
now._nr_pr += 1;
#if defined(BCS) && defined(CONSERVATIVE)
if (now._nr_pr >= CONSERVATIVE*8)
{ printf("pan: error: too many processes -- recompile with ");
printf("-DCONSERVATIVE=%d\n", CONSERVATIVE+1);
pan_exit(1);
}
#endif
if (fairness && ((int) now._nr_pr + 1 >= (8*NFAIR)/2))
{ printf("pan: error: too many processes -- current");
printf(" max is %d procs (-DNFAIR=%d)\n",
(8*NFAIR)/2 - 2, NFAIR);
printf("\trecompile with -DNFAIR=%d\n",
NFAIR+1);
pan_exit(1);
}
#ifndef NOVSZ
now._vsz = vsize;
#endif
hmax = max(hmax, vsize);
#ifdef TRIX
#ifndef BFS
if (freebodies)
{ processes[h] = freebodies;
freebodies = freebodies->nxt;
} else
{ processes[h] = (TRIX_v6 *) emalloc(sizeof(TRIX_v6));
processes[h]->body = (uchar *) emalloc(Maxbody * sizeof(char));
}
processes[h]->modified = 1; /* addproc */
#endif
processes[h]->psize = j;
processes[h]->parent_pid = calling_pid;
processes[h]->nxt = (TRIX_v6 *) 0;
#else
#if !defined(NOCOMP) && !defined(HC)
for (k = 1; k <= Air[n]; k++)
Mask[vsize - k] = 1; /* pad */
Mask[vsize-j] = 1; /* _pid */
#endif
#ifdef BFS_PAR
bfs_fixmask(1); /* addproc */
#endif
if (vsize >= VECTORSZ)
{ printf("pan: error, VECTORSZ too small, recompile pan.c");
printf(" with -DVECTORSZ=N with N>%d\n", (int) vsize);
Uerror("aborting");
}
#endif
memset((char *)pptr(h), 0, j);
_this = pptr(h);
if (BASE > 0 && h > 0)
{ ((P0 *)_this)->_pid = h-BASE;
} else
{ ((P0 *)_this)->_pid = h;
}
switch (n) {
case 2: /* np_ */
((P2 *)pptr(h))->_t = 2;
((P2 *)pptr(h))->_p = 0;
#ifdef HAS_PRIORITY
((P2 *)pptr(h))->_priority = priority;
#endif
reached2[0] = 1;
accpstate[2][1] = 1;
break;
case 1: /* reader */
((P1 *)pptr(h))->_t = 1;
((P1 *)pptr(h))->_p = 26;
#ifdef HAS_PRIORITY
((P1 *)pptr(h))->_priority = priority; /* was: 1 */
#endif
reached1[26]=1;
/* params: */
/* locals: */
#ifdef VAR_RANGES
#endif
#ifdef HAS_CODE
locinit1(h);
#endif
break;
case 0: /* writer */
((P0 *)pptr(h))->_t = 0;
((P0 *)pptr(h))->_p = 8;
#ifdef HAS_PRIORITY
((P0 *)pptr(h))->_priority = priority; /* was: 1 */
#endif
reached0[8]=1;
/* params: */
/* locals: */
#ifdef VAR_RANGES
#endif
#ifdef HAS_CODE
locinit0(h);
#endif
break;
}
_this = o_this;
#ifdef TRIX
re_mark_all(1); /* addproc */
#endif
return h-BASE;
#ifndef NOBOUNDCHECK
#undef Index
#define Index(x, y) Boundcheck(x, y, II, tt, t)
#endif
}
#if defined(BITSTATE) && defined(COLLAPSE)
/* just to allow compilation, to generate the error */
long col_p(int i, char *z) { return 0; }
long col_q(int i, char *z) { return 0; }
#endif
#ifndef BITSTATE
#ifdef COLLAPSE
long
col_p(int i, char *z)
{ int j, k; ulong ordinal(char *, long, short);
char *x, *y;
P0 *ptr = (P0 *) pptr(i);
switch (ptr->_t) {
case 0: j = sizeof(P0); break;
case 1: j = sizeof(P1); break;
case 2: j = sizeof(P2); break;
default: Uerror("bad proctype - collapse");
}
if (z) x = z; else x = scratch;
y = (char *) ptr; k = proc_offset[i];
#if !defined(NOCOMP) && !defined(HC)
for ( ; j > 0; j--, y++)
if (!Mask[k++]) *x++ = *y;
#else
memcpy(x, y, j);
x += j;
#endif
for (j = 0; j < WS-1; j++)
*x++ = 0;
x -= j;
if (z) return (long) (x - z);
return ordinal(scratch, x-scratch, (short) (2+ptr->_t));
}
#endif
#endif
#ifdef INIT_STATE
void
init_state(State state){ state._nr_pr = 0;
state._nr_qs = 0;
state._a_t = 0;
#ifndef NOFAIR
memset(&state._cnt, 0, sizeof(state._cnt));
#endif
#ifndef NOVSZ
state._vsz = 0;
#endif
#ifdef HAS_LAST
state._last = 0;
#endif
#if defined(BITSTATE) && defined(BCS) && defined(STORE_CTX)
state._ctx = 0;
#endif
#if defined(BFS_PAR) && defined(L_BOUND)
state._l_bnd = 0;
state._l_sds = 0;
#endif
#ifdef EVENT_TRACE
state_event = 0;
#endif
#ifdef TRIX
memset(&state._ids_, 0, sizeof(state._ids_));
#else
memset(&state.sv, 0, sizeof(state.sv));
#endif
}
#endif
void
run(void)
{ /* int i; */
#ifdef INIT_STATE
init_state(now);
#else
memset((char *)&now, 0, sizeof(State));
#endif
vsize = (ulong) (sizeof(State) - VECTORSZ);
#ifndef NOVSZ
now._vsz = vsize;
#endif
#ifdef TRIX
if (VECTORSZ != sizeof(now._ids_))
{ printf("VECTORSZ is %d, but should be %d in this mode\n",
VECTORSZ, (int) sizeof(now._ids_));
Uerror("VECTORSZ set incorrectly, recompile Spin (not pan.c)");
}
#endif
/* optional provisioning statements, e.g. to */
/* set hidden variables, used as constants */
#ifdef PROV
#include PROV
#endif
settable();
Maxbody = max(Maxbody, ((int) sizeof(P0)));
Maxbody = max(Maxbody, ((int) sizeof(P1)));
Maxbody = max(Maxbody, ((int) sizeof(P2)));
reached[0] = reached0;
reached[1] = reached1;
reached[2] = reached2;
accpstate[0] = (uchar *) emalloc(_nstates0);
accpstate[1] = (uchar *) emalloc(_nstates1);
accpstate[2] = (uchar *) emalloc(_nstates2);
progstate[0] = (uchar *) emalloc(_nstates0);
progstate[1] = (uchar *) emalloc(_nstates1);
progstate[2] = (uchar *) emalloc(_nstates2);
loopstate0 = loopstate[0] = (uchar *) emalloc(_nstates0);
loopstate1 = loopstate[1] = (uchar *) emalloc(_nstates1);
loopstate2 = loopstate[2] = (uchar *) emalloc(_nstates2);
stopstate[0] = (uchar *) emalloc(_nstates0);
stopstate[1] = (uchar *) emalloc(_nstates1);
stopstate[2] = (uchar *) emalloc(_nstates2);
visstate[0] = (uchar *) emalloc(_nstates0);
visstate[1] = (uchar *) emalloc(_nstates1);
visstate[2] = (uchar *) emalloc(_nstates2);
mapstate[0] = (short *) emalloc(_nstates0 * sizeof(short));
mapstate[1] = (short *) emalloc(_nstates1 * sizeof(short));
mapstate[2] = (short *) emalloc(_nstates2 * sizeof(short));
stopstate[0][_endstate0] = 1;
stopstate[1][_endstate1] = 1;
stopstate[2][_endstate2] = 1;
#ifdef HAS_CODE
NrStates[0] = _nstates0;
NrStates[1] = _nstates1;
NrStates[2] = _nstates2;
#endif
Maxbody = max(Maxbody, sizeof(State)-VECTORSZ);
if ((Maxbody % WS) != 0)
Maxbody += WS - (Maxbody % WS);
retrans(0, _nstates0, _start0, src_ln0, reached0, loopstate0);
retrans(1, _nstates1, _start1, src_ln1, reached1, loopstate1);
if (state_tables)
{ if (dodot) exit(0);
printf("\nTransition Type: ");
printf("A=atomic; D=d_step; L=local; G=global\n");
printf("Source-State Labels: ");
printf("p=progress; e=end; a=accept;\n");
#ifdef MERGED
printf("Note: statement merging was used. Only the first\n");
printf(" stmnt executed in each merge sequence is shown\n");
printf(" (use spin -a -o3 to disable statement merging)\n");
#endif