会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Compact garbage collection tables
    • 小型垃圾收集表
    • US07509338B1
    • 2009-03-24
    • US11215896
    • 2005-08-30
    • David R. Tarditi
    • David R. Tarditi
    • G06F17/00
    • G06F12/0253Y10S707/99931Y10S707/99932Y10S707/99934Y10S707/99943Y10S707/99944Y10S707/99945Y10S707/99953Y10S707/99957
    • A compact set of garbage collection tables takes advantage of the redundancies often inherent in live pointer information: multiple call sites in a call stack often share common live pointer information. A call site table lists call site identifiers associated with call stack locations having pointers to heap-allocated data. An associated indirection table (i.e., a descriptor reference table) provides a reference (e.g., an index or a pointer) into a descriptor table, which stores unique descriptors of the call stack locations of interest. The aggregate memory space used by the three tables (i.e., the call site table, the indirection table, and the descriptor table) is typically less than the memory space used by the monolithic live pointer information table.
    • 一组紧凑的垃圾回收表利用了实时指针信息中常常存在的冗余:调用堆栈中的多个调用站点经常共享常见的实时指针信息。 呼叫站点表列出与具有指向堆分配数据的指针的调用堆栈位置相关联的呼叫站点标识符。 相关联的间接表(即,描述符参考表)向存储感兴趣的调用堆栈位置的唯一描述符的描述符表提供参考(例如,索引或指针)。 三个表(即,呼叫站点表,间接表和描述符表)使用的总体存储空间通常小于单片实时指针信息表使用的存储空间。
    • 5. 发明授权
    • Compact garbage collection tables
    • 小型垃圾收集表
    • US07472145B1
    • 2008-12-30
    • US11176145
    • 2005-07-06
    • David R. Tarditi
    • David R. Tarditi
    • G06F17/30
    • G06F12/0253Y10S707/99931Y10S707/99932Y10S707/99934Y10S707/99943Y10S707/99944Y10S707/99945Y10S707/99953Y10S707/99957
    • A compact set of garbage collection tables takes advantage of the redundancies often inherent in live pointer information: multiple call sites in a call stack often share common live pointer information. A call site table lists call site identifiers associated with call stack locations having pointers to heap-allocated data. An associated indirection table (i.e., a descriptor reference table) provides a reference (e.g., an index or a pointer) into a descriptor table, which stores unique descriptors of the call stack locations of interest. The aggregate memory space used by the three tables (i.e., the call site table, the indirection table, and the descriptor table) is typically less than the memory space used by the monolithic live pointer information table.
    • 一组紧凑的垃圾回收表利用了实时指针信息中常常存在的冗余:调用堆栈中的多个调用站点经常共享常见的实时指针信息。 呼叫站点表列出与具有指向堆分配数据的指针的调用堆栈位置相关联的呼叫站点标识符。 相关联的间接表(即,描述符参考表)向存储感兴趣的调用堆栈位置的唯一描述符的描述符表提供参考(例如,索引或指针)。 三个表(即,呼叫站点表,间接表和描述符表)使用的总体存储空间通常小于单片实时指针信息表使用的存储空间。
    • 6. 发明授权
    • Method and system for register allocation
    • 寄存器分配方法和系统
    • US06925639B2
    • 2005-08-02
    • US09792395
    • 2001-02-23
    • David R. Tarditi
    • David R. Tarditi
    • G06F9/45
    • G06F8/441
    • A method, system, and apparatus for inserting spill code optimized for a complex instruction set computing (CISC) two-address machine, such as a machine utilizing an 80x86 processor is described. The spill code is generated in a single pass. Copy propagation and dead-code elimination are performed to remove unnecessary loads and stores from the stack. Instructions contained within the code block are processed in reverse order. Temporary variables are not extended to the point that they may become spilled by a register allocation procedure. A store to a stack location is inserted if the stack location is not dead, saving the use of a register. Memory operands are substituted when possible in place of load and store instructions on CISC machines.
    • 描述用于插入针对复杂指令集计算(CISC)双地址机优化的溢出码的方法,系统和装置,例如使用80×86处理器的机器。 溢出代码是在单程中生成的。 执行复制传播和死码消除,以从堆栈中删除不必要的负载和存储。 代码块中包含的指令以相反的顺序进行处理。 临时变量不会扩展到它们可能通过寄存器分配过程溢出的程度。 如果堆栈位置未死亡,则插入堆栈位置的存储区,从而节省使用寄存器。 存储器操作数在CISC机器上可能代替加载和存储指令。
    • 7. 发明授权
    • Method and system for register allocation
    • 寄存器分配方法和系统
    • US07386843B2
    • 2008-06-10
    • US10864708
    • 2004-06-09
    • David R. Tarditi
    • David R. Tarditi
    • G06F9/45
    • G06F8/441
    • Inserting spill code optimized for a complex instruction set computing (CISC) two-address machine. The spill code is generated in a single pass. Copy propagation and dead-code elimination are performed to remove unnecessary loads and stores from the stack. Memory operands are substituted in place of load and store instructions on CISC machines. The number of occurrences of a temporary variable is checked before a load is inserted into the new instructions and before a temporary variable is removed from use. If the variable has only occurred once then the memory operand of the temporary is used in place of the load of the temporary variable saving a load instruction. If the temporary variable is about to be removed from use and the temporary variable has only occurred one time then the variable is not stored saving a store instruction within the spill code.
    • 插入针对复杂指令集计算(CISC)双地址机优化的溢出码。 溢出代码是在单程中生成的。 执行复制传播和死码消除,以从堆栈中删除不必要的负载和存储。 存储器操作数代替CISC机器上的加载和存储指令。 在将负载插入新指令之前以及临时变量从使用中移除之前,会检查临时变量的发生次数。 如果变量只发生一次,那么使用临时变量的存储器操作数代替保存加载指令的临时变量的负载。 如果临时变量即将被删除,临时变量只发生一次,那么该变量不存储将存储指令保存在溢出代码中。