Explain call and return statements, Computer Engineering

Assignment Help:

Q. Explain Call and Return Statements?

CALL:

      CALL X    Procedure Call to procedure/function named X

  CALL instruction causes the following to happen: 

1.  Decrement the stack pointer so that we won't overwrite last thing put on stack

(SP <---SP - 1)

901_Call and Return Statements.png

Figure: Call and Return Statements

2.  The contents of PC that is pointing to NEXT instruction the one just after CALL is pushed onto stack and M [SP] <--- PC.

3.  JMP to X address of the start of subprogram is put in PC register.This is all a jump does. So we go off to the subprogram though we have to remember where we were in calling program which means that we should remember where we came from so that we can get back there again. 

PC <--- X 

RETN:

RETN      Return from procedure.   

RETN instruction causes following to happen: 

1.  Pops the stack to produce an address/label.If correctly used, the top of the stack will comprise the address of next instruction after the call from that we are returning; it's this instruction with that we want to resume in calling program.

2.  Jump to popped address it implies that put the address into PC register.

 PC <---  top of stack value; Increment SP.


Related Discussions:- Explain call and return statements

Explain difference between a constant and variable, What is the difference ...

What is the difference between a constant and variable? Explain with example.  A C constant is usually just the written version of a number. For example 1, 0, 5.73, 12.5e9. We

What is blocking probability, What is blocking probability? Blocking ...

What is blocking probability? Blocking Probability: The blocking probability P is described as the probability like all the servers in system are busy. If all the servers ar

Design requirements of combinational logic, What are the requirements to de...

What are the requirements to design Combinational Logic ? Ans . Design Requirements of Combinational Logic:- (i) By the specifications of circuit, we find out the

Time complexity in the worst case, Speicified the following piece of code: ...

Speicified the following piece of code: int i = 1; int j = 4; while (i     {      if (i%3 == 0) i+=3;      else i+=4;        if (j%2 == 0) j*=4;      els

Determine the block diagram of bcd adder, Determine the block diagram of bc...

Determine the block diagram of bcd adder To add 0110 to binary sum, we use a second 4-bit binary adder. The two decimal digits, together with input-carry, are first added in to

replacing option of a copy statement, What is the point of the REPLACING o...

What is the point of the REPLACING option of a copy statement? Ans) REPLACING permits for the similar copy to be used more than once in the similar code by changing the replac

Java program , Q.--> The program simulates a student management system havi...

Q.--> The program simulates a student management system having thE following:The interface uses command buttons to (i) add,edit,delete,update and cancel the records, (ii) to naviga

Explain optimal page replacement algorithm, Optimal Page Replacement Algori...

Optimal Page Replacement Algorithm The optimal page replacement algorithm that as well known as OPT is an algorithm which works as follows: while a page needs to be swapped in,

Display the map centered on the users location, Question: a) The follo...

Question: a) The following is a description of the navigation options in a mobile web site which provides public bus time slots for a city. It is an interesting service for m

Explain syntax of recursion, Syntax of recursion int fib(int num) /*...

Syntax of recursion int fib(int num) /* Fibonacci value of a number */ {      switch(num) { case 0: return(0); break; case 1: return(1); break; default:  /* Incl

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd