Mapping a Class, Method, Package, and/or Pattern to a Component

• US 20100083228A1
• Filed: 09/30/2008
• Published: 04/01/2010
• Est. Priority Date: 09/30/2008
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Wisniewski, Robert E., Stecher, John Joseph, Branda, Steven Joseph
• Granted Patent: US 8,166,077 B2
• Time in Patent Office: Days
• US Class Current: 717/120
• CPC Class Codes: G06F 11/3466 Performance evaluation by tracing or monitoring
• CPC Class Codes: G06F 11/3612 by runtime analysis performance monitoring G06F11/3466
• CPC Class Codes: G06F 2201/865 Monitoring of software

Abstract

A program product, apparatuses, and methods provide for the collection of profile information for a component of a software program by generating a data structure that maps at least one method to a component. The method includes a name, and the data structure maps the method to the component using at least a portion of the name of the method. A class or pattern may also be mapped to a component. Furthermore, during profiling, a statistic associated with the execution of the method is determined; the data structure is accessed using the name of the method to determine the associated component; and the determined statistic is associated with the determined component. By doing so, method level and class level information can be aggregated to improve profiling, often leading to a clearer picture of which components are contributing to the performance and memory footprint of large scale software programs.

Claims

1. A method of collecting profile information for a component of a software program, the method comprising:

generating a data structure that maps at least one method to the component, wherein the method includes a name, and wherein the data structure maps the method to the component using at least a portion of the name of the method; and

in response to execution of the method by a profiler during profiling of the software program;

determining a statistic associated with the execution of the method;

accessing the data structure using the name of the method to determine the component associated with the method; and

associating the determined statistic with the determined component.

2. The method of claim 1, wherein mapping of the method to the component is based upon only the method.

3. The method of claim 1, wherein generating the data structure that maps at least one method to the component further comprises mapping the class associated with the method, and wherein the data structure maps the method and the class associated with the method to the component using the portion of the name of the method and using at least a portion of a name of the class.

4. The method of claim 1, wherein the data structure is a decision tree, the decision tree comprising a plurality of nodes.

5. The method of claim 4, wherein each character of the portion of the name of the method is associated with a node in the plurality of nodes.

6. The method of claim 5, wherein a first node in the plurality of nodes includes a first character of the portion of the name of the method, subsequent nodes in the plurality of nodes include subsequent characters of the portion of the name of the method, and a terminating node in the plurality of nodes includes a last character of the portion of the name of the method, and wherein each node associated with a character from the portion of the name of the method other than the first character is related as a child node to a parent node associated with an immediately preceding character from the portion of the name of the method.

7. The method of claim 5, further comprising associating a terminator flag with a node in the plurality of nodes, wherein the terminator flag is indicative of termination of the portion of the name of the method.

8. The method of claim 4, further comprising pruning at least a portion of the decision tree to remove extraneous information from the decision tree, wherein the extraneous information includes redundant information.

9. The method of claim 4, wherein the component mapped to the method is associated with a node in the plurality of nodes.

10. The method of claim 9, wherein the component mapped to the method is associated with a terminating node in the plurality of nodes.

11. The method of claim 1, wherein mapping of the method to the component is based upon input including the mapping of the method to the component.

12. The method of claim 1, wherein accessing the data structure involves a modified recursive depth first search algorithm.

13. The method of claim 1, wherein the data structure maps a plurality of methods to a plurality of components, wherein each method in the plurality of methods includes a name, and wherein the data structure maps the plurality of methods to the plurality of components using at least a portion of the names of the plurality of methods;

the method further comprising determining for at least one other method the component that the other method maps to based upon the generated data structure.

14. The method of claim 13, wherein determining for at least one other method the component that the other method maps to further comprises pruning the decision tree.

15. A method of collecting profile information for a component of a software program, the method comprising:

generating a data structure that maps at least one pattern to the component, wherein the pattern includes at least one name, wherein the pattern is associated with a method, and wherein the data structure maps the pattern to the component using at least a portion of the name of the pattern; and

in response to execution of the method by a profiler during profiling of the software program;

determining a statistic associated with the execution of the method;

accessing the data structure using a name of the method; and

associating the determined statistic with the determined component.

16. The method of claim 15, wherein the data structure is a decision tree, the decision tree comprising a plurality of nodes.

17. The method of claim 15, wherein the pattern is representative of a class and includes a name of the class, and wherein each character of the portion of the name of the class is associated with a node in the plurality of nodes.

18. The method of claim 15, wherein the pattern is representative of a package and includes a name of the package, and wherein each character of the portion of the name of the package is associated with a node in the plurality of nodes.

19. The method of claim 15, wherein the pattern is representative of a method and includes a name of the method, and wherein each character of the portion of the name of the method is associated with a node in the plurality of nodes.

20. An apparatus, comprising:

at least one memory;

at least one processor; and

program code configured to be executed by the processor to collect profile information for a component of a software program, the program code configured to generate a data structure that maps at least one method to the component, wherein the method includes a name, and wherein the data structure maps the method to the component using at least a portion of the name of the method; and

, in response to execution of the method by a profiler during profiling of the software program, determine a statistic associated with the execution of the method, access the data structure using the name of the method to determine the component associated with the method, and associate the determined statistic with the determined component.

21. The apparatus of claim 20, wherein the program code configured to generate a data structure that maps at least one method to the component is further configured to map the class associated with the method, and wherein the data structure maps the method and the class associated with the method to the component using the portion of the name of the method and using at least a portion of the name of the class.

22. The apparatus of claim 20, wherein the data structure is a decision tree, the decision tree comprising a plurality of nodes.

23. The apparatus of claim 22, wherein each character of the portion of the name of the method is associated with a node in the plurality of nodes and wherein the component mapped to the method is associated with a node in the plurality of nodes.

24. The apparatus of claim 20, wherein the data structure maps a plurality of methods to a plurality of components, wherein each method in the plurality of methods includes a name, and wherein the data structure maps the plurality of methods to the plurality of components using at least a portion of the names of the plurality of methods;

and the program code is further configured to determine for at least one other method the component that the other method maps to based upon the generated data structure.

25. An apparatus, comprising:

at least one memory;

at least one processor; and

program code configured to be executed by the processor to collect profile information for a component of a software program, the program code configured to generate a data structure that maps at least one pattern to the component, wherein the pattern includes at least one name, wherein the pattern is associated with a method, and wherein the data structure maps the pattern to the component using at least a portion of the name of the pattern; and

in response to execution of the method by a profiler during profiling of the software program;

determine a statistic associated with the execution of the method;

access the data structure using a name of the method; and

associate the determined statistic with the determined component.