发明名称 Compiling for programmable culling unit
摘要 During compilation, the interval bounds for a programmable culling unit are calculated if possible. For each variable, interval bounds are calculated during the compilation, and the bounds together with other metadata are used to generate an optimized culling program. If not possible, then an assumption may be made and the assumption used to compile the code. If the assumption proves to be invalid, a new assumption could be made and the code may be recompiled in some embodiments.
申请公布号 US9038034(B2) 申请公布日期 2015.05.19
申请号 US200912644075 申请日期 2009.12.22
申请人 Intel Corporation 发明人 Akenine-Moller Tomas G.;Hasselgren Jon N.;Munkberg Carl J.;Clarberg Franz P.;Toth Robert M.
分类号 G06F9/45;G06T15/40 主分类号 G06F9/45
代理机构 Trop, Pruner & Hu, P.C. 代理人 Trop, Pruner & Hu, P.C.
主权项 1. A method comprising: determining, before run time, whether a code for a programmable culling unit has at least one culling input variable with non-infinite bounds that can be determined; if so, for each variable whose bounds can be determined, tracking the bounds at compile time through the code; wherein if the bounds cannot be determined at compile time, making an assumption at compile time of the bounds; and wherein tracking the bounds including evaluating instructions using bounded arithmetic.
地址 Santa Clara CA US