forked from steveicarus/iverilog
-
Notifications
You must be signed in to change notification settings - Fork 1
/
t-vvm.cc
3825 lines (3092 loc) · 115 KB
/
t-vvm.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 (c) 1998-2000 Stephen Williams (steve@icarus.com)
*
* This source code is free software; you can redistribute it
* and/or modify it in source code form 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.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*/
#if !defined(WINNT) && !defined(macintosh)
#ident "$Id: t-vvm.cc,v 1.209 2001/06/18 01:54:49 steve Exp $"
#endif
# include <iostream>
# include <fstream>
# include <strstream>
# include <iomanip>
# include <string>
# include <typeinfo>
# include <unistd.h>
# include <stdio.h>
# include "netlist.h"
# include "netmisc.h"
# include "target.h"
// Comparison for use in sorting algorithms.
struct less_verinum {
bool operator() (const verinum&left, const verinum&right) const
{ return left.is_before(right); }
};
/*
* The generated code puts constants in behavioral expressions into a
* bit number table. Every place in the code where a vvm_bits_t is
* created, it references an offset and size into this table. the
* table is collected as numbers are encountered, overlapping values
* as much as possible so that the number of output bits is reduced.
*/
class NumberTable {
public:
NumberTable();
~NumberTable();
unsigned position(const verinum&val);
unsigned count() const { return nbits_; }
verinum::V bit(unsigned idx) const { return bits_[idx]; }
private:
verinum::V*bits_;
unsigned nbits_;
};
NumberTable::NumberTable()
{
bits_ = 0;
nbits_ = 0;
}
NumberTable::~NumberTable()
{
if (bits_) delete[]bits_;
}
unsigned NumberTable::position(const verinum&val)
{
if (bits_ == 0) {
nbits_ = val.len();
bits_ = new verinum::V[val.len()];
for (unsigned idx = 0 ; idx < nbits_ ; idx += 1)
bits_[idx] = val.get(idx);
return 0;
}
/* Look for a complete match. If I find one, then return the
index of the start and all done. */
for (unsigned idx = 0 ; (idx+val.len()) < nbits_ ; idx += 1) {
bool match_flag = true;
for (unsigned bit = 0 ; bit < val.len() ; bit += 1)
if (bits_[idx+bit] != val.get(bit)) {
match_flag = false;
break;
}
if (match_flag)
return idx;
}
unsigned tail_match = 0;
for (unsigned idx = 1; (idx < val.len()) && (idx < nbits_) ; idx += 1) {
bool match_flag = true;
for (unsigned bit = 0 ; bit < idx ; bit += 1)
if (bits_[nbits_-idx+bit] != val.get(bit)) {
match_flag = false;
break;
}
if (match_flag)
tail_match = idx;
}
unsigned ntmp = nbits_+val.len()-tail_match;
verinum::V*tmp = new verinum::V[ntmp];
for (unsigned idx = 0 ; idx < nbits_ ; idx += 1)
tmp[idx] = bits_[idx];
for (unsigned idx = nbits_ ; idx < ntmp ; idx += 1)
tmp[idx] = val.get(idx-nbits_+tail_match);
unsigned rc = nbits_ - tail_match;
delete[]bits_;
bits_ = tmp;
nbits_ = ntmp;
return rc;
}
static string make_temp()
{
static unsigned counter = 0;
ostrstream str;
str << "TMP" << counter << ends;
counter += 1;
return str.str();
}
class target_vvm : public target_t {
public:
target_vvm();
~target_vvm();
virtual bool start_design(const Design*);
virtual void scope(const NetScope*);
virtual void event(const NetEvent*);
virtual void signal(const NetNet*);
virtual void memory(const NetMemory*);
virtual void task_def(const NetScope*);
virtual void func_def(const NetScope*);
virtual void lpm_add_sub(const NetAddSub*);
virtual void lpm_clshift(const NetCLShift*);
virtual void lpm_compare(const NetCompare*);
virtual void lpm_divide(const NetDivide*);
virtual void lpm_modulo(const NetModulo*);
virtual void lpm_ff(const NetFF*);
virtual void lpm_mult(const NetMult*);
virtual void lpm_mux(const NetMux*);
virtual void lpm_ram_dq(const NetRamDq*);
virtual void logic(const NetLogic*);
virtual bool bufz(const NetBUFZ*);
virtual void udp(const NetUDP*);
virtual void net_assign(const NetAssign_*) { }
virtual void net_case_cmp(const NetCaseCmp*);
virtual bool net_cassign(const NetCAssign*);
virtual bool net_const(const NetConst*);
virtual bool net_force(const NetForce*);
virtual void net_probe(const NetEvProbe*);
virtual bool process(const NetProcTop*);
virtual void proc_assign(const NetAssign*);
void proc_assign_rval(const NetAssign_*, const NetEConst*,
unsigned off);
void proc_assign_rval(const NetAssign_*, const string&,
unsigned wid, unsigned off);
virtual void proc_assign_mem(const NetAssignMem*);
virtual void proc_assign_nb(const NetAssignNB*);
void proc_assign_nb_rval(const NetAssign_*, const NetEConst*,
unsigned off);
void proc_assign_nb_rval(const NetAssign_*, const string&,
unsigned wid, unsigned off);
virtual void proc_assign_mem_nb(const NetAssignMemNB*);
virtual bool proc_block(const NetBlock*);
virtual void proc_case(const NetCase*net);
void proc_case_fun(ostream&os, const NetCase*net);
virtual bool proc_cassign(const NetCAssign*);
virtual void proc_condit(const NetCondit*);
void proc_condit_fun(ostream&os, const NetCondit*);
virtual bool proc_deassign(const NetDeassign*);
virtual bool proc_delay(const NetPDelay*);
virtual bool proc_force(const NetForce*);
virtual void proc_forever(const NetForever*);
virtual bool proc_release(const NetRelease*);
virtual void proc_repeat(const NetRepeat*);
virtual void proc_stask(const NetSTask*);
virtual bool proc_trigger(const NetEvTrig*);
virtual void proc_utask( const NetUTask*);
virtual bool proc_wait( const NetEvWait*);
virtual void proc_while(const NetWhile*);
virtual int end_design(const Design*);
void start_process(ostream&os, const NetProcTop*);
void end_process(ostream&os, const NetProcTop*);
NumberTable bits_table;
ofstream out;
// Method definitions go into this file.
char*defn_name;
ofstream defn;
char*init_code_name;
ofstream init_code;
char *start_code_name;
ofstream start_code;
unsigned process_counter;
unsigned thread_step_;
// String constants that are made into vpiHandles have their
// handle name mapped by this.
map<string,unsigned>string_constants;
unsigned string_counter;
// Number constants accessed by vpiHandles are mapped by this.
map<verinum,unsigned,less_verinum>number_constants;
unsigned number_counter;
private:
void emit_init_value_(const Link&lnk, verinum::V val);
void emit_gate_outputfun_(const NetNode*, unsigned);
string defn_gate_outputfun_(ostream&os, const NetNode*, unsigned);
// This is the name of the thread (process or task) that is
// being generated.
string thread_class_;
// This flag is true if we are writing out a function
// definition. Thread steps are not available within
// functions, and certain constructs are handled
// differently. A flag is enough because function definitions
// cannot nest.
bool function_def_flag_;
// These methods are use to help prefent duplicate printouts
// of things that may be scanned multiple times.
map<string,bool>esignal_printed_flag;
map<string,bool>pevent_printed_flag;
unsigned signal_bit_counter;
unsigned signal_counter;
public:
map<string,unsigned>nexus_wire_map;
unsigned nexus_wire_counter;
unsigned selector_counter;
};
static const char*vvm_val_name(verinum::V val,
Link::strength_t drv0,
Link::strength_t drv1)
{
switch (val) {
case verinum::V0:
switch (drv0) {
case Link::HIGHZ:
return "HiZ";
case Link::WEAK:
return "We0";
case Link::PULL:
return "Pu0";
case Link::STRONG:
return "St0";
case Link::SUPPLY:
return "Su0";
}
break;
case verinum::V1:
switch (drv1) {
case Link::HIGHZ:
return "HiZ";
case Link::WEAK:
return "We1";
case Link::PULL:
return "Pu1";
case Link::STRONG:
return "St1";
case Link::SUPPLY:
return "Su1";
}
break;
case verinum::Vx:
return "StX";
case verinum::Vz:
return "HiZ";
}
/* This should not happen! */
return "?strength?";
}
target_vvm::target_vvm()
: function_def_flag_(false), init_code_name(0)
{
}
target_vvm::~target_vvm()
{
assert(function_def_flag_ == false);
}
/*
* This class emits code for the rvalue of a procedural
* assignment. The expression is evaluated to fit the width
* specified. The result is a vvm_bitset_t or equivilent that can be
* used for reading values out.
*/
class vvm_proc_rval : public expr_scan_t {
public:
explicit vvm_proc_rval(target_vvm*t)
: result(""), tgt_(t) { }
string result;
private:
target_vvm*tgt_;
private:
virtual void expr_const(const NetEConst*);
virtual void expr_concat(const NetEConcat*);
virtual void expr_memory(const NetEMemory*mem);
virtual void expr_sfunc(const NetESFunc*);
virtual void expr_signal(const NetESignal*);
virtual void expr_subsignal(const NetESubSignal*sig);
virtual void expr_ternary(const NetETernary*);
virtual void expr_unary(const NetEUnary*);
virtual void expr_binary(const NetEBinary*);
virtual void expr_ufunc(const NetEUFunc*);
};
/*
* The vvm_parm_rval class scans expressions for the purpose of making
* parameters for system tasks/functions. Thus, the generated code is
* geared towards making the handles needed to make the call.
*
* The result of any parm rval scan is a vpiHandle, or a string that
* automatically converts to a vpiHandle on assignment.
*/
class vvm_parm_rval : public expr_scan_t {
public:
explicit vvm_parm_rval(target_vvm*t)
: result(""), tgt_(t) { }
string result;
private:
virtual void expr_binary(const NetEBinary*);
virtual void expr_concat(const NetEConcat*);
virtual void expr_const(const NetEConst*);
virtual void expr_memory(const NetEMemory*);
virtual void expr_scope(const NetEScope*);
virtual void expr_sfunc(const NetESFunc*);
virtual void expr_signal(const NetESignal*);
virtual void expr_ufunc(const NetEUFunc*);
virtual void expr_unary(const NetEUnary*);
private:
target_vvm*tgt_;
void expr_default_(const NetExpr*);
};
/*
* Handle the concatenation operator in a procedural r-value
* expression. Evaluate the concatenation into a temporary variable
* with the right width, and return the name of that temporary as the
* symbol that the context can use.
*/
void vvm_proc_rval::expr_concat(const NetEConcat*expr)
{
assert(expr->repeat() > 0);
string tname = make_temp();
tgt_->defn << " vpip_bit_t " << tname << "_bits["
<< expr->expr_width() << "];" << endl;
tgt_->defn << " vvm_bitset_t " << tname << "(" << tname << "_bits, "
<< expr->expr_width() << ");" << endl;
unsigned pos = 0;
for (unsigned rept = 0 ; rept < expr->repeat() ; rept += 1)
for (unsigned idx = 0 ; idx < expr->nparms() ; idx += 1) {
NetExpr*pp = expr->parm(expr->nparms() - idx - 1);
pp->expr_scan(this);
for (unsigned bit = 0 ; bit < pp->expr_width() ; bit += 1) {
tgt_->defn << " " << tname << "[" << pos
<<"] = " << result << "[" << bit << "];"
<< endl;
pos+= 1;
}
assert(pos <= expr->expr_width());
}
/* Check that the positions came out to the right number of
bits. */
if (pos != expr->expr_width()) {
tgt_->defn << "#error \"" << expr->get_line() << ": vvm error: "
<< "width is " << expr->expr_width() << ", but I count "
<< pos << " bits.\"" << endl;
}
result = tname;
}
void vvm_proc_rval::expr_const(const NetEConst*expr)
{
string tname = make_temp();
unsigned number_off = tgt_->bits_table.position(expr->value());
tgt_->defn << " vvm_bitset_t " << tname << "(const_bits_table+"
<< number_off << ", " << expr->expr_width() << ");" << endl;
result = tname;
}
/*
* a bitset rval that is a memory reference.
*/
void vvm_proc_rval::expr_memory(const NetEMemory*mem)
{
/* Make a temporary to hold the word from the memory. */
const string tname = make_temp();
tgt_->defn << " vpip_bit_t " << tname << "_bits["
<< mem->expr_width() << "];" << endl;
tgt_->defn << " vvm_bitset_t " << tname << "(" << tname << "_bits, "
<< mem->expr_width() << ");" << endl;
const string mname = mangle(mem->name());
/* Evaluate the memory index */
assert(mem->index());
mem->index()->expr_scan(this);
/* Write code to use the calculated index to get the word from
the memory into the temporary we created earlier. */
tgt_->defn << " " << mname << ".get_word("
<< result << ".as_unsigned(), " << tname << ");" << endl;
result = tname;
}
void vvm_proc_rval::expr_sfunc(const NetESFunc*fun)
{
tgt_->defn << " // " << fun->get_line() << endl;
const string retval = make_temp();
const unsigned retwid = fun->expr_width();
/* Make any parameters that might be needed to be passed to
the function. */
const string parmtab = make_temp();
if (fun->nparms() > 0) {
tgt_->defn << " vpiHandle " << parmtab
<< "["<<fun->nparms()<<"];" << endl;
for (unsigned idx = 0 ; idx < fun->nparms() ; idx += 1) {
vvm_parm_rval scan(tgt_);
fun->parm(idx)->expr_scan(&scan);
tgt_->defn << " " << parmtab <<"["<<idx<<"] = "
<< scan.result << ";" << endl;
}
}
/* Draw the call to the function. Create a vpip_bit_t array to
receive the return value, and make it into a vvm_bitset_t
when the call returns. */
tgt_->defn << " vpip_bit_t " << retval << "_bits["<<retwid<<"];"
<< endl;
tgt_->defn << " vpip_callfunc(\"" << stresc(fun->name()) << "\", "
<< retwid << ", " << retval<<"_bits";
if (fun->nparms() == 0)
tgt_->defn << ", 0, 0";
else
tgt_->defn << ", " << fun->nparms() << ", " << parmtab;
tgt_->defn << ");" << endl;
tgt_->defn << " vvm_bitset_t " << retval << "(" << retval<<"_bits, "
<< retwid << ");" << endl;
result = retval;
}
/*
* A bitset reference to a signal can be done simply by referring to
* the same bits as the signal. We onlt need to copy the bits pointer
* from the vvm_signal_t object to get our reference.
*/
void vvm_proc_rval::expr_signal(const NetESignal*expr)
{
const string tname = make_temp();
tgt_->defn << " vvm_bitset_t " << tname << "("
<< mangle(expr->name()) << ".bits, "
<< expr->expr_width() << ");" << endl;
result = tname;
}
void vvm_proc_rval::expr_subsignal(const NetESubSignal*sig)
{
string idx = make_temp();
string val = make_temp();
if (const NetEConst*cp = dynamic_cast<const NetEConst*>(sig->index())) {
tgt_->defn << " const unsigned " << idx
<< " = " << cp->value().as_ulong() << ";" << endl;
} else {
sig->index()->expr_scan(this);
tgt_->defn << " const unsigned " << idx
<< " = " << result << ".as_unsigned();" << endl;
}
/* Get the bit select of a signal by making a vvm_bitset_t
object that refers to the single bit within the signal that
is of interest. */
tgt_->defn << " vvm_bitset_t " << val << "("
<< mangle(sig->name()) << ".bits+" << idx << ", 1);" << endl;
result = val;
}
void vvm_proc_rval::expr_ternary(const NetETernary*expr)
{
expr->cond_expr()->expr_scan(this);
string cond_val = result;
expr->true_expr()->expr_scan(this);
string true_val = result;
expr->false_expr()->expr_scan(this);
string false_val = result;
result = make_temp();
tgt_->defn << " vpip_bit_t " << result << "_bits["
<< expr->expr_width() << "];" << endl;
tgt_->defn << " vvm_bitset_t " << result << "(" << result<<"_bits, "
<< expr->expr_width() << ");" << endl;
tgt_->defn << " vvm_ternary(" << result << ", " << cond_val<<"[0], "
<< true_val << ", " << false_val << ");" << endl;
}
/*
* A function call is handled by assigning the parameters from the
* input expressions, then calling the function. After the function
* returns, copy the result into a temporary variable.
*
* Function calls are different from tasks in this regard--tasks had
* all this assigning arranged during elaboration. For functions, we
* must do it ourselves.
*/
void vvm_proc_rval::expr_ufunc(const NetEUFunc*expr)
{
const NetFuncDef*def = expr->func()->func_def();
const unsigned pcnt = expr->parm_count();
assert(pcnt == (def->port_count()-1));
/* Scan the parameter expressions, and assign the values to
the parameter port register. */
for (unsigned idx = 0 ; idx < pcnt ; idx += 1) {
assert(expr->parm(idx));
const NetNet*pnet = def->port(idx+1);
assert(pnet);
expr->parm(idx)->expr_scan(this);
tgt_->defn << " // " << pnet->name() << " == "
<< result << endl;
unsigned wid = expr->parm(idx)->expr_width();
if (pnet->pin_count() < wid)
wid = pnet->pin_count();
string bname = mangle(def->port(idx+1)->name());
for (unsigned bit = 0 ; bit < wid ; bit += 1) {
string nexus = pnet->pin(bit).nexus()->name();
unsigned ncode = tgt_->nexus_wire_map[nexus];
tgt_->defn << " nexus_wire_table["<<ncode<<"]"
<< ".reg_assign(" << result << "["<<bit<<"]"
<< ");" << endl;
}
}
/* Make the function call. */
tgt_->defn << " { bool flag;" << endl;
tgt_->defn << " flag = " << mangle(expr->name())<<"(thr);"<< endl;
tgt_->defn << " if (flag == false) return false;" << endl;
tgt_->defn << " }" << endl;
/* rbits is the bits of the signal that hold the result. */
string rbits = mangle(expr->result()->name()) + ".bits";
/* Make a temporary to hold the result... */
result = make_temp();
tgt_->defn << " vpip_bit_t " << result << "_bits["
<< expr->expr_width() << "];" << endl;
tgt_->defn << " vvm_bitset_t " << result << "("
<< result<<"_bits, " << expr->expr_width() << ");" << endl;
/* Copy the result into the new temporary. */
for (unsigned idx = 0 ; idx < expr->expr_width() ; idx += 1)
tgt_->defn << " " << result << "_bits[" << idx << "] = "
<< rbits << "[" << idx << "];" << endl;
}
void vvm_proc_rval::expr_unary(const NetEUnary*expr)
{
expr->expr()->expr_scan(this);
string tname = make_temp();
tgt_->defn << " vpip_bit_t " << tname << "_bits["
<< expr->expr_width() << "];" << endl;
tgt_->defn << " vvm_bitset_t " << tname << "(" << tname<<"_bits, "
<< expr->expr_width() << ");" << endl;
switch (expr->op()) {
case '~':
tgt_->defn << " vvm_unop_not(" << tname << "," << result <<
");" << endl;
break;
case '&':
tgt_->defn << " " << tname << "[0] "
"= vvm_unop_and("<<result<<");" << endl;
break;
case '|':
tgt_->defn << " " << tname << "[0] "
"= vvm_unop_or("<<result<<");" << endl;
break;
case '^':
tgt_->defn << " " << tname << "[0] "
"= vvm_unop_xor("<<result<<");" << endl;
break;
case '!':
tgt_->defn << " " << tname << "[0] "
"= vvm_unop_lnot("<<result<<");" << endl;
break;
case '-':
tgt_->defn << "vvm_unop_uminus(" <<tname<< "," << result << ");" << endl;
break;
case 'A':
tgt_->defn << " " << tname << "[0] "
"= vvm_unop_nand("<<result<<");" << endl;
break;
case 'N':
tgt_->defn << " " << tname << "[0] "
"= vvm_unop_nor("<<result<<");" << endl;
break;
case 'X':
tgt_->defn << " " << tname << "[0] "
"= vvm_unop_xnor("<<result<<");" << endl;
break;
default:
cerr << "vvm error: Unhandled unary op `" << expr->op() << "'"
<< endl;
tgt_->defn << "#error \"" << expr->get_line() << ": vvm error: "
"Unhandled unary op: " << *expr << "\"" << endl;
tgt_->defn << result << ";" << endl;
break;
}
result = tname;
}
void vvm_proc_rval::expr_binary(const NetEBinary*expr)
{
expr->left()->expr_scan(this);
string lres = result;
expr->right()->expr_scan(this);
string rres = result;
assert(expr->expr_width() != 0);
result = make_temp();
tgt_->defn << " // " << expr->get_line() << ": expression node." << endl;
tgt_->defn << " vpip_bit_t " << result<<"_bits[" << expr->expr_width()
<< "];" << endl;
tgt_->defn << " vvm_bitset_t " << result << "(" << result << "_bits, "
<< expr->expr_width() << ");" << endl;
switch (expr->op()) {
case 'a': // logical and (&&)
tgt_->defn << " " << result << "[0] = vvm_binop_land("
<< lres << "," << rres << ");" << endl;
break;
case 'E': // ===
tgt_->defn << " " << result << "[0] = vvm_binop_eeq("
<< lres << "," << rres << ");" << endl;
break;
case 'e': // ==
tgt_->defn << " " << result << "[0] = vvm_binop_eq("
<< lres << "," << rres << ");" << endl;
break;
case 'G': // >=
if (expr->left()->has_sign() && expr->right()->has_sign()) {
tgt_->defn << " " << result << "[0] = vvm_binop_ge_s("
<< lres << "," << rres << ");" << endl;
} else {
tgt_->defn << " " << result << "[0] = vvm_binop_ge("
<< lres << "," << rres << ");" << endl;
}
break;
case 'l': // left shift(<<)
tgt_->defn << " " << "vvm_binop_shiftl(" << result
<< ", " << lres << "," << rres << ");" << endl;
break;
case 'L': // <=
if (expr->left()->has_sign() && expr->right()->has_sign()) {
tgt_->defn << " " << result << "[0] = vvm_binop_le_s("
<< lres << "," << rres << ");" << endl;
} else {
tgt_->defn << " " << result << "[0] = vvm_binop_le("
<< lres << "," << rres << ");" << endl;
}
break;
case 'N': // !==
tgt_->defn << " " << result << "[0] = vvm_binop_nee("
<< lres << "," << rres << ");" << endl;
break;
case 'n':
tgt_->defn << " " << result << "[0] = vvm_binop_ne("
<< lres << "," << rres << ");" << endl;
break;
case '<':
if (expr->left()->has_sign() && expr->right()->has_sign()) {
tgt_->defn << " " << result << "[0] = vvm_binop_lt_s("
<< lres << "," << rres << ");" << endl;
} else {
tgt_->defn << " " << result << "[0] = vvm_binop_lt("
<< lres << "," << rres << ");" << endl;
}
break;
case '>':
if (expr->left()->has_sign() && expr->right()->has_sign()) {
tgt_->defn << " " << result << "[0] = vvm_binop_gt_s("
<< lres << "," << rres << ");" << endl;
} else {
tgt_->defn << " " << result << "[0] = vvm_binop_gt("
<< lres << "," << rres << ");" << endl;
}
break;
case 'o': // logical or (||)
tgt_->defn << " " << result << "[0] = vvm_binop_lor("
<< lres << "," << rres << ");" << endl;
break;
case 'r': // right shift(>>)
tgt_->defn << " " << "vvm_binop_shiftr(" << result
<< ", " << lres << "," << rres << ");" << endl;
break;
case 'X':
tgt_->defn << " " << "vvm_binop_xnor(" << result
<< ", " << lres << "," << rres << ");" << endl;
break;
case '+':
tgt_->defn << " " << "vvm_binop_plus(" << result
<< ", " << lres << "," << rres << ");" << endl;
break;
case '-':
tgt_->defn << " " << "vvm_binop_minus(" << result
<< ", " << lres << "," << rres << ");" << endl;
break;
case '&':
tgt_->defn << " " << "vvm_binop_and(" << result
<< ", " << lres << ", " << rres << ");" << endl;
break;
case '|':
tgt_->defn << " " << "vvm_binop_or(" << result
<< ", " << lres << ", " << rres << ");" << endl;
break;
case '^':
tgt_->defn << " " << "vvm_binop_xor(" << result
<< ", " << lres << ", " << rres << ");" << endl;
break;
case '*':
tgt_->defn << " " << "vvm_binop_mult(" << result
<< "," << lres << "," << rres << ");" << endl;
break;
case '/':
tgt_->defn << " " << "vvm_binop_idiv(" << result
<< "," << lres << "," << rres << ");" << endl;
break;
case '%':
tgt_->defn << " " << "vvm_binop_imod(" << result
<< "," << lres << "," << rres << ");" << endl;
break;
default:
cerr << "vvm: Unhandled binary op `" << expr->op() << "': "
<< *expr << endl;
tgt_->defn << "#error \"" << expr->get_line() << ": vvm error: "
"Unhandled binary op: " << *expr << "\"" << endl;
result = lres;
break;
}
}
static string emit_proc_rval(target_vvm*tgt, const NetExpr*expr)
{
vvm_proc_rval scan (tgt);
expr->expr_scan(&scan);
return scan.result;
}
/*
* This is the default implementation for the expressions that are to
* be passed as parameters to system tasks. This uses the proc_rval
* class to make a vvm_bitset_t, then makes a vpiNumberConst out of that.
*/
void vvm_parm_rval::expr_default_(const NetExpr*expr)
{
string rval = emit_proc_rval(tgt_, expr);
string tmp = make_temp();
tgt_->defn << " struct __vpiNumberConst " << tmp << ";" << endl;
tgt_->defn << " vpip_make_number_const(&" << tmp << ", "
<< rval << ".bits, " << expr->expr_width() << ");" << endl;
result = "&" + tmp + ".base";
}
void vvm_parm_rval::expr_binary(const NetEBinary*expr)
{
expr_default_(expr);
}
void vvm_parm_rval::expr_concat(const NetEConcat*expr)
{
expr_default_(expr);
}
void vvm_parm_rval::expr_ufunc(const NetEUFunc*expr)
{
expr_default_(expr);
}
void vvm_parm_rval::expr_unary(const NetEUnary*expr)
{
expr_default_(expr);
}
void vvm_parm_rval::expr_const(const NetEConst*expr)
{
if (expr->value().is_string()) {
unsigned& res = tgt_->string_constants[expr->value().as_string()];
if (res == 0) {
res = tgt_->string_counter ++;
tgt_->init_code << " vpip_make_string_const("
"&string_table[" << res << "], \"" <<
expr->value().as_string() << "\");" << endl;
}
ostrstream tmp;
tmp << "&string_table[" << res << "].base" << ends;
result = tmp.str();
return;
}
unsigned&res = tgt_->number_constants[expr->value()];
if (res == 0) {
res = tgt_->number_counter ++;
unsigned width = expr->expr_width();
unsigned bit_idx = tgt_->bits_table.position(expr->value());
tgt_->init_code << " vpip_make_number_const("
<< "&number_table[" << res << "], "
<< "const_bits_table+" << bit_idx << ", "
<< width << ");" << endl;
}
ostrstream tmp;
tmp << "&number_table[" << res << "].base" << ends;
result = tmp.str();
return;
}
void vvm_parm_rval::expr_sfunc(const NetESFunc*expr)
{
if (!strcmp(expr->name(),"$time")) {
result = string("vpip_sim_time()");
} else {
cerr << "Unhandled identifier: " << expr->name() << endl;
}
}
void vvm_parm_rval::expr_memory(const NetEMemory*mem)
{
if (mem->index() == 0) {
/* If the expression is a memory without an index, then
return the handle for the memory object. System tasks
can take such things as parameters. */
result = string("&") + mangle(mem->name()) + ".base";
} else if (const NetEConst*idx = dynamic_cast<const NetEConst*>(mem->index())){
/* If the expression is a memory with a constant index,
then generate a call to vpi_handle_by_index() to get
the memory word handle. */
unsigned long val = idx->value().as_ulong();
ostrstream res;
res << "vpi_handle_by_index(&" << mangle(mem->name()) <<
".base, " << val << ")" << ends;
result = res.str();
} else {
/* Otherwise, evaluate the index at run time and use
that to select the memory word. */
string rval = emit_proc_rval(tgt_, mem->index());
result = "vpi_handle_by_index(&" + mangle(mem->name()) +
".base, " + rval + ".as_unsigned())";
}
}
void vvm_parm_rval::expr_scope(const NetEScope*escope)
{
result = string("&") + mangle(escope->scope()->name()) + "_scope.base";
}
void vvm_parm_rval::expr_signal(const NetESignal*expr)
{
string res = string("&") + mangle(expr->name()) + ".base";
result = res;
}
static string emit_parm_rval(target_vvm*tgt, const NetExpr*expr)
{
vvm_parm_rval scan (tgt);
expr->expr_scan(&scan);
return scan.result;
}
bool target_vvm::start_design(const Design*mod)
{
out.open(mod->get_flag("-o").c_str(), ios::out | ios::trunc);
defn_name = tempnam(0, "ivldf");
defn.open(defn_name, ios::in | ios::out | ios::trunc);
init_code_name = tempnam(0, "ivlic");
init_code.open(init_code_name, ios::in | ios::out | ios::trunc);
start_code_name = tempnam(0, "ivlsc");
start_code.open(start_code_name, ios::in | ios::out | ios::trunc);
out << "# include \"vvm.h\"" << endl;
out << "# include \"vvm_nexus.h\"" << endl;
out << "# include \"vvm_gates.h\"" << endl;
out << "# include \"vvm_signal.h\"" << endl;
out << "# include \"vvm_func.h\"" << endl;
out << "# include \"vvm_calltf.h\"" << endl;
out << "# include \"vvm_thread.h\"" << endl;
out << "# include \"vpi_user.h\"" << endl;
out << "# include \"vpi_priv.h\"" << endl;
signal_bit_counter = 0;
signal_counter = 0;
process_counter = 0;
string_counter = 1;
number_counter = 1;
nexus_wire_counter = 1;
selector_counter = 0;
init_code << "static void design_init()" << endl;
init_code << "{" << endl;