JPS6359628A - Dynamic area acquisition method - Google Patents

Abstract

(57) [Abstract] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed Description of the Invention] [Summary] Work acquired in bulk by a higher-level program? In a dynamic area acquisition method in which a lower-level program cuts out and uses the ii area, the upper-level program sets the block-acquired area's start address (bss) to the start address area (is) of the area cut out by the upper-level program, for example. By setting , and providing a means for notifying the lower program of the start address (bsl, bs2.-) of the cut out area, the lower program can start from the notified address of the previously acquired area. It is designed to extract its own work area while recognizing the start address (BSS).

[Industrial application field]

The present invention relates to a dynamic area acquisition method in which a lower-level program cuts out and uses a work area that is collectively acquired by a higher-level program.

Generally, the structure of a program executed on a computer system is under the control of the operating system (O5).
There are multiple application programs, and each application program is divided into a higher-level program and multiple lower-level programs connected in a chain, and each lower-level program executes based on instructions from the higher-level program. is executing the job.

In this case, it is necessary to secure the work area necessary for executing the job in each lower program.
Each lower program independently calls the area reservation program in the operating system (O5),
If the work area is secured, there is a problem in that the overhead in the operating system (O3) becomes large, and an effective area securing method is required.

[Prior art and problems to be solved by the invention] FIG. 2 is a diagram illustrating a conventional dynamic area acquisition method.
) shows the case where the area is secured by calling the operating system (O5), and (b) shows the case where the area is secured without relying on the operating system (O3) (-vitality type).

First, in Figure (a), when calling lower level program B while upper level program A is running, upper level program A recognizes the base address (bs1) of its own work area As; The called lower program B does not know where to start when cutting out its own work area, so it calls the area reservation program of the operating system (O3) as described above and relies on it to secure the area. He was singing an ode.

Therefore, there is a problem in that the overhead in the operating system (O5) increases.

(b) The area reservation method shown in the figure is an improved area reservation method (-vitality method) that is performed without calling the operating system (OS).

The upper program A stores the address (b) of the next usable area, for example, at the beginning (11) of its own cutout area As.
s2) and the start address (b
s1) to lower level program B.

Lower program B accesses the above address (bs1) and writes its own work area (
The start address (bs2) of Bs) can be recognized.

However, in this -vitality formula, the final address (bse
) cannot be recognized by the lower-level program B, etc., so there is a problem in that overflow cannot be checked when securing an area.

In addition to this, there is also a method of notifying the lower program of the start address and final address of the work area that the upper program has acquired all at once, but this method poses the problem of increasing the amount of information that must be notified to the lower program. there were.

In view of the above conventional drawbacks, it is an object of the present invention to provide a method for acquiring a work area by checking for area overflow when securing an area with a minimum amount of communication in a dynamic area acquisition method. It is something.

[Means for solving problems]

FIG. 1 is a diagram showing an example of the configuration of a dynamic area acquisition method according to the present invention.

The present invention is a dynamic area acquisition method in which a lower program cuts out and uses a work area acquired in bulk by a higher level program, and the starting address (
bss) is extracted by the higher-level program (As
) in the specific area (is), and in the lower program,
A means for notifying the start address (bs1) of the cutout area (As) is provided, and the lower-level program extracts its own work area (B) based on the start address (bs1) received from the upper-level program.
s) and compares it with the start address (bss) of the bulk acquisition area set in the above specific area (is) to check whether there is a shortage of area when cutting out the own work area (BS). Configure it as follows.

[Effect]

That is, according to the present invention, in a dynamic area acquisition method in which a lower program extracts and uses a work area that is acquired by the upper program at once, the work area is allocated to, for example, the start address area (is) of the area that the upper program has extracted. , the upper program sets the start address (bss) of the batch acquisition area, and sets the start address (bss) of the cut out area.
bs2. ...) to the lower-level program, the lower-level program can calculate the starting address (b
ss) and extracts its own work area in the direction of lower addresses, which has the effect of not causing an area overflow when a lower program acquires its own work area. be.

〔Example〕

Embodiments of the present invention will be described in detail below with reference to the drawings.

The above-mentioned FIG. 1 shows a configuration example of the dynamic area acquisition method of the present invention. bsl, bs2°-) notification means is a necessary means to implement the present invention. Note that the same reference numerals indicate the same objects throughout the drawings.

First, the higher-level program A stores, for example, the area (iS) at the start address (bs1) of its own extraction area As,
- Set the start address (bss) of the bulk acquisition area, and notify the lower program B of the start address (bs1) of the cut out area As.

Lower program B, which received the notification, expands its own work area (Bs) from the J address (bs1) toward lower addresses (that is, upward) based on the address (bs1) that received the notification. The upper limit value of that address (b
s2) and calculate the start address (
bss) and check the use of the above-mentioned bulk acquisition area.

In this way, the present invention allows the lower program to acquire its own work area from the bottom of the work area that the upper program has acquired in bulk toward lower addresses (in the upward direction), starting from the top address (BSS) of the bulk acquisition area. The special feature is that you can acquire it while referring to it.

〔Effect of the invention〕

As explained above in detail, the dynamic area acquisition method of the present invention is a dynamic area acquisition method in which a lower program cuts out and uses a work area that is acquired by a higher-level program all at once. For example, the upper program sets the start address (bss) of the batch acquisition area in the start address area (is) of the area, and the start address (bsl, bs2.-) of the extracted area.
By providing a means to notify lower-level programs,
The lower-level program starts from the address that received the notification, and performs the above-mentioned
This system recognizes the start address (bss) of the area that is acquired in bulk and cuts out its own work area in the direction of lower addresses, so when a lower program acquires its own work area, it prevents area overflow. This has the effect of eliminating the need for this to occur.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing an example of the configuration of a dynamic area acquisition method according to the present invention. FIG. 2 is a diagram illustrating a conventional dynamic area acquisition method. In the drawing, As is the work area of the upper level program. bsl is the start address of the upper program work area. Reference numeral 11 denotes an address setting area for an area that can be used next to the area cut out by the higher-level program. Bs is the work area of the lower program. bs2 is the start address of the lower program work area. is is an area where the start address of the work area acquired by the higher-level program is set. are shown respectively. Figure 1 Figure 2

Claims (1)

[Claims] A dynamic area acquisition method in which a lower program cuts out and uses a work area acquired in bulk by a higher level program, wherein the starting address (
bss) is extracted by the higher-level program (As
) in the specific area (is), and in the lower program,
Means for notifying the start address (bs1) of the cutout area (As) is provided, and the lower program cuts out its own work area based on the start address (bs1) received from the upper program, and Acquisition of dynamic area characterized by checking whether there is a shortage of area when cutting out the own work area (Bs) by comparing it with the start address (bss) of the bulk acquisition area set in is). method.