BIT OPERATIONS

new topic     » topic index » view thread      » older message » newer message 

I am using and_bits() and its ilk.  I have noticed in some example code
that some of you have written that you are using machine operations for
and/or/xor functions, i.e. direct memory operations.

Is there really _that_ much of a performance increase?  The progs I have
seen using it are graphics examples, and so I know they need to be
basically as fast as possible.  But if I have:

atom a, b
integer p
a = #00FF
p = power(2,6)
b = and_bits(a,p)

how much processing am I losing by not using the direct memory ops
(from my misty memory, they seemed to be ASM register ops)?

Anyone have an idea?

Thank you very much,

-Jay Turley

new topic     » topic index » view thread      » older message » newer message

Search



Quick Links

User menu

Not signed in.

Misc Menu