Relocatable binary - Revision history

Jnc: how they are relocatable

2022-10-09T20:16:02Z

how they are relocatable

Jnc: Make linking its own article

2021-10-26T00:33:30Z

Make linking its own article

Jnc: typo

2019-09-19T14:15:13Z

typo

Jnc: Clarify

2019-09-19T14:14:02Z

Clarify

Jnc: +cat

2018-12-15T23:59:14Z

+cat

Jnc: av

2017-09-21T19:39:07Z

Jnc: avoid redir

2017-09-09T15:48:23Z

avoid redir

Jnc: A good start

2017-08-08T01:46:52Z

A good start

New page

Larger programs are [[compiler|compiled]] or [[assembler|assembled]] from a series of smaller modules of [[source code]], producing '''relocatable binary''' modules of the low-level binary 'understood' by a given [[CPU]], which are then '''linked''' together to produce an [[executable binary]] object.

This involves two logical stages (although often the the software doing the linking, the '''linker''', merges them together, in actual operation).

In the first, the linker must pick an address at which to place each binary module, and modify the binary of each module to function at that address.

The second stage is one in which references from one module to names in another are 'resolved', and the binary in the module which is making the 'external' reference is modified to properly refer to the location in the module where the reference is to be found.

In addition to the instructions (in binary form), a relocatable binary module contains other information, needed for the linking process. It includes a 'symbol table' (a list of i) all the names on all out-going references to other modules, and ii) the names which this module contains within it); and also 'relocation' information, noting the words in this module which need to be modified during the linking process, and what exactly what type(s) of modifications are needed for each.

← Older revision		Revision as of 20:16, 9 October 2022
Line 1:		Line 1:
−	Larger programs are usually [[compiler\|compiled]] or [[assembler\|assembled]] from a series of smaller modules of [[source code]], producing a like number of '''relocatable binary''' modules containing the low-level [[binary]] [[instruction]]s and data 'understood' by a given [[Central Processing Unit\|CPU]]. These can later be [[linking\|linked]] together to produce an ~~[[object code\|~~executable binary]] object.	+	Larger programs are usually [[compiler\|compiled]] or [[assembler\|assembled]] from a series of smaller modules of [[source code]], producing a like number of '''relocatable binary''' modules, containing the low-level [[object code\|binary]] [[instruction]]s and data 'understood' by a given [[Central Processing Unit\|CPU]]. These modules, which can be easily modified to operate at any [[address]] in [[main memory]], can later be [[linking\|linked]] together to produce an executable binary object.

	In addition to the instructions (in binary form) and data, a relocatable binary module contains other information, needed for the linking process. It includes a 'symbol table'; a list of:		In addition to the instructions (in binary form) and data, a relocatable binary module contains other information, needed for the linking process. It includes a 'symbol table'; a list of:

← Older revision		Revision as of 00:33, 26 October 2021
Line 1:		Line 1:
−	Larger programs are usually [[compiler\|compiled]] or [[assembler\|assembled]] from a series of smaller modules of [[source code]], producing a like number of '''relocatable binary''' modules containing the low-level binary [[instruction]]s and data 'understood' by a given [[Central Processing Unit\|CPU]].	+	Larger programs are usually [[compiler\|compiled]] or [[assembler\|assembled]] from a series of smaller modules of [[source code]], producing a like number of '''relocatable binary''' modules containing the low-level [[binary]] [[instruction]]s and data 'understood' by a given [[Central Processing Unit\|CPU]]. These can later be [[linking\|linked]] together to produce an [[object code\|executable binary]] object.
−
−	These ~~are then '''~~linked~~'''~~ together to produce an [[object code\|executable binary]] object~~. This involves two logical stages (although often the the software doing the linking, the '''linker''', merges them together, in actual operation).~~
−
−	~~In the first, the linker must pick an [[address]] at which to place each binary module, and modify the binary of each module to function at that address.~~
−
−	The second stage is one in which references from one module to names in another ('external references') are 'resolved', and the binary in the module which is making the external reference is modified to properly refer to the location in the module where the reference's target is to be found.

	In addition to the instructions (in binary form) and data, a relocatable binary module contains other information, needed for the linking process. It includes a 'symbol table'; a list of:		In addition to the instructions (in binary form) and data, a relocatable binary module contains other information, needed for the linking process. It includes a 'symbol table'; a list of:

@@ Line 5: / Line 5: @@
 In the first, the linker must pick an [[address]] at which to place each binary module, and modify the binary of each module to function at that address.
-The second stage is one in which references from one module to names in another ('external references') are 'resolved, and the binary in the module which is making the external reference is modified to properly refer to the location in the module where the reference's target is to be found.
+The second stage is one in which references from one module to names in another ('external references') are 'resolved', and the binary in the module which is making the external reference is modified to properly refer to the location in the module where the reference's target is to be found.
 In addition to the instructions (in binary form) and data, a relocatable binary module contains other information, needed for the linking process. It includes a 'symbol table'; a list of:

@@ Line 1: / Line 1: @@
-Larger programs are [[compiler|compiled]] or [[assembler|assembled]] from a series of smaller modules of [[source code]], producing '''relocatable binary''' modules of the low-level binary 'understood' by a given [[Central Processing Unit|CPU]], which are then '''linked''' together to produce an [[object code|executable binary]] object.
+Larger programs are usually [[compiler|compiled]] or [[assembler|assembled]] from a series of smaller modules of [[source code]], producing a like number of '''relocatable binary''' modules containing the low-level binary [[instruction]]s and data 'understood' by a given [[Central Processing Unit|CPU]].
-This involves two logical stages (although often the the software doing the linking, the '''linker''', merges them together, in actual operation).
+These are then '''linked''' together to produce an [[object code|executable binary]] object. This involves two logical stages (although often the the software doing the linking, the '''linker''', merges them together, in actual operation).
-In the first, the linker must pick an address at which to place each binary module, and modify the binary of each module to function at that address.
+In the first, the linker must pick an [[address]] at which to place each binary module, and modify the binary of each module to function at that address.
-The second stage is one in which references from one module to names in another are 'resolved', and the binary in the module which is making the 'external' reference is modified to properly refer to the location in the module where the reference is to be found.
+The second stage is one in which references from one module to names in another ('external references') are 'resolved, and the binary in the module which is making the external reference is modified to properly refer to the location in the module where the reference's target is to be found.
-In addition to the instructions (in binary form), a relocatable binary module contains other information, needed for the linking process. It includes a 'symbol table' (a list of i) all the names on all out-going references to other modules, and ii) the names which this module contains within it); and also 'relocation' information, noting the words in this module which need to be modified during the linking process, and what exactly what type(s) of modifications are needed for each.
+In addition to the instructions (in binary form) and data, a relocatable binary module contains other information, needed for the linking process. It includes a 'symbol table'; a list of:
 [[Category: Software Basics]]

← Older revision		Revision as of 23:59, 15 December 2018
Line 8:		Line 8:

	In addition to the instructions (in binary form), a relocatable binary module contains other information, needed for the linking process. It includes a 'symbol table' (a list of i) all the names on all out-going references to other modules, and ii) the names which this module contains within it); and also 'relocation' information, noting the words in this module which need to be modified during the linking process, and what exactly what type(s) of modifications are needed for each.		In addition to the instructions (in binary form), a relocatable binary module contains other information, needed for the linking process. It includes a 'symbol table' (a list of i) all the names on all out-going references to other modules, and ii) the names which this module contains within it); and also 'relocation' information, noting the words in this module which need to be modified during the linking process, and what exactly what type(s) of modifications are needed for each.
		+
		+	[[Category: Software Basics]]

← Older revision		Revision as of 19:39, 21 September 2017
Line 1:		Line 1:
−	Larger programs are [[compiler\|compiled]] or [[assembler\|assembled]] from a series of smaller modules of [[source code]], producing '''relocatable binary''' modules of the low-level binary 'understood' by a given [[CPU]], which are then '''linked''' together to produce an [[object code\|executable binary]] object.	+	Larger programs are [[compiler\|compiled]] or [[assembler\|assembled]] from a series of smaller modules of [[source code]], producing '''relocatable binary''' modules of the low-level binary 'understood' by a given [[Central Processing Unit\|CPU]], which are then '''linked''' together to produce an [[object code\|executable binary]] object.

	This involves two logical stages (although often the the software doing the linking, the '''linker''', merges them together, in actual operation).		This involves two logical stages (although often the the software doing the linking, the '''linker''', merges them together, in actual operation).

← Older revision		Revision as of 15:48, 9 September 2017
Line 1:		Line 1:
−	Larger programs are [[compiler\|compiled]] or [[assembler\|assembled]] from a series of smaller modules of [[source code]], producing '''relocatable binary''' modules of the low-level binary 'understood' by a given [[CPU]], which are then '''linked''' together to produce an [[executable binary]] object.	+	Larger programs are [[compiler\|compiled]] or [[assembler\|assembled]] from a series of smaller modules of [[source code]], producing '''relocatable binary''' modules of the low-level binary 'understood' by a given [[CPU]], which are then '''linked''' together to produce an [[object code\|executable binary]] object.

	This involves two logical stages (although often the the software doing the linking, the '''linker''', merges them together, in actual operation).		This involves two logical stages (although often the the software doing the linking, the '''linker''', merges them together, in actual operation).