lyx_Ch_10.pptVIP

William Stallings Computer Organization and Architecture6th Edition Chapter 10 Instruction Sets: 指令集 characteristics and Functions §10.1 Machine instruction characteristics The complete collection of instructions that are understood by a CPU Machine Code Binary Usually represented by assembly codes 2.Elements(成分) of an Instruction Operation code (Op code) 操作码 Do this Source Operand reference 源操作数的信息 To this Result Operand reference目标操作数的信息 Put the answer here Next Instruction Reference下一条指令的信息 When you have done that, do this... Where have all the Operands gone? Main memory (or virtual memory or cache) CPU register I/O device 3.Instruction Representation In machine code each instruction has a unique bit pattern For human consumption (well, programmers anyway) a symbolic representation is used 用符号表示 e.g. ADD, SUB, LOAD Operands can also be represented in this way ADD A,B (A and B are symbolic address) 4. Simple Instruction Format (1) Instruction Types — opcode Data processing —Arithmetic and logic instructions Data storage (main memory) —Memory instructions Data movement (I/O) —I/O instructions Program flow control —Test and branch instructions (2) Number of Addresses (a) 4 addresses: Operand1, Operand2, Result, Address(next instruction) Be extremely rare, because of PC. 3 addresses Operand 1, Operand 2, Result (A) ? (B) + (C) ;(A,B and C are symbolic address) May be a forth - next instruction (usually implicit) Not common Needs very long words to hold everything —e.g.Length of address=16 bits —Need 16 x 3=48 bits for operand address Number of Addresses (b) 2 addresses One address doubles as operand and result e.g. (A) = (A) + (B) Reduces length of instruction Requires some extra work Temporary storage to hold some results Number of Addresses (c) 1 address Implicit second address Usually a register (accumulator(AC)) E.g. (AC)+(B) —(AC) Common on early machines Number of Addresses (d) 0 (zero) addresses All addresses imp