JPH01211048A - Measuring system for executing instruction number of program - Google Patents

Abstract

PURPOSE:To effectively measure the number of necessary executing instructions by replacing a branch instruction stored in a program with a trap instruction, applying an interruption for each execution of a trap instruction, and counting the number of instructions including the preceding trap instruction and its subsequent ones. CONSTITUTION:A branch instruction stored in an object program 1 is retrieved (2) and replaced with a trap instruction (3). At the same time, the address of the trap instruction and the branch instruction are stored in a table (5). When the program and then the trap instructions are carried out, the program state is temporarily held (6). The number of instructions received from the address (8) pointed by said branch instruction are counted (7) and added to the previous count value (9). Then the branch instruction is read (10) out of the trap instruction for calculation (11) of the branch destination. This calculated address is stored (8) and the program 1 is restarted.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a method for measuring the performance of a program, and particularly to a method for measuring the number of executed instructions of a program.

[Conventional technology]

As one of the performance measurements of newly developed programs, etc.
There is a measurement of the number of execution instructions required to perform a predetermined process.

Measuring the number of executed instructions of such a program has traditionally been
A common hardware operating mode was to use an electronic computer with the function of generating an interrupt to software for every instruction, and to count the number of interrupts using software.

[Problem to be solved by the invention]

However, the conventional method described above is only applicable to electronic computers that have the function of generating an interrupt to software for every instruction, and it is difficult to measure on a general electronic computer that does not have such a function.

Furthermore, the system in which interrupts are generated for all instructions significantly degrades the performance of the entire system. Although it is theoretically possible to generate an interrupt only with a specific instruction (for example, a branch instruction), it is necessary to incorporate a judgment circuit that determines whether or not to generate an interrupt depending on the type of instruction. This results in an increase in hardware costs, and further limits the number of computers to which it can be applied.

An object of the present invention is to provide a method that can efficiently measure the number of executed instructions of a program using a basic trap mechanism that general electronic computers have.

[Means to solve the problem]

In order to achieve the above object, the present invention provides a system for measuring the number of executed instructions of a program executed on an electronic computer, comprising: a branch instruction search means for searching for branch instructions existing in the program; and a branch instruction search means for searching for branch instructions existing in the program. trap instruction embedding means for replacing a branch instruction retrieved by the trap instruction with a trap instruction; a trap management table for storing the original branch instruction replaced by the trap instruction by the trap instruction embedding means together with its address; a program state storage means for storing a program state including the address of the activated trap instruction and the contents of a state register of an electronic computer that determines the operation of the branch instruction; an instruction number counter for recording the number of executed instructions; and an instruction number calculation. a start instruction address register indicating the start position of the start instruction address register; and calculating the number of instructions included in the range from the start position indicated in the start instruction address register to the address of the current playing card instruction stored by the program state storage means;
instruction number counting means for adding the result to the instruction number counter; trap management table search means for finding the original branch instruction corresponding to the current trap instruction from the trap management table; As a result of executing the branch instruction, it is determined which instruction should be executed next based on the original branch instruction and the contents of the state register at the time of trap execution saved by the program state saving means, and the instruction to be executed is determined. The branch destination address calculation means sets an address in the start instruction address register, and the restart means resumes execution of the program from the branch destination address determined by the branch destination address calculation means.

[Effect]

Prior to execution of a program whose number of executed instructions is to be measured, a branch instruction search means searches for a branch instruction included in the program, and a trap instruction embedding means replaces the branch instruction with a trap instruction. Also,
The original branch instruction replaced by the trap instruction and its address are stored in the trap management table.

When the execution of the program is started, an interrupt occurs when a trap instruction embedded therein is executed, and the program state including the address of the trap instruction and the contents of the state register is saved by the program state saving means. After this, the number of instructions counting means calculates the number of instructions included in the range from the start instruction address held in the start instruction address register to the address of the current trap instruction, and the calculated value is accumulated in the number of instructions counter. be done.

Furthermore, the trap management table search means finds the original branch instruction corresponding to the current trap instruction, and based on this original branch instruction and the contents of the state register at the time of trap execution saved by the program state storage means, the original branch instruction corresponding to the current trap instruction is found. It is determined which instruction should be executed next to the original branch instruction. The address of this determined instruction is held in the start instruction address register for calculating the number of instructions at the next trap, and is also passed to the restart means. The restarting means restarts the execution of the program from the passed branch destination address by performing 0 or more processing for each interrupt generated by the trap instruction, so that the number of executed instructions of the program is reduced to the cumulative value of the instruction number counter. It is required as.

〔Example〕

Next, embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram of an embodiment of a method for measuring the number of executed instructions of a program according to the present invention.

This embodiment includes an object program l whose number of executed instructions is to be measured, a branch instruction search means 2, a trap instruction embedding means 3, a trap management table 5, a program state storage means 6, and an instruction number counting means 7. , a start instruction address register 8 , an instruction number counter 9 , a trap management table search means 10 , a branch destination address calculation means 11 , a restart means 12 , and a display device or printer device for outputting the contents of the instruction number counter 9 etc. output means 1
It is composed of 3. The object program 1 includes several branch instructions 4, which are replaced with trap instructions 4' as described later.

FIG. 2 shows an example of the contents of a part of the object program 1, in which blocks L1. Command C
Block L2 consisting of 21 to C2j, instructions C31 to C3
Block consisting of k and including 3, OP 11-OP
1 t, OP, 21-OP2 j.

0P31 to OP3 are instruction codes (operation code) of each instruction, among which 0P1i and 0P3k are instruction codes of branch instructions. When the object program part shown in FIG. 2 starts execution from instruction C11, it executes instructions C12,..., C1i, and by executing this branch instruction C1i, instruction C21 or instruction C31
When branching to instruction C21, instruction C22, .
..., instruction C2j, instruction C31, ..., progresses to instruction C3, and when branching to instruction C31, instructions C21-C2
j and proceeds to instructions C31, . . . , C3.

Next, the operation of this embodiment will be specifically explained with reference to each figure.

For example, the object program 1 is a program on the virtual memory of an electronic computer, the program state storage means 6 is a trap processing mechanism realized by hardware or firmware, the branch instruction search means 2. Trap instruction embedding means 3. Instruction number counting means 7. Trap management table search means 10° branch destination address calculation means 11. The restart means 12 is a program running on the computer, a trap management table5. Start instruction address register8. It is assumed that the instruction number counter 9 is an area secured on the main memory.

When the object program 1 is loaded onto the virtual memory, the branch instruction search means 2 reads the object program 1 and searches for a branch instruction.In general, an instruction consists of an instruction code and its successor (operand field). ,
Depending on the electronic computer, the length of the operand field is determined by its instruction code. Therefore, with such an electronic computer, it is possible to search for instruction codes sequentially from the beginning of the program, and by checking whether the instruction code is a branch instruction code, it is possible to find a branch instruction. .

The branch instructions found in this way are replaced with trap instructions by the trap instruction embedding means 3. For example, in the example of FIG. 12, branch instructions C1i, C3k (7)
Instructions: y-FOP 1 t, op 3 k; 6 (replaced with trap instructions Bl, B, 2, respectively.

At this time, the trap instruction embedding means 3 stores the instruction address and the original branch instruction replaced by the trap instruction in the trap management table 5. Further, the trap instruction embedding means 3 starts execution of the object program 1 after replacing all branch instructions with trap instructions.

When execution of the object program 1 is started and the trap instruction embedded therein is executed, the program state storage means 6 is activated and stores the address of the trap instruction,
The program state, including the contents of the computer's state registers, determining the behavior of the original branch instruction replaced by this trap instruction is saved. The program state storage means 6, ie, the trap processing mechanism, which performs such operations is provided in ordinary electronic computers (machines) for boat fishing.

After the state of the program at the time of execution of the trap instruction is saved, the instruction number counting means 7 counts the number of instructions from the instruction pointed to by the start instruction address register 8 to the current trap instruction. The operation at this time will be explained with reference to FIG.

Now, at time tQ, it is assumed that the program execution starts from the instruction C1l containing the instruction code OPH, and the execution of the program starts from the instruction C1l including the instruction code OpH.
It is assumed that the instruction address is stored in the start instruction address register 8, and the instruction number counting means 7 is activated by the trap instruction Bl replaced by the branch instruction C1i at time t1 in FIG.

The instruction number counting means 7 can know the instruction address of the instruction C1i including the instruction code 0P1t from the instruction address register stored in the program state storage means 6. Therefore, the instruction C1l containing the instruction code 0PII
By counting the number of instructions in block LL from to instruction CI+ containing instruction code 0P11, time t
The number of instructions executed between o and time t1 can be known. To count the number of executed instructions, the instruction length can be determined by the instruction code, so the instruction C including instruction code 0P11
Instruction C1 including instruction code oP1i from address 1l
This is possible by dividing the area up to address i one instruction at a time.

The instruction number counting means 7 adds the thus obtained number of executed instructions to the instruction number counter 9.

After counting the number of executed instructions this time, the trap management table search means 10 is activated next, and the trap management table search means 1O searches the trap management table 5 using the trap instruction address as a key, and replaces it with the current trap instruction. Get the original branch instruction.

Subsequently, the branch address calculation means 11 is activated, and the branch address calculation means 11 calculates the address of the next instruction to be executed (branch destination address), and updates the contents of the start instruction address register 8 with that address. At the same time, the restarting means 12 is notified of this, and the restarting means 12 restores the state of the interrupted object program 1 to a register of the CPU (not shown), and sets the notified branch destination address in the instruction counter. The zero or more processes for restarting the execution of the object program 1 will be explained with reference to FIG. 2 again.

Branch address calculation means 11 activated at time t1
According to the state register saved by the program state storage means 6 and the format of the branch instruction obtained by the trap management table search means 10, the next instruction to be executed is either instruction C21 containing instruction code 0P21 or instruction C21 containing instruction code 0P31. The instruction C31 is determined and its address is stored in the start instruction address register 8, and this address is passed to start the restart means 12. When the resuming means 12 is activated, it passes control of the execution of the object program 1 to the notified branch destination address, thereby restarting the execution of the object program 1 from the branch destination address. In this case, the trap instruction executed next to the instruction code 0P1i is the trap instruction B2, which is replaced with the instruction code OP3. Therefore, let us consider a case where the trap instruction B2 replaced with the instruction code OP3 is executed at time t2, and the instruction number counting means 7 is activated again.

If the instruction executed next to the instruction C1i containing the instruction code 0PII is the instruction C21 containing the instruction code ○P21,
Since the start instruction address register 8 points to the address of instruction code 0P21, the number of instructions included in block 2 and block L3 is counted in the same manner as described above. Conversely, the instruction executed next to the instruction C1i containing the instruction code 0P1i is the instruction C containing the instruction code 0P31.
In the case of 31, the start instruction address register 8 points to instruction code 0P31, so the number of instructions included in block L3 is counted.

As described above, by sequentially updating the start instruction address register 8, counting the number of instructions from the instruction pointed to by the start instruction address register 8 to the executed trap instruction, and adding it to the instruction number counter 9, the instruction number counter 9 is Ultimately, it indicates the number of executed instructions of the object program 1.

The contents of the instruction number counter 9 are notified to the operator etc. by the output means 13.

〔Effect of the invention〕

As explained above, the present invention replaces a branch instruction in a program to be measured with a trap instruction, and each time an interrupt occurs due to execution of the trap instruction, the number of instructions from the immediately previous point is counted and added. By doing so, the total number of executed instructions can be obtained. According to this method, the mechanism for measuring the number of executed instructions operates only at branch instructions, which reduces performance degradation and can be implemented in software using a basic trap mechanism. This has the advantage of being a method that does not depend on the hardware model.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of an embodiment of the present invention, and FIG. 2 is a diagram showing an example of the contents of a part of an object program 1. As shown in FIG. In the figure, ■...Object program 2...Branch instruction search means 3...Trap instruction embedding means 4...Branch instruction 4''...Trap instruction 5...Trap management table 6...Program State storage means 7...Instruction number counting means 8...Start instruction address register 9...Instruction number counter 10...Trap management table search means 11...Branch destination address calculation means 12...Resuming means 13... Output means

Claims (1)

[Claims] A method for measuring the number of executed instructions of a program executed on an electronic computer, comprising: branch instruction search means for searching for branch instructions existing in the program; and branch instruction search means for searching for branch instructions existing in the program; trap instruction embedding means for replacing a branch instruction with a trap instruction; a trap management table for storing the original branch instruction replaced by the trap instruction by the trap instruction embedding means together with its address; a program state storage means for storing a program state including the address of the branch instruction and the contents of a state register of the electronic computer that determines the operation of the branch instruction; an instruction number counter for recording the number of executed instructions; and an instruction number counter indicating a starting position for calculating the number of instructions. calculating a start instruction address register and the number of instructions included in the range from the start position indicated in the start instruction address register to the address of the current trap instruction saved by the program state storage means;
instruction number counting means for adding the result to the instruction number counter; trap management table search means for finding the original branch instruction corresponding to the current trap instruction from the trap management table; As a result of executing the branch instruction, it is determined which instruction should be executed next based on the original branch instruction and the contents of the state register at the time of trap execution saved by the program state saving means, and the instruction to be executed is determined. A program comprising: branch destination address calculation means for setting an address in the start instruction address register; and restart means for restarting execution of the program from the branch destination address determined by the branch destination address calculation means. A method for measuring the number of executed instructions.