Assembly Language. Prof. Dr. Antônio Augusto Fröhlich. Sep 2006

Transcription

1 Sep 2006 Prof. Antônio Augusto Fröhlich ( 33 Assembly Language Prof. Dr. Antônio Augusto Fröhlich Sep 2006

2 Sep 2006 Prof. Antônio Augusto Fröhlich ( 34 Assembly Language Assembly language, commonly called assembly, asm or symbolic machine code, is a humanreadable notation for the machine language that a specific computer architecture uses. Machine language, a pattern of bits encoding machine operations, is made readable by replacing the raw values with symbols called mnemonics. (Wikipedia)

3 Sep 2006 Prof. Antônio Augusto Fröhlich ( 35 Assembler An assembler creates object code by translating assembly instruction mnemonics into opcodes, and by resolving symbolic names for memory locations and other entities. (David Salomon)

4 Sep 2006 Prof. Antônio Augusto Fröhlich ( 36 Memory Access Program instructions and data are stored in memory Must be brought into the CPU during execution Program instructions are automatically fetched by the CPU Control flow instructions guide the execution flow Data operands for ALU instructions are fetched by explicit instructions in the program Data access instructions

5 Sep 2006 Prof. Antônio Augusto Fröhlich ( 37 CPU Registers General Purpose Registers (GPR) Scratch storage Data Addresses Constants (0/1/ 1) Indexes for data structures Base/segment to segment memory Floating Point Registers (FPR) Floating point data

6 Sep 2006 Prof. Antônio Augusto Fröhlich ( 38 CPU Registers Control registers Program Counter (PC) / Instruction Pointer (IP) Points to the next instruction to be executed Flags ALU flags: carry, overflow, zero, etc Machine control flags: MMU, I/O, etc Stack pointer Top of the stack Frame pointer Return value/pointer

7 Sep 2006 Prof. Antônio Augusto Fröhlich ( 39 Data Addressing Modes Legend 16 bit architecture big endian byte addressed memory involved altered Memory Registers r1 10 r2 2 r3

8 Sep 2006 Prof. Antônio Augusto Fröhlich ( 40 Data Addressing Modes Register Operand stored in a CPU register ALU operations Most used variables Automated by compilers add r1, r2 (r1 < r1 + r2) Memory Registers 10 r r r3

9 Sep 2006 Prof. Antônio Augusto Fröhlich ( 41 Data Addressing Modes Register Operand stored in a CPU register ALU operations Most used variables Automated by compilers add r1, r2 (r1 < r1 + r2) Memory Registers 10 r r r3

10 Sep 2006 Prof. Antônio Augusto Fröhlich ( 42 Data Addressing Modes Immediate Operand encoded along with operation Constants add r1, #10 (r1 < r1 + 10) Memory Registers 10 r r r3

11 Sep 2006 Prof. Antônio Augusto Fröhlich ( 43 Data Addressing Modes Immediate Operand encoded along with operation Constants add r1, #10 (r1 < r1 + 10) Memory Registers 10 r r r3

12 Sep 2006 Prof. Antônio Augusto Fröhlich ( 44 Data Addressing Modes Absolute Operand stored in memory at address Static data (static variables, class attributes) add r1, (r1 < r1 + M[]) Memory Registers 10 r r r3

13 Sep 2006 Prof. Antônio Augusto Fröhlich ( 45 Data Addressing Modes Absolute Operand stored in memory at address Static data (static variables, class attributes) add r1, (r1 < r1 + M[]) Memory Registers 10 r r r3

14 Sep 2006 Prof. Antônio Augusto Fröhlich ( 46 Data Addressing Modes Register Indirect Operand stored in a memory location pointed by a register Pointer deferring add r1, (r3) (r1 < r1 + M[r3]) Memory Registers 10 r r r3

15 Sep 2006 Prof. Antônio Augusto Fröhlich ( 47 Data Addressing Modes Register Indirect Operand stored in a memory location pointed by a register Pointer deferring add r1, (r3) (r1 < r1 + M[r3]) Memory Registers 10 r r r3

16 Sep 2006 Prof. Antônio Augusto Fröhlich ( 48 Data Addressing Modes Register Indirect with Displacement Operand stored in a memory location pointed by a register plus an offset Local variables (reg = frame pointer) add r1, 4(r3) (r1 < r1 + M[r3 + 4]) Memory Registers 10 r r r3

17 Sep 2006 Prof. Antônio Augusto Fröhlich ( 49 Data Addressing Modes Register Indirect with Displacement Operand stored in a memory location pointed by a register plus an offset Local variables (reg = frame pointer) add r1, 4(r3) (r1 < r1 + M[r3 + 4]) Memory Registers 10 r r r3

18 Sep 2006 Prof. Antônio Augusto Fröhlich ( 50 Data Addressing Modes Register Indirect Indexed Operand stored in a memory location pointed by an indexed register Array (reg1 = array, reg2 = index) add r1, (r3, r2) (r1 < r1 + M[r3 + r2]) Memory Registers 10 r r r3

19 Sep 2006 Prof. Antônio Augusto Fröhlich ( 51 Data Addressing Modes Register Indirect Indexed Operand stored in a memory location pointed by an indexed register Array (reg1 = array, reg2 = index) add r1, (r3, r2) (r1 < r1 + M[r3 + r2]) Memory Registers 10 r r r3

20 Sep 2006 Prof. Antônio Augusto Fröhlich ( 52 Data Addressing Modes Register Indirect with Post [Inc Dec]rement Operand stored in a memory location pointed by a register that is post [inc dec]remented Iteration (reg = array, inc = size of element ) add r1, (r3)+ (r1 < r1 + M[r3]; r3 < r3 + s) Memory Registers 10 r r r3

21 Sep 2006 Prof. Antônio Augusto Fröhlich ( 53 Data Addressing Modes Register Indirect with Post [Inc Dec]rement Operand stored in a memory location pointed by a register that is post [inc dec]remented Iteration (reg = array, inc = size of element ) add r1, (r3)+ (r1 < r1 + M[r3]; r3 < r3 + s) Memory Registers 10 r r r3 102

22 Sep 2006 Prof. Antônio Augusto Fröhlich ( 54 Data Addressing Modes Register Indirect with Pre [Inc Dec]rement Operand stored in a memory location pointed by a register that is pre [inc dec]remented Iteration Stack (reg = stack ptr) add r1, (r3) (r3 < r3 s; r1 < r1 + M[r3]) Memory Registers 10 r r r3 102

23 Sep 2006 Prof. Antônio Augusto Fröhlich ( 55 Data Addressing Modes Register Indirect with Pre [Inc Dec]rement Operand stored in a memory location pointed by a register that is pre [inc dec]remented Iteration Stack (reg = stack ptr) add r1, (r3) (r3 < r3 s; r1 < r1 + M[r3]) Memory Registers 10 r r r3

24 Sep 2006 Prof. Antônio Augusto Fröhlich ( 56 Data Addressing Modes Register Indirect Indexed and Scaled Operand stored in a memory location pointed by an indexed and scaled register Array (reg1 = array, reg2 = index, scale = size of element) add r1, (r3, r2, 2) (r1 < r1 + M[r3 + r2 * 2) Memory Registers 10 r r r3

25 Sep 2006 Prof. Antônio Augusto Fröhlich ( 57 Data Addressing Modes Register Indirect Indexed and Scaled Operand stored in a memory location pointed by an indexed and scaled register Array (reg1 = array, reg2 = index, scale = size of element) add r1, (r3, r2, 2) (r1 < r1 + M[r3 + r2 * 2) Memory Registers 10 r r r3

26 Sep 2006 Prof. Antônio Augusto Fröhlich ( 58 Data Addressing Modes Register Indirect with Displacement, Indexed and Scaled Array (dis = offeset, reg1 = array, reg2 = index, scale = size of element) add r1, 2(r3, r2, 2) (r1 < r1 + M[r r2 * 2]) Memory Registers 10 r r r3

27 Sep 2006 Prof. Antônio Augusto Fröhlich ( 59 Data Addressing Modes Register Indirect with Displacement, Indexed and Scaled Array (dis = offeset, reg1 = array, reg2 = index, scale = size of element) add r1, 2(r3, r2, 2) (r1 < r1 + M[r r2 * 2]) Memory Registers 10 r r r3

28 Sep 2006 Prof. Antônio Augusto Fröhlich ( 60 Data Addressing Modes Memory Indirect Operand stored in a memory location pointed by another memory localion Pointer to pointer deferring Call tables add (r1 < r1 + M[M[r3]]) Memory Registers 106 r r r3

29 Sep 2006 Prof. Antônio Augusto Fröhlich ( 61 Data Addressing Modes Memory Indirect Operand stored in a memory location pointed by another memory localion Pointer to pointer deferring Call tables add (r1 < r1 + M[M[r3]]) Memory Registers 106 r r r3

30 Sep 2006 Prof. Antônio Augusto Fröhlich ( 62 Data Addressing Modes Mode Example Meaning Register add r1, r2 r1 < r1 + r2 Immediate add r1, #10 r1 < r Absolute add r1, r1 < r1 + M[] Reg. Ind. Disp. add r1, (r3) r1 < r1 + M[r3] Reg. Ind. Disp. add r1, 4(r3) r1 < r1 + M[r3 + 4] Reg. Ind. Ind. add r1, (r3, r2) r1 < r1 + M[r3 + r2] Reg. Ind. Post add r1, (r3)+ r1 < r1 +M[r3]; r3 < r3 + s Reg. Ind. Pre add r1, (r3) r3 < r3 s; r1 < r1 +M[r3] Reg. Ind. Scal. add r1, (r3, r2, 2) r1 < r1 + M[r3 + r2 * 2] Reg. Ind. Disp. Scal. add r1, 2(r3, r2, 2) r1 < r1 + M[r r2 * 2] Memory Ind. add r1 < r1 + M[M[r3]]

31 Arithmetic and Logical Operations Hugo Marcondes Sep 2006 Sep 2006 Hugo Marcondes ( 1

32 Introduction Logical Operations Boolean Algebra AND, OR, NOR, XOR Shift Operations Shifts Right/Left Rotates Right/Left Arithmetic Operations Sum and Subtraction Multiplication and Division Sep 2006 Hugo Marcondes ( 2

33 Logical Operations Essential for low level programming Device Drivers Data Transmission (Serial/Parallel) Data Codification Cryptography Algorithms Bits are manipulated with bit masks Sep 2006 Hugo Marcondes ( 3

34 Logical Operations AND Function and rd, rs, rt Verify if a bit is set Unset a bit RD RS RT Alternate form andi rd, rs, imm Sep 2006 Hugo Marcondes ( 4

35 Logical Operations OR Function or rd, rs, rt Set a bit Load constants RD RS RT Alternate form ori rd, rs, imm Sep 2006 Hugo Marcondes ( 5

36 Logical Operations Negate OR Function nor rd, rs, rt Detect both zero bits Invert bits (all) RD RS RT Sep 2006 Hugo Marcondes ( 6

37 Logical Operations Exclusive OR Function xor rd, rs, rt Detect positions with different bits Invert bits (mask) RD RS RT Sep 2006 Hugo Marcondes ( 7

38 Logical Operations Left Shift Operations sll rd, rt, shamt Bit level Operations Multiplication and division Serialization / Parallelization [Kjell, 2004] Variable shift sllv rd, rt, rs Sep 2006 Hugo Marcondes ( 8

39 Logical Operations Right Shift Operations srl rd, rt, shamt Bit level Operations Multiplication and division Serialization / Parallelization Variable shift srlv rd, rt, rs Arithmetic shift sra rd, rt, shamt / srav rd, rt, rs [Kjell, 2004] Sep 2006 Hugo Marcondes ( 9

40 Logical Operations Right/Left Rotation Bits aren't discarded Right Rotation High bit moves to low Left Rotation Low bit moves high [Kjell, 2004] Sep 2006 Hugo Marcondes ( 10

41 Arithmetic Operations Sum With or without overflow signaling Can have a immediate operand Subtraction Sum of a negative number Overflow signalization Operation A B RES A + B >= 0 >= 0 < 0 A + B < 0 < 0 >= 0 A B >= 0 < 0 < 0 A B < 0 >= 0 >= 0 Sep 2006 Hugo Marcondes ( 11

42 Arithmetic Operations Comparison Instructions Arithmetical comparison between number Less than, Greater Than, Equal, Not Equal The result of comparison can be in a general purpose register, or specific ones Intel: Flags register MIPS Set on Less Than slt rd, rs, rt / sltu rd, rs, rt slti rd, rs, imm / sltiu rd, rs, imm Pseudo instructions for other modes Sep 2006 Hugo Marcondes ( 12

43 Arithmetic Operation Multiplication Product of two N bits number is 2N bits 10 x x Sep 2006 Hugo Marcondes ( 13

44 Arithmetic Operation Result are stored on a double word register MIPS has HI and LO register Accessed mflo rd and mfhi rd instructions mult rs, rt and multu rs, rt HI 32 LO 32 < rs * rt Unsigned Multiplication Overflow don't occur Signed Multiplication Equal signs: positive result Can produce overflow MIPS need overflow detection on software Sep 2006 Hugo Marcondes ( 14

45 Arithmetic Operation Division div rs, rt and divu rs, rt LO < Quotient (rs/rt), HI < Remainder Mathematical Properties Don't generate overflow Raises a Zero Division exception Result is always unsigned Sep 2006 Hugo Marcondes ( 15

46 System Programming Flow Control Hugo Marcondes Sep 2006 Sep 2006 Hugo Marcondes ( 1

47 Introduction The power of computers is their ability to repeat actions and their ability to alter their operation depending on data Bradley Kjell Instruction Addressing Modes Branchs Conditional Unconditional Long Branch Jump Call Sep 2006 Hugo Marcondes ( 2

48 Instruction Addressing Modes Branch to an absolute address Concatenates imm with high bits of PC to complete address Calling near functions Absolute jump imm [n] PC < PC [w,n] : imm [n] w > word High Bit n > imm High Bit Memory Registers 0x PC 0x x x IMM 0x rs 9 0x Sep 2006 Hugo Marcondes ( 3

49 Instruction Addressing Modes Branch to an absolute address Concatenates imm with high bits of PC to complete address Calling near functions Absolute jump imm [n] PC < PC [w,n] : imm [n] w > word High Bit n > imm High Bit Memory Registers 0x PC 0x x x IMM 0x rs 9 0x Sep 2006 Hugo Marcondes ( 4

50 Instruction Addressing Modes Branch to a relative address Sum imm with the PC Usually imm is signed Code can be easily relocated Local Branch Relative Address branch imm PC < PC + imm Memory Registers 0x PC 0x x x x IMM 0x rs 9 Sep 2006 Hugo Marcondes ( 5

51 Instruction Addressing Modes Branch to a relative address Sum imm with the PC Usually imm is signed Code can be easily relocated Local Branch Relative Address branch imm PC < PC + imm Memory Registers 0x PC 0x x x x IMM 0x rs 9 Sep 2006 Hugo Marcondes ( 6

52 Instruction Addressing Modes Branch to an absolute address Contents of rs are transferred to PC Long Branch Register Indirect jump rs PC < rs Memory Registers 0x PC 0x x xC000000C IMM 0x rs 0xC xC Sep 2006 Hugo Marcondes ( 7

53 Instruction Addressing Modes Branch to an absolute address Contents of rs are transferred to PC Long Branch Register Indirect jump rs PC < rs Memory Registers 0x PC 0xC x xC000000C IMM 0x rs 0xC xC Sep 2006 Hugo Marcondes ( 8

54 Branch Instructions Instructions used with address modes to change the execution flow of a program Conditional Branchs usually associated with Relative Addressing Mode Have a condition associated with the branch Comparison instructions/registers to express the condition Unconditional Branch Usually have all addressing mode forms Always change the execution flow Used in local context or for function call Sep 2006 Hugo Marcondes ( 9

55 Conditional Branch Condition expressed in the instruction beq rs, rt, LABEL (Branch Equal) PC < PC + LABEL, if rs == rt bne rs, rt, LABEL (Branch Not Equal) PC < PC + LABEL, if rs!= rt Condition resolved before the branch instruction slt rd, rs, rt (Set On Less Than) rd < 1, if rs < rt rd < 0, otherwise Used in conjunction with beq / bne Sep 2006 Hugo Marcondes ( 10

56 Unconditional Branch Are not associated with a condition b LABEL (Branch to LABEL Relative Address) PC < PC + LABEL j ADDR (Jump to ADDR Absolute Address) PC < PC : ADDR jr rs (Jump Register Register Indirect) PC < rs Sep 2006 Hugo Marcondes ( 11

57 Calls Branch the execution flow, but saves the return address The return address could be saved in stack or in a specific purpose register jal LABEL (Jump and Link Relative Address) RA < PC + 4 ; PC < PC : LABEL jalr rs (Jump and Link Register Register Indirect) RA < PC + 4 ; PC < RS Sep 2006 Hugo Marcondes ( 12

58 Programming Structures Exercise Write the assembler code that maps the following programming structure if ( a == 0 ) { // Block 1 } else { // Block 2 } while (a > 0) { //Block 3 a = a - 1; } Sep 2006 Hugo Marcondes ( 13