JPH0644232B2 - Multiple data storage area allocation method with forward and backward nesting structure - Google Patents

Description

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data processing system, and more particularly to a storage area allocation processing method for a plurality of data having a front and rear nested structure.

[Prior art]

For example, in many cases, a program has a so-called nested structure, which refers to data at a location (storage position) in another predetermined range as data to be used. In this case, when allocating the sequential data to the storage area, it is necessary to solve the nesting of the data and calculate and substitute the length of the range of the location actually referred to.

FIG. 2 shows an example of a program that refers to data having such a nested structure. However, although the location is assigned in this example, this location is the final value and the method is used to resolve this location. In this example, the element of the location 100 refers to the location range from A to B, and the length of the location is calculated by (BA). However, the length (BA) cannot be determined in the first stage because the elements of location 300 have an uncertain nesting (DC) in that stage in (BA). So the nesting length of the element at location 300 (D-
C) is calculated and the total length of (B-A) is determined based on this. When the data length including the nest is determined in this way, the data can be sequentially allocated from the beginning to the storage area.

FIG. 3 shows an example of a data string having a more complicated forward and backward nested structure, and FIG. 4 shows the conventional storage area allocation processing.

In FIG. 3, the solid line shows one location sequence corresponding to the data sequence, divided for convenience of explanation.
i), ii), and iii) respectively represent solid line connecting portions. Further, the triangle mark indicates a location whose length is undetermined due to the nesting, and the two dotted lines emanating from the triangle mark location indicate the range of other nesting locations. It should be noted that the locations marked with Δ are marked with the numbers 1 to 3 as markers.

FIG. 4 shows the numbers of the undetermined locations where nesting is resolved for each scan by repeatedly scanning the data string of FIG. 3 in the forward direction indicated by the arrow. That is, the first
The second scan can only resolve location nesting. The second time, nesting of locations can be resolved.
This is because the location included in the range referred to by the location has already been determined in length in the first scan. But other pending locations ...
The nesting length of both, and remains indeterminate. In the next third scan, nesting with locations is resolved, and in the fourth, locations are resolved,
The fifth time the location resolves, and the sixth time the last location resolves.

As described above, according to the conventional method, in the example of FIG. 3 including the case where the nests are present in the front and the rear, it is necessary to perform six scans until all the locations are determined and the storage areas can be allocated. .

[Problems to be solved by the invention]

In the conventional method, the more complicated the structure in which data nests exist in the front and the rear, the more time and effort it takes to allocate such a data string to the storage area, resulting in a problem of reduced processing efficiency. The present invention aims to solve this problem.

[Means for solving problems]

According to the present invention, in order to speed up the process of allocating a storage area for a plurality of data having forward and backward nested structures, forward scanning is effective if a location to be nested at a certain location is located in front of it, while the other is nested. Focusing on the fact that the backward scan is effective if the location that becomes the backward position is effective, the nest can be solved by one scan by alternately repeating the backward scan and the forward scan for the backward resolution. The data processing system is configured to store a plurality of data arranged in element order including a forward and backward nesting structure and the determined data length in the data processing system. The first means and the data array held by the first means are scanned in the reverse direction or the forward direction of the array according to the instruction, and the data having the nested structure The second means for writing the data as the data length of the data into the first means and the second means are instructed by solving nesting only for possible data to determine the undecided data length. , A third means for alternately executing the backward scan and the forward scan until the data nesting structures are all resolved and the data lengths of all the data are determined. It is characterized by allocating storage areas in order of location.

〔Example〕

 Hereinafter, details of the present invention will be described according to examples.

First, FIG. 5 shows a storage area allocation process when the method of the present invention is applied to the data string illustrated in FIG.

In FIG. 5, the first scan is a backward scan, and nesting of locations ,, can be resolved. The second time is a forward scan, where location nesting can be resolved. The third time is the backward scan again, and the nesting of locations ,, is resolved, and all the locations are fixed. The next fourth time is forward scanning, but at this time, storage areas are allocated in order from the beginning location.

As described above, according to the method of the present invention, the number of scans can be significantly reduced as compared with the case of the conventional method shown in FIG.

FIG. 1 is a block diagram of a system according to an embodiment of the present invention, and FIG. 6 is a processing flow chart thereof. In FIG. 1, 1 is a processing data storage unit, 2 is a length determination processing unit, 3 is a control unit, 4
Is a memory fishing season assignment processing unit, and 5 is a result data storage unit. Next, the operation function of the embodiment system of FIG. 1 will be described with reference to the processing flow chart of FIG.

The processed data storage unit 1 stores the element name and the "length" of the data.
A flag ("0" = determined) indicating whether or not has been determined, "length", and each data area are provided. In the illustrated example, the elements A and B have a nested structure that refers to other locations (B1-A1) and (D1-C1), respectively, and the length is undecided.
1 and B2 have already been determined as having a length of 4 bytes.

The length determination processing unit 2 scans the processed data storage unit 1 in the reverse direction or in the forward direction, and sequentially takes out elements whose locations are uncertain because they are data elements having a nested structure. The "length", which is the difference between the nesting locations, is calculated and written in the length area of the processing data storage unit 1, and at the same time, the flag is set to "1" to display the determined. Whether the scanning is performed in the reverse direction or the forward direction depends on the instruction from the control unit 3. Further, the length determination processing unit 2 notifies the control unit 3 every time the scanning is completed once.

In response to the notification from the length determination processing unit 2, the control unit 3 requests the storage area allocation processing unit 4 to perform processing at the end of the backward scanning, and causes the storage area allocation to be performed for possible storage areas (see FIG. 6). ).

The storage area allocation processing unit 4 reads "length" and data for each element from the processed data storage unit 1, and allocates a storage area or location of a size indicated by "length" to the data for each element. , In the result data storage unit 5. However, if there is an unsolved element in the processed data storage unit 1, the control unit 3 is notified to that effect (see FIG. 6).

As a result, the control unit 3 reverses the scanning direction to the forward direction,
Instruct the length determination processing unit 2 to execute scanning. The length determination processing unit 2 scans the processed data storage unit 1 in the forward direction to solve the uncertain elements, and notifies the control unit 3 of the end when the scanning is completed (see FIG. 6).

In response to this, the control unit 3 instructs the length determination processing unit 2 to execute scanning with the scanning direction reversed (see FIG. 6).
The length determination processing unit 2 performs backward scanning, resolves any uncertain elements, notifies the control unit 3 at the end of scanning as in the previous time, and requests the processing of the storage area allocation processing unit 4.

In this way, when the solution and storage area allocation have been completed for all the uncertain elements, the operation ends.

〔The invention's effect〕

As described above, according to the present invention, the storage area allocation of a plurality of data having a forward and backward nested structure is significantly speeded up as compared with the conventional one, and for example, the speed can be increased several times depending on the complexity of nesting. In some cases, it can be obtained, which can be useful for improving the processing efficiency.

[Brief description of drawings]

FIG. 1 is a block diagram of a system according to an embodiment of the present invention, FIG. 2 is an explanatory diagram of a program having nested data, and FIG. 3 is an explanatory diagram of an example of data having a forward and backward nested structure. FIG. 4 is an explanatory diagram of a storage area allocation process according to the conventional method, FIG. 5 is an explanatory diagram of the storage area allocation process according to the present invention method, and FIG. 6 is a process flow diagram of the embodiment system shown in FIG. Is. In the figure, 1 is a processing data storage unit, 2 is a length determination processing unit, 3
Is a control unit, 4 is a storage area allocation processing unit, and 5 is a result data storage unit.

Front page continuation (72) Inventor Tokio Hayashi 1015 Kamiodanaka, Nakahara-ku, Kawasaki-shi, Kanagawa Fujitsu Limited (56) Reference JP-A-58-178453 (JP, A)

Claims (1)

[Claims] 1. A first data storage system for storing a plurality of data arranged in element order including a forward and backward nesting structure and a determined data length thereof.
Means and the data array held by the first means are scanned in the reverse direction or the forward direction of the array according to the instruction, and nesting is resolved only for possible data having a nested structure, and its undecided The second means for writing the data length of the data to the first means as the data length of the data and the second means are instructed to solve all the nested structures of the data, Third, alternating reverse and forward scanning until the data length is determined
The method of allocating a storage area for a plurality of data having a forward and backward nesting structure, characterized by allocating a storage area in the order of location for a data array whose data length is determined.