Lines Matching defs:ptr
196 ptr exists for [0 .. nblock-1]
485 void mainSimpleSort ( UInt32* ptr,
512 v = ptr[i];
515 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
517 ptr[j] = ptr[j-h];
521 ptr[j] = v;
526 v = ptr[i];
529 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
531 ptr[j] = ptr[j-h];
535 ptr[j] = v;
540 v = ptr[i];
543 ptr[j-h]+d, v+d, block, quadrant, nblock, budget
545 ptr[j] = ptr[j-h];
549 ptr[j] = v;
576 mswap(ptr[yyp1], ptr[yyp2]); \
621 void mainQSort3 ( UInt32* ptr,
651 mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
657 mmed3 ( block[ptr[ lo ]+d],
658 block[ptr[ hi ]+d],
659 block[ptr[ (lo+hi)>>1 ]+d] );
667 n = ((Int32)block[ptr[unLo]+d]) - med;
669 mswap(ptr[unLo], ptr[ltLo]);
677 n = ((Int32)block[ptr[unHi]+d]) - med;
679 mswap(ptr[unHi], ptr[gtHi]);
686 mswap(ptr[unLo], ptr[unHi]); unLo++; unHi--;
736 ptr exists for [0 .. nblock-1]
742 ptr [0 .. nblock-1] holds sorted order
751 void mainSort ( UInt32* ptr,
811 ptr[j] = i;
815 ptr[j] = i-1;
819 ptr[j] = i-2;
823 ptr[j] = i-3;
829 ptr[j] = i;
898 ptr, block, quadrant, nblock,
924 k = ptr[j]-1; if (k < 0) k += nblock;
927 ptr[ copyStart[c1]++ ] = k;
930 k = ptr[j]-1; if (k < 0) k += nblock;
933 ptr[ copyEnd[c1]-- ] = k;
997 Int32 a2update = ptr[bbStart + j];
1033 UInt32* ptr = s->ptr;
1068 mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
1085 if (ptr[i] == 0)