Scott Dattalo wrote:

> How fast can you logically AND two bits?
>
> Given:
>  bit_a  of register A
>  bit_b  of register B
>  bit_c  of register C
>
> The goal in C parlance is:
>
>   C.bit_c = A.bit_a & B.bit_b;

John Payson wrote:
>
>
>         bsf     C
>         btfsc   A
>          btfss  B
>          bcf    C

Yep.


And in a private message after his original post
Bob Fehrenbach wrote:
>
> After another minute's consideration:
>
>    bsf     c, bit_c
>    btfsc   a, bit_a
>    btfss   b, bit_b
>    bcf     c, bit_c

Looks familiar.

And in his second attempt Strang, Charles wrote a by now
not strange:
>
> After further review:
>
> bsf     c,bit_c
> btfsc   a,bit_a
> btfss   b,bit_b
> bcf     c,bit_c

More of the same.

So 4-cycle, isosynchronous, W-preserving bit ANDing is possible.
(That's only 80ns for an unobtanium Scenix.) BTW, logical ORing takes
just as long.

        BCF    C,bit_c
        BTFSS  A,bit_a
         BTFSC B,bit_b
          BSF  C,bit_c

Scott