CSE 141 Lecture Notes - Lecture 3: Program Counter, Complex Instruction Set Computing, Processor Register
12 Oct 2017
School
Department
Course
Professor
Document Summary
| branch targets tend to be close to the branch instruction. E. register indirect anywhere (we can, but don"t need to at all) loop: Negative immedate pc beq _ _ loop loop: Se: sign-extend (turn 16 bit into 32 bit-version) Means that the index points to a byte of memory. (rarely we"ll ever have programs larger than 256mb) Byte-addressable . if you have a pointer to address 0000 0000 0000. Viewed as a large, single-dimension array, with an address. D) pointers are a high level construct - they don"t make sense pointing to raw memory addresses. D) pointers are a high level construct - they don"t make sense pointing to raw memory addresses (wtf lul that"s the whole point of pointers) Aligned: mem, mem, reg, reg, none of the above. Faster access | fewer bits to specify | more locations. Both would be for cisc (complex instruction set) ( reg-mem) Instructions could be just 1 byte, or many bytes.
