Static performance analysis service

Patent metadata

Field	Value
Publication number	US-11269604-B1
Application number	US-202117349038-A
Country	US
Kind code	B1
Filing date	Jun 16, 2021
Priority date	Jun 16, 2021
Publication date	Mar 8, 2022
Grant date	Mar 8, 2022

Abstract

A system and method for analyzing a performance of computer code. A method includes scanning a graph to identify a plurality of calls to executable code, individual nodes of the graph representing different calls to be taken by the executable code; determining a score for individual nodes of the graph based on resources required to perform the call represented by that node, the call being one that consumes substantial resources of a computing system to accomplish an operation; adjusting the score of individual nodes that are associated with repetitive action nodes in the graph; and generating recommendations to improve performance of the computer code based on scores indicative of substantial resource consumption.

First claim

What is claimed is:

1. A system, comprising:
a memory; and
a processor coupled to the memory and configured to provide a performance analysis of computer code, including:
scanning a graph to identify a plurality of calls to executable code, individual nodes of the graph representing different calls to be taken by the executable code;
determining a score for individual nodes of the graph based on resources required to perform the call represented by that node, the call being one that consumes substantial resources of a computing system to accomplish an operation;
adjusting the score of individual nodes that are associated with repetitive action nodes in the graph; and
generating recommendations to improve performance of the computer code based on scores indicative of substantial resource consumption.

2. The system of claim 1 , wherein calls that consume substantial resources include database calls, disk input/output (IO) calls, memory allocations and network IO calls.

3. The system of claim 1 , wherein the graph includes a call graph and calls that consume substantial resources are identified by evaluating call names.

4. The system of claim 1 , wherein repetitive action nodes include loop nodes, and the score for a given node associated with at least one loop node is adjusted by multiplying the score with a multiplier value for each loop within which the given node resides.

5. The system of claim 4 , wherein a graph score is a sum of all of the scores in the graph.

6. The system of claim 1 , wherein the analysis further includes generating at least one graph from the computer code.

7. The system of claim 1 , wherein the analysis further includes receiving as input a specified portion of the computer code to be analyzed, wherein the specified portion includes one of a method, a class or a branch.

8. The system of claim 1 , wherein the computer code includes source code stored in a code repository.

9. The system of claim 1 , wherein the score for each node is commensurate with a cost to execute each associated call during runtime.

10. The system of claim 1 , wherein generating recommendations includes outputting proposed modifications to the computer code.

11. A computerized method to provide a performance analysis of computer code, the method comprising:
scanning a graph to identify a plurality of calls to executable code, individual nodes of the graph representing different calls to be taken by the executable code;
determining a score for individual nodes of the graph based on resources required to perform the call represented by that node, the call being one that consumes substantial resources of a computing system to accomplish an operation;
adjusting the score of individual nodes that are associated with repetitive action nodes in the graph; and
generating recommendations to improve performance of the computer code based on scores indicative of substantial resource consumption.

12. The method of claim 11 , wherein calls that consume substantial resources include database calls, disk input/output (IO) calls, memory allocations and network IO calls.

13. The method of claim 11 , wherein the graph includes a call graph and calls that consume substantial resources are identified by evaluating call names.

14. The method of claim 11 , wherein repetitive action nodes include loop nodes, and the score for a given node associated with at least one loop node is adjusted by multiplying the score with a multiplier value for each loop within which the given node resides.

15. The method of claim 14 , wherein a graph score is a sum of all of the scores in the graph.

16. The method of claim 11 , further comprising generating at least one graph from the computer code.

17. The method of claim 11 , further including receiving as input a specified portion of the computer code to be analyzed, wherein the specified portion includes one of a method, a class or a branch.

18. The method of claim 11 , wherein the computer code includes source code stored in a code repository.

19. The method of claim 11 , wherein the score for each node is commensurate with a cost to execute each associated call during runtime.

20. The method of claim 11 , wherein generating recommendations includes outputting proposed modifications to the computer code.

Assignees

• Citrix Systems Inc

Inventors

• Parihar Himanshu
• Aristilde Max
• Mathur Nitin Kumar

Classifications

• G06F11/3604

  Analysis of software for verifying properties of programs (testing of software G06F11/3668) · CPC title

• G06F11/3466 Primary

  Performance evaluation by tracing or monitoring · CPC title

• G06F2201/865

  Monitoring of software · CPC title

• G06F11/3612

  by runtime analysis (performance monitoring G06F11/3466) · CPC title

• G06F8/77

  Software metrics · CPC title