Re^3: Left shift operation done more than 32 times


The stupid question is the question not asked
	PerlMonks

Re^3: Left shift operation done more than 32 times

by dave_the_m (Monsignor)

on May 21, 2006 at 09:20 UTC ( [id://550765]=note: print w/replies, xml )

Need Help??

in reply to Re^2: Left shift operation done more than 32 times
in thread Left shift operation done more than 32 times

I think Perl does both: taking $i%32 as its RHS, and drop the higher bits, just keeping the lower 32 bits, from the result.

No, perl is doing exactly as it says in the docs; it is just using the underlying C << operator, whose result is undefined for overflows. That means the result will vary based on C compiler and/or CPU architecture.

from pp.c:

    const IV shift = POPi;
    if (PL_op->op_private & HINT_INTEGER) {
        const IV i = TOPi;
        SETi(i << shift);
    }
    else {
        const UV u = TOPu;
        SETu(u << shift);
    }
[download]

Dave.