Lines Matching refs:c0
121 * pointer corresponds to a C0 value (typically 2^5 = 32 pointers) and
320 int c0,c1,c2;
330 for (c0 = c0min; c0 <= c0max; c0++)
332 histp = & histogram[c0][c1][c2min];
335 boxp->c0min = c0min = c0;
341 for (c0 = c0max; c0 >= c0min; c0--)
343 histp = & histogram[c0][c1][c2min];
346 boxp->c0max = c0max = c0;
353 for (c0 = c0min; c0 <= c0max; c0++) {
354 histp = & histogram[c0][c1][c2min];
364 for (c0 = c0min; c0 <= c0max; c0++) {
365 histp = & histogram[c0][c1][c2min];
375 for (c0 = c0min; c0 <= c0max; c0++) {
376 histp = & histogram[c0][c1min][c2];
386 for (c0 = c0min; c0 <= c0max; c0++) {
387 histp = & histogram[c0][c1min][c2];
411 for (c0 = c0min; c0 <= c0max; c0++)
413 histp = & histogram[c0][c1][c2min];
429 int c0,c1,c2,cmax;
451 c0 = ((b1->c0max - b1->c0min) << C0_SHIFT) * C0_SCALE;
459 if (c0 > cmax) { cmax = c0; n = 0; }
464 if (c0 > cmax) { n = 0; }
507 int c0,c1,c2;
519 for (c0 = c0min; c0 <= c0max; c0++)
521 histp = & histogram[c0][c1][c2min];
525 c0total += ((c0 << C0_SHIFT) + ((1<<C0_SHIFT)>>1)) * count;
688 /* We compute the squared-c0-distance term, then add in the other two. */
855 fill_inverse_cmap (j_decompress_ptr cinfo, int c0, int c1, int c2)
857 /* histogram cell c0/c1/c2. (Only that one cell MUST be filled, but */
873 c0 >>= BOX_C0_LOG;
881 minc0 = (c0
895 c0 <<= BOX_C0_LOG; /* convert ID back to base cell indexes */
901 cachep = & histogram[c0+ic0][c1+ic1][c2];
923 register int c0, c1, c2;
933 c0 = GETJSAMPLE(*inptr++) >> C0_SHIFT;
936 cachep = & histogram[c0][c1][c2];
940 fill_inverse_cmap(cinfo, c0,c1,c2);
