会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Intermediate representation for multiple exception handling models
    • 多个异常处理模型的中间表示
    • US20070006192A1
    • 2007-01-04
    • US11505090
    • 2006-08-15
    • Vinod GroverAkella Sastry
    • Vinod GroverAkella Sastry
    • G06F9/45
    • G06F8/20G06F8/423
    • As described herein, an intermediate representation of a source code file may be used to explicitly express exception handling control flow prior to generating object code for the source code. As further described herein, a single uniform set of instructions of the intermediate representation may be used for expressing multiple different exception handling mechanisms related to multiple different programming languages. The intermediate form of the exception handling instructions may be generated by translating an intermediate language representation of the source code file. Representations of the source code in multiple different intermediate languages may be translated to a single uniform set of instructions of the intermediate representation. The intermediate form of the exception handling instructions may then be used by software development tools for such tasks as code generation, code optimization, code analysis etc. Thus, the same methods for code optimizations, analysis and generation may be used for intermediate representations of multiple different languages.
    • 如本文所述,源代码文件的中间表示可以用于在为源代码生成目标代码之前显式表达异常处理控制流程。 如本文进一步描述的,中间表示的单个均匀的指令集可以用于表示与多个不同的编程语言相关的多个不同的异常处理机制。 可以通过翻译源代码文件的中间语言表示来生成异常处理指令的中间形式。 可以将多个不同中间语言的源代码的表示形式转换为中间表示的单个均匀指令集。 异常处理指令的中间形式然后可以由软件开发工具用于诸如代码生成,代码优化,代码分析等任务。因此,用于代码优化,分析和生成的相同方法可以用于多个的中间表示 不同的语言。
    • 3. 发明申请
    • Method for Transforming a Multithreaded Program for General Execution
    • 用于转换多线程程序进行一般执行的方法
    • US20120254875A1
    • 2012-10-04
    • US13076258
    • 2011-03-30
    • Jaydeep MARATHEVinod Grover
    • Jaydeep MARATHEVinod Grover
    • G06F9/46
    • G06F8/72G06F9/522
    • A technique is disclosed for executing a program designed for multi-threaded operation on a general purpose processor. Original source code for the program is transformed from a multi-threaded structure into a computationally equivalent single-threaded structure. A transform operation modifies the original source code to insert code constructs for serial thread execution. The transform operation also replaces synchronization barrier constructs in the original source code with synchronization barrier code that is configured to facilitate serialization. The transformed source code may then be conventionally compiled and advantageously executed on the general purpose processor.
    • 公开了一种用于在通用处理器上执行针对多线程操作设计的程序的技术。 程序的原始源代码从多线程结构转换为计算等效的单线程结构。 转换操作修改原始源代码以插入用于串行线程执行的代码结构。 变换操作还用原始源代码中的同步屏障代码替代配置为便于序列化的同步屏障代码。 然后可以在通用处理器上常规地编译和有利地执行变换的源代码。
    • 5. 发明申请
    • Efficient construction of pruned SSA form
    • 修剪SSA形式的有效建设
    • US20050273777A1
    • 2005-12-08
    • US10863000
    • 2004-06-07
    • Vinod GroverWeiping Hu
    • Vinod GroverWeiping Hu
    • G06F9/45
    • G06F8/443
    • Intermediate representations of computer code are efficiently generated. More particularly, methods described herein may be used to construct a static single assignment representation of computer code without unnecessary phi-function nodes. Potentially necessary phi-function node assignments may be analyzed to determine whether they directly reach a non-phi use or a necessary phi-use of a corresponding variable. Those that ultimately reach such a use may be determined to be necessary and a pruned static single assignment may be constructed by including those potentially necessary phi-functions determined to be in fact necessary. Also, some phi-function nodes may be determined to be necessary based on their dependency relationship to other phi-functions previously determined to be necessary (e.g., because they directly reach a non-phi use). A phi-function dependency graph may be used to record dependency relationships between phi-function nodes. The analysis can proceed during a forward walk of a control flow representation of the program.
    • 有效地生成计算机代码的中间表示。 更具体地,本文描述的方法可以用于构造计算机代码的静态单分配表示,而不需要不必要的功能节点。 可能分析潜在必需的phi函数节点分配,以确定它们是否直接达到非phi使用或相应变量的必要phi使用。 最终达到这种用途的那些可以被确定为必要的,并且修剪的静态单个分配可以通过包括被确定为实际需要的那些潜在必要的phi函数来构造。 此外,可以基于它们与先前确定为必需的其他phi函数的依赖关系(例如,因为它们直接达到非phi使用)而确定一些phi函数节点是必要的。 phi函数依赖图可用于记录phi函数节点之间的依赖关系。 分析可以在程序的控制流表示的向前行进期间进行。