At 5:23 PM +0200 9/2/04, Leopold Toetsch wrote:
Dan Hursh <[EMAIL PROTECTED]> wrote:
How about a context->freakish that would allow
rotl Pdest, n, 5 # rotate 5 lowest ordered bits leaving
overkill probably. By 8, 16, 32, 64 ought do it. And that looks too
much.
Yeah. Larry's note about the
Dan Hursh <[EMAIL PROTECTED]> wrote:
> How about a context->freakish that would allow
> rotl Pdest, n, 5 # rotate 5 lowest ordered bits leaving
overkill probably. By 8, 16, 32, 64 ought do it. And that looks too
much.
leo
Leopold Toetsch wrote:
Dan Sugalski <[EMAIL PROTECTED]> wrote:
rotl Pdest, n, 32# rotate left in place by n 32-bitwise
These have merit. The only question then is what happens with the
rest of the bits. (If one rotates a 64 bit quantity with a 32-bit
rotate)
First, we should probably as
Hi,
> fixed sizes of integer, so I'd aim some ops at low-level types of
> known size and leave it at that.
Quite a while back, I did add a few opcodes for fixed size integer operations
for Parrot .. But they were added for a totally different HLL :)
> matter what you do with the high bits. I
On Tue, Aug 31, 2004 at 06:58:02PM +0200, Leopold Toetsch wrote:
: First, we should probably ask HLL designers. I can imagine two options:
: 1) rotate whatever is there - don't care about higher bits
: 2) if higher bits are non-zero, throw an exception
Well, I'm just one datapoint, and maybe I'm a
Dan Sugalski <[EMAIL PROTECTED]> wrote:
> At 11:58 AM +0200 8/31/04, Leopold Toetsch wrote:
>>First: we don't have any rotate vtables or opcodes. Shall these be
>>considered as a TODO?
> Yes. It's been floating around but never did get formally added.
Ok. Takers wanted.
>> rotl Pdest, n, 32
At 11:58 AM +0200 8/31/04, Leopold Toetsch wrote:
Dan Sugalski <[EMAIL PROTECTED]> wrote:
Rotates on bools are meaningless (nothing happens), ints rotate at 32
or 64 bits depending on the native word size
First: we don't have any rotate vtables or opcodes. Shall these be
considered as a TODO?
Yes
Dan Sugalski <[EMAIL PROTECTED]> wrote:
> Rotates on bools are meaningless (nothing happens), ints rotate at 32
> or 64 bits depending on the native word size
First: we don't have any rotate vtables or opcodes. Shall these be
considered as a TODO?
> ... (and yeah, I know this
> is going to be an
At 10:43 PM +0100 8/26/04, Nicholas Clark wrote:
On Thu, Aug 26, 2004 at 05:18:54PM -0400, Dan Sugalski wrote:
Good question. The size of the bignum, if it's been declared to have
a maximum size, or the maximum size that it's been, though that
doesn't feel particularly right.
That feels particul
Nicholas writes:
> I can't really see how you can rotate a bignum that doesn't have a width
> already associated with it.
Maybe that's the answer: unless a bignum has a limit set on it,
rotate is shift ('we're just rotating a really, really large number...')
F.
Dan writes:
> >The "some multiple" being the next largest power of 256 that contains the
> >value, or the width that the value happens to be stored in at that time?
> >(Based on previous values assigned to that PMC which may have widened it)
>
> Good question. The size of the bignum, if it's been
On Thu, Aug 26, 2004 at 05:18:54PM -0400, Dan Sugalski wrote:
> Good question. The size of the bignum, if it's been declared to have
> a maximum size, or the maximum size that it's been, though that
> doesn't feel particularly right.
That feels particularly bad if language implementations happe
At 9:40 PM +0100 8/26/04, Nicholas Clark wrote:
On Thu, Aug 26, 2004 at 04:11:52PM -0400, Dan Sugalski wrote:
is going to be an issue), and bignums rotate assuming they're binary
numbers some multiple of 8 bits (minimum 64 bits).
The "some multiple" being the next largest power of 256 that contai
On Thu, Aug 26, 2004 at 04:11:52PM -0400, Dan Sugalski wrote:
> is going to be an issue), and bignums rotate assuming they're binary
> numbers some multiple of 8 bits (minimum 64 bits).
The "some multiple" being the next largest power of 256 that contains the
value, or the width that the value h
Bitops. Fun. Note that we are specifically leaving strings out of
this for the moment, and restricting ourselves to
bool/int/bignum/float pmcs.
All bit operations pad the shorter value with 0 bits on the high bit end.
Bools are considered to have one bit. 1 if true, 0 if not.
Left shifts of inte
15 matches
Mail list logo
