Lines Matching refs:h
636 Int32 i, j, h, bigN, hp; in mainSimpleSort() local
649 h = incs[hp]; in mainSimpleSort()
651 i = lo + h; in mainSimpleSort()
658 while (mainGtU(ptr[j - h] + d, v + d, block, quadrant, nblock, budget)) { in mainSimpleSort()
659 ptr[j] = ptr[j - h]; in mainSimpleSort()
660 j = j - h; in mainSimpleSort()
661 if (j <= (lo + h - 1)) in mainSimpleSort()
672 while (mainGtU(ptr[j - h] + d, v + d, block, quadrant, nblock, budget)) { in mainSimpleSort()
673 ptr[j] = ptr[j - h]; in mainSimpleSort()
674 j = j - h; in mainSimpleSort()
675 if (j <= (lo + h - 1)) in mainSimpleSort()
686 while (mainGtU(ptr[j - h] + d, v + d, block, quadrant, nblock, budget)) { in mainSimpleSort()
687 ptr[j] = ptr[j - h]; in mainSimpleSort()
688 j = j - h; in mainSimpleSort()
689 if (j <= (lo + h - 1)) in mainSimpleSort()
1024 Int32 h = 1; in mainSort() local
1026 h = 3 * h + 1; in mainSort()
1027 while (h <= 256); in mainSort()
1029 h = h / 3; in mainSort()
1030 for (i = h; i <= 255; i++) { in mainSort()
1033 while (BIGFREQ(runningOrder[j - h]) > BIGFREQ(vv)) { in mainSort()
1034 runningOrder[j] = runningOrder[j - h]; in mainSort()
1035 j = j - h; in mainSort()
1036 if (j <= (h - 1)) in mainSort()
1042 } while (h != 1); in mainSort()