Lines Matching defs:c0
105 * pointer corresponds to a C0 value (typically 2^5 = 32 pointers) and
299 int c0,c1,c2;
309 for (c0 = c0min; c0 <= c0max; c0++)
311 histp = & histogram[c0][c1][c2min];
314 boxp->c0min = c0min = c0;
320 for (c0 = c0max; c0 >= c0min; c0--)
322 histp = & histogram[c0][c1][c2min];
325 boxp->c0max = c0max = c0;
332 for (c0 = c0min; c0 <= c0max; c0++) {
333 histp = & histogram[c0][c1][c2min];
343 for (c0 = c0min; c0 <= c0max; c0++) {
344 histp = & histogram[c0][c1][c2min];
354 for (c0 = c0min; c0 <= c0max; c0++) {
355 histp = & histogram[c0][c1min][c2];
365 for (c0 = c0min; c0 <= c0max; c0++) {
366 histp = & histogram[c0][c1min][c2];
390 for (c0 = c0min; c0 <= c0max; c0++)
392 histp = & histogram[c0][c1][c2min];
408 int c0,c1,c2,cmax;
430 c0 = ((b1->c0max - b1->c0min) << C0_SHIFT) * C0_SCALE;
438 if (c0 > cmax) { cmax = c0; n = 0; }
444 if (c0 > cmax) { n = 0; }
487 int c0,c1,c2;
499 for (c0 = c0min; c0 <= c0max; c0++)
501 histp = & histogram[c0][c1][c2min];
505 c0total += ((c0 << C0_SHIFT) + ((1<<C0_SHIFT)>>1)) * count;
668 /* We compute the squared-c0-distance term, then add in the other two. */
835 fill_inverse_cmap (j_decompress_ptr cinfo, int c0, int c1, int c2)
837 /* histogram cell c0/c1/c2. (Only that one cell MUST be filled, but */
853 c0 >>= BOX_C0_LOG;
861 minc0 = (c0 << BOX_C0_SHIFT) + ((1 << C0_SHIFT) >> 1);
875 c0 <<= BOX_C0_LOG; /* convert ID back to base cell indexes */
881 cachep = & histogram[c0+ic0][c1+ic1][c2];
903 register int c0, c1, c2;
913 c0 = GETJSAMPLE(*inptr++) >> C0_SHIFT;
916 cachep = & histogram[c0][c1][c2];
920 fill_inverse_cmap(cinfo, c0,c1,c2);
