Analyzing problem signatures

• US 7,823,006 B2
• Filed: 05/29/2007
• Issued: 10/26/2010
• Est. Priority Date: 05/29/2007
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Kommineni, Vamshidhar Radha, Grant, David
• Primary Examiner(s): Beausoliel; Robert
• Assistant Examiner(s): Riad; Amine
• Application Number:
  US11/754,428
• Publication Number:
  US 20080301501A1
• Time in Patent Office: 1,246 Days
• Field of Search: 714/5
• US Class Current: 714/5.11
• CPC Class Codes: G06F 11/079 Root cause analysis, i.e. error or fault diagnosis in a hardware test environment G06F11/22; in a software test environment G06F11/36
• CPC Class Codes: G06F 11/366 using diagnostics G06F11/0703 takes precedence

Abstract

A method of analyzing problem data from a computer application is disclosed. The method evaluates a memory dump, identifying call stacks within the memory dump that are related to application failures, creates a hash of the identified call stack and adds the hash to a database. The database may then be evaluated to look for trends in the error data such as whether the same call stack is causing problems.

Claims

1. A method of sorting problem data from a computer application comprising:

evaluating a dump file;

identifying call stacks within the dump file that are related to application failures;

creating a hash of the identified call stack by concatenating an application module name and function name for each frame as an input to the hash function; and

adding the hash to a database.

2. The method of claim 1, wherein the hash classifies callstacks where symbols are available for all frames.

3. The method of claim 1, wherein creating a hash further comprises concatenating a module name and a function name along with a function offset in the module and using the result as an input to the hash function.

4. The method of claim 3, wherein the hash classifies callstacks where symbols are not available for all frames.

5. The method of claim 3, further comprising using the database of hashes to classify unique callstacks and probable code defects across a large number of dump files for issues for which valid symbols are not available.

6. The method of claim 1, wherein creating a hash further comprises concatenating an application module name, function name and function'"'"'s offset in the module for each frame group wherein the frame group comprises a contiguous set of functions within the same module.

7. The method of claim 6, wherein the hash classifies frame group signatures.

8. The method of claim 7, wherein the frame group signatures are used to analyze mid-stack groups responsible for a crash or hang across multiple dumps.

9. The method of claim 6, further comprising using the hashes to classify mid-level functions across a range of dump files to identify common code paths that may be responsible for all of the crashes even if symbols are not available for all modules.

10. The method of claim 1, further comprising performing statistical analysis on the database to further analyze the problem data.

11. The method of claim 10, further comprising analyzing the database to identify problems that are most prevalent.

12. A computer storage medium for storing computer executable code for sorting problem data from a computer application, the computer executable code comprising:

evaluating a dump file;

identifying call stacks within the dump file that are related to application failures;

creating a hash of the identified call stack wherein creating a hash further comprises concatenating an application module name and function name for each frame as an input to the hash function; and

adding the hash to a database.

13. The computer storage medium of claim 12, wherein creating a hash further comprises concatenating a module name and a function name along with a function offset in the module and using the result as an input to the hash function.

14. The computer storage medium of claim 13, further comprising using the database of hashes to classify unique callstacks and probable code defects across a large number of dump files for issues for which valid symbols are not available.

15. The computer storage medium of claim 12, wherein creating a hash further comprises concatenating an application module name, function name and function'"'"'s offset in the module for each frame group wherein the frame group comprises a contiguous set of functions within the same module.

16. The computer storage medium of claim 15, further comprising using the hashes to classify mid-level functions across a range of dump files to identify common code paths that may be responsible for all of the crashes even if symbols are not available for all modules.

17. The computer storage medium of claim 12, further comprising performing statistical analysis on the database to further analyze the problem data.

18. A computer system comprising a processor for executing computer executable instructions, a memory for storing computer executable instructions and an input output circuit, the processor being physically configured to execute computer executable code for sorting problem data from a computer application, the computer executable code comprising code for:

evaluating a dump file;

identifying call stacks within the dump file that are related to application failures;

creating a hash of the identified call stack wherein creating a hash further comprises concatenating an application module name and function name for each frame as an input to the hash function;

adding the hash to a database; and

performing statistical analysis on the database to further analyze the problem data.

19. The computer system of claim 18, wherein creating a hash further comprises concatenating a module name and a function name along with a function offset in the module and using the result as an input to the hash function.