xref: /OK3568_Linux_fs/external/xserver/fb/fbrop.h (revision 4882a59341e53eb6f0b4789bf948001014eff981)
1*4882a593Smuzhiyun /*
2*4882a593Smuzhiyun  * Copyright © 1998 Keith Packard
3*4882a593Smuzhiyun  *
4*4882a593Smuzhiyun  * Permission to use, copy, modify, distribute, and sell this software and its
5*4882a593Smuzhiyun  * documentation for any purpose is hereby granted without fee, provided that
6*4882a593Smuzhiyun  * the above copyright notice appear in all copies and that both that
7*4882a593Smuzhiyun  * copyright notice and this permission notice appear in supporting
8*4882a593Smuzhiyun  * documentation, and that the name of Keith Packard not be used in
9*4882a593Smuzhiyun  * advertising or publicity pertaining to distribution of the software without
10*4882a593Smuzhiyun  * specific, written prior permission.  Keith Packard makes no
11*4882a593Smuzhiyun  * representations about the suitability of this software for any purpose.  It
12*4882a593Smuzhiyun  * is provided "as is" without express or implied warranty.
13*4882a593Smuzhiyun  *
14*4882a593Smuzhiyun  * KEITH PACKARD DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
15*4882a593Smuzhiyun  * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
16*4882a593Smuzhiyun  * EVENT SHALL KEITH PACKARD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
17*4882a593Smuzhiyun  * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
18*4882a593Smuzhiyun  * DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
19*4882a593Smuzhiyun  * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
20*4882a593Smuzhiyun  * PERFORMANCE OF THIS SOFTWARE.
21*4882a593Smuzhiyun  */
22*4882a593Smuzhiyun 
23*4882a593Smuzhiyun #ifndef _FBROP_H_
24*4882a593Smuzhiyun #define _FBROP_H_
25*4882a593Smuzhiyun 
26*4882a593Smuzhiyun typedef struct _mergeRopBits {
27*4882a593Smuzhiyun     FbBits ca1, cx1, ca2, cx2;
28*4882a593Smuzhiyun } FbMergeRopRec, *FbMergeRopPtr;
29*4882a593Smuzhiyun 
30*4882a593Smuzhiyun extern _X_EXPORT const FbMergeRopRec FbMergeRopBits[16];
31*4882a593Smuzhiyun 
32*4882a593Smuzhiyun #define FbDeclareMergeRop() FbBits   _ca1, _cx1, _ca2, _cx2;
33*4882a593Smuzhiyun #define FbDeclarePrebuiltMergeRop()	FbBits	_cca, _ccx;
34*4882a593Smuzhiyun 
35*4882a593Smuzhiyun #define FbInitializeMergeRop(alu,pm) {\
36*4882a593Smuzhiyun     const FbMergeRopRec  *_bits; \
37*4882a593Smuzhiyun     _bits = &FbMergeRopBits[alu]; \
38*4882a593Smuzhiyun     _ca1 = _bits->ca1 &  pm; \
39*4882a593Smuzhiyun     _cx1 = _bits->cx1 | ~pm; \
40*4882a593Smuzhiyun     _ca2 = _bits->ca2 &  pm; \
41*4882a593Smuzhiyun     _cx2 = _bits->cx2 &  pm; \
42*4882a593Smuzhiyun }
43*4882a593Smuzhiyun 
44*4882a593Smuzhiyun #define FbDestInvarientRop(alu,pm)  ((pm) == FB_ALLONES && \
45*4882a593Smuzhiyun 				     (((alu) >> 1 & 5) == ((alu) & 5)))
46*4882a593Smuzhiyun 
47*4882a593Smuzhiyun #define FbDestInvarientMergeRop()   (_ca1 == 0 && _cx1 == 0)
48*4882a593Smuzhiyun 
49*4882a593Smuzhiyun /* AND has higher precedence than XOR */
50*4882a593Smuzhiyun 
51*4882a593Smuzhiyun #define FbDoMergeRop(src, dst) \
52*4882a593Smuzhiyun     (((dst) & (((src) & _ca1) ^ _cx1)) ^ (((src) & _ca2) ^ _cx2))
53*4882a593Smuzhiyun 
54*4882a593Smuzhiyun #define FbDoDestInvarientMergeRop(src)	(((src) & _ca2) ^ _cx2)
55*4882a593Smuzhiyun 
56*4882a593Smuzhiyun #define FbDoMaskMergeRop(src, dst, mask) \
57*4882a593Smuzhiyun     (((dst) & ((((src) & _ca1) ^ _cx1) | ~(mask))) ^ ((((src) & _ca2) ^ _cx2) & (mask)))
58*4882a593Smuzhiyun 
59*4882a593Smuzhiyun #define FbDoLeftMaskByteMergeRop(dst, src, lb, l) { \
60*4882a593Smuzhiyun     FbBits  __xor = ((src) & _ca2) ^ _cx2; \
61*4882a593Smuzhiyun     FbDoLeftMaskByteRRop(dst,lb,l,((src) & _ca1) ^ _cx1,__xor); \
62*4882a593Smuzhiyun }
63*4882a593Smuzhiyun 
64*4882a593Smuzhiyun #define FbDoRightMaskByteMergeRop(dst, src, rb, r) { \
65*4882a593Smuzhiyun     FbBits  __xor = ((src) & _ca2) ^ _cx2; \
66*4882a593Smuzhiyun     FbDoRightMaskByteRRop(dst,rb,r,((src) & _ca1) ^ _cx1,__xor); \
67*4882a593Smuzhiyun }
68*4882a593Smuzhiyun 
69*4882a593Smuzhiyun #define FbDoRRop(dst, and, xor)	(((dst) & (and)) ^ (xor))
70*4882a593Smuzhiyun 
71*4882a593Smuzhiyun #define FbDoMaskRRop(dst, and, xor, mask) \
72*4882a593Smuzhiyun     (((dst) & ((and) | ~(mask))) ^ (xor & mask))
73*4882a593Smuzhiyun 
74*4882a593Smuzhiyun /*
75*4882a593Smuzhiyun  * Take a single bit (0 or 1) and generate a full mask
76*4882a593Smuzhiyun  */
77*4882a593Smuzhiyun #define fbFillFromBit(b,t)	(~((t) ((b) & 1)-1))
78*4882a593Smuzhiyun 
79*4882a593Smuzhiyun #define fbXorT(rop,fg,pm,t) ((((fg) & fbFillFromBit((rop) >> 1,t)) | \
80*4882a593Smuzhiyun 			      (~(fg) & fbFillFromBit((rop) >> 3,t))) & (pm))
81*4882a593Smuzhiyun 
82*4882a593Smuzhiyun #define fbAndT(rop,fg,pm,t) ((((fg) & fbFillFromBit (rop ^ (rop>>1),t)) | \
83*4882a593Smuzhiyun 			      (~(fg) & fbFillFromBit((rop>>2) ^ (rop>>3),t))) | \
84*4882a593Smuzhiyun 			     ~(pm))
85*4882a593Smuzhiyun 
86*4882a593Smuzhiyun #define fbXor(rop,fg,pm)	fbXorT(rop,fg,pm,FbBits)
87*4882a593Smuzhiyun 
88*4882a593Smuzhiyun #define fbAnd(rop,fg,pm)	fbAndT(rop,fg,pm,FbBits)
89*4882a593Smuzhiyun 
90*4882a593Smuzhiyun #define fbXorStip(rop,fg,pm)    fbXorT(rop,fg,pm,FbStip)
91*4882a593Smuzhiyun 
92*4882a593Smuzhiyun #define fbAndStip(rop,fg,pm)	fbAndT(rop,fg,pm,FbStip)
93*4882a593Smuzhiyun 
94*4882a593Smuzhiyun /*
95*4882a593Smuzhiyun  * Stippling operations;
96*4882a593Smuzhiyun  */
97*4882a593Smuzhiyun 
98*4882a593Smuzhiyun #define FbStippleRRop(dst, b, fa, fx, ba, bx) \
99*4882a593Smuzhiyun     (FbDoRRop(dst, fa, fx) & b) | (FbDoRRop(dst, ba, bx) & ~b)
100*4882a593Smuzhiyun 
101*4882a593Smuzhiyun #define FbStippleRRopMask(dst, b, fa, fx, ba, bx, m) \
102*4882a593Smuzhiyun     (FbDoMaskRRop(dst, fa, fx, m) & (b)) | (FbDoMaskRRop(dst, ba, bx, m) & ~(b))
103*4882a593Smuzhiyun 
104*4882a593Smuzhiyun #define FbDoLeftMaskByteStippleRRop(dst, b, fa, fx, ba, bx, lb, l) { \
105*4882a593Smuzhiyun     FbBits  __xor = ((fx) & (b)) | ((bx) & ~(b)); \
106*4882a593Smuzhiyun     FbDoLeftMaskByteRRop(dst, lb, l, ((fa) & (b)) | ((ba) & ~(b)), __xor); \
107*4882a593Smuzhiyun }
108*4882a593Smuzhiyun 
109*4882a593Smuzhiyun #define FbDoRightMaskByteStippleRRop(dst, b, fa, fx, ba, bx, rb, r) { \
110*4882a593Smuzhiyun     FbBits  __xor = ((fx) & (b)) | ((bx) & ~(b)); \
111*4882a593Smuzhiyun     FbDoRightMaskByteRRop(dst, rb, r, ((fa) & (b)) | ((ba) & ~(b)), __xor); \
112*4882a593Smuzhiyun }
113*4882a593Smuzhiyun 
114*4882a593Smuzhiyun #define FbOpaqueStipple(b, fg, bg) (((fg) & (b)) | ((bg) & ~(b)))
115*4882a593Smuzhiyun 
116*4882a593Smuzhiyun /*
117*4882a593Smuzhiyun  * Compute rop for using tile code for 1-bit dest stipples; modifies
118*4882a593Smuzhiyun  * existing rop to flip depending on pixel values
119*4882a593Smuzhiyun  */
120*4882a593Smuzhiyun #define FbStipple1RopPick(alu,b)    (((alu) >> (2 - (((b) & 1) << 1))) & 3)
121*4882a593Smuzhiyun 
122*4882a593Smuzhiyun #define FbOpaqueStipple1Rop(alu,fg,bg)    (FbStipple1RopPick(alu,fg) | \
123*4882a593Smuzhiyun 					   (FbStipple1RopPick(alu,bg) << 2))
124*4882a593Smuzhiyun 
125*4882a593Smuzhiyun #define FbStipple1Rop(alu,fg)	    (FbStipple1RopPick(alu,fg) | 4)
126*4882a593Smuzhiyun 
127*4882a593Smuzhiyun #endif
128