22.5.2.3. Indirect Addressing Mode

In indirect mode, the instruction refers not to the data itself, but to a memory location that contains the address of the data. This means it requires an additional step to access the actual data, making it a two-step process.

Indirect addressing mode adds a level of indirection when accessing data. Instead of directly containing the data within the instruction, it contains a pointer (or address) to another memory location where the actual data resides. For instance, if we have an instruction that points to memory location A, and memory location A has the address of another memory location B holding the actual data, the processor must first access memory A to get the address of memory B, and then access memory B to get the data. This is particularly useful when you want to handle large amounts of data efficiently by using smaller pointers.

Think of it like getting a book recommendation from a friend (indirect pointer) instead of directly receiving the book (data). Instead of handing you the book itself, your friend gives you a note with the library's address where the book is located. You must first go to that library (mirroring the first memory access) to find the book (actual data). This method allows for greater flexibility, especially when dealing with large collections of data.

The instruction register holds the address of a location that contains the address of the operand. The first step is to fetch that address using the memory address register, followed by fetching the actual data from the new memory location.

In practical terms, when an instruction being executed uses the indirect addressing mode, the first action is to load the instruction from the instruction register into the memory address register (MAR). Next, the system will access the memory to retrieve the address stored at that location. Once this address is obtained, the system will then use it to access the actual data from a different memory location. This involves two memory accesses instead of one, hence the term 'indirect'.

Imagine you are looking to make dinner using a recipe. Instead of having the recipe in your kitchen (the data), you are told to find it in a friend's kitchen (first memory access). You first go to your friend's house (retrieve the address), and then you have to find the recipe in their kitchen (retrieve the actual data). This is how indirect addressing works—it's a two-step retrieval process that can be helpful for organizing and accessing large recipes or datasets.

One major advantage of indirect addressing mode is the ability to access a larger range of memory locations, making it suitable for large datasets and complex data structures.

Indirect addressing allows programs to work with data that resides in broader memory spaces, especially useful for complex operations needing large amounts of data. Since the instruction points to a memory location with another address, it effectively expands the range of addresses that can be readily accessed without having to modify the actual instruction. This helps in applications like arrays and linked lists, where data is not stored consecutively.

Consider a library system where instead of having all books in one location, some books are described by pointers to different shelves. If you can only access a few specific shelves directly (like direct addressing), you're limited. But if you can point to another shelf (indirect addressing) that leads to even more shelves with books, you can access vast knowledge without overhauling the entire library system.

--