Lines Matching defs:c0
122 * pointer corresponds to a C0 value (typically 2^5 = 32 pointers) and
321 int c0,c1,c2;
331 for (c0 = c0min; c0 <= c0max; c0++)
333 histp = & histogram[c0][c1][c2min];
336 boxp->c0min = c0min = c0;
342 for (c0 = c0max; c0 >= c0min; c0--)
344 histp = & histogram[c0][c1][c2min];
347 boxp->c0max = c0max = c0;
354 for (c0 = c0min; c0 <= c0max; c0++) {
355 histp = & histogram[c0][c1][c2min];
365 for (c0 = c0min; c0 <= c0max; c0++) {
366 histp = & histogram[c0][c1][c2min];
376 for (c0 = c0min; c0 <= c0max; c0++) {
377 histp = & histogram[c0][c1min][c2];
387 for (c0 = c0min; c0 <= c0max; c0++) {
388 histp = & histogram[c0][c1min][c2];
412 for (c0 = c0min; c0 <= c0max; c0++)
414 histp = & histogram[c0][c1][c2min];
430 int c0,c1,c2,cmax;
452 c0 = ((b1->c0max - b1->c0min) << C0_SHIFT) * C0_SCALE;
460 if (c0 > cmax) { cmax = c0; n = 0; }
465 if (c0 > cmax) { n = 0; }
508 int c0,c1,c2;
520 for (c0 = c0min; c0 <= c0max; c0++)
522 histp = & histogram[c0][c1][c2min];
526 c0total += ((c0 << C0_SHIFT) + ((1<<C0_SHIFT)>>1)) * count;
689 /* We compute the squared-c0-distance term, then add in the other two. */
856 fill_inverse_cmap (j_decompress_ptr cinfo, int c0, int c1, int c2)
858 /* histogram cell c0/c1/c2. (Only that one cell MUST be filled, but */
874 c0 >>= BOX_C0_LOG;
882 minc0 = (c0 << BOX_C0_SHIFT) + ((1 << C0_SHIFT) >> 1);
896 c0 <<= BOX_C0_LOG; /* convert ID back to base cell indexes */
902 cachep = & histogram[c0+ic0][c1+ic1][c2];
924 register int c0, c1, c2;
934 c0 = GETJSAMPLE(*inptr++) >> C0_SHIFT;
937 cachep = & histogram[c0][c1][c2];
941 fill_inverse_cmap(cinfo, c0,c1,c2);
