JPS63247844A - Partial collation system for data - Google Patents

Abstract

PURPOSE:To omit the application of the mask data and to shorten the time needed for the partial collation by designating one or plural ranges of collation based on a pair of start and end points and performing the partial collation based on said designation. CONSTITUTION:A source program including the collation destination data D, the collation start data S, the total length L of the collation object data, and a partial collation sentence 11 which designates a range of collation set by a pair of a start point (ai) and an end point (bi) is stored in a source program storing means 1. Then said source program is translated into an object form by a translation means 2 and stored in a memory means 3. A collation means 4 reads out the contents stored in the means 3 and carries out the partial collation for the data on a designated collation object based on the designated start and end points. Thus it is possible to omit the application of the mask data and to shorten the time needed for the partial collation.

Description

DETAILED DESCRIPTION OF THE INVENTION FIELD OF INDUSTRIAL APPLICATION The present invention relates to a data partial verification method used for testing purposes in an information processing system.

In conventional technical information processing systems, partial matching is sometimes performed to match only a portion of two pieces of data for the purpose of checking the normality of system operation.

Conventionally, such a partial data matching method specifies both data to be matched, specifies mask data that defines the matching range in both data, first calculates the AND of both data with the mask data, and then Partial matching is performed by comparing both wheel fills.

Problems to be Solved by the Invention In the conventional partial matching method described above, an AND operation is once performed between both data to be matched and mask data. This AND operation is normally repeatedly executed a number of times corresponding to the number of words of data, with the operation width (word) of the arithmetic device as a unit. For this reason, as the number of words of data to be matched increases, it takes more time to perform an AND operation with mask data, making it difficult to speed up partial matching.

Furthermore, in the conventional partial matching method, it is necessary to prepare mask data with the same number of words as the data to be matched in the memory area, so there is a problem that the memory area becomes tight as the number of words in the data to be matched increases. be.

Means for Solving the Constituent Problems of the Invention The partial data matching method according to the present invention is based on the first . Specify the second data, specify one or more matching ranges to be set in the first and second data by a pair of the start point and end point, and based on these specifications, the first...
By performing partial verification of the second data, it is configured to perform partial verification of the immediate data without using mask data.

Hereinafter, the operation of the present invention will be explained in detail together with examples.

Embodiment Referring to FIG. 1, the data partial collation system according to an embodiment of the present invention includes a source program storage means 1, a translation means 2, a storage means 3, a collation means 4, an output means 5, and an input/output means. It consists of 6.

First, a user stores a source program including a data partial verification statement 11 in the source program storage means 1.

In the partial matching statement 11 of this data, matching destination data D,
Verification source data S, total length of verification target data, starting point a+
and the pair of end points bi (i=1.2.3...-) (a 1
．． b 1) (a 2゜b2), (a3.a
4) One or more matching ranges are specified by -.

The source program including the partial matching statement 11 is translated into an object format executable on the information processing device by the translation means 2, and then stored in the storage means 3. That is, the comparison destination data and the comparison source data are stored in the storage areas 31 and 32 starting from addresses D and S, respectively, and the storage start addresses D and S of these data are stored in the storage areas 33 and 34, respectively, and the comparison target data The total length is stored in the storage area 35. Also, the pair of start and end points (
The list of matching ranges displayed in ai, bi) is shown in matching table C.
The address EO of the first entry of this collation table CT is stored in the storage area 37 as T.

FIG. 2 is a flowchart for explaining the procedure of the matching process by the matching means 4 in FIG.

When the collation means 4 starts processing, it proceeds to the first step 41, and retrieves the start address D and 81 collation table C of the collation target data and collation source data from the storage areas 33, 34, and 37, respectively.
After reading the address EO of the first entry in T, the process advances to step 42.

The collation means 4 reads the contents from the latest read entry (in this case, the first entry EO) of the collation table CT, and determines whether it is not empty. In verification verification 4, since the contents of entry EO are not empty, the process proceeds to step 44, where addresses of the verification range are set. That is, the verification means 4 performs the following on both the verification target data and the verification source data.
Start address of first matching range (]) + a i),
(S+a i) and a matching table (bi-ai) are set.

The matching means 4 proceeds to the next step 45 and performs matching for the first matching range, and then determines the matching result in the next step 46. If the matching results match, the matching means 4
After proceeding to step 47 and incrementing the entry number of the collation table CT, the process returns to step 42 to read out the start address and end address pair for the next collation range from the incremented entry, and perform the address setting and collation described above for this pair. And the determination of the matching results is repeated in steps 44 to 46.

When the matching means 4 determines that the matching results do not match in step 46, the process proceeds to step 48, and after storing the matching destination data, matching source data, and matching range (ai, bi) as information regarding this matching mismatch, the process proceeds to step 47.

When the collation means 4 detects that the contents read from the collation table CT are empty, that is, the reading of the contents of the collation table CT has been completed up to the last entry, the process proceeds to step 44, and in step 48, the stored contents are The information regarding the matching mismatch is transferred to the output means 5, and the matching process is ended.

Effects of the Invention As explained in detail above, the data partial matching method according to the present invention compares both data to be matched and one or more matching ranges set therein with their starting and ending points. Since the configuration is such that partial matching of both data is performed based on these specifications, there is no need to use mask data, unlike the conventional method.

Therefore, the time required for partial verification of long data such as read data blocks of input/output devices, particularly file-based devices, is significantly reduced.

Furthermore, since there is no need to store mask data, there is an effect that partial matching can be performed without straining the memory area.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of a data partial matching method according to an embodiment of the present invention, and FIG. 2 is a flowchart for explaining the processing procedure of the matching means 4 in FIG. 1. DESCRIPTION OF SYMBOLS 1... Program storage means, 11... Data verification statement, 2... Translation means, 3... Storage means, 4... Verification means, 31... Storage area for verification target data, 32.・・・
Storage area for comparison source data, 33...Storage area for the start address of the comparison target data, 34...Storage area for the start address of the comparison source data, 36...Storage area for the comparison table CT, 37... Storage area for the first entry address of the collation table CT.

Claims (1)

[Claims] First and second data to be verified are specified, and one or more verification ranges to be set in these first and second data are specified by a pair of a starting point and an ending point. , A partial data matching method characterized by performing partial matching on first and second data based on these specifications.