|
|
1.1 root 1: /******************************Module*Header*******************************\
2: * Module Name: bitblt.h
3: *
4: * BitBlt
5: *
6: * Copyright (c) 1992 Microsoft Corporation
7: \**************************************************************************/
8:
9: /// Define the A vector polynomial bits
10: //
11: // Each bit corresponds to one of the terms in the polynomial
12: //
13: // Rop(D,S,P) = a + a D + a S + a P + a DS + a DP + a SP + a DSP
14: // 0 d s p ds dp sp dsp
15:
16: #define AVEC_NOT 0x01
17: #define AVEC_D 0x02
18: #define AVEC_S 0x04
19: #define AVEC_P 0x08
20: #define AVEC_DS 0x10
21: #define AVEC_DP 0x20
22: #define AVEC_SP 0x40
23: #define AVEC_DSP 0x80
24:
25: #define AVEC_NEED_SOURCE (AVEC_S | AVEC_DS | AVEC_SP | AVEC_DSP)
26: #define AVEC_NEED_PATTERN (AVEC_P | AVEC_DP | AVEC_SP | AVEC_DSP)
27:
28: #define BB_TARGET_SCREEN 0x0001
29: #define BB_TARGET_ONLY 0x0002
30: #define BB_SOURCE_COPY 0x0004
31: #define BB_PATTERN_COPY 0x0008
32:
33: typedef struct _BBENUMTRAP
34: {
35: ULONG c;
36: TRAPEZOID atrap[ENUM_RECT_LIMIT];
37: } BBENUMTRAP;
38:
39: #define MAX_DDA_RECTS 40 // most rects we want enumerated by DDAOBJ at once
40:
41: typedef struct _DDAENUM
42: {
43: LONG yTop;
44: LONG yBottom;
45: LONG axPairs[MAX_DDA_RECTS];
46: } DDAENUM;
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.