公开(公告)号：US07519961B2

公开(公告)日：2009-04-14

申请号：US10777742

申请日：2004-02-12

申请人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

发明人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

IPC分类号： G06F9/44 ,  G06F11/30 ,  G06F11/36

CPC分类号： G06F11/3447 ,  G06F11/3466 ,  G06F2201/835 ,  G06F2201/865

摘要： A method and apparatus for averaging out variations from run to run of a computer program are provided. With the apparatus and method, call trees are generated for two or more executions of a build of a computer program. The apparatus and method perform a “tree-addition” operation in which the two or more call trees generated during runs of the computer program are added to one another to thereby accumulate statistics for each call in the call trees. These statistics may then be divided by the number of runs whose tree data structures are being accumulated. In this way, an average of the tree data structures is generated. In addition, any portions of the tree data structure that are due to asynchronous events are averaged out so that their relative affect in the resulting tree data structure is minimized.

摘要翻译： 提供了一种从计算机程序的运行到运行的平均化的方法和装置。 利用设备和方法，生成用于构建计算机程序的两次或多次执行的调用树。 该装置和方法执行“树添加”操作，其中在计算机程序运行期间生成的两个或多个呼叫树彼此相加，从而累积对呼叫树中的每个呼叫的统计。 然后可以将这些统计信息除以树数据结构正在被累积的运行次数。 以这种方式，生成树数据结构的平均值。 此外，由于异步事件导致的树数据结构的任何部分被平均化，使得它们在所得到的树数据结构中的相对影响被最小化。

公开(公告)号：US07506330B2

公开(公告)日：2009-03-17

申请号：US10777872

申请日：2004-02-12

申请人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Kean G. Kuiper ,  Frank Eliot Levine ,  Robert John Urquhart

发明人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Kean G. Kuiper ,  Frank Eliot Levine ,  Robert John Urquhart

IPC分类号： G06F9/45

CPC分类号： G06F11/3447 ,  G06F11/3466 ,  G06F11/3604 ,  G06F2201/865

摘要： A method and apparatus for identifying differences in runs of a computer program that are due to changes in the code of the computer program. With the apparatus and method, call trees are generated for two or more builds of a computer program. The apparatus and method perform a “tree-subtract” operation in which the two or more call trees generated during runs of two or more different builds of a computer program are subtracted from one another to identify build to build differences in the execution of the computer program. From the resulting tree, portions of the runs of the different builds of the computer program where the resource utilization of the computer program has not changed are easily identifiable. Moreover, portions of the runs of the different builds of the computer program where there are improvements or regressions in resource utilization of the computer program may be easily identifiable.

摘要翻译： 一种用于识别计算机程序运行中由于计算机程序的代码变化而导致的差异的方法和装置。 使用该设备和方法，可以为计算机程序的两个或多个构建生成调用树。 该装置和方法执行“减法”操作，其中在计算机程序的两个或多个不同构建的运行期间产生的两个或更多个调用树从彼此中减去以识别构建以构建计算机的执行中的差异 程序。 从结果树中，计算机程序的资源利用率未改变的计算机程序的不同构建的运行的部分容易识别。 此外，计算机程序的资源利用的改进或回归的计算机程序的不同构建的运行的部分可以容易地识别。

公开(公告)号：US20120311543A1

公开(公告)日：2012-12-06

申请号：US13585320

申请日：2012-08-14

申请人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

发明人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

IPC分类号： G06F9/44

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.

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

公开(公告)号：US07386690B2

公开(公告)日：2008-06-10

申请号：US10835106

申请日：2004-04-29

申请人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

发明人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

IPC分类号： G06F12/00

CPC分类号： G06F8/437

摘要： A method, apparatus, and computer instructions in a processor for associating a data type with a memory location. The type is associated with a location by means of metadata that is generated and manipulated by hardware instructions that are typically generated by a compiler as it generates the other instructions that comprise the machine code version of a program. A determination is made as to whether a data value about to be stored is of the required data type for that location. The hardware indicates an error condition if the types do not match.

摘要翻译： 一种用于将数据类型与存储器位置相关联的处理器中的方法，装置和计算机指令。 该类型通过由编译器生成并由编译器生成包括程序的机器码版本的其他指令的硬件指令生成和操纵的元数据与一个位置相关联。 确定要存储的数据值是否是该位置所需的数据类型。 如果类型不匹配，则硬件指示错误条件。

公开(公告)号：US07269718B2

公开(公告)日：2007-09-11

申请号：US10835484

申请日：2004-04-29

申请人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

发明人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

IPC分类号： G06F9/44

CPC分类号： G06F9/30192 ,  G06F8/41 ,  G06F9/30043 ,  G06F9/3853 ,  G06F9/3861 ,  G06F11/0751 ,  G06F11/3624 ,  G06F11/366

摘要： A method, apparatus, and computer instructions in a processor for performing arithmetic operations. A data type associated with a particular memory location is used to determine if an operation about to be performed on the data in that location is legal. If the operation requires the data to have a required data type, a determination is made as to whether the operation is a legal operation based on the identified data type and the required data type. If the operation is not legal on the identified type, a determination is made as to whether data can be cast to change the identified data type to the required data type. The data is cast to the required data type if the data can be cast to form modified data, and the arithmetic operation is performed on the modified data. If the data cannot be cast to the Required type, an exception or interrupt is generated.

摘要翻译： 一种用于执行算术运算的处理器中的方法，装置和计算机指令。 与特定存储器位置相关联的数据类型用于确定是否对该位置的数据执行操作是合法的。 如果操作需要数据具有所需的数据类型，则基于所识别的数据类型和所需的数据类型确定操作是否是合法操作。 如果操作在所识别的类型上不合法，则确定是否可以投射数据以将所识别的数据类型改变为所需数据类型。 如果可以将数据转换为形式的修改数据，则将数据转换为所需的数据类型，并对修改的数据执行算术运算。 如果数据不能转换为必需类型，则会生成异常或中断。

公开(公告)号：US08266595B2

公开(公告)日：2012-09-11

申请号：US10777909

申请日：2004-02-12

申请人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

发明人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

IPC分类号： G06F9/44

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.

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

公开(公告)号：US07647457B2

公开(公告)日：2010-01-12

申请号：US12109103

申请日：2008-04-24

申请人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

发明人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

IPC分类号： G06F12/00

CPC分类号： G06F8/437

摘要： A method, apparatus, and computer instructions in a processor for associating a data type with a memory location. The type is associated with a location by means of metadata that is generated and manipulated by hardware instructions that are typically generated by a compiler as it generates the other instructions that comprise the machine code version of a program. A determination is made as to whether a data value about to be stored is of the required data type for that location. The hardware indicates an error condition if the types do not match.

摘要翻译： 一种用于将数据类型与存储器位置相关联的处理器中的方法，装置和计算机指令。 该类型通过由编译器生成并由编译器生成包括程序的机器码版本的其他指令的硬件指令生成和操纵的元数据与一个位置相关联。 确定要存储的数据值是否是该位置所需的数据类型。 如果类型不匹配，则硬件指示错误条件。

公开(公告)号：US07328374B2

公开(公告)日：2008-02-05

申请号：US10835485

申请日：2004-04-29

申请人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

发明人： William Preston Alexander, III ,  Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

IPC分类号： G06F11/00

CPC分类号： G06F11/3612

摘要： A method, apparatus, and computer instructions in a processor for checking assertions. A determination by the processor is made as to whether metadata for an assertion is associated with the memory location, in response to detecting a change in data in a memory location. The data to the assertion is compared by the processor, in response to the metadata being associated with the memory location. An error is generated by the processor if the assertion is invalid, with respect to the data. The processor checks the assertions for validity.

摘要翻译： 一种用于检查断言的处理器中的方法，装置和计算机指令。 响应于检测到存储器位置中的数据的改变，由处理器确定用于断言的元数据是否与存储器位置相关联。 响应于与存储器位置相关联的元数据，由处理器比较到断言的数据。 如果关于数据的断言无效，处理器会产生错误。 处理器检查断言的有效性。

公开(公告)号：US07496900B2

公开(公告)日：2009-02-24

申请号：US10777743

申请日：2004-02-12

申请人： Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

发明人： Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

IPC分类号： G06F9/44

CPC分类号： G06F11/36

摘要： A method and apparatus for automatically performing regression processing on trace data are provided. With the apparatus and method, call tree data structures are generated for two or more executions of two or more builds of a computer program. The apparatus and method perform a “tree-minimization” operation on each set of call tree data structures for each of the builds to generate minimized call tree data structures for each build of the computer program. The minimized call tree data structures are then subtracted from one another to generate a subtracted minimized call tree data structure. From this subtracted minimized call tree data structure, the portions of the computer program that are different from build to build and which appreciably and consistently affect the difference in execution of the computer program from build to build may be identified. Thus, the analyst's attention is directed to these areas of the computer program code which may be optimized in order to obtain better execution of the computer program.

摘要翻译： 提供了一种用于自动执行跟踪数据的回归处理的方法和装置。 利用该设备和方法，生成两个或更多个计算机程序构建的两个或多个执行的调用树数据结构。 该装置和方法对每个构建的每一组呼叫树数据结构执行“树最小化”操作，以便为计算机程序的每个构建生成最小化的调用树数据结构。 然后将最小化的呼叫树数据结构从彼此中减去以产生减去最小化的呼叫树数据结构。 从该减去的最小化调用树数据结构中，可以识别与构建构建不同的计算机程序的部分，并且可以明确地和一致地影响计算机程序从构建到构建的执行的差异。 因此，分析师的注意力是针对计算机程序代码的这些区域，其可以被优化以便获得更好的计算机程序的执行。

公开(公告)号：US07299319B2

公开(公告)日：2007-11-20

申请号：US10807094

申请日：2004-03-22

申请人： Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

发明人： Robert Tod Dimpsey ,  Frank Eliot Levine ,  Robert John Urquhart

IPC分类号： G06F12/00

CPC分类号： G06F11/3466 ,  G06F11/3676 ,  G06F2201/865 ,  G06F2201/88

摘要： A method, apparatus, and computer instructions for generating coverage data during execution of code in the data processing system. During execution of the code, a determination is made as to whether an access indicator is associated with an instruction in response to executing the instruction in the code by a processor in the data processing system. If the access indicator is associated with the instruction, a state of the access indicator is changed, by the processor, when the instruction is executed. In this manner, coverage data for executed instructions is generated by the processor during execution of the code.

摘要翻译： 一种用于在数据处理系统中的代码执行期间生成覆盖数据的方法，装置和计算机指令。 在代码执行期间，响应于数据处理系统中的处理器执行代码中的指令，确定访问指示符是否与指令相关联。 如果访问指示符与指令相关联，则当指令被执行时，处理器改变访问指示符的状态。 以这种方式，执行代码期间由处理器产生执行指令的覆盖数据。