Lines Matching defs:c1
299 int c0,c1,c2;
310 for (c1 = c1min; c1 <= c1max; c1++) {
311 histp = & histogram[c0][c1][c2min];
321 for (c1 = c1min; c1 <= c1max; c1++) {
322 histp = & histogram[c0][c1][c2min];
331 for (c1 = c1min; c1 <= c1max; c1++)
333 histp = & histogram[c0][c1][c2min];
336 boxp->c1min = c1min = c1;
342 for (c1 = c1max; c1 >= c1min; c1--)
344 histp = & histogram[c0][c1][c2min];
347 boxp->c1max = c1max = c1;
356 for (c1 = c1min; c1 <= c1max; c1++, histp += HIST_C2_ELEMS)
367 for (c1 = c1min; c1 <= c1max; c1++, histp += HIST_C2_ELEMS)
391 for (c1 = c1min; c1 <= c1max; c1++) {
392 histp = & histogram[c0][c1][c2min];
408 int c0,c1,c2,cmax;
431 c1 = ((b1->c1max - b1->c1min) << C1_SHIFT) * C1_SCALE;
437 cmax = c1; n = 1;
442 cmax = c1; n = 1;
487 int c0,c1,c2;
500 for (c1 = c1min; c1 <= c1max; c1++) {
501 histp = & histogram[c0][c1][c2min];
506 c1total += ((c1 << C1_SHIFT) + ((1<<C1_SHIFT)>>1)) * count;
793 /* Compute (square of) distance from minc0/c1/c2 to this color */
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 */
854 c1 >>= BOX_C1_LOG;
862 minc1 = (c1 << BOX_C1_SHIFT) + ((1 << C1_SHIFT) >> 1);
876 c1 <<= BOX_C1_LOG;
881 cachep = & histogram[c0+ic0][c1+ic1][c2];
903 register int c0, c1, c2;
914 c1 = GETJSAMPLE(*inptr++) >> C1_SHIFT;
916 cachep = & histogram[c0][c1][c2];
920 fill_inverse_cmap(cinfo, c0,c1,c2);
