Files 3-Handouts Lecture 8

Download as pdf or txt
Download as pdf or txt
You are on page 1of 15

Lecture on Logical & Shift Instructions

Logical instructions: The 88/86 processors has instructions to perform bit by bit logic operation on the specified source and destination operands. Mnemonic
AND OR XOR NOT

Meaning
Logical AND Logical Inclusive OR Logical Exclusive OR LOGICAL NOT

Format
AND D,S OR D,S XOR D,S NOT D

Operation
(S) (D) (D) (S)+(D) (D) (S) + (D)(D) _ (D) (D)

Flags Affected
OF, SF, ZF, PF, CF AF undefined OF, SF, ZF, PF, CF AF undefined OF, SF, ZF, PF, CF AF undefined None

Destination Register Register Memory Register Memory Accumulator

Source Register Memory Register Immediate Immediate Immediate Destination Register Memory Allowed operand for NOT Operation

Allowed operands for AND, OR, and XOR operations

Logical Instructions
AND
Uses any addressing mode except memory-to-memory and segment registers Especially used to clear certain bits (masking) xxxx xxxx AND 0000 1111 = 0000 xxxx (clear the first four bits) Examples: AND BL, 0FH AND AL, [345H] OR Used to set certain bits xxxx xxxx OR 0000 1111 = xxxx 1111 (Set the upper four bits)

XOR
Used to invert certain bits xxxx xxxx XOR 0000 1111 = xxxxxxxx
-Example: Clear bits 0 and 1, set bits 6 and 7, invert bit 5 of register CL: AND CL, 1111 1100B ; clear bits 0 and 1 OR CL, 1100 0000B; set bits 6 and 7 XOR CL, 0010 0000B; invert bit 5.

Shift Instructions
Mnemonic
SAL/SHL

Meaning
Shift arithmetic Left/shift Logical left

Format
SAL/SHL D, Count

Operation
Shift the (D) left by the number of bit positions equal to count and fill the vacated bits positions on the right with zeros Shift the (D) right by the number of bit positions equal to count and fill the vacated bits positions on the left with zeros Shift the (D) right by the number of bit positions equal to count and fill the vacated bits positions on the left with the original most significant bit

Flags Affected
CF,PF,SF,ZF AF undefined OF undefined if count 1 CF,PF,SF,ZF AF undefined OF undefined if count 1 CF,PF,SF,ZF AF undefined OF undefined if count 1

SHR

Shift logical right Shift arithmetic right

SHR D, Count

SAR

SAR D, Count

Destination Register Register Memory Memory 1 CL 1 CL

Count

CF SHL CF SAL

Target register or memory 0

0 CF

SHR

0 CF

SAR

Sign bit

Note that the amount of shift specified in the source operand can be defined Explicitly if it is one bit or should be stored in CL if more than 1. EX: SHL AX, 1 causes the 16-bit register to be shifted 1-bit position to the left Where the vacated LSB is filled with zero and the bit shifted out of the MSB is saved in CF Register AX before instruction SHL AX, 1

x
CF

0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 0

Shift arithmetic left SAL is exactly the same as SHL

EX:

MOV CL, 2H SHR AX, CL The two MSBs are filled with zeros and the LSB is thrown away while the Second LSB is saved in CF.

0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0

x
CF

In Arithmetic shift to the right SAR the vacated bits at the left are filled with The value of the original MSB of the operand. Thus the original sign of the Number is maintained. Ex: Assume (CL)= 2 and (AX)= 091AH. Determine the new contents of AX And CF after the instruction SAR AX, CL is executed.

0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0

0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0

1
CF

This operation is equivalent to division by powers of 2 as long as the bits shifted out of the LSB are zeros.

Ex.

Multiply AX by 10 using shift instructions SHL AX, 1 MOV BX, AX MOV CL,2 SHL AX,CL ADD AX, BX SAR CL, 1 if CL initially contains B6H? DBH SHL AL, CL if AL contains 75H and CL contains 3? A8H

Ex. What is the result of Ex. What is the result of

Rotate Instructions
Mnemonic
ROL

Meaning
Rotate left

Format
ROL D, Count

Operation
Rotate the (D) left by the number of bit positions equal to Count. Each bit shifted out from the left most bit goes back into the rightmost bit position. Rotate the (D) right by the number of bit positions equal to Count. Each bit shifted out from the rightmost bit goes back into the leftmost bit position. Same as ROL except carry is attached to (D) for rotation. Same as ROR except carry is attached to (D) for rotation.

Flags Affected
CF OF undefined if count 1

ROR

Rotate right

ROR D, Count

CF OF undefined if count 1

RCL

Rotate left through carry Rotate right through carry

RCL D, Count

CF OF undefined if count 1 CF OF undefined if count 1

RCR

RCR D, Count

Destination Register Register Memory Memory 1 CL 1 CL

Count

Allowed Operands for rotate instruction

CF RCL CF ROL

CF RCR

ROR Ex. What is the result of ROL BTRE PTR [SI], 1 if SI is pointing to a memory location that contains 41H? (82H)

CF

EX: Assume (AX) = 1234H What is the result of executing the instruction

ROL AX, 1

0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0

0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0

The original value of bit 15 which is 0 is rotated into CF and bit 0 of AX. All other bits have been rotated 1 bit position to the left. Rotate right ROR instruction operates the same way as ROL except that Data is rotated to the right instead of left.

In rotate through carry left RCL and rotate through carry right RCR the bits rotate through the carry flag.

Rotation caused by RCL instruction

Rotation caused by RCR instruction

Example
Write a program that counts the number of 1s in a byte and writes it into BL
DATA1 DB 97 ; 61h SUB BL, BL ; clear BL to keep the number of 1s MOV DL, 8 ; Counter MOV AL, DATA1

AGAIN: ROL AL,1 ; rotate left once


JNC NEXT ; check for 1 INC BL ; if CF=1 then add one to count NEXT: DEC DL ; go through this 8 times JNZ AGAIN ; if not finished go back NOP

You might also like