US 11,537,374 B1Granted

System and method for hot method call graph analysis

AssigneeOracle International Corporation

InventorsMohamed Noureddine Bennani, Nathan Reynolds, Brian Maulding

Life of this patent

Estimating the term…

Loading patent…

Abstract

Systems and methods for hot method call graph analysis. An exemplary method can provide a hot method call graph analyzer. The method can receive a generated call graph, the generated call graph comprising a plurality of branches. The method can automatically traverse each branch of the generated call graph. For each traversed branch, the method can generate and store a list of leaf methods of each branch along with a corresponding execution time and number of samples of each leaf method, resulting in plurality of leaf method lists. The method can combine each of the plurality lists of leaf methods in an overall list of leaf methods of the generated call graph, resulting in a complete list of leaf methods of the generated call graph, which can be provided via, for example, a user interface. The systems and method described can additionally perform similar analysis for non-leaf methods.

Claims18

Dependent claims

A system for hot method call graph analysis, comprising:

a computer including one or more microprocessors;
a hot method call graph analyzer provided at the computer, wherein the hot method call graph analyzer:
receives a generated call graph, the generated call graph comprising a plurality of branches;
automatically traverses each branch of the generated call graph;
for each traversed branch, generates and stores a list of leaf methods of each branch along with a corresponding execution time or a number of samples of each leaf method, resulting in a plurality of leaf method lists;
combines each of the plurality of leaf method lists in an overall list of leaf methods of the generated call graph, resulting in a complete list of leaf methods of the generated call graph;
provides the complete list of leaf methods of the generated call graph via a user interface;
for each traversed branch, generates and stores a list of non-leaf methods of each branch along with a corresponding execution time and number of samples of each non-leaf method, resulting in a plurality of non-leaf method lists, wherein each non-leaf method within the plurality of non-leaf method lists comprises a distinct execution time or a number of samples;
combines each of the plurality lists of non-leaf methods in an overall list of non-leaf methods of the generated call graph, resulting in a complete list of non-leaf methods of the generated call graph;
and
provides the complete list of non-leaf methods of the generated call graph via the user interface.

8 more elements

A method for hot method call graph analysis, comprising:

providing a computer including one or more microprocessors;
providing a hot method call graph analyzer at the computer;
receiving a generated call graph, the generated call graph comprising a plurality of branches;
automatically traversing each branch of the generated call graph;
for each traversed branch, generating and storing a list of leaf methods of each branch along with a corresponding execution time or a number of samples of each leaf method, resulting in a plurality of leaf method lists;
combining each of the plurality of leaf method lists methods in an overall list of leaf methods of the generated call graph, resulting in a complete list of leaf methods of the generated call graph;
providing the complete list of leaf methods of the generated call graph via a user interface;
for each traversed branch, generating and storing a list of non-leaf methods of each branch along with a corresponding execution time and number of samples of each non-leaf method, resulting in a plurality of non-leaf method lists, wherein each non-leaf method within the plurality of non-leaf method lists comprises a distinct execution time and number of samples;
combining each of the plurality lists of non-leaf methods in an overall list of non-leaf methods of the generated call graph, resulting in a complete list of non-leaf methods of the generated call graph;
and
providing the complete list of non-leaf methods of the generated call graph via the user interface.

8 more elements

A non-transitory computer readable storage medium, having instructions for hot method call graph analysis, which when read and executed cause a computer to perform steps comprising:

providing a computer including one or more microprocessors;
providing a hot method call graph analyzer at the computer;
receiving a generated call graph, the generated call graph comprising a plurality of branches;
automatically traversing each branch of the generated call graph;
for each traversed branch, generating and storing a list of leaf methods of each branch along with a corresponding execution time or a number of samples of each leaf method, resulting in a plurality of leaf method lists;
combining each of the plurality of leaf method lists methods in an overall list of leaf methods of the generated call graph, resulting in a complete list of leaf methods of the generated call graph;
providing the complete list of leaf methods of the generated call graph via a user interface;
for each traversed branch, generating and storing a list of non-leaf methods of each branch along with a corresponding execution time and number of samples of each non-leaf method, resulting in a plurality of non-leaf method lists, wherein each non-leaf method within the plurality of non-leaf method lists comprises a distinct execution time and number of samples;
combining each of the plurality lists of non-leaf methods in an overall list of non-leaf methods of the generated call graph, resulting in a complete list of non-leaf methods of the generated call graph;
and
providing the complete list of non-leaf methods of the generated call graph via the user interface.

8 more elements

Dependencies are inferred from the claim text.