JPS58164080A - System for managing and processing area - Google Patents

Abstract

PURPOSE:To quickly perform area management, by installing an area managing table whose storage area is divided into cells having a corresponding entry to each cell, and setting assigned information and information regarding the number of continuous vacant cells in the table, and performing the assignment and release of the storage area in referring to and updating the table. CONSTITUTION:A storage area for assignment 1 as a common area on a memory 11 is managed after it is divided into cells 2-1-n of a prescribed size. An area managing table 16 is installed separately from the storage area 1 and the table 16 has entries corresponding to the cells 2-1-n of a number equal to the number of the cells 2-1-n. One type, for example, is assigned to each entry and assigned information or information regarding the number of continuous cells of each corresponding cell is plated in each entry. In this way, the assignment and releasing processing of the area are performed simply and quickly.

Description

DETAILED DESCRIPTION OF THE INVENTION (1) Technical Field of the Invention The present invention relates to an area management processing method, and particularly to an area management processing method that dynamically allocates or releases a storage area in a data processing system by dividing it into cells. be.

(2) Technical Background In order to make effective use of memory in data processing systems, work areas for temporary use by various processing entities are carved out each time from storage areas reserved in advance. Dynamic allocation is being done. In this way, the area will be allocated only when it is needed, so the storage area will be used more efficiently than if it were allocated statically from the beginning. In this case, it is desired that the area allocation or release processing be performed simply and quickly.

(8) Prior Art and Problems Conventionally, when managing the area to be dynamically extracted and allocated as described above, a chaining method, a mapping method, or a combination of these methods have been used.

FIG. 1 shows an example of a conventional method. In particular, FIG. 1(A) shows an example of an area management method based on a chaining method, and the reference numeral 1
is a storage area for allocation, 2-1 to 2-n are cells, 3
is the empty cell queue terminal, and 4-1 to 4-3 are the empty cell pointers.

In FIG. 1(A), the storage area l for allocation consists of cells 2-1 to 2-n, which are the minimum units for allocation requests.
It is divided into and managed. Unallocated empty cell 2-2.2
Empty cell pointer sections 4-1, 4-2, etc. are provided in each of -3, etc., and each empty cell is chained and pointed to from the empty cell queue terminal 3 provided at a specific position. Ru. When a request for cell allocation is made, the pointer is followed from the queue terminal 3 of this empty cell, the address of the empty cell 2-3 etc. is obtained, it is delivered to the requester, and the allocated cell is removed from the chain as allocated. . When the allocated cell is released and returned after being used, it is added to the chain from the empty cell queue terminal 3 again. In the chaining method described above, not only the chaining process is complicated, but also the process of allocating a plurality of consecutive cells is difficult. In the case of the chaining method, each cell does not necessarily have to be the same size, but even in that case, the disadvantage is that the process of regrouping the released cells into larger cells is complicated. Ta.

FIG. 1(B) shows an example of a conventional mapping method.

The storage area l is similarly divided into cells 2-1 to 2-n and managed, but each cell 2-1 to 2-rL is provided with a mapping table 5 for each cell 0, which is always set to the same size. In the mapping table 5, each cell 2
-1, 2-2, ..., display section 6-1.6- indicating whether those cells have been allocated or not.
2,... are provided.

Each of the display sections 6-1 and the like may each have one bit, and for example, the bit value is set to "0" for an allocated cell, and the bit value is set to "1" for an empty cell.
The storage area l will be managed based on this information. Even with this method, the process of searching and allocating the required number of consecutive fc"! cells based on the mapping table 5 is complicated, and the processing time is long. The same applies to a method in which both are used together.

(4) Purpose of the Invention The purpose of the present invention is to solve the above-mentioned problems and provide a simple and quick area management processing method.

(5) Structure of the Invention In order to achieve the above object, the present invention further improves and develops the conventional mapping method described above so that the number of consecutive empty cells and their positions can be immediately determined at the time of area allocation. That is, the area management processing method of the present invention divides the storage area in the data processing system into cells of a predetermined size, and allocates continuous areas for the number of cells requested by the area requestor. In the area management processing power formula that manages the storage area by executing the release process, an area management table having entries L-IJ corresponding to each of the divided cells is provided, and each entry is If the corresponding above-mentioned cell has been allocated, allocated information is set, and if the corresponding above-mentioned cell is empty, continuous empty cell number information indicating the number of continuous empty cells including the corresponding cell is set. The present invention is characterized in that by referring to and updating the area management table, allocation or release processing of an arbitrary number of cells in the storage area is performed.

(6) Embodiments of the invention will be described below with reference to the drawings. FIG. 2 shows the configuration of an embodiment of the present invention, FIG. 3 is an explanatory diagram of the processing of the allocation processing section, and FIG. 4 is a diagram of the processing of the release processing section.

In the figure, numerals 1 and 2-1 to 'l-n correspond to those in FIG. 1, IO is a data processing device, 11 is a memory, 12 is an area requesting unit, 13 is an area management unit, 14 is an allocation processing unit, 1
Reference numeral 5 represents a release processing unit, 16 represents an area management table, and 17-1 to 17-1 represent each entry of the area management table 16.

In FIG. 2, a data processing device 10 is a device that fetches and executes sequential instructions. The area requesting unit 12 executes data processing desired by the user under the control of the data processing device 10. In order to dynamically secure a work area during data processing, the area requesting unit 12 requests an area of a desired size. request allocation of space and free the allocated space after use (
return. The area management unit 13 centrally manages areas dynamically requested by the area request unit 12, and in particular, the allocation processing unit 14 executes processing for area allocation requests, and the release processing unit 13 executes processing for area allocation requests. 15 performs a process of returning the allocated area to an empty area.

Storage area l for allocation as a common area of memory 11-hi
For example, cells 2-1 to 2-1 of a predetermined size every 16 bytes
It is divided into 2-n and managed. Each cell 2-1 to 2-n
The size of is not limited to 16 bytes and may be any size, but if it is set to 16 bytes, for example, allocation is done for each cell, so the minimum unit of allocation is 16 bytes.

First, all cells are made to have the same size.

An area management table 16 is provided separately from the storage area l. The area management table 16 includes cells 2-1 to 2 of storage area 1.
Entries 17-1 to 17-1 corresponding to 2-n and equal to the number of cells
17 to n. Each en) IJ l 7-1, etc.
For example, one byte is allocated to each cell, and the allocated information or the number of continuous empty cells information of the corresponding cell is stored. Assigned information is given, for example, by a numerical value of O, and if the end I
If the contents of J l 7-1 to 17-n are 0, the corresponding cells 2-1 to 2-2 of storage area 1 have been allocated and are not reserved and used by any of the area requesting units 12. Indicates that For example, when the corresponding cell is unallocated and empty, the information on the number of consecutive empty cells is given as a numerical value indicating how many consecutive empty cells exist before and after the corresponding cell.

In the example shown in FIG. 2, cells 2-1 to 2-3-i: are empty, and the corresponding entries 17-1 to 17-3 have 3 consecutive empty cells. , 0 cells 2-4, in which the numerical value "3" is stored as information on the number of continuous empty cells, have already been allocated, so the end IJ l
A numerical value rOJ, which is allocated information, is stored in 7-4. The same applies to the following entries 17-5 to 17-rL. 0 As mentioned above, the area management table 16 holds information on the number of consecutive empty cells when the cell is empty. Unlike the simple mapping method shown in Figure (B), no complicated processing is required when allocating a plurality of consecutive cells.

Next, the allocation processing by the allocation processing unit 14 will be explained according to FIG. The allocation processing unit 14 is the area requesting unit 1
2, and first points to the beginning of the area management table 16 with an internal pointer by the process 20 shown in FIG. Next, in step 21, an entry in the area management table 16 whose value is not "0", that is, an empty cell entry is searched. This process 2
1 is an existing well-known machine instruction Tl-14, for example.
By using the '(TRANSLATE AND TE8T) instruction, it can be executed in one step.

The TRT instruction notifies the position and contents of a non-zero byte in a specified conversion table based on the contents of the first operand. As a result of processing 22, if the value is not 10) I
Determine whether J is found.

When using the above TRT instruction, it is sufficient to determine the condition code. If there is no entry whose value is not "O", there is no empty cell, so an error return code is set in step 25 and an error return is made.

If an entry whose value is not rOJ is found in process 22, it is determined in process 23 whether the value of that entry, that is, the number of consecutive empty cells, is greater than or equal to the number of requested cells for which an allocation request has been made. If the number of consecutive vacant cells is smaller than the number of requested cells, the requested consecutive cells cannot be allocated, so in step 24, the pointer to the area management table 16 is set to point after the checked entry position. , and return to process 21 again.
Repeat the process in the same way.

If the determination result in process 230 is YES, process 26
, determines the cells to be allocated, and sets "0" as allocated information in the entries corresponding to those cells. Next, in process 27, the number of allocated cells is subtracted from the number of continuous empty cells, and in process 28, the subtraction result is set to 0 in the entries of the remaining 9 continuous empty cells.
In process 29, a normal return code and the address of the assigned cell are set and the area requesting unit 12 is notified.The 0 release processing unit 15 performs the process as shown in FIG.

When the release processing unit 15 is activated by a used cell release request from the area requesting unit 12, the release processing unit 15 performs the following steps.
First, a process 30 shown in FIG. 4 points to an entry in the area management table 16 corresponding to the released cell using an internal pointer. Next, a process 31 determines whether the previous cell adjacent to the released cell is empty. Determine. If it is not empty, control is transferred to process 34. If it is empty, in process 32 the number of consecutive empty cells held by the previous cell entry is added to the number of released cells, and in process 33, the first entry of the continuous empty cells before the internal pointer is added. Update to point to .

Next, in process 34, it is determined whether the cell after the released cell is an empty cell. If the cell is not an empty cell, the process proceeds to step 36, and if it is an empty cell, the subsequent number of consecutive empty cells is added to the number of released cells in step 35. Finally, process 3
6, the corrected number of released cells is set in each entry by the length of the number of released cells from the entry indicated by the internal pointer. As a result, the continuous empty cell number information is set in the new continuous empty cell entry. Furthermore, the storage area l to be allocated above does not necessarily have to be fixed, and may be an area dynamically acquired by the area management unit 13 from a system common area, etc., for example. In this case, the area management table 16 will also be dynamically generated.

(2) As described in detail, according to the present invention, area allocation and release processing can be performed easily and quickly. In particular, it is possible to efficiently allocate and release a relatively small continuous area. Note that it is also possible to release the entire allocated storage area to the system.

[Brief explanation of drawings]

1 shows an example of the conventional system, FIG. 2 shows the configuration of an embodiment of the present invention, FIG. 3 shows an explanatory diagram of the processing of the allocation processing section, and FIG. 4 shows an explanatory diagram of the processing of the release processing section. l is storage area, 2-1
~2-rL is a cell, 11 is a memo IJ, 14 is an allocation processing unit, 15 is a release processing unit, 16 is an area management table, 17
-1 to 17- indicates entry 0 3-52

Claims (1)

[Claims] The storage area in the data processing system is divided into cells of a predetermined size, allocating continuous areas for the number of cells requested by the area requester, and releasing the storage area. In the area management processing method that performs management, an area management table having entries corresponding to each of the divided cells is provided, and allocated information is set in each entry if the corresponding cell has been allocated. In addition, if the corresponding cell is empty, the configuration is configured to set continuous empty cell number information indicating the number of consecutive empty cells including the corresponding cell, and by referring to and updating the area management table, the above An area management processing method characterized in that an area for an arbitrary number of cells is allocated or released in a storage area.