Chapter 8

Transcript Chapter 8

Assembly Language for x86 Processors 6th Edition

Kip R. Irvine

Chapter 8: Advanced Procedures

Slides prepared by the author.

Revision date: 2/15/2010

(c) Pearson Education, 2010. All rights reserved. You may modify and copy this slide show for your personal use, or for use in the classroom, as long as this copyright statement, the author's name, and the title are not changed.

Parameter Passing



We currently have two ways to pass parameters to a procedure

  By using registers By using global variables 

However these mechanisms to pass parameters are not suited if we want

 To use a variable number of parameters

[ Limited # of registers ]

 To permit a procedure to call itself (for using recursion)

[ Global variables are static ]

 2

In these circumstances we can stack

 level languages

pass parameters via the

This is the mechanism of parameter passing used by high

Stack Frame

• Also known as an

activation record

• Area of the stack set aside for a procedure's return address, passed parameters, saved registers, and local variables • Created by the following steps: • Calling program pushes arguments ( i.e. parameters ) on the stack and calls the procedure.

• The called procedure pushes EBP on the stack, and sets EBP to ESP.

• If local variables are needed, a constant is subtracted from ESP to make room on the stack.

3 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Passing Arguments to a Procedure

1. Push arguments on stack • Arguments pushed on the stack are called

stack parameters

• (Use only 32-bit values in protected mode to keep the stack aligned) • To pass by value: push argument’s value • To pass by reference: push argument’s offset 2. Call the called-procedure 3. Accept a return value in EAX, if any 4. Remove arguments from the stack if the called-procedure did not remove them 4 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.



Stack Parameters

Suppose that we have a procedure, called IMUL2, who’s task is to multiply two signed numbers and return the result into EAX.

 The

caller

calls IMUL2 with parameters

push varA ;push a dword variable

varA and varB like this:

push varB ;another dword variable call IMUL2 ;result in EAX, stack unchanged add esp,8 ; clean the stack (i.e. restore ESP)



We have assumed that IMUL2 did not changed the stack:

 ESP just after returning from IMUL2 is pointing to the same place as it was just before calling IMUL2.

 5

But, since 8 bytes of parameters were pushed on the stack, we need to increase ESP by 8 after returning from IMUL2

 Otherwise, ESP would be decreased by 8 at each IMUL2 usage and, consequently, the stack could overflow if the 3 first statements were inside a loop   We say that the stack has been restored by the caller This is the method used by C/C++ compilers

 

Stack Parameters (cont.)

Given that IMUL2 is called that way, we can write it like this:



These are called stack frames (or activation records ) IMUL2 PROC push ebp mov ebp,esp mov eax,[ebp+12] imul eax,[ebp+8] pop ebp ret IMUL2 ENDP varA varB ret addr.

orig. ebp ebp esp after mov ebp,esp We use EBP to access the stack parameters (not ESP)

6  Compilers are using this method.

But, more simply, we could have used ESP instead...

[avoid using ESP, however]

varA varB after ret esp

Accessing Stack Parameters (C/C++)

• C and C++ functions access stack parameters using constant offsets from EBP 1 .

• Example: [ebp + 8] • EBP is called the

base pointer

frame pointer

because it holds the base address of the stack frame.

• EBP does not change value during the function.

• EBP must be restored to its original value when a function returns.

1 BP in Real-address mode Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

RET Instruction

•

Return from subroutine

• Pops stack into the instruction pointer (EIP or IP). Control transfers to the target address.

• Syntax: •

RET

•

RET n

• Optional operand

causes

bytes to be added to the stack pointer after EIP (or IP) is assigned a value.

8 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Who removes parameters from the stack?

Caller (C)

push val2 push val1 call AddTwo

add esp,8

...... or ......

Called-procedure (STDCALL):

AddTwo PROC push ebp mov ebp,esp mov eax,[ebp+12] add eax,[ebp+8] pop ebp

ret 8

The MODEL directive specifies calling conventions • See line: MODEL flat, STDCALL, in file Irvine.asm.

• The Irvine32 library uses STDCALL calling convention, and hence, your procedures should clean the stack by using

ret n

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.



Stack Parameters (cont.)

The other method is to let the called procedure the responsibility of restoring the stack



The called procedure would now be:

 This is the method used by Pascal compilers 

The caller would simply do push varA push varB call IMUL2 ; do not increm. ESP IMUL2 PROC push ebp mov ebp,esp mov eax,[ebp+12] imul eax,[ebp+8] pop ebp ret 8 ; clean stack IMUL2 ENDP

 10

But the procedure would now use ret n to return

 This performs a RET instruction and by n then increments ESP further  Since 8 bytes of parameters have been pushed onto the stack

Passing a Variable Number of Parameters

  11

To pass a variable number of arguments by the stack just push, as the last parameter , the number of arguments

 By popping this parameter, the procedure knows how much

AddSome PROC push ebp push ecx mov ebp,esp

arguments were passed 

The called procedure: The caller: push 35 push –63 push 23 mov ecx,[ebp+12] ;# of args xor add ebp,16 ;last arg L1: eax,eax ;hold sum add eax,[ebp] add ebp,4 ;point to next loop L1 push 3 ;# of args call AddSome add esp,16 pop ecx pop ebp ret AddSome ENDP

Passing an Array by Reference (1 of 2)

• The

ArrayFill

procedure fills an array with 16-bit random integers • The calling program passes the address of the array, along with a count of the number of array elements:

.data

count = 100 array WORD count DUP(?) .code

push OFFSET array push COUNT call ArrayFill

12 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Passing an Array by Reference (2 of 2)

ArrayFill can reference an array without knowing the array's name:

ArrayFill PROC push ebp mov ebp,esp pushad mov esi,[ebp+12] mov ecx,[ebp+8] .

offset(array) count

return address

EBP [EBP + 12] [EBP + 8] EBP ESI points to the beginning of the array, so it's easy to use a loop to access each array element. View the complete program .

13 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Your turn . . .

• Create a procedure named Difference that subtracts the first argument from the second one. Following is a sample call:

push 14 push 30 call Difference ; first argument ; second argument ; EAX = 16 Difference PROC push ebp mov ebp,esp mov eax,[ebp + 8] sub eax,[ebp + 12] pop ebp ret 8 Difference ENDP ; second argument ; first argument

14 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Passing 8-bit and 16-bit Arguments

• Cannot push 8-bit values on stack • Pushing 16-bit operand may cause page fault or ESP alignment problem • incompatible with Windows API functions • Expand smaller arguments into 32-bit values, using MOVZX or MOVSX:

.data

charVal BYTE 'x' .code

movzx eax,charVal push eax call Uppercase

15 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Passing Multiword Arguments

• Push high-order values on the stack first; work backward in memory • Results in little-endian ordering of data • Example:

.data

longVal QWORD 1234567800ABCDEFh .code

push push call DWORD PTR longVal + 4 DWORD PTR longVal WriteHex64 ; high doubleword ; low doubleword

16 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Saving and Restoring Registers

• Push registers on stack just after assigning ESP to EBP • local registers are modified inside the procedure

MySub PROC push ebp mov ebp,esp push ecx push edx ; save local registers

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Stack Affected by USES Operator

MySub1 PROC USES ecx edx ret MySub1 ENDP

• USES operator generates code to save and restore registers:

MySub1 PROC push ecx push edx ret pop pop edx ecx

18 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

53 68 75 72 79 6F

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Local Variables

• Only statements within subroutine can view or modify local variables • Storage used by local variables is released when subroutine ends • local variable name can have the same name as a local variable in another function without creating a name clash • Essential when writing recursive procedures, as well as procedures executed by multiple execution threads 20 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Creating LOCAL Variables

Example - create two DWORD local variables: Say: int x=10, y=20;

MySub PROC

ret address saved ebp EBP 10 (x) [ebp-4] 20 (y) [ebp-8]

push ebp mov ebp,esp sub esp,8 ;create 2 DWORD variables mov mov DWORD PTR [ebp-4],10 ; initialize x=10 DWORD PTR [ebp-8],20 ; initialize y=20

21 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

LEA Instruction

• LEA returns offsets of direct and indirect operands • OFFSET operator only returns constant offsets • LEA required when obtaining offsets of stack parameters & local variables • Example

CopyString PROC, count:DWORD LOCAL temp[20]:BYTE mov edi,OFFSET count mov esi,OFFSET temp lea edi,count lea esi,temp ; invalid operand ; invalid operand ; ok ; ok

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

LEA Example

Suppose you have a Local variable at [ebp-8] And you need the address of that local variable in ESI You cannot use this:

mov esi, OFFSET [ebp-8] ; error

Use this instead:

lea esi,[ebp-8]

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

ENTER Instruction

• ENTER instruction creates stack frame for a called procedure • pushes EBP on the stack • sets EBP to the base of the stack frame • reserves space for local variables • Example:

MySub PROC enter 8,0

• Equivalent to:

MySub PROC push ebp mov ebp,esp sub esp,8

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

LEAVE Instruction

Terminates the stack frame for a procedure. Equivalent operations MySub PROC enter 8,0 ...

...

leave ret MySub ENDP push ebp mov ebp,esp sub esp,8 ; 2 local DWORDs mov pop esp,ebp ; free local space ebp 25 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

LOCAL Directive

• The LOCAL directive declares a list of local variables • immediately follows the PROC directive • each variable is assigned a type • Syntax:

LOCAL varlist

Example:

MySub PROC LOCAL var1:BYTE, var2:WORD, var3:SDWORD

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Using LOCAL

Examples:

LOCAL flagVals[20]:BYTE LOCAL pArray:PTR WORD myProc PROC, LOCAL t1:BYTE, ; array of bytes ; pointer to an array ; procedure ; local variables

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

LOCAL Example (1 of 2)

BubbleSort PROC LOCAL temp:DWORD, SwapFlag:BYTE . . .

ret BubbleSort ENDP

MASM generates the following code:

BubbleSort PROC push ebp mov ebp,esp add esp,0FFFFFFF8h . . .

mov ret esp,ebp pop ebp BubbleSort ENDP ; add -8 to ESP

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

LOCAL Example (2 of 2) Diagram of the stack frame for the BubbleSort procedure:

ESP

return address

EBP temp SwapFlag EBP [EBP - 4] [EBP - 8] Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Non-Doubleword Local Variables

• Local variables can be different sizes • How created in the stack by LOCAL directive: • 8-bit: assigned to next available byte • 16-bit: assigned to next even (word) boundary • 32-bit: assigned to next doubleword boundary Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Local Byte Variable

Example1 PROC LOCAL var1:BYTE mov al,var1 ; [EBP - 1] ret Example1 ENDP

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

WriteStackFrame Procedure

• Displays contents of current stack frame • Prototype:

WriteStackFrame PROTO, numParam:DWORD, ; number of passed parameters numLocalVal: DWORD, ; number of DWordLocal variables numSavedReg: DWORD ; number of saved registers

32 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

WriteStackFrame Example

main PROC mov eax, 0EAEAEAEAh mov ebx, 0EBEBEBEBh INVOKE aProc, 1111h, 2222h exit main ENDP aProc PROC USES eax ebx, x: DWORD, y: DWORD LOCAL a:DWORD, b:DWORD PARAMS = 2 LOCALS = 2 SAVED_REGS = 2 mov a,0AAAAh mov b,0BBBBh INVOKE WriteStackFrame, PARAMS, LOCALS, SAVED_REGS

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

53 68 75 72 79 6F

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.



Recursion

A recursive procedure is one that calls itself

 Recursive procedures can easily be implemented in ASM when parameter passing is done via the stack 

Ex: a C implementation of factorial: int factorial(int n) { if (n<=1) { return 1; } else { return n*factorial(n-1); } }

 35

An ASM caller needs to push the argument into the stack: push 8 call factorial ;result in EAX = 40320 add esp,4 ;restore the stack

Recursively Calculating Sum 1 + … + n

The CalcSum procedure recursively calculates the sum 1+2+…+n. Receives: ECX = count = n. Returns: EAX = sum

CalcSum PROC cmp ecx,0 jz L2 add eax,ecx dec ecx call CalcSum L2: ret CalcSum ENDP ; check counter value ; quit if zero ; otherwise, add to sum ; decrement counter ; recursive call

View the complete program Stack frame: 36 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Calculating a Factorial (1 of 3)

This function calculates the factorial of integer

. A new value of

is saved in each stack frame:

int function factorial(int n) { if(n == 0) return 1; else return n * factorial(n-1); }

recursive calls 5! = 5 * 4!

4! = 4 * 3!

3! = 3 * 2!

backing up 5 * 24 = 120 4 * 6 = 24 3 * 2 = 6 2! = 2 * 1!

2 * 1 = 2 As each call instance returns, the product it returns is multiplied by the previous value of n.

1! = 1 * 0!

0! = 1 (base case) 1 * 1 = 1 1 = 1 37 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Calculating a Factorial (2 of 3)

Factorial PROC push ebp mov ebp,esp mov cmp ja mov jmp eax,[ebp+8] eax,0 L1 eax,1 L2 ; get n ; n < 0?

; yes: continue ; no: return 1 L1: dec eax push eax call Factorial ; Factorial(n-1) ; Instructions from this point on execute when each ; recursive call returns.

ReturnFact: mov ebx,[ebp+8] mul ebx L2: pop ebp ret 4 Factorial ENDP

See the program listing Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

; get n ; eax = eax * ebx ; return EAX ; clean up stack

Calculating a Factorial (3 of 3)

Suppose we want to calculate 12! This diagram shows the first few stack frames created by recursive calls to Factorial Each recursive call uses 12 bytes of stack space.

ReturnMain

ebp 0 11

ReturnFact

ebp 1 10

ReturnFact

ebp 2 9

ReturnFact

ebp 3 (etc...) n n-1 n-2 n-3 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

  

Exercises

Ex1 : Rewrite the factorial procedure when stack cleaning is done by the caller (ie: in the Java/C/C++way) Ex2 : Write a procedure who’s task is to fill with value 0 the first k bytes of a byte array. All parameters must be passed by the stack and stack cleaning must be done by the caller. Give an example of how this procedure would be called.

Ex3 : Rewrite the AddSome procedure when stack cleaning is done by the called procedure (ie: in the Pascal way)



Challenge : Write the pseudocode for a recursive algorithm that generates the first 20 integers of the Fibonacci series (1, 1, 2, 3, 5, 8, 13, 21, . . .).

Modular Programming



Large projects need to be broken into small modules with clean interfaces between modules

 The way to program a module should only depend on the interfaces provided by other modules – not their implementation 

One possibility would be to place groups of related procedures into different files and then include them with the include directive

41   The include directive instructs the assembler to include the file (at assembly time) at the place of the directive We must then ensure that the code will be placed in the .code segment and the data will be placed in the .data

segment

Modular Programming (cont.)



Hence, in each file , we should always put .code before the code and .dada before the data. Ex:

File my_prog.asm

INCLUDE Irvine32.inc

INCLUDE Macros.inc

.data

msg1 BYTE "In main",0 .code

main PROC mWriteString msg1 call procA call procB exit main ENDP include procA.asm

include procB.asm

END main

File procA.asm

.code

procA PROC .data

mWriteString msg2 ret procA ENDP msg2 BYTE "In procA",0

File procB.asm

.code

procB PROC mWriteString msg3 ret procB ENDP .data

msg3 BYTE "In procB",0



Modular Programming (cont.)

Hence, by doing ML my_prog.asm



The assembler will create a single object file will contain all the included code and data my_prog.obj

which



The scope of each name used (in any included file) will be the object module in which they will be assembled. Here it is my_prog.obj

 Hence an error will be detected by the assembler if two different included files use the same name  Hence this method of included files should be avoided for large projects  43

Instead, we should assemble each file separately to obtain a separate object module for each file and, thus, have a private namespace for each file

 Make sure, however, to have an

Macros.inc

) and an

END INCLUDE Irvine32.inc

directive in each separate file.

(or

INCLUDE

 The file containing the main program must have

END main

as last line

Separately Assembled Modules



However any module that wants to be used need to provide at least one name to be used by others

 

Use the directive PUBLIC to enable other modules to use names defined in the module where PUBLIC is. Ex: PUBLIC procA, varC, labelB

 Note that the usage is the same for any kind of names (procedures, variables, label...)

Use the directive EXTERN to declare names that are defined in other modules

 But now we need to provide the qualifiers:

PROC for procedure names BYTE, WORD, DWORD... for variable names

 Example:

EXTERN procA@0:proc, varA:dword, varB:word

 44

Place the directives extern and public just after

INCLUDE directives

Example

File my_prog.asm

INCLUDE Irvine32.inc

INCLUDE Macros.inc

EXTERN procA@0:proc, procB@0:proc .data

msg1 BYTE "In main",0 .code

main PROC mWriteString msg1 call procA call procB exit main ENDP END main

File procA.asm

INCLUDE Irvine32.inc

INCLUDE Macros.inc

public procA .code

procA PROC .data

END mWriteString msg1 ret procA ENDP msg1 BYTE "In procA",0

File procB.asm

INCLUDE Irvine32.inc

INCLUDE Macros.inc

public procB .code

procB PROC .data

END mWriteString msg1 ret procB ENDP msg1 BYTE "In procB",0



Example (cont.)

To assemble each file separately and link them do: ML –c procA.asm

ML –c ML procB.asm

my_prog.asm

procA.obj

procB.obj

  The –c is the “ compile only ” option: it only produces an object file executable file is produced] [no The last command will produce my_prog.obj and link all the .obj files to produce my_prog.exe



All .data segments will be concatenated into a single .data segment and all .code segments will be concatenated into a single .code

segment

 46

Each .asm file now provides a separate namespace since each file has been assembled separately

 Note that all three files are different memory locations since the assembler and linker will produce a different memory address using the same name msg1 for each variable msg1.

. These refer to



The Program’s Entry Point

An executable program must have only one entry point (the address of the first instruction to execute).



This entry point must be in your main program, and is the very first instruction to be executed

 The file containing the main program must end with the line “

END main

”  A program must have only one single entry point  Any file other than the one containing the main program should terminate with the line

END



Using Global Variables

A variable made public in one object module will be accessible to every other object module that will be linked into the same .exe file

 As long as the other object modules are declaring this variable to be extern 

Such a variable, which is said to be global, can be used by procedures to pass a value across different modules.

 This mechanism increases the complexity of the interfaces (since every module must be aware of all the global variables) 48  Hence the number of global variables should be limited

Global Variable Example

File mp.asm

INCLUDE Irvine32.inc

PUBLIC varA EXTERN procA@0:proc File procA.asm

INCLUDE Irvine32.inc

PUBLIC procA EXTERN varA:dword .data

varA DWORD ?

.code

main PROC mov varA,333 call procA exit main ENDP END main ML mp.asm procA.asm

.code

procA PROC mov eax,varA call WriteDec ret procA ENDP END To assemble and link, you can do:

Multimodule Programs

• A

multimodule program

is a program whose source code has been divided up into separate ASM files.

• Each ASM file (module) is assembled into a separate OBJ file.

• All OBJ files belonging to the same program are linked using the

link

utility into a single EXE file.

• This process is called static linking 50 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Advantages

• Large programs are easier to write, maintain, and debug when divided into separate source code modules.

• When changing a line of code, only its enclosing module needs to be assembled again. Linking assembled modules requires little time.

• A module can be a container for logically related code and data (think object-oriented here...) • encapsulation: procedures and variables are automatically hidden in a module unless you declare them public 51 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Creating a Multimodule Program

• Here are some basic steps to follow when creating a multimodule program: • Create the main module • Create a separate source code module for each procedure or set of related procedures • Create an include file that contains procedure prototypes for external procedures (ones that are called between modules) • Use the INCLUDE directive to make your procedure prototypes available to each module Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Example: ArraySum Program

• Let's review the ArraySum program from Chapter 5. Summation Program (main) Clrscr PromptForIntegers ArraySum DisplaySum WriteString ReadInt WriteString Each of the four white rectangles will become a module.

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Sample Program output

Enter a signed integer: -25 Enter a signed integer: 36 Enter a signed integer: 42 The sum of the integers is: +53

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

INCLUDE File

The sum.inc

file contains prototypes for external functions that are not in the Irvine32 library:

INCLUDE Irvine32.inc

PromptForIntegers PROTO, ptrPrompt:PTR BYTE, ptrArray:PTR DWORD, arraySize:DWORD ArraySum PROTO, ptrArray:PTR DWORD, count:DWORD DisplaySum PROTO, ptrPrompt:PTR BYTE, theSum:DWORD ; prompt string ; points to the array ; size of the array ; points to the array ; size of the array ; prompt string ; sum of the array

55 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Inspect Individual Modules

• • • • Main PromptForIntegers ArraySum DisplaySum Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Macros

• Read Chapter 10, Section 10.2

• Macro procedures are named block of ASM statements • Can be invoked as many times in a program as you wish • When invoking a macro, a copy of its code is inserted directly into the program at the location where it is being invoked • Automatic code insertion • Book’s macro codes are defined in the

Macro.inc

file • Use

INCLUDE Macro.inc

when using macros from the book 57 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Defining Macros

• Defined directly at the beginning of a source program, or, placed in separate file and included using INCLUDE directive • Example: Macros to display character ‘X’ or a char variable

mPrintX Macro mov ENDM al, ’X’ call WriteChar mPutChar Macro cvar push eax mov ENDM al, cvar call WriteChar pop eax

• Defined using MACRO and ENDM directives

MacroName Macro parameter-1, parameter-2, … Statement-list ENDM

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Invoking Macros

• Macros are called (invoked) by simply inserting their names, possibly followed by their arguments • Example: Display the first 20 letters of the alphabet

mov al, ’A’ mov ecx, 20 Iterate: mPutChar al ; macro call inc al loop Iterate mov al, ’A’ mov ecx, 20 Iterate: 1 push eax 1 mov al, cvar 1 call WriteChar 1 pop eax inc al loop Iterate

• • At compile time: the actual source code ( on the left ) is expanded by substituting all occurences of mPutChar al with its actual macro code. The expanded code ( on the right ) is visible in the source listing file.

Macros execute

faster

than PROCs but tend to yield Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

larger

programs 59

53 68 75 72 79 6F

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

INVOKE, ADDR, PROC, and PROTO

• INVOKE Directive • ADDR Operator • PROC Directive • PROTO Directive • Parameter Classifications • Example: Exchaning Two Integers • Debugging Tips 61 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

INVOKE Directive

• The INVOKE directive is a powerful replacement for Intel’s CALL instruction that lets you pass multiple arguments • Syntax:

INVOKE procedureName [, argumentList]

•

ArgumentList

is an optional comma-delimited list of procedure arguments • Arguments can be: • immediate values and integer expressions • variable names • address and ADDR expressions • register names 62 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

INVOKE Examples

.data

byteVal BYTE 10 wordVal WORD 1000h .code

; direct operands: INVOKE Sub1,byteVal,wordVal ; address of variable: INVOKE Sub2,ADDR byteVal ; register name, integer expression: INVOKE Sub3,eax,(10 * 20) ; address expression (indirect operand): INVOKE Sub4,[ebx]

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

ADDR Operator

• Returns a near or far pointer to a variable, depending on which memory model your program uses: • • Small model: returns 16-bit offset Large model: returns 32-bit segment/offset • Flat model: returns 32-bit offset • Simple example:

.data

myWord WORD ?

.code

INVOKE mySub,ADDR myWord

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

PROC Directive (1 of 2)

• The PROC directive declares a procedure with an optional list of named parameters. • Syntax:

label

PROC paramList •

paramList

is a list of parameters separated by commas. Each parameter has the following syntax: paramName : type

type

must either be one of the standard ASM types (BYTE, SBYTE, WORD, etc.), or it can be a pointer to one of these types. 65 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

PROC Directive (2 of 2)

• Alternate format permits parameter list to be on one or more separate lines:

label

PROC

comma required paramList • The parameters can be on the same line . . .

param-1:type-1, param-2:type-2, . . ., param-n:type-n

• Or they can be on separate lines:

param-1:type-1, param-2:type-2, . . ., param-n:type-n

66 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

AddTwo Procedure (1 of 2)

• The AddTwo procedure receives two integers and returns their sum in EAX.

AddTwo PROC, val1:DWORD, val2:DWORD mov eax,val1 add eax,val2 ret AddTwo ENDP

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

PROC Examples (2 of 3)

FillArray receives a pointer to an array of bytes, a single byte fill value that will be copied to each element of the array, and the size of the array.

FillArray PROC, pArray:PTR BYTE, fillVal:BYTE arraySize:DWORD mov ecx,arraySize mov esi,pArray mov al,fillVal L1: mov [esi],al inc esi loop L1 ret FillArray ENDP

68 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

PROC Examples (3 of 3)

Swap PROC, pValX:PTR DWORD, pValY:PTR DWORD . . .

Swap ENDP ReadFile PROC, pBuffer:PTR BYTE LOCAL fileHandle:DWORD . . .

ReadFile ENDP

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

PROTO Directive

• Creates a procedure prototype • Syntax: •

label

PROTO

paramList

• Every procedure called by the INVOKE directive must have a prototype • A complete procedure definition can also serve as its own prototype 70 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

PROTO Directive

• Standard configuration: PROTO appears at top of the program listing, INVOKE appears in the code segment, and the procedure implementation occurs later in the program:

MySub PROTO .code

INVOKE MySub ; procedure prototype ; procedure call MySub PROC .

MySub ENDP ; procedure implementation

71 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

PROTO Example

• Prototype for the ArraySum procedure, showing its parameter list:

ArraySum PROTO, ptrArray:PTR DWORD, szArray:DWORD ; points to the array ; array size

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Parameter Classifications

• An input parameter is data passed by a calling program to a procedure. • The called procedure is not expected to modify the corresponding parameter variable, and even if it does, the modification is confined to the procedure itself.

• An output parameter is created by passing a pointer to a variable when a procedure is called. • The procedure does not use any existing data from the variable, but it fills in a new value before it returns.

• An input-output parameter is a pointer to a variable containing input that will be both used and modified by the procedure. • The variable passed by the calling program is modified.

73 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Trouble-Shooting Tips

• Save and restore registers when they are modified by a procedure.

• Except a register that returns a function result • When using INVOKE, be careful to pass a pointer to the correct data type.

• For example, MASM cannot distinguish between a DWORD argument and a PTR BYTE argument.

• Do not pass an immediate value to a procedure that expects a reference parameter.

• Dereferencing its address will likely cause a general protection fault.

74 Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

53 68 75 72 79 6F

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Java Bytecodes

• Stack-oriented instruction format • operands are on the stack • instructions pop the operands, process, and push result back on stack • Each operation is atomic • Might be be translated into native code by a

just in time

compiler Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Java Virual Machine (JVM)

• Essential part of the Java Platform • Executes compiled bytecodes • machine language of compiled Java programs Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Java Methods

• Each method has its own stack frame • Areas of the stack frame: • local variables • operands • execution environment Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Bytecode Instruction Format

• 1-byte opcode • iload, istore, imul, goto, etc.

• zero or more operands • Disassembling Bytecodes • use javap.exe, in the Java Development Kit (JDK) Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Primitive Data Types

• Signed integers are in twos complement format, stored in big-endian order Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

JVM Instruction Set

• Comparison Instructions pop two operands off the stack, compare them, and push the result of the comparison back on the stack • Examples: fcmp and dcmp Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

JVM Instruction Set

• Conditional Branching • jump to label if st(0) <= 0

ifle label

• Unconditional Branching • call subroutine

jsr label

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Java Disassembly Examples

• Adding Two Integers

int A = 3; int B = 2; int sum = 0; sum = A + B;

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Java Disassembly Examples

• Adding Two Doubles

double A = 3.1; double B = 2; double sum = A + B;

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Java Disassembly Examples

• Conditional Branch

double A = 3.0; boolean result = false; if( A > 2.0 ) result = false; else result = true;

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

Summary

• Stack parameters • more convenient than register parameters • passed by value or reference • ENTER and LEAVE instructions • Local variables • created on the stack below stack pointer • LOCAL directive • Recursive procedure calls itself • Calling conventions (C, stdcall) • MASM procedure-related directives • INVOKE, PROC, PROTO • Java Bytecodes – another approch to programming Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.

53 68 75 72 79 6F

Irvine, Kip R. Assembly Language for x86 Processors 6/e, 2010.