2012-04-13 01:08:20 +00:00
|
|
|
|
// -*- mode: C++; c-file-style: "cc-mode" -*-
|
2006-08-26 11:35:28 +00:00
|
|
|
|
//*************************************************************************
|
|
|
|
|
// DESCRIPTION: Verilator: Resolve module/signal name references
|
|
|
|
|
//
|
2008-04-25 12:14:27 +00:00
|
|
|
|
// Code available from: http://www.veripool.org/verilator
|
2006-08-26 11:35:28 +00:00
|
|
|
|
//
|
|
|
|
|
//*************************************************************************
|
|
|
|
|
//
|
2018-01-02 23:05:06 +00:00
|
|
|
|
// Copyright 2003-2018 by Wilson Snyder. This program is free software; you can
|
2006-08-26 11:35:28 +00:00
|
|
|
|
// redistribute it and/or modify it under the terms of either the GNU
|
2009-05-04 21:07:57 +00:00
|
|
|
|
// Lesser General Public License Version 3 or the Perl Artistic License
|
|
|
|
|
// Version 2.0.
|
2006-08-26 11:35:28 +00:00
|
|
|
|
//
|
|
|
|
|
// Verilator 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.
|
|
|
|
|
//
|
|
|
|
|
//*************************************************************************
|
|
|
|
|
// LINKTOP TRANSFORMATIONS:
|
|
|
|
|
// Utility functions
|
|
|
|
|
// Sort cells by depth
|
|
|
|
|
// Create new MODULE TOP with connections to below signals
|
|
|
|
|
//*************************************************************************
|
|
|
|
|
|
2006-12-18 19:20:45 +00:00
|
|
|
|
#include "config_build.h"
|
|
|
|
|
#include "verilatedos.h"
|
2006-08-26 11:35:28 +00:00
|
|
|
|
|
|
|
|
|
#include "V3Global.h"
|
|
|
|
|
#include "V3LinkLevel.h"
|
|
|
|
|
#include "V3Ast.h"
|
|
|
|
|
|
2018-10-14 17:43:24 +00:00
|
|
|
|
#include <algorithm>
|
|
|
|
|
#include <cstdarg>
|
|
|
|
|
#include <map>
|
|
|
|
|
#include <vector>
|
|
|
|
|
|
2006-08-26 11:35:28 +00:00
|
|
|
|
//######################################################################
|
|
|
|
|
// Levelizing class functions
|
|
|
|
|
|
|
|
|
|
struct CmpLevel {
|
2018-08-25 13:52:45 +00:00
|
|
|
|
inline bool operator() (const AstNodeModule* lhsp, const AstNodeModule* rhsp) const {
|
2006-08-26 11:35:28 +00:00
|
|
|
|
return lhsp->level() < rhsp->level();
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
void V3LinkLevel::modSortByLevel() {
|
|
|
|
|
// Sort modules by levels, root down to lowest children
|
|
|
|
|
// Calculate levels again in case we added modules
|
|
|
|
|
UINFO(2,"modSortByLevel()\n");
|
2008-03-25 19:57:41 +00:00
|
|
|
|
|
2008-12-10 02:05:47 +00:00
|
|
|
|
// level() was computed for us in V3LinkCells
|
2006-08-26 11:35:28 +00:00
|
|
|
|
|
2018-02-02 02:24:41 +00:00
|
|
|
|
typedef std::vector<AstNodeModule*> ModVec;
|
2009-11-07 11:20:20 +00:00
|
|
|
|
|
|
|
|
|
ModVec vec;
|
|
|
|
|
AstNodeModule* topp = NULL;
|
2018-02-02 02:32:58 +00:00
|
|
|
|
for (AstNodeModule* nodep = v3Global.rootp()->modulesp(); nodep; nodep=VN_CAST(nodep->nextp(), NodeModule)) {
|
2006-08-26 11:35:28 +00:00
|
|
|
|
if (nodep->level()<=2) {
|
2008-03-25 19:57:41 +00:00
|
|
|
|
if (topp) {
|
2009-11-30 23:36:31 +00:00
|
|
|
|
nodep->v3warn(E_MULTITOP, "Unsupported: Multiple top level modules: "
|
2008-03-25 19:57:41 +00:00
|
|
|
|
<<nodep->prettyName()<<" and "<<topp->prettyName());
|
2009-11-30 23:36:31 +00:00
|
|
|
|
nodep->v3warn(E_MULTITOP, "Fix, or use --top-module option to select which you want.");
|
2008-03-25 19:57:41 +00:00
|
|
|
|
}
|
2006-08-26 11:35:28 +00:00
|
|
|
|
topp = nodep;
|
|
|
|
|
}
|
|
|
|
|
vec.push_back(nodep);
|
|
|
|
|
}
|
2013-05-24 00:19:51 +00:00
|
|
|
|
stable_sort(vec.begin(), vec.end(), CmpLevel()); // Sort the vector
|
2013-08-08 11:05:21 +00:00
|
|
|
|
UINFO(9,"modSortByLevel() sorted\n"); // Comment required for gcc4.6.3 / bug666
|
2009-11-07 11:20:20 +00:00
|
|
|
|
for (ModVec::iterator it = vec.begin(); it != vec.end(); ++it) {
|
|
|
|
|
AstNodeModule* nodep = *it;
|
2013-09-04 01:40:43 +00:00
|
|
|
|
nodep->clearIter(); // Because we didn't iterate to find the node pointers, may have a stale m_iterp() needing cleanup
|
2006-08-26 11:35:28 +00:00
|
|
|
|
nodep->unlinkFrBack();
|
|
|
|
|
}
|
|
|
|
|
if (v3Global.rootp()->modulesp()) v3Global.rootp()->v3fatalSrc("Unlink didn't work");
|
2009-11-07 11:20:20 +00:00
|
|
|
|
for (ModVec::iterator it = vec.begin(); it != vec.end(); ++it) {
|
|
|
|
|
AstNodeModule* nodep = *it;
|
2006-08-26 11:35:28 +00:00
|
|
|
|
v3Global.rootp()->addModulep(nodep);
|
|
|
|
|
}
|
2013-08-08 11:05:21 +00:00
|
|
|
|
UINFO(9,"modSortByLevel() done\n"); // Comment required for gcc4.6.3 / bug666
|
2017-09-18 02:52:57 +00:00
|
|
|
|
V3Global::dumpCheckGlobalTree("cells", false, v3Global.opt.dumpTreeLevel(__FILE__) >= 3);
|
2006-08-26 11:35:28 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
//######################################################################
|
|
|
|
|
// Wrapping
|
|
|
|
|
|
2018-10-14 22:39:33 +00:00
|
|
|
|
void V3LinkLevel::wrapTop(AstNetlist* rootp) {
|
2006-08-26 11:35:28 +00:00
|
|
|
|
UINFO(2,__FUNCTION__<<": "<<endl);
|
|
|
|
|
// We do ONLY the top module
|
2018-10-14 22:39:33 +00:00
|
|
|
|
AstNodeModule* oldmodp = rootp->modulesp();
|
|
|
|
|
if (!oldmodp) rootp->v3fatalSrc("No module found to process");
|
2018-10-14 02:02:39 +00:00
|
|
|
|
AstNodeModule* newmodp = new AstModule(oldmodp->fileline(), string("TOP_")+oldmodp->name());
|
2006-08-26 11:35:28 +00:00
|
|
|
|
// Make the new module first in the list
|
|
|
|
|
oldmodp->unlinkFrBackWithNext();
|
|
|
|
|
newmodp->addNext(oldmodp);
|
|
|
|
|
newmodp->level(1);
|
|
|
|
|
newmodp->modPublic(true);
|
2018-10-14 22:39:33 +00:00
|
|
|
|
rootp->addModulep(newmodp);
|
2006-08-26 11:35:28 +00:00
|
|
|
|
|
2013-05-25 14:15:10 +00:00
|
|
|
|
// TODO the module creation above could be done after linkcells, but
|
|
|
|
|
// the rest must be done after data type resolution
|
2018-10-14 22:39:33 +00:00
|
|
|
|
wrapTopCell(rootp);
|
|
|
|
|
wrapTopPackages(rootp);
|
2013-05-25 14:15:10 +00:00
|
|
|
|
}
|
|
|
|
|
|
2018-10-14 22:39:33 +00:00
|
|
|
|
void V3LinkLevel::wrapTopCell(AstNetlist* rootp) {
|
|
|
|
|
AstNodeModule* newmodp = rootp->modulesp();
|
|
|
|
|
if (!newmodp || !newmodp->isTop()) rootp->v3fatalSrc("No TOP module found to process");
|
2018-02-02 02:32:58 +00:00
|
|
|
|
AstNodeModule* oldmodp = VN_CAST(newmodp->nextp(), NodeModule);
|
2018-10-14 22:39:33 +00:00
|
|
|
|
if (!oldmodp) rootp->v3fatalSrc("No module found to process");
|
2013-05-25 14:15:10 +00:00
|
|
|
|
|
2006-08-26 11:35:28 +00:00
|
|
|
|
// Add instance
|
|
|
|
|
AstCell* cellp = new AstCell(newmodp->fileline(),
|
2016-05-07 18:01:02 +00:00
|
|
|
|
((v3Global.opt.l2Name()!="") ? v3Global.opt.l2Name() : oldmodp->name()),
|
2006-08-26 11:35:28 +00:00
|
|
|
|
oldmodp->name(),
|
|
|
|
|
NULL, NULL, NULL);
|
|
|
|
|
cellp->modp(oldmodp);
|
|
|
|
|
newmodp->addStmtp(cellp);
|
|
|
|
|
|
|
|
|
|
// Add pins
|
|
|
|
|
for (AstNode* subnodep=oldmodp->stmtsp(); subnodep; subnodep = subnodep->nextp()) {
|
2018-02-02 02:32:58 +00:00
|
|
|
|
if (AstVar* oldvarp=VN_CAST(subnodep, Var)) {
|
2006-08-26 11:35:28 +00:00
|
|
|
|
UINFO(8,"VARWRAP "<<oldvarp<<endl);
|
|
|
|
|
if (oldvarp->isIO()) {
|
2008-11-20 01:15:05 +00:00
|
|
|
|
AstVar* varp = oldvarp->cloneTree(false);
|
2006-08-26 11:35:28 +00:00
|
|
|
|
newmodp->addStmtp(varp);
|
|
|
|
|
varp->sigPublic(true); // User needs to be able to get to it...
|
2018-10-27 21:29:00 +00:00
|
|
|
|
if (oldvarp->isIO()) {
|
|
|
|
|
oldvarp->primaryIO(false);
|
|
|
|
|
varp->primaryIO(true);
|
|
|
|
|
}
|
2018-10-31 00:50:09 +00:00
|
|
|
|
if (varp->direction().isRefOrConstRef()) {
|
|
|
|
|
varp->v3error("Unsupported: ref/const ref as primary input/output: "
|
|
|
|
|
<<varp->prettyName());
|
|
|
|
|
}
|
2014-12-11 03:33:28 +00:00
|
|
|
|
if (varp->isIO() && v3Global.opt.systemC()) {
|
|
|
|
|
varp->sc(true);
|
|
|
|
|
// User can see trace one level down from the wrapper
|
|
|
|
|
// Avoids packing & unpacking SC signals a second time
|
|
|
|
|
varp->trace(false);
|
|
|
|
|
}
|
2006-08-26 11:35:28 +00:00
|
|
|
|
|
|
|
|
|
AstPin* pinp = new AstPin(oldvarp->fileline(),0,oldvarp->name(),
|
2018-10-27 21:29:00 +00:00
|
|
|
|
new AstVarRef(varp->fileline(),
|
|
|
|
|
varp, oldvarp->isWritable()));
|
|
|
|
|
// Skip length and width comp; we know it's a direct assignment
|
2006-08-26 11:35:28 +00:00
|
|
|
|
pinp->modVarp(oldvarp);
|
|
|
|
|
cellp->addPinsp(pinp);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2009-11-08 02:05:02 +00:00
|
|
|
|
}
|
|
|
|
|
|
2018-10-14 22:39:33 +00:00
|
|
|
|
void V3LinkLevel::wrapTopPackages(AstNetlist* rootp) {
|
2009-11-08 02:05:02 +00:00
|
|
|
|
// Instantiate all packages under the top wrapper
|
|
|
|
|
// This way all later SCOPE based optimizations can ignore packages
|
2018-10-14 22:39:33 +00:00
|
|
|
|
AstNodeModule* newmodp = rootp->modulesp();
|
|
|
|
|
if (!newmodp || !newmodp->isTop()) rootp->v3fatalSrc("No TOP module found to process");
|
|
|
|
|
for (AstNodeModule* modp = rootp->modulesp(); modp; modp=VN_CAST(modp->nextp(), NodeModule)) {
|
2018-02-02 02:32:58 +00:00
|
|
|
|
if (VN_IS(modp, Package)) {
|
2009-11-08 02:05:02 +00:00
|
|
|
|
AstCell* cellp = new AstCell(modp->fileline(),
|
|
|
|
|
// Could add __03a__03a="::" to prevent conflict
|
|
|
|
|
// with module names/"v"
|
|
|
|
|
modp->name(),
|
|
|
|
|
modp->name(),
|
|
|
|
|
NULL, NULL, NULL);
|
|
|
|
|
cellp->modp(modp);
|
|
|
|
|
newmodp->addStmtp(cellp);
|
|
|
|
|
}
|
|
|
|
|
}
|
2006-08-26 11:35:28 +00:00
|
|
|
|
}
|