JPS63217446A - Buffer control system - Google Patents

Abstract

PURPOSE:To shorten the retrieving time for an available data area by providing the identification information for identification of an aggregate and the sequence of data independently of each other against a data area where data are stored. CONSTITUTION:The identification information 2 and 8 which identify the aggregates and the sequence of data set independently of each other against a data area 10 where data are stored. When data are processed to the area 10, the aggregates are identified by the identification information 2 for aggregates provided independently of the area 10. Then the identification information 8 for sequence of data identifies the position of the data in the aggregate and processes data. Thus it is possible to decrease the number of bits of a data pointer for a data chain and to shorten the retrieving time for an available data area. Furthermore the data processing time is shortened.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a buffer management method for managing a plurality of input data.

[Conventional technology]

When managing multiple input data, make the input data an element of each aggregate, provide an identifier that identifies this aggregate, and an identifier that identifies the order of the data as elements in the aggregate, and use these identifiers to buffer the data. The data within is managed. FIG. 2 is a block diagram showing a conventional buffer management system of this type.

In the figure, 1 is a group identifier start pointer indicating the beginning of the group identifier, 2 is a group identifier for identifying a collection of data, and 10 is a data area for storing input data.

Here, the group identifier start pointer 1, group identifier 2, and data area 10 are each provided independently.

Also, in group identifier 2, 3 is the group number,
4 is a start pointer indicating the beginning of data included in the group, 5 is an end pointer indicating the end of data included in the group, and 6 is a group identifier pointer indicating the next group identifier. 7 is a busy bit indicating whether the area for storing data is usable or not, and 11 is a data pointer indicating the next data.

In such a configuration, each aggregate is connected in a chain structure by the group identifier start pointer 1 and the group identifier pointer 6 in the group identifier 2, and the data forming the group is linked by the start pointer 4 and the end pointer 5 in the group identifier 2. The beginning and end of the data are shown, and the order of the data is shown by the data pointer 11 within the data.

Next, the operation will be explained.

First, a case will be described in which processing is performed on already stored data. Assume that the processing program is somehow notified of the group number of the data to be processed next.

The processing program uses group identifier start pointer 1
While sequentially following the group identifier pointer 6 starting from the group identifier 2 indicated by , it is checked whether the group number of the data to be processed next matches the group number 3 in the group identifier 2. If a matching group number is detected, the data indicated by start pointer 4 is processed, the address of the next data indicated by data pointer 11 is stored in start pointer 4, and the busy bit 7 of the processed data is turned off. do. This means that one piece of data has been processed and the pointer has been updated.

Next, processing when new data is input will be described. As in the case of processing data, starting from group identifier 2 indicated by group identifier start pointer 1, it is checked whether group number 3 matches the group number to which the input data belongs. If the same group number is detected, in order to secure an area for storing data, it is checked whether the busy bit 7 of the data identifier is off or not, and a usable area is searched. If data area 10 is secured, data is stored in that area, busy bit 7 is turned on, and the address of the newly stored data is stored in data pointer 11 of the data indicated by end pointer 5 and end pointer 5. . The new data is now included in the chain.

[Problem that the invention seeks to solve]

Conventional buffer management methods were performed as described above, so if you want to transfer data as is without processing it, you must delete busy bit 7 and data pointer 11, and if the data length becomes large, , data pointer 11
The problem was that the number of bits required increased. Furthermore, since the data length is not constant, there are problems such as complicated address calculations for accessing the busy bit 7 of each data.

This invention was made to solve the above-mentioned problems, and includes a data pointer 11 for data chain.
The purpose of this invention is to reduce the number of bits in the data area, thereby shortening the search time for an available data area and reducing the data processing time.

[Means for solving problems]

The buffer management method according to the present invention is characterized in that the identification information 2.8 for identifying the aggregate and identifying the order of data is provided independently for the data area 10 that stores data. There is something to do.

[Effect]

When processing data for the data area 10, the aggregate is identified according to the aggregate identification information 2 provided independently for the data area 10, and the aggregate is further identified according to the identification information 8 that identifies the order of data. Process the data by identifying the location of the data in it.

[Embodiments of the invention]

An embodiment of the present invention will be described below with reference to the drawings. 1st
The figure is a block diagram of a buffer management system showing an embodiment of the present invention.

In the figure, 1 is a group identifier start pointer indicating the beginning of a group identifier, 2 is a group identifier, 3 is a group number, 4 is a start pointer indicating the beginning of a data identifier, 5 is an end pointer indicating the end of a data identifier, and 6 is an end pointer indicating the end of a data identifier. A group identifier pointer indicating the next group identifier, 8 a data identifier, 7 a busy bit indicating whether or not the data area can be used, 9 a data identifier pointer indicating the next data identifier, 10 a data area. .

Here, the size of the data area 10 that stores one data is set to the maximum size of data that the data processing device can accept.
It is assumed that the two data identifiers 8 correspond to each other independently.

Further, the group identifier 2 and the data identifier 8 are identification information for managing data stored in the data area 10.

Next, the operation will be explained.

First, a case will be described in which processing is performed on already stored data. If the processing program is notified by some method of the group number of the data to be processed next, the processing program uses the group identifier start pointer 1.
Starting from group identifier 2 indicated by , it is sequentially searched to see if group number 3 in group identifier 2 is equal to the group number notified by the processing program. If the same group number is found, the data area 10 corresponding to the data identifier 8 indicated by the start pointer 4 is processed. then busy bit 7 in data identifier 8
off, start pointer 4 in group identifier 2
The value of the data identifier pointer 9 in the data identifier 8 that has just been processed is assigned to . This means that the processing of one piece of data has been completed, the pointer has been updated, and the data area 10 can now be used.

Next, processing when new data is input will be described. As in the case of data processing, starting from group identifier 2 indicated by group identifier start pointer 1, group number 3 is compared with the group number to which the input data belongs, and a match is searched. If the same group number is detected, in order to secure an area for storing data, the busy hit 7 in the data identifier 8 is checked to search for an available data area 10. Once the data area is secured, data is stored in that area, and the address of the data identifier 8 corresponding to the data area IO is stored in the data identifier pointer 9 of the data identifier 8 indicated by the end pointer 5 and in the end pointer 5. do. This means that new data has been incorporated into the chain.

In the above embodiment, only the busy bit 7 and the data identifier pointer 9 are provided in the data identifier 8, but the data identifier 8 may contain necessary information depending on the type of data processed by the data processing device. , the control for processing data can be simplified.

〔Effect of the invention〕

As described above, according to the present invention, the identification information for identifying an aggregate and identifying the order of data is depleted.

- Since it is provided independently from the data area that stores data, there is no need to modify the data in the data area during data transfer etc. Not affected by size, and
Since the size of the data identifier is fixed, the time required to check the busy bit and search for an available data area is also reduced.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing an embodiment of a buffer management method according to the present invention, and FIG. 2 is a block diagram showing a conventional buffer management method. In the figure, 1 is the group identifier start pointer, 2
is a group identifier, 3 is a group number, 4 is a start pointer, 5 is an end pointer, 6 is a group identifier pointer, 7 is a busy bit, 8 is a data identifier, 9 is a data identifier pointer, 10 is a data area, 11 is a data pointer It is. Note that the same reference numerals in the figures indicate the same or corresponding parts. Agent Masuo Oiwa (2 people) 20th

Claims (1)

[Claims] When inputting and managing a plurality of data, an aggregate is formed with the data as elements, and the aggregate and the order of the elements of each data constituting the aggregate are identified and the buffer is A buffer management method for managing data in a buffer is characterized in that identification information for identifying aggregates and identifying the order of data is provided independently for the data area in which data is stored. buffer management method.