JPS63201840A - Program execution instruction tracing output processing system - Google Patents

Abstract

PURPOSE:To correctly grasp a state during the execution of a processing by obtaining a tracing result in a forming which a program name is added. CONSTITUTION:Tracing in formation 5 is matched to a program map 6. Namely, a space ID and an execution instruction address ADDR1 checks whether (the leading address ADDR2)<=ADDR1<(ADDR2+length) or not. Then, it satisfies both, the program name is added on the tracing result 7. A relative address is obtained to output the tracing result 7. Then, when all data editing is completed, the number of the execution instructions is counted for every space ID and the program name. Then, the number of the execution instructions of all output data is counted to output a step number editing result 8.

Description

DETAILED DESCRIPTION OF THE INVENTION [Summary] In a data processing system having a virtual machine instruction tracing function, a spatial TD is used for the instruction tracing function.
At the same time, the operational system is configured to output a program map when creating the application program space, and the trace result with the above space TD and the above program map are combined. Additionally, it is disclosed that a trace result is obtained with the name of a program in the middle of processing being added, so that the performance of each program can be evaluated as needed.

[Industrial application field]

The present invention provides a program execution instruction trace output processing method,
In particular, the present invention relates to a program execution instruction trace output processing method that makes use of a virtual machine instruction trace function and makes it possible to obtain a trace result with the name of a program that is currently being executed, which could not be obtained using the virtual machine instruction trace function alone.

[Conventional technology]

In evaluating the performance of a program, it is necessary to know the number of instruction steps when the program runs.

A trace function exists to count the number of instruction steps, but conventionally there are two methods: one is to trace the target program using a program, the other is the method using a virtual machine instruction trace function using a virtual machine. exists.

[Problem that the invention seeks to solve]

In the case of the former method, even if a program other than the target program, such as an operational system (hereinafter referred to as O8), runs during processing, the running of the O8 is traced. It's something you can't get. In the latter case, the currently executed execution instruction addresses and execution instructions can be output in chronological order over all the spaces where processing is being executed.

Information about which program is running among multiple programs corresponding to multiple spaces is missing.

Therefore, it is not possible to obtain desired tracing results by using only the above two tracing methods.

=3~ [Means for Solving the Problems] The present invention solves the above problems, so to speak, by utilizing the virtual machine instruction tracing function.

FIG. 1 shows a basic configuration diagram of the present invention. In the figure, numeral 1 is the virtual machine, 2 is O3, 3A, 3B, etc.
. . . represents an application program, and 4 represents an aggregation program. 5 outputs the currently executed execution instruction address and execution instruction in chronological order using the conventional virtual machine instruction trace function, and also outputs one of the control registers (CR1) corresponding to the execution instruction, etc. This represents trace information in which the contents of the space ID are output as space IDs. In addition, 6 is when O8 creates the application program space during processing.
It represents a program output that includes at least a space ID, a program name, a start address of the program (entry address to the program), and a length from the start address.

The aggregation program 4 is a program that performs a process of comparing the trace information @5 and the program map 6, and outputs a trace result 7 to which a program name of the processing result is added.

[Effect]

The above trace information 5 is.

(i) Execution instruction address (ii) Execution instruction (iii) Space ID Trace information is output in chronological order.

On the other hand, the program map 6 above is 5 (i) Program name (ii) Start address (iii) Length iv) Space ID It has information organized into pairs (not in chronological order).

The aggregation program 4 associates the spatial TDs in the two sets, positions the execution addresses in the trace information 5, and obtains a trace result 7 with a program name added.

〔Example〕

FIG. 2 shows one embodiment of program execution instruction tracing processing by the aggregation program.

Numbers 5, 6.7 in the figure correspond to those in Figure 1, respectively, and 8
represents the step number editing result.

As shown in FIG. 2, trace information 5 and program map 6 are associated. That is, processing (space ID in al
and processing (in bl, execution instruction address AD
DR1 is (starting address of program ADDR2)≦ADDR1
Check whether it is (80DR2+length). If both conditions are satisfied, a program name is added to the trace result 7 in process (C). In addition, the relative address is obtained in the process (dl), and the trace result 7 is output in the process (81).

Then, when all data editing is finished.

In the process ffl, the number of executed instructions is counted for each space (D) and program name. Then, in the process (0), the number of executed instructions of all output data is counted.

In the process (hl), step number editing result 8 is output.

〔Effect of the invention〕

As described above, according to the present invention, trace results can be obtained with five program names added, making it possible to accurately grasp the status of processing execution.

[Brief explanation of the drawing]

Figure 1 is the principle configuration diagram of the present invention, Figure 2 (A) (B)
(C) constitutes one diagram as a whole and shows the results of tracing program execution instructions. In the figure, 1 is a virtual machine, 2 is an O8, 3 is an application program, 4 is a tabulation program, 5 is trace information, 6 is a program map, and 7 is a trace result with a program name added.

Claims (1)

[Claims] An operational system and a plurality of application programs are mutually switched and executed under the virtual machine, and the virtual machine
In a data processing system having a virtual machine instruction trace function that outputs in chronological order the execution instruction addresses and execution instructions actually executed when the machine executes the above processing, It has a first function of outputting a space ID being processed corresponding to an execution instruction address and an execution instruction, and when the above-mentioned operational system creates a space for an application program. , has a second function of outputting a program map having at least a space ID, a program name, a start address, and a length from the start address, and combines the trace result with the space ID obtained by the first function with the above trace result. A program execution instruction trace output processing method characterized in that the program map obtained by the second function is synthesized by an aggregation program to obtain a trace result to which the name of a program in the middle of processing is added.