Lines Matching +defs:color +defs:values
5 * stored in full color (32 bits per pixel including alpha channel)
55 * An unsigned 32-bit integral type, used for pixel values.
73 * color to use, and
76 * Pixel values allocated for specific colors are valid only for the
77 * colormap in which they were allocated. Sets of pixel values
80 * values match. A hash table is used to locate these sets of pixel
81 * values, using the following data structure as key:
95 * pixel values and other information:
100 * color table. */
108 * using this color table. */
110 pixel redValues[256]; /* Maps 8-bit values of red intensity
114 unsigned long *pixelMap; /* Actual pixel values allocated. */
126 * COLOR_WINDOW: 1 means a full 3-D color cube has been
131 * MAP_COLORS: 1 means pixel values should be mapped
178 * COLOR_IMAGE: 1 means that the image has different color
183 * have alpha values that aren't 0 or 255.
685 XColor color;
834 * Check the values given for the -from option.
863 * Fill in default values for unspecified parameters.
956 * Fill in default values for unspecified parameters.
1153 Tcl_AppendResult(interp, "all elements of color list must",
1160 listArgv[x], &color)) {
1161 Tcl_AppendResult(interp, "can't parse color \"",
1165 *pixelPtr++ = color.red >> 8;
1166 *pixelPtr++ = color.green >> 8;
1167 *pixelPtr++ = color.blue >> 8;
1186 * Fill in default values for the -to option, then
1267 * Check the values given for the -from option.
1515 * Fill in default values for unspecified parameters.
1621 * and the values given is returned here. */
1634 int values[4];
1698 * parse the values given. Report an error if too few
1699 * or too many values are given.
1773 if (Tcl_GetInt(interp, val, &values[numValues])
1786 " integer values", (char *) NULL);
1792 * Y values default to the corresponding X value if not specified.
1796 values[1] = values[0];
1799 values[3] = values[2];
1803 * Check the values given and put them in the appropriate
1809 if ((values[0] < 0) || (values[1] < 0) || ((numValues > 2)
1810 && ((values[2] < 0) || (values[3] < 0)))) {
1816 optPtr->fromX = values[0];
1817 optPtr->fromY = values[1];
1821 optPtr->fromX = MIN(values[0], values[2]);
1822 optPtr->fromY = MIN(values[1], values[3]);
1823 optPtr->fromX2 = MAX(values[0], values[2]);
1824 optPtr->fromY2 = MAX(values[1], values[3]);
1828 optPtr->subsampleX = values[0];
1829 optPtr->subsampleY = values[1];
1832 if ((values[0] < 0) || (values[1] < 0) || ((numValues > 2)
1833 && ((values[2] < 0) || (values[3] < 0)))) {
1839 optPtr->toX = values[0];
1840 optPtr->toY = values[1];
1844 optPtr->toX = MIN(values[0], values[2]);
1845 optPtr->toY = MIN(values[1], values[3]);
1846 optPtr->toX2 = MAX(values[0], values[2]);
1847 optPtr->toY2 = MAX(values[1], values[3]);
1851 if ((values[0] <= 0) || (values[1] <= 0)) {
1856 optPtr->zoomX = values[0];
1857 optPtr->zoomY = values[1];
1945 * Save the current values for fileString and dataString, so we
2229 * If we don't currently have a color table, or if the one we
2240 * Free up our old color table, and get a new one.
2274 * byte-swap any 16 or 32 bit values that we store in the image
2292 * to the values specified by the user. If we have no pixmap, we
2881 * Decrement the count of live uses of its color table, so
3246 * values propagating into areas we dither later.
3435 * display, colormap, palette and gamma values, so that the
3453 PhotoInstance *instancePtr; /* Instance needing a color table. */
3484 * No color table currently available; need to make one.
3520 * Allocate colors for this color table if necessary.
3536 * color table.
3542 * If no other instances are using this color table, a when-idle
3543 * handler is registered to free up the color table and the colors
3551 ColorTable *colorPtr; /* Pointer to the color table which is
3577 * This procedure allocates the colors required by a color table,
3578 * and sets up the fields in the color table data structure which
3586 * color table data structure are updated.
3593 ColorTable *colorPtr; /* Pointer to the color table requiring
3669 * we have to allocate each color in the color cube separately.
3724 * first try freeing colors from other unused color tables.
3731 * Still can't allocate the color.
3741 * resolution of the color cube, free the ones we got,
3792 * the value since we will be passing the color table into the
3866 * The colors in the argument color table are freed, as is the
3867 * color table structure itself. The color table is removed
3868 * from the hash table which is used to locate color tables.
3907 * colormap used by a color table. It looks for other color
3918 * color allocations.
3925 * the color table which needs more colors. */
3934 * First scan through the color hash table to get an
4421 * components, mark it as a color image.
4559 * current background color, etc. But this costs us a lot on the
4564 * drawing time, for each transparent pixel, set its color to the
4565 * color of the background behind that pixel. This is what I suspect
4568 * Determining the correct bg color for a given pixel might be
4768 * components, mark it as a color image.
5195 * values, we compute
5244 * Translate the quantized component values into
5279 * to the color window case above, except that there is only
5280 * one component. If the master image is in color, use the