Another way to left shift a 32 bit data?

[Ioannis]

Thanks Richard.

Interesting approach!

Ioannis

[Art]

I don’t yet know if I’ve wrecked it in basic.

shifter byte
offset byte
array byte[7]


shifter = 11
offset = shifter >> 3            // byte in array to pass to whatever needs the 4 byte result, in this case 2
array[3] = 1<<(shifter & 7)      // Set it to 00000000 (00000000 00000000 00001000 00000000) 00000000 00000000
‘dostuff with array[offset]

[Ioannis]

I could not follow that...

Ioannis

[Art]

So long as I have not ruined the way a C pointer will work...

Before any input, the 32 bits you want could be anywhere within the 7 byte array.
After computation, the memory location of the four bytes of the 32 bit value begins at array[offset].

[Ioannis]

Oh, I see. Thanks for the ideas.

Still, asm rotate will be faster.

Ioannis

[Art]

I have my doubts, You only have to call it once.
Assuming there is equal chance the input is 0-31, an assembler rotate routine will be called mean of 15 times.
For a shift in either language the overhead is in finding the byte you want to shift.

Again, assuming it’s still working. I’ll be able to try in PBP soon.

If I’m mistaken and it’s not another trick you’ve worked out because of the known state of the array at the beginning, that would be helpful.
It is currently taking me the equal number of assembler instructions as there are bytes in the array to bitwise rotate an array
that has unknown contents at the beginning, which is the same as in the sixth post of this thread.

[Ioannis]

I have a problem (what a surprise, huh?) with the MPLAB. It has a tool or something that helps to measure the exact time it takes for a routine to execute. No Osciloscopes, no pins to make high / low etc.

Yes, the asm way will take from 1 to 32 times since we do not know the times to shift. But as you showed in #6, it takes give or take 5 asm instructions for one shift, max 32x5. Basic I think cannot beat that.

Ioannis