-
-
2.发明授权Mechanism for implementing one machine cycle executable trap instructions in a primitive instruction set computing system 失效在主要指令集计算系统中执行一个机器循环可执行指令的机制
公开(公告)号：EP0130378B1
公开(公告)日：1990-03-07
申请号：EP84106175.7
申请日：1984-05-30
CPC分类号： G06F9/4812 , G06F9/30021
-
3.发明公开Mechanism for implementing one machine cycle executable branch-on-any-bit-in-any-register instructions in a primitive instruction set computing system 失效机构，用于实现在一个工作循环运行的Verzweig-上任何位功能于任何寄存器在具有原始指令集的计算机系统的指令。
公开(公告)号：EP0130381A2
公开(公告)日：1985-01-09
申请号：EP84106179.9
申请日：1984-05-30
发明人： Auslander, Marc Alan , Hao, Hsieh Tung , Hopkins, Martin Edward , Markstein, Peter Willy , Radin, George , Worley, William Spencer, Jr.
CPC分类号： G06F9/30094 , G06F9/30 , G06F9/30058 , G06F9/30101
摘要： A mechanism for fully executing a branch-on-any-bit-in-any-register instruction within one machine cycle of the host computing system. The invention has particular utility in a primitive instruction set computing system wherein a majority of its primitive instruction set is executable within such a single machine cycle. Means are provided whereby a branch decision may be made not only on a specified bit in the condition register, but on any bit in any of the general purpose registers (30) provided in the system CPU. Means are also provided for saving a given configuration of the condition register in the general purpose registers for later use in subsequent branch-on-bit operations.
摘要翻译： 一种用于充分执行机构的分支上的任何位功能于任何寄存器中的主机计算系统中的一个机器周期内指令。本发明已在一个原始指令集计算系统特别有用worin其大部分原始指令集的 是内寻求一个机器周期内可执行。 提供装置，从而一个分支决定可能不仅在条件寄存器中的指定位，但在任何系统CPU中提供的通用寄存器（30）的任何位制成。 因此，系统中提供了保存状态寄存器的给定配置中供后续分支上的位操作后使用的通用寄存器。
-
4.发明公开Method for storing pre-organised groups of related information files in a data processing system 失效在数据处理系统中存储相关信息文件的组织组的方法
公开(公告)号：EP0319147A3
公开(公告)日：1991-12-18
申请号：EP88310532.2
申请日：1988-11-09
发明人： Auslander, Marc Alan , Chang, Albert , Morgan, Stephen Paul , O'Quin, John Thomas , O'Quin, John Claude
CPC分类号： G06F3/0601 , G06F2003/0697
摘要： A data processing method for storing groups of related information in a storage subsystem of a data processing system in which the storage subsystem includes one or more storage devices having a plurality of block addressable storage locations (blocks or sectors) each of which stores a predetermined fixed number of bytes of said information. The method includes the step of establishing allocatable increments of storage, called physical partitions, which comprise a predetermined number of contiguous addressable blocks, and initially allocating, in response to a request to the operating system, a preselected number of partitions for each group of related information, where the partitions in each group are not necessarily physically contiguous and where the number that is selected is the minimum number of partitions required to store the group of related information. The method further includes the step of automatically allocating one or more additional partitions, located physically on any device, to a previously allocated group of related partitions, dynamically in response to another request of the operating system. A group of partitions that have been allocated to store a group of related information, such as individual files that are related in a hierarchical file system, is called a "Logical Volume". Logical Volumes may be further combined for administration and data management reasons into a "Volume Group".
-
5.发明公开A method for performing global common subexpression elimination and code motion in an optimizing compiler 失效在优化编译器中执行全球通用子表达式消除和代码运动的方法
公开(公告)号：EP0171631A3
公开(公告)日：1988-06-22
申请号：EP85108879
申请日：1985-07-16
IPC分类号： G06F09/44
CPC分类号： G06F8/443
摘要： A method for use during the optimization phase of an optimizing compiler for performing global common subexpression elimination and code motion which comprises: Determining the code basis for the object program which includes examining each basic block of code and determining the basis items on which each computation depends wherein basis items are defined as operands which are referenced in a basic block before being computed. The method next determines the "kill set" for each basis item. A kill set for one basis item is defined as the set of items comprising all non basis items which depends on the one basis item for its value. Following this UEX, DEX, and THRU are determined for each basic bloc using the previously determined basis and "kill set" information. A UEX is defined as a set of upward exposed computations, the set of computations which if executed at the beginning of a basic block give the same result as when executed in the original place in the block, wherein DEX is defined as a similar set of downward expressions and wherein THRU is defined as a set of computations which if computed at the beginning or end of the basic block give the same result. AVAIL, the set of computations whose results are valid when the basic block is entered, and INSERT, the set of computations which will be inserted at the end of the basic block, are computed from UEX, DEX, and THRU, and appropriate code insertions are made at those locations indicated by the preceding step, and finally redundant code is removed using the AVAIL set.
-
6.发明公开Mechanism for implementing one machine cycle executable trap instructions in a primitive instruction set computing system 失效机构，用于在一个操作周期事件运行的执行在计算机系统中的原始指令集的命令。
公开(公告)号：EP0130378A2
公开(公告)日：1985-01-09
申请号：EP84106175.7
申请日：1984-05-30
CPC分类号： G06F9/4812 , G06F9/30021
摘要： @ A mechanism for performing a run-time storage ad-dress validity check within one machine cycle. The mechanism, functioning together with an intelligent compiler, eliminates the need for hardware implementation of a storage validity check. More particularly, the mechanism performs its function in one machine cycle in the event that a trap exception does not cause an interrupt. In the rare instance when an interrupt is necessary, a number of machine cycles will be impacted. The mechanism comprises a minimum amount of logic circuitry (52) for determining the trap condition operating in conjunction with conventional, previously existing compare, branch instruction testing, and interrupt generation circuitry.
-
公开(公告)号：EP0130377B1
公开(公告)日：1992-09-23
申请号：EP84106174.0
申请日：1984-05-30
CPC分类号： G06F9/30014 , G06F9/30094
-
8.发明授权A method for performing global common subexpression elimination and code motion in an optimizing compiler 失效在优化编译器中执行全球通用子表达式消除和代码运动的方法
-
9.发明公开Mechanism for implementing one machine cycle executable trap instructions in a primitive instruction set computing system 失效在主要指令集计算系统中实施一个机器循环可执行指令的机制
公开(公告)号：EP0130378A3
公开(公告)日：1987-10-28
申请号：EP84106175
申请日：1984-05-30
CPC分类号： G06F9/4812 , G06F9/30021
摘要： @ A mechanism for performing a run-time storage ad-dress validity check within one machine cycle. The mechanism, functioning together with an intelligent compiler, eliminates the need for hardware implementation of a storage validity check. More particularly, the mechanism performs its function in one machine cycle in the event that a trap exception does not cause an interrupt. In the rare instance when an interrupt is necessary, a number of machine cycles will be impacted. The mechanism comprises a minimum amount of logic circuitry (52) for determining the trap condition operating in conjunction with conventional, previously existing compare, branch instruction testing, and interrupt generation circuitry.
-
10.发明公开Method for storing pre-organised groups of related information files in a data processing system 失效用于存储在数据处理系统中从相关信息的预结构化组的文件的方法。
公开(公告)号：EP0319147A2
公开(公告)日：1989-06-07
申请号：EP88310532.2
申请日：1988-11-09
发明人： Auslander, Marc Alan , Chang, Albert , Morgan, Stephen Paul , O'Quin, John Thomas , O'Quin, John Claude
CPC分类号： G06F3/0601 , G06F2003/0697
摘要： A data processing method for storing groups of related information in a storage subsystem of a data processing system in which the storage subsystem includes one or more storage devices having a plurality of block addressable storage locations (blocks or sectors) each of which stores a predetermined fixed number of bytes of said information. The method includes the step of establishing allocatable increments of storage, called physical partitions, which comprise a predetermined number of contiguous addressable blocks, and initially allocating, in response to a request to the operating system, a preselected number of partitions for each group of related information, where the partitions in each group are not necessarily physically contiguous and where the number that is selected is the minimum number of partitions required to store the group of related information. The method further includes the step of automatically allocating one or more additional partitions, located physically on any device, to a previously allocated group of related partitions, dynamically in response to another request of the operating system. A group of partitions that have been allocated to store a group of related information, such as individual files that are related in a hierarchical file system, is called a "Logical Volume". Logical Volumes may be further combined for administration and data management reasons into a "Volume Group".
摘要翻译： 其中的每一个用于在数据处理系统，其中所述存储子系统包括具有块寻址的存储位置（块或扇区）多个一个或多个存储装置的存储子系统中存储的相关信息组的数据处理方法存储预定的固定 的所述信息的字节数。 该方法包括：建立存储的分配的增量，被称为物理分区，其包括连续的可寻址的块的预定数量，并且最初分配，响应于操作系统，对于每个组相关的预选数目的分区的请求的步骤 信息，其中，每个组中的分区不必物理上连续的，在哪里被选择的号码是存储组相关信息所需的分区的最小数目。 该方法还包括自动地分配一个或多个额外的分区，位于物理上的任何设备上，在先前分配组相关的分区，动态地响应于所述操作系统的另一个请求的步骤。一组分区的thathave被分配给 存储一组相关的信息，寻求作为单独的文件并在一个分层文件系统相关的，被称为“逻辑卷”。 逻辑卷可以被组合另外施用和数据管理的原因为“卷组。”
-
-
-
-
-
-
-
-
-
搜索结果
18 条记录 (耗时 0.014 秒)
