会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method and system for generating compact code for the loop unrolling
transformation
    • 用于生成循环展开转换的紧凑代码的方法和系统
    • US06035125A
    • 2000-03-07
    • US900809
    • 1997-07-25
    • Khoa NguyenVivek Sarkar
    • Khoa NguyenVivek Sarkar
    • G06F9/45G06F9/445
    • G06F8/452
    • A loop unrolling trasformation specified by loop unrolling factors UF[1], . . . , UF[k] is performed on a perfect nest of k multiple loops to produce an unrolled loop representation as follows. Moving from the outermost loop to the innermost loop of the nest, the unroll factor UF[j] of the current loop is examined. First, the separate unrolled loop body is expanded by the specified unroll factor UF[j]. Second, the loop header for the current loop is adjusted so that if the loop's iteration count, COUNT[j], is known to be less than or equal to the unroll factor, UP[j], then the loop header is simply an assignment of the index variable to the lower-bound expression; otherwise, the loop header is adjusted so that the unrolled loop's iteration count equals .left brkt-bot.COUNT[J]/UF[J].right brkt-bot. a rounded down truncation of the division. Third, a remainder loop nest is generated, if needed. The size of the generated code when unrolling multiple nested loops is substantially reduced. The proportion of the object code comprising lower execution frequency remainder loops is also substantially reduced. The compile-time of unrolled multiple nested loops is also substantially reduced.
    • 循环展开因子UF [1]指定的循环展开trasformation。 。 。 在k个多个循环的完美嵌套上执行UF [k],以产生如下的展开的循环表示。 从最外圈到巢的最内圈,检查当前循环的展开因子UF [j]。 首先,通过指定的展开因子UF [j]扩展单独的展开循环体。 第二,调整当前循环的循环头,以便如果已知循环的迭代计数COUNT [j]小于或等于展开因子UP [j],则循环头只是一个赋值 的索引变量为下限表达式; 否则,循环头被调整,使得展开循环的迭代计数等于+537 COUNT [J] / UF [J] +540对于除法进行四舍五入截断。 第三,如果需要,会生成一个余数循环。 在展开多个嵌套循环时生成的代码的大小显着降低。 包括较低执行频率余数循环的目标代码的比例也大大降低。 展开的多个嵌套循环的编译时间也大大减少。