Bitwise operations (was: Humorous Enhancements: now)

David,

    Thanks for the tip!  Seeing your examples, it seems so simple,
why didn't I think of that?  :)

Thank you!

Scott Klement
Information Systems Manager
Klement's Sausage Co, Inc.


"Kahn, David [JNJFR]" <DKahn1@JNJFR.JNJ.com> wrote:
>
> Scott,
>
> You can use BITON and BITOF to emulate the logical operators OR AND
>  and XOR
> much more efficiently than that. You don't need to do a TESTB or use
> indicators. Assume the operands are in single byte fields A and B an
>  you
> want the result in field C without altering A or B.
>
> To perform OR:
>
>      C                     MOVE A         C       1
>      C                     BITONB         C
>
> To perform AND:
>
>      C                     MOVE A         C       1
>      C                     MOVE A         X       1
>      C                     BITOFB         X
>      C                     BITOFX         C
>
> To perform XOR:
>
>      C                     MOVE A         C       1
>      C                     MOVE B         X       1
>      C                     BITOFA         X
>      C                     BITOFB         C
>      C                     BITONX         C
>
> Still not as efficient as directly implemented operations, but not
>  bad.
>
> Dave Kahn
> Johnson & Johnson International (Ethicon) France
> Phone : +33 1 55 00 3180
> Email :  dkahn1@jnjfr.jnj.com (work)
>     dkahn@cix.co.uk      (home)

<<snipped older messages>>
+---
| This is the RPG/400 Mailing List!
| To submit a new message, send your mail to RPG400-L@midrange.com.
| To subscribe to this list send email to RPG400-L-SUB@midrange.com.
| To unsubscribe from this list send email to RPG400-L-UNSUB@midrange.com.
| Questions should be directed to the list owner/operator: david@midrange.com
+---END