1. Computer Organization and Assembly Language
Unit: 07
Conditional JUMPS

2. Jcond Instruction Two steps to create a logic structure in ASM
Execute CMP, AND, or SUB to modify the CPU status flags
Execute conditional jump instruction
A conditional jump instruction branches to a label when specific register or flag conditions are met
Specific jumps:
JB, JC - jump to a label if the Carry flag is set
JE, JZ - jump to a label if the Zero flag is set
JS - jump to a label if the Sign flag is set
JNE, JNZ - jump to a label if the Zero flag is clear
JECXZ - jump to a label if ECX = 0

3. Jcond Ranges Prior to the 386: x86 processors:
jump must be within –128 to +127 bytes from current location counter
x86 processors:
32-bit offset permits jump anywhere in memory

4. Jumps Based on Specific Flags

5. Jumps Based on Equality

6. Jumps Based on Unsigned Comparisons

7. Jumps Based on Signed Comparisons

8. Applications (1 of 5)
Task: Jump to a label if unsigned EAX is greater than EBX
Solution: Use CMP, followed by JA
cmp eax,ebx
ja Larger
Task: Jump to a label if signed EAX is greater than EBX
Solution: Use CMP, followed by JG
cmp eax,ebx
jg Greater

9. Applications (2 of 5)
cmp eax,Val1
jbe L1 ; below or equal
Jump to label L1 if unsigned EAX is less than or equal to Val1
cmp eax,Val1
jle L1
Jump to label L1 if signed EAX is less than or equal to Val1

10. Applications (3 of 5)
mov Large,bx
cmp ax,bx
jna Next
mov Large,ax
Next:
Compare unsigned AX to BX, and copy the larger of the two into a variable named Large
mov Small,ax
cmp bx,ax
jnl Next
mov Small,bx
Next:
Compare signed AX to BX, and copy the smaller of the two into a variable named Small

11. Applications (4 of 5)
Jump to label L1 if the memory word pointed to by ESI equals Zero
cmp WORD PTR [esi],0
je L1
Jump to label L2 if the doubleword in memory pointed to by EDI is even
test DWORD PTR [edi],1
jz L2

12. Applications (5 of 5)
Task: Jump to label L1 if bits 0, 1, and 3 in AL are all set.
Solution: Clear all bits except bits 0, 1,and 3. Then compare the result with binary.
and al, b ; clear unwanted bits
cmp al, b ; check remaining bits
je L1 ; all set? jump to L1

13. Next
Conditional Loop Instructions
Conditional Structures

14. Conditional Loop Instructions
LOOPZ and LOOPE
LOOPNZ and LOOPNE

15. LOOPZ and LOOPE
The LOOPZ & LOOPE (loop if zero & loop if equal) instruction let a loop continue while ZF =1 &CX>0.
The destination of the jump must be b/w -128 and +127 bytes from the current location.
Syntax:
LOOPE destination
LOOPZ destination
First CX is decremented then if CX>0 &ZF=1 the CPU jumps to destination; otherwise control passes to next instruction
Useful when scanning an array for the first element that does not match a given value.
In 32-bit mode, ECX is the loop counter register. In 16-bit real-address mode, CX is the counter, and in 64-bit mode, RCX is the counter.

16. LOOPZ and LOOPE Scan an Array Example
.data Intarray dw 0,0,0,0,1,20,35,-12,66,4,0 ArraySize= ($-intarray)/2 .code Mov bx, offset intarray ; point to an array Sub bx,2 ; back up one position Mov cx, ArraySize ;repeat ArraySize times Next: Add bx,2 ;point to next entry Cmp word ptr [bx],0 ;compare value to zero Loopz next ; loop while ZF=1, CX >0 The loopz instruction makes it easy to traverse an array of integers until a nonzero value is found. As the CMP instruction compares each integer to 0, it either sets or clears the zero flag accordingly. While a nonzero value is eventually found, loopz does not jump to the label called next:

17. LOOPNZ and LOOPNE
The LOOPNZ & LOOPNE (loop while not zero, loop while not equal) instructions are the counterpart to LOOPZ & LOOPE. The loop continues while CX>0 and ZF=0.
LOOPNZ (LOOPNE) is a conditional loop instruction
Syntax:
LOOPNZ destination
LOOPNE destination
Useful when scanning an array for the first element that matches a given value.

18. The following code finds the first positive value in an array:
LOOPNZ Example
The following code finds the first positive value in an array:
.data
Bytearray db -3,-6,-1,-10,10,30,40,4
ArraySize = ($-array)
.code
mov si,OFFSET Bytearray-1
mov cx,ArraySize
next:
Inc si
Test byte ptr [si], b
Loopnz next
The inc instruction is before the TEST instruction to avoid altering the zero flag between the test and LOOPNZ instruction.

19. Your turn . . .
Locate the first nonzero value in the array. If none is found, let ESI point to the sentinel value:
.data
array SWORD 50 DUP(?)
sentinel SWORD 0FFFFh
.code
mov esi,OFFSET array
mov ecx,LENGTHOF array
L1: cmp WORD PTR [esi],0 ; check for zero
(fill in your code here)
quit:

20. . . . (solution) .data array SWORD 50 DUP(?) sentinel SWORD 0FFFFh
.code
mov esi,OFFSET array
mov ecx,LENGTHOF array
L1: cmp WORD PTR [esi],0 ; check for zero
pushfd ; push flags on stack
add esi,TYPE array
popfd ; pop flags from stack
loope L1 ; continue loop
jz quit ; none found
sub esi,TYPE array ; ESI points to value
quit:

21. What's Next
Conditional Loop Instructions
Conditional Structures

22. Conditional Structures
Block-Structured IF Statements
Compound Expressions with AND
Compound Expressions with OR
WHILE Loops
Table-Driven Selection

23. Block-Structured IF Statements
Assembly language programmers can easily translate logical statements written in C++/Java into assembly language. For example:
if( op1 == op2 )
X = 1;
else
X = 2;
mov eax,op1
cmp eax,op2
jne L1
mov X,1
jmp L2
L1: mov X,2
L2:

24. (There are multiple correct solutions to this problem.)
Your turn . . .
Implement the following pseudocode in assembly language. All values are unsigned:
if( ebx <= ecx ) {
eax = 5;
edx = 6; }
cmp ebx,ecx
ja next
mov eax,5
mov edx,6
next:
(There are multiple correct solutions to this problem.)

25. (There are multiple correct solutions to this problem.)
Your turn . . .
Implement the following pseudocode in assembly language. All values are 32-bit signed integers:
if( var1 <= var2 )
var3 = 10;
else {
var3 = 6;
var4 = 7; }
mov eax,var1
cmp eax,var2
jle L1
mov var3,6
mov var4,7
jmp L2
L1: mov var3,10
L2:
(There are multiple correct solutions to this problem.)

26. Compound Expression with AND (1 of 3)
When implementing the logical AND operator, consider that HLLs use short-circuit evaluation
In the following example, if the first expression is false, the second expression is skipped:
if (al > bl) AND (bl > cl)
X = 1;

27. Compound Expression with AND (2 of 3)
if (al > bl) AND (bl > cl)
X = 1;
This is one possible implementation . . .
cmp al,bl ; first expression...
ja L1
jmp next
L1:
cmp bl,cl ; second expression...
ja L2
L2: ; both are true
mov X,1 ; set X to 1
next:

28. (There are multiple correct solutions to this problem.)
Your turn . . .
Implement the following pseudocode in assembly language. All values are unsigned:
if( ebx <= ecx
&& ecx > edx ) {
eax = 5;
edx = 6; }
cmp ebx,ecx
ja next
cmp ecx,edx
jbe next
mov eax,5
mov edx,6
next:
(There are multiple correct solutions to this problem.)

29. Compound Expression with OR (1 of 2)
When implementing the logical OR operator, consider that HLLs use short-circuit evaluation
In the following example, if the first expression is true, the second expression is skipped:
if (al > bl) OR (bl > cl)
X = 1;

30. Compound Expression with OR (2 of 2)
if (al > bl) OR (bl > cl)
X = 1;
We can use "fall-through" logic to keep the code as short as possible:
cmp al,bl ; is AL > BL?
ja L1 ; yes
cmp bl,cl ; no: is BL > CL?
jbe next ; no: skip next statement
L1: mov X,1 ; set X to 1
next:

31. This is a possible implementation:
WHILE Loops
A WHILE loop is really an IF statement followed by the body of the loop, followed by an unconditional jump to the top of the loop. Consider the following example:
while( eax < ebx)
eax = eax + 1;
top: cmp eax,ebx ; check loop condition
jae next ; false? exit loop
inc eax ; body of loop
jmp top ; repeat the loop
next:
This is a possible implementation:

32. Implement the following loop, using unsigned 16-bit integers:
Your turn . . .
Implement the following loop, using unsigned 16-bit integers:
while( bx <= val1) {
bx = bx + 5;
val1 = val1 - 1 }
top: cmp bx,val1 ; check loop condition
ja next ; false? exit loop
add bx,5 ; body of loop
dec val1
jmp top ; repeat the loop
next:

33. REPEAT-UNTIL Structure
A REPEAT-UNTIL structure executes one or more statements within a block at least once and performs a test at the bottom of the loop. Consider the following example in which two conditions are tested before the loop repeats:
Repeat
<statement 1>
<statement 2>
<statement 3>
Until (op1=op2) or (op1> op3)

34. Example Repeat: Test1:mov ax,0 ;assume result is false Cmp op1,op2
<statement 1>
<statement2>
<staement3>
Test1:mov ax,0 ;assume result is false
Cmp op1,op2
Jne test2
Mov ax,0FFh ;set result to true
;end if
Test2: push ax ;save result of first test
mov ax,0 ;assume result is false
hna test3 ;if op1>op3 then
mov ax,0FFh ;set result to true
Test3: popdx ;retrieve first result
or dx,ax ;or with the second result
jz endup ;exit if neither is true
jmp repeat ;otherwise, jump to repeat
endup

35. CASE Structure
CASE structure allows multiway branch by comparing a single value to a list of values.
Case input of
‘A’ : process_A;
‘B’ :process_B;
‘C’ :process_C;
End;
Mov a1,input
Cmp al,’A’
Je Process_A
Cmp al,’B’
Je Process_B
Cmp al, ‘C’
Je process_C

36. Table of Procedures OFFSET
A more efficient way to process a CASE structure is to create an offset table containing the offsets of labels or procedures.
The assembler can calculate a label’s offset and place it in a variable..
An offset table is more efficient when a large number of comparisons must be made.

37. Table containing offsets of procedures
CaseTable db ‘A’ ;loopup value dw process_A ;address of the procedure db ‘B’ dw process_B db ‘C’ dw process_C