会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Method of compiling source code
    • 编译源代码的方法
    • US20070240137A1
    • 2007-10-11
    • US11402556
    • 2006-04-11
    • Roch ArchambaultShimin CuiYaoqing GaoRaul Silvera
    • Roch ArchambaultShimin CuiYaoqing GaoRaul Silvera
    • G06F9/45
    • G06F8/4442
    • A method of compiling source code. The method includes converting pointer-based access in the source code to array-based access in the source code in a first pass compilation of the source code. Information is collected for objects in the source code during the first pass compilation. Candidate objects in the source code are selected based on the collected information to form selected candidate objects. Global stride variables are created for the selected candidate objects. Memory allocation operations are updated for the selected candidate objects in a second pass compilation of the source code. Multiple-level pointer indirect references are replaced in the source code with multi-dimensional array indexed references for the selected candidate objects in the second pass compilation of the source code.
    • 一种编译源代码的方法。 该方法包括在源代码的第一遍编译中将源代码中的基于指针的访问转换为源代码中的基于数组的访问。 在第一次编译期间,为源代码中的对象收集信息。 基于收集的信息来选择源代码中的候选对象以形成所选择的候选对象。 为所选候选对象创建全局步幅变量。 在源代码的第二遍编译中,针对所选候选对象更新内存分配操作。 在源代码的第二遍编译中,多级指针间接引用被替换为所选候选对象的多维数组索引引用的源代码。
    • 8. 发明申请
    • OPTIMIZING SOURCE CODE FOR ITERATIVE EXECUTION
    • 优化源代码进行迭代执行
    • US20080028381A1
    • 2008-01-31
    • US11870121
    • 2007-10-10
    • ROCH ARCHAMBAULTROBERT BLAINEYCHARLES HALLYINGWEI ZHANG
    • ROCH ARCHAMBAULTROBERT BLAINEYCHARLES HALLYINGWEI ZHANG
    • G06F9/45
    • G06F8/4441
    • An embodiment of the present invention provides an optimizer for optimizing source code to generate optimized source code having instructions for instructing a central processing unit (CPU) to iteratively compute values for a primary recurrence element. A computer programmed loop for computing the primary recurrence element and subsequent recurrence elements is an example of a case involving iteratively computing the primary recurrence element. The CPU is operatively coupled to fast operating memory (FOM) and operatively coupled to slow operating memory (SOM). SOM stores the generated optimized source code. The optimized source code includes instructions for instructing said CPU to store a computed value of the primary recurrence element in a storage location of FOM. The instructions also includes instructions to consign the computed value of the primary recurrence element from the storage location to another storage location of the FOM.
    • 本发明的一个实施例提供一种用于优化源代码以产生优化的源代码的优化器,其具有用于指示中央处理单元(CPU)迭代地计算初级重复元件的值的指令。 用于计算主要递归元素和随后的递归元素的计算机编程回路是涉及迭代地计算主要复发元素的情况的示例。 CPU可操作地耦合到快速操作存储器(FOM)并且可操作地耦合到慢速操作存储器(SOM)。 SOM存储生成的优化源代码。 优化的源代码包括用于指示所述CPU将计算的主循环元素的值存储在FOM的存储位置中的指令。 指令还包括将计算的主循环元素的值从存储位置委托给FOM的另一个存储位置的指令。