Example on public divisor, Computer Engineering

Assignment Help:

Q. Example on PUBLIC DIVISOR?

Linker appends all segments having the same name and PUBLIC directive with segment name into one segment. Their contents are pulled together in consecutive memory locations.

The subsequent statement to be noted is PUBLIC DIVISOR. It tells the assembler and linker that this variable can be legally accessed by other assembly modules. Whereas EXTRN SMART_DIV: FAR conveys the assembler that this module will access a label or a procedure of type FAR in some assembly module. Please also note that EXTRN definition is enclosed within the PROCEDURES ENDS andPROCEDURES SEGMENT PUBLIC to tell the assembler and linker that procedure SMART_DIV is located within the segment PROCEDURES and all such PROCEDURES segments are required to be combined in one. Let's now define the PROCEDURE module:  

; PROGRAM MODULE PROCEDURES

 

; INPUT                      : Dividend - low word in AX, high word in DX, Divisor in CX

; OUTPUT                  : Quotient - low word in AX, high word in DX. Remainder in CX

; Carry                         - carry flag is set if try to divide by zero

; DESTROYS: AX, BX, CX, DX, BP, FLAGS

DATA_SEG SEGMENT   PUBLIC; this block tells the assembler that

EXTRN DIVISOR: WORD                          ; the divisor is a word variable and is

DATA_SEG   ENDS                         ; external to this procedure. It would be 

                                                            ; found in segment named DATA_SEG

PUBLIC SMART_DIV                     ; SMART_DIV is available to

                                                            ; Other modules. It is now being defined 

                                                            ; In PROCEDURES SEGMENT.

PROCEDURES   SEGMENT PUBLIC

SMART_DIV PROC FAR

                                 ASSUME CS: PROCEDURES, DS: DATA_SEG

                                 CMP DIVISOR, 0; this is just to demonstrate the use of 

                                                                        ; External variable, otherwise we can 

                                                                        ; Check it through CX register which

                                                                        ; contains the divisor.

JE        ERROR_EXIT   ; IF divisor = 0, exit procedure

MOV  BX, AX   ; Save low order of dividend

MOV  AX, DX; Position high word for 1st divide

MOV  DX, 0000h; Zero DX

DIV     CX; DX: AX/CX, quotient in AX,

                                 ; Remainder in DX

MOV BP, AX                  ; transfer high order of final result to BP

MOV AX, BX                 ; Get back low order of dividend. Note 

                                         ; DX contains remainder so DX: AX is 

                                         ; The actual number

DIV CX; DX: AX/CX, quotient in AX,

                                         ; 2nd remainder that is final remainder 

                                         ; in DX

MOV CX, DX                 ; Pass final remainder in CX

MOV DX, BP                  ; Pass high order of quotient in DX

                                         ; AX contains lower word of quotient

CLC                                 ; Clear carry to indicate valid result

JMP EXIT                        ; Finished

 

ERROR_EXIT: STC   ; Set carry to indicate divide by zero

EXIT:   RET 

SMART_DIV   ENDP 

PROCEDURES   ENDS 

END 

Discussion: 

Procedure accesses the data item named DIVISOR that is defined in the main consequently the statement EXTRN DIVISOR: WORD is essential for informing assembler that this data name is found in some other segment. Data-type is defined to be of word type. Please consider that DIVISOR is enclosed in same segment name as that of main which is DATA_SEG and procedure is in a PUBLIC segment.


Related Discussions:- Example on public divisor

-bit comparator using combinational logic, Design a 4-bit comparator using ...

Design a 4-bit comparator using combinational logic, and Karnaugh Maps. The inputs of the circuit are two 2-bit numbers. a) Construct the truth table given 2-bits inputs A and B, a

naming convention in local scope variables, Description Variables show ...

Description Variables show values that can be changed within a procedure or function. Local scope variables are placeholders that reside within a function- or a script-body.

Illustrate the accumulator architecture, Accumulator Architecture: An accu...

Accumulator Architecture: An accumulator is anespecially designated register which supplies one instruction operand and receives result. Instructions in such machines are usually

Ai applications, AI Applications Search is a crucial component of an AI...

AI Applications Search is a crucial component of an AI system, and the search functions are performed over large quantities of difficult structured data using unstructured inpu

What is difference between cgi and java, CGI and JAVA are fundamentally dis...

CGI and JAVA are fundamentally dissimilar, and for most applications are NOT interchangable. CGI is a protocol for running programs on a WWW server. Whilst JAVA can also be us

Explain message, Differentiate between message switching, packet switching ...

Differentiate between message switching, packet switching and circuit switching Message switching: Recourse computer sends data to switching office that stores the data in

Hard-disk acquisition, Problem (a) Forensic methodology consists of t...

Problem (a) Forensic methodology consists of three phases. Briefly explian these three phases. (b) Sometimes it's best not to perform hard-disk acquisition. Provide two

Illustrate associative memory, Q. Illustrate Associative Memory? The ti...

Q. Illustrate Associative Memory? The time required to find an item which is stored in memory can be decreased significantly if stored data can be identified for access by cont

Write a pseudo code to find sum of two functions, Q. Write a pseudo code to...

Q. Write a pseudo code to find sum of two functions? Let's write a pseudo code to find sum of two functions f(A) + f(B). In first algorithm we will not use locking. Process

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