Tk Source Code

    return result;
}
#   endif
#else
#   define _strtoi64 strtoll
#endif

static int colorcmp(const char *spec, const char *pname, int *special) {
    int r;
    int c, d;
    int notequal = 0;
    int num = 0;
    do {
	d = *pname++;
	c = (*spec == ' ');
	if (c) {
	    spec++;
	}
	if ((unsigned)(d - 'A') <= (unsigned)('Z' - 'A')) {
	    d += 'a' - 'A';
	} else if (c) {
	    /* A space doesn't match a lowercase, but we don't know
	     * yet whether we should return a negative or positive
	     * number. That depends on what follows. */
	    notequal = 1;
	}
	c = *spec++;
	if ((unsigned)(c - 'A') <= (unsigned)('Z' - 'A')) {
	    c += 'a' - 'A';
	} else if (((unsigned)(c - '1') <= (unsigned)('9' - '1'))) {
	    if (d == '0') {
	    	d += 10;
	    } else if (!d) {
		num = c - '0';
		while ((unsigned)((c = *spec++) - '0') <= (unsigned)('9' - '0')) {
		    num = num * 10 + c - '0';
		}
	    }
	}
	r = c - d;
    } while(!r && d);
    if (!r && notequal) {
	/* Strings are equal, but difference in spacings only. We should still
	 * report not-equal, so "burly wood" is not a valid color */
	r = 1;
    }
    *special = num;
    return r;
}

#define RED(p) ((unsigned char)(p)[0])
#define GREEN(p) ((unsigned char)(p)[1])
#define BLUE(p) ((unsigned char)(p)[2])

Status
XParseColor(
    Display *display,
    Colormap map,
    const char *spec,
    XColor *colorPtr)

	    colorPtr->green = (unsigned short) (value >> 16);
	    colorPtr->blue = (unsigned short) value;
	    break;
	default:
	    return 0;
	}
    } else {
	int size, num;
	const elem *p;
	const char *q;
	/*
	 * Perform a binary search on the sorted array of colors.
	 * size = current size of search range
	 * p    = pointer to current element being considered.
	 */
	int r = (spec[0] - 'A') & 0xdf;
	if (r > (sizeof(az)/sizeof(az[0] - 1))) {
	    return 0;
	}
	size = az[r + 1] - az[r];
	p = &xColors[(az[r + 1] + az[r]) >> 1];
	r = colorcmp(spec + 1, *p, &num);

	while (r != 0) {
	    if (r < 0) {
		size = (size >> 1);
		p -= ((size + 1) >> 1);
	    } else {
		--size;
		size = (size >> 1);
		p += ((size + 2) >> 1);
	    }
	    if (!size) {
		return 0;
	    }
	    r = colorcmp(spec + 1, *p, &num);
	}
	if (num > (*p)[31]) {
	    if (((*p)[31] != 8) || num > 100)
	    	return 0;
	    q = graymap + 300 - num * 3;
	} else {
	    q = *p + 28 - num * 3;
	}
	colorPtr->red = ((RED(q) << 8) | RED(q));
	colorPtr->green = ((GREEN(q) << 8) | GREEN(q));
	colorPtr->blue = ((BLUE(q) << 8) | BLUE(q));
    }
    colorPtr->pixel = TkpGetPixel(colorPtr);
    colorPtr->flags = DoRed|DoGreen|DoBlue;
    colorPtr->pad = 0;
    return 1;
}


#if 0
int main() {
    XColor color;
    char buf[32];
    int charindex;
    int i, result;
    int repeat = 1;
    int num, maxnum;
    char *end;

    while (repeat--) {
	buf[0] = 'a';
	charindex = 1;
	for (i = 0; i < sizeof(xColors)/sizeof(xColors[0]); ++i) {
	    while (i >= az[charindex]) {
		++charindex;
		++(buf[0]);
	    }
	    strcpy(buf + 1, xColors[i]);
	    end = buf + strlen(buf);
	    num = 0;
	    result = XParseColor(0, 0, buf, &color);
	    printf("%s %d %d %d\n", buf, color.red >> 8, color.green >> 8, color.blue >> 8);
	    maxnum = xColors[i][31];
	    if (maxnum == 8) maxnum = 100;
	    while (result && ++num <= maxnum) {
	    	sprintf(end, "%d", num);
		result = XParseColor(0, 0, buf, &color);
		printf("%s %d %d %d\n", buf, color.red >> 8, color.green >> 8, color.blue >> 8);
	    }
	    if (!result) {
		break;
	    }

	}
    }
    if (!result) {
	printf("NOT OK: %s\n", buf);
    } else {
	printf("OK\n");
    }