Lines Matching refs:block
10 library for lossless, block-sorting data compression.
67 Compare two strings in block. We assume (see
70 bytes of both block and quadrant have been
75 static __inline__ Bool fullGtU ( UChar* block,
89 c1 = block[i1];
90 c2 = block[i2];
94 c1 = block[i1];
95 c2 = block[i2];
99 c1 = block[i1];
100 c2 = block[i2];
104 c1 = block[i1];
105 c2 = block[i2];
109 c1 = block[i1];
110 c2 = block[i2];
114 c1 = block[i1];
115 c2 = block[i2];
123 c1 = block[i1];
124 c2 = block[i2];
131 c1 = block[i1];
132 c2 = block[i2];
139 c1 = block[i1];
140 c2 = block[i2];
147 c1 = block[i1];
148 c2 = block[i2];
182 UChar* block = s->block;
206 while ( fullGtU ( block, quadrant, nblock, workDone,
219 while ( fullGtU ( block, quadrant, nblock, workDone,
232 while ( fullGtU ( block, quadrant, nblock, workDone,
313 UChar* block = s->block;
334 med = med3 ( block[zptr[ lo ]+d],
335 block[zptr[ hi ]+d],
336 block[zptr[ (lo+hi)>>1 ]+d] );
344 n = ((Int32)block[zptr[unLo]+d]) - med;
351 n = ((Int32)block[zptr[unHi]+d]) - med;
396 UChar* block = s->block;
406 In the various block-sized structures, live data runs
408 set up the overshoot area for block.
415 block[nblock+i] = block[i % nblock];
442 c1 = block[nblock-1];
444 c2 = block[i];
451 c1 = block[0];
453 c2 = block[i+1];
459 j = (block[nblock-1] << 8) + block[0];
553 c1 = block[j];
559 c1 = block[j];
586 if block[i] != block[j],
638 c1 = block[k];
663 s->block[i] ^= BZ_RAND_MASK;
664 s->inUse[s->block[i]] = True;
682 VPrintf3( " %d work, %d block, ratio %5.2f\n",
688 VPrintf0( " sorting aborted; randomising block\n" );
695 VPrintf3( " %d work, %d block, ratio %f\n",