JP2000330782A - Device and method for analyzing static performance by description of hint to source - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a static performance analyzing device and method capable of performing static performance analysis with the few errors by description of hint to a source. SOLUTION: A program producer embeds information (hint) that can be obtained exclusively through the execution as a comment in a source program 201. An assemble list 202 is outputted from the program 201 by using an assemble list outputting means 101 having hint information. In such a case, hint is outputting as a comment. The number of cycles calculating means 102 calculates the number of execution cycles on the basis of the list 202 and a hint embedded in it. The number of execution cycles is outputted to a display device 400.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a static performance analysis apparatus and method capable of performing static performance analysis with a small error by describing a hint to a source program.

[0002]

2. Description of the Related Art In recent years, as programs for embedded systems have become larger in scale, in order to prevent an increase in the number of steps to be performed when a performance problem occurs at the evaluation stage (after the construction of a target system), an upstream stage in the development cycle is required. Development that considers performance from a process close to the process has become necessary. Against this background, a technique for analyzing performance is required before the construction of the target system, and a static analysis technique that does not require a simulator is required.

An example of a conventional performance analysis system is described in Japanese Patent Application Laid-Open No. 7-21061. The performance analysis method described in this publication includes a method of dynamically collecting performance information and a method of statically collecting performance information. In order to collect data statically, the performance is estimated from an assemble list output by a compiler or a disassembly list of a program.

[0004]

The problem here is that static performance analysis without executing a program is more likely to cause an error than a value dynamically measured by actually executing a program. is there. The reason is that when statically analyzing performance, there are some pieces of information that cannot be known unless you actually move it, such as how many times a procedure is called and how many times a loop in the code is executed. That's why.

An object of the present invention is to provide a static performance analysis apparatus and method capable of performing static performance analysis with a small error by describing a hint to a source program.

Another object of the present invention is to provide a recording medium for recording a program for performing a static performance analysis with a small error by describing a hint to a source program.

[0007]

According to the present invention, there is provided a static performance analyzer comprising: a computer operating under program control;
Exchange data and programs with computers,
A storage device for storing a source program describing hint information and an assemble list, a device for inputting to a computer, and a display device for outputting from a computer are provided.

According to the static performance analysis method of the present invention, based on hint information described in a loop, a conditional branch, and a recursive procedure call portion of a source program, performance information is obtained based on the number of repetitions, the conditional branch rate, and the number of recursions. It is characterized in that it is calculated statically.

A recording medium for recording a program for performing the static performance analysis method of the present invention includes: a) a program which cannot be obtained unless the program creator executes the source program.
Embedding hint information described in a loop, conditional branch, and recursive procedure call part of the source program as a comment in the source program; b)
Outputting the assemble list from the source program by using the assemble list with hint information; c) outputting the hint information embedded in step a as a comment; d) outputting the assemble list and the The step of calculating the number of execution cycles by the cycle number calculation means based on the embedded hint information and the step of e) outputting the number of execution cycles are executed.

[0010]

DESCRIPTION OF THE PREFERRED EMBODIMENTS In the present invention, in FIG. 1, a source program including hint information is converted into an assemble list, and then the number of execution cycles is calculated. In this way, static performance analysis with few errors is enabled.

The configuration of an embodiment of the present invention will be described in detail with reference to FIG. FIG. 1 is a diagram showing the configuration of the static performance analysis device of the present invention.

Referring to FIG. 1, an embodiment of the present invention comprises a computer (central processing unit) 100 operated under program control, an assemble list with hint information (such as a compiler) 101, and a cycle number calculating means 102. And a storage device 2 for input and output from a computer
00 and a source program 201 describing hint information
, Assemble list 202, device 300 for inputting to computer, and display device 4 for outputting from computer
00.

The computer 100 includes an assemble list with hint information output means 101 and a cycle number calculation means 102. Each of these means operates as follows.

The assemble list with hint information output means 101 generates an assemble list 202 from the source program 201. The cycle number calculation means 102 calculates the number of cycles from the assemble list 202 and outputs it to the display device 400. The storage device 200 includes a source program 201 and an assemble list 202.

Next, the operation of the embodiment of the present invention will be described in detail with reference to FIG. FIG. 2 is a diagram showing the operation of the static performance analysis device of the present invention.

First, information (hints) that cannot be obtained unless the program creator executes them in the source program 201 is embedded as a comment (step A1). Next, the assemble list 2 is output from the source program 201 using the assemble list with hint information output unit 101.
02 is output. At this time, the hint embedded in step A1 is output as a comment (step A2).
Further, the cycle number calculating means 102 calculates the number of execution cycles based on the assemble list 202 and the hint embedded therein (step A3). Finally, the number of execution cycles is output to the display device 400 (step A).
4).

Next, this embodiment will be described with reference to specific examples shown in FIGS. FIG. 3 is a diagram showing a normal sentence.
FIG. 4 is a diagram showing the repetition sentence 1. FIG. 5 is a diagram showing a repetition sentence 2. FIG. 6 is a diagram showing a procedure call.

In the case of a normal statement (basic block) having no repetition or branch as shown in FIG. 3, each code is executed only once, and the number of execution cycles is the sum of the codes. Specifically, in the case of FIG. 3, the total number of execution cycles is as follows. (Total number of execution cycles) = (Number of execution cycles of A) For, while, and do as shown in FIG.
For code parts that are repeatedly executed, such as le statements,
The description of the hint is the number of repetitions, and the number of execution cycles is the product of the code of the repeated part and the number of repetitions. If there is no hint description, the default number of times given from the input device 300 to the cycle number output means 102 is referred to. Specifically, in the case of FIG. 4, the total number of execution cycles is as follows. (Total number of execution cycles) = (number of execution cycles of A) + (B
Number of execution cycles) × 10 + (number of execution cycles of C) As shown in FIG. 5, for a code portion that is selected and executed, such as an if and a switch statement, the description of the hint is set as the weight to be executed, and the execution cycle The number is the product of the code of each part and the weight. If there is no hint description, the weight is 1 /
Number of selections. Specifically, in the case of FIG. 5, the total number of execution cycles is as follows. (Total number of execution cycles) = (number of execution cycles of A) + (B
Number of execution cycles) × 0.7 + (number of execution cycles of C)
× 0.3 + (the number of execution cycles of D) For a procedure call as shown in FIG. 6, the execution cycle of the called procedure is added to the execution cycle of the processing of the caller. In the case of recursion, the hint description of the number of recursions is referred to, and the execution cycle of the called procedure is not added more than that number. If there is no hint description, the default number of recursions given from the input device 300 to the cycle number output means 102 is referred to. Specifically, in the case of FIG. 6, the total number of execution cycles is as follows. (Total number of execution cycles) = (number of execution cycles of A) + (B
Number of execution cycles) × 0.1 + ((number of execution cycles of A) + (number of execution cycles of B) × 0.1 + ((number of execution cycles of A) + (number of execution cycles of B) × 0.1 + ( D
Number of execution cycles)) × 0.9 + (number of execution cycles of D)) × 0.9 + (number of execution cycles of D)

[0019]

As described above, by embedding the hint description in the source program, the static performance analysis apparatus of the present invention can obtain information that cannot be obtained unless the hint description is executed. Without errors, static performance analysis with few errors is possible. The hint information is described in a loop, a conditional branch, and a recursive procedure call part of the source program. The present invention includes a calculation unit by statically calculating performance information based on, for example, the number of repetitions, the conditional branching rate, the number of recursions, and the like.

[Brief description of the drawings]

FIG. 1 is a diagram showing a configuration of a static performance analysis device of the present invention.

FIG. 2 is a diagram showing an operation of the static performance analysis device of the present invention.

FIG. 3 is a diagram showing a normal sentence.

FIG. 4 is a diagram showing a repetition sentence 1;

FIG. 5 is a diagram showing a repeated sentence 2;

FIG. 6 is a diagram showing a procedure call.

[Explanation of symbols]

 REFERENCE SIGNS LIST 100 computer 101 assemble list output means 102 cycle calculation means 200 storage device 201 source program 202 assemble list 300 input device 400 output device

Claims (6)

[Claims] A means for statically calculating performance information based on a repetition count, a conditional branch rate, and a recursion count based on hint information described in a loop, conditional branch, and recursive procedure call part of a source program. A static performance analyzer characterized by the following. 2. A computer that operates under program control, a storage device that exchanges data and programs with the computer and describes hint information, and a storage device that stores an assemble list, and a device that inputs data to the computer. The static performance analysis device according to claim 1, further comprising: a display device that outputs data from the computer and a processing result of the program. 3. The assemble list with hint information for assembling the source program with the hint information and converting it into an assemble list with hint information, and calculates a cycle number from the assemble list with hint information. 3. The static performance analysis device according to claim 2, further comprising: a cycle number calculation unit for displaying the number of cycles on the display device. 4. Performance information is statically calculated based on the number of repetitions, the conditional branching rate, and the number of recursions using hint information described in a loop, conditional branch, and recursive procedure call part of the source program. Static performance analysis method. 5. The method according to claim 5, wherein the program creator writes hint information described in a loop, a conditional branch, and a recursive procedure call portion of the source program, which cannot be obtained unless the program creator executes the source program. B) outputting the assemble list from the source program using the assemble list with hint information output means; c) outputting the hint information embedded in step a as a comment; d) calculating the number of execution cycles by the cycle number calculating means based on the assemble list and the hint information embedded therein; and e) outputting the number of execution cycles. Performance analysis method. 6. A description is given to the source program as a hint information described in a loop, a conditional branch, and a recursive procedure call portion of the source program, which cannot be obtained unless the program creator executes the source program. B) outputting the assemble list from the source program using the assemble list with hint information output means; c) outputting the hint information embedded in step a as a comment; d) recording the program for executing the step of calculating the number of execution cycles by the cycle number calculation means based on the assemble list and the hint information embedded therein; and e) outputting the number of execution cycles. Medium.