专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US6090155A Optimizing apparatus and method for defining visibility boundaries in compiled code 失效
标题翻译：用于定义编译代码中的可见性边界的优化设备和方法
公开(公告)号：US6090155A
公开(公告)日：2000-07-18
申请号：US461943
申请日：1995-06-05
申请人： Robert John Donovan , Daniel Rodman Hicks , James Albert Kryka , David John Lambert , Robert Ralph Roediger
发明人： Robert John Donovan , Daniel Rodman Hicks , James Albert Kryka , David John Lambert , Robert Ralph Roediger
IPC分类号： G06F9/45
CPC分类号： G06F8/443
摘要： Apparatus and a method are provided for defining visibility boundaries in compiled code of an optimizing compiler used with a digital computer for converting a source program to an object code. The source program is received and a first intermediate representation of the source program is generated. A pseudo operation representing a predetermined event is inserted in the first intermediate representation. Sequential operations of the first intermediate representation including the inserted pseudo operations are processed for defining an internal data structure of the source program. A visibility boundary for a selected variable is identified responsive to identifying a pseudo operation in the first intermediate representation.
摘要翻译：提供了一种设备和方法，用于定义与用于将源程序转换为目标代码的数字计算机一起使用的优化编译器的编译代码中的可见性边界。源程序被接收，并且生成源程序的第一中间表示。在第一中间表示中插入表示预定事件的伪操作。处理包括插入的伪操作的第一中间表示的顺序操作用于定义源程序的内部数据结构。响应于在第一中间表示中识别伪操作来识别所选变量的可见性边界。

2. 发明授权

US5784066A Method and apparatus for using partner information to color nodes in an interference graph within a computer system 失效
标题翻译：用于使用伙伴信息来在计算机系统内的干涉图中对彩色节点进行着色的方法和装置
公开(公告)号：US5784066A
公开(公告)日：1998-07-21
申请号：US562139
申请日：1995-11-22
申请人： Nava Arela Aizikowitz , Edward Curtis Prosser , Robert Ralph Roediger
发明人： Nava Arela Aizikowitz , Edward Curtis Prosser , Robert Ralph Roediger
IPC分类号： G06F9/45 , G06F15/00
CPC分类号： G06F8/441
摘要： A method and apparatus for coloring an interference graph eliminates register copy instructions in an instruction stream by taking into consideration the colors of a node's direct or transitive partners when choosing a color for a node. By assigning a color to a node that is also the color of a direct or transitive partner, register copy instructions between the two partners may be eliminated. If more than one of the partners at any given level are colored, one of the colors may be selected over the others using an appropriate heuristic, such as a scheme that weights the colors appropriately.
摘要翻译：用于着色干涉图的方法和装置通过在选择节点的颜色时考虑节点的直接或传递伙伴的颜色来消除指令流中的寄存器复制指令。通过将颜色分配给也是直接或传递伙伴的颜色的节点，可以消除两个伙伴之间的注册复制指令。如果任何给定级别的多个合作伙伴都被着色，则可以使用适当的启发式方法来选择其中一种颜色，例如适当地对颜色进行加权的方案。

3. 发明授权

US07120907B2 Unrolling loops with partial hot traces 失效
标题翻译：展开循环与部分热痕迹
公开(公告)号：US07120907B2
公开(公告)日：2006-10-10
申请号：US10650544
申请日：2003-08-28
申请人： Robert Ralph Roediger , William Jon Schmidt , Peter Jerome Steinmetz
发明人： Robert Ralph Roediger , William Jon Schmidt , Peter Jerome Steinmetz
IPC分类号： G06F9/45 , G06F15/00
CPC分类号： G06F8/443
摘要： Methods and apparatus are disclosed for improved loop unrolling by a compiler. A large class of loops exists for which effective loop unrolling has not previously been performed because they are too large to be completely unrolled, but which do not have a single hot trace that covers an entire loop iteration. The present invention recognizes such loops that have partial hot traces identified using profile data. A set of instructions which constitute a proper superset of the hot trace and a proper subset of the entire loop, and which forms a complete loop iteration is identified. This set of instructions can then be unrolled without unrolling the entire loop.
摘要翻译：公开了用于由编译器改进循环展开的方法和装置。存在一个大类的循环，由于它们太大而不能完全展开，因此没有执行有效循环展开，因为它们没有覆盖整个循环迭代的单个热跟踪。本发明识别使用简档数据识别的部分热迹的这种循环。识别构成热跟踪的正确超集和整个循环的适当子集并且形成完整循环迭代的一组指令。然后可以展开这组指令，而不会展开整个循环。

4. 发明授权

US06938249B2 Compiler apparatus and method for optimizing loops in a computer program 有权
标题翻译：用于优化计算机程序中的循环的编译器装置和方法
公开(公告)号：US06938249B2
公开(公告)日：2005-08-30
申请号：US09992324
申请日：2001-11-19
申请人： Robert Ralph Roediger , William Jon Schmidt
发明人： Robert Ralph Roediger , William Jon Schmidt
IPC分类号： G06F9/45 , G06F11/34
CPC分类号： G06F11/3466 , G06F8/443 , G06F2201/865
摘要： A profile-based loop optimizer generates an execution frequency table for each loop that gives more detailed profile data that allows making a more intelligent decision regarding if and how to optimize each loop in the computer program. The execution frequency table contains entries that correlate a number of times a loop is executed each time the loop is entered with a count of the occurrences of each number during the execution of an instrumented instruction stream. The execution frequency table is used to determine whether there is one dominant mode that appears in the profile data, and if so, optimizes the loop according to the dominant mode. The optimizer may perform optimizations by peeling a loop, by unrolling a loop, and by performing both peeling and unrolling on a loop according to the profile data in the execution frequency table for the loop. In this manner the execution time of the resulting code is minimized according to the detailed profile data in the execution frequency tables, resulting in a computer program with loops that are more fully optimized.
摘要翻译：基于配置文件的循环优化器为每个循环生成执行频率表，以提供更详细的配置文件数据，从而可以对计算机程序中的每个循环是否以及如何优化。执行频率表包含将在每次循环输入时执行循环的次数与执行被测试指令流期间每个数字的出现次数相关联的条目。执行频率表用于确定在配置文件数据中是否存在一个主要模式，如果是，则根据主导模式优化循环。优化器可以通过剥离循环，展开循环，以及根据循环的执行频率表中的轮廓数据在循环上执行剥离和展开来执行优化。以这种方式，根据执行频率表中的详细简档数据，最终得到的代码的执行时间最小化，从而导致具有更完全优化的循环的计算机程序。

5. 发明授权

US6029004A Method and apparatus for modular reordering of portions of a computer program based on profile data 失效
标题翻译：基于简档数据对计算机程序的部分进行模块化重排序的方法和装置
公开(公告)号：US6029004A
公开(公告)日：2000-02-22
申请号：US819526
申请日：1997-03-17
申请人： Vita Bortnikov , Bilha Mendelson , Mark Novick , Robert Ralph Roediger , William Jon Schmidt , Inbal Shavit-Lottem
发明人： Vita Bortnikov , Bilha Mendelson , Mark Novick , Robert Ralph Roediger , William Jon Schmidt , Inbal Shavit-Lottem
IPC分类号： G06F9/45 , G06F9/44
CPC分类号： G06F8/445
摘要： An apparatus and method reorder portions of a computer program in a way that achieves both enhanced performance and maintainability of the computer program. A global call graph is initially constructed that includes profile data. From the information in the global call graph, an intramodular call graph is generated for each module. Reordering techniques are used to reorder the procedures in each module according to the profile data in each intramodular call graph. An intermodular call graph is generated from the information in the global call graph. Reordering techniques are used to reorder the modules in the computer program. By reordering procedures within modules, then reordering the modules, enhanced performance is achieved without reordering procedures across module boundaries. Respecting module boundaries enhances the maintainability of the computer program by allowing a module to be replaced without adversely affecting the other modules while still providing many of the advantages of global procedure reordering.
摘要翻译：一种装置和方法以实现计算机程序的增强的性能和可维护性的方式重新排序计算机程序的部分。最初构建包括配置文件数据的全局调用图。从全局调用图中的信息，为每个模块生成一个集体内调用图。根据每个模块间调用图中的配置文件数据，重新排序技术用于对每个模块中的过程重新排序。从全局调用图中的信息生成一个多模式调用图。重新排序技术用于重新排序计算机程序中的模块。通过重新排序模块中的过程，然后重新排序模块，实现增强的性能，而无需跨模块边界重新排序过程。尊重模块边界通过允许更换模块而不会对其他模块产生不利影响，从而提高计算机程序的可维护性，同时仍然提供全局过程重新排序的许多优点。

6. 发明授权

US5774730A Method and apparatus for improving colorability of constrained nodes in an interference graph within a computer system 失效
标题翻译：用于改善计算机系统内的干涉图中约束节点的着色性的方法和装置
公开(公告)号：US5774730A
公开(公告)日：1998-06-30
申请号：US509637
申请日：1995-07-31
申请人： Nava Arela Aizikowitz , Liviu Asnash , Roy Bar-Haim , Orit Edelstein , Mircea Namolaru , Edward Curtis Prosser , Robert Ralph Roediger , William Jon Schmidt
发明人： Nava Arela Aizikowitz , Liviu Asnash , Roy Bar-Haim , Orit Edelstein , Mircea Namolaru , Edward Curtis Prosser , Robert Ralph Roediger , William Jon Schmidt
IPC分类号： G06F9/45
CPC分类号： G06F8/433 , G06F8/441
摘要： A method and apparatus for coloring an interference graph yields a higher number of colored nodes by taking into consideration the colors of neighbors of a node's uncolored constrained neighbors. By assigning a color to a node that is also the color of a neighbor of an uncolored constrained neighbor, one color constraint is removed, increasing the probability of coloring the uncolored constrained neighbor. If more than one of the neighbors of the uncolored constrained neighbors are colored, one of the colors may be selected over the others using an appropriate heuristic.
摘要翻译：通过考虑节点的未着色约束邻居的邻居的颜色，用于着色干涉图的方法和装置产生更多数量的彩色节点。通过将颜色分配给也是未着色约束邻居的邻居的颜色的节点，消除了一个颜色约束，增加了对着色约束邻居着色的可能性。如果超过一个未着色约束邻居的邻居被着色，则可以使用适当的启发式来选择其中一种颜色。

7. 发明授权

US06308324B1 Multi-stage profiler 失效
标题翻译：多级分析仪
公开(公告)号：US06308324B1
公开(公告)日：2001-10-23
申请号：US09329404
申请日：1999-06-10
申请人： Robert Ralph Roediger , William Jon Schmidt
发明人： Robert Ralph Roediger , William Jon Schmidt
IPC分类号： G06F945
CPC分类号： G06F11/3466 , G06F8/4451 , G06F2201/865 , G06F2201/88
摘要： A profiler that operates in a multi-stage environment is disclosed. As program code undergoes a series of transformations, branches of interest are selected and tracked. Regardless of how many transformations are involved only a single instrumentation/data gathering phase is required. The gathered profile data is then used to perform various optimizations at the differing transformation stages.
摘要翻译：公开了在多级环境中操作的分析器。随着程序代码经历一系列转换，选择和跟踪感兴趣的分支。无论涉及多少变革，只需要一个仪器/数据采集阶段。收集的轮廓数据然后用于在不同的转换阶段执行各种优化。

8. 发明授权

US5890000A Cooperation of global and local register allocators for better handling of procedures 失效
标题翻译：全球和地方登记分配者的合作，以更好地处理程序
公开(公告)号：US5890000A
公开(公告)日：1999-03-30
申请号：US760176
申请日：1996-12-04
申请人： Nava E. Aizikowitz , Roy N. Bar-Haim , Orit Edelstein , Edward Curtis Prosser , Robert Ralph Roediger
发明人： Nava E. Aizikowitz , Roy N. Bar-Haim , Orit Edelstein , Edward Curtis Prosser , Robert Ralph Roediger
IPC分类号： G06F9/45 , G06F9/44
CPC分类号： G06F8/441
摘要： A method and device for optimizing a compiler involves cooperation between the global and local register allocators in assigning symbolic registers to hardware registers. A large procedure may have many associated symbolic registers; the invention involves partitioning the symbolic registers into at least two portions, and allowing the global register allocator to assign one portion and the local register allocator to assign another portion. The registers may be partitioned based on different criteria, such as local vs. global registers, or spill costs, or shallow vs. nested regions.
摘要翻译：用于优化编译器的方法和装置涉及全局和本地寄存器分配器之间的协调，以将符号寄存器分配给硬件寄存器。一个大的过程可能有许多关联的符号寄存器; 本发明涉及将符号寄存器分成至少两个部分，并且允许全局寄存器分配器分配一个部分和本地寄存器分配器来分配另一部分。寄存器可以根据不同的标准进行分区，例如本地对全局寄存器，或溢出成本，或浅对嵌套区域。

9. 发明授权

US5761514A Register allocation method and apparatus for truncating runaway lifetimes of program variables in a computer system 失效
标题翻译：用于截断计算机系统中程序变量失控寿命的寄存器分配方法和装置
公开(公告)号：US5761514A
公开(公告)日：1998-06-02
申请号：US522052
申请日：1995-08-31
申请人： Nava Arela Aizikowitz , Roy Bar-Haim , Edward Curtis Prosser , Robert Ralph Roediger , William Jon Schmidt
发明人： Nava Arela Aizikowitz , Roy Bar-Haim , Edward Curtis Prosser , Robert Ralph Roediger , William Jon Schmidt
IPC分类号： G06F9/45
CPC分类号： G06F8/433 , G06F8/441
摘要： A method and apparatus for truncating runaway lifetimes of program variables calculates liveness for each variable based on upwardly exposed uses. Reaching definitions are then calculated for at least the program variables that have runaway lifetimes. The liveness information is compared to the reaching definition information to determine whether a variable that is live upon entry to a basic block has a definition that reaches the end of each predecessor block, or has a use within the basic block. If the reaching definition for a variable reaches the beginning of the block and if there is a predecessor block for which there is no reaching definition, the variable has a runaway lifetime. The variable also has a runaway lifetime if there is a use of the variable in a block without a reaching definition for the variable at the beginning of the block. The runaway lifetime is truncated by inserting an instruction such as a pseudo-definition of the variable into the instruction stream at an appropriate place. Once runaway lifetimes are truncated using this method, subsequent stages of the compiler may calculate liveness by performing a single dataflow analysis which calculates lifetimes based on upwardly exposed uses.
摘要翻译：用于截断程序变量的失效寿命的方法和装置根据向上暴露的使用来计算每个变量的活动性。然后对至少具有失效寿命的程序变量计算达到定义。将活动信息与达到的定义信息进行比较，以确定在输入到基本块时是否存在活动的变量具有到达每个前导块的结束的定义，或者在基本块内具有使用。如果变量的到达定义到达块的开头，并且如果存在没有到达定义的前导块，则该变量具有失控的生命周期。如果块中的变量使用块的开头处的变量没有达到定义，那么该变量也将失效。通过在适当的地方将诸如伪变量的伪定义的指令插入指令流来截断失控生命周期。一旦使用这种方法截断失效生命周期，编译器的后续阶段可以通过执行基于向上暴露的使用计算寿命的单个数据流分析来计算活动。

10. 发明授权

US07856618B2 Adaptively generating code for a computer program 有权
标题翻译：适应性地生成计算机程序的代码
公开(公告)号：US07856618B2
公开(公告)日：2010-12-21
申请号：US11197606
申请日：2005-08-04
申请人： Robert John Donovan , Paul Lu Verne Godtland , Sherri Lynn McMeeking , Joseph Patrick Reynolds , Scott Thomas Robinson , Robert Ralph Roediger , William Jon Schmidt , Roger Wayne Southwick
发明人： Robert John Donovan , Paul Lu Verne Godtland , Sherri Lynn McMeeking , Joseph Patrick Reynolds , Scott Thomas Robinson , Robert Ralph Roediger , William Jon Schmidt , Roger Wayne Southwick
IPC分类号： G06F9/44
CPC分类号： G06F8/47
摘要： A program feature set is compared to a processor feature set. The comparison may be performed in response to restoring the program onto a system or requesting its execution. The processor feature set represents zero, one or more optional hardware features supported by the processor, whereas the program feature set represents zero, one or more optional hardware features the program relies upon in its generated code. Comparison of the feature sets determines whether a particular program may run on a particular processor. Programs may be automatically or manually rebuilt to achieve full compatibility. If the comparison indicates that the program requires a feature not supported by the processor, the program is rebuilt based on the processor feature set. Alternatively, the program may be rebuilt in response to a rebuild request, rather than the comparison. The program is preferably rebuilt from an intermediate representation (IR) stored with or locatable from the program.
摘要翻译：将程序功能集与处理器功能集进行比较。可以响应于将程序恢复到系统或请求其执行来执行比较。处理器功能集表示处理器支持的零个一个或多个可选的硬件特征，而程序特征集代表零，一个或多个可选的硬件特征，程序依赖于其生成的代码。特征集的比较确定特定程序是否可以在特定处理器上运行。可以自动或手动重建程序以实现完全兼容。如果比较表明程序需要处理器不支持的功能，则基于处理器功能集重建程序。或者，可以重建响应于重建请求而不是比较的程序。该程序优选地从存储有或可从该程序定位的中间表示（IR）重建。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式