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

Handle 0 counts in repeat concatenation.

This commit is contained in:
steve 2001-07-16 20:41:41 +00:00
parent e4139f4819
commit 85d53ebbf4
1 changed files with 16 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
eval_tree.cc
View File

@ -17,7 +17,7 @@
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*/ */
#if !defined(WINNT) && !defined(macintosh) #if !defined(WINNT) && !defined(macintosh)
#ident "$Id: eval_tree.cc,v 1.24 2001/02/10 20:29:39 steve Exp $" #ident "$Id: eval_tree.cc,v 1.25 2001/07/16 20:41:41 steve Exp $"
#endif #endif
# include "netlist.h" # include "netlist.h"
@ -704,6 +704,18 @@ NetEConst* NetEConcat::eval_tree()
} }
} }
// Handle the special case that the repeat expression is
// zero. In this case, just return a 0 value with the expected
// width.
if (repeat_ == 0) {
verinum val (verinum::V0, expr_width());
NetEConst*res = new NetEConst(val);
res->set_width(val.len());
return res;
}
// Figure out the width of the repeated expression, and make a
// verinum to hold the result.
unsigned gap = expr_width() / repeat_; unsigned gap = expr_width() / repeat_;
verinum val (verinum::Vx, repeat_ * gap); verinum val (verinum::Vx, repeat_ * gap);
@ -982,6 +994,9 @@ NetEConst* NetEUReduce::eval_tree()
/* /*
* $Log: eval_tree.cc,v $ * $Log: eval_tree.cc,v $
* Revision 1.25 2001/07/16 20:41:41 steve
* Handle 0 counts in repeat concatenation.
*
* Revision 1.24 2001/02/10 20:29:39 steve * Revision 1.24 2001/02/10 20:29:39 steve
* In the context of range declarations, use elab_and_eval instead * In the context of range declarations, use elab_and_eval instead
* of the less robust eval_const methods. * of the less robust eval_const methods.