Lyle wrote...

>Dave Dilatush wrote:
>>
>>For example, the instruction sequence
>>
>>   rrcf  Binreg
>>   rrcf  Binreg+1
>>   movlw 0x3F
>>   andwf Binreg
>
>I think the above code will divide a 16 bit unsigned number by 2, then
>mask the value with .63
>Executing the rrcf pair TWICE before masking should give the result
>described in the text.
>
>Unless of course it's just too early on a Monday morinng, and I'm
>missing something obvious.

Ouch.  OK, let's try this again:

   rrcf  Binreg
   rrcf  Binreg+1
   rrcf  Binreg
   rrcf  Binreg+1
   movlw 0x3F
   andwf Binreg

Like you said, too early on a Monday morning.

Dave D.

--
http://www.piclist.com#nomail Going offline? Don't AutoReply us!
email listserv@mitvma.mit.edu with SET PICList DIGEST in the body