contrib/bzip2/blocksort.c

350                UInt16* quadrant,
414       s1 = quadrant[i1]; s2 = quadrant[i2];
420       s1 = quadrant[i1]; s2 = quadrant[i2];
426       s1 = quadrant[i1]; s2 = quadrant[i2];
432       s1 = quadrant[i1]; s2 = quadrant[i2];
438       s1 = quadrant[i1]; s2 = quadrant[i2];
444       s1 = quadrant[i1]; s2 = quadrant[i2];
450       s1 = quadrant[i1]; s2 = quadrant[i2];
456       s1 = quadrant[i1]; s2 = quadrant[i2];
487                       UInt16* quadrant,
515                     ptr[j-h]+d, v+d, block, quadrant, nblock, budget
529                     ptr[j-h]+d, v+d, block, quadrant, nblock, budget
543                     ptr[j-h]+d, v+d, block, quadrant, nblock, budget
623                   UInt16* quadrant,
651          mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
753                 UInt16* quadrant,
775       quadrant[i] = 0;
778       quadrant[i-1] = 0;
781       quadrant[i-2] = 0;
784       quadrant[i-3] = 0;
789       quadrant[i] = 0;
794    /*-- (emphasises close relationship of block & quadrant) --*/
797       quadrant[nblock+i] = 0;
898                      ptr, block, quadrant, nblock,
951          and update the quadrant descriptors.  Remember to
957          The quadrant array provides a way to incrementally
970                then the relative values of quadrant[i] and
971                     quadrant[j] are meaningless.
974                   if quadrant[i] < quadrant[j]
978                   else if quadrant[i] > quadrant[j]
999             quadrant[a2update] = qVal;
1001                quadrant[a2update + nblock] = qVal;
1039    UInt16* quadrant;
1047       /* Calculate the location for quadrant, remembering to get
1054       quadrant = (UInt16*)(&(block[i]));
1068       mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );