1008 lines
36 KiB
C++
1008 lines
36 KiB
C++
//*************************************************************************
|
||
// DESCRIPTION: Verilator: Add temporaries, such as for task nodes
|
||
//
|
||
// Code available from: http://www.veripool.org/verilator
|
||
//
|
||
// AUTHORS: Wilson Snyder with Paul Wasson, Duane Gabli
|
||
//
|
||
//*************************************************************************
|
||
//
|
||
// Copyright 2003-2009 by Wilson Snyder. This program is free software; you can
|
||
// redistribute it and/or modify it under the terms of either the GNU
|
||
// Lesser General Public License Version 3 or the Perl Artistic License
|
||
// Version 2.0.
|
||
//
|
||
// 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.
|
||
//
|
||
//*************************************************************************
|
||
// V3Task's Transformations:
|
||
//
|
||
// Each module:
|
||
// Look for TASKREF
|
||
// Insert task's statements into the referrer
|
||
// Look for TASKs
|
||
// Remove them, they're inlined
|
||
//
|
||
//*************************************************************************
|
||
|
||
#include "config_build.h"
|
||
#include "verilatedos.h"
|
||
#include <cstdio>
|
||
#include <cstdarg>
|
||
#include <unistd.h>
|
||
#include <map>
|
||
|
||
#include "V3Global.h"
|
||
#include "V3Task.h"
|
||
#include "V3Inst.h"
|
||
#include "V3Ast.h"
|
||
#include "V3EmitCBase.h"
|
||
#include "V3Graph.h"
|
||
#include "V3LinkLValue.h"
|
||
|
||
//######################################################################
|
||
// Graph subclasses
|
||
|
||
class TaskBaseVertex : public V3GraphVertex {
|
||
AstNode* m_impurep; // Node causing impure function w/ outside references
|
||
bool m_noInline; // Marked with pragma
|
||
public:
|
||
TaskBaseVertex(V3Graph* graphp)
|
||
: V3GraphVertex(graphp), m_impurep(NULL), m_noInline(false) {}
|
||
virtual ~TaskBaseVertex() {}
|
||
bool pure() const { return m_impurep==NULL; }
|
||
AstNode* impureNode() const { return m_impurep; }
|
||
void impure(AstNode* nodep) { m_impurep = nodep; }
|
||
bool noInline() const { return m_noInline; }
|
||
void noInline(bool flag) { m_noInline = flag; }
|
||
};
|
||
|
||
class TaskFTaskVertex : public TaskBaseVertex {
|
||
// Every task gets a vertex, and we link tasks together based on funcrefs.
|
||
AstNodeFTask* m_nodep;
|
||
AstCFunc* m_cFuncp;
|
||
public:
|
||
TaskFTaskVertex(V3Graph* graphp, AstNodeFTask* nodep)
|
||
: TaskBaseVertex(graphp), m_nodep(nodep) {
|
||
m_cFuncp=NULL;
|
||
}
|
||
virtual ~TaskFTaskVertex() {}
|
||
AstNodeFTask* nodep() const { return m_nodep; }
|
||
virtual string name() const { return nodep()->name(); }
|
||
virtual string dotColor() const { return pure() ? "black" : "red"; }
|
||
AstCFunc* cFuncp() const { return m_cFuncp; }
|
||
void cFuncp(AstCFunc* nodep) { m_cFuncp=nodep; }
|
||
};
|
||
|
||
class TaskCodeVertex : public TaskBaseVertex {
|
||
// Top vertex for all calls not under another task
|
||
public:
|
||
TaskCodeVertex(V3Graph* graphp)
|
||
: TaskBaseVertex(graphp) {}
|
||
virtual ~TaskCodeVertex() {}
|
||
virtual string name() const { return "*CODE*"; }
|
||
virtual string dotColor() const { return "green"; }
|
||
};
|
||
|
||
class TaskEdge : public V3GraphEdge {
|
||
public:
|
||
TaskEdge(V3Graph* graphp, TaskBaseVertex* fromp, TaskBaseVertex* top)
|
||
: V3GraphEdge(graphp, fromp, top, 1, false) {}
|
||
virtual ~TaskEdge() {}
|
||
virtual string dotLabel() const { return "w"+cvtToStr(weight()); }
|
||
};
|
||
|
||
//######################################################################
|
||
|
||
class TaskStateVisitor : public AstNVisitor {
|
||
private:
|
||
// NODE STATE
|
||
// Output:
|
||
// AstNodeFTask::user3p // AstScope* this FTask is under
|
||
// AstNodeFTask::user4p // GraphFTaskVertex* this FTask is under
|
||
// AstVar::user4p // GraphFTaskVertex* this variable is declared in
|
||
|
||
AstUser3InUse m_inuser3;
|
||
AstUser4InUse m_inuser4;
|
||
|
||
// TYPES
|
||
typedef std::map<pair<AstScope*,AstVar*>,AstVarScope*> VarToScopeMap;
|
||
// MEMBERS
|
||
VarToScopeMap m_varToScopeMap; // Map for Var -> VarScope mappings
|
||
AstAssignW* m_assignwp; // Current assignment
|
||
V3Graph m_callGraph; // Task call graph
|
||
TaskBaseVertex* m_curVxp; // Current vertex we're adding to
|
||
|
||
public:
|
||
// METHODS
|
||
AstScope* getScope(AstNodeFTask* nodep) {
|
||
AstScope* scopep = nodep->user3p()->castNode()->castScope();
|
||
if (!scopep) nodep->v3fatalSrc("No scope for function");
|
||
return scopep;
|
||
}
|
||
AstVarScope* findVarScope(AstScope* scopep, AstVar* nodep) {
|
||
VarToScopeMap::iterator iter = m_varToScopeMap.find(make_pair(scopep,nodep));
|
||
if (iter == m_varToScopeMap.end()) nodep->v3fatalSrc("No scope for var");
|
||
return iter->second;
|
||
}
|
||
bool ftaskNoInline(AstNodeFTask* nodep) {
|
||
return (getFTaskVertex(nodep)->noInline());
|
||
}
|
||
AstCFunc* ftaskCFuncp(AstNodeFTask* nodep) {
|
||
return (getFTaskVertex(nodep)->cFuncp());
|
||
}
|
||
void ftaskCFuncp(AstNodeFTask* nodep, AstCFunc* cfuncp) {
|
||
getFTaskVertex(nodep)->cFuncp(cfuncp);
|
||
}
|
||
|
||
void checkPurity(AstNodeFTask* nodep) {
|
||
checkPurity(nodep, getFTaskVertex(nodep));
|
||
}
|
||
void checkPurity(AstNodeFTask* nodep, TaskBaseVertex* vxp) {
|
||
if (!vxp->pure()) {
|
||
nodep->v3warn(IMPURE,"Unsupported: External variable referenced by non-inlined function/task: "<<nodep->prettyName());
|
||
vxp->impureNode()->v3warn(IMPURE,"... Location of the external reference: "<<vxp->impureNode()->prettyName());
|
||
}
|
||
// And, we need to check all tasks this task calls
|
||
for (V3GraphEdge* edgep = vxp->outBeginp(); edgep; edgep=edgep->outNextp()) {
|
||
checkPurity(nodep, static_cast<TaskBaseVertex*>(edgep->top()));
|
||
}
|
||
}
|
||
private:
|
||
TaskFTaskVertex* getFTaskVertex(AstNodeFTask* nodep) {
|
||
if (!nodep->user4p()) {
|
||
nodep->user4p(new TaskFTaskVertex(&m_callGraph, nodep));
|
||
}
|
||
return static_cast<TaskFTaskVertex*>(nodep->user4p()->castGraphVertex());
|
||
}
|
||
|
||
// VISITORS
|
||
virtual void visit(AstScope* nodep, AstNUser*) {
|
||
// Each FTask is unique per-scope, so AstNodeFTaskRefs do not need
|
||
// pointers to what scope the FTask is to be invoked under.
|
||
// However, to create variables, we need to track the scopes involved.
|
||
// Find all var->varscope mappings, for later cleanup
|
||
for (AstNode* stmtp = nodep->varsp(); stmtp; stmtp=stmtp->nextp()) {
|
||
if (AstVarScope* vscp = stmtp->castVarScope()) {
|
||
if (vscp->varp()->isFuncLocal()) {
|
||
UINFO(9," funcvsc "<<vscp<<endl);
|
||
m_varToScopeMap.insert(make_pair(make_pair(nodep, vscp->varp()), vscp));
|
||
}
|
||
}
|
||
}
|
||
// Likewise, all FTask->scope mappings
|
||
for (AstNode* stmtp = nodep->blocksp(); stmtp; stmtp=stmtp->nextp()) {
|
||
if (AstNodeFTask* taskp = stmtp->castNodeFTask()) {
|
||
taskp->user3p(nodep);
|
||
}
|
||
}
|
||
nodep->iterateChildren(*this);
|
||
}
|
||
virtual void visit(AstAssignW* nodep, AstNUser*) {
|
||
m_assignwp = nodep;
|
||
nodep->iterateChildren(*this); nodep=NULL; // May delete nodep.
|
||
m_assignwp = NULL;
|
||
}
|
||
virtual void visit(AstNodeFTaskRef* nodep, AstNUser*) {
|
||
if (m_assignwp) {
|
||
// Wire assigns must become always statements to deal with insertion
|
||
// of multiple statements. Perhaps someday make all wassigns into always's?
|
||
UINFO(5," IM_WireRep "<<m_assignwp<<endl);
|
||
m_assignwp->convertToAlways(); pushDeletep(m_assignwp); m_assignwp=NULL;
|
||
}
|
||
// We make multiple edges if a task is called multiple times from another task.
|
||
if (!nodep->taskp()) nodep->v3fatalSrc("Unlinked task");
|
||
new TaskEdge (&m_callGraph, m_curVxp, getFTaskVertex(nodep->taskp()));
|
||
}
|
||
virtual void visit(AstNodeFTask* nodep, AstNUser*) {
|
||
UINFO(9," TASK "<<nodep<<endl);
|
||
TaskBaseVertex* lastVxp = m_curVxp;
|
||
m_curVxp = getFTaskVertex(nodep);
|
||
if (nodep->dpiImport()) m_curVxp->noInline(true);
|
||
nodep->iterateChildren(*this);
|
||
m_curVxp = lastVxp;
|
||
}
|
||
virtual void visit(AstPragma* nodep, AstNUser*) {
|
||
if (nodep->pragType() == AstPragmaType::NO_INLINE_TASK) {
|
||
// Just mark for the next steps, and we're done with it.
|
||
m_curVxp->noInline(true);
|
||
nodep->unlinkFrBack()->deleteTree();
|
||
}
|
||
else {
|
||
nodep->iterateChildren(*this);
|
||
}
|
||
}
|
||
virtual void visit(AstVar* nodep, AstNUser*) {
|
||
nodep->iterateChildren(*this);
|
||
nodep->user4p(m_curVxp); // Remember what task it's under
|
||
}
|
||
virtual void visit(AstVarRef* nodep, AstNUser*) {
|
||
nodep->iterateChildren(*this);
|
||
if (nodep->varp()->user4p() != m_curVxp) {
|
||
if (m_curVxp->pure()
|
||
&& !nodep->varp()->isPure()) {
|
||
m_curVxp->impure(nodep);
|
||
}
|
||
}
|
||
}
|
||
//--------------------
|
||
// Default: Just iterate
|
||
virtual void visit(AstNode* nodep, AstNUser*) {
|
||
nodep->iterateChildren(*this);
|
||
}
|
||
public:
|
||
// CONSTUCTORS
|
||
TaskStateVisitor(AstNetlist* nodep) {
|
||
m_assignwp = NULL;
|
||
m_curVxp = new TaskCodeVertex(&m_callGraph);
|
||
AstNode::user3ClearTree();
|
||
AstNode::user4ClearTree();
|
||
//
|
||
nodep->accept(*this);
|
||
//
|
||
m_callGraph.removeRedundantEdgesSum(&TaskEdge::followAlwaysTrue);
|
||
m_callGraph.dumpDotFilePrefixed("task_call");
|
||
}
|
||
virtual ~TaskStateVisitor() {}
|
||
};
|
||
|
||
//######################################################################
|
||
|
||
class TaskRelinkVisitor : public AstNVisitor {
|
||
// Replace varrefs with new var pointer
|
||
private:
|
||
// NODE STATE
|
||
// Input:
|
||
// AstVar::user2p // AstVarScope* to replace varref with
|
||
|
||
// VISITORS
|
||
virtual void visit(AstVarRef* nodep, AstNUser*) {
|
||
// Similar code in V3Inline
|
||
if (nodep->varp()->user2p()) { // It's being converted to a alias.
|
||
UINFO(9, " relinkVar "<<(void*)nodep->varp()->user2p()<<" "<<nodep<<endl);
|
||
AstVarScope* newvscp = nodep->varp()->user2p()->castNode()->castVarScope();
|
||
if (!newvscp) nodep->v3fatalSrc("Null?\n");
|
||
nodep->varScopep(newvscp);
|
||
nodep->varp(nodep->varScopep()->varp());
|
||
nodep->name(nodep->varp()->name());
|
||
}
|
||
nodep->iterateChildren(*this);
|
||
}
|
||
|
||
//--------------------
|
||
virtual void visit(AstNode* nodep, AstNUser*) {
|
||
nodep->iterateChildren(*this);
|
||
}
|
||
public:
|
||
// CONSTUCTORS
|
||
TaskRelinkVisitor(AstBegin* nodep) { // Passed temporary tree
|
||
nodep->accept(*this);
|
||
}
|
||
virtual ~TaskRelinkVisitor() {}
|
||
};
|
||
|
||
//######################################################################
|
||
// Task state, as a visitor of each AstNode
|
||
|
||
class TaskVisitor : public AstNVisitor {
|
||
private:
|
||
// NODE STATE
|
||
// Each module:
|
||
// AstNodeFTask::user // True if its been expanded
|
||
// Each funccall
|
||
// to TaskRelinkVisitor:
|
||
// AstVar::user2p // AstVarScope* to replace varref with
|
||
|
||
AstUser1InUse m_inuser1;
|
||
AstUser2InUse m_inuser2;
|
||
|
||
// TYPES
|
||
enum InsertMode {
|
||
IM_BEFORE, // Pointing at statement ref is in, insert before this
|
||
IM_AFTER, // Pointing at last inserted stmt, insert after
|
||
IM_WHILE_PRECOND // Pointing to for loop, add to body end
|
||
};
|
||
typedef map<string,pair<AstCFunc*,string> > DpiNames;
|
||
|
||
// STATE
|
||
TaskStateVisitor* m_statep; // Common state between visitors
|
||
AstNodeModule* m_modp; // Current module
|
||
AstTopScope* m_topScopep; // Current top scope
|
||
AstScope* m_scopep; // Current scope
|
||
InsertMode m_insMode; // How to insert
|
||
AstNode* m_insStmtp; // Where to insert statement
|
||
int m_modNCalls; // Incrementing func # for making symbols
|
||
DpiNames m_dpiNames; // Map of all created DPI functions
|
||
|
||
// METHODS
|
||
static int debug() {
|
||
static int level = -1;
|
||
if (VL_UNLIKELY(level < 0)) level = v3Global.opt.debugSrcLevel(__FILE__);
|
||
return level;
|
||
}
|
||
|
||
AstVarScope* createVarScope(AstVar* invarp, const string& name) {
|
||
// We could create under either the ref's scope or the ftask's scope.
|
||
// It shouldn't matter, as they are only local variables.
|
||
// We choose to do it under whichever called this function, which results
|
||
// in more cache locality.
|
||
AstVar* newvarp = new AstVar (invarp->fileline(), AstVarType::BLOCKTEMP,
|
||
name, invarp);
|
||
newvarp->funcLocal(false);
|
||
newvarp->propagateAttrFrom(invarp);
|
||
m_modp->addStmtp(newvarp);
|
||
AstVarScope* newvscp = new AstVarScope (newvarp->fileline(), m_scopep, newvarp);
|
||
m_scopep->addVarp(newvscp);
|
||
return newvscp;
|
||
}
|
||
|
||
AstNode* createInlinedFTask(AstNodeFTaskRef* refp, string namePrefix, AstVarScope* outvscp) {
|
||
// outvscp is the variable for functions only, if NULL, it's a task
|
||
if (!refp->taskp()) refp->v3fatalSrc("Unlinked?");
|
||
AstNode* newbodysp = refp->taskp()->stmtsp()->cloneTree(true); // Maybe NULL
|
||
AstNode* beginp = new AstComment(refp->fileline(), (string)("Function: ")+refp->name());
|
||
if (newbodysp) beginp->addNext(newbodysp);
|
||
if (debug()>=9) { beginp->dumpTreeAndNext(cout,"-newbegi:"); }
|
||
//
|
||
// Create input variables
|
||
AstNode::user2ClearTree();
|
||
V3TaskConnects tconnects = V3Task::taskConnects(refp, beginp);
|
||
for (V3TaskConnects::iterator it=tconnects.begin(); it!=tconnects.end(); ++it) {
|
||
AstVar* portp = it->first;
|
||
AstNode* pinp = it->second;
|
||
portp->unlinkFrBack(); pushDeletep(portp); // Remove it from the clone (not original)
|
||
if (pinp==NULL) {
|
||
// Too few arguments in function call
|
||
} else {
|
||
UINFO(9, " Port "<<portp<<endl);
|
||
UINFO(9, " pin "<<pinp<<endl);
|
||
pinp->unlinkFrBack(); // Relinked to assignment below
|
||
//
|
||
if (portp->isInout()) {
|
||
if (AstVarRef* varrefp = pinp->castVarRef()) {
|
||
// Connect to this exact variable
|
||
AstVarScope* localVscp = varrefp->varScopep(); if (!localVscp) varrefp->v3fatalSrc("Null var scope");
|
||
portp->user2p(localVscp);
|
||
pushDeletep(pinp);
|
||
} else {
|
||
pinp->v3warn(E_TASKNSVAR,"Unsupported: Function/task input argument is not simple variable");
|
||
}
|
||
}
|
||
else if (portp->isOutput() && outvscp) {
|
||
refp->v3error("Outputs not allowed in function declarations");
|
||
}
|
||
else if (portp->isOutput()) {
|
||
// Make output variables
|
||
// Correct lvalue; we didn't know when we linked
|
||
// This is slightly scary; are we sure no decisions were made
|
||
// before here based on this not being a lvalue?
|
||
// Doesn't seem so; V3Unknown uses it earlier, but works ok.
|
||
V3LinkLValue::linkLValueSet(pinp);
|
||
|
||
// Even if it's referencing a varref, we still make a temporary
|
||
// Else task(x,x,x) might produce incorrect results
|
||
AstVarScope* outvscp = createVarScope (portp, namePrefix+"__"+portp->shortName());
|
||
portp->user2p(outvscp);
|
||
AstAssign* assp = new AstAssign (pinp->fileline(),
|
||
pinp,
|
||
new AstVarRef(outvscp->fileline(), outvscp, false));
|
||
// Put assignment BEHIND of all other statements
|
||
beginp->addNext(assp);
|
||
}
|
||
else if (portp->isInput()) {
|
||
// Make input variable
|
||
AstVarScope* inVscp = createVarScope (portp, namePrefix+"__"+portp->shortName());
|
||
portp->user2p(inVscp);
|
||
AstAssign* assp = new AstAssign (pinp->fileline(),
|
||
new AstVarRef(inVscp->fileline(), inVscp, true),
|
||
pinp);
|
||
// Put assignment in FRONT of all other statements
|
||
if (AstNode* afterp = beginp->nextp()) {
|
||
afterp->unlinkFrBackWithNext();
|
||
assp->addNext(afterp);
|
||
}
|
||
beginp->addNext(assp);
|
||
}
|
||
}
|
||
}
|
||
if (refp->pinsp()) refp->v3fatalSrc("Pin wasn't removed by above loop");
|
||
{
|
||
AstNode* nextstmtp;
|
||
for (AstNode* stmtp = beginp; stmtp; stmtp=nextstmtp) {
|
||
nextstmtp = stmtp->nextp();
|
||
if (AstVar* portp = stmtp->castVar()) {
|
||
// Any I/O variables that fell out of above loop were already linked
|
||
if (!portp->user2p()) {
|
||
// Move it to a new localized variable
|
||
portp->unlinkFrBack(); pushDeletep(portp); // Remove it from the clone (not original)
|
||
AstVarScope* localVscp = createVarScope (portp, namePrefix+"__"+portp->shortName());
|
||
portp->user2p(localVscp);
|
||
}
|
||
}
|
||
}
|
||
}
|
||
// Create function output variables
|
||
if (outvscp) {
|
||
//UINFO(0, "setflag on "<<funcp->fvarp()<<" to "<<outvscp<<endl);
|
||
refp->taskp()->fvarp()->user2p(outvscp);
|
||
}
|
||
// Replace variable refs
|
||
// Iteration requires a back, so put under temporary node
|
||
{
|
||
AstBegin* tempp = new AstBegin(beginp->fileline(),"[EditWrapper]",beginp);
|
||
TaskRelinkVisitor visit (tempp);
|
||
tempp->stmtsp()->unlinkFrBackWithNext(); tempp->deleteTree(); tempp=NULL;
|
||
}
|
||
//
|
||
if (debug()>=9) { beginp->dumpTree(cout,"-iotask: "); }
|
||
return beginp;
|
||
}
|
||
|
||
AstNode* createNonInlinedFTask(AstNodeFTaskRef* refp, string namePrefix, AstVarScope* outvscp) {
|
||
// outvscp is the variable for functions only, if NULL, it's a task
|
||
if (!refp->taskp()) refp->v3fatalSrc("Unlinked?");
|
||
AstCFunc* cfuncp = m_statep->ftaskCFuncp(refp->taskp());
|
||
|
||
if (!cfuncp) refp->v3fatalSrc("No non-inline task associated with this task call?");
|
||
//
|
||
AstNode* beginp = new AstComment(refp->fileline(), (string)("Function: ")+refp->name());
|
||
AstCCall* ccallp = new AstCCall(refp->fileline(), cfuncp, NULL);
|
||
beginp->addNext(ccallp);
|
||
// Convert complicated outputs to temp signals
|
||
|
||
V3TaskConnects tconnects = V3Task::taskConnects(refp, refp->taskp()->stmtsp());
|
||
for (V3TaskConnects::iterator it=tconnects.begin(); it!=tconnects.end(); ++it) {
|
||
AstVar* portp = it->first;
|
||
AstNode* pinp = it->second;
|
||
if (!pinp) {
|
||
// Too few arguments in function call
|
||
} else {
|
||
UINFO(9, " Port "<<portp<<endl);
|
||
UINFO(9, " pin "<<pinp<<endl);
|
||
if (portp->isInout()) {
|
||
if (pinp->castVarRef()) {
|
||
// Connect to this exact variable
|
||
} else {
|
||
pinp->v3warn(E_TASKNSVAR,"Unsupported: Function/task input argument is not simple variable");
|
||
}
|
||
}
|
||
else if (portp->isOutput()) {
|
||
// Make output variables
|
||
// Correct lvalue; we didn't know when we linked
|
||
// This is slightly scary; are we sure no decisions were made
|
||
// before here based on this not being a lvalue?
|
||
// Doesn't seem so; V3Unknown uses it earlier, but works ok.
|
||
V3LinkLValue::linkLValueSet(pinp);
|
||
|
||
// Even if it's referencing a varref, we still make a temporary
|
||
// Else task(x,x,x) might produce incorrect results
|
||
AstVarScope* outvscp = createVarScope (portp, namePrefix+"__"+portp->shortName());
|
||
portp->user2p(outvscp);
|
||
pinp->replaceWith(new AstVarRef(outvscp->fileline(), outvscp, true));
|
||
AstAssign* assp = new AstAssign (pinp->fileline(),
|
||
pinp,
|
||
new AstVarRef(outvscp->fileline(), outvscp, false));
|
||
// Put assignment BEHIND of all other statements
|
||
beginp->addNext(assp);
|
||
}
|
||
}
|
||
}
|
||
// First argument is symbol table, then output if a function
|
||
bool needContext = !refp->taskp()->dpiImport() || refp->taskp()->dpiContext();
|
||
if (needContext) ccallp->argTypes("vlSymsp");
|
||
if (outvscp) {
|
||
ccallp->addArgsp(new AstVarRef(refp->fileline(), outvscp, true));
|
||
}
|
||
// Create connections
|
||
AstNode* nextpinp;
|
||
for (AstNode* pinp = refp->pinsp(); pinp; pinp=nextpinp) {
|
||
nextpinp = pinp->nextp();
|
||
// Move pin to the CCall
|
||
pinp->unlinkFrBack();
|
||
ccallp->addArgsp(pinp);
|
||
}
|
||
if (debug()>=9) { beginp->dumpTree(cout,"-nitask: "); }
|
||
return beginp;
|
||
}
|
||
|
||
AstCFunc* makeDpiCFunc(AstNodeFTask* nodep, AstVar* rtnvarp) {
|
||
if (nodep->cname() != AstNode::prettyName(nodep->cname())) {
|
||
nodep->v3error("DPI function has illegal characters in C identifier name: "<<AstNode::prettyName(nodep->cname()));
|
||
}
|
||
AstCFunc* dpip = new AstCFunc(nodep->fileline(),
|
||
nodep->cname(),
|
||
m_scopep,
|
||
(rtnvarp ? rtnvarp->dpiArgType(true,true)
|
||
// Tasks (but not void functions) return bool indicating disabled
|
||
: nodep->dpiTask() ? "int"
|
||
: ""));
|
||
dpip->dontCombine(true);
|
||
dpip->entryPoint (false);
|
||
dpip->funcPublic (true);
|
||
dpip->isStatic (false);
|
||
dpip->pure (nodep->pure());
|
||
dpip->dpiImport (true);
|
||
// Add DPI reference to top, since it's a global function
|
||
m_topScopep->scopep()->addActivep(dpip);
|
||
return dpip;
|
||
}
|
||
|
||
void bodyDpiCFunc(AstNodeFTask* nodep, AstVarScope* rtnvscp, AstCFunc* cfuncp) {
|
||
// Convert input/inout arguments to DPI types
|
||
string args;
|
||
for (AstNode* stmtp = cfuncp->argsp(); stmtp; stmtp=stmtp->nextp()) {
|
||
if (AstVar* portp = stmtp->castVar()) {
|
||
AstVarScope* portvscp = portp->user2p()->castNode()->castVarScope(); // Remembered when we created it earlier
|
||
if (portp->isIO() && !portp->isFuncReturn() && portvscp != rtnvscp) {
|
||
bool bitvec = (portp->basicp()->isBitLogic() && portp->width() > 32);
|
||
|
||
if (args != "") { args+= ", "; }
|
||
if (bitvec) {}
|
||
else if (portp->isOutput()) args += "&";
|
||
else if (portp->basicp() && portp->basicp()->isBitLogic() && portp->widthMin() != 1) args += "&"; // it's a svBitVecVal
|
||
|
||
args += "__Vcvt_"+portp->name();
|
||
|
||
string stmt;
|
||
if (bitvec) {
|
||
stmt += "svBitVecVal __Vcvt_"+portp->name();
|
||
stmt += " ["+cvtToStr(portp->widthWords())+"]";
|
||
} else {
|
||
stmt += portp->dpiArgType(true,true);
|
||
stmt += " __Vcvt_"+portp->name();
|
||
}
|
||
if (portp->isInput()) {
|
||
// Someday we'll have better type support, and this can make variables and casts.
|
||
// But for now, we'll just text-bash it.
|
||
if (bitvec) {
|
||
// We only support quads, so don't need to sweat longer stuff
|
||
stmt += "; VL_SET_WQ(__Vcvt_"+portp->name()+", "+portp->name()+")";
|
||
} else {
|
||
stmt += " = ";
|
||
if (portp->basicp() && portp->basicp()->keyword()==AstBasicDTypeKwd::CHANDLE) {
|
||
stmt += "(void*)";
|
||
}
|
||
stmt += portp->name();
|
||
}
|
||
}
|
||
stmt += ";\n";
|
||
cfuncp->addStmtsp(new AstCStmt(portp->fileline(), stmt));
|
||
}
|
||
}
|
||
}
|
||
|
||
// Store context, if needed
|
||
if (nodep->dpiContext()) {
|
||
// TBD
|
||
}
|
||
|
||
{// Call the user function
|
||
string stmt;
|
||
if (rtnvscp) { // isFunction will no longer work as we unlinked the return var
|
||
stmt += rtnvscp->varp()->dpiArgType(true,true) + " __Vcvt_"+rtnvscp->varp()->name() + " = ";
|
||
}
|
||
stmt += nodep->cname()+"("+args+");\n";
|
||
cfuncp->addStmtsp(new AstCStmt(nodep->fileline(), stmt));
|
||
}
|
||
|
||
// Convert output/inout arguments back to internal type
|
||
for (AstNode* stmtp = cfuncp->argsp(); stmtp; stmtp=stmtp->nextp()) {
|
||
if (AstVar* portp = stmtp->castVar()) {
|
||
if (portp->isIO()) {
|
||
AstVarScope* portvscp = portp->user2p()->castNode()->castVarScope(); // Remembered when we created it earlier
|
||
if (portp->isOutput() || portp->isFuncReturn()) {
|
||
string stmt;
|
||
if (portp->basicp() && portp->basicp()->keyword()==AstBasicDTypeKwd::CHANDLE) {
|
||
stmt += "(QData)";
|
||
}
|
||
stmt += "__Vcvt_"+portp->name();
|
||
// Use a AstCMath, as we want V3Clean to mask off bits that don't make sense.
|
||
int cwidth = VL_WORDSIZE; if (portp->basicp()) cwidth = portp->basicp()->keyword().width();
|
||
if (portp->basicp() && portp->basicp()->isBitLogic()) cwidth = VL_WORDSIZE*portp->widthWords();
|
||
cfuncp->addStmtsp(new AstAssign(portp->fileline(),
|
||
new AstVarRef(portp->fileline(), portvscp, true),
|
||
new AstSel(portp->fileline(),
|
||
new AstCMath(portp->fileline(), stmt, cwidth, false),
|
||
0, portp->width())));
|
||
}
|
||
}
|
||
}
|
||
}
|
||
}
|
||
|
||
AstCFunc* makeUserFunc(AstNodeFTask* nodep, bool ftaskNoInline) {
|
||
// Given a already cloned node, make a public C function, or a non-inline C function
|
||
// Probably some of this work should be done later, but...
|
||
// should the type of the function be bool/uint32/64 etc (based on lookup) or IData?
|
||
AstNode::user2ClearTree();
|
||
AstVar* rtnvarp = NULL;
|
||
AstVarScope* rtnvscp = NULL;
|
||
if (nodep->isFunction()) {
|
||
AstVar* portp = NULL;
|
||
if (NULL!=(portp = nodep->fvarp()->castVar())) {
|
||
if (!portp->isFuncReturn()) nodep->v3error("Not marked as function return var");
|
||
if (portp->isWide()) nodep->v3error("Unsupported: Public functions with return > 64 bits wide. (Make it a output instead.)");
|
||
if (ftaskNoInline) portp->funcReturn(false); // Converting return to 'outputs'
|
||
portp->unlinkFrBack();
|
||
rtnvarp = portp;
|
||
rtnvarp->funcLocal(true);
|
||
rtnvarp->name(rtnvarp->name()+"__Vfuncrtn"); // Avoid conflict with DPI function name
|
||
rtnvscp = new AstVarScope (rtnvarp->fileline(), m_scopep, rtnvarp);
|
||
m_scopep->addVarp(rtnvscp);
|
||
rtnvarp->user2p(rtnvscp);
|
||
} else {
|
||
nodep->v3fatalSrc("function without function output variable");
|
||
}
|
||
}
|
||
string prefix = "";
|
||
if (nodep->dpiImport()) prefix = "__Vdpiimwrap_";
|
||
else if (ftaskNoInline) prefix = "__VnoInFunc_";
|
||
AstCFunc* cfuncp = new AstCFunc(nodep->fileline(),
|
||
prefix + nodep->name(),
|
||
m_scopep,
|
||
((nodep->taskPublic() && rtnvarp)?rtnvarp->cpubArgType(true,true):""));
|
||
// It's ok to combine imports because this is just a wrapper; duplicate wrappers can get merged.
|
||
cfuncp->dontCombine(!nodep->dpiImport());
|
||
cfuncp->entryPoint (!nodep->dpiImport());
|
||
cfuncp->funcPublic (nodep->taskPublic());
|
||
cfuncp->isStatic (!(nodep->dpiImport()||nodep->taskPublic()));
|
||
cfuncp->pure (nodep->pure());
|
||
//cfuncp->dpiImport // Not set in the wrapper - the called function has it set
|
||
|
||
bool needContext = !nodep->dpiImport() || nodep->dpiContext();
|
||
if (needContext) {
|
||
if (nodep->taskPublic()) {
|
||
// We need to get a pointer to all of our variables (may have eval'ed something else earlier)
|
||
cfuncp->addInitsp(
|
||
new AstCStmt(nodep->fileline(),
|
||
EmitCBaseVisitor::symClassVar()+" = this->__VlSymsp;\n"));
|
||
} else {
|
||
// Need symbol table
|
||
cfuncp->argTypes(EmitCBaseVisitor::symClassVar());
|
||
}
|
||
}
|
||
// Fake output variable if was a function
|
||
if (rtnvarp) cfuncp->addArgsp(rtnvarp);
|
||
|
||
if (!nodep->dpiImport()) {
|
||
cfuncp->addInitsp(new AstCStmt(nodep->fileline(), EmitCBaseVisitor::symTopAssign()+"\n"));
|
||
}
|
||
|
||
AstCFunc* dpip = NULL;
|
||
string dpiproto;
|
||
if (nodep->dpiImport()) {
|
||
if (nodep->pure()) dpiproto += "pure ";
|
||
if (nodep->dpiContext()) dpiproto += "context ";
|
||
dpiproto += rtnvarp ? rtnvarp->dpiArgType(true,true):"void";
|
||
dpiproto += " "+nodep->cname()+" (";
|
||
|
||
// Only create one DPI extern for each specified cname,
|
||
// as it's legal for the user to attach multiple tasks to one dpi cname
|
||
if (m_dpiNames.find(nodep->cname()) == m_dpiNames.end()) {
|
||
// m_dpiNames insert below
|
||
dpip = makeDpiCFunc(nodep, rtnvarp);
|
||
}
|
||
}
|
||
|
||
// Create list of arguments and move to function
|
||
string args;
|
||
for (AstNode* nextp, *stmtp = nodep->stmtsp(); stmtp; stmtp=nextp) {
|
||
nextp = stmtp->nextp();
|
||
if (AstVar* portp = stmtp->castVar()) {
|
||
if (portp->isIO()) {
|
||
// Move it to new function
|
||
portp->unlinkFrBack();
|
||
portp->funcLocal(true);
|
||
cfuncp->addArgsp(portp);
|
||
if (dpip) {
|
||
dpip->addArgsp(portp->cloneTree(false));
|
||
if (!portp->basicp() || portp->basicp()->keyword().isDpiUnsupported()) {
|
||
portp->v3error("Unsupported: DPI argument of type "<<portp->basicp()->prettyTypeName());
|
||
portp->v3error("... For best portability, use bit, byte, int, or longint");
|
||
}
|
||
}
|
||
if (!portp->isFuncReturn()) {
|
||
if (args != "") { args+= ", "; dpiproto+= ", "; }
|
||
args += portp->name(); // Leftover so ,'s look nice
|
||
if (nodep->dpiImport()) dpiproto += portp->dpiArgType(false,false);
|
||
}
|
||
} else {
|
||
// "Normal" variable, mark inside function
|
||
portp->funcLocal(true);
|
||
}
|
||
AstVarScope* newvscp = new AstVarScope (portp->fileline(), m_scopep, portp);
|
||
m_scopep->addVarp(newvscp);
|
||
portp->user2p(newvscp);
|
||
}
|
||
}
|
||
dpiproto += ")";
|
||
|
||
if (nodep->dpiImport()) {
|
||
// Only create one DPI extern for each specified cname,
|
||
// as it's legal for the user to attach multiple tasks to one dpi cname
|
||
DpiNames::iterator iter = m_dpiNames.find(nodep->cname());
|
||
if (iter == m_dpiNames.end()) {
|
||
m_dpiNames.insert(make_pair(nodep->cname(), make_pair(dpip, dpiproto)));
|
||
} else if (iter->second.second != dpiproto) {
|
||
nodep->v3error("Duplicate declaration of DPI function with different formal arguments: "<<nodep->prettyName());
|
||
nodep->v3error("... New prototype: "<<dpiproto);
|
||
iter->second.first->v3error("... Original prototype: "<<iter->second.second);
|
||
}
|
||
}
|
||
|
||
// Move body
|
||
AstNode* bodysp = nodep->stmtsp();
|
||
if (bodysp) { bodysp->unlinkFrBackWithNext(); cfuncp->addStmtsp(bodysp); }
|
||
if (nodep->dpiImport()) {
|
||
bodyDpiCFunc(nodep, rtnvscp, cfuncp);
|
||
}
|
||
|
||
// Return statement
|
||
if (rtnvscp && nodep->taskPublic()) {
|
||
cfuncp->addFinalsp(new AstCReturn(rtnvscp->fileline(),
|
||
new AstVarRef(rtnvscp->fileline(), rtnvscp, false)));
|
||
}
|
||
// Replace variable refs
|
||
// Iteration requires a back, so put under temporary node
|
||
{
|
||
AstBegin* tempp = new AstBegin(cfuncp->fileline(),"[EditWrapper]",cfuncp);
|
||
TaskRelinkVisitor visit (tempp);
|
||
tempp->stmtsp()->unlinkFrBackWithNext(); tempp->deleteTree(); tempp=NULL;
|
||
}
|
||
// Delete rest of cloned task and return new func
|
||
pushDeletep(nodep); nodep=NULL;
|
||
if (debug()>=9) { cfuncp->dumpTree(cout,"-userFunc: "); }
|
||
return cfuncp;
|
||
}
|
||
|
||
void iterateIntoFTask(AstNodeFTask* nodep) {
|
||
// Iterate into the FTask we are calling. Note it may be under a different
|
||
// scope then the caller, so we need to restore state.
|
||
AstScope* oldscopep = m_scopep;
|
||
m_scopep = m_statep->getScope(nodep);
|
||
nodep->accept(*this);
|
||
m_scopep = oldscopep;
|
||
}
|
||
void insertBeforeStmt(AstNode* nodep, AstNode* newp) {
|
||
// See also AstNode::addBeforeStmt; this predates that function
|
||
if (debug()>=9) { nodep->dumpTree(cout,"-newstmt:"); }
|
||
if (!m_insStmtp) nodep->v3fatalSrc("Function not underneath a statement");
|
||
if (m_insMode == IM_BEFORE) {
|
||
// Add the whole thing before insertAt
|
||
UINFO(5," IM_Before "<<m_insStmtp<<endl);
|
||
if (debug()>=9) { newp->dumpTree(cout,"-newfunc:"); }
|
||
m_insStmtp->addHereThisAsNext(newp);
|
||
}
|
||
else if (m_insMode == IM_AFTER) {
|
||
UINFO(5," IM_After "<<m_insStmtp);
|
||
m_insStmtp->addNextHere(newp);
|
||
}
|
||
else if (m_insMode == IM_WHILE_PRECOND) {
|
||
UINFO(5," IM_While_Precond "<<m_insStmtp);
|
||
AstWhile* whilep = m_insStmtp->castWhile();
|
||
if (!whilep) nodep->v3fatalSrc("Insert should be under WHILE");
|
||
whilep->addPrecondsp(newp);
|
||
}
|
||
else {
|
||
nodep->v3fatalSrc("Unknown InsertMode");
|
||
}
|
||
m_insMode = IM_AFTER;
|
||
m_insStmtp = newp;
|
||
}
|
||
|
||
// VISITORS
|
||
virtual void visit(AstNodeModule* nodep, AstNUser*) {
|
||
m_modp = nodep;
|
||
m_insStmtp = NULL;
|
||
m_modNCalls = 0;
|
||
nodep->iterateChildren(*this);
|
||
m_modp = NULL;
|
||
}
|
||
virtual void visit(AstTopScope* nodep, AstNUser*) {
|
||
m_topScopep = nodep;
|
||
nodep->iterateChildren(*this);
|
||
}
|
||
virtual void visit(AstScope* nodep, AstNUser*) {
|
||
m_scopep = nodep;
|
||
m_insStmtp = NULL;
|
||
nodep->iterateChildren(*this);
|
||
m_scopep = NULL;
|
||
}
|
||
virtual void visit(AstTaskRef* nodep, AstNUser*) {
|
||
iterateIntoFTask(nodep->taskp()); // First, do hierarchical funcs
|
||
UINFO(4," Task REF "<<nodep<<endl);
|
||
if (debug()>=9) { nodep->dumpTree(cout,"-inltask:"); }
|
||
// Create cloned statements
|
||
string namePrefix = "__Vtask_"+nodep->taskp()->shortName()+"__"+cvtToStr(m_modNCalls++);
|
||
AstNode* beginp;
|
||
if (m_statep->ftaskNoInline(nodep->taskp())) {
|
||
beginp = createNonInlinedFTask(nodep, namePrefix, NULL);
|
||
} else {
|
||
beginp = createInlinedFTask(nodep, namePrefix, NULL);
|
||
}
|
||
// Replace the ref
|
||
nodep->replaceWith(beginp);
|
||
nodep->deleteTree(); nodep=NULL;
|
||
}
|
||
virtual void visit(AstFuncRef* nodep, AstNUser*) {
|
||
UINFO(4," Func REF "<<nodep<<endl);
|
||
if (debug()>=9) { nodep->dumpTree(cout,"-preref:"); }
|
||
// First, do hierarchical funcs
|
||
AstNodeFTask* funcp = nodep->taskp();
|
||
if (!funcp) nodep->v3fatalSrc("unlinked");
|
||
if (!funcp->isFunction()) nodep->v3fatalSrc("func reference to non-function");
|
||
// Inline func refs in the function
|
||
iterateIntoFTask(funcp);
|
||
// Create output variable
|
||
string namePrefix = "__Vfunc_"+nodep->taskp()->shortName()+"__"+cvtToStr(m_modNCalls++);
|
||
AstVarScope* outvscp = createVarScope (funcp->fvarp()->castVar(),
|
||
namePrefix+"__out");
|
||
// Create cloned statements
|
||
if (debug()>=9) { nodep->taskp()->dumpTree(cout,"-oldfunc:"); }
|
||
if (!nodep->taskp()) nodep->v3fatalSrc("Unlinked?");
|
||
|
||
AstNode* beginp;
|
||
if (m_statep->ftaskNoInline(nodep->taskp())) {
|
||
// This may share VarScope's with a public task, if any. Yuk.
|
||
beginp = createNonInlinedFTask(nodep, namePrefix, outvscp);
|
||
} else {
|
||
beginp = createInlinedFTask(nodep, namePrefix, outvscp);
|
||
}
|
||
// Replace the ref
|
||
AstVarRef* outrefp = new AstVarRef (nodep->fileline(), outvscp, false);
|
||
nodep->replaceWith(outrefp);
|
||
// Insert new statements
|
||
insertBeforeStmt(nodep, beginp);
|
||
// Cleanup
|
||
nodep->deleteTree(); nodep=NULL;
|
||
UINFO(4," Func REF Done.\n");
|
||
}
|
||
virtual void visit(AstNodeFTask* nodep, AstNUser*) {
|
||
UINFO(4," Inline "<<nodep<<endl);
|
||
InsertMode prevInsMode = m_insMode;
|
||
AstNode* prevInsStmtp = m_insStmtp;
|
||
m_insMode = IM_BEFORE;
|
||
m_insStmtp = nodep->stmtsp(); // Might be null if no statements, but we won't use it
|
||
if (!nodep->user1()) { // Just one creation needed per function
|
||
// Expand functions in it
|
||
nodep->user1(true);
|
||
if (nodep->dpiImport() || nodep->taskPublic() || m_statep->ftaskNoInline(nodep)) {
|
||
// Clone it first, because we may have later FTaskRef's that still need
|
||
// the original version.
|
||
if (m_statep->ftaskNoInline(nodep)) m_statep->checkPurity(nodep);
|
||
AstNodeFTask* clonedFuncp = nodep->cloneTree(false);
|
||
AstCFunc* cfuncp = makeUserFunc(clonedFuncp, m_statep->ftaskNoInline(nodep));
|
||
nodep->addNextHere(cfuncp);
|
||
if (nodep->dpiImport() || m_statep->ftaskNoInline(nodep)) {
|
||
m_statep->ftaskCFuncp(nodep, cfuncp);
|
||
}
|
||
iterateIntoFTask(clonedFuncp); // Do the clone too
|
||
}
|
||
|
||
// Any variables inside the function still have varscopes pointing to them.
|
||
// We're going to delete the vars, so delete the varscopes.
|
||
if (nodep->isFunction()) {
|
||
if (AstVar* portp = nodep->fvarp()->castVar()) {
|
||
AstVarScope* vscp = m_statep->findVarScope(m_scopep, portp);
|
||
UINFO(9," funcremovevsc "<<vscp<<endl);
|
||
pushDeletep(vscp->unlinkFrBack()); vscp=NULL;
|
||
}
|
||
}
|
||
for (AstNode* nextp, *stmtp = nodep->stmtsp(); stmtp; stmtp=nextp) {
|
||
nextp = stmtp->nextp();
|
||
if (AstVar* portp = stmtp->castVar()) {
|
||
AstVarScope* vscp = m_statep->findVarScope(m_scopep, portp);
|
||
UINFO(9," funcremovevsc "<<vscp<<endl);
|
||
pushDeletep(vscp->unlinkFrBack()); vscp=NULL;
|
||
}
|
||
}
|
||
// Just push for deletion, as other references to func may
|
||
// remain until visitor exits
|
||
nodep->unlinkFrBack();
|
||
pushDeletep(nodep); nodep=NULL;
|
||
}
|
||
m_insMode = prevInsMode;
|
||
m_insStmtp = prevInsStmtp;
|
||
}
|
||
virtual void visit(AstWhile* nodep, AstNUser*) {
|
||
// Special, as statements need to be put in different places
|
||
// Preconditions insert first just before themselves (the normal rule for other statement types)
|
||
m_insStmtp = NULL; // First thing should be new statement
|
||
nodep->precondsp()->iterateAndNext(*this);
|
||
// Conditions insert first at end of precondsp.
|
||
m_insMode = IM_WHILE_PRECOND;
|
||
m_insStmtp = nodep;
|
||
nodep->condp()->iterateAndNext(*this);
|
||
// Body insert just before themselves
|
||
m_insStmtp = NULL; // First thing should be new statement
|
||
nodep->bodysp()->iterateAndNext(*this);
|
||
// Done the loop
|
||
m_insStmtp = NULL; // Next thing should be new statement
|
||
}
|
||
virtual void visit(AstNodeFor* nodep, AstNUser*) {
|
||
nodep->v3fatalSrc("For statements should have been converted to while statements in V3Begin.cpp\n");
|
||
}
|
||
virtual void visit(AstNodeStmt* nodep, AstNUser*) {
|
||
m_insMode = IM_BEFORE;
|
||
m_insStmtp = nodep;
|
||
nodep->iterateChildren(*this);
|
||
m_insStmtp = NULL; // Next thing should be new statement
|
||
}
|
||
//--------------------
|
||
// Default: Just iterate
|
||
virtual void visit(AstNode* nodep, AstNUser*) {
|
||
nodep->iterateChildren(*this);
|
||
}
|
||
|
||
public:
|
||
// CONSTUCTORS
|
||
TaskVisitor(AstNetlist* nodep, TaskStateVisitor* statep)
|
||
: m_statep(statep) {
|
||
m_modp = NULL;
|
||
m_topScopep = NULL;
|
||
m_scopep = NULL;
|
||
m_insStmtp = NULL;
|
||
AstNode::user1ClearTree();
|
||
nodep->accept(*this);
|
||
}
|
||
virtual ~TaskVisitor() {}
|
||
};
|
||
|
||
//######################################################################
|
||
// Task class functions
|
||
|
||
V3TaskConnects V3Task::taskConnects(AstNodeFTaskRef* nodep, AstNode* taskStmtsp) {
|
||
// Output list will be in order of the port declaration variables (so func calls are made right in C)
|
||
// Missing pin/expr? We return (pinvar, NULL)
|
||
// Extra pin/expr? We clean it up
|
||
|
||
V3TaskConnects tconnects;
|
||
if (!nodep->taskp()) nodep->v3fatalSrc("unlinked");
|
||
|
||
// Find ports
|
||
//map<string,int> name_to_pinnum;
|
||
int tpinnum = 0; // Note grammar starts pin counting at one
|
||
for (AstNode* stmtp = taskStmtsp; stmtp; stmtp=stmtp->nextp()) {
|
||
if (AstVar* portp = stmtp->castVar()) {
|
||
if (portp->isIO()) {
|
||
tconnects.push_back(make_pair(portp, (AstNode*)NULL));
|
||
// Eventually we'll do name based connections
|
||
// That'll require a AstTpin or somesuch which will replace the ppinnum counting
|
||
//name_to_pinnum.insert(make_pair(portp->name(), tpinnum));
|
||
tpinnum++;
|
||
}
|
||
}
|
||
}
|
||
|
||
// Connect pins
|
||
int ppinnum = 0;
|
||
for (AstNode* pinp = nodep->pinsp(); pinp; pinp=pinp->nextp()) {
|
||
if (ppinnum >= tpinnum) {
|
||
// Use v3warn so we'll only get the error once for each function
|
||
pinp->v3error("Too many arguments in function call to "<<nodep->taskp()->prettyTypeName());
|
||
// We'll just delete them; seems less error prone than making a false argument
|
||
pinp->unlinkFrBackWithNext()->deleteTree(); pinp=NULL;
|
||
break;
|
||
} else {
|
||
tconnects[ppinnum].second = pinp;
|
||
ppinnum++;
|
||
}
|
||
}
|
||
|
||
while (ppinnum < tpinnum) {
|
||
nodep->v3error("Too few arguments in function call to "<<nodep->taskp()->prettyTypeName());
|
||
UINFO(1,"missing argument for '"<<tconnects[ppinnum].first->prettyName()<<"'"<<endl);
|
||
ppinnum++;
|
||
}
|
||
return tconnects;
|
||
}
|
||
|
||
void V3Task::taskAll(AstNetlist* nodep) {
|
||
UINFO(2,__FUNCTION__<<": "<<endl);
|
||
TaskStateVisitor visitors (nodep);
|
||
TaskVisitor visitor (nodep, &visitors);
|
||
}
|