JPH09330232A - Dynamic storage allocation method - Google Patents

Abstract

(57) Abstract: The overhead of a library call and a dynamic storage management mechanism is reduced by reducing calls of a storage management library for dynamically securing and releasing a storage area. A data flow regarding a pointer value for identifying a storage area returned in response to a dynamic storage area reservation request in which the size of the reserved storage area is known at the time of program translation and a control flow of the program. The live range detection means for detecting the live range of the analyzed and secured storage area, and the live range duplication checking means for checking the duplication of the live ranges of the plurality of detected dynamic storage areas and the live range found by the live range duplication checking means Considering the duplication status of existing sections, a means for grouping one or more dynamic storage areas that can share the same storage area, and invalidating the request to secure / release dynamic storage areas belonging to the same group Means are provided for changing the program so that the storage area secured at the beginning is shared and used.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a language processing system of an information processing apparatus, and more particularly to a dynamic storage area allocation system of the language processing system.

[0002]

2. Description of the Related Art As a conventional technique of this kind, for example, Japanese Patent Laid-Open No. 63-226750 discloses a maximum allocation that can be made when a specified memory capacity cannot be allocated when allocating a dynamic storage area. A dynamic memory reservation method has been proposed in which the memory capacity is obtained by using the binary search method, and is re-allocated to secure a large capacity memory to speed up the processing.

Also, in the prior arts other than the above publication, the only method for improving the processing efficiency of dynamic storage area allocation is to improve the processing method for storage area allocation requests from programs. Is the actual situation.

[0004]

That is, in the conventional dynamic storage area allocation method, the speed of dynamic storage area allocation is increased by improving the processing method for securing and releasing the storage area. However, in a program that uses a large amount of dynamic storage, it is often the case that sufficient processing speed is not realized. The reason for this will be described below.

In a programming language having a function of dynamically allocating a storage area from a program, a description of designation of dynamic storage area reservation / release described in a user program (user program) is applied to a language processing system. It is realized by replacing it with the library function call for storage area management provided by.

In addition, in the storage area management library function, a complicated storage area management mechanism is generally adopted in order to respond to a random storage area reservation / release request and to effectively utilize the storage area. are doing.

In the conventional technique, the complicated storage area management mechanism executed in this library function is improved to speed up the securing and releasing of the storage area. However, it is described in the program. Since the library function is still called for each request to secure and release the allocated dynamic storage area, the overhead due to the library function call has not been improved.

Particularly in a program in which the dynamic storage area is frequently used, a large number of library function calls occur, and there are many cases in which a sufficient effect cannot be obtained only by speeding up by the conventional technique.

Therefore, the present invention has been made in view of the above circumstances, and its purpose is to secure a dynamic storage area.
An object of the present invention is to provide a dynamic memory allocation method that reduces the overhead of the library call and the dynamic memory management mechanism by reducing the calls to the storage area management library for release, and achieves high speed.

[0010]

In order to achieve the above-mentioned object, a dynamic storage area allocation method of the present invention analyzes a source program and requests a dynamic storage area allocation / release request issued in the program. Based on the data flow information about the program and the control flow information of the program, by detecting the overlapping state of the live range between a plurality of dynamic storage areas, by detecting and sharing a plurality of sharable storage areas, It is characterized by further comprising means for automatically modifying the source program so as to reduce library calls for storage area management for dynamically reserving and releasing storage areas.

According to the present invention, it is possible to share different dynamic storage areas within a range in which a user can arbitrarily analyze a request to secure / release a dynamic storage area described in a program. By detecting and sharing multiple different storage areas, the number of library calls for storage area management to dynamically secure and release storage areas is reduced, and the overhead of the storage area management library is reduced. It is a thing.

That is, according to the dynamic storage area allocation method of the present invention, in a language processing system for a programming language having a function of dynamically securing and releasing a storage area during execution of a program, the size of the secured storage area is Detects a dynamic storage allocation request found when the program is translated, analyzes the data flow related to the pointer value that identifies the storage area returned for the allocation request, and the program control flow to analyze the pointer. A live range detecting means for detecting a live range of the secured storage area by detecting a release request at the farthest position from the reserve request for the storage area identified by the value, and a plurality of motions detected by the live range detecting means. Range duplication checking means for checking the duplication of live ranges in dynamic storage areas, and the duplication status of live ranges found by the live range duplication checking means Grouping means for grouping one or more dynamic storage areas that can share the same storage area in consideration of each other, and the storage area having the largest size among the dynamic storage areas in one group. The live group is secured at the beginning of the live range of the dynamic storage area that starts earliest, and is released at the end of the live area of the dynamic memory area where the live area ends the latest in the same group. It is characterized by having program changing means for changing the program so that the request for securing / releasing the dynamic storage area belonging to is invalidated and the storage area secured at the head of the group is shared.

[0013]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will be described below in detail with reference to the drawings. FIG. 1 is a block diagram showing a configuration of an embodiment of the present invention.

Referring to FIG. 1, in the embodiment of the present invention, a language processing system 1, a live range detecting means 2, a live range duplicate detecting means 3, a grouping means 4, a program changing means 5, a source program 6, and data. Flow information 7, control flow information 8, live range information 9, live range overlap status information 1
0 and group information 11 are provided. Each element will be described below.

FIG. 2 is a diagram showing an example of the structure of the data flow information 7 in the embodiment of the present invention.

Referring to FIG. 2, data flow information 7
Is composed of a data flow table and an alias table. The data flow table is configured such that each entry includes data, a position where a value is set in the data, a position where the range holding the value ends, and a chain (pointer) to the alias table. It is a set of data flow information. Further, the alias table is created for each entry of the data flow table, and holds the copy of the value held by the data identified by the data flow information stored in the corresponding entry of the data flow table. Is a set of the alias information constituted by the set position and the end position of.

It is assumed that the above-mentioned data flow information 7 is created in advance by the language processing system 1.

FIG. 3 is a diagram showing an example of the structure of the control flow information 8 in the embodiment of the present invention. Referring to FIG. 3, the control flow information 8 is composed of one or a plurality of basic block information holding information on basic blocks, and each basic block is connected by a chain according to a control flow between the basic blocks.

The basic block information comprises a basic block start position, an end position, and a chain of basic block information for one or more other basic blocks to which control is transferred from the basic block. Control flow information 8
Is preliminarily created by the language processing system 1.

FIG. 4 is a diagram showing an example of the configuration of the live range information 9 in the embodiment of the present invention. Referring to FIG. 4, the live range information 9 includes a live range table and a release information table. The live range table is
The entry (# 1 to #n) is a set of information related to the dynamic storage area secured in the source program 6, and each entry (# 1 to #n) includes section start information, section end information, and motion Data holding a pointer value for identifying a specific storage area, a size of the dynamic storage area, and a chain to a release information table corresponding to the dynamic storage area. Then, as shown in the figure, the section start information holds the start position of the section and the basic block number including the start position, and the section end information holds the basic block number including the end position and the end position of the section. . Further, the release information tables 1 to n are a set of release information of corresponding dynamic storage areas, and the release information holds a release position of the dynamic storage area and a basic block number including the release position.

FIG. 5 is a diagram showing an example of the configuration of the live range overlap status information 10 in the embodiment of the present invention.
Referring to FIG. 5, the live range overlap status information 10 is a two-dimensional bit array representing live range overlap information between a dynamic storage area and another dynamic storage area, and the number of elements in each dimension is Both are the same as the number of entries in the live range table of the live range information 9 (# 1 to #n in the row and column directions). Each bit of the live range overlap status information 10 is set to "1" when the live ranges of the corresponding dynamic storage areas overlap, and is set to "0" otherwise.

FIG. 6 is a diagram showing an example of the configuration of the group information 11 in the embodiment of the present invention. Referring to FIG. 6, group information 11 includes a group start position, a group end position, and a group end position for grouped dynamic storage areas.
It is a set of entries composed of generated data and size.

Next, the operation of the embodiment of the present invention will be described with reference to FIG.

The language processing system 1 inputs the source program 6 and generates data flow information 7 and control flow information 8.

Next, the language processing system 1 sequentially activates the live range detecting means 2, the live range overlapping detecting means 3, the grouping means 4, and the program changing means 5, and the source program 6
The source program 6 is modified so that calls to the storage area management library functions for dynamically securing and releasing the internal storage area are reduced.

The live range detecting means 2 inputs the source program 6, the data flow information 7, and the control flow information 8 to dynamically determine the size of the storage area to be secured in the source program 6, which is a dynamic storage area. The dynamic storage area secured by the securing request of (1) is detected by the following procedure until the area (live zone) from the secured position to the farthest position is released.

(1) The source program 6 is investigated, and the size of the storage area to be secured is known statically. The position and size of the dynamic storage area securing request, and the dynamic storage area secured by the securing request. Data holding a pointer value for identifying the storage area is detected and stored in the position field of the section start information of the live section table of the live section information 9, the size field of the live section table, and the data field of the live section table.

By this processing, the live range information 9 contains
Data holding the position and size of the allocation request for all the dynamic storage areas in which the size of the reserved storage area in the source program 6 is statically known, and the pointer value for identifying the secured dynamic storage area Stores information about.

(2) Next, the source program 6 is examined, and the data holding the pointer value identifying each dynamic storage area and its alias data hold the pointer value identifying the dynamic storage area. Detects all the positions of the release request of the dynamic storage area within the range being operated, and creates the release information table (see FIG. 4) corresponding to the dynamic storage area in the live range information 9. Then, the position of the detected release request is stored in the position field of the release information of each entry.

In this process, in order to acquire the data holding the pointer value for identifying each dynamic storage area and the range in which the alias data holds the value, the live range table 9 of the live range information 9 is acquired. The set position field / end position field of the data flow information of the data flow table of the data flow information 7 corresponding to the data field of each entry, and the set position field / end position field of each alias information of the corresponding alias table are referred to. .

(3) Next, referring to the start position field and end position field of each basic block information of the control flow information 8, the position field of the section start information of the live range table of the live range information 9 and the release information table Of the release information, the basic block number corresponding to the position stored in the position field of the release information is determined, and in the live range table of the live range information 9, in the block field of the section start information and the block field of the release information of the release information table, Set the basic block number.

(4) Finally, with reference to the release information table of the live range information 9 and the control flow information 8, even if the processing shifts through any release request for each dynamic storage area, it always passes. Determine the basic block farthest from the reservation request. The start position and basic block number of this basic block are stored in the position field / block field of the section end information of the live range table of the live range information 9. When there is one release request, the release position is the end of the live range.

If there is no basic block that always passes, no matter what the release request is, the processing will move.
The dynamic storage area is excluded from this processing, and the information already stored in the live range information 9 is deleted.

The live range duplication detection means 3 refers to the section start information and the section end information for each dynamic storage area in the live range information 9 generated by the live range detection means 2 to refer to each motion. Dynamic storage area and a dynamic storage area whose live range overlaps are detected, and live range overlap status information 10 (see FIG. 5) is set.

The grouping means 4 refers to the live range overlap status information 10 created by the live range overlap detection means 3 to group the dynamic storage areas whose live ranges do not overlap, and to group the group information 11 ( 6) is generated.

The group start position of the group information 11 is
In the live range table of the live range information 9, the value of the position field of the section start information of the entry corresponding to the earliest one of the grouped dynamic storage areas is set. The group end position of the group information 11 is the section end information of the entry corresponding to the last appearing one of the grouped dynamic storage areas in the live range table of the live range information 9. The value of the position field is set. As the size of the group information 11, the value of the size field of the entry corresponding to the largest size of the grouped dynamic storage areas in the live range table of the live range information 9 is set.

The program changing unit 5 refers to each entry of the group information 11 created by the grouping unit 4 and changes the source program 6 in the following procedure.

(1) A request for securing a dynamic storage area is added to the group start position of the group information 11 according to the value of the size field of the group information 11.

(2) The pointer data for holding the pointer value for identifying the dynamic storage area secured by the request for securing the dynamic storage area is generated, and the dynamic data secured in the generated data is generated. Allows storage of pointer values that identify storage areas. In addition, the generated data name is group information 1
1 in the generated data field (see FIG. 6).

(3) Generation of the reservation request for all the dynamic storage areas belonging to the relevant group into the pointer data holding the pointer value for identifying the dynamic storage area reserved by the relevant confirmation request. Change to the process of substituting the value held by the data.

(4) Delete all release requests for all dynamic storage areas belonging to the group.

(5) A request for releasing the dynamic storage area is added to the group end position of the group information 11. The pointer value for identifying the released dynamic storage area is held in the generated data set in the generated data field of the group information 11.

As described above, the processing of the dynamic storage area allocation method according to the embodiment of the present invention is completed, and the storage area management library function for securing / releasing the dynamic storage area in the source program 6 is completed. A source program 6 with reduced calls is generated.

[0044]

EXAMPLES Examples of the present invention will now be described in detail with reference to the drawings in order to more specifically describe the above-described embodiments of the present invention. The configuration of the embodiment of the present invention is the same as that of the above-mentioned embodiment, and referring to FIG. 1, the language processing system 1, the live range detection means 2, the live range duplicate detection means 3, the grouping means 4, The program changing unit 5, the source program 6, the data flow information 7, the control flow information 8, the live range information 9, the live range overlap status information 10, and the group information 11.

FIG. 7 is a diagram showing an example of the source program 6 in this embodiment. As shown in FIG. 7, the source program 6 is written in PL / I language.
The position of each line in the source program is shown on the left side of the source program. Also, a request to secure a dynamic storage area in the PL / I language is described by "ALLOCATE statement", and a release request is described by "FREE statement". These "AL
In the target program generated by the language processor, the dynamic storage area allocation / release by the "LOCATE statement" or "FREE statement" is performed by the storage area management library function for dynamic storage area allocation / release. It is realized (linking means links to generate an execution module). By the way, in the source program 6 shown in FIG. 7, at position 11, a request for securing a storage area of size 128 (character type array of dimension 128) # 1 is issued by the "ALLOCATE statement" (P1 is a pointer type variable), and the position In 36, the release request of the reservation request # 1 is made by the "FREE statement".

FIG. 8 shows a specific example of the data flow information 7 in this embodiment (a storage area for the program shown in FIG.
(Corresponding to release) FIG. Referring to FIG. 8, the meaning of each field is the same as that of FIG. 2 referred to in the above-mentioned embodiment. For example, P1, 11, and 36 in each field of the first entry of the data flow information indicate data, set position, and end position, respectively.

FIG. 9 is a diagram showing a specific example of the control flow information 8 in this embodiment. The meaning of each field is the same as that in FIG. 3 referred to in the above embodiment, and the description thereof is omitted.

FIG. 10 is a diagram showing a specific example of the live range information 9 in this embodiment. The meaning of each field is the same as that in FIG. 4 referred to in the above embodiment, and the description thereof is omitted.

FIG. 11 is a concrete example of the live range overlap status information 10 in this embodiment. The meaning of each bot flag is the same as in FIG. 2 referred to in the above embodiment. For example, the dynamic storage area # 1 has the same live range as the dynamic storage areas # 2 and # 3.

FIG. 12 is a concrete example of the group information 11 in this embodiment. The meaning of each field is the same as that in FIG. 6 referred to in the above embodiment, and the description thereof is omitted.

FIG. 13 shows a specific example of the source program 6 modified by the dynamic storage area allocation method in this embodiment. The position of each line in the source program is shown on the left side of the source program.

The position of the line added or changed to the original source program shown in FIG.
Are distinguished from the same line. In the source program of FIG. 7, lines that do not exist in FIG. 13 are deleted lines.

The language processing system 1 analyzes the source program 6 (see FIG. 7) and generates data flow information 7 (see FIG. 8) and control flow information 8 (see FIG. 9).

The data flow information 7 of this embodiment is a position where a pointer value for identifying a dynamic storage area on the source program 6 (see FIG. 7) is set for the data P1, P2, P3, P4 and P5. As the pointer value becomes invalid due to the release request, the position where the life of the value held in the data ends is set in the data flow table (see FIG. 8).

Further, with respect to the alias data which holds a copy of the value held by the data corresponding to each entry of the data flow table, the position where the corresponding value is set in the source program 6 (see FIG. 7) and the pointer value are The position where the life of the value held in the data ends due to invalidation by the release request is set in the alias table.

In this embodiment, the alias table is shown in FIG.
It is only for the data P6 (P6 = P3) in which the pointer value held by the data P3 is assigned at the position 45.

As for the control flow information 8 of this embodiment, referring to FIG. 9, basic block information # 1, # 2, # 3, # 4,
The basic block information is composed of # 5, # 6, # 7, # 8, and # 9.
It holds an end position and a chain from the control block to another basic block to which control is transferred.

Next, the language processing system 1 sequentially activates the live range detection means 2, the live range duplication detection means 3, the group means 4, and the program change means 5, and the source program 6
(See FIG. 7) The source program 6 (see FIG. 13) is generated so that the number of calls to the storage area management library function for dynamically securing / releasing the storage area is reduced.

The live range detecting means 2 examines the source program 6 (see FIG. 7) and finds the appearance position (11, 15, 19, 25, 37) of "ALLOCATE statement" and each "A.
The size (128, 256, 300, 256, 100) of the dynamic storage area secured by the "LLOCATE statement", and the data (P1, P2, P4, which holds the pointer value for identifying the secured dynamic storage area). P5, P3) as live range information 9
It is set in the position field, size field, and data field of the section start information of the live range table (see FIG. 10).

Next, entries # 1, # 2, # 3, # 4, # of the live range table of the live range information 9 (see FIG. 10).
5, the source program 6 (see FIG. 7) is examined, and the appearance position (36, 18, 22, of the “FREE statement”) with respect to the dynamic storage area corresponding to each entry is examined.
28, 34, 41, 48) is detected, and live range information 9
It is set in the position field of the release information of the release information table under the corresponding entry of the live range table (see FIG. 10).

When detecting the "FREE sentence", the data P1 and P are referred to by referring to the data flow information 7 (see FIG. 8).
The range in which the pointer value for identifying the dynamic storage area corresponding to the transfer data P6 of 2, P4, P5, P3, and P3 is held is investigated.

Subsequently, referring to the control flow information 8 (see FIG. 9), the position (11, 11) set in the position field of the section start information of the live range table in the live range information 9 (see FIG. 10). The basic block numbers (# 1, # 2, # 2, # 3, # 6) to which 15, 19, 25, 37) belong are determined and set in the block field of the same section start information. Also, the basic block number (# to which the position (36, 18, 22, 28, 34, 41, 48) set in the position field of the release information of the release information table in the live range information 9 (see FIG. 10) belongs. 6, # 2, # 2, # 4, #
5, # 7, # 8) are set in the block field of the same release information.

The basic block number is determined by whether or not it belongs between the values held in the start position field and the end position field of each basic block information in the control flow information 8 (see FIG. 9).

Finally, in order to determine the section end position of the live range of each dynamic storage area and the basic block to which it belongs, the release corresponding to each entry of the live range table in the live range information 9 (see FIG. 10). The basic block that always passes through any release request of the information table is determined by referring to the control flow information 8 (see FIG. 9).

In this embodiment, there is one release request corresponding to each of the entries # 1, # 2, and # 3 in the live range table of the live range information 9 (see FIG. 10).
The section end information of these live sections is the same as the position field and block field of the release information of the corresponding release information table.

With reference to FIG. 10, the release request corresponding to entry # 4 is at position 28 (basic block # 4), position 3
4 (basic block # 5) exist, but basic block # 4 (start position 27, end position 3) to which position 28 belongs
In 0), since the control does not transfer to another basic block after passing through the basic block, there is no basic block that always passes through either of the positions 28 and 34, so the entry # 4 is excluded. Therefore, entry # 4 is deleted from the live range table. Also, the release information table 4 corresponding to the entry # 4 is deleted.

There are two release requests corresponding to the entry # 5, that is, the positions 41 and 48, and the basic block that always passes through any of them is the basic block # 9. In the block field of #
9, the start position 50 of the basic block is set in the position field.

The live range duplication checking means 3 refers to each entry in the live range table of the live range information 9 (see FIG. 10) to check the overlapping state of the live ranges in the dynamic storage area corresponding to each entry. Then, the live range overlap status information 10 (Fig. 1
1) is generated. In the source program shown in FIG. 7, the live range of the dynamic storage area corresponding to entry # 1 and the live range of the dynamic storage areas corresponding to entries # 2 and # 3 overlap.

The grouping means 4 refers to the live range duplication status information 10 (see FIG. 11) to group the dynamic storage areas in which the live ranges do not overlap, and the group information 11
(See FIG. 12) is generated.

Entry # 1, entry # 5, and entry # 2 of the live range table of the live range information 9 (see FIG. 10)
Grouped into two groups, and entry # 3, or
It is possible to group the entry # 2, the entry # 3, and the entry # 5 into one group, but in the present embodiment, the former 2 is taken into consideration in consideration of the difference in the size of each dynamic storage area. Group into one group.

As a result, as shown in FIG. 12, the group information 11 includes group # 1 (start position: 11, end position: 50, size: 128) and group # 2 (start position: 15, end position: 22, size: 300) is generated.

The program changing means 5 refers to the grouping information 11 (see FIG. 12) and issues a dynamic storage area reservation / release request in the source program 6 shown in FIG. 7 to the start position and end position of the group. Change to do only in Figure 13
Generate a source program as shown in.

The live range information 9 (see FIG. 10) is assigned to the group # 1.
Entry # 1 and entry # of the live range table
Since the dynamic storage area corresponding to 5 belongs, entry # 1
"ALLOCATE for dynamic storage corresponding to
Position 11 of the original source program 6 in which the "sentence" appears is changed to positions 11-1, 11-2, 11-3 in the changed source program, as shown in FIG. Added 11-1 “DCL # P1 # PT
The pointer is defined by "R", and "ALLOCAT is defined by 11-2.
EA SET (# P1 #) "and the pointer is changed from the original position 11 and" P1 = # P1 "is added to the added 11-3.
The pointer value of the secured storage area "#" is assigned to P1.

"FREE statement" for the dynamic storage area
Position 36 of the source program 6 (see FIG. 7) where
Is deleted in the changed source program as shown in FIG.

The position 37 of the original source program 6 in which the "ALLOCATE statement" appears in the dynamic storage area corresponding to the entry # 5 is the same as position 37 shown in FIG. 13 in the changed source program. has been edited.

Then, "FR" for the dynamic storage area
Position 41 of the original source program 6 where the "EE sentence" appears,
48 is deleted in the changed source program, and the position 50 of the original source program 6 which is the end position of the group # 1 is changed to the position shown in FIG.
The positions 50-1 and 50 are changed.

Similarly to the group # 1, for the group # 2, the "ALLOCATE statement" for the dynamic storage areas corresponding to the entries # 2 and # 3 of the live range table of the live range information 9 (see FIG. 10). , "FREE
The corresponding position of the original source program 6 in which the "sentence" appears is changed as shown in FIG. 13 in the changed source program.

As described above, the processing of the dynamic storage area allocation method according to the embodiment of the present invention is completed, and five "ALLOCATE" for the dynamic storage area in the source program 6 are completed.
Statement ”and seven“ FREE statements ”in the changed source program, as shown in FIG.
The number of "TE sentences" is reduced to 3, and the number of "FREE sentences" is reduced to 4.

In the above embodiment, an example of a program for securing / releasing a dynamic storage area in PL / I language has been described.
The present invention is not limited to the PL / I language of the present invention, and can be applied to a request to secure / release a dynamic storage area by another programming language.

[0080]

As described above, according to the present invention,
This has the effect of reducing the processing overhead associated with securing and releasing a dynamic storage area in a program.

The reason for this is that, in the present invention, a request for securing and releasing a dynamic storage area in a program is analyzed within a statically analyzable range, and a plurality of dynamic storage areas whose live ranges are not overlapped are analyzed. By reducing the number of calls to the library function for storage management to secure and release the dynamic storage area by detecting the storage area and sharing multiple dynamic storage areas, at least it was reduced. This is because the overhead is reduced by the storage management library function.

[Brief description of drawings]

FIG. 1 is a diagram showing a configuration showing an embodiment of the present invention.

FIG. 2 is a diagram showing a configuration of data flow information 7 according to the embodiment of the present invention.

FIG. 3 is control flow information 8 according to the embodiment of the present invention.
It is a figure which shows the structure of.

FIG. 4 is a diagram showing a configuration of live range information 9 according to the embodiment of the present invention.

FIG. 5 is a diagram showing a configuration of live range overlap status information 10 in the embodiment of the present invention.

FIG. 6 is a group information 11 according to the embodiment of this invention.
It is a figure which shows the structure of.

FIG. 7 is a diagram showing a specific example of a source program 6 in the embodiment of the present invention.

FIG. 8 is a diagram showing a specific example of data flow information 7 according to the embodiment of the present invention.

FIG. 9 is a diagram showing a specific example of control flow information 8 in the embodiment of the present invention.

FIG. 10 is a diagram showing a specific example of live range information 9 according to the embodiment of the present invention.

FIG. 11 is a diagram showing a specific example of live range overlap status information 10 in the embodiment of the present invention.

FIG. 12 is a diagram showing a specific example of group information 11 in the embodiment of the present invention.

FIG. 13 is a source program 6 according to the embodiment of the present invention.
It is a figure which shows the specific example after the change of.

[Explanation of symbols]

 1 language processing system 2 live range detection means 3 live range duplicate detection means 4 grouping means 5 program changing means 6 source program 7 data flow information 8 control flow information 9 live range information 10 live range overlap status information 11 group information

Claims (2)

[Claims] 1. A plurality of dynamic storage areas based on data flow information relating to a dynamic storage area securing / releasing request issued in the program by analyzing a source program and control flow information of the program. By detecting the duplication status of live ranges between multiple storage areas and detecting and sharing multiple storage areas that can be shared, the number of library calls for storage area management to dynamically secure and release storage areas is reduced. A dynamic storage area allocation method comprising means for automatically modifying the source program as described above. 2. In a language processing system for a programming language having a function of dynamically reserving / releasing a storage area during execution of a program, the size of the reserving storage area is determined dynamically when the program is translated. Securement request for the storage area identified by the pointer value by analyzing the data flow relating to the pointer value identifying the storage area returned in response to the securement request and the control flow of the program. A release request at the position farthest from the live range detecting means for detecting the live range of the storage area secured thereby, and the live range of the plurality of dynamic storage areas detected by the live range detecting means. The same storage area is shared in consideration of the live range duplication checking means for checking duplication and the duplication status of the live ranges found by the live range duplication checking means. Grouping means for grouping into one or a plurality of active dynamic storage areas, and the storage area having the largest size among the dynamic storage areas in one group, and the live range thereof starts earliest. Secured at the beginning of the live range of the dynamic storage area that is allocated, and released at the end of the live range of the dynamic storage area where the live range ends the latest in the group, and secure the dynamic storage area that belongs to the same group -A dynamic storage area allocation method characterized by including program changing means for changing a program so that a storage area secured at the head of a group is shared and used by invalidating a release request.