公开(公告)号：US08171457B2

公开(公告)日：2012-05-01

申请号：US12185254

申请日：2008-08-04

申请人： Robert T. Dimpsey ,  Frank E. Levine ,  Robert J. Urquhart

发明人： Robert T. Dimpsey ,  Frank E. Levine ,  Robert J. Urquhart

IPC分类号： G06F9/44 ,  G06F12/00

CPC分类号： G06F11/3476 ,  G06F11/348 ,  G06F11/3676

摘要： Illustrative embodiments disclose presenting coverage data relating to data access occurring during execution of code. The coverage data containing data access indicators associated with memory locations is obtained. The data access indicators that have been set by a processor in the data processing system in response to access of the memory locations during execution of the code by the processor are identified to form set data access indicators. Each set instruction access indicator is associated with a portion of the memory locations allocated for the code. A presentation for coverage data is generated, wherein the set data access indicators are identified in the presentation.

摘要翻译： 说明性实施例公开了呈现与执行代码期间发生的数据访问有关的覆盖数据。 获得包含与存储器位置相关联的数据访问指示符的覆盖数据。 由数据处理系统中的处理器响应于处理器执行代码期间的存储器位置的访问而设置的数据访问指示符被识别以形成设置数据访问指示符。 每个设置的指令访问指示符与为代码分配的存储器位置的一部分相关联。 生成用于覆盖数据的呈现，其中在呈现中识别所设置的数据访问指示符。

公开(公告)号：US08843898B2

公开(公告)日：2014-09-23

申请号：US13585320

申请日：2012-08-14

申请人： William P. Alexander, III ,  Robert T. Dimpsey ,  Frank E. Levine ,  Robert J. Urquhart

发明人： William P. Alexander, III ,  Robert T. Dimpsey ,  Frank E. Levine ,  Robert J. Urquhart

IPC分类号： G06F9/44 ,  G06F9/45

CPC分类号： G06F8/443

摘要： A method and apparatus for identifying a minimum call tree data structure from a plurality of call tree data structures are provided. With the apparatus and method, call tree data structures are generated for two or more executions of a build of a computer program. The apparatus and method perform a “tree-minimization” operation in which the two or more call trees generated during runs of the computer program are walked and only those nodes that are present in each of the tree data structures are maintained in a minimized tree data structure. In addition, the minimum values for these common nodes are maintained in the minimized tree data structure. In this way, asynchronous events are removed from the minimum tree data structure and analysis may focus on those areas of the computer program that are consistent between runs of the computer program.

摘要翻译： 提供了一种用于从多个呼叫树数据结构中识别最小呼叫树数据结构的方法和装置。 利用该装置和方法，生成用于构建计算机程序的两个或多个执行的调用树数据结构。 该装置和方法执行“树最小化”操作，其中在计算机程序运行期间生成的两个或更多个调用树被移动，并且仅存在于每个树数据结构中的那些节点保持在最小化的树数据中 结构体。 此外，这些公共节点的最小值保持在最小化的树数据结构中。 以这种方式，从最小树数据结构中去除异步事件，并且分析可以集中在计算机程序的运行之间一致的计算机程序的那些区域。