How to perform bit-wise xor, and...?

[d941686@sp2 (Leong San Io Francisco)]

Hi!

	Can someone teach me how to perform bit-wise "xor", and, "or" of two
integers in Ada so that it can generate code as close as to the underlying
computer's instructions like the C's ^, &, | operators? I am trying to write
some computer instructions emulation stuff as well as bitmap graphics
manipulation which requires "xor", "or" bytes. Is multiplication by 2 really
equal to shift left and division by integer 2 to shift right?
	My Ada compiler only provides xor, and operations for booleans and
not integers...

Thanks.
Francisco Leong