The
ISHFT function performs the
bit
shift operation on bytes, integers and longwords. If *
P*
_{
2}
is positive, *
P*
_{
1}
is left shifted *
P*
_{
2}
bit positions with 0 bits filling vacated positions. If *
P*
_{
2}
is negative, *
P*
_{
1}
is right shifted with 0 bits filling vacated positions.

Bit shift each element of the integer array [1, 2, 3, 4, 5] three bits to the left and store the result in B by entering: