Lines Matching defs:c0
104 * pointer corresponds to a C0 value (typically 2^5 = 32 pointers) and
298 int c0,c1,c2;
308 for (c0 = c0min; c0 <= c0max; c0++)
310 histp = & histogram[c0][c1][c2min];
313 boxp->c0min = c0min = c0;
319 for (c0 = c0max; c0 >= c0min; c0--)
321 histp = & histogram[c0][c1][c2min];
324 boxp->c0max = c0max = c0;
331 for (c0 = c0min; c0 <= c0max; c0++) {
332 histp = & histogram[c0][c1][c2min];
342 for (c0 = c0min; c0 <= c0max; c0++) {
343 histp = & histogram[c0][c1][c2min];
353 for (c0 = c0min; c0 <= c0max; c0++) {
354 histp = & histogram[c0][c1min][c2];
364 for (c0 = c0min; c0 <= c0max; c0++) {
365 histp = & histogram[c0][c1min][c2];
389 for (c0 = c0min; c0 <= c0max; c0++)
391 histp = & histogram[c0][c1][c2min];
407 int c0,c1,c2,cmax;
429 c0 = ((b1->c0max - b1->c0min) << C0_SHIFT) * C0_SCALE;
437 if (c0 > cmax) { cmax = c0; n = 0; }
443 if (c0 > cmax) { n = 0; }
486 int c0,c1,c2;
498 for (c0 = c0min; c0 <= c0max; c0++)
500 histp = & histogram[c0][c1][c2min];
504 c0total += ((c0 << C0_SHIFT) + ((1<<C0_SHIFT)>>1)) * count;
667 /* We compute the squared-c0-distance term, then add in the other two. */
834 fill_inverse_cmap (j_decompress_ptr cinfo, int c0, int c1, int c2)
836 /* histogram cell c0/c1/c2. (Only that one cell MUST be filled, but */
852 c0
860 minc0 = (c0 << BOX_C0_SHIFT) + ((1 << C0_SHIFT) >> 1);
874 c0 <<= BOX_C0_LOG; /* convert ID back to base cell indexes */
880 cachep = & histogram[c0+ic0][c1+ic1][c2];
902 register int c0, c1, c2;
912 c0 = GETJSAMPLE(*inptr++) >> C0_SHIFT;
915 cachep = & histogram[c0][c1][c2];
919 fill_inverse_cmap(cinfo, c0,c1,c2);
