2006-11-26 11:13:41 -07:00
|
|
|
/*
|
|
|
|
* Copyright © 1998 Keith Packard
|
|
|
|
*
|
|
|
|
* Permission to use, copy, modify, distribute, and sell this software and its
|
|
|
|
* documentation for any purpose is hereby granted without fee, provided that
|
|
|
|
* the above copyright notice appear in all copies and that both that
|
|
|
|
* copyright notice and this permission notice appear in supporting
|
|
|
|
* documentation, and that the name of Keith Packard not be used in
|
|
|
|
* advertising or publicity pertaining to distribution of the software without
|
|
|
|
* specific, written prior permission. Keith Packard makes no
|
|
|
|
* representations about the suitability of this software for any purpose. It
|
|
|
|
* is provided "as is" without express or implied warranty.
|
|
|
|
*
|
|
|
|
* KEITH PACKARD DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
|
|
|
|
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
|
|
|
|
* EVENT SHALL KEITH PACKARD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
|
|
|
|
* CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
|
|
|
|
* DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
|
|
|
|
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
|
|
|
* PERFORMANCE OF THIS SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifdef HAVE_DIX_CONFIG_H
|
|
|
|
#include <dix-config.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <string.h>
|
|
|
|
#include "fb.h"
|
|
|
|
|
|
|
|
#define InitializeShifts(sx,dx,ls,rs) { \
|
|
|
|
if (sx != dx) { \
|
|
|
|
if (sx > dx) { \
|
|
|
|
ls = sx - dx; \
|
|
|
|
rs = FB_UNIT - ls; \
|
|
|
|
} else { \
|
|
|
|
rs = dx - sx; \
|
|
|
|
ls = FB_UNIT - rs; \
|
|
|
|
} \
|
|
|
|
} \
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2012-06-10 07:21:05 -06:00
|
|
|
fbBlt(FbBits * srcLine,
|
|
|
|
FbStride srcStride,
|
|
|
|
int srcX,
|
|
|
|
FbBits * dstLine,
|
|
|
|
FbStride dstStride,
|
|
|
|
int dstX,
|
|
|
|
int width,
|
|
|
|
int height, int alu, FbBits pm, int bpp, Bool reverse, Bool upsidedown)
|
2006-11-26 11:13:41 -07:00
|
|
|
{
|
2012-06-10 07:21:05 -06:00
|
|
|
FbBits *src, *dst;
|
|
|
|
int leftShift, rightShift;
|
|
|
|
FbBits startmask, endmask;
|
|
|
|
FbBits bits, bits1;
|
|
|
|
int n, nmiddle;
|
|
|
|
Bool destInvarient;
|
|
|
|
int startbyte, endbyte;
|
|
|
|
|
|
|
|
FbDeclareMergeRop();
|
|
|
|
|
2014-09-27 11:52:59 -06:00
|
|
|
if (alu == GXcopy && pm == FB_ALLONES &&
|
|
|
|
!(srcX & 7) && !(dstX & 7) && !(width & 7))
|
|
|
|
{
|
|
|
|
CARD8 *src_byte = (CARD8 *) srcLine + (srcX >> 3);
|
|
|
|
CARD8 *dst_byte = (CARD8 *) dstLine + (dstX >> 3);
|
|
|
|
FbStride src_byte_stride = srcStride << (FB_SHIFT - 3);
|
|
|
|
FbStride dst_byte_stride = dstStride << (FB_SHIFT - 3);
|
|
|
|
int width_byte = (width >> 3);
|
2006-11-26 11:13:41 -07:00
|
|
|
|
2014-09-27 11:52:59 -06:00
|
|
|
/* Make sure there's no overlap; we can't use memcpy in that
|
|
|
|
* case as it's not well defined, so fall through to the
|
|
|
|
* general code
|
|
|
|
*/
|
|
|
|
if (src_byte + width_byte <= dst_byte ||
|
|
|
|
dst_byte + width_byte <= src_byte)
|
|
|
|
{
|
|
|
|
int i;
|
2011-11-05 07:32:40 -06:00
|
|
|
|
2014-09-27 11:52:59 -06:00
|
|
|
if (!upsidedown)
|
|
|
|
for (i = 0; i < height; i++)
|
|
|
|
MEMCPY_WRAPPED(dst_byte + i * dst_byte_stride,
|
|
|
|
src_byte + i * src_byte_stride,
|
|
|
|
width_byte);
|
|
|
|
else
|
|
|
|
for (i = height - 1; i >= 0; i--)
|
|
|
|
MEMCPY_WRAPPED(dst_byte + i * dst_byte_stride,
|
|
|
|
src_byte + i * src_byte_stride,
|
|
|
|
width_byte);
|
2011-11-05 07:32:40 -06:00
|
|
|
|
2014-09-27 11:52:59 -06:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
2006-11-26 11:13:41 -07:00
|
|
|
|
|
|
|
FbInitializeMergeRop(alu, pm);
|
|
|
|
destInvarient = FbDestInvarientMergeRop();
|
2012-06-10 07:21:05 -06:00
|
|
|
if (upsidedown) {
|
|
|
|
srcLine += (height - 1) * (srcStride);
|
|
|
|
dstLine += (height - 1) * (dstStride);
|
|
|
|
srcStride = -srcStride;
|
|
|
|
dstStride = -dstStride;
|
2006-11-26 11:13:41 -07:00
|
|
|
}
|
2012-06-10 07:21:05 -06:00
|
|
|
FbMaskBitsBytes(dstX, width, destInvarient, startmask, startbyte,
|
|
|
|
nmiddle, endmask, endbyte);
|
|
|
|
if (reverse) {
|
|
|
|
srcLine += ((srcX + width - 1) >> FB_SHIFT) + 1;
|
|
|
|
dstLine += ((dstX + width - 1) >> FB_SHIFT) + 1;
|
|
|
|
srcX = (srcX + width - 1) & FB_MASK;
|
|
|
|
dstX = (dstX + width - 1) & FB_MASK;
|
2006-11-26 11:13:41 -07:00
|
|
|
}
|
2012-06-10 07:21:05 -06:00
|
|
|
else {
|
|
|
|
srcLine += srcX >> FB_SHIFT;
|
|
|
|
dstLine += dstX >> FB_SHIFT;
|
|
|
|
srcX &= FB_MASK;
|
|
|
|
dstX &= FB_MASK;
|
2006-11-26 11:13:41 -07:00
|
|
|
}
|
2012-06-10 07:21:05 -06:00
|
|
|
if (srcX == dstX) {
|
|
|
|
while (height--) {
|
|
|
|
src = srcLine;
|
|
|
|
srcLine += srcStride;
|
|
|
|
dst = dstLine;
|
|
|
|
dstLine += dstStride;
|
|
|
|
if (reverse) {
|
|
|
|
if (endmask) {
|
|
|
|
bits = READ(--src);
|
|
|
|
--dst;
|
|
|
|
FbDoRightMaskByteMergeRop(dst, bits, endbyte, endmask);
|
|
|
|
}
|
|
|
|
n = nmiddle;
|
|
|
|
if (destInvarient) {
|
|
|
|
while (n--)
|
|
|
|
WRITE(--dst, FbDoDestInvarientMergeRop(READ(--src)));
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
while (n--) {
|
|
|
|
bits = READ(--src);
|
|
|
|
--dst;
|
|
|
|
WRITE(dst, FbDoMergeRop(bits, READ(dst)));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (startmask) {
|
|
|
|
bits = READ(--src);
|
|
|
|
--dst;
|
|
|
|
FbDoLeftMaskByteMergeRop(dst, bits, startbyte, startmask);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
if (startmask) {
|
|
|
|
bits = READ(src++);
|
|
|
|
FbDoLeftMaskByteMergeRop(dst, bits, startbyte, startmask);
|
|
|
|
dst++;
|
|
|
|
}
|
|
|
|
n = nmiddle;
|
|
|
|
if (destInvarient) {
|
2006-11-26 11:13:41 -07:00
|
|
|
#if 0
|
2012-06-10 07:21:05 -06:00
|
|
|
/*
|
|
|
|
* This provides some speedup on screen->screen blts
|
|
|
|
* over the PCI bus, usually about 10%. But fb
|
|
|
|
* isn't usually used for this operation...
|
|
|
|
*/
|
|
|
|
if (_ca2 + 1 == 0 && _cx2 == 0) {
|
|
|
|
FbBits t1, t2, t3, t4;
|
|
|
|
|
|
|
|
while (n >= 4) {
|
|
|
|
t1 = *src++;
|
|
|
|
t2 = *src++;
|
|
|
|
t3 = *src++;
|
|
|
|
t4 = *src++;
|
|
|
|
*dst++ = t1;
|
|
|
|
*dst++ = t2;
|
|
|
|
*dst++ = t3;
|
|
|
|
*dst++ = t4;
|
|
|
|
n -= 4;
|
|
|
|
}
|
|
|
|
}
|
2006-11-26 11:13:41 -07:00
|
|
|
#endif
|
2012-06-10 07:21:05 -06:00
|
|
|
while (n--)
|
|
|
|
WRITE(dst++, FbDoDestInvarientMergeRop(READ(src++)));
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
while (n--) {
|
|
|
|
bits = READ(src++);
|
|
|
|
WRITE(dst, FbDoMergeRop(bits, READ(dst)));
|
|
|
|
dst++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (endmask) {
|
|
|
|
bits = READ(src);
|
|
|
|
FbDoRightMaskByteMergeRop(dst, bits, endbyte, endmask);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2006-11-26 11:13:41 -07:00
|
|
|
}
|
2012-06-10 07:21:05 -06:00
|
|
|
else {
|
|
|
|
if (srcX > dstX) {
|
|
|
|
leftShift = srcX - dstX;
|
|
|
|
rightShift = FB_UNIT - leftShift;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
rightShift = dstX - srcX;
|
|
|
|
leftShift = FB_UNIT - rightShift;
|
|
|
|
}
|
|
|
|
while (height--) {
|
|
|
|
src = srcLine;
|
|
|
|
srcLine += srcStride;
|
|
|
|
dst = dstLine;
|
|
|
|
dstLine += dstStride;
|
|
|
|
|
|
|
|
bits1 = 0;
|
|
|
|
if (reverse) {
|
|
|
|
if (srcX < dstX)
|
|
|
|
bits1 = READ(--src);
|
|
|
|
if (endmask) {
|
|
|
|
bits = FbScrRight(bits1, rightShift);
|
|
|
|
if (FbScrRight(endmask, leftShift)) {
|
|
|
|
bits1 = READ(--src);
|
|
|
|
bits |= FbScrLeft(bits1, leftShift);
|
|
|
|
}
|
|
|
|
--dst;
|
|
|
|
FbDoRightMaskByteMergeRop(dst, bits, endbyte, endmask);
|
|
|
|
}
|
|
|
|
n = nmiddle;
|
|
|
|
if (destInvarient) {
|
|
|
|
while (n--) {
|
|
|
|
bits = FbScrRight(bits1, rightShift);
|
|
|
|
bits1 = READ(--src);
|
|
|
|
bits |= FbScrLeft(bits1, leftShift);
|
|
|
|
--dst;
|
|
|
|
WRITE(dst, FbDoDestInvarientMergeRop(bits));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
while (n--) {
|
|
|
|
bits = FbScrRight(bits1, rightShift);
|
|
|
|
bits1 = READ(--src);
|
|
|
|
bits |= FbScrLeft(bits1, leftShift);
|
|
|
|
--dst;
|
|
|
|
WRITE(dst, FbDoMergeRop(bits, READ(dst)));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (startmask) {
|
|
|
|
bits = FbScrRight(bits1, rightShift);
|
|
|
|
if (FbScrRight(startmask, leftShift)) {
|
|
|
|
bits1 = READ(--src);
|
|
|
|
bits |= FbScrLeft(bits1, leftShift);
|
|
|
|
}
|
|
|
|
--dst;
|
|
|
|
FbDoLeftMaskByteMergeRop(dst, bits, startbyte, startmask);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
if (srcX > dstX)
|
|
|
|
bits1 = READ(src++);
|
|
|
|
if (startmask) {
|
|
|
|
bits = FbScrLeft(bits1, leftShift);
|
|
|
|
if (FbScrLeft(startmask, rightShift)) {
|
|
|
|
bits1 = READ(src++);
|
|
|
|
bits |= FbScrRight(bits1, rightShift);
|
|
|
|
}
|
|
|
|
FbDoLeftMaskByteMergeRop(dst, bits, startbyte, startmask);
|
|
|
|
dst++;
|
|
|
|
}
|
|
|
|
n = nmiddle;
|
|
|
|
if (destInvarient) {
|
|
|
|
while (n--) {
|
|
|
|
bits = FbScrLeft(bits1, leftShift);
|
|
|
|
bits1 = READ(src++);
|
|
|
|
bits |= FbScrRight(bits1, rightShift);
|
|
|
|
WRITE(dst, FbDoDestInvarientMergeRop(bits));
|
|
|
|
dst++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
while (n--) {
|
|
|
|
bits = FbScrLeft(bits1, leftShift);
|
|
|
|
bits1 = READ(src++);
|
|
|
|
bits |= FbScrRight(bits1, rightShift);
|
|
|
|
WRITE(dst, FbDoMergeRop(bits, READ(dst)));
|
|
|
|
dst++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (endmask) {
|
|
|
|
bits = FbScrLeft(bits1, leftShift);
|
|
|
|
if (FbScrLeft(endmask, rightShift)) {
|
|
|
|
bits1 = READ(src);
|
|
|
|
bits |= FbScrRight(bits1, rightShift);
|
|
|
|
}
|
|
|
|
FbDoRightMaskByteMergeRop(dst, bits, endbyte, endmask);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2006-11-26 11:13:41 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2012-06-10 07:21:05 -06:00
|
|
|
fbBltStip(FbStip * src, FbStride srcStride, /* in FbStip units, not FbBits units */
|
|
|
|
int srcX, FbStip * dst, FbStride dstStride, /* in FbStip units, not FbBits units */
|
|
|
|
int dstX, int width, int height, int alu, FbBits pm, int bpp)
|
2006-11-26 11:13:41 -07:00
|
|
|
{
|
2015-09-16 13:10:19 -06:00
|
|
|
fbBlt((FbBits *) src, FbStipStrideToBitsStride(srcStride), srcX,
|
|
|
|
(FbBits *) dst, FbStipStrideToBitsStride(dstStride), dstX,
|
|
|
|
width, height, alu, pm, bpp, FALSE, FALSE);
|
2006-11-26 11:13:41 -07:00
|
|
|
}
|