Relocation (computing): Difference between revisions

Content deleted Content added
review: ce for clarity. avoid ambiguous terminology.
rm comment
Line 13:
 
== Segmentation ==
[[Object file]]s are typically segmented into various memory segment or section types. Example segment types include [[code segment|code segment (.text)]], [[data segment|initialized data segment (.data)]], [[.bss|uninitialized data segment (.bss)]], or others as established by the programmer, such as common segments, or named static segments.
 
== Relocation table ==
The relocation table is a list of addresses created by a [[compiler]] or [[Assembler (computer programming)#Assembler|assembler]] and stored in the object or executable file. Each entry in the table references an absolute address in the object code that must be changed when the loader relocates the program so that it will refer to the correct ___location. Entries in the relocation table are known as ''fixups'' and are designed to support relocation of the program as a complete unit. In some cases, each fixup in the table is itself relative to a base address of zero, so the fixups themselves must be changed as the loader moves through the table.<ref name="Levine_1999_CH1_CH3"/>
 
In some architectures a fixup that crosses certain boundaries (such as a segment boundary) or that is not aligned on a word boundary is illegal and flagged as an error by the linker.<ref name="Borland_2007"/><!--[[User:Kvng/RTH]]-->
 
=== DOS and 16-bit Windows ===