JPH04263336A - Executing route output method for recurrent call - Google Patents

Abstract

PURPOSE:To enable a debugger to perform the output of an executing route regardless of a program operation rule as well as to reduce the output value when an instruction is given for the output of the executing route by outputting collectively the recurrent calls in an executing route output method. CONSTITUTION:A monitoring point table 9 is provided to store the types and addresses of the inlet and the outlet of a program whose monitoring is instructed together with an action control table 10 where the program name is set. When the operation of the program is interrupted at its inlet, the called program name is set and linked by reference of the table 10 in response to an executing instruction. Meanwhile the table 10 is deleted if the program is interrupted at its output. These operations are repeated and the linked table 10 is retrieved in response to an executing route output instruction of a user. Then the recurrent call frequency is collectively outputted and the calling relation is individually outputted for other programs.

Description

[Detailed description of the invention]

0001

[Field of Industrial Application] The present invention relates to a method for outputting an execution path during recursive call, and more particularly, to a method for outputting an execution path during recursive call, which reduces and reliably outputs the amount of output of the execution path of an executable program. .

0002

[Prior Art] Conventional language debuggers do not take any special measures to output the execution path even when the target execution program is a program that calls itself recursively. As shown, for all recursive calls, the relationship between the calling program and the called program is listed. FIG. 5 will be briefly explained below.

FIG. 5A shows an example of a recursive calling program. This calls func from main, and within this called func sets its own func to 1.
This is a program that is called recursively 0 times. FIG. 5(B) schematically shows the calling relationship of the recursive calling program shown in FIG. 5(A). Here, the pr called from program:main
ogram:func further adds its own program:f
This shows how calling unc is repeated 10 times.

FIG. 5(c) shows an example of the execution path output at the time of recursive call in FIG. 5(b). This is (b) in Figure 5.
For example, func called from mai
n. (func was called from main).

[0005]

[Problem to be solved by the invention] For this reason, when outputting the execution path of a program that has the property of recursive calls,
The calling relationship for the number of recursive calls (func called from func in (c) in Figure 5) is displayed repeatedly, and the more recursive calls, the more the execution path output amount increases, making it difficult to extract the necessary information. It is not easy to do this, and when it is displayed on the screen, it is occupied by displays related to recursive calls, and the necessary information is displayed on the next screen, which in turn causes the problem of being missed during debugging. In addition, because information on the execution path was collected at the time when an output instruction was given, relying on the program operating rules on the target computer, there were programs that were not based on the program operating rules in the middle, and the program operating rules There was a problem in that if the file was in a state where it looked like it had been discarded, correct information could not be output.

[0006] The present invention outputs all recursive calls in which the program names of the caller and callee match, thereby reducing the amount of output when instructing to output the execution path, and making it easier to use a debugger regardless of the program operating rules. The purpose is to output the execution path.

[0007]

[Means for Solving the Problems] FIG. 1 shows a diagram of the principle configuration of the present invention. In FIG. 1, a monitoring point table 9 is a table that stores the addresses of the entrance and exit of a program (procedure) for which setting of a monitoring point in an execution program is instructed.

The operation management table 10 is a table in which the name of the program called at the entrance of the interruption point is set and linked. The execution monitoring unit 4 updates the operation management table 10 based on the monitoring point table 9. The output control unit 5 outputs an execution path based on the operation management table 10.

[0009]

[Operation] As shown in FIG. 1, in response to an execution instruction from a user, the execution monitoring unit 4 refers to the monitoring point table 9 at the time of interruption and manages the operation when it is determined that the program is at the entrance. Create a table 10, set the called program name, link it, and when it is determined that it is the exit of the procedure, delete the corresponding operation management table 10, and respond to the execution path output instruction from the user. Then, the output control unit 5 searches the linked operation management table 10, calculates and outputs the number of recursive calls in which a program calls its own program, and records the calling relationships of other programs individually. I am trying to output it.

[0010] Therefore, by collectively outputting recursive calls in which the program names of the caller and callee match, it is possible to reduce the amount of output when instructing to output the execution path, and It becomes possible for the debugger to output the execution path regardless of the program operation rules.

[0011]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the structure and operation of an embodiment of the present invention will be explained in detail with reference to FIGS. 1 to 4. In FIG. 1, an input unit 1 is used to input commands for monitoring, execution, and output. A monitoring instruction can be, for example, when the user inputs the command AT 000100 and sets a monitoring point at statement number 000100 specified by this parameter (saved the original instruction, embedded SVC aa here, and passed control to the debugger. setting). As for the execution instruction, the user inputs a command GO, for example, to restart execution of the execution program. For example, the output instruction is command B
The user inputs ACKTR to cause the execution path to be output.

The processing unit 2 performs debugging processing, and includes a monitoring point setting unit 3 that sets monitoring points based on the monitoring point table 9 to create the operation management table 10, and a monitoring point setting unit 3 that performs debugging processing from the input unit 1. The execution monitoring unit 4 creates an operation management table 10 based on the monitoring point table 9, sets a program name, releases the program, etc. during execution of the execution program 7 in response to an instruction, and output instructions from the input unit 1 The control section 5 includes an output control section 5, etc., which refers to the operation management table 10 to determine the number of restart calls and outputs (displays) the execution path.

The memory 6 is a memory for loading and executing an execution program 7 in an executable format obtained by translating a source program. The debug information area 8 contains a statement information table that stores the correspondence between the statement numbers of the source program collected at the time of translation of the source program and the addresses of the translated execution program 7, as well as monitoring points set by the user (program entrances, This is an area for storing the monitoring point table 9, etc., which stores the addresses (exits) and their types.

The monitoring point table 9 stores the program entrance address, exit address, and type of monitoring points set by the user (described later using (a) and (b) in FIG. 3). The operation management table 10 is a table in which the name of a program called at the entrance of a monitoring point is set and linked, and is a table in which the name of a program called at a monitoring point during debugging is set and managed. The operation management table 10 is linked so that the order of programs can be known. By referring to this operation management table 10, the program calling relationship at the current monitoring point (interruption point) can be displayed (see (e) in FIG. 3).

The execution path output device 11 displays on a display or prints the execution path (program call relationship, etc.) determined by the output control section 5 with reference to the operation management table 10. . FIG. 2 shows an example source program/execution program. (a) in Figure 2 is
An example of a source program is shown. This is the program name: ma
The program name: func is called from in as shown by the arrow in the figure, and the program returns. At this time, the program: func
Recursive calls are indicated using dotted arrows within 10
I've been there twice.

FIG. 2B schematically represents an executable program in an executable format obtained by translating the source program shown in FIG. 2A. Here, program name: mai
Program name, as indicated by the solid arrow from n:
Call func and give this called program name:
After performing a recursive call as shown by the dotted arrow in func, the program returns to the original program name: main.

FIG. 3 shows a diagram illustrating a specific example of the present invention. FIG. 3A shows an example of the format of the monitoring point table. The monitoring point table 9 stores the addresses of monitoring points set in the execution program (monitoring point addresses) and the types of entrances, exits, etc. FIG. 3B shows an example of a monitoring point table. This is the program name of (b) execution program 7 in Figure 2: main entrance address 000100
, exit address 000328, and program name: f
The entry address 00032C and exit address 0003C8 of unc are stored as shown in the figure.

FIG. 3C shows an example of the format of the operation management table. (b) When execution program 7 in Figure 2 is executed and interrupted at a monitoring point, the name of the program created and called at the time of entry is set, and the calling relationship with other program operation management tables (this program The link to the program operation management table 10 of the program that called the program is stored. On the other hand, when exiting, it is deleted.

FIG. 3(D) shows an example of an operation management table. This executes the execution program 7 and calls the program name at the monitoring point as shown in the figure, func, fu.
A state is shown in which the operation management table 10 is created and sequentially linked to the top of the chain, such as nc...func, main. In this state, it is found that the program name func has been called recursively three times, so this is called func recursive ca in (e) in Figure 3.
lled 3 times. It is summarized by the number of recursive calls. As a result, what was conventionally displayed in three lines is consolidated into one line, making it possible to reduce the amount of execution route output and to display the information in an easy-to-read manner.

Next, the operation of the present invention will be explained in detail in accordance with the order shown in the flowchart of FIG. 4 and with reference to FIG. (A) in FIG. 4 shows processing when the execution program is running. This is a process performed in response to the user inputting the command GO to instruct the restart of the execution program.

In (a) of FIG. 4, S1 is SVC
It is determined whether or not it is aa. This means that the user can use the command G
O is input to restart the execution of the execution program 7, and it is determined whether or not the execution program 7 is sequentially executed and the preset monitoring point SVC aa is executed, and control is passed to the execution monitoring unit 4. If YES, the process advances to S2 and subsequent steps. If NO, it is not SVC aa, so other processing continues.

[0022] In S2, it is determined whether the point is a monitoring point or not. YES
In this case, the monitoring point table (see (b) monitoring point table in FIG. 3) is further referred to to determine whether the type of monitoring point is an entrance or an exit. If the type of monitoring point is an entrance, an operation management table 10 is created in S3, and the name of the called program is set in it (Figure 3
(See operation management table 10 in (d)). Further, if the type of the monitoring point is an exit, the corresponding operation management table 10 is deleted from the link in S4.

By repeating the above process, for example, the program name in the execution program (b) in FIG.
If you call program name: func from n and then recursively call itself with this called program name: func, the called program names will be linked in order, as shown in (d) in Figure 3. Remember relationships.

Next, (b) of FIG. 4 shows the processing when an execution route output instruction is given. This is a process performed in response to the user inputting the command BACKTR to instruct output of the execution path under the interrupted state. In (b) of FIG. 4, S11 determines whether or not the operation management table 10 is linked. If yes (if there is a program being called), the process advances to S12. If none, there is no program being called, so
Finish the process.

In S12, the number of recursive calls is initialized to 0. In step S13, the program name in the current operation management table 10 is checked. For example, as the program name of the interrupted current operation management table 10 in (d) of FIG. 3, the func at the head of the chain is checked. In S14, the program name in the calling source operation management table 10 is checked.

[0026] In S15, it is determined whether the two are equal. These S13, S14, and S15 are, for example, the program name func of the operation management table 10 at the head of the chain in S13 in the operation management table example (d) in FIG. It is determined whether the program name func of the second) operation management table 10 is the same, that is, whether or not it is a recursive call. If YES, it is determined that it is a recursive call, so the number of recursive calls is incremented by 1 in S16, the target is set to the next operation management table 10 in S17, and S13 and subsequent steps are repeated. On the other hand, in the case of NO, it turns out that it is not a recursive call, so S18
These recursive calls are output as an execution path, and the process advances to S19.

In S19, it is determined whether the number of recursive calls is 0 or not. If YES, the next operation management table 10 is set as the target in S20, and the process advances to S21. If NO, the process advances to S21. In S21, if there is the following, S11
Repeat the following steps, and if there is no next step, exit (EN
D).

Through the above processing, in response to the input of the output instruction command BACKTR at the time of interruption, the operation management tables 10 linked from the top of the chain are sequentially traced as shown in (d) of FIG. 3, and recursive calls are made. After calculating the number of times and summarizing them, as shown in the output example (e) in Figure 3,
recusive called 3 times. By displaying the conventional three lines in one line, the amount of execution path output can be reduced, and when displayed on the screen, it will not be missed because it is displayed on the next screen.

[0029]

[Effects of the Invention] As explained above, according to the present invention,
Program calling relationships during execution of the execution program 7 are set and linked in the operation management table 10, and the number of recursive calls is calculated by referring to these linked operation management tables 10 in response to an execution path output instruction. Since this configuration is adopted, it is possible to reduce the amount of output when the execution path output is instructed, and the debugger can display the names of related programs called in the operation management table 10 regardless of the program operation rules. By storing the information and outputting the execution path based on this information, the execution path can be reliably output regardless of the operating rules of the program.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing the principle configuration of the present invention.

FIG. 2 is an example of a source program/execution program.

FIG. 3 is a diagram illustrating a specific example of the present invention.

FIG. 4 is a flowchart explaining the operation of the present invention.

FIG. 5 is an explanatory diagram of the prior art.

[Explanation of symbols]

1: Input section 2: Processing section 3: Monitoring point setting section 4: Execution monitoring unit 5: Output control section 6: Memory 7: Execution program 8: Debug information area 9: Monitoring point table 10: Operation management table 11: Execution path output device

Claims (1)

[Claims] 1. An execution path output method for outputting an execution path at the time of recursive call, comprising: a monitoring point table (9) storing the types and addresses of the entry and exit of a program (procedure) instructed to be monitored in an execution program; , an operation management table (10) that sets and links the name of the program called at the entrance of the monitoring point, and in response to an execution instruction from the user, performs the above operation when the interruption occurs at the entrance of the program. Create a management table (10), set the called program name, link it, and create the operation management table (10) that corresponds to the exit of the procedure.
0) is repeated, and in response to an execution path output instruction from the user, the linked operation management table (10) is searched to find the recursive call where the program is calling its own program. A method for outputting an execution path during recursive calls, characterized in that the number of times of recursive calls is calculated and outputted all at once, and other programs are configured to output call relationships individually.