JPS63273145A - Member storage system for partitively organized file - Google Patents

Abstract

PURPOSE:To attain effective utilization of a partitively organized file by providing a means comparing a record size of a member with a storage area size thereof, a means sending a storage area size including the expanded area to the comparison means and a means retrieving the storage area of the member from the output of the comparison means. CONSTITUTION:A storage location 2 of a member provided additionally with an expansion area 50 and management information 3 registering the storage area size including the expanded area size are provided to the partitively organized file 1, and a means 200 comparing the record size T1 of the revised member with the storage area size T2, means 100 sending the storage area size T2 including the expanded area 50 to the comparison means 200 and a means 300 retrieving the storage area of the member from the output of the comparison means 200 are provided. The storage area 5 provided with a size to be stored including the expanded area 50 is retrieved in response to the record size of the member read and updated from the storage area in such a way to store the updated member thereby utilizing effectively the capacity of the partitively organized file 1.

Description

[Detailed Description of the Invention] [Summary] An extended area is added to each member stored in a partitioned file, extended area information is added to management information including the address of each member, and the record size and storage area of the member are A means for comparing sizes, a means for sending a storage area size including an expanded area to the comparing means, and a means for searching a member's storage area from the output of the comparing means are provided.

[Industrial application field]

The present invention relates to a method for storing member records for partitioned files.

[Conventional technology]

A partitioned file is one way to organize a file.
It is a file format that exists on a direct access volume and consists of a storage area, which stores several independent member records, and a directory area, which contains management information regarding the storage location of each member record. .

FIG. 4 is a diagram showing an example of a conventional partitioned file.

In the figure, 1 is a segmented organization file, 2. 27 are member records, 31 to 3n are management information regarding the corresponding member records, 4 is a directory area, 4a is control information, 5 is a storage area for member record files, 10 is -≠-- name, 20 is the address,
30 is the record length.

The conventional partitioned file l is defined on the direct access memory as shown in FIG. The upper occupied area is determined.

The storage area 5 contains member records 2. ~2ゎ are stored, and member records 2. to 2ゎ are stored in the directory area 4. ~27
Management information 34-3 regarding the storage location of. , , and control information 4a indicating the total number of members are stored, respectively.

Management information 3, ~3 stored in directory area 4
As shown in Figure 4 (bl), each member record name 10
, the record length 30, and the first address 20 of the storage position in the partitioned file l.

When searching for the partitioned file 1, the directory area 4 is searched using the control information 4a, and the obtained management information 3.
From .about.31, the storage addresses of member records 2.about.27 can be known.

Member records such as this 2. The order in which files .about.2n are stored is normally stored in a sequential file format, starting from the earliest storage order.

Member records stored in a partitioned file l like this 2. ~2. Member records consisting of %, for example 2. Create a new member record by making changes to 2.1
In the conventional control method, the previous member record 2. and management information 3. , and set the address 20 and record length 30 of the new member record to the new address as management information 3. ” is written in the directory area 4. That is, when replacing a member of the partitioned file 1, the new member record is stored in a new area regardless of its size.

[Problem that the invention seeks to solve]

However, while the above control method is simple, when member records of a partitioned file l are frequently replaced, for example when developing a program, member records are written to new areas one after another, so the partition The apparent free space at the top of the organization file l is rapidly decreasing.

In this case, conventionally a compression operation was performed to expand the free space.

Compression operation refers to member records 2. once stored in partitioned file l. 27 to a magnetic tape, etc., and then put them back into the partitioned file l, and each member record 2. ~2, tube F11ml! I3. This is an operation to modify 37. By performing this compression operation, the margin area is removed, so the usable area is reduced.

However, since this compression operation is complicated, there is a problem in that in order to reduce the frequency of compression operations, the capacity of the segmented file l must be made larger than necessary.

[Means for solving problems]

As shown in the principle diagram of FIG. 1, the above problem lies in the member storage method of the partitioned file l in which variable-length member storage areas 5 are managed by the directory area 4, and an extension area 50 is attached to each member. a means 200 for preparing the main organization file l and comparing the record size T1 of the updated member with the storage area size T2;
This problem can be solved by providing means 100 for sending the storage area size T2 including the storage area size T2 to the comparing means 200, and means 300 for searching the member's storage area from the output of the comparing means 200.

[Effect]

According to the present invention, in accordance with the record size of the updated member read from the storage area, a storage area having a size capable of storing the updated member including the expansion area 50 is searched to store the updated member. So partitioned file l
capacity can be used effectively.

〔Example〕

FIG. 2 is a block diagram of a configuration according to an embodiment of the present invention.

FIG. 3 is an explanatory diagram of the present invention.

In the figure, 40 is extension area information, 50 is an extension area, 100 is a data length setting circuit (sending means), 150 is a counter,
200 is a comparison circuit (comparison means), 250 is a flag sent, 300 is a storage address search circuit (search means), 35
0 is a memory write circuit.

In the present invention, as shown in FIG. 3, extension area information 40 indicating the usage status of the extension area 50 is added to the conventional management information 3.

After reading and processing an arbitrary member stored in the partitioned file 1, when returning it to the partitioned file 1 again, the following operations are performed.

In the case of north and south, the record size TI after processing is different from the record size T2 before processing.

When activated, counter 150 and flag set 25
0 is reset together.

(A) The updated member record size T1 is input to the comparison circuit 200. The data length setting time aioo accesses the directory area 4, checks the original storage address of the input member, and determines the size T of the storage area.
2 is input to the comparison circuit 200. The comparison circuit 200 receives two input values T I .

Compare T2.

(1) If the relationship T1≦T1 holds between the record size T1 of the updated member and the storage area T2,
The OKK signal is notified to the storage address search circuit 300, and since the signal from the flag set 250 is “0”, the storage address search circuit 300 reads the storage area by accessing the directory area 4, and notifies the memory write circuit 350. and stores the updated member in the storage area of the address. The expansion area 50 is not rewritten at the north-south stage.

(2) On the other hand, if the relationship TI>TI is established between the record size T1 of the updated member and the storage area T2, the comparison circuit 200 sends an NG signal to the counter 150. Upon receiving the NG signal, the counter 150 counts up by +1, inputs the count value f to the flag set 250, and notifies the data length setting circuit 100.

(B) Upon receiving this notification, the data length setting circuit 100 accesses the directory area 4 again, reads out the length of the aforementioned storage area including the extension area 50, and inputs it to the comparison circuit 200 as T2. .

Comparison circuit 200 compares the two input values T1 and T2, and if T1≦T1, notifies OKK signal storage address search circuit 300, and if TI>Tl, sends an NG signal to counter 150.

(3) Storage address search circuit 30 that received the OK signal
Since 0 receives the "1" signal from the flag center 250, it accesses the directory area 4, reads the storage area including the extension area 50 of the storage area, and notifies the memory write circuit 350 to extend the address. The updated member is stored in a storage area including area 50. Next is expansion MM5
Write to 0.

(The counter 150 that received the 41NG signal increments the count by +1, and sets the count value f to the flag 250.)
The data length setting circuit 100 is notified at the same time.

(B) Upon receiving this notification, the data length setting circuit 100 accesses the directory area 4 again, reads out the length of the aforementioned storage area including the extension area 50, and inputs it to the comparison circuit 200 as T2. .

Comparison circuit 200 compares the two input values T1 and T2, and if TI≦T1, it notifies OK multiple signal storage address search circuit 300, and if Tl>Tl, sends an NG signal to counter 150.

(3) The above procedure is repeated until the storage area of the updated member can be detected. The unused storage area, including the expansion area 50, is made to have a longer area size than the storage area in use.

〔Effect of the invention〕

As explained in detail above, according to the present invention, it is possible to effectively utilize a partitioned file, and the number of times compression operations are performed is greatly reduced, which has the great effect of making the operation of partitioned files easier.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing the principle of the present invention. FIG. 2 is a block diagram of a configuration according to an embodiment of the present invention. FIG. 3 is an explanatory diagram of the present invention. FIG. 4 is a diagram showing an example of a conventional partitioned file. In the figure, 1 is a partitioned file, 2a to 2o are member records, and 31 to 3. , are management information regarding the corresponding member records, 4 is a directory area, 4a is control information, 5 is a member record storage area, IO is a member name, 20 is an address, 30 is a record length, 40 is extended area information, 50 100 is an expansion area, 100 is a data length setting circuit, 150 is a counter, 200 is a comparison circuit, 250 is a flag sent, 300 is a storage address search circuit, 350
is a memory write circuit. Ryoriguchi Sen of the present invention 1 Kuni Sai and 13 months Isshobo Basu rJt 2, tb Toko, i Sua D
Tsufuzu 1000 2 The son of the evil pakist, Gushu 3 Kuni

Claims (1)

[Claims] A member storage method for a partitioned file (1) in which variable-length member storage areas (5) are managed by directory areas (4), each of which is provided with an extension area (50). The storage location (2) of the member and the management information (3) in which the storage area size (T2) including the size of the expansion area (50) is registered are provided in the partitioned file (1), and the record of the member is provided. Means (200) for comparing the size (T1) and the storage area size (T2), and means (100) for sending the storage area size (T2) including the expansion area (50) to the comparing means (200). and means (300) for searching the storage area of the member from the output of the comparison means (200), and the expansion area is searched according to the record size (T1) of the member read from the storage area and updated. (50) A member storage method for a partitioned file, characterized in that a storage area having a size that can store the file including the updated member is searched and an updated member is stored.