TRACING A CALLTREE OF A SPECIFIED ROOT METHOD

• US 20100095278A1
• Filed: 10/09/2008
• Published: 04/15/2010
• Est. Priority Date: 10/09/2008
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Lakshminarayanachar, Venkataraghavan, Nageshappa, Prashanth K., Kalle, Prasanna K.
• Granted Patent: US 8,347,273 B2
• Time in Patent Office: Days
• US Class Current: 717/128
• CPC Class Codes: G06F 11/3636 by tracing the execution of the program

Abstract

A specification of a routine name of a root of a call tree and a specification of a desired depth of call tree tracing are obtained. Upon entering a given routine in a program, a determination is made whether the given routine is the root. Responsive to determining that the given one of the routines is the root, trace information for the routine forming the root is output. Furthermore, upon entering a given one of the routines called, directly or indirectly, by the routine forming the root, a determination is made whether the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth from the routine forming the root of the call tree; and if this is the case, trace information is output for given one of the routines called, directly or indirectly, by the routine forming the root of the call tree.

Claims

9. A computer program product comprising a computer useable medium including computer usable program code for call tree tracing in a program having a plurality of routines, the computer program product including:

computer usable program code for obtaining a specification of a routine name for one of the routines forming a root of the call tree;

computer usable program code for obtaining a specification of a desired depth of the call tree tracing;

computer usable program code for, upon entering a given one of the routines, determining whether the given one of the routines is the routine forming the root of the call tree; and

computer usable program code for, responsive to determining that the given one of the routines is the routine forming the root of the call tree;

outputting trace information for the routine forming the root of the call tree;

upon entering a given one of the routines called, directly or indirectly, by the routine forming the root of the call tree, determining whether the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth from the routine forming the root of the call tree; and

responsive to determining that the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth,

outputting trace information for the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree.

10. The computer program product of claim 9, wherein the steps are carried out by the computer usable program code substantially without access to source code of the program.

11. The computer program product of claim 9, further comprising computer usable program code for, responsive to determining that the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is not within the desired depth, not outputting trace information for the routine forming the root of the call tree.

12. The computer program product of claim 9, further comprising computer usable program code for tracing to an unlimited depth when the desired depth is specified as at least one predetermined value.

13. The computer program product of claim 9, further comprising computer usable program code for keeping track of whether the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth by employing a counter.

14. The computer program product of claim 13, further comprising computer usable program code for:

decrementing the counter upon entry to the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree; and

incrementing the counter upon exit from the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree.

15. The computer program product of claim 14, wherein the routine forming the root of the call tree is called by one of the given ones of the routines called, directly or indirectly, by the routine forming the root of the call tree, as part of a recursion, further comprising computer usable program code for re-setting the counter whenever the routine forming the root of the call tree is hit during the recursion.

16. The computer program product of claim 14, wherein the routine forming the root of the call tree is called by one of the given ones of the routines called, directly or indirectly, by the routine forming the root of the call tree, as part of a recursion, further comprising computer usable program code for not re-setting the counter whenever the routine forming the root of the call tree is hit during the recursion, whereby a total depth to which the method traces is based on the desired depth measured from a first invocation of the routine forming the root of the call tree.

17. A system for call tree tracing in a program having a plurality of routines, the system comprising:

a memory; and

at least one processor, coupled to the memory, and operative to

obtain a specification of a routine name for one of the routines forming a root of the call tree;

obtain a specification of a desired depth of the call tree tracing;

upon entering a given one of the routines, determine whether the given one of the routines is the routine forming the root of the call tree; and

responsive to determining that the given one of the routines is the routine forming the root of the call tree;

output trace information for the routine forming the root of the call tree;

upon entering a given one of the routines called, directly or indirectly, by the routine forming the root of the call tree, determine whether the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth from the routine forming the root of the call tree; and

responsive to determining that the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth, output trace information for the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree.

1. A method for call tree tracing in a program having a plurality of routines, the method comprising the steps of:

obtaining a specification of a routine name for one of the routines forming a root of the call tree;

obtaining a specification of a desired depth of the call tree tracing;

upon entering a given one of the routines, determining whether the given one of the routines is the routine forming the root of the call tree; and

responsive to determining that the given one of the routines is the routine forming the root of the call tree;

outputting trace information for the routine forming the root of the call tree;

upon entering a given one of the routines called, directly or indirectly, by the routine forming the root of the call tree, determining whether the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth from the routine forming the root of the call tree; and

responsive to determining that the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth,

outputting trace information for the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree.

2. The method of claim 1, wherein the steps are carried out substantially without access to source code of the program.

3. The method of claim 1, further comprising the additional step of, responsive to determining that the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is not within the desired depth, not outputting trace information for the routine forming the root of the call tree.

4. The method of claim 1, further comprising the additional step of tracing to an unlimited depth when the desired depth is specified as at least one predetermined value.

5. The method of claim 1, further comprising the additional step of keeping track of whether the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth by employing a counter.

6. The method of claim 5, further comprising the additional steps of:

decrementing the counter upon entry to the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree; and

incrementing the counter upon exit from the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree.

7. The method of claim 6, wherein the routine forming the root of the call tree is called by one of the given ones of the routines called, directly or indirectly, by the routine forming the root of the call tree, as part of a recursion, further comprising the additional step of re-setting the counter whenever the routine forming the root of the call tree is hit during the recursion.

8. The method of claim 6, wherein the routine forming the root of the call tree is called by one of the given ones of the routines called, directly or indirectly, by the routine forming the root of the call tree, as part of a recursion, further comprising the additional step of not re-setting the counter whenever the routine forming the root of the call tree is hit during the recursion, whereby a total depth to which the method traces is based on the desired depth measured from a first invocation of the routine forming the root of the call tree.

18. The system of claim 17, wherein the steps are carried out substantially without access to source code of the program.

20. The system of claim 17, further comprising the additional step of tracing to an unlimited depth when the desired depth is specified as at least one predetermined value.

21. The system of claim 17, further comprising the additional step of keeping track of whether the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth by employing a counter.

22. The system of claim 21, further comprising the additional steps of:

decrementing the counter upon entry to the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree; and

incrementing the counter upon exit from the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree.

23. The system of claim 22, wherein the routine forming the root of the call tree is called by one of the given ones of the routines called, directly or indirectly, by the routine forming the root of the call tree, as part of a recursion, further comprising the additional step of re-setting the counter whenever the routine forming the root of the call tree is hit during the recursion.

24. The system of claim 22, wherein the routine forming the root of the call tree is called by one of the given ones of the routines called, directly or indirectly, by the routine forming the root of the call tree, as part of a recursion, further comprising the additional step of not re-setting the counter whenever the routine forming the root of the call tree is hit during the recursion, whereby a total depth to which the method traces is based on the desired depth measured from a first invocation of the routine forming the root of the call tree.

18-1. The system of claim 17, further comprising the additional step of, responsive to determining that the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is not within the desired depth, not outputting trace information for the routine forming the root of the call tree.

25. A system for call tree tracing in a program having a plurality of routines, the system comprising:

means for obtaining a specification of a routine name for one of the routines forming a root of the call tree;

means for obtaining a specification of a desired depth of the call tree tracing;

means for, upon entering a given one of the routines, determining whether the given one of the routines is the routine forming the root of the call tree; and

means for, responsive to determining that the given one of the routines is the routine forming the root of the call tree;

outputting trace information for the routine forming the root of the call tree;

upon entering a given one of the routines called, directly or indirectly, by the routine forming the root of the call tree, determining whether the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth from the routine forming the root of the call tree; and

responsive to determining that the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth,

outputting trace information for the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree.