Example on passing parameters through stack, Computer Engineering

Assignment Help:

Q. Example on Passing Parameters through Stack?

PROGRAM: Version 3

DATA_SEG               SEGMENT

                        BCD DB 25h; Storage for BCD test value

BIN DB?  ; Storage for binary value

DATA_SEG               ENDS

STACK_SEG   SEGMENT      STACK

DW 100 DUP (0); Stack of 100 words

TOP_STACK   LABEL    WORD

STACK_SEG   ENDS

CODE_SEG SEGMENT

ASSUME CS: CODE_SEG, DS: DATA_SEG, SS: STACK_SEG

START:           MOV AX, DATA                  ; Initialise data segment

 

MOV DS, AX                                    ; using AX register

MOV AX, STACK-SEG.      ; initialise stack segment

MOV SS, AX                         ; using AX register

MOV SP, OFFSET TOP_STACK; initialise stack pointer

MOV AL, BCD                      ; Move BCD value into AL

PUSH AX                               ; and push it onto word stack

CALL BCD_BINARY          ; Do the conversion

POP AX                                  ; Get the binary value

MOV BIN, AL                       ; and save it

NOP                                        ; Continue with program

 

; PROCEDURE: BCD_BINARY Converts BCD numbers to binary.

; INPUT   : None - BCD value assumed to be on stack before call

; OUTPUT   : None - Binary value on top of stack after return 

; DESTROYS: Nothing

BCD_BINARY PROC NEAR

                                 PUSHF     ; Save flags

                                 PUSH AX; and registers: AX

                                 PUSH BX; BX

                                 PUSH CX; CX

                                 PUSH BP; BP. Why BP?

                                 MOV BP, SP; Make a copy of the

                                                ; stack pointer in BP

                                 MOV   AX, [BP+ 12]; Get BCD number from

                                                ; stack. But why it is on 

 

; BP+12 location? Please note 5 PUSH statements + 1 call which is intra-segment (so 

; just IP is stored) so total 6 words are pushed after AX has been pushed and since it is 

; a word stack so the BCD value is stored on 6 × 2 = 12 locations under stack. Hence 

; [BP + 12] (refer to the figure given on next page).

MOV BL, AL; Save copy of BCD in BL

AND BL, 0Fh; mask lower 4 bits

AND AL, F0H; Separate upper 4 bits

MOV CL, 04; Move upper BCD digit to low

ROR   AL, CL; position BCD digit for multiply location

MOV   BH, 0Ah   ; Load 10 in BH

MUL BH; Multiply upper BCD digit in AL by 10

   ; The result is in AL

ADD   AL, BL; Add lower BCD digit to result.

MOV [BP + 12], AX   ; Put binary result on stack

; Restore flags and registers

POP BP

POP CX

POP BX

            POP AX

                                 POPF  

                                 RET  

BCD_BINARY       ENDP

CODE_SEG            ENDS

END   START  

 

Discussion: 

The parameter is pushed on stack before the procedure call. Procedure call causes the current instruction pointer to be pushed on to stack. In the procedure flags AX, BX, CX and BP registers are also pushed in that order. Hence the stack looks to be:

721_Example on Passing Parameters through Stack.png

The instruction MOV BP, SP transfers contents of the SP to BP register. Now BP is used to access any location in stack by adding appropriate offset to it. For illustration MOV AX, [BP + 12] instruction transfers the word starting at the 12th byte from the top of stack to AX register. It doesn't change the contents of BP register or top of the stack. It copies pushed value of AL and AH at offset 008Eh into the AX register. This instruction isn't equivalent to POP instruction. 

Stacks are useful for writing procedures for multi-user system programs or recursive procedures. It's a decent practice to make a stack diagram as above when using procedure call through stacks. This helps in reducing errors in programming.


Related Discussions:- Example on passing parameters through stack

Prove using boolean algebra, Q. Prove using Boolean Algebra 1. AB + AC ...

Q. Prove using Boolean Algebra 1. AB + AC + BC' = AC + BC' 2. (A+B+C) (A+B'+C') (A+B+C') (A+B'+C)=A 3. (A+B) (A'+B'+C) + AB = A+B 4. A'C + A'B + AB'C + BC = C + A'B

Discuss the advantages of expression tree, Discuss its advantages over the ...

Discuss its advantages over the other evaluation techniques. The expression tree is determined by using a post-order traversal of the expression tree as given here: 1. If such

Operating systems Hw, Need help in class assignment !! i have only 24 hours...

Need help in class assignment !! i have only 24 hours!!

What are the advantages of using structure in c program, What are the advan...

What are the advantages of using structure in C Program Declaring a struct is a two-stage process. The first stage defines a new data type that has the required structure which

How can we use metropolitan area network, Q. How can we use Metropolitan Ar...

Q. How can we use Metropolitan Area Network? A MAN, essentially a bigger versions of a LAN is designed to extend over an entire city. It may be single network like a cable tele

What are the various hazards encountered in pipelining, What is pipelining?...

What is pipelining? What are the various hazards encountered in pipelining?  Explain in detail. The major characteristics of a pipeline are: a) Pipelining cannot be exe

How will you prepare problem statement, How will you prepare problem statem...

How will you prepare problem statement? Problem statement should state what is to be completed and not how it is to be executed. It should be a statement of requirements not a

What is the efficient data structure used in rdbms, In RDBMS, what is the e...

In RDBMS, what is the efficient data structure used in the internal storage representation? B+ tree. Because in B+ tree, all the data is kept only in leaf nodes, that makes sea

Cascade delete options, Create a relationship among Employee and Sales tabl...

Create a relationship among Employee and Sales tables using Emp No. Enforce referential integrity and select both cascade update and cascade delete options. Save the relationship.

Explain the fork-join, Explain the fork-join? fork-join: It is prim...

Explain the fork-join? fork-join: It is primitives in a programming language of higher level for implementing interacting processes. The syntax is as given below: fork

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