// $Id$
//*************************************************************************
// DESCRIPTION: Verilator: Add temporaries, such as for inline nodes
//
// Code available from: http://www.veripool.com/verilator
//
// AUTHORS: Wilson Snyder with Paul Wasson, Duane Gabli
//
//*************************************************************************
//
// Copyright 2003-2006 by Wilson Snyder.  This program is free software; you can
// redistribute it and/or modify it under the terms of either the GNU
// General Public License or the Perl Artistic License.
//
// 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.
//
//*************************************************************************
// V3Inline's Transformations:
//		
// Each module:
//	Look for CELL... PRAGMA INLINE_MODULE
//	    Replicate the cell's module
//	        Convert pins to wires that make assignments
//		Rename vars to include cell name
//	    Insert cell's module statements into the upper module
//
//*************************************************************************

#include "config.h"
#include <stdio.h>
#include <stdarg.h>
#include <unistd.h>
#include <algorithm>
#include <vector>

#include "V3Global.h"
#include "V3Inline.h"
#include "V3Inst.h"
#include "V3Stats.h"
#include "V3Ast.h"

//######################################################################
// Inline state, as a visitor of each AstNode

// CONFIG
static const int INLINE_MODS_SMALLER = 100;	// If a mod is < this # nodes, can always inline it

class InlineVisitor : public AstNVisitor {
private:
    // NODE STATE
    // Cleared entire netlist
    //   AstModule::userp()	// bool. True to inline this module (from InlineMarkVisitor)
    // Cleared each cell
    //   AstVar::user2p()	// AstVarRef*/AstConst*  Points to signal this is a direct connect to

    // STATE
    AstModule*		m_modp;		// Current module
    AstCell*		m_cellp;	// Cell being cloned
    V3Double0		m_statCells;	// Statistic tracking

    //int debug() { return 9; }

    // VISITORS
    virtual void visit(AstNetlist* nodep, AstNUser*) {
    	// Iterate modules backwards, in bottom-up order.  Required!
    	nodep->iterateChildrenBackwards(*this);
    }
    virtual void visit(AstModule* nodep, AstNUser*) {
	if (m_cellp) {
	} else {
	    m_modp = nodep;
	}
	nodep->iterateChildren(*this);
    }
    virtual void visit(AstCellInline* nodep, AstNUser*) {
	// Inlined cell under the inline cell, need to move to avoid conflicts
	if (m_cellp) {
	    nodep->unlinkFrBack();
	    m_modp->addInlinesp(nodep);
	    // Rename
	    string name = m_cellp->name() + "__DOT__" + nodep->name();
	    nodep->name(name);
	    UINFO(6, "    Inline "<<nodep<<endl);
	    // Do CellInlines under this, but don't move them
	    nodep->iterateChildren(*this);
	}
    }
    virtual void visit(AstCell* nodep, AstNUser*) {
	if (m_cellp) {
	    // Cell under the inline cell, need to rename to avoid conflicts
	    string name = m_cellp->name() + "__DOT__" + nodep->name();
	    nodep->name(name);
	    nodep->iterateChildren(*this);
	}
	if (nodep->modp()->userp()) {  // Marked with inline request
	    if (m_cellp) nodep->v3error("Cloning should have already been done bottom-up");
	    UINFO(5," Inline CELL   "<<nodep<<endl);
	    UINFO(5,"   To MOD      "<<m_modp<<endl);
	    m_statCells++;
	    if (debug()>=9) { nodep->dumpTree(cout,"inlcell:"); }
	    //if (debug()>=9) { nodep->modp()->dumpTree(cout,"oldmod:"); }
	    AstModule* newmodp = nodep->modp()->cloneTree(false)->castModule();
	    if (debug()>=9) { newmodp->dumpTree(cout,"newmod:"); }
	    // Clear var markings
	    AstNode::user2ClearTree();
	    // Create data for dotted variable resolution
	    AstCellInline* inlinep = new AstCellInline(nodep->fileline(),
						       nodep->name(), nodep->modp()->origName());
	    m_modp->addInlinesp(inlinep);  // Must be parsed before any AstCells
	    // Create assignments to the pins
	    for (AstPin* pinp = nodep->pinsp(); pinp; pinp=pinp->nextp()->castPin()) {
		UINFO(6,"     Pin change from "<<pinp->modVarp()<<endl);
		// First, simplify it
		V3Inst::pinReconnectSimple(pinp, nodep, m_modp);
		// Make new signal; even though we'll optimize the interconnect, we
		// need an alias to trace correctly.  If tracing is disabled, we'll
		// delete it in later optimizations.
		AstVar* pinOldVarp = pinp->modVarp();
		AstVar* pinNewVarp = pinOldVarp->clonep()->castVar();

		AstNode* connectRefp = pinp->exprp();
		if (!connectRefp->castConst() && !connectRefp->castVarRef()) {
		    pinp->v3fatalSrc("Unknown interconnect type; pinReconnectSimple should have cleared up\n");
		}
		// Propagate any attributes across the interconnect
		pinNewVarp->propagateAttrFrom(pinOldVarp);
		if (connectRefp->castVarRef()) {
		    connectRefp->castVarRef()->varp()->propagateAttrFrom(pinOldVarp);
		}

		// One to one interconnect won't make a temporary variable.
		// This prevents creating a lot of extra wires for clock signals.
		// It will become a tracing alias.
		UINFO(6,"One-to-one "<<connectRefp<<endl);
		UINFO(6,"       -to "<<pinNewVarp<<endl);
		pinNewVarp->user2p(connectRefp);
	    }
	    // Cleanup var names, etc, to not conflict
	    m_cellp = nodep;
	    newmodp->iterateAndNext(*this);
	    m_cellp = NULL;
	    // Move statements to top module
	    if (debug()>=9) { newmodp->dumpTree(cout,"fixmod:"); }
	    AstNode* stmtsp = newmodp->stmtsp();
	    if (stmtsp) stmtsp->unlinkFrBackWithNext();
	    if (stmtsp) m_modp->addStmtp(stmtsp);
	    // Remove the cell
	    newmodp->deleteTree(); newmodp=NULL; // Clear any leftover ports, etc
	    nodep->unlinkFrBack();
	    nodep = NULL;
	    if (debug()>=9) { m_modp->dumpTree(cout,"donemod:"); }
	}
    }
    virtual void visit(AstVar* nodep, AstNUser*) {
	if (m_cellp) {
	    if (nodep->user2p()) {
		// Make an assignment, so we'll trace it properly
		// user2p is either a const or a var.
		AstConst*  exprconstp  = nodep->user2p()->castNode()->castConst();
		AstVarRef* exprvarrefp = nodep->user2p()->castNode()->castVarRef();
		if (!exprconstp && !exprvarrefp) {
		    nodep->v3fatalSrc("Unknown interconnect type; pinReconnectSimple should have cleared up\n");
		}
		if (exprconstp) {
		    m_modp->addStmtp(new AstAssignW(nodep->fileline(),
						    new AstVarRef(nodep->fileline(), nodep, true),
						    exprconstp->cloneTree(true)));
		} else {
		    m_modp->addStmtp(new AstAssignAlias(nodep->fileline(),
							new AstVarRef(nodep->fileline(), nodep, true),
							new AstVarRef(nodep->fileline(), exprvarrefp->varp(), false)));
		}
	    }
	    // Variable under the inline cell, need to rename to avoid conflicts
	    // Also clear I/O bits, as it is now local.
	    string name = m_cellp->name() + "__DOT__" + nodep->name();
	    if (!nodep->isFuncLocal()) nodep->inlineAttrReset(name);
	    if (debug()>=9) { nodep->dumpTree(cout,"varchanged:"); }
	    if (debug()>=9) { nodep->initp()->dumpTree(cout,"varchangei:"); }
	}
	if (nodep) nodep->iterateChildren(*this);
    }
    virtual void visit(AstNodeFTask* nodep, AstNUser*) {
	if (m_cellp) {
	    // Function under the inline cell, need to rename to avoid conflicts
	    nodep->name(m_cellp->name() + "__DOT__" + nodep->name());
	}
	nodep->iterateChildren(*this);
    }
    virtual void visit(AstVarRef* nodep, AstNUser*) {
	if (m_cellp) {
	    if (nodep->varp()->user2p()  // It's being converted to a alias.
		&& !nodep->backp()->castAssignAlias()) { 	// Don't constant propagate aliases
		AstConst*  exprconstp  = nodep->varp()->user2p()->castNode()->castConst();
		AstVarRef* exprvarrefp = nodep->varp()->user2p()->castNode()->castVarRef();
		if (exprconstp) {
		    nodep->replaceWith(exprconstp->cloneTree(true));
		    nodep->deleteTree(); nodep=NULL;
		    return;
		}
		else if (exprvarrefp) {
		    nodep->varp( exprvarrefp->varp() );
		}
		else {
		    nodep->v3fatalSrc("Null connection?\n");
		}
	    }
	    nodep->name(nodep->varp()->name());
	}
	nodep->iterateChildren(*this);
    }
    virtual void visit(AstVarXRef* nodep, AstNUser*) {
	if (m_cellp) {
	    // Track what scope it was originally under so V3LinkDot can resolve it
	    string newname = m_cellp->name();
	    if (nodep->inlinedDots() != "") { newname += "." + nodep->inlinedDots(); }
	    nodep->inlinedDots(newname);
	    UINFO(8,"   "<<nodep<<endl);
	}
	nodep->iterateChildren(*this);
    }
    virtual void visit(AstNodeFTaskRef* nodep, AstNUser*) {
	if (m_cellp) {
	    // Track what scope it was originally under so V3LinkDot can resolve it
	    string newname = m_cellp->name();
	    if (nodep->inlinedDots() != "") { newname += "." + nodep->inlinedDots(); }
	    nodep->inlinedDots(newname);
	    UINFO(8,"   "<<nodep<<endl);
	}
	nodep->iterateChildren(*this);
    }
    virtual void visit(AstDisplay* nodep, AstNUser*) {
	// If there's a %m in the display text, we add a special node that will contain the name()
	if (m_cellp
	    && nodep->name().find("%m") != string::npos) {
	    // To keep correct visual order, must add before other Text's
	    AstNode* afterp = nodep->scopeAttrp();
	    if (afterp) afterp->unlinkFrBackWithNext();
	    nodep->scopeAttrp(new AstText(nodep->fileline(), (string)"."+m_cellp->prettyName()));
	    if (afterp) nodep->scopeAttrp(afterp);
	}
	nodep->iterateChildren(*this);
    }
    virtual void visit(AstCoverDecl* nodep, AstNUser*) {
	// Fix path in coverage statements
	if (m_cellp) {
	    nodep->hier(nodep->hier()+"."+m_cellp->prettyName());
	}
	nodep->iterateChildren(*this);
    }

    //--------------------
    // Default: Just iterate
    virtual void visit(AstNode* nodep, AstNUser*) {
	nodep->iterateChildren(*this);
    }

public:
    // CONSTUCTORS
    InlineVisitor(AstNode* nodep) {
	m_cellp = NULL;
	m_modp = NULL;
	nodep->accept(*this);
    }
    virtual ~InlineVisitor() {
	V3Stats::addStat("Optimizations, Inlined cells", m_statCells);
    }
};

//######################################################################
// Inline state, as a visitor of each AstNode

class InlineMarkVisitor : public AstNVisitor {
private:
    // NODE STATE
    // Entire netlist
    //  AstModule::user()	// OUTPUT: bool. User request to inline this module
    //  AstModule::user2()	// bool. Allowed to automatically inline module
    //  AstModule::user3()	// int. Number of cells referencing this module

    // STATE
    AstModule*	m_modp;		// Current module
    int		m_stmtCnt;	// Statements in module

    // METHODS
    void cantInline(const char* reason) {
	if (m_modp->user2()) {
	    UINFO(4,"  No inline: "<<reason<<" "<<m_modp<<endl);
	    m_modp->user2(false);
	}
    }

    // VISITORS
    virtual void visit(AstModule* nodep, AstNUser*) {
	m_stmtCnt = 0;
	m_modp = nodep;
	m_modp->user2(true);
	if (m_modp->modPublic()) cantInline("modPublic");
	//
	nodep->iterateChildren(*this);
	//
	bool userinline = nodep->user();
	bool allowed = nodep->user2();
	int refs = nodep->user3();
	// Should we automatically inline this module?
	// inlineMult = 2000 by default.  If a mod*#instances is < this # nodes, can inline it
	bool doit = (userinline || allowed && (refs==1
					       || m_stmtCnt < INLINE_MODS_SMALLER
					       || v3Global.opt.inlineMult() < 1
					       || refs*m_stmtCnt < v3Global.opt.inlineMult()));
	UINFO(4, " Inline="<<doit<<" Possible="<<allowed<<" Usr="<<userinline<<" Refs="<<refs<<" Stmts="<<m_stmtCnt
	      <<"  "<<nodep<<endl);
	if (doit) {
	    UINFO(4," AutoInline "<<nodep<<endl);
	    nodep->user(true);
	}
	m_modp = NULL;
    }
    virtual void visit(AstCell* nodep, AstNUser*) {
	nodep->modp()->user3( nodep->modp()->user3() + 1);
	nodep->iterateChildren(*this);
    }
    virtual void visit(AstPragma* nodep, AstNUser*) {
	if (nodep->pragType() == AstPragmaType::INLINE_MODULE) {
	    //UINFO(0,"PRAG MARK "<<m_modp<<endl);
	    if (!m_modp) {
		nodep->v3error("Inline pragma not under a module");
	    } else {
		m_modp->user(1);
	    }
	    nodep->unlinkFrBack(); nodep=NULL;  // Remove so don't propagate to upper cell...
	} else if (nodep->pragType() == AstPragmaType::NO_INLINE_MODULE) {
	    if (!m_modp) {
		nodep->v3error("Inline pragma not under a module");
	    } else {
		cantInline("Pragma NO_INLINE_MODULE");
	    }
	    nodep->unlinkFrBack(); nodep=NULL;  // Remove so don't propagate to upper cell...
	} else {
	    nodep->iterateChildren(*this);
	}
    }
    virtual void visit(AstVarXRef* nodep, AstNUser*) {
	// Cleanup link until V3LinkDot can correct it
	nodep->varp(NULL);
    }
    virtual void visit(AstNodeFTaskRef* nodep, AstNUser*) {
	// Cleanup link until V3LinkDot can correct it
	nodep->taskp(NULL);
	nodep->iterateChildren(*this);
    }
    // Nop's to speed up the loop
    virtual void visit(AstAlways* nodep, AstNUser*) {
	nodep->iterateChildren(*this);
	m_stmtCnt++;
    }
    virtual void visit(AstNodeAssign* nodep, AstNUser*) {
	// Don't count assignments, as they'll likely flatten out
	// Still need to iterate though to nullify VarXRefs
	int oldcnt = m_stmtCnt;
	nodep->iterateChildren(*this);
	m_stmtCnt = oldcnt;
    }
    //--------------------
    // Default: Just iterate
    virtual void visit(AstNode* nodep, AstNUser*) {
	nodep->iterateChildren(*this);
	m_stmtCnt++;
    }

public:
    // CONSTUCTORS
    InlineMarkVisitor(AstNode* nodep) {
	m_modp = NULL;
	m_stmtCnt = 0;
	//VV*****  We reset all userp() on the whole netlist!!!
	AstNode::userClearTree();
	AstNode::user2ClearTree();
	AstNode::user3ClearTree();
	nodep->accept(*this);
    }
    virtual ~InlineMarkVisitor() {}
};

//######################################################################
// Inline class functions

void V3Inline::inlineAll(AstNetlist* nodep) {
    UINFO(2,__FUNCTION__<<": "<<endl);
    InlineMarkVisitor mvisitor (nodep);
    InlineVisitor visitor (nodep);
    // Remove all modules that were inlined
    // V3Dead will also clean them up, but if we have debug on, it's a good
    // idea to avoid dumping the hugely exploded tree.
    AstModule* nextmodp;
    for (AstModule* modp = v3Global.rootp()->modulesp(); modp; modp=nextmodp) {
	nextmodp = modp->nextp()->castModule();
	if (modp->userp()) { // Was inlined
	    modp->unlinkFrBack()->deleteTree(); modp=NULL;
	}
    }
}