Setting Breakpoints Using an Interactive Graph Representing an Application

• US 20140189650A1
• Filed: 05/21/2013
• Published: 07/03/2014
• Est. Priority Date: 05/21/2013
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Concurix Corporation
• Inventors: Gounares, Alexander G.
• Application Number:
  US13/899,503
• Publication Number:
  US 20140189650A1
• Time in Patent Office: Days
• US Class Current: 717/125
• CPC Class Codes: G06F 11/3636 by tracing the execution of the program
• CPC Class Codes: G06F 11/3664 Environments for testing or debugging software

Abstract

Breakpoints may be set by selecting nodes on a graph depicting code elements and relationships between code elements. The graph may be derived from tracing data, and may reflect the observed code elements and the observed interactions between code elements. In many cases, the graph may include performance indicators. The breakpoints may include conditions which depend on performance related metrics, among other things. In some embodiments, the nodes may reflect individual instances of specific code elements, while other embodiments may present nodes as the same code elements that may be utilized by different threads. The breakpoints may include parameters or conditions that may be thread-specific.

Claims

1. A method performed on a computer processor, said method comprising:

displaying a graph having nodes representing code elements and edges representing relationships between said code elements;

receiving a selection identifying a first node, said first node being selected from an interactive selection mechanism on said graph, said first node representing a first code element;

identifying a first object related to said first relationship;

displaying said first object; and

receiving a breakpoint definition for said first breakpoint.

2. The method of claim 1 further comprising:

causing said code elements to execute until said breakpoint has been satisfied.

3. The method of claim 2 further comprising:

identifying a plurality of objects related to said first code element; and

displaying at least a portion of said plurality of objects.

4. The method of claim 2 further comprising:

receiving an update for said graph; and

displaying said graph with said update.

5. The method of claim 4, said update being received in at least near real time.

6. The method of claim 2, said breakpoint being satisfied when execution reaches a second code element.

7. The method of claim 6 further comprising:

displaying a highlight at said second code element when said breakpoint has been satisfied.

8. The method of claim 1 further comprising:

receiving graph data representing code elements and relationships between said code elements, said graph data being generated from a tracing system.

9. The method of claim 8 further comprising:

identifying a change to said graph data; and

transmitting said change to said tracing system.

10. A method performed on a computer processor, said method comprising:

displaying a graph having nodes representing code elements and edges representing relationships between said code elements;

receiving a selection identifying a first edge;

identifying a first relationship represented by said first edge;

identifying a first code element and a second code element related to said first relationship; and

displaying at least one object relating to said first relationship.

11. The method of claim 10, said relationships being functional relationships.

12. The method of claim 10, said functional relationships being function calls between said code elements.

13. The method of claim 10, said functional relationships comprising shared memory.

14. The method of claim 10, said functional relationships being determined through static code analysis.

15. The method of claim 10, said functional relationships being determined through dynamic monitoring of said code elements.

16. The method of claim 10, said selection being made through an interactive element on said graph.