Lines Matching defs:curr
223 int64_t curr;
232 curr = start + 2;
239 if (curr == (int64_t) size - 1) break;
240 if (SORT_CMP(dst[curr - 1], dst[curr]) > 0) break;
241 curr++;
243 return curr - start;
250 if (curr == (int64_t) size - 1) break;
251 if (SORT_CMP(dst[curr - 1], dst[curr]) <= 0) break;
252 curr++;
255 REVERSE_ELEMENTS(dst, start, curr - 1);
256 return curr - start;
261 len = COUNT_RUN(dst, curr, size);\
264 if (run > (int64_t) size - curr) run = size - curr;\
267 BINARY_INSERTION_SORT_START(&dst[curr], len, run);\
271 run_stack[stack_curr].start = curr;\
275 curr += len;\
276 if (curr == (int64_t) size)\
338 const int64_t curr = stack[stack_curr - 2].start;
348 memcpy(storage, &dst[curr], A * sizeof(SORT_TYPE));
350 j = curr + A;
352 for (k = curr; k < curr + A + B; k++)
354 if ((i < A) && (j < curr + A + B))
372 memcpy(storage, &dst[curr + A], B * sizeof(SORT_TYPE));
374 j = curr + A - 1;
376 for (k = curr + A + B - 1; k >= curr; k--)
378 if ((i >= 0) && (j >= curr))
461 int64_t curr = 0;