JPH077346B2 - Data flow computer debugging method - Google Patents

Description

TECHNICAL FIELD The present invention relates to a debugging method for a non-Neumann type data flow computer in which a program written in a high-level language is translated by a compiler into a target language and executed.

<Prior Art> A conventional Neumann type computer successively reads out a program stored in a main memory by designating a program counter, and executes it in a step order as shown in FIG. Then, debugging in this computer is performed as follows by utilizing the sequentiality of processing. That is, an address table storing the start and end addresses of each program step (sentence 1, sentence 2, ...) As shown in FIG. 7 is provided in the computer, and the target language obtained by translating each program step with a compiler. Execution is stopped immediately when the address of the (object) being executed reaches the start address of the program step at which debugging should be started.

On the other hand, in order to meet the demand for high-speed processing of large amounts of data due to the increase in the amount of processing information these days, instead of the conventional sequential processing method Neumann computer, when all the instructions in the program have been input A non-Neumann type data flow computer with a hardware configuration that can be operated in parallel with is researched, developed, and put into practical use.
This data flow computer translates a program written in a high-level language into a target language, that is, an instruction cell composed of an instruction, a destination cell and an operand by a compiler, and then, when all the operands of the instruction cell are prepared, the instruction cell is networked. In order to speed up the arithmetic processing, the instructions are sent in parallel to a plurality of arithmetic units connected by the above to execute the instructions in parallel.

<Problems to be Solved by the Invention> However, this data flow computer is different from the above-mentioned Neumann computer in that the execution order of each instruction cell is not fixed because the parallel operation as described above is performed. As shown in FIG. 9, during execution of an instruction in one program step of a high-level language, instructions in another program step are usually executed concurrently. Also,
As shown in FIG. 10, one calculation can be performed in either order of Example 1 and Example 2. Therefore, it is difficult to find the end of each program step, that is, the break point, the execution confirmation of the high-level language one step cannot be confirmed, and there is a disadvantage that debugging cannot be substantially performed. However, since this data flow computer itself is just in the process of being put into practical use recently, no method has yet been proposed for enabling debugging.

Therefore, an object of the present invention is, in a non-Neumann type data flow computer that translates a high-level language into a target language and executes it, detects the execution of one step of a high-level language and enables a debugging method of the data flow computer. Is to provide.

<Means for Solving the Problems> In order to achieve the above object, the debugging method of the data flow computer according to the present invention is included in each step of the program written in a high-level language, and the number of the target languages translated by the compiler. Corresponding to a stop table number given in advance as an execution stop condition, and a second table for storing the step number of each step and the language number of the target language included in the step in association with each other. A third table which may have a number of flags corresponding to the number of target languages in the step to be executed, and the second table which shows whether or not the target language being executed is the target language included in the step corresponding to the stop step number. And when affirmative, all flags of this third table are set. It is characterized in that a step-by-step debugging is enabled by providing a monitor means for judging whether or not the user has stood up by referring to the first table and interrupting the processing being executed when the result is judged as affirmative.

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

<Examples> Hereinafter, the present invention will be described in detail with reference to illustrated examples.

FIG. 1 is a diagram schematically showing the hardware structure of a data flow computer adopting the debugging method of the present invention. In the figure, 1 is a program storage unit for storing a program in a target language translated by a compiler, 2 is a calculation unit including a plurality of calculation units such as adders and multipliers, and 3 is an external unit for storing data to be processed. Memory 4 is a communication network that connects these parts in a loop,
A data waiting unit 5 is provided in the communication network 4a between the program storage unit 1 and the arithmetic unit 2, and waits until the operands of the target language (command cell) sent from the program storage unit 1 are complete, 6 is the arithmetic unit 2
Is a monitor unit provided in the communication network 4b for sending the calculation result of the instruction cell by the program storage unit 1 to the program storage unit 1.

The monitor unit 6 stores the number of target languages (the number of machine language instructions) translated by the compiler from each step (execution statement 1, execution statement 2, ...) Of a program written in a high-level language. As shown in FIG. 3, the first table as shown, the step number (execution statement No.) of each step, and the language number (machine language No.) of the target language included in the step are stored in association with each other. It is provided with a second table, a third table as shown in FIG. 4, which may have a number of flags corresponding to the number of target languages in the step corresponding to the predetermined stop step number as the execution stop condition, and the monitor means. ing.

The monitor means refers to the second table (FIG. 3) to determine whether the target language being executed by the data flow computer is the target language included in the step corresponding to the stop step number, When it is determined that the answer is affirmative, the corresponding flag of the third table (FIG. 4) is set, and it is determined whether or not all the flags of the third table are set by referring to the first table (FIG. 2). Then, when it is determined that the answer is affirmative, the data flow computer is activated to interrupt the process being executed. The first and second tables are created at the time of compiling from the high-level language to the target language, and the CPU executes the processing as shown in the right side of FIG. 3 based on the target language (machine language). Further, the monitor means is specifically configured by the CPU, and sequentially creates the third table during processing execution. In the table of FIG. 3, "0" indicates that the target language has not been executed, and "1" indicates that the target language has been executed.

The debugging method of the data flow computer having the above configuration will be described below with reference to the flowchart of FIG.

First, in step S1, the compiler translates a program written in a high-level language into a target language in the order of steps, and at that time, the table of FIG. 2 in which the number of target languages of each step is stored and the step number of each step. And the language number of the target language included in the step are stored in association with each other.
The table shown in the figure is created, and the CPU executes processing based on the target language. Next, at step S2, the step number N immediately before the program step at which debugging should be started is set. Then, the monitor means in the monitor unit 6 determines in step S3 that the target language n currently being executed by the CPU is
If it is any one of the target languages N ₁ , ..., N _cn included in the Nth step given in advance as the execution stop condition, it is sequentially determined by referring to the table in FIG. Then, the process proceeds to step S4 and a flag is set at a position corresponding to the target language in the table of FIG. 4 (Fnk ← 1), and if it is determined to be no, the flag is left as it is (Fnk ← 0). If it is determined in step S5 that all the target languages of the Nth step have been referenced, the process proceeds to the next step S6.

In step S6, the monitor means determines whether all the flags in the table of FIG. 4 are set (Fnk = 1; k = 1, ..., Cn) and the target language of the Nth step of the table of FIG. When it is determined that it is affirmative by referring to Cn, the process proceeds to step S7 to cause the CPU to interrupt the process being executed, and when determined to be no, the process proceeds to step S8 to cause the CPU to execute the process being executed. Let me continue. Finally, in step S9, it is determined whether or not all the programs written in the high-level language have been executed, and if no, the process returns to step S3, and if yes, the process ends. The table shown in FIG. 4 is created for all target languages (N ₁ , ..., N _cn ) forming the N-th step because the execution order of these target languages is not always constant.

As described above, in the data flow computer of the above embodiment, the table of FIG. 2 in which the number of target languages of each step is stored at the time of compilation, the step number of each step, and the language number of the target language included in the step are associated with each other. While the table of FIG. 3 additionally stored is created, it is determined by the monitor means by referring to the table of FIG. 3 whether the target language being executed is the target language included in the stop step given in advance. If so, a flag is set in the corresponding portion of the execution flag table of FIG. 4, and when all the flags of this execution flag table are set, the processing being executed is interrupted, so just before any step of the program. Execution can be interrupted up to and debugging can be performed step by step without fail.

Needless to say, 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 apparent from the above description, the debugging method of the data flow computer according to the present invention includes the first table storing the number of target languages of each step of the program written in the high-level language at the time of compilation, While creating the second table in which the step number of each step and the language number of the target language included in that step are stored in association with each other, the target language being executed is the target language included in the stop step given in advance. Whether or not there is any is determined by the monitor means by referring to the above-mentioned second table, and when that is the case, the corresponding portions of the third table, which is the flag table, are flagged, and all the flags of this third table have been raised. Since the process being executed is interrupted, execution is interrupted immediately before any step of a program written in a high-level language, It is possible to reliably debug a data flow computer that was impossible.

[Brief description of drawings]

FIG. 1 is a schematic diagram showing the hardware structure of a data flow computer adopting the debugging method of the present invention, and FIG.
FIGS. 3, 3 and 4 are diagrams showing the first table, the second table, and the third table, respectively, used in the debugging method, and FIG. 5 is a flowchart showing the processing flow of the debugging method, FIG. FIG. 7 is a diagram showing the sequential processing of a conventional Neumann computer, and FIGS. 8, 9, and 10 are diagrams showing an example of parallel processing of a non-Neumann computer. 1 ... Program storage section, 2 ... Computing section, 4 ... Communication network, 6 ... Monitor section.

Claims (1)

[Claims] 1. A data flow computer having a compiler for translating a program written in a high level language into a target language, the first table storing the number of target languages included in each step of the program written in a high level language, A second table that stores the step number of each step and the language number of the target language included in the step in association with each other, and the number of target languages in the step corresponding to the stop step number given in advance as the execution stop condition. A third table that can have a corresponding number of flags and whether or not the target language being executed is the target language included in the step corresponding to the stop step number is determined by referring to the second table, and affirmative If it is determined that the flag corresponding to the third table is set, and whether all the flags of the third table are set And a monitor means for interrupting the process being executed when the result is determined to be affirmative, and debugging of the data flow computer is enabled. method.