develooper Front page | perl.perl5.porters | Postings from June 2015

Re: Coverity finding: shift by negative

Thread Previous | Thread Next
From:
Jarkko Hietaniemi
Date:
June 25, 2015 13:14
Subject:
Re: Coverity finding: shift by negative
Message ID:
558BFE9E.6040005@iki.fi
On Thursday-201506-25 7:19, Jarkko Hietaniemi wrote:
> What I mean by this is that "hexagram" isn't a bit string of 64 bits,
> which one could AND, OR, XOR, NOT, shift, and so forth.  That's why
> Bit::Vector.

Also: I think the wordsize/wordbits is unavoidably present and visible. 
  If one doesn't know it, one cannot know how much one can left-shift 
without losing bits.
Thread Previous | Thread Next

nntp.perl.org: Perl Programming lists via nntp and http.
Comments to Ask Bjørn Hansen at ask@perl.org | Group listing | About