JP3019104B2 - File processing device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Summary] The present invention relates to a file processing apparatus that reads out and processes individual record contents from a data file in which record contents are randomly described at arbitrary record positions. For the purpose of efficient execution, for example, a memory file that can randomly access the contents from a data file that stores the contents such as the number of records or the description position is undefined such as a source program
The data is transcribed to a table or the like, and access is made from the memory table or the like.

[Industrial applications]

The present invention relates to a file processing apparatus that reads out and processes individual record contents from a data file in which record contents are randomly described at arbitrary record positions.

For example, in the case of a source program, the number of records is indefinite and the position of the content description is indefinite.
Reading and analyzing individual records from a data file storing such data is performed.

[Conventional technology]

In the case of a source program, for example, as shown in FIG. 3, a CALL instruction may be described on the procedure section 13 on the data file 1 and a parameter may be described on the work area 12.

By accessing such data file 1, A
Finds the subroutine name specified in the subroutine name of the CALL instruction and searches the work area for the item specified by the first parameter XX of the CALL instruction. Considering the case of reading, the following processing is performed. FIG. 4 shows a conventional processing flowchart.

A first data file open is performed to search the procedure section 13.

After skipping until the procedure unit 13 appears, A
Is searched for a description of a CALL instruction (record γ in the case of FIG. 3) in which the subroutine CALL is called.

When the search by the procedure unit 13 is completed, the first data file close is performed.

Next, based on the contents of the record γ, the work area 12
To search for parameter xx from above, the second data
Open a file.

After skipping until the work area 12 appears,
Searches the item definition of the item specified by the parameter xx. In the case shown in FIG. 3, the contents of the record q are read.

When the search of the work area 12 is completed, the second data file close is performed.

Hereinafter, similarly, the process of searching for the required CALL instruction is repeated as described above.

[Problems to be solved by the invention]

In the conventional case, the opening and closing of the data file 1 are repeated as described with reference to FIG. This is, in data file 1,
For example, after searching for the procedure unit 13 located at the rear position,
This is because the work area 12 located at the front position cannot be continuously searched without performing the first closing and the second opening.

An object of the present invention is to efficiently execute access to a data file as described above.

[Means for solving the problem]

FIG. 1 shows a principle configuration diagram of the present invention. In the figure, 1 is a data file, 2 is an access routine processing unit, 3 is a randomly accessible memory table, 4 is a randomly accessible random access file, and 5 is a user access memory.
Represents a program.

The memory table 3 is transferred and stored in the record unit from the data file 1 in a sequential or predetermined manner. At this time, access
The routine processing unit 2 stores the storage position of the head record of the part corresponding to the work area 12 and the storage position of the head record of the part corresponding to the procedure unit 13 in the data file 1.

If a record exceeding the capacity of the memory table 3 exists in the data file 1, the remainder is the random access file 4 that can be accessed randomly.
Is transferred to and stored. Then, the head position of a delimiter such as the procedure unit 13 is stored. As the random access file 4, a file that can be directly accessed by a key such as VSAM may be used. As a key, for example, in the case of a source program, a sequence number can be used, and in the case of general data, a relative record number from the beginning can be used. As an access method, forward access, random access, and reverse access are made possible.

(Operation)

When the user program 5 accesses, the initialization is first performed, and thereafter, as needed, a place where the record is transcribed in the procedure section 13 and a place where the work area 12 is transcribed are appropriately searched. And finally, it ends. During this time, the random access file 4 may be accessed as needed.

〔Example〕

FIG. 2 shows an access processing flow in the case of the present invention. The flow shown in FIG. 2 corresponds to the conventional processing flow shown in FIG.

'The user program 5 initializes the access routine processing unit 2.

'Specify the start position of the procedure unit 13 by a key (write the start position to the key).

'Search the subroutine CALLA in the procedure section 13 and read and hold the first parameter.

'When the search for the procedure section 13 is completed in this way, the start position of the work area 12 is designated by a key.

'A search is made from the work area 12 as to whether there is an item of the first parameter. Then read the contents if any.

'When the search for the work area 12 is completed, an instruction to terminate the processing in the access routine processing unit 2 is issued.

It should be noted that whether to access the memory table 3 or the random access file 4 is determined by
It may be considered that an interface routine (not shown) makes the determination.

〔The invention's effect〕

As described above, according to the present invention, an arbitrary record can be accessed any number of times by appropriately specifying a key in a process corresponding to a set of open and close operations in the conventional case. Becomes As for the access method, forward access, random access, and reverse access are also permitted, so that processing efficiency can be improved.

In particular, when accessing files such as COBOL sources, the first record position in the work area and the first record position in the Procedure Division are stored in advance when expanded in the memory table, etc., greatly improving processing efficiency. can do.

[Brief description of the drawings]

FIG. 1 is a block diagram showing the principle of the present invention, FIG. 2 is an access processing flow in the case of the present invention, FIG. 3 is an example of a data file, and FIG. In the figure, 1 is a data file, 2 is an access routine processing unit, 3 is a memory table, 4 is a random access file, and 5 is a user program.

Claims (1)

(57) [Claims] 1. An access control method for a data file stored in an external storage device of a format in which an area located at a front position cannot be searched without performing a first closing and a second opening. In response to a request from a user program, a record in the data file is read, a storage location of a record corresponding to a key is stored and stored in a main storage device. Means for storing the contents in an external storage device in a random accessible file format; and, in response to a reference request from a user program, the corresponding record in the main storage device or an external storage device stored in a random accessible file format. A file processing apparatus, comprising: means for further searching.