1 | /*------------------------------------------------------------\ |
---|
2 | | | |
---|
3 | | Tool : systemcass | |
---|
4 | | | |
---|
5 | | File : entity.cc | |
---|
6 | | | |
---|
7 | | Author : Buchmann Richard | |
---|
8 | | Taktak Sami | |
---|
9 | | | |
---|
10 | | Date : 09_07_2004 | |
---|
11 | | | |
---|
12 | \------------------------------------------------------------*/ |
---|
13 | |
---|
14 | /* |
---|
15 | * This file is part of the Disydent Project |
---|
16 | * Copyright (C) Laboratoire LIP6 - Département ASIM |
---|
17 | * Universite Pierre et Marie Curie |
---|
18 | * |
---|
19 | * Home page : http://www-asim.lip6.fr/disydent |
---|
20 | * E-mail : mailto:richard.buchmann@lip6.fr |
---|
21 | * |
---|
22 | * This library is free software; you can redistribute it and/or modify it |
---|
23 | * under the terms of the GNU Library General Public License as published |
---|
24 | * by the Free Software Foundation; either version 2 of the License, or (at |
---|
25 | * your option) any later version. |
---|
26 | * |
---|
27 | * Disydent is distributed in the hope that it will be |
---|
28 | * useful, but WITHOUT ANY WARRANTY; without even the implied warranty of |
---|
29 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General |
---|
30 | * Public License for more details. |
---|
31 | * |
---|
32 | * You should have received a copy of the GNU General Public License along |
---|
33 | * with the GNU C Library; see the file COPYING. If not, write to the Free |
---|
34 | * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
---|
35 | */ |
---|
36 | |
---|
37 | #include <cstring> |
---|
38 | #include <iomanip> |
---|
39 | #include <list> |
---|
40 | #include <map> |
---|
41 | #include <vector> |
---|
42 | #include <cassert> |
---|
43 | |
---|
44 | #include "entity.h" |
---|
45 | #include "sc_port.h" |
---|
46 | #include "sc_signal.h" |
---|
47 | #include "sc_module.h" |
---|
48 | |
---|
49 | #ifdef HAVE_CONFIG_H |
---|
50 | #include "config.h" |
---|
51 | #endif |
---|
52 | |
---|
53 | using namespace std; |
---|
54 | |
---|
55 | namespace sc_core { |
---|
56 | |
---|
57 | equi_list_t equi_list; |
---|
58 | equi_table_t equi_table = NULL; |
---|
59 | |
---|
60 | ostream & operator << (ostream &, const entity &); |
---|
61 | ostream & operator << (ostream &, const equi_t &); |
---|
62 | |
---|
63 | struct predic4entity2equi_t_t { |
---|
64 | bool operator() (const entity & e1, const entity & e2) const { |
---|
65 | return e1.interface < e2.interface; |
---|
66 | } |
---|
67 | }; |
---|
68 | |
---|
69 | typedef std::map <entity, equi_list_t::iterator, predic4entity2equi_t_t> entity2equi_it_t; |
---|
70 | |
---|
71 | |
---|
72 | ostream & operator << (ostream & o, const entity2equi_it_t & m) { |
---|
73 | entity2equi_it_t::const_iterator i; |
---|
74 | for (i = m.begin(); i != m.end(); ++i) { |
---|
75 | o << (i->first) << " : " << *(i->second) << "\n"; |
---|
76 | } |
---|
77 | return o; |
---|
78 | } |
---|
79 | |
---|
80 | entity2equi_it_t equi_map; |
---|
81 | |
---|
82 | |
---|
83 | const equi_list_t & get_equi_list() { |
---|
84 | return equi_list; |
---|
85 | } |
---|
86 | |
---|
87 | |
---|
88 | unsigned int max(unsigned int a, unsigned int b) { |
---|
89 | return (a > b) ? a : b; |
---|
90 | } |
---|
91 | |
---|
92 | |
---|
93 | static int get_signal_table_size(const equi_list_t & e) { |
---|
94 | // bug fix : remove the 0x0 equi from the list |
---|
95 | equi_list_t::const_iterator i; |
---|
96 | int capacity = 0; |
---|
97 | for (i = e.begin(); i != e.end(); ++i) { |
---|
98 | //cerr << i->begin()->object->name (); |
---|
99 | const entity & ent = *(i->begin()); |
---|
100 | int data_size = ent.data_size_in_bytes(); |
---|
101 | int number_of_part = ((data_size - 1) / sizeof(tab_t)) + 1; |
---|
102 | capacity += number_of_part; |
---|
103 | } |
---|
104 | return capacity; |
---|
105 | } |
---|
106 | |
---|
107 | |
---|
108 | int get_signal_table_size() { |
---|
109 | return get_signal_table_size(equi_list); |
---|
110 | } |
---|
111 | |
---|
112 | |
---|
113 | sc_port_base * get_out_port(const equi_t & eq) { |
---|
114 | equi_t::const_iterator i; |
---|
115 | for (i = eq.begin(); i != eq.end(); ++i) { |
---|
116 | const char * type = i->kind(); |
---|
117 | if ((type == sc_core::sc_out_string) || (type == sc_core::sc_inout_string)) { |
---|
118 | return i->port; |
---|
119 | } |
---|
120 | } |
---|
121 | return NULL; |
---|
122 | } |
---|
123 | |
---|
124 | static sc_port_base * get_localvar(equi_t & eq) { |
---|
125 | equi_t::iterator i; |
---|
126 | for (i = eq.begin(); i != eq.end(); ++i) { |
---|
127 | const char *type = i->kind(); |
---|
128 | if (strcmp(type, "sc_localvar") == 0) { |
---|
129 | return i->port; |
---|
130 | } |
---|
131 | } |
---|
132 | return NULL; |
---|
133 | } |
---|
134 | |
---|
135 | |
---|
136 | static sc_port_base * get_signal(equi_t & eq) { |
---|
137 | equi_t::iterator i; |
---|
138 | for (i = eq.begin(); i != eq.end(); ++i) { |
---|
139 | const char * type = i->kind(); |
---|
140 | if (strcmp(type, "sc_signal") == 0) { |
---|
141 | return i->port; |
---|
142 | } |
---|
143 | } |
---|
144 | return NULL; |
---|
145 | } |
---|
146 | |
---|
147 | |
---|
148 | equi_t & get_equi(const sc_interface & i) { |
---|
149 | return get_equi(i.get_pointer()); |
---|
150 | } |
---|
151 | |
---|
152 | |
---|
153 | struct predic4tab_t2equi_t_t { |
---|
154 | bool operator() (const tab_t * t1, const tab_t * t2) const { |
---|
155 | return t1 < t2; |
---|
156 | } |
---|
157 | }; |
---|
158 | |
---|
159 | |
---|
160 | #define get_equi_SPEEDUP |
---|
161 | equi_t & get_equi(const tab_t * pointer) { |
---|
162 | // result variable |
---|
163 | equi_list_t::iterator i; |
---|
164 | #if defined(get_equi_SPEEDUP) |
---|
165 | typedef std::map <const tab_t *, equi_list_t::iterator, predic4tab_t2equi_t_t> tab_t2equi_it_t; |
---|
166 | static tab_t2equi_it_t tab2equi_map; |
---|
167 | assert(pointer != NULL); |
---|
168 | |
---|
169 | tab_t2equi_it_t:: /*const_ */ iterator it = tab2equi_map.find(pointer); |
---|
170 | if (it != tab2equi_map.end()) { |
---|
171 | i = it->second; |
---|
172 | return *i; |
---|
173 | } |
---|
174 | #endif |
---|
175 | |
---|
176 | |
---|
177 | for (i = equi_list.begin(); i != equi_list.end(); ++i) { |
---|
178 | const equi_t::iterator & j = i->begin(); |
---|
179 | const entity & e = *j; |
---|
180 | const sc_interface * f = e.interface; |
---|
181 | const tab_t * p = f->get_pointer(); |
---|
182 | if (p == pointer) { |
---|
183 | #if defined(get_equi_SPEEDUP) |
---|
184 | tab2equi_map[pointer] = i; |
---|
185 | #endif |
---|
186 | return *i; |
---|
187 | } |
---|
188 | } |
---|
189 | cerr << "Internal error : get_equi(" << pointer << ")\n"; |
---|
190 | exit(11); |
---|
191 | } |
---|
192 | #undef get_equi_SPEEDUP |
---|
193 | |
---|
194 | |
---|
195 | bool has_equi( /*const */ sc_port_base & port) { |
---|
196 | entity e(port); |
---|
197 | entity2equi_it_t::/*const_ */iterator it = equi_map.find(e); |
---|
198 | if (it == equi_map.end()) { |
---|
199 | return false; |
---|
200 | } |
---|
201 | return true; |
---|
202 | } |
---|
203 | |
---|
204 | |
---|
205 | static bool is_register(const equi_t & eq) { |
---|
206 | return eq.size() == 1; |
---|
207 | } |
---|
208 | |
---|
209 | static int count_level(const char * s, char c) { |
---|
210 | int i; |
---|
211 | int counter = 0; |
---|
212 | for (i = 0; s[i] != '\0'; ++i) { |
---|
213 | if (s[i] == c) { |
---|
214 | ++counter; |
---|
215 | } |
---|
216 | } |
---|
217 | return counter; |
---|
218 | } |
---|
219 | |
---|
220 | |
---|
221 | const char * get_name(const equi_t & e) { |
---|
222 | equi_t::const_iterator top_iter = e.begin(); |
---|
223 | #ifdef CONFIG_DEBUG |
---|
224 | if (top_iter == e.end()) { |
---|
225 | cerr << "Internal error : no signal in " << e << endl; |
---|
226 | exit(25); |
---|
227 | } |
---|
228 | if (top_iter->object == NULL) { |
---|
229 | cerr << "Internal error : no object bound to "; |
---|
230 | cerr << *top_iter; |
---|
231 | cerr << endl; |
---|
232 | exit(26); |
---|
233 | } |
---|
234 | if (top_iter->object->name() == NULL) { |
---|
235 | cerr << "Internal error : signal has no name.\n"; |
---|
236 | cerr << *top_iter; |
---|
237 | cerr << endl; |
---|
238 | } |
---|
239 | #endif |
---|
240 | int top_level = count_level(top_iter->object->name(), '.'); |
---|
241 | equi_t::const_iterator i; |
---|
242 | for (i = ++(e.begin()); i != e.end(); ++i) { |
---|
243 | int current_level = count_level(i->object->name(), '.'); |
---|
244 | if (current_level < top_level) { |
---|
245 | top_iter = i; |
---|
246 | top_level = current_level; |
---|
247 | } |
---|
248 | } |
---|
249 | #if 0 |
---|
250 | cerr << "get_name of " << e; |
---|
251 | cerr << " return " << top_iter->object->name() << endl; |
---|
252 | #endif |
---|
253 | return top_iter->object->name(); |
---|
254 | } |
---|
255 | |
---|
256 | |
---|
257 | const char *get_name(const tab_t * pointer) { |
---|
258 | return get_name(get_equi(pointer)); |
---|
259 | } |
---|
260 | |
---|
261 | |
---|
262 | static const sc_module & get_module(const string & s) { |
---|
263 | instances_set_t::iterator i; |
---|
264 | for (i = instances_set.begin(); i != instances_set.end(); ++i) { |
---|
265 | if (strcmp((*i)->name(), s.c_str()) == 0) { |
---|
266 | return **i; |
---|
267 | } |
---|
268 | } |
---|
269 | cerr << "Internal error : get_module\n"; |
---|
270 | exit(27); |
---|
271 | } |
---|
272 | |
---|
273 | |
---|
274 | template < typename T > static equi_list_t::iterator get_equi(T & e) { |
---|
275 | // QM debug |
---|
276 | //cout << "equi_map : " << equi_map << endl; |
---|
277 | |
---|
278 | entity2equi_it_t::iterator it = equi_map.find(entity(e)); |
---|
279 | if (it == equi_map.end()) { |
---|
280 | return equi_list.end(); |
---|
281 | } |
---|
282 | return it->second; |
---|
283 | } |
---|
284 | |
---|
285 | |
---|
286 | template < typename T > static void add_equi(equi_list_t::iterator & x, T & y) { |
---|
287 | entity e(y); |
---|
288 | x->push_back(e); |
---|
289 | equi_map[e] = x; |
---|
290 | } |
---|
291 | |
---|
292 | |
---|
293 | template < typename T > static |
---|
294 | equi_list_t::iterator new_equi(T & x) { /* parameter is not 'const' because we need to modify pointer port/signal at end of elaboration step */ |
---|
295 | equi_list_t::iterator it = equi_list.insert(equi_list.begin(), equi_t(1, entity(x))); |
---|
296 | equi_map[entity(x)] = it; |
---|
297 | return it; |
---|
298 | } |
---|
299 | |
---|
300 | |
---|
301 | // sort by number of connected ports bound to the signal |
---|
302 | static int operator <(const equi_t & e1, const equi_t & e2) { |
---|
303 | return (e1.size() < e2.size()); |
---|
304 | } |
---|
305 | |
---|
306 | // sort by data size |
---|
307 | /* |
---|
308 | int operator<(const equi_t &e1, const equi_t &e2) |
---|
309 | { |
---|
310 | return (e1.begin()->data_size () < e2.begin()->data_size ()); |
---|
311 | } |
---|
312 | */ |
---|
313 | // random sort |
---|
314 | /* |
---|
315 | int operator<(const equi_t &e1, const equi_t &e2) |
---|
316 | { |
---|
317 | typedef std::map<const equi_t*,int> m_t; |
---|
318 | static m_t m; |
---|
319 | if (m[&e1] == 0) |
---|
320 | m[&e1] = rand (); |
---|
321 | if (m[&e2] == 0) |
---|
322 | m[&e2] = rand (); |
---|
323 | return m[&e1] < m[&e2]; |
---|
324 | } |
---|
325 | */ |
---|
326 | |
---|
327 | void sort_equi_list() { |
---|
328 | //load (); |
---|
329 | equi_list.sort(); |
---|
330 | //equi_list.reverse (); |
---|
331 | } |
---|
332 | |
---|
333 | |
---|
334 | #if defined(DUMP_SIGNAL_STATS) |
---|
335 | static unsigned int equi_real_size; |
---|
336 | #endif |
---|
337 | |
---|
338 | unsigned int get_sizeof_signals_table() { |
---|
339 | equi_list_t::iterator i; |
---|
340 | int table_size = 0; |
---|
341 | //cerr << "external table includes :\n"; |
---|
342 | for (i = equi_list.begin(); i != equi_list.end(); ++i) { |
---|
343 | if (get_out_port(*i)) { |
---|
344 | continue; |
---|
345 | } |
---|
346 | if (get_signal(*i)) { |
---|
347 | continue; |
---|
348 | } |
---|
349 | //cerr << get_name (*i) << " "; |
---|
350 | const entity & ent = *(i->begin()); |
---|
351 | int data_size = ent.data_size_in_bytes(); |
---|
352 | int number_of_part = ((data_size - 1) / sizeof(tab_t)) + 1; |
---|
353 | table_size += number_of_part; |
---|
354 | } |
---|
355 | return table_size; |
---|
356 | } |
---|
357 | |
---|
358 | |
---|
359 | void create_signals_table() { |
---|
360 | if (dump_stage) { |
---|
361 | cerr << "Allocating signals table.\n"; |
---|
362 | } |
---|
363 | unsigned int table_size = get_sizeof_signals_table(); |
---|
364 | equi_table = new tab_t[table_size]; //(0xCD); |
---|
365 | #if defined(DUMP_SIGNAL_STATS) |
---|
366 | equi_real_size = table_size; |
---|
367 | #endif |
---|
368 | #if defined(INIT_SIGNALS_TO_ZERO) |
---|
369 | memset(equi_table, 0, sizeof(tab_t) * table_size); |
---|
370 | #else |
---|
371 | memset(equi_table, 0xCD, sizeof(tab_t) * table_size); |
---|
372 | #endif |
---|
373 | } |
---|
374 | |
---|
375 | |
---|
376 | static void bind_equi_to_table(equi_t & e, tab_t * const pointer) { |
---|
377 | assert(pointer != NULL); |
---|
378 | equi_t::iterator i; |
---|
379 | for (i = e.begin(); i != e.end(); ++i) { |
---|
380 | sc_interface *const inter = i->interface; |
---|
381 | inter->set_pointer(pointer); |
---|
382 | // We can't initialize data to zero there |
---|
383 | // because we can't write the right amount of bits. |
---|
384 | // It may produce some segmentation fault errors. |
---|
385 | // The pointer is aligned to 32 bits. |
---|
386 | } |
---|
387 | } |
---|
388 | |
---|
389 | |
---|
390 | void bind_to_table() { |
---|
391 | if (dump_stage) { |
---|
392 | cerr << "Binding ports/signals to the table.\n"; |
---|
393 | } |
---|
394 | equi_list_t::iterator i; |
---|
395 | int index = 0; |
---|
396 | for (i = equi_list.begin(); i != equi_list.end(); ++i) { |
---|
397 | sc_interface *out = get_out_port(*i); |
---|
398 | if (out) { |
---|
399 | bind_equi_to_table(*i, out->get_pointer()); |
---|
400 | } |
---|
401 | else { |
---|
402 | sc_interface * reg = get_signal(*i); |
---|
403 | if (reg == NULL) { |
---|
404 | reg = get_localvar(*i); |
---|
405 | } |
---|
406 | if (reg) { |
---|
407 | bind_equi_to_table(*i, reg->get_pointer()); |
---|
408 | } |
---|
409 | else { |
---|
410 | bind_equi_to_table(*i, &(equi_table[index])); |
---|
411 | index += (i->begin()->data_size_in_bytes() - 1) / sizeof(tab_t) + 1; |
---|
412 | } |
---|
413 | } |
---|
414 | } |
---|
415 | } |
---|
416 | |
---|
417 | |
---|
418 | ostream & operator <<(ostream & o, const entity & e) { |
---|
419 | #if 0 |
---|
420 | o << "entity ("; |
---|
421 | if (e.object) |
---|
422 | o << e.object->name(); |
---|
423 | else |
---|
424 | o << "no object"; |
---|
425 | if (e.interface) |
---|
426 | o << ", pointer = 0x" << hex << e.interface->get_pointer(); |
---|
427 | else |
---|
428 | o << ", no interface"; |
---|
429 | o << ")"; |
---|
430 | #else |
---|
431 | assert(e.object != NULL); |
---|
432 | o << e.object->name(); |
---|
433 | #endif |
---|
434 | return o; |
---|
435 | } |
---|
436 | |
---|
437 | ostream & operator <<(ostream & o, const equi_t & e) { |
---|
438 | bool nb = 0; |
---|
439 | equi_t::const_iterator i; |
---|
440 | for (i = e.begin(); i != e.end(); ++i) { |
---|
441 | const entity & ity = *i; |
---|
442 | o << ((nb++) ? " = " : "") << ity; |
---|
443 | } |
---|
444 | return o; |
---|
445 | } |
---|
446 | |
---|
447 | |
---|
448 | void print_table(ostream & o) { |
---|
449 | o << "Signal list\n" << "-----------\n"; |
---|
450 | equi_list_t::const_iterator i; |
---|
451 | for (i = equi_list.begin(); i != equi_list.end(); ++i) { |
---|
452 | const equi_t & eq = *i; |
---|
453 | #if 0 |
---|
454 | o << i->begin()->interface->get_pointer() << " : "; |
---|
455 | o << (*i); |
---|
456 | o << "\n"; |
---|
457 | #else |
---|
458 | o << "(" << get_name(eq) << ") <=> " << eq << ".\n"; |
---|
459 | #endif |
---|
460 | } |
---|
461 | } |
---|
462 | |
---|
463 | void print_table_stats(ostream & o) { |
---|
464 | #if defined(DUMP_SIGNAL_STATS) |
---|
465 | int nb_reg = 0; |
---|
466 | int nb_sig = 0; |
---|
467 | int real_size = 0; |
---|
468 | |
---|
469 | // count |
---|
470 | equi_list_t::const_iterator i; |
---|
471 | int num; |
---|
472 | for (num = 0, i = equi_list.begin(); i != equi_list.end(); ++num, ++i) { |
---|
473 | if (is_register(*i)) { |
---|
474 | ++nb_reg; |
---|
475 | } |
---|
476 | else { |
---|
477 | ++nb_sig; |
---|
478 | } |
---|
479 | } |
---|
480 | |
---|
481 | // print results |
---|
482 | o << "Statistics :\n"; |
---|
483 | o << "#registers : " << nb_reg << endl; |
---|
484 | o << "#signals : " << nb_sig << endl; |
---|
485 | o << "current table size : " << equi_real_size << endl; |
---|
486 | #endif |
---|
487 | } |
---|
488 | |
---|
489 | |
---|
490 | #ifdef DUMP_SIGNAL_STATS |
---|
491 | typedef map < tab_t *, long long int > counter_t; |
---|
492 | static counter_t counter; |
---|
493 | long long int unnecessary = 0; |
---|
494 | long long int total_assig = 0; |
---|
495 | #endif |
---|
496 | |
---|
497 | const char * get_module_name(const equi_t & eq) { |
---|
498 | if (!is_register(eq)) { |
---|
499 | /* |
---|
500 | cerr << "get_module_name doesn't work yet upon non-register.\n"; |
---|
501 | */ |
---|
502 | return "top_level"; |
---|
503 | } |
---|
504 | const entity & ent = *(eq.begin()); |
---|
505 | |
---|
506 | #ifdef CONFIG_DEBUG |
---|
507 | if (ent.type != sc_core::entity::SIGNAL) { |
---|
508 | exit(28); |
---|
509 | } |
---|
510 | #endif |
---|
511 | |
---|
512 | // get module name from sc_signal used like a register |
---|
513 | const char * sig_name = ent.object->name(); |
---|
514 | const char * sep = strchr(sig_name, '.'); |
---|
515 | |
---|
516 | #ifdef CONFIG_DEBUG |
---|
517 | if (sep == NULL) { |
---|
518 | exit(30); |
---|
519 | } |
---|
520 | #endif |
---|
521 | |
---|
522 | int end_pos = sep - sig_name; |
---|
523 | string module_name(sig_name, end_pos); |
---|
524 | // can't return the char* pointer from string since it will be invalid. |
---|
525 | return get_module(module_name).name(); |
---|
526 | } |
---|
527 | |
---|
528 | |
---|
529 | static void merge_equi(equi_list_t::iterator & x, equi_list_t::iterator & y) { |
---|
530 | equi_t::iterator i; |
---|
531 | equi_t & y2 = *y; |
---|
532 | for (i = y2.begin(); i != y2.end(); ++i) { |
---|
533 | entity & e = *i; |
---|
534 | equi_map[e] = x; |
---|
535 | } |
---|
536 | |
---|
537 | x->merge(*y); |
---|
538 | equi_list.erase(y); |
---|
539 | } |
---|
540 | |
---|
541 | |
---|
542 | // sort by data size |
---|
543 | #ifdef DATASIZE_SORT |
---|
544 | int operator< (const equi_t & e1, const equi_t & e2) { |
---|
545 | return (e1.begin()->data_size() < e2.begin()->data_size()); |
---|
546 | } |
---|
547 | #endif |
---|
548 | |
---|
549 | |
---|
550 | // random sort |
---|
551 | #ifdef RANDOM_SORT |
---|
552 | int operator< (const equi_t & e1, const equi_t & e2) { |
---|
553 | typedef std::map < const equi_t *, int > m_t; |
---|
554 | static m_t m; |
---|
555 | if (m[&e1] == 0) { |
---|
556 | m[&e1] = rand(); |
---|
557 | } |
---|
558 | if (m[&e2] == 0) { |
---|
559 | m[&e2] = rand(); |
---|
560 | } |
---|
561 | return m[&e1] < m[&e2]; |
---|
562 | } |
---|
563 | #endif |
---|
564 | |
---|
565 | |
---|
566 | #if defined(DUMP_SIGNAL_STATS) |
---|
567 | static unsigned int equi_real_size; |
---|
568 | #endif |
---|
569 | |
---|
570 | |
---|
571 | void bind(sc_signal_base & x) { |
---|
572 | #if 0 |
---|
573 | //defined(CONFIG_DEBUG) |
---|
574 | equi_list_t::iterator x_equi = get_equi(x); |
---|
575 | if ((x_equi != equi_list.end())) { |
---|
576 | cerr << "Internal error : Signal already in the table\n"; |
---|
577 | return; |
---|
578 | } |
---|
579 | #endif |
---|
580 | new_equi(x); |
---|
581 | } |
---|
582 | |
---|
583 | |
---|
584 | void bind(sc_port_base & x) { |
---|
585 | new_equi(x); |
---|
586 | } |
---|
587 | |
---|
588 | |
---|
589 | template < typename T > static void test_before_bind(sc_port_base & p1, T & p2) { |
---|
590 | bool t1 = (p1.kind() != NULL); |
---|
591 | bool t2 = (p2.kind() != NULL); |
---|
592 | if (t1 && t2) { |
---|
593 | return; |
---|
594 | } |
---|
595 | if (t1 == true) { |
---|
596 | cerr << "Trying to bind '" << p1.name() << "' to an unknown type.\n"; |
---|
597 | } |
---|
598 | else if (t2 == true) { |
---|
599 | cerr << "Trying to bind '" << p2.name() << "' to an unknown type.\n"; |
---|
600 | } |
---|
601 | else { |
---|
602 | cerr << "Binding failed. Please check the netlist description.\n"; |
---|
603 | } |
---|
604 | exit(20040525); |
---|
605 | } |
---|
606 | |
---|
607 | |
---|
608 | template < typename T > static void tbind(sc_port_base & x, T & y) { |
---|
609 | // assert(x.get_pointer () != NULL); // x pointer may be NULL |
---|
610 | // assert(y.get_pointer () != NULL); // y pointer may be NULL |
---|
611 | equi_list_t::iterator x_equi = get_equi(x); |
---|
612 | equi_list_t::iterator y_equi = get_equi(y); |
---|
613 | if ((x_equi != equi_list.end()) && (y_equi != equi_list.end())) { |
---|
614 | // 2 equipotentials are equals |
---|
615 | merge_equi(x_equi, y_equi); |
---|
616 | } |
---|
617 | else if ((x_equi != equi_list.end())) { |
---|
618 | // add y |
---|
619 | add_equi(x_equi, y); |
---|
620 | } |
---|
621 | else if ((y_equi != equi_list.end())) { |
---|
622 | // add y |
---|
623 | add_equi(y_equi, x); |
---|
624 | } |
---|
625 | else { |
---|
626 | // add a new equi |
---|
627 | x_equi = new_equi(x); |
---|
628 | add_equi(x_equi, y); |
---|
629 | } |
---|
630 | } |
---|
631 | |
---|
632 | |
---|
633 | void bind(sc_port_base & p1, sc_port_base & p2) { |
---|
634 | test_before_bind(p1, p2); |
---|
635 | tbind(p1, p2); |
---|
636 | } |
---|
637 | |
---|
638 | |
---|
639 | void bind(sc_port_base & p1, sc_signal_base & s1) { |
---|
640 | test_before_bind(p1, s1); |
---|
641 | tbind(p1, s1); |
---|
642 | } |
---|
643 | |
---|
644 | |
---|
645 | } // end of sc_core namespace |
---|
646 | |
---|
647 | /* |
---|
648 | # Local Variables: |
---|
649 | # tab-width: 4; |
---|
650 | # c-basic-offset: 4; |
---|
651 | # c-file-offsets:((innamespace . 0)(inline-open . 0)); |
---|
652 | # indent-tabs-mode: nil; |
---|
653 | # End: |
---|
654 | # |
---|
655 | # vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=4:softtabstop=4 |
---|
656 | */ |
---|
657 | |
---|