JPH1195987A - Link command editor and computer-readable recording medium recording link command editor program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To save the labor for work by efficiently editing a link command. SOLUTION: This link command editor has an optimizing part 301 for inputting the link result of a prelink means 200, optimizing the memory arrangement and outputting the optimized link command, a memory map display part 302 for displaying the memory arrangement based on the link command while inputting this link command, an exchanging part 303 for exchanging the link command according to the exchange request of a memory map, displaying it on the memory map display part and outputting the link command generated by exchange, and a link command output part 304 for outputting the link command outputted from the optimizing part 301 or exchanging part 303.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a link command editor and a computer-readable recording medium storing a link command editor program, and more particularly, to a method for efficiently editing link commands in microcomputer system program development. Technology for labor saving.

[0002]

2. Description of the Related Art In a microcomputer system, there are specific restrictions, such as a limited memory space, an I / O map, and an interrupt vector layout, which are faced in the development of the microcomputer system, and it is necessary to appropriately arrange a memory of software.

[0003] Such arrangement information is described in what is called a link command to generate a final object. When incorporating the created program into a target microcomputer system, the linker uses a parameter called a link command based on a parameter called a link command. To determine the actual memory location. FIG. 5 is a diagram illustrating a notation example of a link command. The memory (memory) contains the start address (origi
n) and its length are defined. The section (section) defines the start address (org) of each section.

Conventionally, the creation of a link command has been performed as follows. First, a program developer or the like determines a rough memory arrangement of a target microcomputer system. Subsequently, based on the determined memory layout, the program developer creates a link command in a configuration suitable for the target, and corrects the created link command using a text editor as appropriate.

[0005]

However, since the link command describes various types of arrangement information as character strings, it is difficult to understand the link command because it is in a state of symbols, and it is difficult for program developers to modify the link command. There was a problem.

In addition, since the memory map differs depending on the microcomputer system, and when creating a program, the proper mapping is described as text character information, which makes it difficult to imagine the address mapping. There are problems such as difficulty in proper placement.

Further, as the program grows,
Since the memory mapping situation becomes difficult to understand and it becomes very difficult to optimize the link command,
In order to effectively use system resources with few target microcomputer systems, it becomes extremely difficult to use.

The present invention has been made in view of the above circumstances, and has as its object to provide a link command editor and a link command editor for efficiently editing a link command to save labor. An object of the present invention is to provide a computer-readable recording medium on which a program is recorded.

[0009]

To achieve the above object, according to the present invention, there is provided a link command editor for editing a link command for defining a memory arrangement.
A memory map display unit for inputting the link command and displaying a memory arrangement based on the link command, and performing a rearrangement of the link command in response to a memory map rearrangement request and outputting to the memory map display unit, and generating by the rearrangement And a link command output unit that outputs the link command output by the reordering unit.

In the configuration of the present invention, the memory arrangement is displayed based on the input link command.
Therefore, the arrangement information of each section can be understood as an image, and the arrangement can be performed without having to calculate the map arrangement each time, so that labor can be saved.

According to a second aspect of the present invention, there is provided a link command editor for editing a link command defining a memory arrangement, inputting a link result, optimizing a memory arrangement, and outputting an optimized link command. Department and
A link command is input, a memory map display unit that displays a memory arrangement based on the link command, and a link command is rearranged in response to a memory map rearrangement request, and output to the memory map display unit, which is generated by the rearrangement. A rearrangement unit that outputs a link command, and the optimization unit, or a link command output unit that outputs a link command output by the rearrangement unit,
It is characterized by having.

In the configuration of the present invention, an optimizing unit is added to the first aspect of the present invention. By providing the optimizing unit, it is possible to reduce the trouble of checking and correcting the program developer, and thus it is possible to save labor.

According to a third aspect of the present invention, the optimizing unit according to the second aspect includes a means for inputting a memory map to be processed, a means for searching for a free area from a lower address of the input memory map, Means for determining whether or not there is a section that can be moved to the vacant area, and means for moving the section to the vacant area if there is a section determined to be movable by this determination;
Means for packing and arranging other sections in an empty area by this movement.

According to the configuration of the present invention, the free area can be expanded because, for example, the use of the absolute section or the like causes the processing to be arranged so as to be packed even when a useless empty area exists.

According to a fourth aspect of the present invention, there is provided a computer readable recording medium having recorded thereon a link command editor program for editing a link command defining a memory arrangement, A memory map display step of displaying a memory arrangement based on the link command; a reordering step of reordering link commands in response to a remapping request of the memory map and outputting a link command generated by the reordering; and outputting the output link command. And outputting a link command.

[0016]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Embodiments of a link command editor and a computer-readable recording medium on which a link command editor program according to the present invention is recorded will be described in detail with reference to the drawings.

The hardware configuration of the link editor according to the present invention includes a CPU for processing various means described later, an input device such as a keyboard, a mouse, a light pen, or a flexible disk device, and a memory device. A normal computer system including an external storage device such as a disk drive or a disk device and an output device such as a display device or a printer device is used. The CPU includes an arithmetic unit that performs processing of various units and the like described below, and a main storage unit that stores instructions for the processing.

FIG. 1 is a block diagram showing a language processing apparatus according to this embodiment. This language processing device compiles a source program created by a program developer, and generates an object file by an object generating means 100 and prelinks the generated object file based on a link command created by the program developer. And a link editor processing means 300 for editing a link command based on the result of prelinking by the prelinking means 200.
And a generating means 400 for generating a link target program based on the edited link command.

Next, the processing means 300 of the link editor will be described in detail. The processing means 300 of the link editor inputs a result of pre-linking by the pre-linking means 200, optimizes a memory arrangement, inputs an optimized link command, and inputs a link command, A memory map display unit 302 for displaying a memory arrangement based on the link command, a link command rearrangement in response to a memory map rearrangement request, output to the memory map display unit 302, and a link command generated by the rearrangement are output. The rearrangement unit 303 and the optimization unit 301 or the rearrangement unit 30
And a link command output unit 304 for outputting the link command output by the control unit 2.

FIG. 2 is a flowchart showing the flow of the processing of the optimizing unit 301. When linking objects with the linker, links are linked in the link order specified for each section. The section includes a relocatable section (relocatable section) and a section that cannot be rearranged (absolute section). An absolute section is a section in which addresses cannot be moved, and must be located at a certain fixed address. Since an absolute section exists in the memory map to be processed, an empty area is often generated. This optimization unit 30
In No. 1, the contiguous free area is made as large as possible by arranging the sections in a packed manner.

First, a memory map to be processed is input (step S101). This memory map can be obtained from the result of pre-linking by the pre-linking means 200. Subsequently, a free area is searched from the lower address of the memory map to be processed (step S10).
2). Subsequently, it is determined whether or not there is a movable section that can be moved to the searched free area (step S).
103). In this determination, the size of the searched free area is compared with the size of each section, and if the size of the free area is large, it can be determined that movement is possible. The absolute section cannot be moved, and is therefore excluded from the determination target. If there is no movable section that can be moved to the searched free area, the process proceeds to step S106.

If there is a section determined to be movable by the determination in step S103, the section is moved to the empty area (step S104). Subsequently, for the area vacated by this movement, other movable sections are packed and arranged (step S10).
5).

Subsequently, it is determined whether or not there is another free area (step S106). If it is determined that there is still a free area, the process proceeds to step S102, and a free area is searched again from the lower dress. If there is no free area, the memory map after the optimization is output (step S
107). The output of the memory map may be output in the form of a link command.

FIG. 3 is a diagram for explaining a specific example of the processing of the optimizing unit 310. The left side of the drawing is an example of the section map before optimization. The right side of the drawing is an example of the section map after optimization.
Before optimization, since the absolute section 3 is a fixed address, an empty area exists at the lower address in the upper part of the drawing. It can be seen that the processing of the optimizing unit 310 places the section 5 in the free area and the section 6 in the free area. This indicates that the free area is expanding.

As described above, the optimizing unit 301 can determine the size of the object of each section based on the section which must be allocated to a fixed address such as an absolute section and put the object into an empty area in the middle. If there is an appropriate section, optimization is performed by rearranging the section, and a link command after this optimization is output. This makes it possible to automatically optimize the memory map by adjusting the object size, and it is possible to increase the continuous free area by arranging the sections in a compact manner.
Further, the automation can reduce the trouble of confirmation and correction by the program developer, so that labor can be saved.

The prelinking result of the prelinking means 200 may be displayed on the memory map display unit 302 described below without performing the processing of the optimization unit 302. That is, the result of the pre-link unit 200 may be directly displayed on the memory map display unit 302 described below. Therefore, the optimization unit 301 is an optional component.

FIG. 4 is a diagram for explaining an example of the memory map display section 302. This memory map display section 30
2 displays the memory map prelinked by the prelinking unit 200 and the memory map optimized by the optimization unit 301. By providing a function that can visually display the link result prelinked to the link map, the arrangement status and the arrangement status relating to the size of each object are displayed in an imageable manner. In the example shown in the figure, the target memory map name is displayed at the upper left of the figure. The left side of the drawing displays the memory allocation, and the right side displays the allocation of sections in the memory. In this display, since the size of each object or section is displayed in proportion to the size of the region, the size of each region can be intuitively understood. The six-digit number between the memory and the section display is the memory address, which is displayed in hexadecimal.

As described above, a complicated link command and a link map are visually schematized, so that it is possible to easily check the image, to reduce a memory arrangement error, and to edit efficiently. .

Next, the rearranging section 303 will be described. The rearrangement unit 303 displays the memory map or the like after the optimization by the map display unit 302, and when a layout problem occurs, based on the memory map rearrangement request from the program developer, Edit the placement of. The edited result is input to the memory map display unit 302 again, and the memory map display unit 302 displays the edited memory map. If the program developer determines from the display of the edited memory map that there is no need for rearrangement, the program developer outputs a link command related to the edited memory map.

Next, the link command output unit 304 will be described. This link command output unit is provided by the optimization unit 3
01 or for outputting the link command output by the rearrangement unit 302. When the link result optimized by the optimizing unit 301 is not edited by the reordering unit 303, the link command output by the optimizing unit 301 is output. When the link command is edited by the rearrangement unit 303, the link command output by the rearrangement unit 303 is output.

Thereafter, the link target program generating means 400 generates a target program using the link command output from the link command output unit 304.

As described above, in the link command editor of the present embodiment, the prelink result linked by an arbitrary command is optimized and graphically displayed as a map, so that the arrangement information of each section can be understood as an image. Therefore, it is possible to arrange the map without having to calculate the map arrangement one by one, so that labor can be saved.

Note that a program for implementing the above-described link command editor can be stored in a recording medium. The recording medium is read by a computer system, and the link command editor is executed to control the computer, thereby realizing the above-described semiconductor integrated circuit re-layout method. Here, the recording medium includes a device capable of recording a program, such as a memory device, a magnetic disk device, and an optical disk device.

[0034]

As described above, according to the link command editor and the computer-readable recording medium in which the link command editor program is recorded according to the present invention, the link command can be edited efficiently.
Labor savings can be achieved.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a series of flows of generating a link command using a link editor.

FIG. 2 is a flowchart illustrating processing of an optimization unit 301.

FIG. 3 is a diagram for explaining an example of optimizing a link map.

FIG. 4 is a diagram illustrating an example of a memory map display unit.

FIG. 5 is a diagram illustrating a notation example of a link command.

[Explanation of symbols]

 REFERENCE SIGNS LIST 100 object generating means 200 pre-linking means 300 link editor processing means 301 optimizing section 302 memory map display section 303 rearrangement section 304 link command output section 400 link target program generating means

Claims (4)

[Claims] 1. A link command editor for editing a link command that defines a memory arrangement, a memory map display unit for inputting the link command and displaying a memory arrangement based on the link command, and a request for rearrangement of a memory map. By rearranging the link command to output to the memory map display unit,
A link command editor, comprising: a rearrangement unit that outputs a link command generated by rearrangement; and a link command output unit that outputs a link command output by the rearrangement unit. 2. A link command editor for editing a link command defining a memory arrangement, comprising: an optimizing unit for inputting a link result, optimizing a memory arrangement, and outputting an optimized link command; And a memory map display unit for displaying a memory arrangement based on the link command, and performing a rearrangement of the link command in response to a memory map rearrangement request to output the memory map display unit,
A link command editor, comprising: a rearrangement unit that outputs a link command generated by rearrangement; and a link command output unit that outputs a link command output by the optimization unit or the rearrangement unit. 3. The optimizing unit includes means for inputting a memory map to be processed, means for searching for a free area from a lower address of the input memory map, and a section which can be moved to the searched free area. Means for determining whether or not to perform the operation, if there is a section determined to be movable by this determination, means for moving the section to the empty area, and, by this movement, other sections to the empty area 3. The link command editor according to claim 2, further comprising: means for arranging the link command. 4. A computer-readable recording medium on which a link command editor program for editing a link command defining a memory arrangement is recorded. A memory for inputting the link command and displaying a memory arrangement based on the link command. A map display step, a rearrangement step of performing a rearrangement of a link command according to a memory map rearrangement request, and outputting a link command generated by the rearrangement; and a link command output step of outputting the output link command. A computer-readable recording medium on which a link command editor program is recorded.