Searched refs:Computations (Results 1 – 15 of 15) sorted by relevance
56 Computations.forgetProducers(); in initNodeForLowering()57 Computations.recordProducers(Node); in initNodeForLowering()58 Computations.dump(Func); in initNodeForLowering()920 ComputationTracker Computations; variable
84 Computations.forgetProducers(); in initNodeForLowering()85 Computations.recordProducers(Node); in initNodeForLowering()86 Computations.dump(Func); in initNodeForLowering()1354 ComputationTracker Computations; variable
3161 if (const Inst *Src1Producer = Computations.getProducerOf(Src1)) { in lowerArithmetic()3176 if (const Inst *Src1Producer = Computations.getProducerOf(Src1)) { in lowerArithmetic()3211 if (const Inst *Src1Producer = Computations.getProducerOf(Src1)) { in lowerArithmetic()3297 if (const Inst *Src1Producer = Computations.getProducerOf(Src1)) { in lowerArithmetic()3571 const Inst *Producer = Computations.getProducerOf(Boolean); in lowerInt1ForBranch()3787 assert(Computations.getProducerOf(Dest) == nullptr); in lowerCall()6718 if (const Inst *Producer = Computations.getProducerOf(Boolean)) { in lowerInt1ForSelect()6802 if (const Inst *Producer = Computations.getProducerOf(Boolean)) { in lowerInt1()
3094 const Inst *Producer = Computations.getProducerOf(Boolean); in lowerBr()
115 // Computations for m > 52, including where result is close to Inf
101 // Computations for x not near 1
99 // Computations for x not near 1
103 /* Computations for x not near 1 */
37 // Computations with other deltas. Can easily be made constexpr with C++17 but
19 // Computations are composed of data flowing between arbitrarily-sized
7 tries to be small. Computations do take advantage of SSE1 instructions
902 C. B. Moler Matrix Computations with Fortran and2786 Michael O. Rabin Complexity of Computations . . . . . . . 625--633
6303 title = "Matrix Computations with {Fortran} and Paging",21188 title = "Complexity of Computations",
280 :pep:`3148` - Futures -- Execute Computations Asynchronously