iverilog/main.cc

336 lines
8.9 KiB
C++
Raw Normal View History

1999-06-19 05:46:42 +02:00
const char COPYRIGHT[] =
"Copyright (c) 1998-1999 Stephen Williams (steve@icarus.com)";
1998-11-04 00:28:49 +01:00
/*
* 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
*/
#if !defined(WINNT)
#ident "$Id: main.cc,v 1.22 1999/08/03 04:14:49 steve Exp $"
1998-11-04 00:28:49 +01:00
#endif
1999-06-19 05:46:42 +02:00
const char NOTICE[] =
" This program is free software; you can redistribute it and/or modify\n"
" it under the terms of the GNU General Public License as published by\n"
" the Free Software Foundation; either version 2 of the License, or\n"
" (at your option) any later version.\n"
"\n"
" This program is distributed in the hope that it will be useful,\n"
" but WITHOUT ANY WARRANTY; without even the implied warranty of\n"
" MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n"
" GNU General Public License for more details.\n"
"\n"
" You should have received a copy of the GNU General Public License\n"
" along with this program; if not, write to the Free Software\n"
" Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA\n"
;
1998-11-04 00:28:49 +01:00
# include <stdio.h>
# include <iostream.h>
# include <fstream>
# include <queue>
# include <map>
1998-11-04 00:28:49 +01:00
# include <unistd.h>
# include "pform.h"
# include "netlist.h"
# include "target.h"
1999-06-19 05:46:42 +02:00
const char VERSION[] = "$Name: $ $State: Exp $";
1998-11-04 00:28:49 +01:00
const char*target = "null";
1998-11-04 00:28:49 +01:00
string start_module = "";
map<string,string> flags;
static void parm_to_flagmap(const string&flag)
{
string key, value;
unsigned off = flag.find('=');
if (off > flag.size()) {
key = flag;
value = "";
} else {
key = flag.substr(0, off);
value = flag.substr(off+1);
}
flags[key] = value;
}
extern Design* elaborate(const map<string,Module*>&modules,
const map<string,PUdp*>&primitives,
const string&root);
1998-11-04 00:28:49 +01:00
extern void emit(ostream&o, const Design*, const char*);
extern void cprop(Design*des);
extern void propinit(Design*des);
extern void sigfold(Design*des);
extern void nobufz(Design*des);
extern void xnfio(Design*des);
extern void xnfsyn(Design*des);
1998-11-04 00:28:49 +01:00
typedef void (*net_func)(Design*);
static struct net_func_map {
const char*name;
void (*func)(Design*);
} func_table[] = {
{ "cprop", &cprop },
{ "nobufz", &nobufz },
{ "propinit", &propinit },
{ "sigfold", &sigfold },
{ "xnfio", &xnfio },
{ "xnfsyn", &xnfsyn },
{ 0, 0 }
};
net_func name_to_net_func(const string&name)
{
for (unsigned idx = 0 ; func_table[idx].name ; idx += 1)
if (name == func_table[idx].name)
return func_table[idx].func;
return 0;
}
1998-11-04 00:28:49 +01:00
int main(int argc, char*argv[])
{
bool help_flag = false;
1999-04-23 06:34:32 +02:00
const char* net_path = 0;
1998-11-04 00:28:49 +01:00
const char* out_path = 0;
1999-04-23 06:34:32 +02:00
const char* pf_path = 0;
1998-11-04 00:28:49 +01:00
int opt;
unsigned flag_errors = 0;
queue<net_func> net_func_queue;
1998-11-04 00:28:49 +01:00
1999-06-19 05:46:42 +02:00
while ((opt = getopt(argc, argv, "F:f:hN:o:P:s:t:v")) != EOF) switch (opt) {
case 'F': {
net_func tmp = name_to_net_func(optarg);
if (tmp == 0) {
cerr << "No such design transform function ``"
<< optarg << "''." << endl;
flag_errors += 1;
break;
}
net_func_queue.push(tmp);
break;
}
case 'f':
parm_to_flagmap(optarg);
break;
case 'h':
help_flag = true;
break;
1999-04-23 06:34:32 +02:00
case 'N':
net_path = optarg;
break;
1998-11-04 00:28:49 +01:00
case 'o':
out_path = optarg;
break;
1999-04-23 06:34:32 +02:00
case 'P':
pf_path = optarg;
break;
1998-11-04 00:28:49 +01:00
case 's':
start_module = optarg;
break;
case 't':
target = optarg;
break;
1999-06-19 05:46:42 +02:00
case 'v':
cout << "Icarus Verilog version " << VERSION << endl;
cout << COPYRIGHT << endl;
cout << endl << NOTICE << endl;
return 0;
1998-11-04 00:28:49 +01:00
default:
flag_errors += 1;
break;
}
if (flag_errors)
return flag_errors;
if (help_flag) {
cout << "Netlist functions:" << endl;
for (unsigned idx = 0 ; func_table[idx].name ; idx += 1)
cout << " " << func_table[idx].name << endl;
cout << "Target types:" << endl;
for (unsigned idx = 0 ; target_table[idx] ; idx += 1)
cout << " " << target_table[idx]->name << endl;
return 0;
}
1998-11-04 00:28:49 +01:00
if (optind == argc) {
cerr << "No input files." << endl;
return 1;
}
/* Parse the input. Make the pform. */
map<string,Module*> modules;
map<string,PUdp*> primitives;
1998-12-09 05:02:47 +01:00
int rc = pform_parse(argv[optind], modules, primitives);
1998-11-04 00:28:49 +01:00
1999-04-23 06:34:32 +02:00
if (pf_path) {
ofstream out (pf_path);
out << "PFORM DUMP MODULES:" << endl;
for (map<string,Module*>::iterator mod = modules.begin()
1998-11-04 00:28:49 +01:00
; mod != modules.end()
; mod ++ ) {
pform_dump(out, (*mod).second);
1998-11-04 00:28:49 +01:00
}
out << "PFORM DUMP PRIMITIVES:" << endl;
for (map<string,PUdp*>::iterator idx = primitives.begin()
; idx != primitives.end()
; idx ++ ) {
(*idx).second->dump(out);
}
1998-11-04 00:28:49 +01:00
}
1999-07-11 01:29:21 +02:00
if (rc) {
return rc;
}
if (start_module == "") {
for (map<string,Module*>::iterator mod = modules.begin()
; mod != modules.end()
; mod ++ ) {
Module*cur = (*mod).second;
if (cur->port_count() == 0)
if (start_module == "") {
start_module = cur->get_name();
} else {
cerr << "More then 1 top level module."
<< endl;
return 1;
}
}
}
1998-11-04 00:28:49 +01:00
/* Select a root module, and elaborate the design. */
if (start_module == "") {
cerr << "No top level modules, and no -s option." << endl;
return 1;
1998-11-04 00:28:49 +01:00
}
Design*des = elaborate(modules, primitives, start_module);
1998-11-04 00:28:49 +01:00
if (des == 0) {
cerr << "Unable to elaborate module " << start_module <<
"." << endl;
1998-11-04 00:28:49 +01:00
return 1;
}
if (des->errors) {
cerr << des->errors << " error(s) elaborating design." << endl;
return des->errors;
}
1998-11-04 00:28:49 +01:00
des->set_flags(flags);
while (!net_func_queue.empty()) {
net_func func = net_func_queue.front();
net_func_queue.pop();
func(des);
1998-11-04 00:28:49 +01:00
}
1999-04-23 06:34:32 +02:00
if (net_path) {
ofstream out (net_path);
1998-11-04 00:28:49 +01:00
des->dump(out);
}
if (out_path) {
ofstream out;
out.open(out_path);
if (! out.is_open()) {
cerr << "Unable to open " << out_path << " for writing."
<< endl;
return 1;
}
emit(out, des, target);
} else {
emit(cout, des, target);
}
return 0;
}
/*
* $Log: main.cc,v $
* Revision 1.22 1999/08/03 04:14:49 steve
* Parse into pform arbitrarily complex module
* port declarations.
*
* Revision 1.21 1999/07/18 05:52:46 steve
* xnfsyn generates DFF objects for XNF output, and
* properly rewrites the Design netlist in the process.
*
* Revision 1.20 1999/07/17 22:01:13 steve
* Add the functor interface for functor transforms.
*
1999-07-11 01:29:21 +02:00
* Revision 1.19 1999/07/10 23:29:21 steve
* pform even on parse errors.
*
1999-06-19 05:46:42 +02:00
* Revision 1.18 1999/06/19 03:46:42 steve
* Add the -v switch.
*
1999-06-17 07:33:12 +02:00
* Revision 1.17 1999/06/17 05:33:12 steve
* Redundant declaration of pform_parse.
*
1999-06-15 05:44:53 +02:00
* Revision 1.16 1999/06/15 03:44:53 steve
* Get rid of the STL vector template.
*
* Revision 1.15 1999/05/05 03:27:15 steve
* More intelligent selection of module to elaborate.
*
1999-04-23 06:34:32 +02:00
* Revision 1.14 1999/04/23 04:34:32 steve
* Make debug output file parameters.
*
* Revision 1.13 1999/02/01 00:26:49 steve
* Carry some line info to the netlist,
* Dump line numbers for processes.
* Elaborate prints errors about port vector
* width mismatch
* Emit better handles null statements.
*
* Revision 1.12 1999/01/24 01:35:36 steve
* Support null target for generating no output.
*
* Revision 1.11 1998/12/20 02:05:41 steve
* Function to calculate wire initial value.
*
1998-12-09 05:02:47 +01:00
* Revision 1.10 1998/12/09 04:02:47 steve
* Support the include directive.
*
* Revision 1.9 1998/12/07 04:53:17 steve
* Generate OBUF or IBUF attributes (and the gates
* to garry them) where a wire is a pad. This involved
* figuring out enough of the netlist to know when such
* was needed, and to generate new gates and signales
* to handle what's missing.
*
* Revision 1.8 1998/12/02 04:37:13 steve
* Add the nobufz function to eliminate bufz objects,
* Object links are marked with direction,
* constant propagation is more careful will wide links,
* Signal folding is aware of attributes, and
* the XNF target can dump UDP objects based on LCA
* attributes.
1998-11-04 00:28:49 +01:00
*/