Lines Matching defs:nTrailingP
81 FuncGeneratorType createFunc, uint32_t nTrailingP = 0) {
85 operands.drop_back(nTrailingP));
101 createFunc(builder, module, func, xPerm, ny, nTrailingP);
251 uint64_t ny, uint32_t nTrailingP = 0) {
253 (void)nTrailingP;
254 assert(nTrailingP == 0);
305 uint64_t ny, uint32_t nTrailingP = 0) {
307 (void)nTrailingP;
308 assert(nTrailingP == 0);
328 uint64_t ny, uint32_t nTrailingP = 0) {
330 (void)nTrailingP;
331 assert(nTrailingP == 0);
579 uint32_t nTrailingP = 0) {
581 (void)nTrailingP;
582 assert(nTrailingP == 0);
730 uint32_t nTrailingP) {
732 assert(nTrailingP == 1);
861 uint32_t nTrailingP) {
863 (void)nTrailingP;
864 assert(nTrailingP == 0);
889 shiftDownOperands, createShiftDownFunc, /*nTrailingP=*/1);
920 uint32_t nTrailingP) {
929 ny, args.drop_back(nTrailingP), createPartitionFunc);
933 args.drop_back(nTrailingP))
1000 uint64_t ny, uint32_t nTrailingP) {
1002 (void)nTrailingP;
1003 assert(nTrailingP == 0);
1075 // When nTrailingP == 0, the generated IR corresponds to this C like algorithm:
1089 // When nTrailingP == 1, the generated IR corresponds to this C like algorithm:
1115 uint32_t nTrailingP) {
1116 assert(nTrailingP == 1 || nTrailingP == 0);
1117 bool isHybrid = (nTrailingP == 1);
1165 ValueRange(args).drop_back(nTrailingP), createSortStableFunc);
1167 ValueRange(args).drop_back(nTrailingP));
1185 ValueRange(args).drop_back(nTrailingP), createHeapSortFunc);
1187 ValueRange(args).drop_back(nTrailingP));
1194 createQuickSort(builder, module, func, args, xPerm, ny, nTrailingP);
1207 createQuickSort(builder, module, func, args, xPerm, ny, nTrailingP);
1242 uint32_t nTrailingP = 0;
1247 nTrailingP = 1;
1276 xPerm, ny, operands, funcGenerator, nTrailingP);