Skip to main content

Branching Group Instructions (Part-II) - Call and Conditional call

CALL addr:
  • The CALL instruction is used to transfer the program control to a subprogram or subroutine.
NOTE: A subroutine is a group of instructions which performs a particular task and is executed a number of times. Rather than writing this repeated part again and again, the programmer writes this part only once. It is written separately. The processor executes this part by transferring program control from main program to the subroutine program. After completion of execution of subroutine, the program control is back to the main program.

Subroutine Program


  • The CALL instruction transfers the program control to the address given in the instruction.
  • The current contents of program counter (PC) are copied into the stack.
NOTE: Stack is a part of read/write memory which is used for storing temporary results and addresses.

  • Then this instruction decrements stack pointer (SP) by two.
  • No flags are affected.
  • It is a three byte instruction.
  • Immediate addressing mode is used.
Example:
If SP = 2000H, then
6000H CALL 1000H ; This instruction will store the address of the instruction next to CALL i.e. 6003H on the stack and load program counter with 1000H.

Before execution:

After execution:

Ccond addr:
  • When the condition is true, this instruction calls the subroutine at the address given in the instruction.
  • When the condition is false, this instruction executes the instruction after the CALL instruction.
  • If the condition is true, the current contents of program counter are copied into the stack and stack pointer is decremented by two.

  • No flags are affected. They are only checked.
  • It is a three byte instruction.
  • Immediate addressing mode is used.
Example:
If CY = 1 and SP = 2000H
6000H CC 1000H ; This instruction will store the address of the instruction next to CALL i.e. 6003H on the stack and load program counter with 1000H since CY = 1.

Comments

Popular posts from this blog

Program to pack the two unpacked BCD numbers

Statement: Pack the two unpacked BCD numbers stored in memory locations 2000H and 2001H and store the result in memory location 2002H. The least significant digit is stored at 2000H. Example: (2000H) = 04H (2001H) = 09H Result = (2002H) = 94H Program: LDA 2001H                        ; Obtain the most significant BCD digit RLC                                    ; Rotate left  RLC                                    ; Rotate left  RLC                                    ; Rotate left  RLC                                    ; Rotate left...

Program to exchange the contents of two memory locations

Statement: Exchange the contents of memory locations 2000H and 2001H. Example:  Initially, (2000H) = 34H (2001H) = 20H After exchanging, (2000H) = 20H (2001H) = 34H Program 1 using direct addressing instructions: LDA 2000H               ; Get the contents of location 2000H into accumulator MOV B, A                  ; Move the contents of accumulator into register B LDA 2001H                ; Get the contents of location 2001H into accumulator STA 2000H                 ; Store the contents of accumulator into location 2000H MOV A, B                  ; Move the contents of register B into accumulator STA 2001H                 ; Store the contents of accumulator into location 2001H HLT  ...

Program to add the contents of two memory locations

Statement: Add the contents of memory locations 2000H and 2001H and place the result in the memory locations 2002H and 2003H. Example: (2000H) = C3H (2001H) = 29H Result = C3H + A9H = 016CH (2002H) = 6CH (2003H) = 01H Program: LXI H, 2000H                   ; HL points to location 2000H MOV A, M                        ; Move the contents of 2000H into accumulator INX H                                ; HL points to location 2001H ADD M                              ; Add the contents of 2001H with the contents of accumulator INX H                                ; HL points to location 2002H MOV M, A      ...