-
Notifications
You must be signed in to change notification settings - Fork 522
/
logic.cc
458 lines (381 loc) · 11 KB
/
logic.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
/*
* Copyright (c) 2001-2004 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
*/
#ifdef HAVE_CVS_IDENT
#ident "$Id: logic.cc,v 1.32 2005/07/06 04:29:25 steve Exp $"
#endif
# include "logic.h"
# include "compile.h"
# include "bufif.h"
# include "npmos.h"
# include "schedule.h"
# include "delay.h"
# include "statistics.h"
# include <string.h>
# include <assert.h>
# include <stdlib.h>
#ifdef HAVE_MALLOC_H
# include <malloc.h>
#endif
/*
* Implementation of the table functor, which provides logic with up
* to 4 inputs.
*/
table_functor_s::table_functor_s(truth_t t)
: table(t)
{
count_functors_table += 1;
}
table_functor_s::~table_functor_s()
{
}
/*
* WARNING: This function assumes that the table generator encodes the
* values 0/1/x/z the same as the vvp_bit4_t enumeration values.
*/
void table_functor_s::recv_vec4(vvp_net_ptr_t ptr, const vvp_vector4_t&val)
{
input_[ptr.port()] = val;
vvp_vector4_t result (val.size());
for (unsigned idx = 0 ; idx < val.size() ; idx += 1) {
unsigned lookup = 0;
for (unsigned pdx = 4 ; pdx > 0 ; pdx -= 1) {
lookup <<= 2;
if (idx < input_[pdx-1].size())
lookup |= input_[pdx-1].value(idx);
}
unsigned off = lookup / 4;
unsigned shift = lookup % 4 * 2;
unsigned bit_val = table[off] >> shift;
bit_val &= 3;
result.set_bit(idx, (vvp_bit4_t)bit_val);
}
vvp_send_vec4(ptr.ptr()->out, result);
}
vvp_fun_boolean_::vvp_fun_boolean_(unsigned wid)
{
for (unsigned idx = 0 ; idx < 4 ; idx += 1)
input_[idx] = vvp_vector4_t(wid);
}
vvp_fun_boolean_::~vvp_fun_boolean_()
{
}
void vvp_fun_boolean_::recv_vec4(vvp_net_ptr_t ptr, const vvp_vector4_t&bit)
{
unsigned port = ptr.port();
if (input_[port] .eeq( bit ))
return;
input_[ptr.port()] = bit;
net_ = ptr.ptr();
schedule_generic(this, 0, false);
}
vvp_fun_and::vvp_fun_and(unsigned wid)
: vvp_fun_boolean_(wid)
{
}
vvp_fun_and::~vvp_fun_and()
{
}
void vvp_fun_and::run_run()
{
vvp_vector4_t result (input_[0]);
for (unsigned idx = 0 ; idx < result.size() ; idx += 1) {
vvp_bit4_t bitbit = result.value(idx);
for (unsigned pdx = 1 ; pdx < 4 ; pdx += 1) {
if (input_[pdx].size() < idx) {
bitbit = BIT4_X;
break;
}
bitbit = bitbit & input_[pdx].value(idx);
}
result.set_bit(idx, bitbit);
}
vvp_send_vec4(net_->out, result);
}
vvp_fun_buf::vvp_fun_buf()
{
count_functors_table += 1;
}
vvp_fun_buf::~vvp_fun_buf()
{
}
/*
* The buf functor is very simple--change the z bits to x bits in the
* vector it passes, and propagate the result.
*/
void vvp_fun_buf::recv_vec4(vvp_net_ptr_t ptr, const vvp_vector4_t&bit)
{
if (ptr.port() != 0)
return;
vvp_vector4_t tmp = bit;
tmp.change_z2x();
vvp_send_vec4(ptr.ptr()->out, tmp);
}
vvp_fun_bufz::vvp_fun_bufz()
{
count_functors_table += 1;
}
vvp_fun_bufz::~vvp_fun_bufz()
{
}
/*
* The bufz is similar to the buf device, except that it does not
* bother translating z bits to x.
*/
void vvp_fun_bufz::recv_vec4(vvp_net_ptr_t ptr, const vvp_vector4_t&bit)
{
if (ptr.port() != 0)
return;
vvp_send_vec4(ptr.ptr()->out, bit);
}
void vvp_fun_bufz::recv_real(vvp_net_ptr_t ptr, double bit)
{
if (ptr.port() != 0)
return;
vvp_send_real(ptr.ptr()->out, bit);
}
vvp_fun_muxz::vvp_fun_muxz(unsigned wid)
: a_(wid), b_(wid)
{
count_functors_table += 1;
select_ = 2;
for (unsigned idx = 0 ; idx < wid ; idx += 1) {
a_.set_bit(idx, BIT4_X);
b_.set_bit(idx, BIT4_X);
}
}
vvp_fun_muxz::~vvp_fun_muxz()
{
}
void vvp_fun_muxz::recv_vec4(vvp_net_ptr_t ptr, const vvp_vector4_t&bit)
{
switch (ptr.port()) {
case 0:
a_ = bit;
break;
case 1:
b_ = bit;
break;
case 2:
assert(bit.size() == 1);
switch (bit.value(0)) {
case BIT4_0:
select_ = 0;
break;
case BIT4_1:
select_ = 1;
break;
default:
select_ = 2;
}
break;
default:
return;
}
switch (select_) {
case 0:
vvp_send_vec4(ptr.ptr()->out, a_);
break;
case 1:
vvp_send_vec4(ptr.ptr()->out, b_);
break;
default:
{
unsigned min_size = a_.size();
unsigned max_size = a_.size();
if (b_.size() < min_size)
min_size = b_.size();
if (b_.size() > max_size)
max_size = b_.size();
vvp_vector4_t res (max_size);
for (unsigned idx = 0 ; idx < min_size ; idx += 1) {
if (a_.value(idx) == b_.value(idx))
res.set_bit(idx, a_.value(idx));
else
res.set_bit(idx, BIT4_X);
}
for (unsigned idx = min_size ; idx < max_size ; idx += 1)
res.set_bit(idx, BIT4_X);
vvp_send_vec4(ptr.ptr()->out, res);
}
break;
}
}
/*
* The parser calls this function to create a logic functor. I allocate a
* functor, and map the name to the vvp_ipoint_t address for the
* functor. Also resolve the inputs to the functor.
*/
void compile_functor(char*label, char*type, unsigned width,
vvp_delay_t*delay, unsigned ostr0, unsigned ostr1,
unsigned argc, struct symb_s*argv)
{
vvp_net_fun_t* obj = 0;
bool strength_aware = false;
if (strcmp(type, "OR") == 0) {
obj = new table_functor_s(ft_OR);
} else if (strcmp(type, "AND") == 0) {
obj = new vvp_fun_and(width);
} else if (strcmp(type, "BUF") == 0) {
obj = new vvp_fun_buf();
} else if (strcmp(type, "BUFIF0") == 0) {
obj = new vvp_fun_bufif(true,false, ostr0, ostr1);
strength_aware = true;
} else if (strcmp(type, "BUFIF1") == 0) {
obj = new vvp_fun_bufif(false,false, ostr0, ostr1);
strength_aware = true;
} else if (strcmp(type, "NOTIF0") == 0) {
obj = new vvp_fun_bufif(true,true, ostr0, ostr1);
strength_aware = true;
} else if (strcmp(type, "NOTIF1") == 0) {
obj = new vvp_fun_bufif(false,true, ostr0, ostr1);
strength_aware = true;
} else if (strcmp(type, "BUFZ") == 0) {
obj = new vvp_fun_bufz();
} else if (strcmp(type, "MUXX") == 0) {
obj = new table_functor_s(ft_MUXX);
} else if (strcmp(type, "MUXZ") == 0) {
obj = new vvp_fun_muxz(width);
} else if (strcmp(type, "NMOS") == 0) {
obj = new vvp_fun_pmos(true);
} else if (strcmp(type, "PMOS") == 0) {
obj = new vvp_fun_pmos(false);
} else if (strcmp(type, "RNMOS") == 0) {
obj = new vvp_fun_rpmos(true);
} else if (strcmp(type, "RPMOS") == 0) {
obj = new vvp_fun_rpmos(false);
} else if (strcmp(type, "EEQ") == 0) {
obj = new table_functor_s(ft_EEQ);
} else if (strcmp(type, "NAND") == 0) {
obj = new table_functor_s(ft_NAND);
} else if (strcmp(type, "NOR") == 0) {
obj = new table_functor_s(ft_NOR);
} else if (strcmp(type, "NOT") == 0) {
obj = new table_functor_s(ft_NOT);
} else if (strcmp(type, "XNOR") == 0) {
obj = new table_functor_s(ft_XNOR);
} else if (strcmp(type, "XOR") == 0) {
obj = new table_functor_s(ft_XOR);
} else {
yyerror("invalid functor type.");
free(type);
free(argv);
free(label);
return;
}
free(type);
assert(argc <= 4);
vvp_net_t*net = new vvp_net_t;
net->fun = obj;
inputs_connect(net, argc, argv);
free(argv);
/* If both the strengths are the default strong drive, then
there is no need for a specialized driver. Attach the label
to this node and we are finished. */
if (strength_aware || ostr0 == 6 && ostr1 == 6 && delay == 0) {
define_functor_symbol(label, net);
free(label);
return;
}
vvp_net_t*net_drv = new vvp_net_t;
vvp_net_fun_t*obj_drv;
if (ostr0 == 6 && ostr1 == 6 && delay != 0) {
obj_drv = new vvp_fun_delay(net_drv, BIT4_X, *delay);
} else {
obj_drv = new vvp_fun_drive(BIT4_X, ostr0, ostr1);
}
net_drv->fun = obj_drv;
/* Point the gate to the drive node. */
net->out = vvp_net_ptr_t(net_drv, 0);
if (delay)
delete delay;
define_functor_symbol(label, net_drv);
free(label);
}
/*
* $Log: logic.cc,v $
* Revision 1.32 2005/07/06 04:29:25 steve
* Implement real valued signals and arith nodes.
*
* Revision 1.31 2005/06/26 21:08:38 steve
* AND functor explicitly knows its width.
*
* Revision 1.30 2005/06/26 18:06:29 steve
* AND gates propogate through scheduler, not directly.
*
* Revision 1.29 2005/06/22 00:04:49 steve
* Reduce vvp_vector4 copies by using const references.
*
* Revision 1.28 2005/06/21 22:48:23 steve
* Optimize vvp_scalar_t handling, and fun_buf Z handling.
*
* Revision 1.27 2005/06/17 03:46:52 steve
* Make functors know their own width.
*
* Revision 1.26 2005/06/12 15:13:37 steve
* Support resistive mos devices.
*
* Revision 1.25 2005/06/12 00:44:49 steve
* Implement nmos and pmos devices.
*
* Revision 1.24 2005/06/02 16:02:11 steve
* Add support for notif0/1 gates.
* Make delay nodes support inertial delay.
* Add the %force/link instruction.
*
* Revision 1.23 2005/05/14 19:43:23 steve
* Move functor delays to vvp_delay_fun object.
*
* Revision 1.22 2005/05/13 05:13:12 steve
* Give buffers support for simple delays.
*
* Revision 1.21 2005/04/13 06:34:20 steve
* Add vvp driver functor for logic outputs,
* Add ostream output operators for debugging.
*
* Revision 1.20 2005/04/03 05:45:51 steve
* Rework the vvp_delay_t class.
*
* Revision 1.19 2005/02/12 22:50:52 steve
* Implement the vvp_fun_muxz functor.
*
* Revision 1.18 2005/02/07 22:42:42 steve
* Add .repeat functor and BIFIF functors.
*
* Revision 1.17 2005/01/29 17:52:06 steve
* move AND to buitin instead of table.
*
* Revision 1.16 2004/12/31 05:56:36 steve
* Add specific BUFZ functor.
*
* Revision 1.15 2004/12/29 23:45:13 steve
* Add the part concatenation node (.concat).
*
* Add a vvp_event_anyedge class to handle the special
* case of .event statements of edge type. This also
* frees the posedge/negedge types to handle all 4 inputs.
*
* Implement table functor recv_vec4 method to receive
* and process vectors.
*
* Revision 1.14 2004/12/11 02:31:29 steve
* Rework of internals to carry vectors through nexus instead
* of single bits. Make the ivl, tgt-vvp and vvp initial changes
* down this path.
*
*/