JP2012247908A - Memory arrangement management device, memory arrangement management method, memory arrangement management program, and program generation system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To minimize correction of an address of an object code in arranging memory even when the size of the object code is changed by changing the code.SOLUTION: A memory arrangement management device includes a memory arrangement management table, a management table update part, and a setup file generation part. The management table update part calculates the number of segments assigned to a post-change object code using an object size of a post-update object code when the object code is updated, and moves the post-change object code to a segment having spare zones of the number of the post-change segments or more if the number of the post-change segments is larger than that of the pre-change segments, or if vice versa, updates the memory arrangement management table so as to accommodate the post-change object code in the pre-change segments.

Description

  The present invention relates to a memory allocation management device, a memory allocation management method, a memory allocation management program, and a program creation system, and more particularly to a memory allocation management device that manages the memory allocation of an object code of an OS (Operating System), and a memory allocation The present invention relates to a management method, a memory allocation management program, and a program creation system.

  As an information collection method for OS failure analysis, there is a method of embedding information collection processing for failure analysis (hereinafter also referred to as “probe”) in the OS processing. A technique related to this method will be described with reference to FIG.

  In the method according to the related art shown in FIG. 5, a NOP (No Operation) instruction is embedded in advance in a portion (probe) where information collection processing for failure analysis is necessary in the processing of the OS 101 by the computer 100. Then, when an external storage medium 110 such as a USB (Universal Serial Bus) memory is inserted into the computer 100, the analysis program 102 causes the computer to execute the following processing to collect information.

  (1) The interpreter 103 reads the probe address, the information collection processing address, and the information collection processing described in the analysis script on the external storage medium.

  (2) The information collection process is written in the patch area.

  (3) The NOP instruction at the probe location is changed to a branch instruction to the address for information collection processing.

  Next, the flow of information collection after the above processing of the analysis program 102 is completed is shown below.

  (4) When the processing of the OS 101 reaches the probe address, branch to the patch area information collection processing according to the branch instruction.

  (5) Information collection processing is executed, and log output processing is called.

  (6) The log output process is executed, and the information collected by the information collection process of (5) is output to the log file 112 on the external storage medium.

  Thus, the overhead during normal operation can be suppressed by changing the probe to the NOP instruction during normal operation and changing to a branch instruction for information collection processing only during information collection.

  In the method according to the related technique, the probe address described in the analysis script on the external storage medium is calculated based on the information of the map file and the disassemble file. The map file is a file generated when linking object files, and can specify the start address of the object code. The disassemble file is a file generated by disassembling the object file, and can specify a relative address from the start address of the object code.

  In this case, if the OS source code is modified due to version upgrade or the like, the corresponding object code is changed. Therefore, it is necessary to modify the probe address described in the analysis script.

  In relation to the above, Patent Document 1 allocates a free space of a predetermined size for each target segment of a plurality of object modules in a linker device that combines a plurality of object modules to generate one executable program, There is a description in which only an arrangement target segment whose object module has been changed is linked again, and an empty area of a predetermined size is added to the end of the target arrangement segment.

JP 2000-155673 A

  In the method according to the related art described above, when the OS source code is modified by version upgrade or the like, the memory arrangement is changed by changing the size of the object code corresponding to the modified source code. For this reason, the probe address changes, and it becomes necessary to significantly correct the probe address described in the analysis script. This example is shown in FIGS. 6 (a) and 6 (b).

  In the example of FIGS. 6A and 6B, the object name that has not been changed because the object code size of the object 1 and the object code size of the object 2 are both increased. However, the address of the probe in the object code of object 3 has changed. Furthermore, when the probe is embedded at an address whose object name is higher than the object code of the object 3, the addresses of all the probes are changed.

  On the other hand, in the linker device described in Patent Document 1, since the user or the system specifies the size of the free area using the code size ratio or the like, it is necessary to specify the free area.

  An object of the present invention is to solve the above-mentioned problems, and even when the size of the object code is changed by changing the object code, a memory arrangement management device, a memory arrangement management method, and a memory capable of minimizing the correction of the address of the object code on the memory arrangement An object is to provide an arrangement management program and a program creation system.

  According to the first aspect of the present invention, when a memory area is divided into predetermined fixed-size segments, and an object code is allocated to the divided segment and arranged, the start of the segment to which the object code is allocated A memory allocation management table that manages the segment number and the number of segments together with the first segment number and the number of segments of the segment that is an empty area to which the object code is not assigned, and the updated object code when the object code is updated The number of segments allocated to the object code after change is calculated from the object size of the object, and when the number of segments after change is greater than the number of segments before change, the object code after change is greater than or equal to the number of segments after change. Management table that moves to the segment that will be the storage area and updates the memory allocation management table so that the object code after the change is contained in the segment before the change when the number of segments after the change is less than or equal to the number of segments before the change A memory arrangement comprising: an update unit; and a setting file generation unit that generates a memory arrangement setting file including an object address for setting the memory arrangement of the object code from the updated memory arrangement management table A management device is provided.

  According to the second aspect of the present invention, the memory allocation management table divides the memory area into segments of a fixed length size, and assigns the object code to the divided segment and allocates the segment to which the object code is allocated. The first segment number and the number of segments are managed together with the first segment number and the number of segments of an empty area to which the object code is not assigned, and the management table update unit updates the object code when the object code is updated. When the number of segments allocated to the object code after change is calculated from the object size of the object code of, and the number of segments after change is larger than the number of segments before change, the changed object code is changed to the segment after change When the number of segments after the change is less than or equal to the number of segments before the change, the memory allocation management table is updated so that the object code after the change is stored in the segment before the change. A memory location management method is provided, wherein the configuration file generation unit generates a memory location setting file including an object address for setting the memory location of the object code from the updated memory location management table. Is done.

  According to the third aspect of the present invention, when a computer divides a memory area into segments of a fixed length size, and assigns object codes to the divided segments, the first segment of the segment to which the object code is assigned A memory allocation management table for managing the number and the number of segments together with the first segment number and the number of segments of a segment that is a free area to which the object code is not assigned, and when the object code is updated, the updated object code Calculate the number of segments allocated to the object code after change from the object size, and if the number of segments after change is greater than the number of segments before change, change the object code after change to the number of segments after change. A management table that moves to a segment that becomes an empty area and updates the memory allocation management table so that the object code after the change is stored in the segment before the change when the number of segments after the change is less than or equal to the number of segments before the change A memory arrangement that functions as an update unit and a setting file generation unit that generates a memory arrangement setting file including an object address for setting the memory arrangement of the object code from the updated memory arrangement management table A management program is provided.

  According to a fourth aspect of the present invention, an execution file is generated by linking an object code with the memory arrangement management apparatus described above, and the memory arrangement generated by the memory arrangement management apparatus when the object code is linked There is provided a program creation system comprising a linker for setting a memory allocation of the object code using a setting file.

  According to the present invention, even when the size of the object code is changed by changing the object code, the correction of the address of the object code on the memory arrangement can be minimized.

It is a block diagram which shows the structure of the memory arrangement management apparatus which concerns on embodiment of this invention. FIG. 3 is a diagram showing a memory allocation management table before and after an object code change in the memory allocation management device shown in FIG. 1. 3 is a flowchart showing an operation of the memory arrangement management device shown in FIG. 1. It is a figure which shows the memory arrangement before and behind the object code change at the time of using the memory arrangement management apparatus shown in FIG. It is a block diagram explaining the information collection method for the failure analysis of OS which concerns on related technology. It is a figure which shows the memory arrangement | positioning before and after the object code change at the time of using related technology.

  Embodiments of a memory allocation management device, a memory allocation management method, a memory allocation management program, and a program creation system according to the present invention will be described below in detail with reference to the drawings.

  FIG. 1 explains the configuration of the memory arrangement management apparatus according to the present embodiment.

  The memory allocation management device 50 shown in FIG. 1 constitutes a system (program creation system) that creates and corrects a program together with the compiler 10, the linker 20, and the disassembler 40. The source code 1 described in a programming language is compiled into the compiler 10 Is used to generate an object file 2 and link the generated object file 2 with the linker 20 to generate an execution file 3. Specifically, a memory arrangement management tool 5 and a memory arrangement setting file 6 are included.

  The memory allocation setting file 6 is a file in which object names and object addresses of all object codes for setting the memory allocation of object codes are described. The linker 20 refers to the memory allocation setting file 6 when linking the object file 2 and sets the memory allocation of the object code. For this reason, the memory arrangement setting file 6 needs to be in a format designated by the linker 20. For example, when the compiler RVCT for the ARM processor is used, the memory allocation setting file 6 needs to be in the format of “scatter loading description file”.

  The memory allocation management tool 5 is a tool for managing the memory allocation of the object code by dividing the memory area into fixed-size segments and allocating the object code of the object file 2 to the segment boundary.

  When the source code 1 is changed, the memory allocation management tool 5 is obtained by disassembling the object file 2 corresponding to the changed source code 1 by the disassembler 40, and the disassemble list 4 of the changed object code. The memory arrangement setting file 6 is generated from the information (object name 41, object size 42).

  Specifically, the memory allocation management tool 5 includes a management table update unit 51, a setting file generation unit 52, and a memory allocation management table 53.

  As shown in FIGS. 2A and 2B, the memory allocation management table 53 divides the memory area into predetermined fixed-length segments and assigns and allocates object codes to the divided segments. It is a table for managing the “object name” of the object code, the “starting segment number” of the segment to which the object code is assigned, and the “number of segments” of the segment assigned to the object code.

  Specifically, in the case of a segment to which an object code is assigned, the memory allocation management table 53 manages the top segment number and the number of segments in association with the object name of the object code, and in the case of a segment that becomes a free area The object name of the object code is set to null, and the head segment number and the number of segments are managed in association with null.

  When the object code is updated, the management table update unit 51 uses the object name 41 and the object segment of the memory allocation management table 53 from the object name 41 and the object size 42 of the disassembled list 4 of the changed object code, and Update the number of segments.

  Specifically, the management table update unit 51 calculates the number of segments allocated to the object code after the change from the object size of the object code after the update, and the number of segments after the change is greater than the number of segments before the change. When it is larger, the changed object code is moved to a segment that is more than the number of segments after the change, and when the number of segments after the change is less than or equal to the number of segments before the change, the changed object code is changed to The memory allocation management table 53 is updated so as to fit in the segment.

  In addition, when the number of segments after the change is smaller than the number of segments before the change, the management table update unit 51 changes the object code after the change from the first segment to the number of segments after the change from the top segment. And the memory allocation management table 53 is updated so that the remaining segment is an empty area.

  When the object code is updated, the management table generation unit 52 refers to the object name, the top segment number, and the number of segments in the memory allocation management table 53 and generates the memory allocation setting file 6.

  Next, the operation of the present embodiment will be described.

  FIG. 3 is a flowchart showing the update processing of the memory allocation management table 53 when the object code of the object name A is changed. Hereinafter, the operation of the management table updating unit 51 when the object code of the object name A is updated will be described with reference to FIG.

  First, the management table update unit 51 searches the memory allocation management table 53 for the row T corresponding to the object name of the object code A (step A1), acquires the number of segments of the searched row T, and stores it in the variable S1. Substitute (step A2).

  Next, the management table update unit 51 acquires the object size 42 of the object code of the object name A from the disassembly list 4 generated by the disassembly of the object file 2 (step A3), and from the acquired object size 42, The number of segments after the change of the object code is calculated and substituted into the variable S2 (step A4). The number of segments can be calculated by dividing the object size 42 acquired from the disassemble list 4 by a predefined segment size.

  Next, the management table updating unit 51 determines whether or not S1 <S2 (step A5). As a result, when S1 <S2 (when the number of segments of the object code after the change is larger than the number of segments in row T) (Step A5: Yes), the following processing is performed.

  That is, the management table update unit 51 changes the object name of the row T from A to null (step A6), determines whether the object name of the next row of the row T is null (step A7), and as a result, When the object name of the next row of T is null (step A7: YES), the number of segments of the next row of row T is added to the number of segments of row T in order to combine row T and the next row of row T. The next row after row T is deleted (step A8).

  Next, the management table update unit 51 searches for a row (the number T is a new T) having a segment number of S2 or more and an object name from the top of the memory allocation management table 53 (step A9). The object name in the row T is changed from null to A (step A10), the number of segments in the row T is acquired and substituted into the variable S1 (step A11).

  Next, the management table updating unit 51 determines whether or not S1 = S2 (step A12). As a result, if S1 = S2 is not satisfied (if the number of segments of the object code after the change is smaller than the number of segments in row T) (Step A12: No), the following processing is performed.

  That is, the management table update unit 51 changes the number of segments in the row T to S2 (step A13), determines whether or not the object name in the next row of the row T is null (step A14), and as a result, If the object name of the line is not null (step A14: No), a line with the object name null, the first segment number 0, and the number of segments 0 is added to the next line of the line T (step A15).

  Finally, the management table updating unit 51 assigns “Segment number of row T + S2” to the first segment number of the next row of row T, and adds “S2-S1” to the number of segments (step A16).

  Next, the operation of the management table updating unit 51 when the number of segments of the object code whose object name is the object 2 is changed from 1 to 2 as shown in FIG. 2 will be described with reference to FIG.

  First, the management table update unit 51 searches the memory allocation management table 53 for a row whose object name is object 2 (this row is T) (step A1), and acquires the number of segments 1 of the searched row T. S1 = 1 (step A2).

  Next, the management table update unit 51 obtains the object size 42 of the object 2 from the disassemble list 4 (step A3), calculates the number of segments 2 after the change of the object code, and sets S2 = 2 (step A4). ).

  Next, the management table updating unit 51 determines whether or not S1 <S2 (step A5). As a result, S1 <S2 is satisfied (step A5: Yes), and the following processing is performed.

  That is, the management table update unit 51 changes the object name of the row T from the object 2 to null (step A6), and determines whether the object name of the next row of the row T is null (step A7). As a result, since the object name of the next line of the line T is the object 3 and not null (step A7: No), the management table update unit 51 starts with the number of segments S2 (= 2 from the top of the memory allocation management table 53). ) The above is searched for the row with the object name null (this row is set as a new T) (step A9).

  Next, the management table updating unit 51 changes the object name of the row T from null to the object 2 (step A10), acquires the number of segments 2 of the row T, and sets S1 = 2 (step A11).

  Next, the management table update unit 51 determines whether or not S1 = S2 (step A12). As a result, since S1 = S2 (step A12: Yes), the update processing of the memory arrangement management table 53 is terminated. .

  As described above, according to the present embodiment, the memory area is divided into fixed-sized segments, and the object code is arranged at the segment boundary. If the object code does not fit in the allocated segment due to the change of the object code, the object code is moved to the free area, and if it falls within the allocated segment, the object code does not move. The object code is moved only when the object code is changed and does not fit within the allocated segment, and the movement can be minimized.

  As a result, when the object code is changed by modifying the OS source code 1, the address of another object code that does not change, for example, a probe (information collecting process embedded in the OS for failure analysis) before and after the change is made. It is possible to realize a memory arrangement that keeps the same from changing.

  FIGS. 4A and 4B show an example in which the present embodiment is applied to the same object code as in FIGS. 6A and 6B described above. In the example shown in FIGS. 6A and 6B, the object code whose object name is object 2 is not fit in the allocated segment, so it has been moved to a free space, and the object code whose object name is object 1 is allocated. Does not move because it fits within the specified segment. The address of the probe in the object code of the object 3 whose object name is not changed is not changed.

  Therefore, according to this embodiment, when the OS processing is changed, the correction of the probe address described in the analysis script can be minimized. The reason is that when the object code after the change does not fit in the allocated segment due to the object change, the object code after the change is moved to a free area so that the address of the other object code does not change. Because.

  In addition, since an empty area is created between object codes by arranging the object code at the segment boundary, the use efficiency of the cache memory may be lowered. However, by dividing the cache line size into segments and placing the object code on the boundary of the cache line, the head portion of the object code does not straddle the segment boundary. Therefore, it is considered that the use efficiency of the cache memory is increased.

  In other words, in this embodiment, by setting the segment size to the cache line size, the code does not cross the cache line boundary, and the use efficiency of the cache memory is increased.

  Further, in this embodiment, the size of the free area is automatically determined simply by dividing the memory area into fixed-length segments and assigning codes to the segment boundaries, so it is not necessary to specify the free area.

  The memory arrangement management device described above can be realized by hardware, software, or a combination thereof. In this case, the configuration of hardware, software, or a combination thereof is not particularly limited, and any configuration is applicable as long as the above-described functions can be realized.

  A part or all of the above embodiment can be described as in the following supplementary notes, but is not limited to the following.

  (Supplementary note 1) The memory area is divided into predetermined fixed-size segments, and when the object code is assigned to the divided segment and arranged, the first segment number and the number of segments to which the object code is assigned are A memory allocation management table that is managed together with the first segment number and the number of segments that become an empty area to which the object code is not allocated, and when the object code is updated, the object code after the update is changed from the object size Calculate the number of segments allocated to the object code, and when the number of segments after the change is larger than the number of segments before the change, the segment where the object code after the change becomes a free space greater than the number of segments after the change A management table update unit that updates the memory allocation management table so that the object code after the change is included in the segment before the change when the number of segments after the change is equal to or less than the number of segments before the change, A memory location management apparatus, comprising: a setting file generation unit that generates a memory location setting file including an object address for setting a memory location of the object code from the updated memory location management table.

  (Supplementary note 2) When the number of segments after the change is smaller than the number of segments before the change, the management table update unit changes the object code after the change from the first segment to the number of segments after the change. The memory allocation management device according to appendix 1, wherein the memory allocation management table is updated so as to be stored in a segment and the remaining segment is set as a free area.

  (Supplementary Note 3) In the case of a segment to which the object code is assigned, the memory allocation management table manages the head segment number and the number of segments in association with the object name of the object code and becomes the free area. 3. The memory allocation management device according to appendix 1 or 2, wherein in the case of a segment, the object name of the object code is set to null, and the head segment number and the number of segments are managed in association with the null.

  (Supplementary note 4) The memory arrangement management device according to any one of supplementary notes 1 to 3, wherein the fixed length size of the segment is preset to a cache line size of a cache memory.

  (Supplementary note 5) The memory allocation management device according to any one of supplementary notes 1 to 4, wherein the object code is an object code constituting an operating system.

  (Supplementary note 6) The memory allocation management device according to supplementary note 5, wherein the object code is embedded with a probe for performing information collection processing for failure analysis of the operating system.

  (Supplementary note 7) When the memory allocation management table divides the memory area into fixed-length segments and assigns and allocates object codes to the divided segments, the first segment number and the number of segments to which the object code is assigned Are managed together with the first segment number and the number of segments of a segment that is an empty area to which the object code is not assigned, and the management table update unit determines from the object size of the updated object code when the object code is updated. Calculate the number of segments allocated to the object code after the change, and if the number of segments after the change is greater than the number of segments before the change, change the object code after the change to free space equal to or greater than the number of segments after the change. When the number of segments after the change is less than or equal to the number of segments before the change, the memory allocation management table is updated so that the object code after the change is included in the segment before the change, and the configuration file generation unit Generating a memory location setting file including an object address for setting the memory location of the object code from the updated memory location management table.

  (Supplementary Note 8) When the number of segments after the change is smaller than the number of segments before the change, the management table update unit changes the object code after the change from the first segment to the number of segments after the change. 8. The memory allocation management method according to appendix 7, wherein the memory allocation management table is updated so as to be contained in a segment and the remaining segment is a free area.

  (Supplementary Note 9) When the memory allocation management table is a segment to which the object code is assigned, it manages the head segment number and the number of segments in association with the object name of the object code and becomes the free area. 9. The memory allocation management method according to appendix 7 or 8, wherein in the case of a segment, the object name of the object code is set to null, and the head segment number and the number of segments are managed in association with the null.

  (Supplementary note 10) The memory allocation management method according to any one of supplementary notes 7 to 9, wherein the fixed length size of the segment is preset to a cache line size of a cache memory.

  (Supplementary note 11) The memory allocation management method according to any one of supplementary notes 7 to 10, wherein the object code is an object code constituting an operating system.

  (Supplementary note 12) The memory allocation management method according to supplementary note 11, wherein the object code is embedded with a probe for performing information collection processing for failure analysis of the operating system.

  (Supplementary note 13) When the computer divides the memory area into segments of a fixed length size and assigns the object code to the divided segment and arranges it, the first segment number and the number of segments to which the object code is assigned are A memory allocation management table that is managed together with the first segment number and the number of segments of an empty area to which no object code is assigned, and when the object code is updated, the object after the change from the object size of the updated object code When the number of segments allocated to the code is calculated and the number of segments after the change is larger than the number of segments before the change, the object code after the change becomes free space more than the number of segments after the change. A management table update unit that updates the memory allocation management table so that the object code after the change is included in the segment before the change when the number of segments after the change is equal to or less than the number of segments before the change, A memory allocation management program that functions as a setting file generation unit that generates a memory allocation setting file including an object address for setting the memory allocation of the object code from the updated memory allocation management table.

  (Supplementary Note 14) When the number of segments after the change is smaller than the number of segments before the change, the management table update unit changes the object code after the change from the first segment to the number of segments after the change. 14. The memory allocation management program according to appendix 13, wherein the memory allocation management table is updated so as to be contained in a segment and the remaining segment is set as an empty area.

  (Supplementary Note 15) In the case of a segment to which the object code is assigned, the memory allocation management table manages the head segment number and the number of segments in association with the object name of the object code and becomes the free area. 15. The memory arrangement management program according to appendix 13 or 14, wherein in the case of a segment, the object name of the object code is set to null, and the head segment number and the number of segments are managed in association with the null.

  (Supplementary note 16) The memory arrangement management program according to any one of supplementary notes 13 to 15, wherein the fixed length size of the segment is preset to a cache line size of a cache memory.

  (Supplementary note 17) The memory allocation management program according to any one of Supplementary notes 13 to 16, wherein the object code is an object code constituting an operating system.

  (Supplementary note 18) The memory allocation management program according to supplementary note 17, wherein the object code is embedded with a probe for performing information collection processing for failure analysis of the operating system.

  (Supplementary note 19) An execution file is generated by linking an object code with the memory allocation management device according to any one of supplementary notes 1 to 6, and the memory allocation setting generated by the memory allocation management device when the object code is linked And a linker that sets a memory allocation of the object code using a file.

  (Additional remark 20) It further has the compiler which compiles a source code and produces | generates the said object code, and the disassembler which disassembles the said object code and produces | generates the disassemble list | wrist including the object name and object size of the said object code | cord | chord The program creation system according to supplementary note 19, characterized by that.

  Although the present invention has been described with reference to the embodiments, the present invention is not limited to the above embodiments. Various changes that can be understood by those skilled in the art can be made to the configuration and details of the present invention within the scope of the present invention.

  As described above, the present invention can be used for a memory arrangement management device, a memory arrangement management method, a memory arrangement management program, and a program creation system that manage the memory arrangement of an OS object code.

DESCRIPTION OF SYMBOLS 1 Source code 2 Object code 3 Execution file 4 Disassembly list 5 Memory allocation management tool 6 Memory allocation setting file 10 Compiler 20 Linker 40 Disassembler 41 Object name 42 Object size 50 Memory allocation management device 51 Management table update part 52 Setting file generation 53 Memory allocation management table 100 Computer 101 OS
102 Analysis program 103 Interpreter 110 External storage medium 111 Analysis script 112 Log file

Claims (10)

When the memory area is divided into predetermined fixed-size segments, and the object code is assigned to the divided segments, the start segment number and the number of segments to which the object code is assigned are indicated by the object code. A memory allocation management table that is managed together with the first segment number and the number of segments of an unallocated free area;
When the object code is updated, the number of segments allocated to the object code after change is calculated from the object size of the object code after update, and when the number of segments after change is larger than the number of segments before change, Move the object code after the change to a segment that has more free space than the number of segments after the change, and when the number of segments after the change is less than or equal to the number of segments before the change, change the object code into the segment before the change A management table update unit for updating the memory arrangement management table so as to accommodate;
A memory location management apparatus, comprising: a setting file generation unit that generates a memory location setting file including an object address for setting a memory location of the object code from the updated memory location management table.   When the number of segments after the change is smaller than the number of segments before the change, the management table update unit stores the object code after the change in the number of segments after the change from the first segment in the segment before the change, 2. The memory arrangement management apparatus according to claim 1, wherein the memory arrangement management table is updated so that the remaining segment is an empty area.   In the memory allocation management table, in the case of a segment to which the object code is assigned, the head segment number and the number of segments are managed in association with the object name of the object code, and in the case of the segment to be the free area, 3. The memory arrangement management device according to claim 1, wherein an object name of the object code is set to null, and the head segment number and the number of segments are managed in association with the null.   4. The memory arrangement management device according to claim 1, wherein the fixed length size of the segment is preset to a cache line size of a cache memory.   5. The memory allocation management device according to claim 1, wherein the object code is an object code constituting an operating system.   6. The memory arrangement management device according to claim 5, wherein the object code includes an embedded probe for performing information collection processing for failure analysis of the operating system. When the memory allocation management table divides the memory area into fixed-size segments and assigns object codes to the divided segments, the start segment number and the number of segments to which the object code is assigned are It is managed together with the first segment number and the number of segments of the segment that is an empty area to which no code is assigned,
When the object code is updated, the management table update unit calculates the number of segments allocated to the changed object code from the object size of the updated object code, and the changed segment number is the segment before the change. If the number is larger than the number, move the object code after the change to a segment that has more space than the number of segments after the change.If the number of segments after the change is less than or equal to the number of segments before the change, change the object code to Update the memory allocation management table to fit in the segment before the change,
A memory allocation management method, wherein a setting file generation unit generates a memory allocation setting file including an object address for setting the memory allocation of the object code from the updated memory allocation management table. Computer
When the memory area is divided into fixed-size segments, and the object code is assigned to the divided segment, the segment number to which the object code is assigned and the number of segments are not assigned. A memory allocation management table that is managed together with the first segment number and the number of segments of a segment that becomes a free area;
When the object code is updated, the number of segments allocated to the object code after change is calculated from the object size of the object code after update, and when the number of segments after change is larger than the number of segments before change, Move the object code after the change to a segment that has more free space than the number of segments after the change, and when the number of segments after the change is less than or equal to the number of segments before the change, change the object code into the segment before the change A management table update unit for updating the memory arrangement management table so as to accommodate;
A memory allocation management program that functions as a setting file generation unit that generates a memory allocation setting file including an object address for setting the memory allocation of the object code from the updated memory allocation management table. The memory arrangement management device according to any one of claims 1 to 6,
A linker that generates an execution file by linking object code, and that sets a memory allocation of the object code using a memory allocation setting file generated by the memory allocation management device when the object code is linked. Program creation system. A compiler that compiles source code to generate the object code;
10. The program creation system according to claim 9, further comprising a disassembler that disassembles the object code to generate a disassemble list including an object name and an object size of the object code.

Images