This repository has been archived by the owner on Jul 5, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathexec.cc
1503 lines (1344 loc) · 37.9 KB
/
exec.cc
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
/*****************************************************************************
* Copyright 1994-2005, Elliot Mednick and Mark Hummel
* This file is part of Veriwell.
*
* Veriwell is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* Veriwell is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Foobar; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*****************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include "vtypes.h"
#include "tree.h"
#include "schedule.h"
#include "runtime.h"
#include "flags.h"
#include "io.h"
#include "macro.h"
#include "glue.h"
#include "strobe.h"
#include "store.h"
#include "exec.h"
#include "print.h"
#include "eval.h"
#include "decl.h"
#include "specify.h"
#include "veriuser.h"
#include "acc_user.h"
#include "pli.h"
#include "systask.h"
#include "veriwell.h"
#include "lex.h"
#include "pass3.h"
#include "trace.h"
#ifdef HAVE_LIBREADLINE
# if defined(HAVE_READLINE_READLINE_H)
# include <readline/readline.h>
# elif defined(HAVE_READLINE_H)
# include <readline.h>
# else /* !defined(HAVE_READLINE_H) */
extern char *readline ();
# endif /* !defined(HAVE_READLINE_H) */
char *cmdline = NULL;
#else /* !defined(HAVE_READLINE_READLINE_H) */
/* no readline */
extern "C" char* readline(char*);
#endif /* HAVE_LIBREADLINE */
#ifdef HAVE_READLINE_HISTORY
# if defined(HAVE_READLINE_HISTORY_H)
# include <readline/history.h>
# elif defined(HAVE_HISTORY_H)
# include <history.h>
# else /* !defined(HAVE_HISTORY_H) */
# endif /* defined(HAVE_READLINE_HISTORY_H) */
/* no history */
#else /* !HAVE_READLINE_HISTORY */
#endif /* HAVE_READLINE_HISTORY */
#define NULL_GROUP (Group *) NULL
#define TRACE(CURRENT, NEXT, G, SKIP, VAL) \
{ \
if( lcbCount != 0 && !normal_flag ) { \
handleLcb( CURRENT ); \
} \
if (!normal_flag) { \
pc = go_interactive (CURRENT, NEXT, G, SKIP, VAL); \
} else { \
if ((NEXT) != NULL_TREE) { \
pc = NEXT; \
} \
} \
}
extern int in_simulation;
int exit_flag = 0;
int in_disable; /* set while processing the disable statement */
extern SCB *readylist;
static unsigned char brk_check = 0;
void Group2Time(int ngroup, Group * g, struct Time64 *t)
{
int i;
// convert X/Z -> 0
for (i = 0; i < ngroup + 1; ++i) {
if (BVAL(g + i)) {
t->timeh = 0;
t->timel = 0;
return;
}
}
t->timel = AVAL(g);
if (ngroup > 0) {
t->timeh = AVAL(g + 1);
} else {
t->timeh = 0;
}
}
void set_simulation_time(time64 * newtime_p)
{
ASSIGNTIME64(&CurrentTime, newtime_p);
if (trace_flag || single_trace_flag) {
printf_V("SIMULATION TIME IS ");
print_time(&CurrentTime);
printf_V("\n");
}
}
struct context_member *free_context;
struct context_member *make_context(void)
{
struct context_member *new_t;
if (free_context) {
new_t = free_context;
REMOVE_LIST(new_t);
return new_t;
} else {
return (struct context_member *) xmalloc
(sizeof(struct context_member));
}
}
void enter_context(SCB * scb, tree scope, tree pc)
{
struct context_member *tmp;
struct context_member *new_context;
if (!scope) { /* If scb is build w/out context, don't bother */
return;
}
new_context = make_context();
ADD_LIST(BLOCK_CONTEXT_LIST(scope), new_context);
new_context->shadow = scb->context;
scb->context = new_context;
new_context->scb = scb;
new_context->scope = scope;
new_context->pc = pc;
}
tree exit_context(SCB * scb)
{
struct context_member *tmp;
struct context_member *context = scb->context;
scb->context = context->shadow;
REMOVE_LIST(context);
ADD_LIST(free_context, context);
return context->pc;
}
/* Starting with the innermost context, unwind until past the given
context. Return the outermost PC. */
tree unwind_context(struct context_member * context)
{
while (context->scb->context != context) {
exit_context(context->scb);
free_context->pc = NULL;
}
return exit_context(context->scb);
}
void disable_context(struct context_member *context)
{
SCB *scb;
SCB *tmp;
tree next_pc;
tree current_pc;
int me;
/* First, get the SCB. */
scb = context->scb;
current_pc = scb->pc;
me = readylist == scb;
/* The context being disabled is in one of the following states: waiting
for a time or event, the beginning of a fork, or at the head of the
readylist (me). Do the right thing for each case. */
if (me) {
next_pc = unwind_context(context);
} else {
switch (TREE_CODE(current_pc)) {
case EVENT_STMT:
event_undo(STMT_EVENT_MARKER(current_pc));
next_pc = unwind_context(context);
break;
case WAIT_STMT:
event_undo(STMT_WAIT_MARKER(current_pc));
next_pc = unwind_context(context);
break;
case ASSIGN_DELAY_STMT:
case DELAY_STMT:
next_pc = unwind_context(context);
break;
case JOIN_STMT:
case JOIN_NAMED_STMT:
while (context->next) {
disable_context(context->next);
}
next_pc = context->pc;
break;
/* If the disable came from within a named fork, let join handle it */
case FORK_NAMED_STMT:
next_pc = STMT_BODY(current_pc); /* points to join */
break;
}
}
ASSIGNTIME64(&(scb->time), &CurrentTime);
scb->mode = RUN;
if (!next_pc) /* must be a fork member */
if (me) {
/*
* I am one of the fork members and if I kill the SCB, then ...
* ... I have to put the fork's SCB at the front of the ready list
*/
SCB *fork_scb = scb->fork;
ASSERT(fork_scb);
ASSERT(fork_scb->fork_count > 0);
FreeSCB(scb);
REMOVE_LIST_SCB(fork_scb);
ADD_LIST_SCB(READY_LIST, &readylist, fork_scb);
readylist->mode = WAIT;
} else {
FreeSCB(scb);
}
else {
int save_normal_flag;
// ??? mdh - not sure why this matters but it does
int onReadyList = (scb->list == READY_LIST);
in_disable = 1;
REMOVE_LIST_SCB(scb);
ADD_LIST_SCB(READY_LIST, &readylist, scb);
scb->pc = next_pc;
save_normal_flag = normal_flag;
normal_flag = 0;
exec_(scb->pc);
in_disable = 0;
normal_flag = save_normal_flag;
/* Put the disabled process next of the readylist.
In some cases, after exec-ing, the scb could have been taken off
the ready list. If so, don't bother putting at the end.
Eg: disabling a named begin inside a fork-join -- this will
exec the join stmt which calls dump_current_process.
Also, if I am disabling myself, then there could be only
my SCB on the readylist, so don't bother moving it */
if (!me && onReadyList && scb->list == READY_LIST
&& readylist->next) {
SCB *last;
REMOVE_LIST_SCB(scb);
last = LAST_SCB(READY_LIST);
if (last) {
ADD_LIST_SCB(READY_LIST, &last->next, scb);
} else {
ADD_LIST_SCB(READY_LIST, &readylist, scb);
}
}
}
}
/* process deassign statement; find matching assignment and unthread
the markers. Return pc of ASSIGN or FORCE if something was actually
released. Note that the deassign will not happen under certain
circumstances. Specifically, if it was requested by a assign or deassign
but was generated by a force, it will not happen. */
tree deassign(tree lval_arg, enum tree_code code)
{
Marker *marker;
tree pc;
tree lval;
/* if lval is hierarchical, it will be a "shadow" lval". Point to the real
lval. */
lval = the_lval(lval_arg);
for (marker = DECL_EVENT_CHAIN(lval); marker; marker = marker->next) {
/* marker must be for continuous assignment, then it must point to
procedual cont assignment, then lvals must match */
if (marker->flags & M_CONT &&
(TREE_CODE(marker->expr.tree) == ASSIGN_PROC_STMT ||
TREE_CODE(marker->expr.tree) == FORCE_STMT) &&
the_lval(STMT_ASSIGN_LVAL(marker->expr.tree)) == lval) {
pc = marker->expr.tree;
if (TREE_CODE(pc) == FORCE_STMT &&
(code == ASSIGN_PROC_STMT || code == DEASSIGN_STMT)) {
return NULL_TREE;
}
event_undo(STMT_ASSIGN_EVENT_LIST(pc));
return pc;
}
}
return NULL_TREE;
}
int first_time_exec = 1;
tree exec_(tree pc)
{
Group *g1, *g2;
enum logical_value cond;
ngroups_t i;
int found;
enum tree_code code;
tree t, t1, new_pc, old_pc;
tree scope; // for fork
if (!is_interactive && first_time_exec && in_simulation) {
first_time_exec = 0;
if (s_flag) {
single_step_flag = 1;
/* enter command line mode w/no trace */
pc = go_interactive(NULL_TREE, pc, NULL_GROUP, 0, 0);
}
} else {
if (in_disable) {
pc = go_interactive(NULL_TREE, pc, NULL_GROUP, 1, 0);
}
}
for (;;) {
// if (!brk_check++) /* interrupt the process every so often to */
// ftell (stdout); /* guarentee that a break will be detected */
code = TREE_CODE(pc);
switch (code) {
case BEGIN_STMT:
TRACE(pc, STMT_BODY(pc), NULL_GROUP, 0, 0);
break;
case BEGIN_NAMED_STMT:
enter_context(readylist, STMT_BLOCK(pc), TREE_CHAIN(pc));
TRACE(pc, STMT_BODY(pc), NULL_GROUP, 0, 0);
break;
case END_NAMED_STMT:
exit_context(readylist);
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 0, 0) break;
case FORK_NAMED_STMT:
/* Point to PAST Join in case of disable */
scope = STMT_BLOCK(pc);
enter_context(readylist, STMT_BLOCK(pc),
TREE_CHAIN(TREE_CHAIN(pc)));
goto fork_common;
case FORK_STMT:
scope = STMT_SCOPE(pc);
enter_context(readylist, STMT_SCOPE(pc),
TREE_CHAIN(TREE_CHAIN(pc)));
fork_common:
{
SCB *fork = readylist;
SCB *scb;
SCB *tmp;
SCB *where = readylist;
fork->fork_count = 0;
for (t = STMT_BODY(pc); t; t = TREE_CHAIN(t)) {
/* SCBs are built dynamically instead of at compile time. This
is because in tasks, more than one process could enter an
SCB at one time. */
/* we will use the SCB's make_context to point to the innermost
scope, which may be the named fork scope */
tree saved_scope = current_scope;
current_scope = scope;
scb = BuildSCB(TREE_PURPOSE(t), NOLIST);
current_scope = saved_scope;
/* Each member has its own context. This way, disable
will work because there is a binding between the
fork and all its branches */
REMOVE_LIST_SCB(scb);
/* thread in order */
ADD_LIST_SCB(READY_LIST, &where->next, scb);
fork->fork_count++; /* Keep count of concurrent stmts */
scb->fork = fork; /* point back to "main" SCB */
where = scb;
}
}
readylist->pc = TREE_CHAIN(pc);
readylist->mode = WAIT;
new_pc = dispatch_pc(EVENT_LIST);
readylist->pc = NULL; /* Don't trigger event stmt */
TRACE(pc, new_pc, NULL_GROUP, 0, 0);
break;
case JOIN_STMT:
case JOIN_NAMED_STMT:
/* If this is the last fork member, get fork control back on the
ready list and go. Note that exit_context frees up
context_member but subsequent code assumes the pointers
are valid (freed context_members go on a free list and
are not freed in memory). */
/* Get here if FORK is disabled */
if (readylist->mode == WAIT) {
readylist->mode = RUN;
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 0, 0);
} else {
/* One of the members exited; get rid of it */
SCB *fork_scb = readylist->fork;
tree scope = readylist->context->scope;
ASSERT(fork_scb);
ASSERT(fork_scb->fork_count > 0);
fork_scb->fork_count--;
/* if all branches are finished, then scope will point to the
fork context; if there are some to finish, then scope
will point to all the contexts still to run */
if (fork_scb->fork_count == 0) {
SCB *tmp;
/* put mother fork next on ready lest */
REMOVE_LIST_SCB(fork_scb);
ADD_LIST_SCB(READY_LIST, &readylist->next, fork_scb);
readylist->next->mode = RUN;
exit_context(readylist); // for the last branch
exit_context(readylist->next); // for the fork
pc = dump_current_process();
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 1, 0);
} else {
exit_context(readylist);
new_pc = dump_current_process();
TRACE(pc, new_pc, NULL_GROUP, 0, 0);
}
}
break;
case ALWAYS_BLOCK:
INITIALIZED_ATTR(pc) = 1; /* make trace consistant w/XL */
case INITIAL_BLOCK:
TRACE(pc, STMT_BODY(pc), NULL_GROUP, 0, 0);
break;
case IF_STMT:
if (test(STMT_COND_CODE(pc)) == ONE) {
TRACE(pc, STMT_THEN(pc), NULL_GROUP, 0, 0);
} else if (STMT_ELSE(pc)) {
TRACE(pc, STMT_ELSE(pc), NULL_GROUP, 1, 0);
} else {
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 1, 0);
}
break;
case ASSIGN_STMT:
eval(STMT_ASSIGN_RVAL_CODE(pc));
TRACE(pc, pc, *(R - 1), 1, 1);
store(STMT_ASSIGN_LVAL(pc), pc);
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 0, 0);
break;
case ASSIGN_PROC_STMT:
case FORCE_STMT:
broadcast_tf(reason_force);
/* Make sure we start over */
t = deassign(STMT_ASSIGN_LVAL(pc), code);
/* save pc of assign that we are overriding */
if (code == FORCE_STMT) {
if (t && TREE_CODE(t) == ASSIGN_PROC_STMT) {
STMT_ASSIGN_TMP(pc) = t;
} else {
STMT_ASSIGN_TMP(pc) = NULL_TREE;
}
}
thread_all_markers(STMT_ASSIGN_EVENT_LIST(pc));
eval(STMT_ASSIGN_RVAL_CODE(pc));
/* store force value for later use */
store(STMT_FORCE_TMP_DECL(pc), pc);
eval_1(STMT_FORCE_TMP_DECL(pc));
TRACE(pc, pc, *(R - 1), 1, 1);
store(STMT_ASSIGN_LVAL(pc), pc);
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 0, 0);
break;
case DEASSIGN_STMT:
case RELEASE_STMT:
broadcast_tf(reason_release);
t = deassign(the_lval(STMT_BODY(pc)), code);
/* If was we are releasing still has an ASSIGN on it,
reactivate the assign */
if (t && code == RELEASE_STMT && STMT_ASSIGN_TMP(t)) {
thread_all_markers(STMT_ASSIGN_EVENT_LIST
(STMT_ASSIGN_TMP(t)));
do_net_assignment(STMT_ASSIGN_TMP(t));
/* if net, reevaluate */
} else if (is_all_net(the_lval(STMT_BODY(pc)))) {
/* if part or bit */
t1 = root_port_decl(the_lval(STMT_BODY(pc)));
do_net_eval(t1, 0, NULL_TREE); /* evaluate it */
store(t1, pc); /* and store it */
}
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 0, 0);
break;
case ASSIGN_CONT_STMT:
if (CMPTIME64(&CurrentTime, &(readylist->time))) {
set_simulation_time(&(readylist->time));
}
eval(STMT_ASSIGN_RVAL_CODE(pc));
TRACE(pc, pc, *(R - 1), 1, 1);
store(STMT_ASSIGN_LVAL(pc), pc);
if (NET_ASSIGN_ATTR(STMT_ASSIGN_LVAL(pc)) &&
!PORT_COLLAPSED_ATTR(TREE_CHAIN(STMT_ASSIGN_LVAL(pc)))) {
tree net = TREE_CHAIN(STMT_ASSIGN_LVAL(pc));
do_net_eval(net, 0, NULL_TREE);
TRACE(net, net, *(R - 1), 1, 1);
store(net, net);
}
new_pc = suspend_current_process();
TRACE(pc, new_pc, *R, 0, 0);
break;
case NET_SCALAR_DECL:
case NET_VECTOR_DECL:
DEBUGPRINT("Doing net exec\n");
if (CMPTIME64(&CurrentTime, &(readylist->time))) {
set_simulation_time(&(readylist->time));
}
do_net_eval(pc, 0, NULL_TREE);
TRACE(pc, pc, *(R - 1), 1, 1);
retrigger = NULL;
store(pc, pc);
/* Calculate output port seperately and only if connected */
if ((PORT_OUTPUT_ATTR(pc) ||
PORT_COLLAPSED_ATTR(pc)) && DECL_THREAD(pc)) {
do_net_eval(pc, 1, NULL_TREE);
store(DECL_THREAD(pc), pc);
}
if (!readylist) {
fatal("Caught it!", NULL_CHAR);
}
if( retrigger ) {
retrigger = NULL;
ASSERT( readylist == retrigger );
readylist->time = CurrentTime;
new_pc = dispatch_pc(TIME_LIST);
} else {
new_pc = suspend_current_process();
}
TRACE(pc, new_pc, NULL_GROUP, 0, 0);
break;
case FOR_STMT:
eval(STMT_ASSIGN_RVAL_CODE(STMT_FOR_ASSIGN(pc)));
TRACE(pc, pc, *(R - 1), 0, 1);
store(STMT_ASSIGN_LVAL(STMT_FOR_ASSIGN(pc)), pc);
eval(STMT_FOR_COND_CODE(pc));
DETERMINE_TRUE_COND(g1);
if (cond == ONE) {
TRACE(pc, STMT_BODY(pc), NULL_GROUP, 1, 0);
} else {
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 0, 0);
}
break;
case WHILE_STMT:
if (test(STMT_WHILE_COND_CODE(pc)) == ONE) {
TRACE(pc, STMT_BODY(pc), NULL_GROUP, 0, 0);
} else {
TRACE(pc, TREE_CHAIN(pc), (Group *) TREE_CHAIN(pc), 1, 0);
}
break;
case REPEAT_INIT_STMT:
eval(STMT_REPEAT_EXPR_CODE(pc));
AVAL(STMT_REPEAT_VAR(pc)) = AVAL(*--R);
BVAL(STMT_REPEAT_VAR(pc)) = BVAL(*R);
t = pc;
if (BVAL(STMT_REPEAT_VAR(pc))) {
AVAL(STMT_REPEAT_VAR(pc)) = (unsigned int) -1;
BVAL(STMT_REPEAT_VAR(pc)) = (unsigned int) -1;
pc = TREE_CHAIN(pc);
} else if (AVAL(STMT_REPEAT_VAR(pc))) {
pc = STMT_BODY(pc);
} else {
pc = TREE_CHAIN(pc);
}
TRACE(t, pc, STMT_REPEAT_VAR(t), 1, 0);
break;
case REPEAT_STMT:
t = pc;
if (BVAL(STMT_REPEAT_VAR(pc))) {
AVAL(STMT_REPEAT_VAR(pc)) = (unsigned int) -1;
BVAL(STMT_REPEAT_VAR(pc)) = (unsigned int) -1;
pc = TREE_CHAIN(pc);
} else if (--AVAL(STMT_REPEAT_VAR(pc))) {
pc = STMT_BODY(pc);
} else {
pc = TREE_CHAIN(pc);
}
TRACE(t, pc, STMT_REPEAT_VAR(t), 1, 0);
break;
case CASE_STMT:
case CASEZ_STMT:
case CASEX_STMT:
/* evaluate the case expression and leave on stack. Eval
choices until match. If no match, go to default, if there
is one. */
eval(STMT_CASE_EXPR_CODE(pc));
if (!INTERRUPT_FLAG_ATTR(pc)) {
old_pc = pc;
TRACE(pc, pc, *(R - 1), 0, 0);
if (pc != old_pc) { /* A new statement has been entered... */
--R; /* unwind the stack... */
/* abd remember that this happened. */
INTERRUPT_FLAG_ATTR(old_pc) = 1;
break;
}
} else {
INTERRUPT_FLAG_ATTR(pc) = 0;
}
found = 0;
for (t = STMT_CASE_LIST(pc); !found && t; t = TREE_CHAIN(t)) {
for (t1 = TREE_EXPR(t); !found && t1; t1 = TREE_CHAIN(t1)) {
eval(TREE_EXPR_CODE(t1));
found = 1;
g2 = *--R;
g1 = *(R - 1);
if (code == CASE_STMT) {
for (i = 0; i < R_ngroups; i++, g1++, g2++) {
if ((AVAL(g1) != AVAL(g2))
|| (BVAL(g1) != BVAL(g2))) {
found = 0;
break;
}
}
found = found && !(((AVAL(g1) ^ AVAL(g2)) & R_mask) /* all zeros if equal */
||((BVAL(g1) ^ BVAL(g2)) &
R_mask));
} else if (code == CASEZ_STMT) {
Bit aval1;
Bit bval1;
Bit aval2;
Bit bval2;
for (i = 0; i < R_ngroups; i++, g1++, g2++) {
aval1 = AVAL(g1);
bval1 = BVAL(g1);
aval2 = AVAL(g2);
bval2 = BVAL(g2);
/* All ones if equal (Z is don't care) */
if (((aval1 ^ aval2) | (bval1 ^ bval2))
& (~bval1 | aval1) & (~bval2 | aval2)) {
found = 0;
break;
}
}
aval1 = AVAL(g1);
bval1 = BVAL(g1);
aval2 = AVAL(g2);
bval2 = BVAL(g2);
/* If equal, then all zeros. Zs force zeros. */
found = found
&& !(((aval1 ^ aval2) | (bval1 ^ bval2))
& (~bval1 | aval1) & (~bval2 | aval2)
& R_mask);
} else if (code == CASEX_STMT) {
Bit aval1;
Bit bval1;
Bit aval2;
Bit bval2;
for (i = 0; i < R_ngroups; i++, g1++, g2++) {
aval1 = AVAL(g1);
bval1 = BVAL(g1);
aval2 = AVAL(g2);
bval2 = BVAL(g2);
/* All zeros if equal (Z and X are don't care) */
if (((aval1 ^ aval2) | (bval1 ^ bval2))
& ~bval1 & ~bval2) {
found = 0;
break;
}
}
aval1 = AVAL(g1);
bval1 = BVAL(g1);
aval2 = AVAL(g2);
bval2 = BVAL(g2);
found = found
&& !(((aval1 ^ aval2) | (bval1 ^ bval2))
& ~bval1 & ~bval2 & R_mask);
} else {
fatal("Bad CASE Exec", NULL_CHAR);
}
if (found) {
pc = TREE_STMT(t);
}
}
}
if (!found) {
if (STMT_CASE_DEFAULT(pc)) {
pc = STMT_CASE_DEFAULT(pc);
} else {
pc = TREE_CHAIN(pc);
}
}
R--;
break;
case ASSIGN_DELAY_STMT:
if (readylist->mode == RUN) {
eval(STMT_ASSIGN_RVAL_CODE(pc));
store(STMT_ASSIGN_TMP(pc), pc);
eval(STMT_DELAY_EXPR_CODE(STMT_ASSIGN_DELAY(pc)));
struct Time64 t;
Group2Time(R_ngroups, *--R, &t);
new_pc = WaitOnTime64(&t, pc);
TRACE(pc, pc, *R, 1, 1);
TRACE(pc, new_pc, NULL_GROUP, 0, 1);
} else {
readylist->mode = RUN;
if (CMPTIME64(&CurrentTime, &(readylist->time))) {
set_simulation_time(&(readylist->time));
}
eval(STMT_ASSIGN_TMPCODE(pc));
TRACE(pc, pc, *(R - 1), 1, 0);
store(STMT_ASSIGN_LVAL(pc), pc);
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 0, 0);
}
break;
case ASSIGN_NONBLK_DELAY_STMT:
if (readylist->mode == RUN) {
SCB *scb;
scb = BuildSCB(pc, NOLIST);
enter_context(scb, readylist->context->scope, NULL_TREE);
/* each execution of nonblocking
delay requires new temp var */
scb->here.decl = make_tmp_decl(STMT_ASSIGN_LVAL(pc));
STMT_ASSIGN_TMP(pc) = (tree) scb; /* save for trace */
eval(STMT_ASSIGN_RVAL_CODE(pc));
store(scb->here.decl, pc);
store_computeOnly = 1;
store_scb = scb;
store(STMT_ASSIGN_LVAL(pc), pc);
store_computeOnly = 0;
if (STMT_ASSIGN_DELAY(pc)) {
eval(STMT_DELAY_EXPR_CODE(STMT_ASSIGN_DELAY(pc)));
struct Time64 t;
Group2Time(R_ngroups, *--R, &t);
ScheduleDelta64(&t, scb, 0);
} else {
Schedule((delay_t) 0, scb, 0);
}
scb->pc = pc;
TRACE(pc, pc, *R, 1, 1);
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 0, 1);
} else {
readylist->mode = RUN;
if (CMPTIME64(&CurrentTime, &(readylist->time)) != 0) {
set_simulation_time(&(readylist->time));
}
eval_1(readylist->here.decl);
TRACE(pc, pc, *(R - 1), 1, 0);
store_useCached = 1;
store(STMT_ASSIGN_LVAL(pc), pc);
store_useCached = 0;
free_tmp_decl(readylist->here.decl);
exit_context(readylist);
new_pc = dump_current_process();
TRACE(pc, new_pc, NULL_GROUP, 0, 0);
}
break;
case PATH_OUTPUT:
if (CMPTIME64(&CurrentTime, &(readylist->time)) != 0) {
set_simulation_time(&(readylist->time));
}
propagate_specify_path(pc);
new_pc = suspend_current_process();
TRACE(pc, new_pc, NULL_GROUP, 0, 0);
break;
case DELAY_STMT:
if (readylist->mode == RUN) {
eval(STMT_DELAY_EXPR_CODE(pc));
struct Time64 t;
Group2Time(R_ngroups, *--R, &t);
new_pc = WaitOnTime64(&t, pc);
TRACE(pc, new_pc, *R, 0, 1);
} else {
readylist->mode = RUN;
if (CMPTIME64(&CurrentTime, &(readylist->time)) != 0) {
set_simulation_time(&(readylist->time));
}
TRACE(pc, STMT_BODY(pc), NULL_GROUP, 1, 0);
}
break;
case WAIT_STMT:
if (test(STMT_WAIT_EXPR_CODE(pc)) == ONE) {
readylist->mode = RUN;
TRACE(pc, STMT_BODY(pc), NULL_GROUP, 1, 0);
} else {
new_pc = WaitOnEventAll(STMT_WAIT_MARKER(pc), pc);
TRACE(pc, new_pc, NULL_GROUP, 0, 0);
/* Make it so WAIT_STMT will be reexecuted when notified */
}
break;
case ASSIGN_EVENT_STMT:
if (readylist->mode == RUN) {
eval(STMT_ASSIGN_RVAL_CODE(pc));
store(STMT_ASSIGN_TMP(pc), pc);
/* Set the state from which to detect edge */
for (t = STMT_EVENT_EXPR_LIST(STMT_ASSIGN_EVENT(pc)); t;
t = TREE_CHAIN(t)) {
if (TREE_EXPR_CODE(t)) {
eval(TREE_EXPR_CODE(t));
--R;
}
}
new_pc = WaitOnEventAll(STMT_EVENT_MARKER
(STMT_ASSIGN_EVENT(pc)), pc);
TRACE(pc, pc, *R, 1, 1);
TRACE(pc, new_pc, NULL_GROUP, 0, 1);
} else {
readylist->mode = RUN;
eval(STMT_ASSIGN_TMPCODE(pc));
TRACE(pc, pc, *(R - 1), 1, 0);
store(STMT_ASSIGN_LVAL(pc), pc);
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 0, 0);
}
break;
case ASSIGN_NONBLK_EVENT_STMT:
if (readylist->mode == RUN) {
eval(STMT_ASSIGN_RVAL_CODE(pc));
store(STMT_ASSIGN_TMP(pc), pc);
/* Set the state from which to detect edge */
for (t = STMT_EVENT_EXPR_LIST(STMT_ASSIGN_EVENT(pc)); t;
t = TREE_CHAIN(t)) {
if (TREE_EXPR_CODE(t)) {
eval(TREE_EXPR_CODE(t));
--R;
}
}
WaitOnEventOther(STMT_ASSIGN_SCB(pc),
STMT_EVENT_MARKER(STMT_ASSIGN_EVENT(pc)),
pc);
TRACE(pc, pc, *R, 1, 1);
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 0, 1);
} else {
readylist->mode = RUN;
eval(STMT_ASSIGN_TMPCODE(pc));
TRACE(pc, pc, *(R - 1), 1, 0);
store(STMT_ASSIGN_LVAL(pc), pc);
new_pc = dispatch_pc(EVENT_LIST);
TRACE(pc, new_pc, NULL_GROUP, 0, 0);
}
break;
case EVENT_STMT:
if (readylist->mode == RUN) {
/* Set the state from which to detect edge */
for (t = STMT_EVENT_EXPR_LIST(pc); t; t = TREE_CHAIN(t)) {
if (TREE_EXPR_CODE(t)) {
eval(TREE_EXPR_CODE(t));
--R;
}
}
new_pc = WaitOnEventAll(STMT_EVENT_MARKER(pc), pc);
TRACE(pc, new_pc, NULL_GROUP, 0, 0);
} else {
readylist->mode = RUN;
TRACE(pc, STMT_BODY(pc), NULL_GROUP, 1, 0);
}
break;
case ARROW_STMT:
if (DECL_EVENT_CHAIN(STMT_ARROW_EVENT(pc))) {
NotifyEvent(DECL_EVENT_CHAIN(STMT_ARROW_EVENT(pc)),
ZERO, (int) 0);
}
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 0, 0);
break;
case FOREVER_STMT:
TRACE(pc, STMT_BODY(pc), NULL_GROUP, 0, 0);
break;
case TASK_STMT:
if (!free_context || free_context->pc != pc) {
t1 = TASK_INPUT(STMT_TASK_TASK(pc));
for (t = STMT_TASK_INASSIGN(pc); t;
t = TREE_CHAIN(t), t1 = TREE_CHAIN(t1)) {
eval((tree *) TREE_PURPOSE(t));
store(TREE_PURPOSE(t1), STMT_TASK_TASK(pc));
}
enter_context(readylist, STMT_TASK_TASK(pc), pc);
TRACE(pc, BLOCK_BODY(STMT_TASK_TASK(pc)), NULL_GROUP, 0,
0);
} else {
/* Get here on DISABLE */
free_context->pc = NULL;
pc = TREE_CHAIN(pc);
}
break;
case TASK_BLOCK:
new_pc = exit_context(readylist);
free_context->pc = NULL;
t1 = TASK_OUTPUT(STMT_TASK_TASK(new_pc));
for (t = STMT_TASK_OUTASSIGN(new_pc); t;
t = TREE_CHAIN(t), t1 = TREE_CHAIN(t1)) {
eval((tree *) TREE_PURPOSE(t1));
store(TREE_PURPOSE(t), new_pc);
}
TRACE(pc, TREE_CHAIN(new_pc), NULL_GROUP, 0, 0);
break;
case SYSTASK_STMT:
TRACE(pc, pc, NULL_GROUP, 1, 0);
exec_systask(pc);
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 0, 0);
break;
case FUNCTION_REF:
TRACE(pc, BLOCK_BODY(FUNC_REF_FUNC(pc)), NULL_GROUP, 0, 0);
break;
case FUNCTION_BLOCK:
TRACE(pc, pc, NULL_GROUP, 0, 0);
return pc;
case DISABLE_STMT:
broadcast_tf(reason_disable);
{
tree scope = STMT_DISABLE_SCOPE(pc);
TRACE(pc, pc, NULL_GROUP, 1, 0);
readylist->pc = TREE_CHAIN(pc);
while (BLOCK_CONTEXT_LIST(scope)) {
disable_context(BLOCK_CONTEXT_LIST(scope));
}
}
TRACE(pc, readylist->pc, NULL_GROUP, 0, 0);
break;
case DUMMY_RETURN_STMT:
return pc;
case NULL_STMT:
TRACE(pc, TREE_CHAIN(pc), NULL_GROUP, 0, 0);
break;
case LOOPBACK_STMT:
pc = STMT_BODY(pc);
break;
case DUMP_STMT: /* removes INITIAL blocks and interactive stmts */
pc = dump_current_process();