forked from steveicarus/iverilog
/
t-xnf.cc
1093 lines (956 loc) · 31.4 KB
/
t-xnf.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-xnf.cc,v 1.40 2001/02/10 03:22:49 steve Exp $"
#endif
/* XNF BACKEND
* This target supports generating Xilinx Netlist Format netlists for
* use by Xilinx tools, and other tools that accepts Xilinx designs.
*
* The code generator automatically detects ports to top level modules
* and generates SIG records that make the XNF useable as a schematic.
*
* FLAGS
* The XNF backend uses the following flags from the command line to
* affect the generated file:
*
* part=<foo>
* Specify the part type. The part string is written into the
* PART record. Valid types are defined by Xilinx or the
* receiving tools.
*
* ncf=<path>
* Specify the path to a NCF file. This is an OUTPUT file into
* which the code generator will write netlist constraints that
* relate to pin assignments, CLB placement, etc. If this flag is
* not given, no NCF file will be written.
*
* WIRE ATTRIBUTES
*
* PAD = <io><n>
* Tell the XNF generator that this wire goes to a PAD. The <io>
* is a single character that tells the direction, and <n> is the
* pin number. For example, "o31" is output on pin 31. The PAD
* attribute is not practically connected to a vector, as all the
* bits would go to the same pad.
*
* NODE ATTRIBUTES
*
* XNF-LCA = <lname>:<pin>,<pin>...
* Specify the LCA library part type for the gate. The lname
* is the name of the symbol to use (i.e. DFF) and the comma
* separated list is the names of the pins, in the order they
* appear in the verilog source. If the name is prefixed with a
* tilde (~) then the pin is inverted, and the proper "INV" token
* will be added to the PIN record.
*
* This attribute can override even the typical generation of
* gates that one might naturally expect of the code generator,
* but may be used by the optimizers for placing parts.
*
* An example is "XNF-LCA=OBUF:O,~I". This attribute means that
* the object is an OBUF. Pin 0 is called "O", and pin 1 is
* called "I". In addition, pin 1 is inverted.
*/
# include "netlist.h"
# include "target.h"
# include <fstream>
# include <strstream>
verinum::V link_get_ival(const Link&lnk)
{
const Nexus*nex = lnk.nexus();
for (const Link*cur = nex->first_nlink()
; cur ; cur = cur->next_nlink()) {
if (cur == &lnk)
continue;
if (const NetNet*sig = dynamic_cast<const NetNet*>(cur->get_obj()))
return cur->nexus()->get_init();
}
return verinum::Vx;
}
class target_xnf : public target_t {
public:
bool start_design(const Design*);
void end_design(const Design*);
void memory(const NetMemory*);
void signal(const NetNet*);
void lpm_add_sub(const NetAddSub*);
void lpm_compare(const NetCompare*);
void lpm_compare_eq_(ostream&os, const NetCompare*);
void lpm_compare_ge_(ostream&os, const NetCompare*);
void lpm_compare_le_(ostream&os, const NetCompare*);
void lpm_ff(const NetFF*);
void lpm_mux(const NetMux*);
void lpm_ram_dq(const NetRamDq*);
bool net_const(const NetConst*);
void logic(const NetLogic*);
bool bufz(const NetBUFZ*);
void udp(const NetUDP*);
private:
static string mangle(const string&);
static string choose_sig_name(const Link*lnk);
static void draw_pin(ostream&os, const string&name,
const Link&lnk);
static void draw_sym_with_lcaname(ostream&os, string lca,
const NetNode*net);
static void draw_xor(ostream&os, const NetAddSub*, unsigned idx);
enum adder_type {FORCE0, LOWER, DOUBLE, LOWER_W_CO, EXAMINE_CI };
static void draw_carry(ostream&os, const NetAddSub*, unsigned idx,
enum adder_type);
ofstream out_;
ofstream ncf_;
};
/*
* This function takes a signal name and mangles it into an equivalent
* name that is suitable to the XNF format.
*/
string target_xnf::mangle(const string&name)
{
string result;
for (unsigned idx = 0 ; idx < name.length() ; idx += 1)
switch (name[idx]) {
case '.':
result = result + "/";
break;
default:
result = result + name[idx];
break;
}
return result;
}
/*
* This method takes a signal and pin number as a nexus. Scan the
* nexus to decide which name to use if there are lots of attached
* signals.
*/
string target_xnf::choose_sig_name(const Link*lnk)
{
return mangle( lnk->nexus()->name() );
}
void target_xnf::draw_pin(ostream&os, const string&name,
const Link&lnk)
{
bool inv = false;
string use_name = name;
if (use_name[0] == '~') {
inv = true;
use_name = use_name.substr(1);
}
char type;
switch (lnk.get_dir()) {
case Link::INPUT:
case Link::PASSIVE:
type = 'I';
break;
case Link::OUTPUT:
type = 'O';
break;
}
os << " PIN, " << use_name << ", " << type << ", " <<
choose_sig_name(&lnk);
if (inv) os << ",,INV";
os << endl;
}
static string scrape_pin_name(string&list)
{
unsigned idx = list.find(',');
string name = list.substr(0, idx);
list = list.substr(idx+1);
return name;
}
/*
* This method draws an LCA item based on the XNF-LCA attribute
* given. The LCA attribute gives enough information to completely
* draw the node in XNF, which is pretty handy at this point.
*/
void target_xnf::draw_sym_with_lcaname(ostream&os, string lca,
const NetNode*net)
{
unsigned idx = lca.find(':');
string lcaname = lca.substr(0, idx);
lca = lca.substr(idx+1);
os << "SYM, " << mangle(net->name()) << ", " << lcaname
<< ", LIBVER=2.0.0" << endl;
for (idx = 0 ; idx < net->pin_count() ; idx += 1) {
string usename = scrape_pin_name(lca);
if (usename == "") continue;
draw_pin(os, usename, net->pin(idx));
}
os << "END" << endl;
}
bool target_xnf::start_design(const Design*des)
{
out_.open(des->get_flag("-o").c_str(), ios::out | ios::trunc);
string ncfpath = des->get_flag("ncf");
if (ncfpath != "")
ncf_.open(ncfpath.c_str());
out_ << "LCANET,6" << endl;
out_ << "PROG,verilog,$Name: $,\"Icarus Verilog\"" << endl;
ncf_ << "# Generated by Icarus Verilog $Name: $" << endl;
if (des->get_flag("part") != "") {
out_ << "PART," << des->get_flag("part") << endl;
ncf_ << "CONFIG PART=" << des->get_flag("part") << ";" << endl;
}
return true;
}
void target_xnf::end_design(const Design*)
{
out_ << "EOF" << endl;
ncf_.close();
}
void scrape_pad_info(string str, char&dir, unsigned&num)
{
// Get rid of leading white space
while (str[0] == ' ')
str = str.substr(1);
// Get the direction letter
switch (str[0]) {
case 'b':
case 'B':
dir = 'B';
break;
case 'o':
case 'O':
dir = 'O';
break;
case 'i':
case 'I':
dir = 'I';
break;
case 't':
case 'T':
dir = 'T';
break;
default:
dir = '?';
break;
}
// Get the number part.
str = str.substr(1);
unsigned val = 0;
while (str.size() && isdigit(str[0])) {
val = val * 10 + (str[0]-'0');
str = str.substr(1);
}
num = val;
}
/*
* Memories are handled by the lpm_ram_dq method, so there is nothing
* to do here.
*/
void target_xnf::memory(const NetMemory*)
{
}
/*
* Look for signals that have attributes that are pertinent to XNF
* files. The most obvious are those that have the PAD attribute.
*
* Individual signals are easy, the pad description is a letter
* followed by a decimal number that is the pin.
*
* The PAD attribute for a vector is a comma separated pin
* descriptions, that enumerate the pins from most significant to
* least significant.
*/
void target_xnf::signal(const NetNet*net)
{
/* Look for signals that are ports to the root module. If they
are, the write a SIG record and generate a pin name so that
this module can be used as a macro. */
if (const NetScope*scope = net->scope()) do {
if (scope->parent())
break;
if (net->port_type() == NetNet::NOT_A_PORT)
break;
string mname = mangle(net->name());
string pname = mname.substr(mname.find('/')+1, mname.length());
if (net->pin_count() == 1) {
out_ << "SIG, " << mangle(net->name()) << ", PIN="
<< pname << endl;
} else for (unsigned idx = 0; idx < net->pin_count(); idx += 1) {
out_ << "SIG, " << mangle(net->name()) << "<" << idx
<< ">, PIN=" << pname << idx << endl;
}
} while (0);
/* Now look to see if a PAD attribute is attached, and if so
write out PAD information to the XNF and the ncf files. */
string pad = net->attribute("PAD");
if (pad == "")
return;
if (net->pin_count() > 1) {
cerr << "Signal ``" << net->name() << "'' with PAD=" <<
pad << " is a vector." << endl;
return;
}
char dir;
unsigned num;
scrape_pad_info(pad, dir, num);
out_ << "EXT, " << mangle(net->name()) << ", " << dir
<< ", " << num << endl;
ncf_ << "# Assignment to pin " << num << " (DIR=" << dir <<
") by $attribute(" << net->name() << ", \"PAD\", \"" <<
pad << "\")" << endl;
ncf_ << "NET " << mangle(net->name()) << " LOC=P" << num << ";"
<< endl;
}
void target_xnf::draw_xor(ostream &os, const NetAddSub*gate, unsigned idx)
{
string name = mangle(gate->name());
string name_add = name;
string name_cout = name + "/COUT";
// We only need to pick up the
// carry if we are not the 0 bit. (We know it is 0).
os << "SYM, " << name_add << "<" << (idx+0) << ">, XOR, "
"LIBVER=2.0.0" << endl;
draw_pin(os, "O", gate->pin_Result(idx));
draw_pin(os, "I0", gate->pin_DataA(idx));
draw_pin(os, "I1", gate->pin_DataB(idx));
if (idx > 0) {
os << " PIN, I2, I, " << name_cout << "<" <<
idx << ">" << endl;
}
os << "END" << endl;
}
void target_xnf::draw_carry(ostream &os, const NetAddSub*gate, unsigned idx,
enum adder_type type)
{
string name = mangle(gate->name());
string name_cy4 = name + "/CY";
string name_cym = name + "/CM";
string name_cout = name + "/COUT";
os << "SYM, " << name_cy4 << "<" << idx << ">, CY4, "
"LIBVER=2.0.0" << endl;
// Less significant bit addends, if any
if ( type == LOWER || type == DOUBLE || type == LOWER_W_CO ) {
draw_pin(os, "A0", gate->pin_DataA(idx));
draw_pin(os, "B0", gate->pin_DataB(idx));
}
// More significant bit addends, if any
if ( type == DOUBLE ) {
draw_pin(os, "A1", gate->pin_DataA(idx+1));
draw_pin(os, "B1", gate->pin_DataB(idx+1));
}
// All but FORCE0 cells have carry input
if ( type != FORCE0 ) {
os << " PIN, CIN, I, " << name_cout << "<" << idx << ">" << endl;
}
// Connect the Cout0 to a signal so that I can connect
// it to the adder.
switch (type) {
case LOWER:
case DOUBLE:
os << " PIN, COUT0, O, " << name_cout << "<" << (idx+1) <<
">" << endl;
break;
case EXAMINE_CI:
case LOWER_W_CO:
draw_pin(os, "COUT0", gate->pin_Cout());
break;
}
// Connect the Cout, this will connect to the next Cin
if ( type == FORCE0 || type == DOUBLE ) {
unsigned int to = (type==FORCE0)?(0):(idx+2);
os << " PIN, COUT, O, " << name_cout << "<" << to <<
">" << endl;
}
// These are the mode inputs from the CY_xx pseudo-device
for (unsigned cn = 0 ; cn < 8 ; cn += 1) {
os << " PIN, C" << cn << ", I, " << name << "/C"
<< cn << "<" << (idx) << ">" << endl;
}
os << "END" << endl;
// On to the CY_xx pseudo-device itself
os << "SYM, " << name_cym << "<" << (idx) << ">, ";
switch (type) {
case FORCE0:
os << "CY4_37, CYMODE=FORCE-0" << endl;
break;
case LOWER:
os << "CY4_01, CYMODE=ADD-F-CI" << endl;
break;
case LOWER_W_CO:
os << "CY4_01, CYMODE=ADD-F-CI" << endl;
break;
case DOUBLE:
os << "CY4_02, CYMODE=ADD-FG-CI" << endl;
break;
case EXAMINE_CI:
os << "CY4_42, CYMODE-EXAMINE-CI" << endl;
break;
}
for (unsigned cn = 0 ; cn < 8 ; cn += 1) {
os << " PIN, C" << cn << ", O, " << name << "/C"
<< cn << "<" << (idx) << ">" << endl;
}
os << "END" << endl;
}
/*
* This function makes an adder out of carry logic symbols. It makes
* as many 2 bit adders as are possible, then the top bit is made into
* a 1-bit adder (with carry in) in the F unit. The low carry is
* initialized with the FORCE-0 configuration of a carry unit below
* the 0 bit. This takes up the carry logic of the CLB below, but not
* the G function.
*
* References:
* XNF 6.1 Specification
* Application note XAPP013
* Xilinx Libraries Guide, Chapter 12
*/
void target_xnf::lpm_add_sub(const NetAddSub*gate)
{
unsigned width = gate->width();
/* Make the force-0 carry mode object to initialize the bottom
bits of the carry chain. Label this with the width instead
of the bit position so that symbols don't clash. */
draw_carry(out_, gate, width+1, FORCE0);
/* Now make the 2 bit adders that chain from the cin
initializer and up. Save the tail bits for later. */
for (unsigned idx = 0 ; idx < width-2 ; idx += 2)
draw_carry(out_, gate, idx, DOUBLE);
/* Always have one or two tail bits. The situation gets a
little tricky if we want the carry output, so handle that
here.
If the carry-out is connected, and there are an even number
of data bits, we need to see the cout from the CLB. This is
done by configuring the top CLB CY device as ADD-FG-CI (to
activate cout) and create an extra CLB CY device on top of
the carry chain configured EXAMINE-CI to put the carry into
the G function block.
IF the carry-out is connected and there are an odd number
of data bits, then the top CLB can be configured to carry
the top bit in the F unit and deliver the carry out through
the G unit.
If the carry-out is not connected, then configure this top
CLB as ADD-F-CI. The draw_xor for the top bit will include
the F carry if needed. */
if (gate->pin_Cout().is_linked()) {
if (width%2 == 0) {
draw_carry(out_, gate, width-2, DOUBLE);
draw_carry(out_, gate, width, EXAMINE_CI);
} else {
draw_carry(out_, gate, width-1, LOWER_W_CO);
}
} else {
if (width%2 == 0)
draw_carry(out_, gate, width-2, LOWER);
else
draw_carry(out_, gate, width-1, LOWER);
}
/* Now draw all the single bit (plus carry in) adders from XOR
gates. This puts the F and G units to use. */
for (unsigned idx = 0 ; idx < width ; idx += 1)
draw_xor(out_, gate, idx);
}
/*
* In XNF, comparators are done differently depending on the type of
* comparator being implemented. So, here we dispatch to the correct
* code generator.
*/
void target_xnf::lpm_compare(const NetCompare*dev)
{
if (dev->pin_AEB().is_linked() || dev->pin_ANEB().is_linked()) {
lpm_compare_eq_(out_, dev);
return;
}
if (dev->pin_AGEB().is_linked()) {
lpm_compare_ge_(out_, dev);
return;
}
if (dev->pin_ALEB().is_linked()) {
lpm_compare_le_(out_, dev);
return;
}
assert(0);
}
/*
* To compare that vectors are equal (identity comparator) generate
* XNOR gates to compare each pair of bits, then generate an AND gate
* to combine the bitwise results. This is pretty much the best way to
* do an identity compare in Xilinx CLBs.
*/
void target_xnf::lpm_compare_eq_(ostream&os, const NetCompare*dev)
{
string mname = mangle(dev->name());
/* Draw XNOR gates for each bit pair. These gates to the
bitwise comparison. */
for (unsigned idx = 0 ; idx < dev->width() ; idx += 1) {
os << "SYM, " << mname << "/cmp<" << idx << ">, "
<< "XNOR, LIBVER=2.0.0" << endl;
os << " PIN, O, O, " << mname << "/bit<" << idx << ">"
<< endl;
draw_pin(os, "I0", dev->pin_DataA(idx));
draw_pin(os, "I1", dev->pin_DataB(idx));
os << "END" << endl;
}
/* Now draw an AND gate to combine all the bitwise
comparisons. If there are more the 5 bits of data, then we
are going to have generate a nested AND to combine the
results. */
if (dev->width() > 5) {
for (unsigned idx = 0 ; idx < dev->width() ; idx += 5) {
if ((idx+1) >= dev->width()) break;
os << "SYM, " << mname << "/nest<" << idx
<< ">, AND, LIBVER=2.0.0" << endl;
os << " PIN, O, O, " << mname << "/nbit<" << idx
<< ">" << endl;
os << " PIN, I0, I, " << mname << "/bit<" << idx+0
<< ">" << endl;
os << " PIN, I1, I, " << mname << "/bit<" << idx+1
<< ">" << endl;
if ((idx+2) >= dev->width()) goto gate_out;
os << " PIN, I2, I, " << mname << "/bit<" << idx+2
<< ">" << endl;
if ((idx+3) >= dev->width()) goto gate_out;
os << " PIN, I3, I, " << mname << "/bit<" << idx+3
<< ">" << endl;
if ((idx+4) >= dev->width()) goto gate_out;
os << " PIN, I4, I, " << mname << "/bit<" << idx+4
<< ">" << endl;
gate_out:
os << "END" << endl;
}
/* Draw an AND gate if this is an EQ result, or a NAND
gate of this is a NEQ result. */
if (dev->pin_AEB().is_linked()) {
assert( ! dev->pin_ANEB().is_linked());
os << "SYM, " << mname << ", AND, LIBVER=2.0.0" << endl;
draw_pin(os, "O", dev->pin_AEB());
} else {
assert( dev->pin_ANEB().is_linked());
os << "SYM, " << mname << ", NAND, LIBVER=2.0.0" << endl;
draw_pin(os, "O", dev->pin_ANEB());
}
for (unsigned idx = 0 ; idx < dev->width() ; idx += 5) {
if ((idx+1) == dev->width())
os << " PIN, I" << idx/5 << ", I, " << mname
<< "/bit<" << idx << ">" << endl;
else
os << " PIN, I" << idx/5 << ", I, " << mname
<< "/nbit<" << idx << ">" << endl;
}
os << "END" << endl;
} else {
if (dev->pin_AEB().is_linked()) {
assert( ! dev->pin_ANEB().is_linked());
os << "SYM, " << mname << ", AND, LIBVER=2.0.0" << endl;
draw_pin(os, "O", dev->pin_AEB());
} else {
assert( dev->pin_ANEB().is_linked());
os << "SYM, " << mname << ", NAND, LIBVER=2.0.0" << endl;
draw_pin(os, "O", dev->pin_ANEB());
}
for (unsigned idx = 0 ; idx < dev->width() ; idx += 1) {
os << " PIN, I" << idx << ", I, " << mname << "/bit<"
<< idx << ">" << endl;
}
os << "END" << endl;
}
}
void target_xnf::lpm_compare_ge_(ostream&os, const NetCompare*dev)
{
cerr << "XXXX GE not supported yet" << endl;
}
void target_xnf::lpm_compare_le_(ostream&os, const NetCompare*dev)
{
cerr << "XXXX LE not supported yet" << endl;
}
void target_xnf::lpm_ff(const NetFF*net)
{
string type = net->attribute("LPM_FFType");
if (type == "") type = "DFF";
// XXXX For now, only support DFF
assert(type == "DFF");
string lcaname = net->attribute("XNF-LCA");
if (lcaname != "") {
draw_sym_with_lcaname(out_, lcaname, net);
return;
}
assert(net->attribute("XNF-LCA") == "");
/* Create a DFF object for each bit of width. The symbol name
has the index number appended so that read XNF may be able
to buss them. If the NetNet objects connected to the Q
output of the DFF have an initial value, the write an INIT=
parameter to set the power-up value. */
for (unsigned idx = 0 ; idx < net->width() ; idx += 1) {
verinum::V ival = link_get_ival(net->pin_Q(idx));
out_ << "SYM, " << mangle(net->name()) << "<" << idx << ">, DFF, ";
switch (ival) {
case verinum::V0:
out_ << "INIT=R, ";
break;
case verinum::V1:
out_ << "INIT=S, ";
break;
}
out_ << "LIBVER=2.0.0" << endl;
draw_pin(out_, "Q", net->pin_Q(idx));
draw_pin(out_, "D", net->pin_Data(idx));
if (net->attribute("Clock:LPM_Polarity") == "INVERT")
draw_pin(out_, "~C", net->pin_Clock());
else
draw_pin(out_, "C", net->pin_Clock());
if (net->pin_Enable().is_linked())
draw_pin(out_, "CE", net->pin_Enable());
out_ << "END" << endl;
}
}
/*
* Generate an LPM_MUX.
*
* XXXX NOTE: For now, this only supports combinational LPM_MUX
* devices that have a single select input. These are typically
* generated from ?: expressions.
*/
void target_xnf::lpm_mux(const NetMux*net)
{
assert(net->sel_width() == 1);
assert(net->size() == 2);
for (unsigned idx = 0 ; idx < net->width() ; idx += 1) {
out_ << "SYM, " << mangle(net->name()) << "<" << idx << ">,"
<< " EQN, EQN=(I0 * I2) + (~I0 * I1)" << endl;
draw_pin(out_, "I0", net->pin_Sel(0));
draw_pin(out_, "I1", net->pin_Data(idx,0));
draw_pin(out_, "I2", net->pin_Data(idx,1));
draw_pin(out_, "O", net->pin_Result(idx));
out_ << "END" << endl;
}
}
void target_xnf::lpm_ram_dq(const NetRamDq*ram)
{
assert(ram->count_partners() == 1);
const NetMemory*mem = ram->mem();
for (unsigned idx = 0 ; idx < ram->width() ; idx += 1) {
out_ << "SYM, " << mangle(ram->name())
<< "<" << idx << ">, RAMS" << endl;
draw_pin(out_, "O", ram->pin_Q(idx));
draw_pin(out_, "D", ram->pin_Data(idx));
draw_pin(out_, "WE", ram->pin_WE());
draw_pin(out_, "WCLK", ram->pin_InClock());
for (unsigned adr = 0 ; adr < ram->awidth() ; adr += 1) {
strstream tmp;
tmp << "A" << adr << ends;
draw_pin(out_, tmp.str(), ram->pin_Address(adr));
}
out_ << "END" << endl;
}
}
bool target_xnf::net_const(const NetConst*c)
{
unsigned x_bits = 0;
for (unsigned idx = 0 ; idx < c->pin_count() ; idx += 1) {
verinum::V v=c->value(idx);
const Link& lnk = c->pin(idx);
switch (v) {
case verinum::V0:
out_ << " PWR, 0, " << choose_sig_name(&lnk) << endl;
break;
case verinum::V1:
out_ << " PWR, 1, " << choose_sig_name(&lnk) << endl;
break;
case verinum::Vz:
break;
default:
x_bits += 1;
if (x_bits == 1)
cerr << "xnf: error: Unknown (x) const bit value"
<< " assigned to " << choose_sig_name(&lnk)
<< endl;
break;
}
}
return x_bits == 0;
}
/*
* The logic gates I know so far can be translated directly into XNF
* standard symbol types. This is a fairly obvious transformation.
*/
void target_xnf::logic(const NetLogic*net)
{
// The XNF-LCA attribute overrides anything I might guess
// about this object.
string lca = net->attribute("XNF-LCA");
if (lca != "") {
draw_sym_with_lcaname(out_, lca, net);
return;
}
out_ << "SYM, " << mangle(net->name()) << ", ";
switch (net->type()) {
case NetLogic::AND:
out_ << "AND";
break;
case NetLogic::BUF:
out_ << "BUF";
break;
case NetLogic::NAND:
out_ << "NAND";
break;
case NetLogic::NOR:
out_ << "NOR";
break;
case NetLogic::NOT:
out_ << "INV";
break;
case NetLogic::OR:
out_ << "OR";
break;
case NetLogic::XNOR:
out_ << "XNOR";
break;
case NetLogic::XOR:
out_ << "XOR";
break;
case NetLogic::BUFIF0:
case NetLogic::BUFIF1:
out_ << "TBUF";
break;
default:
cerr << "internal error: XNF: Unhandled logic type." << endl;
break;
}
out_ << ", LIBVER=2.0.0" << endl;
/* All of these kinds of devices have an output on pin 0. */
draw_pin(out_, "O", net->pin(0));
/* Most devices have inputs called I<N> for all the remaining
pins. The TBUF devices are slightly different, but
essentially the same structure. */
switch (net->type()) {
case NetLogic::BUFIF0:
assert(net->pin_count() == 3);
draw_pin(out_, "I", net->pin(1));
draw_pin(out_, "~T", net->pin(2));
break;
case NetLogic::BUFIF1:
assert(net->pin_count() == 3);
draw_pin(out_, "I", net->pin(1));
draw_pin(out_, "T", net->pin(2));
break;
default:
if (net->pin_count() == 2) {
draw_pin(out_, "I", net->pin(1));
} else for (unsigned idx = 1; idx < net->pin_count(); idx += 1) {
string name = "I";
assert(net->pin_count() <= 11);
name += (char)('0'+idx-1);
draw_pin(out_, name, net->pin(idx));
}
break;
}
out_ << "END" << endl;
}
bool target_xnf::bufz(const NetBUFZ*net)
{
static int warned_once=0;
if (!warned_once) {
cerr << "0:0: internal warning: BUFZ objects found "
<< "in XNF netlist." << endl;
cerr << "0:0: : I'll make BUFs for them."
<< endl;
warned_once=1;
}
out_ << "SYM, " << mangle(net->name()) << ", BUF, LIBVER=2.0.0" << endl;
assert(net->pin_count() == 2);
draw_pin(out_, "O", net->pin(0));
draw_pin(out_, "I", net->pin(1));
out_ << "END" << endl;
return true;
}
void target_xnf::udp(const NetUDP*net)
{
string lca = net->attribute("XNF-LCA");
// I only know how to draw a UDP if it has the XNF-LCA
// attribute attached to it.
if (lca == "") {
cerr << "I don't understand this UDP." << endl;
return;
}
draw_sym_with_lcaname(out_, lca, net);
}
static target_xnf target_xnf_obj;
extern const struct target tgt_xnf = { "xnf", &target_xnf_obj };
/*
* $Log: t-xnf.cc,v $
* Revision 1.40 2001/02/10 03:22:49 steve
* Report errors when XNF code has constant X values. (PR#128)
*
* Revision 1.39 2000/11/29 23:15:54 steve
* More informative BUFZ warning.
*
* Revision 1.38 2000/11/29 02:54:49 steve
* Add XNF support for NE comparators.
*
* Revision 1.37 2000/11/29 01:34:17 steve
* Typo writing I pins to AND gates in compare.
*
* Revision 1.36 2000/11/22 21:18:20 steve
* Connect the CE if it is linked at all.
*
* Revision 1.35 2000/08/14 04:39:57 steve
* add th t-dll functions for net_const, net_bufz and processes.
*
* Revision 1.34 2000/08/09 03:43:45 steve
* Move all file manipulation out of target class.
*
* Revision 1.33 2000/08/08 01:50:42 steve
* target methods need not take a file stream.
*
* Revision 1.32 2000/07/14 06:12:58 steve
* Move inital value handling from NetNet to Nexus
* objects. This allows better propogation of inital
* values.
*
* Clean up constant propagation a bit to account
* for regs that are not really values.
*
* Revision 1.31 2000/06/28 18:38:54 steve
* Use nexus type to get nexus name.
*
* Revision 1.30 2000/06/25 19:59:42 steve
* Redesign Links to include the Nexus class that
* carries properties of the connected set of links.
*
* Revision 1.29 2000/05/14 17:55:04 steve
* Support initialization of FF Q value.
*
* Revision 1.28 2000/05/08 05:29:43 steve
* no need for nobufz functor.
*
* Revision 1.27 2000/05/07 04:37:56 steve
* Carry strength values from Verilog source to the
* pform and netlist for gates.
*
* Change vvm constants to use the driver_t to drive
* a constant value. This works better if there are
* multiple drivers on a signal.
*
* Revision 1.26 2000/04/23 23:03:13 steve
* automatically generate macro interface code.
*
* Revision 1.25 2000/04/23 21:15:07 steve
* Emit code for the bufif devices.
*
* Revision 1.24 2000/04/20 02:34:47 steve
* Generate code for identity compare. Use gates.
*
* Revision 1.23 2000/02/23 02:56:55 steve
* Macintosh compilers do not support ident.
*
* Revision 1.22 1999/12/17 03:38:46 steve
* NetConst can now hold wide constants.
*
* Revision 1.21 1999/12/16 18:54:32 steve
* Capture the carry out of carry-chain addition.
*
* Revision 1.20 1999/12/16 02:42:15 steve
* Simulate carry output on adders.
*
* Revision 1.19 1999/12/05 19:30:43 steve
* Generate XNF RAMS from synthesized memories.