Lines Matching refs:k
274 Int32 H, i, j, k, l, r, cc, cc1; in fallbackSort() local
296 k = ftab[j] - 1; in fallbackSort()
297 ftab[j] = k; in fallbackSort()
298 fmap[k] = i; in fallbackSort()
329 k = fmap[i] - H; in fallbackSort()
330 if (k < 0) in fallbackSort()
331 k += nblock; in fallbackSort()
332 eclass[k] = j; in fallbackSort()
339 k = r + 1; in fallbackSort()
340 while (ISSET_BH(k) && UNALIGNED_BH(k)) in fallbackSort()
341 k++; in fallbackSort()
342 if (ISSET_BH(k)) { in fallbackSort()
343 while (WORD_BH(k) == 0xffffffff) in fallbackSort()
344 k += 32; in fallbackSort()
345 while (ISSET_BH(k)) in fallbackSort()
346 k++; in fallbackSort()
348 l = k - 1; in fallbackSort()
351 while (!ISSET_BH(k) && UNALIGNED_BH(k)) in fallbackSort()
352 k++; in fallbackSort()
353 if (!ISSET_BH(k)) { in fallbackSort()
354 while (WORD_BH(k) == 0x00000000) in fallbackSort()
355 k += 32; in fallbackSort()
356 while (!ISSET_BH(k)) in fallbackSort()
357 k++; in fallbackSort()
359 r = k - 1; in fallbackSort()
424 Int32 k; in mainGtU() local
514 k = nblock + 8; in mainGtU()
611 k -= 8; in mainGtU()
613 } while (k >= 0); in mainGtU()
935 Int32 i, j, k, ss, sb; in mainSort() local
1107 k = ptr[j] - 1; in mainSort()
1108 if (k < 0) in mainSort()
1109 k += nblock; in mainSort()
1110 c1 = block[k]; in mainSort()
1112 ptr[copyStart[c1]++] = k; in mainSort()
1115 k = ptr[j] - 1; in mainSort()
1116 if (k < 0) in mainSort()
1117 k += nblock; in mainSort()
1118 c1 = block[k]; in mainSort()
1120 ptr[copyEnd[c1]--] = k; in mainSort()