Bitwise operations: Difference between revisions

=={{header|11l}}==

{{trans|Kotlin}}

V y = 2

print(‘x = ’x)

print(‘x SHR y = ’(x >> y))

print(‘x ROL y = ’rotl(x, y))

{{out}}

<pre>

=={{header|360 Assembly}}==

BITWISE CSECT

USING BITWISE,R13

PG DS CL12

YREGS

{{out}}

<pre>

Bitwise operations are done using the accumulator and an immediate constant (prefixed with #) or a value at a specified memory location (no #.)

;AND

;OR

;XOR

;NOT

The 6502 doesn't have arithmetic shift right, but it can be replicated, provided the negative flag is set according to the value in the accumulator.

CLC ;clear the carry. That way, ROR will not accidentally shift a 1 into the top bit of a positive number

BPL SKIP

SEC ;if the value in A is negative, setting the carry will ensure that ROR will insert a 1 into bit 7 of A upon rotating.

SKIP:

The 6502 can only rotate a value by one, not an arbitrary number. A looping routine is needed for rotates larger than 1.

Also, the 6502's <code>ROL</code> and <code>ROR</code> rotate instructions both rotate through the carry, unlike the instructions on other architectures with the same name. (68000, x86, and ARM all have a "ROR" command but it doesn't rotate through the carry on those CPUs.)

=={{header|68000 Assembly}}==

Like with most 68000 commands, you can specify a length parameter. Anything outside that length is unaffected by the operation.

;AND

MOVE.W #$200,D1

;OR

MOVE.W #$200,D1

;XOR

MOVE.W #$200,D1

;NOT

;Left Shift

MOVE.W #$04,D1

;Right Shift

MOVE.W #$04,D1

;Arithmetic Right Shift

MOVE.W #$04,D1

;Left Rotate

MOVE.W #$04,D1

;Right Rotate

MOVE.W #$04,D1

;Left Rotate Through Extend Flag

MOVE.W #$04,D1

;Right Rotate Through Extend Flag

MOVE.W #$04,D1

=={{header|8051 Assembly}}==

The end result of each operation resides in a.

The shift and rotate operations should likely push psw and pop psw because they affect the carry flag.

anl a, b

loop:

rr a

=={{header|8086 Assembly}}==

;AND

MOV BX,0444h

;OR

MOV BX,0444h

;XOR

MOV BX,0444h

;NOT

;Left Shift

MOV CL,02h

;Right Shift

MOV CL,02h

;Arithmetic Right Shift

MOV CL,02h

;Left Rotate

MOV CL,02h

;Right Rotate

MOV CL,02h

;Left Rotate Through Carry

MOV CL,02h

;Right Rotate Through Carry

MOV CL,02h

=={{header|ABAP}}==

This works in ABAP 7.40 and above. The missing arithmetic shift operations have been implemented with arithmetic, whereas the logical shift and the rotate operations have been implemented using the built in string functions shift_left and shift_right.

report z_bitwise_operations.

new_value = result ).

write: |a rotr b -> { result }, { hex_converter=>to_binary( result ) }, { hex_converter=>to_decimal( result ) }|, /.

{{output}}

=={{header|ACL2}}==

Unlisted operations are not available

(list (logand a b)

(logior a b)

(lognot a)

(ash a b)

=={{header|Action!}}==

RETURN (a!$FF)

res=a LSH b

PrintF("%B SHL %B = %B%E",a,b,res)

{{out}}

[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Bitwise_operations.png Screenshot from Atari 8-bit computer]

=={{header|ActionScript}}==

ActionScript does not support bitwise rotations.

{

trace("And: ", a & b);

trace("Right Shift(Arithmetic): ", a >> b);

trace("Right Shift(Logical): ", a >>> b);

=={{header|Ada}}==

The following program performs all required operations and prints the resulting values in base 2 for easy checking of the bit values.

use Ada.Text_IO, Interfaces;

Put_Line (Unsigned_8'Image (Rotate_Left (X, N)));

Put_Line (Unsigned_8'Image (Rotate_Right (X, N)));

=={{header|Aikido}}==

There is no rotate support built in to Aikido.

println("a AND b: " + (a & b))

println("a OR b: "+ (a | b))

println("a >> b: " + (a >> b)) // arithmetic right shift

println("a >>> b: " + (a >>> b)) // logical right shift

=={{header|ALGOL 68}}==

* 2r00000000000000000000000010101010, 4r0000000000002222, 8r00000000252, 16r000000aa

* and as an array of BOOL: FFFFFFFFFFFFFFFFFFFFFFFFTFTFTFTF

PRIO SLC = 8, SRC = 8; # SLC and SRC are not built in, define and overload them here #

bitwise(16rff,16raa,5)

END CO

Output:

<pre> bits shorths: +1 1 plus the number of extra SHORT BITS types

</pre>

Note that an INT can be widened into BITS, and BITS can be widened into an array of BOOL. eg:

INT i := 170;

BITS j := BIN i;

i := ABS j;

Output:

<pre>

=={{header|ALGOL W}}==

% Algol W does not have xor, arithmetic right shift, left rotate or right rotate %

procedure bitOperations ( integer value n1, n2 ) ;

write( n1, " shl ", n2, " = ", number( b1 shl n2 ), " ( left-shift )" );

write( n1, " shr ", n2, " = ", number( b1 shr n2 ), " ( right-shift )" )

=={{header|AppleScript}}==

use framework "Foundation"

use scripting additions

return lst

end tell

{{Out}}

<pre>32 bit signed integers (in two's complement binary encoding)

'''Second option''' – writing our own bitwise functions for Applescript:

use framework "Foundation"

use scripting additions

return lst

end tell

{{Out}}

<pre>32 bit signed integers (in two's complement binary encoding)

A '''third option''' is the mathematical one, although it still involves looping through the hypothetical bits where two numbers are involved, unless I've missed a trick. The handlers below all assume positive number inputs (except for ''arithmeticRightShift()'') and attempt to return results of class integer. The "hi bits" of numbers which don't fit the specified register sizes are discarded.

set out to 0

-- Multiplying equivalent bit values by each other gives 1 where they're both 1 and 0 otherwise.

leftRotate(92, 7, 8) --> 46

rightRotate(92, 7, 8) --> 184

=={{header|ARM Assembly}}==

{{works with|as|Raspberry Pi}}

/* ARM assembly Raspberry PI */

=={{header|Arturo}}==

b: 2

print ["NOT" a "=" not a]

print [a "SHL" b "=" shl a b]

{{out}}

=={{header|AutoHotkey}}==

bitwise(a, b)

{

MsgBox % "a << b: " . a << b ; left shift

MsgBox % "a >> b: " . a >> b ; arithmetic right shift

=={{header|AutoIt}}==

No arithmetic shift.

Func bitwise($a, $b)

MsgBox(1, '', _

$a & " ROL " & $b & ": " & BitRotate($a, $b) & @CRLF & _

$a & " ROR " & $b & ": " & BitRotate($a, $b * -1) & @CRLF )

{{out}}

{{works with|gawk}}

n = 11

p = 1

print n " >> " p " = " rshift(n, p) # right shift

printf "not %d = 0x%x\n", n, compl(n) # bitwise complement

[[OpenBSD]] <code>/usr/bin/awk</code> (a variant of [[nawk]]) has these same functions, with a few differences. Gawk uses 53-bit unsigned integers, but OpenBSD awk uses 32-bit signed integers. Therefore Gawk prints <code>not 11 = 0x1ffffffffffff4</code>, but OpenBSD awk prints <code>not 11 = 0xfffffff4</code>.

=={{header|Axe}}==

r₁→A

r₂→B

Disp "NOT:",not(A)ʳ▶Dec,i

.No language support for shifts or rotations

Note that the symbols for AND, OR, and XOR are the stat plot marks near the bottom of the Catalog.

In Babel, we prefix the logic operators with a 'c' to denote that they are C-style operations, that is, they are word-width operations, not arbitrary size operations. The following program combines the numbers 5 and 9 using the various bitwise operators and then displays the results.

{{Out}}

The cnot operator works on just one operand:

{{Out}}

{{works with|QuickBasic|4.5}}

QuickBasic does not have shift or rotate operations defined. Here are the logical operations:

PRINT a AND b

PRINT a OR b

PRINT a XOR b

PRINT NOT a

{{works with|FreeBASIC}}

FreeBASIC does not have rotate operators. Shift Right operator performs arithmetic shift if the left value is signed number and logical shift if the left value is unsigned number.

DIM u AS UInteger

u = a

PRINT "a SHR b (logical) = "; u SHR b

==={{header|Commodore BASIC}}===

Commodore BASIC V2.0 does not have '''XOR''', '''left shift''', '''right shift''', '''right arithmetic shift''', '''left rotate''', and '''right rotate''' operators. In this implementation the '''XOR''' operation is done with an equivalent formula.

20 INPUT "B="; B

30 PRINT "A AND B =" A AND B :rem AND

40 PRINT "A OR B =" A OR B :rem OR

50 PRINT "A XOR B =" (A AND(NOT B))OR((NOT A)AND B) :rem XOR

{{in}}

<pre>A=? 2

==={{header|IS-BASIC}}===

110 PRINT A;"and";B;"=";A AND B

120 PRINT A;"band";B;"=";A BAND B

150 PRINT A;"xor";B;"=";XOR(A,B)

160 PRINT " not";A;"=";NOT A

==={{header|Sinclair ZX81 BASIC}}===

The disassembly of the Z80 code would be:

3a 83 40 ld a, (4083)

47 ld b, a

06 00 ld b, 0

4f ld c, a ; value in BC reg pair is returned to BASIC

We then use <code>POKE</code> statements to replace the <code>and</code> instruction with each successive operation we want to perform.

Finally, observe that the first line reserves 15 bytes for our machine code routine by hiding them in a comment.

20 INPUT A

30 INPUT B

230 POKE 16514,USR 16516

240 NEXT I

{{in}}

<pre>21

Tiny BASIC has only one data type- the signed 16-bit integer- and no bitwise operations. This code emulates bitwise operations on unsigned 15-bit integers. Since the logic gates AND, NOR, and NXOR are characterised by having exactly two, exactly zero, and exactly one on bit in their inputs, their code is identical except for having a different number of target on bits (line 500 onward). The OR and XOR gates are just NOT NOR and NOT NXOR. The shift and rotate operations are simple divisions and mutiplications by 2, with care taken to avoid overflow, and a carry flag where applicable.

REM VARIABLES

REM A = first number

IF P = 0 THEN RETURN

GOTO 500

=={{header|BASIC256}}==

a = 0b00010001

b = 0b11110000

print a \ 2 # shift right (integer divide by 2)

print a | b # bitwise or on two integer values

=={{header|Batch File}}==

The following script (bitops.bat) not only demonstrates the basic bit operations, it also uses bit operations to convert each integral value into a string of 32 binary digits.

@echo off

setlocal

)

exit /b

Sample output

=={{header|BBC BASIC}}==

number2% = 8

PRINT ~ number1% >> number2% : REM right shift (arithmetic)

PRINT ~ (number1% << number2%) OR (number1% >>> (32-number2%)) : REM left rotate

=={{header|beeswax}}==

###>N{` AND `~{~` = `&{Nz1~3J

UXe#

###

>UX`-`!P{M!` >> `~{~` = `!)!`-`M!{` , interpreted as (negative) signed Int64 number (MSB=1)`NN;

Example:

julia> beeswax("Bitops.bswx",0,0.0,Int(20000))

i9223653511831486512

logical shift right, and negating the result again:

The natural number range for beeswax is unsigned Int64, but it is easy to implement signed Int64 by realizing negative numbers by their 2’s complements or interpreting numbers as negative if their MSB is 1, as shown in the example above.

Arithmetic shift right is not originally implemented in beeswax because it does not make sense for unsigned integers, but for negative numbers, it can be realized easily with

as demonstrated above.

In beeswax, rotate left (ROL) and rotate right (ROT) operators are implemented using modulo 64, so rotations by more than 63 bits wrap around:

=={{header|Befunge}}==

1 2 3 4 5 6>61g-:| 8 9

>&&\481p >88*61p371p >:61g\`!:68*+71g81gp| 7 >61g2/61p71g1+71pv

^ < G

The labelled points (1 to G) are:

1. Read in A and B,

=={{header|C}}==

{

printf("a and b: %d\n", a & b);

/* there are no rotation operators in C */

return 0;

To rotate an integer, you can combine a left shift and a right shift:

unsigned int rotr(unsigned int x, unsigned int s)

{

return (x >> s) | (x << 32 - s);

movl 4(%esp), %eax ; arg1: x

movl 8(%esp), %ecx ; arg2: s

rorl %cl, %eax ; right rotate x by s

=={{header|C sharp|C#}}==

{

Console.WriteLine("a and b is {0}", a & b);

// the operator performs a logical shift right

// there are no rotation operators in C#

=={{header|C++}}==

{{trans|C}}

void bitwise(int a, int b)

std::cout << "a ror b: " << std::rotr(ua, b) << '\n';

=={{header|Clojure}}==

(bit-or x y)

(bit-xor x y)

(bit-shift-left x n)

(bit-shift-right x n)

=={{header|COBOL}}==

Results are displayed in decimal.

PROGRAM-ID. bitwise-ops.

GOBACK

{{works with|Visual COBOL}}

PROGRAM-ID. mf-bitwise-ops.

GOBACK

=={{header|CoffeeScript}}==

CoffeeScript provides sugar for some JavaScript operators, but the bitwise operators are taken directly from JS. See more here: http://coffeescript.org/#operators

f = (a, b) ->

p "and", a & b

f(10,2)

output

> coffee foo.coffee

and 2

<< 40

>> 2

=={{header|Common Lisp}}==

(print (logand a b)) ; AND

(print (logior a b)) ; OR ("ior" = inclusive or)

(print (ash a (- b))) ; arithmetic right shift (negative 2nd arg)

; no logical shift

Left and right logical shift may be implemented by the following functions:

(defun shl (x width bits)

"Compute bitwise left shift of x by 'bits' bits, represented on 'width' bits"

(logand (ash x (- bits))

(1- (ash 1 width))))

Left and right rotation may be implemented by the following functions:

(defun rotl (x width bits)

"Compute bitwise left rotation of x by 'bits' bits, represented on 'width' bits"

(logand (ash x (- width (mod bits width)))

(1- (ash 1 width)))))

=={{header|D}}==

return (x >>> shift) | (x << (T.sizeof * 8 - shift));

}

testBit(a, b);

{{out}}

<pre>Input: a = 255, b = 2

=={{header|Delphi}}==

{$APPTYPE CONSOLE}

// there are no built-in rotation operators in Delphi

Readln;

=={{header|DWScript}}==

PrintLn('2 or 3 = '+IntToStr(2 or 3));

PrintLn('2 xor 3 = '+IntToStr(2 xor 3));

PrintLn('not 2 = '+IntToStr(not 2));

PrintLn('2 shl 3 = '+IntToStr(2 shl 3));

=={{header|E}}==

E provides arbitrary-size integers, so there is no distinct arithmetic and logical shift right. E does not provide bit rotate operations.

println(`Bitwise operations:

a AND b: ${a & b}

a right shift b: ${a >> b}

`)

=={{header|ECL}}==

BitwiseOperations(INTEGER A, INTEGER B) := FUNCTION

BitAND := A & B;

*/

=={{header|Elena}}==

ELENA 4.x :

extension testOp

{

console.loadLineTo(new Integer()).bitwiseTest(console.loadLineTo(new Integer()))

{{out}}

<pre>

=={{header|Elixir}}==

use Bitwise

end

{{out}}

All these operations are built-in functions except right arithmetic shift, left rotate, and right rotate.

-module(bitwise_operations).

io:format("~p bsl ~p = ~p\n",[A,B,A bsl B]),

io:format("~p bsr ~p = ~p\n",[A,B,A bsr B]).

outputs:

255 band 170 = 170

255 bor 170 = 255

255 bsl 170 = 381627307539845370001346183518875822092557105621893120

255 bsr 170 = 0

=={{header|F_Sharp|F#}}==

printfn "a and b: %d" (a &&& b)

printfn "a or b: %d" (a ||| b)

printfn "a shr b: %d" (a >>> b) // arithmetic shift

printfn "a shr b: %d" ((uint32 a) >>> b) // logical shift

=={{header|Factor}}==

{

[ bitand "a AND b: " write . ]

[ abs shift "a asl b: " write . ]

[ neg shift "a asr b: " write . ]

outputs:

b=5

a AND b: 5

NOT a: -256

a asl b: 8160

Currently rotation and logical shifts are not implemented.

=={{header|FALSE}}==

Only AND, OR, and NOT are available.

\$@$@$@$@\ { 3 copies }

"a & b = "&."

a | b = "|."

~a = "%~."

=={{header|Forth}}==

: bitwise ( a b -- )

cr ." a = " over . ." b = " dup .

cr ." a shr b = " 2dup rshift .

cr ." a ashr b = " 2dup arshift .

Rotation is not standard, but may be provided in particular Forth implementations, or as an assembly instruction in CODE words.

=={{header|Fortran}}==

In ISO Fortran 90 and later the following BIT INTRINSIC functions are defined:

logical :: a

! returns them as the rightmost bits of an otherwise

! zero-filled integer. For non-negative K this is

The following INTRINSIC ELEMENTAL SUBROUTINE is also defined:

program bits_rosetta

implicit none

end program bits_rosetta

Output

Input a= 14 b= 3

AND : 00000000000000000000000000001110 & 00000000000000000000000000000011 = 00000000000000000000000000000010 2

NOT : 00000000000000000000000000001110 ~ 00000000000000000000000000000011 = 11111111111111111111111111110001 -15

ROT : 00000000000000000000000000001110 ~ 00000000000000000000000000000011 = 11000000000000000000000000000001 -1073741823

=={{header|Free Pascal}}==

{$mode objfpc}

var

writeln('2 sar 3 = ', sarshortint(x,y));

Readln;

=={{header|FreeBASIC}}==

' FB 1.05.0 Win64 (Note the (U)Integer type is 64 bits)

Print

Print "Press any key to quit"

{{out}}

=={{header|FutureBasic}}==

FB does not have a bitwise symbol for not, but rather uses the "not" expression. It does not support predefined bitwise symbols for rotate left and rotate right, but functions in this demo provide that capability.

def fn rotl( b as long, n as long ) as long = ( ( 2^n * b) mod 256) or (b > 127)

fn bitwise( 255, 2 )

Output:

=={{header|Go}}==

import "fmt"

var a, b int16 = -460, 6

bitwise(a, b)

Output:

<pre>a: 1111111000110100

=={{header|Groovy}}==

println """

a & b = ${a} & ${b} = ${a & b}

a >>> b = ${a} >>> ${b} = ${a >>> b} logical (zero-filling) shift

"""

Program:

Output:

Harbour language has a set of core functions, which are fully optimized

at compile time, to perform bitwise operations.

PROCEDURE Main(...)

local n1 := 42, n2 := 2

return

Output:

Bitwise operations with two integers

The operations in ''Data.Bits'' work on ''Int'', ''Integer'', and any of the sized integer and word types.

bitwise :: Int -> Int -> IO ()

main :: IO ()

{{Out}}

<pre>170

=={{header|HicEst}}==

There is no rotate and no shift support built in to HicEst

i = IOR( k, j)

i = IEOR(k, j)

=={{header|HPPPL}}==

BEGIN

PRINT(BITAND(a, b));

PRINT(BITSR(a, b));

// HPPPL has no builtin rotates or arithmetic right shift.

=={{header|Icon}} and {{header|Unicon}}==

bitdemo(255,2)

bitdemo(-15,3)

procedure demowrite(vs,v)

return write(vs, ": ", v, " = ", int2bit(v),"b")

Icon/Unicon implements bitwise operations on integers. Because integers can be transparently large integers operations that require fixed sizes don't make sense and aren't defined. These include rotation and logical shifting (shift is arithmetic) . Please note also that 'not' is a reserved word and the negation function is 'icom'

Inform 6 has no xor or rotate operators. It also has no shift operators, although the Z-machine, its usual target architecture, does. These can be accessed with inline assembly, which is done here.

print "a and b: ", a & b, "^";

print "a or b: ", a | b, "^";

print "a >> b (logical): ", temp, "^";

];

=={{header|J}}==

Here are the "[http://www.jsoftware.com/help/dictionary/dbdotn.htm bitwise operators]":

bOR=: 23 b. NB. 16+#.0 1 1 1

bXOR=: 22 b. NB. 16+#.0 1 1 0

bRAshift=: 34 b.~ -

bLrot=: 32 b.~

And here is a routine which takes a list of bitwise operators and two numbers and displays a table of results from combining those two numbers with each of the operators:

:

smoutput (((":x),"1' ',.(>u),.' '),"1":y),"1' => ',"1'.X'{~#:x u`:0 y

And here they are in action:

254 bAND 3 => ............................X.

254 bOR 3 => ......................XXXXXXXX

254 bRAshift 3 => .........................XXXXX

254 bLrot 3 => ...................XXXXXXX....

Further test

bXOR/ 3333 5555 7777 9999

8664

=={{header|Java}}==

System.out.println("a AND b: " + (a & b));

System.out.println("a OR b: "+ (a | b));

System.out.println("a rol b: " + Integer.rotateLeft(a, b)); //rotate left, Java 1.5+

System.out.println("a ror b: " + Integer.rotateRight(a, b)); //rotate right, Java 1.5+

All of the operators may be combined with the <tt>=</tt> operator to save space. For example, the following lines each do the same thing:

a = a << 3;

a *= 8; //2 * 2 * 2 = 8

=={{header|JavaScript}}==

There are no integers in Javascript, but there are still bitwise operators. They will convert their number operands into integers before performing they task. In other languages, these operators are very close to the hardware and very fast. In JavaScript, they are very far from the hardware and very slow and rarely used.

alert("a AND b: " + (a & b));

alert("a OR b: "+ (a | b));

alert("a >> b: " + (a >> b)); // arithmetic right shift

alert("a >>> b: " + (a >>> b)); // logical right shift

=={{header|Julia}}==

@show 1 & 2 # AND

@show 1 | 2 # OR

@show A ror(A,1) ror(A,2) ror(A,5) # ROTATION RIGHT

@show rol(A,1) rol(A,2) rol(A,5) # ROTATION LEFT

{{out}}

=={{header|Kotlin}}==

we wrap Java's 'rotate' methods as infix functions */

infix fun Int.rol(distance: Int): Int = Integer.rotateLeft(this, distance)

println("x ROL y = ${x rol y}")

println("x ROR y = ${x ror y}")

{{out}}

All these operations are built-in functions except right arithmetic shift, left rotate, and right rotate.

(lists:map

(lambda (x) (io:format "~p~n" `(,x)))

(describe "bsl" a b (bsl a b))

(describe "bsr" a b (bsr a b))))

Example usage:

> (bitwise 255 170)

170

ok

>

=={{header|Liberty BASIC}}==

Written as functions.

' bitwise operations on byte-sized variables

dec2Bin$ =right$( "00000000" +dec2Bin$, 8)

end function

=={{header|Lingo}}==

Lingo has built-in functions for bitwise AND, OR, XOR and NOT:

put bitOR(2,7)

put bitXOR(2,7)

Bit shifting and rotating has to be implemented by custom functions.

=={{header|LiveCode}}==

put " or:" && (255 bitor 2) & comma after bitops

put " xor:" && (255 bitxor 2) & comma after bitops

-- Ouput

LiveCode does not provide built-in bit-shift operations.

=={{header|LLVM}}==

;e means little endian

;p: { pointer size : pointer abi : preferred alignment for pointers }

;Declare external fuctions

=={{header|Logo}}==

{{works with|UCB Logo}}

(print [a and b:] BitAnd :a :b)

(print [a or b:] BitOr :a :b)

(print [-a ashift -b:] AShift minus :a minus :b)

end

The output of this program is: