Lines Matching refs:red
59 * red_max returns maximum red value
130 * be 256 or 254. Then, maximum red value = floor(cube_root(n - 125)) - 1.
131 * Maximum green and maximum blue values are identical to maximum red.
138 default_allocation(XVisualInfo *vinfo, unsigned long *red,
148 *red = *green = *blue = (unsigned long) 27;
151 *red = *green = *blue = (unsigned long) 12;
156 *red = *green = *blue = (unsigned long)
164 *red = *green = *blue = vinfo->colormap_size / 2 - 1;
169 *red = vinfo->red_mask / lowbit(vinfo->red_mask);
184 gray_allocation(ngrays, red, green, blue);
201 * with green getting more than red, and red more than blue, if there
204 * Then maximum red value = floor(cube_root(n)) - 1;
206 * maximum green value = n / ((# red values) * (# blue values)) - 1;
212 best_allocation(XVisualInfo *vinfo, unsigned long *red, unsigned long *green,
218 *red = vinfo->red_mask;
219 while ((*red & 01) == 0)
220 *red >>= 1;
244 * the allocation by "dealing" the bits, first to green, then red, then
245 * blue. If not, find the maximum integral red, green, and blue values
256 *red = 1 << r;
262 *red = icbrt_with_bits(vinfo->colormap_size, bits);
263 *blue = *red;
264 *green = (vinfo->colormap_size / ((*red) * (*blue)));
266 (*red)--;