Lines Matching defs:depthLimit

1090 // void hybridQuickSort(lo, hi, data, depthLimit) {
1096 //       depthLimit --;
1097 //       if (depthLimit <= 0) {
1102 //            quickSort(lo, p, data, depthLimit);
1105 //            quickSort(p + 1, hi, data, depthLimit);
1172     Value depthLimit = args.back();
1173     depthLimit = builder.create<arith::SubIOp>(loc, depthLimit,
1177                                       depthLimit, constantI64(builder, loc, 0));
1192     args.back() = depthLimit;
1248     // As a heuristics, set depthLimit = 2 * log2(n).
1254     Value depthLimit = rewriter.create<arith::SubIOp>(
1257     operands.push_back(depthLimit);