From: Shalom Bresticker (shalom@msil.sps.mot.com)
Date: Mon Mar 09 1998 - 08:31:09 PST
----- Begin Included Message -----
>From shalom Mon Mar 9 17:26:35 1998
To: tfitz@cadence
Subject: Re: BTF B19 - Signed Arithmetic Proposal (Updated)
> >From an implementation standpoint, we have tried very hard to minimize the
> amount of checking that the parser has to do when it encounters an expression.
> Having to check every part-select expression to see if it in fact covers the
> entire vector would be unnecessary overhead which we would rather avoid.
>
> Please note that adding the new functionality will not break any existing
> designs, since you can currently only have things unsigned anyway. If you
> insist on specifying part selects of full vectors, you could always use
>
> wire signed [5:0] a,b,c ;
> a[5:0] = $signed(b[5:0]) & $signed(c[5:0]) ;
Hi, Tom.
Well, you're correct, and I agree with every word.
In addition, I also think it would be wrong to distinguish between the
behavior of full part-selects and part part-selects.
I just worry that old habits will cause bugs.
The only practical suggestion I have would be to add in the LRM
a warning to this effect.
<p>----- End Included Message -----
This archive was generated by hypermail 2.1.4
: Mon Jul 08 2002 - 12:52:46 PDT
and
sponsored by Boyd Technology, Inc.