luke
/
iverilog
mirror of https://github.com/steveicarus/iverilog.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

BLIF support for IVL_LPM_CMP_EQ and IVL_LPM_CMP_NE

This commit is contained in:
Stephen Williams 2013-07-27 20:04:45 -07:00
parent 7a6192b5c8
commit dfc44db0ef
4 changed files with 143 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
tgt-blif/Makefile.in
View File

@ -44,7 +44,7 @@ CPPFLAGS = $(INCLUDE_PATH) @CPPFLAGS@ @DEFS@ @PICFLAG@
CXXFLAGS = @WARNING_FLAGS@ @CXXFLAGS@
LDFLAGS = @LDFLAGS@
O = blif.o constants.o logic_gate.o lpm.o lpm_add.o nex_data.o
O = blif.o constants.o logic_gate.o lpm.o lpm_add.o lpm_cmp_eq.o nex_data.o
all: dep blif.tgt

8
tgt-blif/lpm.cc
View File

@ -103,10 +103,18 @@ int print_lpm(FILE*fd, ivl_lpm_t net)
case IVL_LPM_ADD:
rc += print_lpm_add(fd, net);
break;
case IVL_LPM_CMP_EQ:
case IVL_LPM_CMP_EEQ:
rc += print_lpm_cmp_eq(fd, net);
break;
case IVL_LPM_CONCAT:
case IVL_LPM_CONCATZ:
rc += print_concat(fd, net);
break;
case IVL_LPM_CMP_NE:
case IVL_LPM_CMP_NEE:
rc += print_lpm_cmp_ne(fd, net);
break;
case IVL_LPM_PART_VP:
rc += print_part_vp(fd, net);
break;

132
tgt-blif/lpm_cmp_eq.cc Normal file
View File

@ -0,0 +1,132 @@
/*
* Copyright (c) 2013 Stephen Williams (steve@icarus.com)
*
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
# include "priv.h"
# include "nex_data.h"
# include <cassert>
/*
* Implement IVL_LPM_CMP_EQ devices
*/
int print_lpm_cmp_eq(FILE*fd, ivl_lpm_t net)
{
fprintf(fd, "# %s:%u: IVL_LPM_CMP_EQ: width=%u\n",
ivl_lpm_file(net), ivl_lpm_lineno(net), ivl_lpm_width(net));
ivl_nexus_t q_nex = ivl_lpm_q(net);
ivl_nexus_t a_nex = ivl_lpm_data(net,0);
ivl_nexus_t b_nex = ivl_lpm_data(net,1);
blif_nex_data_t*q_ned = blif_nex_data_t::get_nex_data(q_nex);
blif_nex_data_t*a_ned = blif_nex_data_t::get_nex_data(a_nex);
blif_nex_data_t*b_ned = blif_nex_data_t::get_nex_data(b_nex);
assert(1 == q_ned->get_width());
assert(ivl_lpm_width(net) == a_ned->get_width());
assert(ivl_lpm_width(net) == b_ned->get_width());
if (ivl_lpm_width(net) == 1) {
fprintf(fd, ".names %s%s %s%s %s%s\n"
"11 1\n"
"00 1\n",
a_ned->get_name(), a_ned->get_name_index(0),
b_ned->get_name(), b_ned->get_name_index(0),
q_ned->get_name(), q_ned->get_name_index(0));
return 0;
}
for (unsigned idx = 0 ; idx < ivl_lpm_width(net) ; idx += 1) {
fprintf(fd, ".names %s%s %s%s %s/%u\n"
"11 1\n"
"00 1\n",
a_ned->get_name(), a_ned->get_name_index(idx),
b_ned->get_name(), b_ned->get_name_index(idx),
q_ned->get_name(), idx);
}
fprintf(fd, ".names");
for (unsigned idx = 0 ; idx < ivl_lpm_width(net) ; idx += 1)
fprintf(fd, " %s/%u", q_ned->get_name(), idx);
fprintf(fd, " %s\n", q_ned->get_name());
for (unsigned idx = 0 ; idx < ivl_lpm_width(net) ; idx += 1)
fputc('1', fd);
fprintf(fd, " 1\n");
return 0;
}
/*
* Implement IVL_LPM_CMP_NE devices
*/
int print_lpm_cmp_ne(FILE*fd, ivl_lpm_t net)
{
fprintf(fd, "# %s:%u: IVL_LPM_CMP_NE: width=%u\n",
ivl_lpm_file(net), ivl_lpm_lineno(net), ivl_lpm_width(net));
ivl_nexus_t q_nex = ivl_lpm_q(net);
ivl_nexus_t a_nex = ivl_lpm_data(net,0);
ivl_nexus_t b_nex = ivl_lpm_data(net,1);
blif_nex_data_t*q_ned = blif_nex_data_t::get_nex_data(q_nex);
blif_nex_data_t*a_ned = blif_nex_data_t::get_nex_data(a_nex);
blif_nex_data_t*b_ned = blif_nex_data_t::get_nex_data(b_nex);
assert(1 == q_ned->get_width());
assert(ivl_lpm_width(net) == a_ned->get_width());
assert(ivl_lpm_width(net) == b_ned->get_width());
if (ivl_lpm_width(net) == 1) {
fprintf(fd, ".names %s%s %s%s %s%s\n"
"10 1\n"
"01 1\n",
a_ned->get_name(), a_ned->get_name_index(0),
b_ned->get_name(), b_ned->get_name_index(0),
q_ned->get_name(), q_ned->get_name_index(0));
return 0;
}
for (unsigned idx = 0 ; idx < ivl_lpm_width(net) ; idx += 1) {
fprintf(fd, ".names %s%s %s%s %s/%u\n"
"10 1\n"
"01 1\n",
a_ned->get_name(), a_ned->get_name_index(idx),
b_ned->get_name(), b_ned->get_name_index(idx),
q_ned->get_name(), idx);
}
fprintf(fd, ".names");
for (unsigned idx = 0 ; idx < ivl_lpm_width(net) ; idx += 1)
fprintf(fd, " %s/%u", q_ned->get_name(), idx);
fprintf(fd, " %s\n", q_ned->get_name());
for (unsigned idx = 0 ; idx < ivl_lpm_width(net) ; idx += 1) {
for (unsigned jdx = 0 ; jdx < ivl_lpm_width(net) ; jdx += 1) {
if (idx==jdx)
fputc('1', fd);
else
fputc('-', fd);
}
fprintf(fd, " 1\n");
}
return 0;
}

2
tgt-blif/priv.h
View File

@ -33,6 +33,8 @@ extern int print_logic_gate(FILE*fd, ivl_net_logic_t net);
extern int print_lpm(FILE*fd, ivl_lpm_t net);
extern int print_lpm_add(FILE*fd, ivl_lpm_t net);
extern int print_lpm_sub(FILE*fd, ivl_lpm_t net);
extern int print_lpm_cmp_eq(FILE*fd, ivl_lpm_t net);
extern int print_lpm_cmp_ne(FILE*fd, ivl_lpm_t net);
/*
* Emit all the constants for a model. This works by scanning the