[1 61 shown in the instruction is the MIX machine code representation of 125]. (D) When the program is loaded into memory to run it may be loaded at some location other than the one assigned by the linker. This example shows SUBR now at location 300. The address in the jump instruction, now at 313, needs to be relocated again so that it points to the updated location of ST, 305. [4 49 is the MIX machine representation of 305]. See also Linker (computing) Library (computing) Object file Prebinding Static library Self-relocation Position-independent code (PIC) Rebasing Garbage collection Pointer swizzling, a lazy form of pointer modification Relocatable Object Module Format References Further reading (3 pages) (NB. Describes a relocatable hex format by Mostek.) (8 pages) (NB. Describes a relocatable hex format by TDL.) . Originally presented at: (609 pages). (This "resize" method, named page boundary relocation, could be applied statically to a CP/M-80 disk image using in order to maximize the TPA for programs to run. It was also utilized dynamically by the CP/M debugger Dynamic Debugging Tool (DDT) to relocate itself into higher memory. The same approach was independently developed by Bruce H. Van Natta of IMS Associates to produce relocatable PL/M code. As paragraph boundary relocation, another variant of this method was later utilized by dynamically HMA self-relocating TSRs like KEYB, SHARE, and NLSFUNC under DR DOS 6.0 and higher. A much more sophisticated and byte-level granular method based on a somewhat similar approach was independently conceived and implemented by Matthias R. Paul and Axel C. Frinke for their dynamic dead-code elimination to dynamically minimize the runtime footprint of resident drivers and TSRs (like FreeKEYB).) (33 pages) (2+xiv+270+6 pages) Computer libraries Assignment operations