JPS6319051A - Memory acquiring system - Google Patents

Abstract

PURPOSE:To display the success, or the failure of area acquisition on a large memory device, and also, on a logging damp, or an output device, at time of a testing, or a fault analyzing, by recording the success, or the failure of the area acquisition on a bit map table, at the time of acquiring an area. CONSTITUTION:The bit map table BMT in which a bit representing the availability of the area corresponding to a unit area 20 is arranged, a history bit table NBT which records the acquisition history of the unit area 20, and an assign point AP which points out the bit position of the bit map table BMT, are provided in a memory 5 in which plural unit areas 20 having prescribed size lengths are bundled. And by acquiring the unit area 20, and also, setting the display of the bit in use in the bit map table BMT, when the bit in nonuse in the bit map table BMT is displayed, the availability of the area of the memory 5, and the acquisition history are recorded.

Description

[Detailed description of the invention] 【overview】

The present invention relates to a dynamic memory acquisition control method, and particularly to a memory acquisition method in which a bitmap table is used cyclically to acquire memory areas of the same size, and the acquisition history at that time is recorded in a history bit table. be.

[Prior art]

Conventionally, three types of control as shown in Fig. 4 (a, b, c) have been performed when a unit area is individually occupied for a memory area made up of a plurality of memory unit areas of the same size. Ta. The control method of FIG. 4 fal prepares a unit area control block (ICl3) that points out an unused unit area with a pointer (p), and this unit area control block (
ICl3) to free unit area queue terminal (10)
Connect with the connection pointer (q). When a request to use a unit area occurs, the unit area control block (11, 12) connected to the free unit area queue by the connection pointer (q) acquires the desired unit area from the head position and fills the free unit area queue. This is a queue management method that allows users to leave the queue. The control method shown in FIG. 4 fbl uses a bitmap table BMT prepared according to the number of unit areas.
The free area from a predetermined bit position of T is searched by moving the assignment pointer, and the unused unit area position,
(For example, when searching from the lowest position, use the 6th bit position)
This is a control method in which when the assignment pointer AP reaches the bit position (sixth bit position), an area acquisition indication is displayed at the corresponding bit position (sixth bit position). The control method shown in FIG. 4C is a control method in which the search for the assignment pointer AP in the bit map table BMT shown in FIG.

[Problems to be Solved by the Invention] The above three types of control methods all have advantages and disadvantages. That is, the queue management method using the first queue terminal requires individual pointer blocks, ie, unit area control blocks, for connecting to free queues, which has the disadvantage of increasing the area for control. In addition, in the control method using the second bitmap table, the search start position of the assignment pointer on the bitmap table is always fixed (lowest or highest), so There is also the disadvantage that an uneven memory usage distribution occurs, such that the unit area of the queue is frequently used.Furthermore, in the third control method using the bitmap table, the control area increases due to the first queue management method. Although the second control method solves the problem of non-uniform usage of areas and large overheating, it is unclear in what order unit areas are occupied due to request generation, and Even when trying to find out the size of the area required for the response, there was the inconvenience that no information remained. [Means for solving the problem] The present invention aims to solve the above problem. The configuration consists of a memory (5) containing a plurality of unit areas (20) of a predetermined length, and a bitmap table (BHT) in which bits are arranged to indicate the usage status of the area corresponding to the unit areas (20). A history bit table (NBT) that records the acquisition history of the unit area (20) and an assignment pointer (AP) that points out the bit position of the bitmap table (BHT) are provided. [Operation] The above configuration. Since the bitmap table (BH
Assign pointer (AP) that points to the bit position of T
) is used to cyclically search the focus contents of the bitmap table (BHT), and if a bit in the bitmap table (BHT) is indicated as being in use, the corresponding bit in the history bit table (NBT) is searched. If the bits in the bitmap table (BMT) are marked as unoccupied and the bits in the bitmap table (BMT) are marked as unused, the unit area (20) is acquired and the bits in the bitmap table (BHT) are marked as in use. As a result, the usage status and acquisition history of the memory (5) area are recorded.

【Example】

Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a system configuration diagram of the present invention, and FIG. 2 is a state explanatory diagram of the present invention. FIG. Fig. 3 is a flowchart explaining the operation.In the figure, 1 is a control unit CPU that includes an assignment pointer control unit 18 and a bit comparison unit IB, 2 is a storage device, and 3 is a control unit CPU.
4 is a large storage device, 4 is an output device, 5 is a memory, 20 is a unit area, AP is an assignment pointer, BMT is a bitmap table, and NBT is a history bisot table. In the following explanation, the unit area in the memory 5 will be explained in terms of addresses O to 9. The control unit 1 shown in FIG. 1 executes the operation procedure shown in the flowchart shown in FIG. ), a bitmap table BMT and a history bit table NBT are stored in the large storage device 3.
is for logging, and the output device 4 is used for display or printout. In addition, in FIG. 2, in the area 20 in the memory 5, the white area indicates an unused area, the diagonal line indicates an area in use, and "1" in the bitmap table BMT indicates that the corresponding area 20 is in use. "0" indicates that the corresponding area 20 is unused. Also, bitmap table B
“1” in the history bit table NBT which has the same size as MT indicates that the area 20 could not be acquired (failure) because the hit in the corresponding bitmap table BMT is “1”; This indicates that the acquisition was successful. Therefore, in FIG. 2 (al) at the time of area request generation, the area 20 in use in the memory 5 is ro, 1.3 to 6, 9, and the unused area 20 is ro, 2, 7, 8. ". Since the usage state of this area 20 is reflected in the bitmap table BMT, the on/off state of the bit is rllo
llllool”. Furthermore, since the state of the history bit table NBT at this time is ro 001000100J, this indicates that r3 and 7J in the area 20 failed to be acquired last time. Further, the arrow in the bitmap table BMT indicates the assignment pointer AP, which currently points to "address 5" in the area 20. Next, when a request to use an area occurs, the assignment pointer AP starts searching from the current "5" position of the bitmap table BMT, for example, in the lower (increasing address) direction.
Thereafter, the search is performed cyclically until a free area is found. FIG. 2 (bl indicates that the free area 20 has been acquired at "address 7", and the assignment pointer ΔP has moved to "8". Therefore, in the area 20 of the memory 5, the double diagonal shaded area has been acquired this time. , bit map table BMT changes bit "7" from off to on and rl 101111101J
So, the history bit table NBT is rooololl
oooj, which means that r5, 6J failed and "7" succeeded. The above operation will be explained with reference to the flowchart of FIG. 3 performed by the control section 1. When a request to use an area is generated, (1) Search is started from the current assignment pointer AP position "5". (2) Assign pointer AP is bitmap table B
It is checked whether one cycle of MT has been completed, and if YES, the process branches to error processing (5). (3) If the bit at the position pointed to by the assignment pointer AP is on, the process branches to step (4); if it is off, the process branches to step (6). (4) Turn on the bit in the history bit table NBT, advance the assignment pointer AP by 1, and then repeat (2)
Return to processing. (5) Error end/WAIT (6) Turn off the bit of the history bit table NBT, turn on the focus of the bit map table BMT,
The corresponding area 20 is acquired. In the above explanation, only one history bit table NBT was prepared, but the present invention also includes the preparation of a plurality of these, and by doing so, it is possible to keep a deeper history of area acquisition. Become.

【Effect of the invention】

As explained above, when acquiring an area, the success or failure of acquiring the area can be recorded as a history without using much memory. It can be displayed as a simple memory log and can be used as a tool. In addition, since the results of area acquisition success/failure remain for one round, it can be used for area management (for example, calculating the area acquisition success rate at regular intervals, and tuning control such as increasing the area if the probability is below a certain probability). Therefore, it is possible to easily plan a memory increase during software development and design, design tasks that can run simultaneously, etc.

[Brief explanation of the drawing]

FIG. 1 is a configuration diagram of the system of the present invention, and FIG. 2 is a state diagram of the present invention. state diagram,
FIG. 3 is a flowchart explaining the operation, and FIG. 4 is a diagram explaining area occupancy, which is a conventional technology of the area occupancy method. In the figure, 1 is a control unit (CPU), IA is a pointer control unit, 1B is a comparison unit, is a storage device, 3 is a large storage device, 4 is an output device, 5 is a memory, 20 is a unit area, y is an assignment pointer, BM
T is a bitmap table and NBT is a history bit table. Honsan s'Ff's system clearing Kunihiro 1 mouth P 几NE3T times o+oooqoo] HB7, t-Wabi 5
Moon's entry ゛璽叉゛1日拒 ztJ AP' run in 'n (γ1 BFJ's flow chart binding '3flJ B/''4A -・?P Follow us @. Request for support @. n arithmetic 4 country

Claims (1)

[Claims] A bitmap table that is an area acquisition method for a memory (5) that is configured by combining a plurality of unit areas (20) of a predetermined length, and in which bits that indicate the usage status of the area are arranged corresponding to the unit areas (20). (BMT) and the unit area (2
A history bit table (NBT) that records the acquisition history of
), and cyclically searches the bit contents of the bitmap table (BMT) with an assignment pointer (AP) pointing to the bit position of the bitmap table (BHT),
When a bit in the bitmap table (BMT) is indicated as being in use, the corresponding bit in the history bit table (NBT) is recorded as non-occupied, and the bit in the bitmap table (BMT) is If there is an indication that it is not in use, acquire the unit area (20) and set the bit in the bitmap table (BMT) to indicate that it is in use, thereby recording the usage status and acquisition history of the memory (5) area. A memory acquisition method characterized by the following.