JPH0247733A - Debugging system for data flow computer - Google Patents

Abstract

PURPOSE:To surely execute debugging in a data flow computer by stopping execution just before an arbitrary step of a program described in a high level language. CONSTITUTION:A monitor part 6 is provided with a first table where respective steps of the program described in the high level language are stored, a second table where respective step numbers and language numbers of objective languages included in steps are stored, a third table indicating execution stop conditions, and a monitor means. The monitor means refers to the second table to discriminate whether the objective language which the data flow computer is executing is the objective language corresponding to a stop step number or not. When it is the objective language corresponding to a stop step number, a corresponding flag in the third table is set. When all flags in the third table are set, the processing of the data flow computer is stopped.

Description

DETAILED DESCRIPTION OF THE INVENTION <Field of Industrial Application> The present invention relates to a debugging method for a non-Neumann data flow computer in which a program written in a high-level language is translated into a target language by a compiler and executed.

<Prior Art> A conventional Neumann type computer sequentially reads a program stored in a main memory as specified by a program counter and executes the program in step order as shown in FIG. Debugging in this computer is performed as follows by utilizing the sequential nature of processing. That is, an address table storing the start and end addresses of each program step (statement 11 sentence 2... Execution is stopped immediately when the address of the object being executed becomes the start address of the program step where debugging should start.

On the other hand, in order to meet the demand for high-speed processing of large amounts of data due to the recent increase in the amount of processing information, in place of the conventional sequential processing type Neumann type computer, any number of instructions in a program can be processed as soon as the input is completed. Non-Neumann data flow computers with hardware configurations that can perform parallel operations have been researched, developed, and are being put into practical use.

This data flow computer uses a compiler to translate a program written in a high-level language into a target language, that is, an instruction cell consisting of an instruction, a destination cell, and an operand. The instructions are sent to multiple arithmetic units connected together and executed in parallel to speed up arithmetic processing.

<Problems to be Solved by the Invention> However, unlike the above-mentioned Neumann type computer, this data flow computer performs the above-mentioned parallel operations, so the execution order of each instruction cell is not certain, and as shown in FIGS. As shown in FIG. 9, while an instruction in one program step of a high-level language is being executed, instructions in another program step are usually executed concurrently. Furthermore, as shown in FIG. 10, one operation can be performed in either order of Example 11 or Example 2. Therefore, it is difficult to find the end of each program step, that is, a breakpoint, and the execution of one step in a high-level language cannot be confirmed, making debugging virtually impossible.

However, since this data flow computer itself has only recently begun to be put into practical use, a method that enables denomination and sophistication has not even been proposed yet.

Therefore, an object of the present invention is to enable debugging by detecting the execution of one step in a high-level language in a non-Neumann data flow computer that translates and executes a high-level language into a target language. The purpose is to provide a method.

<Means for Solving the Problems> In order to achieve the above object, the debugging method of the data flow computer of the present invention includes a debugging method for a data flow computer that is included in each step of a program written in a high-level language, and the number of target languages translated by a compiler. a first table that stores the step number of each step mentioned above and the language number of the target language included in that step, and a second table that stores the step number of each step in association with the language number of the target language included in that step; A third table that can have a number of flags corresponding to the number of target languages in the step to be executed, and a second table that can indicate whether or not the target language being executed is the target language included in the step that corresponds to the stop step number. When it is determined to be positive, it sets a flag corresponding to the third table, and also determines whether all the flags in the third table have been raised by referring to the first table, and then The present invention is characterized by comprising a monitor means for interrupting the process being executed when it is determined that the process is executed, thereby enabling step-by-step debugging.

When each step of a program written in a high-level language is translated by a compiler, the first table shows the number of target languages included in each step, and the second table shows the step number of each step and its corresponding number. The language numbers of the target languages included in the text are stored in association with each other. Next, the monitor means refers to the second table and determines whether the target language being executed is a target language that should be included in a step corresponding to a stop step number given in advance as an execution stop condition, When it is determined that the answer is yes, a corresponding flag is set in a third table having a number of flags corresponding to the number of target languages in the stop step. Then, the monitoring means determines whether or not all the flags in the third table are set by referring to the number of target languages of the step in the first table, and interrupts the processing being executed when it is determined that the flags are set in the first table. . In other words, the processing is interrupted when the execution of all the target languages at an arbitrary stop step is completed, so step-by-step debugging becomes possible.

<Example> Hereinafter, the present invention will be explained in detail with reference to illustrated embodiments.

FIG. 1 is a diagram schematically showing the hardware structure of a data flow computer that employs the debugging method of the present invention. In the figure, l is a program storage unit that stores a program in the target language translated by a compiler, 2 is an arithmetic unit that includes multiple arithmetic units such as adders and 9 multipliers, and 3 is an external unit that stores data to be processed, etc. memory; 4 is a communication network connecting these parts in a loop;
5 is interposed in the communication network 4a between the program storage section 1 and the calculation section 2, and waits for data until the target language (instruction cell) sent from the program storage section 1 has its operands. A unit 6 is a monitor unit interposed in the communication network 4b which sends the calculation results of the instruction cells by the calculation unit 2 to the program storage unit 1.

The monitor unit 6 monitors the number of target languages (the number of machine language instructions) translated by the compiler from each step (executable statement 1, executable statement 2, etc.) of the program program written in a high-level language.
The first table as shown in FIG. 2 is stored, and the step number (executive statement number) of each step and the language number (machine language number) of the target language included in that step are stored in association with each other. A second table as shown in FIG. 3 and a third table as shown in FIG. It is equipped with a table and monitoring means.

The monitoring means determines whether or not the target language being executed by the data flow computer is the target language included in the step corresponding to the stop step number.
3), and when it is determined that it is a word, the above 3.
In addition to setting the corresponding flags in the table (Figure 4), it is determined by referring to the first table (Figure 2) whether all flags in this third table have been raised, and if it is determined to be positive, the data The flow computer can be used to interrupt the process being executed. The first and second tables are created when the high-level language is compiled into the target language, and the CPU executes the processing as shown on the right side of FIG. 3 based on the target language (@machine language). Further, the above-mentioned monitoring means is specifically constituted by the above-mentioned CPU, and the third
Create tables sequentially during processing. "0" in the third table indicates that the target language has not been executed, and "B" indicates that the target language has been executed.

A debugging method for the data flow computer having the above configuration will be described below with reference to the flowchart shown in FIG.

First, in step S1, the compiler translates a program written in a high-level language into a target language step by step, and at this time, the compiler uses the table shown in FIG. 2 that stores the number of target languages for each step and the step number of each step. A table shown in FIG. 3 is created in which the language number of the target language included in the step is stored in association with each other, and the CPU executes processing based on the target language. Next, in step S2, the step number N immediately before the program step at which debugging is to be started is set. Then, in step S3, the monitoring means in the monitor unit 6 determines that the target language n currently being executed by the CPU is determined to be the target language N1 . . A flag is set (Fnk-1), and if the determination is negative, the flag is left as is (Fnk-0). Then, in step S5, 8
If it is determined that all the target languages of the number step have been referenced, the process advances to the next step S6.

In step S6, the monitor means sets all the flags in the table of FIG. 4 (Fnk=1;=1, .
. . , Cn) by referring to the target language Cn in step 8 of the table in FIG. On the other hand, if the determination is negative, the process advances to step S8 and C
Makes the PU continue the process being executed. Finally, in step S9, it is determined whether all the programs written in the high-level language have been executed. If not, the process returns to step S3, and if YES, the process ends. Note that the table in FIG. 4 includes all target languages (N.

. . Ncn) is created because the execution order of these target languages is not necessarily constant.

In this way, in the data flow computer of the above embodiment, the table shown in FIG. 2 that stores the number of target languages of each step at the time of compilation corresponds to the step number of each step and the language number of the target language included in that step. While creating the table shown in FIG. 3, which is stored in the same way, the monitor means refers to the table shown in FIG. If this is the case, a flag is set at the corresponding location in the execution flag table shown in Figure 4, and when all the flags in this execution flag table are set, the process being executed is interrupted. You can interrupt execution and perform step-by-step debugging without fail.

It goes without saying that the debugging method of the data flow computer of the present invention is not limited to the illustrated embodiment.

<Effects of the Invention> As is clear from the above description, the data flow computer debugging method of the present invention includes, at the time of compiling, a first table storing the number of target languages of each progressive of a program written in a high-level language; A second table is created in which the step number of each step is associated with the language number of the target language included in that step. The monitor means refers to the second table to determine whether there is a flag, and if so, sets a flag at the corresponding location in the third table, which is a flag table, until all flags in the third table are set. Since the process being executed is interrupted when the program is written in a high-level language, execution can be interrupted immediately before any step of a program written in a high-level language, making it possible to reliably debug a data flow computer, which was previously impossible.

[Brief explanation of the drawing]

FIG. 1 is a schematic diagram showing the hardware structure of a data flow computer employing the debugging method of the present invention, and FIGS.
FIG. 5 is a flowchart showing the process flow of the debugging method described above, and FIG. 6 is a diagram showing a table, a second table and a third table. FIG. 7 is a diagram showing sequential processing in a conventional Neumann computer, and FIGS. 8, 9, and 10 are diagrams showing examples of parallel processing in a non-Neumann computer. 1...Program storage section, 2...Calculation section, 4...
Communication network, 6...monitor section.

Claims (1)

[Claims] (1) In a data flow computer that has a compiler that translates a program written in a high-level language into a target language, a first table that stores the number of target languages included in each step of a program written in a high-level language, and each of the above A second table that stores the step number of a step in association with the language number of the target language included in that step, and a second table that stores the step number of a step in association with the language number of the target language included in that step, and a second table that stores the number of target languages in the step corresponding to the stop step number given in advance as an execution stop condition. It is determined by referring to the third table that can have a number of flags and the second table whether the target language being executed is the target language included in the step corresponding to the stop step number, and it is determined as positive. When this happens, a flag corresponding to the third table is set, and it is determined by referring to the first table whether all the flags in this third table are set, and if it is determined to be yes, the process being executed is interrupted. 1. A debugging method for a data flow computer, characterized in that the debugging method for a data flow computer is characterized in that the debugging method is equipped with a monitoring means for performing step-by-step debugging.