Lines Matching refs:leftX
1692 int leftX; /* The left edge of the region we're
1694 int leftXIn; /* 1 means beveled edge at leftX slopes right
1720 leftX = chunkPtr->x;
1721 for (; leftX < maxX; chunkPtr = chunkPtr->nextPtr) {
1734 leftX + xOffset, 0, (unsigned int) (rightX - leftX),
1738 leftX + xOffset, 0, sValuePtr->borderWidth,
1746 leftX = rightX;
1757 leftX = chunkPtr->x;
1766 * Find the chunk in the previous line that covers leftX.
1771 while (rightX2 <= leftX) {
1787 while (leftX < maxX) {
1802 sValuePtr->border, leftX + xOffset, 0,
1803 rightX - leftX, sValuePtr->borderWidth, leftXIn,
1806 leftX = rightX;
1847 leftX = rightX2 - sValuePtr->borderWidth;
1855 leftX + xOffset, 0, rightX2 + sValuePtr->borderWidth -leftX,
1878 leftX = chunkPtr->x;
1887 * Find the chunk in the previous line that covers leftX.
1892 while (rightX2 <= leftX) {
1908 while (leftX < maxX) {
1918 sValuePtr->border, leftX + xOffset,
1920 rightX - leftX, sValuePtr->borderWidth, leftXIn,
1923 leftX = rightX;
1950 leftX = rightX2 - sValuePtr->borderWidth;
1959 leftX + xOffset, dlPtr->height - sValuePtr->borderWidth,
1960 rightX2 + sValuePtr->borderWidth - leftX,