Explain passing parameters using pointers, Computer Engineering

Assignment Help:

Q. Explain Passing Parameters Using Pointers ?

This method overcomes the drawback of using variable names directly in procedure. It uses registers to pass procedure pointers to desired data. Let's explain it more with the help of a program.

Program version 2:

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_SEG   ; Initialize data

MOV DS, AX   ; segment using AX register

MOV AX, STACK_SEG   ; initialize stack

MOV SS, AX; segment. Why stack?

MOV SP, OFFSET TOP_STACK; initialize stack pointer

; Put pointer to BCD storage in SI and DI prior to procedure call.

                        MOV SI, OFFSET BCD   ; SI now points to BCD_IN 

                        MOV DI, OFFSET BIN; DI points BIN_VAL 

                                                            ; (returned value)

                        CALL BCD_BINARY   ; Call the conversion 

                                                            ; Procedure

                        NOP     ; Continue with program

                                                            ; Here

; PROCEDURE     : BCD_BINARY Converts BCD numbers to binary. 

; INPUT     : SI points to location in memory of data

; OUTPUT     : DI points to location in memory for result

; DESTROYS    : Nothing

BCD_BINARY PROC NEAR

PUSHF     ; Save flag register 

PUSH AX; and AX registers

PUSH BX; BX  

PUSH CX; and CX

MOV AL, [SI]   ; Get BCD value from memory

                                     ; For conversion

MOV BL, AL   ; copy it in BL also

AND   BL, 0Fh   ; and mask to get lower 4 digits

AND AL, 0F0h; Separate upper 4 bits in AL

MOV CL, 04   ; initialize counter CL so that upper digit 

ROR AL, CL; in AL can be brought to lower 4 bit 

                                    ; Positions in AL

MOV BH, 0Ah   ; Load 10 in BH

MUL BH; Multiply upper digit in AL by 10

                                    ; The result is stored in AL

ADD AL, BL   ; Add lower BCD digit in BL to result of 

                                    ; Multiplication

; End of conversion, now restore the original values prior to call. All calls will be in 

; reverse order to save above. The result is in AL register.

MOV [DI], AL   ; Store binary value to memory

POP CX; Restore flags and

POP BX; registers

POP AX  

POPF    

RET    

BCD_BINARY ENDP

CODE_SEG ENDS

             END START

Discussion:

In the program written above DI points to BIN and SI points to the BCD. The instruction MOV AL, [SI] copies the byte pointed by SI to AL register. In the same manner MOV [DI], AL transfers result back to memory location which is pointed by DI. 

This scheme allows you to pass procedure pointers to data anywhere in memory. You can pass pointer to individual data element or a group of data elements such as strings and arrays. This scheme is used for parameters passing to BIOS procedures.


Related Discussions:- Explain passing parameters using pointers

Classical approach - canonical genetic algorithm, Classical approach - Cano...

Classical approach - Canonical genetic algorithm: However returning to the classical approach, as there example, whether solving a particular problem involved finding a set of

Explain procedure level of parallel processing, Procedure Level Here, p...

Procedure Level Here, parallelism is obtainable in the form of parallel executable procedures. In that case, design of algorithm plays a key role. E.g. every thread in Java is

What is the difference between = = = and = =, What is the difference betwee...

What is the difference between = = = and = = ? output of "==" can be 1, 0 or X. output of "===" can only be 0 or 1. When you are comparing 2 nos using "==" and if one/bo

Implemented in a program developed for sorting , A student counted up the n...

A student counted up the number of statements implemented in a program developed for sorting n integers and came up with a recurrence of the form: T(n) = a * n + b + 2T(n/2), an

Compute the coefficient for classifier, Consider the data with categorical ...

Consider the data with categorical predictor x 1 = { green or red } and numerical predictor x 2 and the class variable y shown in the following table. The weights for a round

What are the "field" and "chain" statements, What are the "field" and "chai...

What are the "field" and "chain" Statements? The FIELD and CHAIN flow logic statements let you Program your own checks. FIELD and CHAIN tell the system which fields you are ch

Does gimp have scanner support, Yes. It's available on Windows and uses TWA...

Yes. It's available on Windows and uses TWAIN, and on GNU/Linux you constant have a choice among XSane and gnome-scan - both can be used as GIMP plug-ins.

What is a co-processor, What is a co-processor? What is its use in a typica...

What is a co-processor? What is its use in a typical microprocessor based system. 8087 NDP (numerical data processor) is also called math co-processor which is used in parallel

State the advantages off-the-shelf, State the advantages Off-the-shelf ...

State the advantages Off-the-shelf -  tends to be less expensive as development costs can be spread over many users -  can be more sophisticated as large sales bring in c

Explain cache memory, What is cache memory? It is a small, fast memory ...

What is cache memory? It is a small, fast memory that is inserted among large, slower main memory and the processor. It decreases the memory access time

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