204 lines
		
	
	
		
			4.2 KiB
		
	
	
	
		
			C
		
	
	
	
			
		
		
	
	
			204 lines
		
	
	
		
			4.2 KiB
		
	
	
	
		
			C
		
	
	
	
| /*
 | |
|  * Id: fbtile.c,v 1.1 1999/11/02 03:54:45 keithp Exp $
 | |
|  *
 | |
|  * 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 "fb.h"
 | |
| 
 | |
| /*
 | |
|  * Accelerated tile fill -- tile width is a power of two not greater
 | |
|  * than FB_UNIT
 | |
|  */
 | |
| 
 | |
| void
 | |
| fbEvenTile (FbBits	*dst,
 | |
| 	    FbStride	dstStride,
 | |
| 	    int		dstX,
 | |
| 
 | |
| 	    int		width,
 | |
| 	    int		height,
 | |
| 
 | |
| 	    FbBits	*tile,
 | |
| 	    int		tileHeight,
 | |
| 
 | |
| 	    int		alu,
 | |
| 	    FbBits	pm,
 | |
| 	    int		xRot,
 | |
| 	    int		yRot)
 | |
| {
 | |
|     FbBits  *t, *tileEnd, bits;
 | |
|     FbBits  startmask, endmask;
 | |
|     FbBits  and, xor;
 | |
|     int	    n, nmiddle;
 | |
|     int	    tileX, tileY;
 | |
|     int	    rot;
 | |
|     int	    startbyte, endbyte;
 | |
| 
 | |
|     dst += dstX >> FB_SHIFT;
 | |
|     dstX &= FB_MASK;
 | |
|     FbMaskBitsBytes(dstX, width, FbDestInvarientRop(alu, pm),
 | |
| 		    startmask, startbyte, nmiddle, endmask, endbyte);
 | |
|     if (startmask)
 | |
| 	dstStride--;
 | |
|     dstStride -= nmiddle;
 | |
|     
 | |
|     /*
 | |
|      * Compute tile start scanline and rotation parameters
 | |
|      */
 | |
|     tileEnd = tile + tileHeight;
 | |
|     modulus (- yRot, tileHeight, tileY);
 | |
|     t = tile + tileY;
 | |
|     modulus (- xRot, FB_UNIT, tileX);
 | |
|     rot = tileX;
 | |
|     
 | |
|     while (height--)
 | |
|     {
 | |
| 	
 | |
| 	/*
 | |
| 	 * Pick up bits for this scanline
 | |
| 	 */
 | |
| 	bits = *t++;
 | |
| 	if (t == tileEnd) t = tile;
 | |
| 	bits = FbRotLeft(bits,rot);
 | |
| 	and = fbAnd(alu,bits,pm);
 | |
| 	xor = fbXor(alu,bits,pm);
 | |
| 	
 | |
| 	if (startmask)
 | |
| 	{
 | |
| 	    FbDoLeftMaskByteRRop(dst, startbyte, startmask, and, xor);
 | |
| 	    dst++;
 | |
| 	}
 | |
| 	n = nmiddle;
 | |
| 	if (!and)
 | |
| 	    while (n--)
 | |
| 		*dst++ = xor;
 | |
| 	else
 | |
| 	    while (n--)
 | |
| 	    {
 | |
| 		*dst = FbDoRRop (*dst, and, xor);
 | |
| 		dst++;
 | |
| 	    }
 | |
| 	if (endmask)
 | |
| 	    FbDoRightMaskByteRRop(dst, endbyte, endmask, and, xor);
 | |
| 	dst += dstStride;
 | |
|     }
 | |
| }
 | |
| 	    
 | |
| void
 | |
| fbOddTile(FbBits    *dst,
 | |
| 	  FbStride  dstStride,
 | |
| 	  int	    dstX,
 | |
| 
 | |
| 	  int	    width,
 | |
| 	  int	    height,
 | |
| 
 | |
| 	  FbBits    *tile,
 | |
| 	  FbStride  tileStride,
 | |
| 	  int	    tileWidth,
 | |
| 	  int	    tileHeight,
 | |
| 
 | |
| 	  int	    alu,
 | |
| 	  FbBits    pm,
 | |
| 	  int	    bpp,
 | |
| 	  
 | |
| 	  int	    xRot,
 | |
| 	  int	    yRot)
 | |
| {
 | |
|     int	    tileX, tileY;
 | |
|     int	    widthTmp;
 | |
|     int	    h, w;
 | |
|     int	    x, y;
 | |
| 
 | |
|     modulus (- yRot, tileHeight, tileY);
 | |
|     y = 0;
 | |
|     while (height)
 | |
|     {
 | |
| 	h = tileHeight - tileY;
 | |
| 	if (h > height)
 | |
| 	    h = height;
 | |
| 	height -= h;
 | |
| 	widthTmp = width;
 | |
| 	x = dstX;
 | |
| 	modulus (dstX - xRot, tileWidth, tileX);
 | |
| 	while (widthTmp)
 | |
| 	{
 | |
| 	    w = tileWidth - tileX;
 | |
| 	    if (w > widthTmp)
 | |
| 		w = widthTmp;
 | |
| 	    widthTmp -= w;
 | |
| 	    fbBlt (tile + tileY * tileStride,
 | |
| 		   tileStride,
 | |
| 		   tileX,
 | |
| 
 | |
| 		   dst + y * dstStride,
 | |
| 		   dstStride,
 | |
| 		   x,
 | |
| 
 | |
| 		   w, h,
 | |
| 		   alu,
 | |
| 		   pm,
 | |
| 		   bpp,
 | |
| 		   
 | |
| 		   FALSE,
 | |
| 		   FALSE);
 | |
| 	    x += w;
 | |
| 	    tileX = 0;
 | |
| 	}
 | |
| 	y += h;
 | |
| 	tileY = 0;
 | |
|     }
 | |
| }
 | |
| 
 | |
| void
 | |
| fbTile (FbBits	    *dst,
 | |
| 	FbStride    dstStride,
 | |
| 	int	    dstX,
 | |
| 
 | |
| 	int	    width,
 | |
| 	int	    height,
 | |
| 
 | |
| 	FbBits	    *tile,
 | |
| 	FbStride    tileStride,
 | |
| 	int	    tileWidth,
 | |
| 	int	    tileHeight,
 | |
| 	
 | |
| 	int	    alu,
 | |
| 	FbBits	    pm,
 | |
| 	int	    bpp,
 | |
| 	
 | |
| 	int	    xRot,
 | |
| 	int	    yRot)
 | |
| {
 | |
|     if (FbEvenTile (tileWidth))
 | |
| 	fbEvenTile (dst, dstStride, dstX, width, height, 
 | |
| 		    tile, tileHeight,
 | |
| 		    alu, pm, xRot, yRot);
 | |
|     else
 | |
| 	fbOddTile (dst, dstStride, dstX, width, height, 
 | |
| 		   tile, tileStride, tileWidth, tileHeight,
 | |
| 		   alu, pm, bpp, xRot, yRot);
 | |
| }
 |