JP2000194585A - Execution time calculating device for program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To eliminated the need for modifying a program by easily measuring the execution time of the program. SOLUTION: The execution time calculating device for program uses a program analysis part 2 so as to take a conditional statement out of a program source file 1, gives a condition code of '1' for truth or '0' for falsehood, and finds an execution path for the condition code value to generate a condition- code-VS-instruction-word data base 3. Then a condition-code-VS-execution-cycle- number data base 5 is generated from the generated data base and an instruction-word-VS-execution-cycle-number data base 4 and the number of execution cycles is totalized to find the execution time of the program.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an execution time calculation device for a program described in, for example, an IL (Instruction Language) language used in sequence software.

[0002]

2. Description of the Related Art Conventionally, the execution time of a program is controlled by a PLC.
In general, the data is transferred to a processing device such as a (programmable controller) and measured and displayed in the state of actual operation.

[0003]

That is, the execution time cannot be measured unless the data is transferred to a PLC or a processing unit and actually operated, and if the measurement result does not satisfy the specifications, the conventional system design process is started again. Therefore, there is a problem that a very large process loss occurs. Therefore, an object of the present invention is to make it possible to easily measure the execution time of a program.

[0004]

In order to solve such a problem, according to the first aspect of the present invention, a conditional statement is extracted by analyzing a program described in a predetermined language, and true is defined by the conditional statement. A condition code for setting "1" and false to "0" is given, and a program execution path for the value of the condition code is obtained.
A program analysis unit that creates a database of program instruction words for each condition code, a database that stores the number of execution cycles corresponding to the instruction words, and a condition code versus execution cycle number from the relation database and the execution cycle number database. An execution time calculation unit that creates a database and totals the number of execution cycles;
It consists of.

According to the first aspect of the present invention, in order to extract the conditional sentence, a control symbol and a jump precedence are added to a comment line corresponding to the instruction word, and the control symbol is detected and the condition code is changed to "1". If it is 1 ", a command word can be extracted from the skip ahead (the invention of claim 2), or a condition word can be defined in advance to extract the conditional statement (claim 3) invention).

[0006]

FIG. 1 is a block diagram showing an embodiment of the present invention. In FIG. 1, 1 is a program source file, 2 is a program analysis unit, 3 is a command database (condition code VS command database) for condition codes, 4 is an execution cycle database (command VS execution cycle database) for commands, Reference numeral 5 denotes an execution cycle number database for the condition code (condition code VS execution cycle number database), and reference numeral 6 denotes the total number of execution cycles as an output (result).

That is, the program analysis unit 2 analyzes the program source file 1 as shown in FIG. 2 and extracts a conditional statement such as a jump (JMP). Here, the program source file 1 shows an example in which instruction language (IL) is used as a description language. Then, a condition code that sets true to "1" and false to "0" is given in this condition statement, and the execution path of the program instruction word for the value of the condition code is obtained. A relation database (condition code VS instruction database) 3 of the program command corresponding to is created.

On the other hand, if a database 4 of the number of execution cycles (number of instruction word VS execution cycles) corresponding to an instruction word as shown in FIG. The execution time can be calculated by summing up the obtained execution cycle numbers. Condition code VS execution cycle number database 5
FIG. 5 shows an example of the total number of cycles. FIG. 5 shows that the total number of cycles when the condition code is “0” is “11”, and the total number of cycles when the condition code is “1” is “6”.

As a method of extracting a conditional sentence, for example, as shown in the third or seventh line of FIG.
MP) A control symbol $ J, $ B and a jump precedence (jump destination label) are added to the corresponding comment line, and if the control symbol is detected and the condition code is "1", an instruction word is extracted from the jump precedence. Alternatively, a method is conceivable in which a conditional word is defined in advance, and this is detected and the same processing is performed.

[0010]

According to the present invention, (1) the execution time can be calculated at the stage of designing a program, so that rework can be avoided. (2) Since the execution time can be calculated for each functional block,
Policies can be set to reduce execution time. (3) Since the condition for maximizing the execution time is known, the condition setting at the time of function verification becomes easy.

[Brief description of the drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention.

FIG. 2 is an explanatory diagram of an example of a source file described in an IL language.

FIG. 3 is an explanatory diagram of an example of a database of condition codes versus instruction words.

FIG. 4 is an explanatory diagram of an example of a database of instruction words versus the number of execution cycles.

FIG. 5 is an explanatory diagram of a database example of a condition code versus the number of execution cycles and a calculation result.

[Explanation of symbols]

DESCRIPTION OF SYMBOLS 1 ... program source file, 2 ... program analysis part, 3 ... condition code vs. instruction database, 4 ... instruction word vs. execution cycle database, 5 ... condition code vs. execution cycle number database, 6 ... output (result).

Claims (3)

[Claims] 1. A program described in a predetermined language is analyzed to extract a conditional statement, and a conditional code that sets true to “1” and false to “0” is added to the conditional statement. A program analysis unit for creating a database of program instructions for each condition code by finding a program execution path for each value, a database for storing the number of execution cycles corresponding to the instructions, the relation database and the number of execution cycles A program execution time calculation device comprising: a database of condition codes versus execution cycles from a database; and an execution time calculation unit for summing up the number of execution cycles. 2. A control symbol and a jump precedence are added to a comment line corresponding to a command word in order to extract the conditional statement.
2. The program execution time calculation device according to claim 1, wherein the control symbol is detected, and if the condition code is "1", the instruction word is extracted from the skip ahead. 3. The program execution time calculation device according to claim 1, wherein a condition word is defined in advance to extract the condition sentence.