1086   bool needsUniv = false;  in genInit()  local
1111         needsUniv = true;  in genInit()
1118   return needsUniv;  in genInit()
1265                            linalg::GenericOp op, unsigned idx, bool needsUniv,  in genWhile()  argument
1287   if (needsUniv) {  in genWhile()
1320   if (needsUniv)  in genWhile()
1332                           unsigned at, bool needsUniv, BitVector &indices) {  in genLoop()  argument
1339   return genWhile(merger, codegen, builder, op, idx, needsUniv, indices);  in genLoop()
1346                       unsigned at, bool needsUniv, BitVector &locals) {  in genLocals()  argument
1360       if (!needsUniv) {  in genLocals()
1374     assert(!needsUniv);  in genLocals()
1409                               unsigned idx, bool needsUniv,  in genWhileInduction()  argument
1462   if (needsUniv) {  in genWhileInduction()
1561   bool needsUniv =  in startLoopSeq()  local
1565   if (needsUniv) {  in startLoopSeq()
1580                             unsigned li, bool needsUniv) {  in startLoop()  argument
1584                             needsUniv, merger.lat(li).simple);  in startLoop()
1586   genLocals(merger, codegen, builder, op, topSort, at, needsUniv,  in startLoop()
1594                     unsigned li, bool needsUniv) {  in endLoop()  argument
1598     genWhileInduction(merger, codegen, builder, op, idx, needsUniv,  in endLoop()
1600     return needsUniv;  in endLoop()
1644   bool needsUniv = startLoopSeq(merger, codegen, rewriter, op, topSort, exp, at,  in genStmt()  local
1653         startLoop(merger, codegen, rewriter, op, topSort, at, li, needsUniv);  in genStmt()
1677     needsUniv =  in genStmt()
1678         endLoop(merger, codegen, rewriter, op, loop, idx, li, needsUniv);  in genStmt()