SRCInstructionFormats

# SRCInstructionFormats - 2-27 Chapter 2—Machines Machine...

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2-27 Chapter 2—Machines, Machine Languages, and Digital Logic Instruction formats Example 0 Fig 2.9 (Partial) Total of 7 Detailed Formats 31 27 26 22 21 17 16 1. Id, st, la, Op ra rb addi, andi, ori c2 Id r3, A Id r3, 4(r5) addi r2, r4, #1 Idr r5, 8 Iar r6, 45 (R[3] = M[A]) (R[3] = M[R[5] + 4]) (R[2] = R[4] +1) (R[5] = M[PC + 8]) (R[6] = PC + 45) 31 2726 22 21 0 2. Idr, str, lar Op ra c1 31 27 26 22 21 17 16 0 3. neg, not Op ra rc unused unused neg r7, r9 (R[7] = – R[9]) 31 27 26 22 21 17 16 12 11 2 0 4. br Op rb rc unused (c3) unused Cond brzr r4, r0 (branch to R[4] if R[0] == 0) 31 27 26 22 21 17 16 12 11 2 0 5. brl Op ra rb rc (c3) unused Cond 0 brlnz r6, r4, r0 (R[6] = PC; branch to R[4] if R[0] ≠ 0) 6. add, sub, and, or 31 27 26 22 21 17 16 12 11 Op ra rb rc unused add r0, r2, r4 (R[0] = R[2] + R[4]) 31 27 26 22 21 17 7a 42 0 Op ra rb (c3) (c3) unused Count 4 0 7. shr, shra shl, shic 7b shr r0, r1, #4 (R[0] = R[1] shifted right by 4 bits shl r2, r4, r6 (R[2] = R[4] shifted left by count in R[6]) 31 27 26 22 21 17 16 12 Op ra rb rc (c3) unused (c3) 00000 31 27 26 0 8. nop, stop Op unused stop © 1997 V. Heuring and H. Jordan Computer Systems Design and Architecture by V. Heuring and H. Jordan ...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online