marko10_000
/
wine-wine
forked from Mirrors/wine-wine
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
wine-wine/dlls/gdi32/dibdrv/objects.c

1538 lines
48 KiB
C
Raw Blame History

/*
* DIB driver GDI objects.
*
* Copyright 2011 Huw Davies
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
*/
#include <assert.h>
#include <stdlib.h>
#include "gdi_private.h"
#include "dibdrv.h"
#include "wine/debug.h"
WINE_DEFAULT_DEBUG_CHANNEL(dib);
/*
*
* Decompose the 16 ROP2s into an expression of the form
*
* D = (D & A) ^ X
*
* Where A and X depend only on P (and so can be precomputed).
*
* A X
*
* R2_BLACK 0 0 0
* R2_NOTMERGEPEN ~(D | P) ~P ~P
* R2_MASKNOTPEN ~P & D ~P 0
* R2_NOTCOPYPEN ~P 0 ~P
* R2_MASKPENNOT P & ~D P P
* R2_NOT ~D 1 1
* R2_XORPEN P ^ D 1 P
* R2_NOTMASKPEN ~(P & D) P 1
* R2_MASKPEN P & D P 0
* R2_NOTXORPEN ~(P ^ D) 1 ~P
* R2_NOP D 1 0
* R2_MERGENOTPEN ~P | D P ~P
* R2_COPYPEN P 0 P
* R2_MERGEPENNOT P | ~D ~P 1
* R2_MERGEPEN P | D ~P P
* R2_WHITE 1 0 1
*
*/
/* A = (P & A1) ^ A2 */
#define ZERO { 0u, 0u}
#define ONE { 0u, ~0u}
#define P {~0u, 0u}
#define NOT_P {~0u, ~0u}
static const DWORD rop2_and_array[16][2] =
{
ZERO, NOT_P, NOT_P, ZERO,
P, ONE, ONE, P,
P, ONE, ONE, P,
ZERO, NOT_P, NOT_P, ZERO
};
/* X = (P & X1) ^ X2 */
static const DWORD rop2_xor_array[16][2] =
{
ZERO, NOT_P, ZERO, NOT_P,
P, ONE, P, ONE,
ZERO, NOT_P, ZERO, NOT_P,
P, ONE, P, ONE
};
#undef NOT_P
#undef P
#undef ONE
#undef ZERO
void get_rop_codes(INT rop, struct rop_codes *codes)
{
/* NB The ROP2 codes start at one and the arrays are zero-based */
codes->a1 = rop2_and_array[rop-1][0];
codes->a2 = rop2_and_array[rop-1][1];
codes->x1 = rop2_xor_array[rop-1][0];
codes->x2 = rop2_xor_array[rop-1][1];
}
void calc_and_xor_masks(INT rop, DWORD color, DWORD *and, DWORD *xor)
{
struct rop_codes codes;
get_rop_codes( rop, &codes );
*and = (color & codes.a1) ^ codes.a2;
*xor = (color & codes.x1) ^ codes.x2;
}
static inline RGBQUAD rgbquad_from_colorref(COLORREF c)
{
RGBQUAD ret;
ret.rgbRed = GetRValue(c);
ret.rgbGreen = GetGValue(c);
ret.rgbBlue = GetBValue(c);
ret.rgbReserved = 0;
return ret;
}
static inline BOOL rgbquad_equal(const RGBQUAD *a, const RGBQUAD *b)
{
if(a->rgbRed == b->rgbRed &&
a->rgbGreen == b->rgbGreen &&
a->rgbBlue == b->rgbBlue)
return TRUE;
return FALSE;
}
COLORREF make_rgb_colorref( HDC hdc, dib_info *dib, COLORREF color, BOOL *got_pixel, DWORD *pixel )
{
BYTE type = color >> 24;
WORD index = LOWORD( color );
HPALETTE pal = GetCurrentObject( hdc, OBJ_PAL );
PALETTEENTRY pal_ent;
*pixel = 0;
*got_pixel = FALSE;
switch( type )
{
case 0: break;
case 0x10: /* DIBINDEX */
*got_pixel = TRUE;
*pixel = 0;
color = RGB(0, 0, 0);
if (dib->bit_count <= 8 && index < (1 << dib->bit_count))
{
*pixel = index;
if (index < dib->color_table_size)
color = RGB( dib->color_table[index].rgbRed,
dib->color_table[index].rgbGreen,
dib->color_table[index].rgbBlue );
}
break;
case 2: /* PALETTERGB */
color &= 0xffffff;
break;
case 1: /* PALETTEINDEX */
if (!GetPaletteEntries( pal, index, 1, &pal_ent ))
GetPaletteEntries( pal, 0, 1, &pal_ent );
color = RGB( pal_ent.peRed, pal_ent.peGreen, pal_ent.peBlue );
break;
default:
FIXME("Unhandled color type %08x\n", color);
color &= 0xffffff;
}
return color;
}
/******************************************************************
* get_pixel_color
*
* 1 bit bitmaps map the fg/bg colors as follows:
* If the fg colorref exactly matches one of the color table entries then
* that entry is the fg color and the other is the bg.
* Otherwise the bg color is mapped to the closest entry in the table and
* the fg takes the other one.
*/
DWORD get_pixel_color( dibdrv_physdev *pdev, COLORREF color, BOOL mono_fixup )
{
RGBQUAD fg_quad;
BOOL got_pixel;
DWORD pixel;
COLORREF rgb_ref;
rgb_ref = make_rgb_colorref( pdev->dev.hdc, &pdev->dib, color, &got_pixel, &pixel );
if (got_pixel) return pixel;
if (pdev->dib.bit_count != 1 || !mono_fixup)
return pdev->dib.funcs->colorref_to_pixel( &pdev->dib, rgb_ref );
fg_quad = rgbquad_from_colorref( rgb_ref );
if(rgbquad_equal(&fg_quad, pdev->dib.color_table))
return 0;
if(rgbquad_equal(&fg_quad, pdev->dib.color_table + 1))
return 1;
if(color == GetBkColor(pdev->dev.hdc)) return pdev->bkgnd_color;
else return pdev->bkgnd_color ? 0 : 1;
}
/***************************************************************************
* get_pen_bkgnd_masks
*
* Returns the pre-calculated bkgnd color masks unless the dib is 1 bpp.
* In this case since there are several fg sources (pen, brush, text)
* this makes pdev->bkgnd_color unusable. So here we take the inverse
* of the relevant fg color (which is always set up correctly).
*/
static inline void get_pen_bkgnd_masks(const dibdrv_physdev *pdev, DWORD *and, DWORD *xor)
{
if(pdev->dib.bit_count != 1 || GetBkMode(pdev->dev.hdc) == TRANSPARENT)
{
*and = pdev->bkgnd_and;
*xor = pdev->bkgnd_xor;
}
else
{
DWORD color = ~pdev->pen_color;
if(pdev->pen_colorref == GetBkColor(pdev->dev.hdc)) color = pdev->pen_color;
calc_and_xor_masks( GetROP2(pdev->dev.hdc), color, and, xor );
}
}
static inline void get_brush_bkgnd_masks(const dibdrv_physdev *pdev, DWORD *and, DWORD *xor)
{
if(GetBkMode(pdev->dev.hdc) == TRANSPARENT)
{
*and = pdev->bkgnd_and;
*xor = pdev->bkgnd_xor;
}
else
{
DWORD color = pdev->bkgnd_color;
if(pdev->dib.bit_count == 1)
{
if(pdev->brush_colorref == GetBkColor(pdev->dev.hdc))
color = pdev->brush_color;
else
color = ~pdev->brush_color;
}
calc_and_xor_masks( pdev->brush_rop, color, and, xor );
}
}
static inline void order_end_points(int *s, int *e)
{
if(*s > *e)
{
int tmp;
tmp = *s + 1;
*s = *e + 1;
*e = tmp;
}
}
#define Y_INCREASING_MASK 0x0f
#define X_INCREASING_MASK 0xc3
#define X_MAJOR_MASK 0x99
#define POS_SLOPE_MASK 0x33
static inline BOOL is_xmajor(DWORD octant)
{
return octant & X_MAJOR_MASK;
}
static inline BOOL is_pos_slope(DWORD octant)
{
return octant & POS_SLOPE_MASK;
}
static inline BOOL is_x_increasing(DWORD octant)
{
return octant & X_INCREASING_MASK;
}
static inline BOOL is_y_increasing(DWORD octant)
{
return octant & Y_INCREASING_MASK;
}
/**********************************************************************
* get_octant_number
*
* Return the octant number starting clockwise from the +ve x-axis.
*/
static inline int get_octant_number(int dx, int dy)
{
if(dy > 0)
if(dx > 0)
return ( dx > dy) ? 1 : 2;
else
return (-dx > dy) ? 4 : 3;
else
if(dx < 0)
return (-dx > -dy) ? 5 : 6;
else
return ( dx > -dy) ? 8 : 7;
}
static inline DWORD get_octant_mask(int dx, int dy)
{
return 1 << (get_octant_number(dx, dy) - 1);
}
static inline int get_bias( DWORD mask )
{
/* Octants 3, 5, 6 and 8 take a bias */
return (mask & 0xb4) ? 1 : 0;
}
#define OUT_LEFT 1
#define OUT_RIGHT 2
#define OUT_TOP 4
#define OUT_BOTTOM 8
static inline DWORD calc_outcode(const POINT *pt, const RECT *clip)
{
DWORD out = 0;
if(pt->x < clip->left) out |= OUT_LEFT;
else if(pt->x >= clip->right) out |= OUT_RIGHT;
if(pt->y < clip->top) out |= OUT_TOP;
else if(pt->y >= clip->bottom) out |= OUT_BOTTOM;
return out;
}
/******************************************************************************
* clip_line
*
* Clips the start and end points to a rectangle.
*
* Note, this treats the end point like the start point. If the
* caller doesn't want it displayed, it should exclude it. If the end
* point is clipped out, then the likelihood is that the new end point
* should be displayed.
*
* Returns 0 if totally excluded, 1 if partially clipped and 2 if unclipped.
*
* This derivation is based on the comments in X.org's xserver/mi/mizerclip.c,
* however the Bresenham error term is defined differently so the equations
* will also differ.
*
* For x major lines we have 2dy >= err + bias > 2dy - 2dx
* 0 >= err + bias - 2dy > -2dx
*
* Note dx, dy, m and n are all +ve.
*
* Moving the start pt from x1 to x1 + m, we need to figure out y1 + n.
* err = 2dy - dx + 2mdy - 2ndx
* 0 >= 2dy - dx + 2mdy - 2ndx + bias - 2dy > -2dx
* 0 >= 2mdy - 2ndx + bias - dx > -2dx
* which of course will give exactly one solution for n,
* so looking at the >= inequality
* n >= (2mdy + bias - dx) / 2dx
* n = ceiling((2mdy + bias - dx) / 2dx)
* = (2mdy + bias + dx - 1) / 2dx (assuming division truncation)
*
* Moving start pt from y1 to y1 + n we need to figure out x1 + m - there may be several
* solutions we pick the one that minimizes m (ie that first unlipped pt). As above:
* 0 >= 2mdy - 2ndx + bias - dx > -2dx
* 2mdy > 2ndx - bias - dx
* m > (2ndx - bias - dx) / 2dy
* m = floor((2ndx - bias - dx) / 2dy) + 1
* m = (2ndx - bias - dx) / 2dy + 1
*
* Moving end pt from x2 to x2 - m, we need to figure out y2 - n
* err = 2dy - dx + 2(dx - m)dy - 2(dy - n)dx
* = 2dy - dx - 2mdy + 2ndx
* 0 >= 2dy - dx - 2mdy + 2ndx + bias - 2dy > -2dx
* 0 >= 2ndx - 2mdy + bias - dx > -2dx
* again exactly one solution.
* 2ndx <= 2mdy - bias + dx
* n = floor((2mdy - bias + dx) / 2dx)
* = (2mdy - bias + dx) / 2dx
*
* Moving end pt from y2 to y2 - n when need x2 - m this time maximizing x2 - m so
* mininizing m to include all of the points at y = y2 - n. As above:
* 0 >= 2ndx - 2mdy + bias - dx > -2dx
* 2mdy >= 2ndx + bias - dx
* m = ceiling((2ndx + bias - dx) / 2dy)
* = (2ndx + bias - dx - 1) / 2dy + 1
*
* For y major lines, symmetry (dx <-> dy and swap the cases over) gives:
*
* Moving start point from y1 to y1 + n find x1 + m
* m = (2ndx + bias + dy - 1) / 2dy
*
* Moving start point from x1 to x1 + m find y1 + n
* n = (2mdy - bias - dy) / 2ndx + 1
*
* Moving end point from y2 to y2 - n find x1 - m
* m = (2ndx - bias + dy) / 2dy
*
* Moving end point from x2 to x2 - m find y2 - n
* n = (2mdy + bias - dy - 1) / 2dx + 1
*/
int clip_line(const POINT *start, const POINT *end, const RECT *clip,
const bres_params *params, POINT *pt1, POINT *pt2)
{
int m, n;
BOOL clipped = FALSE;
DWORD start_oc, end_oc;
const int bias = params->bias;
const unsigned int dx = params->dx;
const unsigned int dy = params->dy;
const unsigned int two_dx = params->dx * 2;
const unsigned int two_dy = params->dy * 2;
const BOOL xmajor = is_xmajor(params->octant);
const BOOL neg_slope = !is_pos_slope(params->octant);
*pt1 = *start;
*pt2 = *end;
start_oc = calc_outcode(start, clip);
end_oc = calc_outcode(end, clip);
while(1)
{
if(start_oc == 0 && end_oc == 0) return clipped ? 1 : 2; /* trivial accept */
if(start_oc & end_oc) return 0; /* trivial reject */
clipped = TRUE;
if(start_oc & OUT_LEFT)
{
m = clip->left - start->x;
if(xmajor)
n = (m * two_dy + bias + dx - 1) / two_dx;
else
n = (m * two_dy - bias - dy) / two_dx + 1;
pt1->x = clip->left;
if(neg_slope) n = -n;
pt1->y = start->y + n;
start_oc = calc_outcode(pt1, clip);
}
else if(start_oc & OUT_RIGHT)
{
m = start->x - clip->right + 1;
if(xmajor)
n = (m * two_dy + bias + dx - 1) / two_dx;
else
n = (m * two_dy - bias - dy) / two_dx + 1;
pt1->x = clip->right - 1;
if(neg_slope) n = -n;
pt1->y = start->y - n;
start_oc = calc_outcode(pt1, clip);
}
else if(start_oc & OUT_TOP)
{
n = clip->top - start->y;
if(xmajor)
m = (n * two_dx - bias - dx) / two_dy + 1;
else
m = (n * two_dx + bias + dy - 1) / two_dy;
pt1->y = clip->top;
if(neg_slope) m = -m;
pt1->x = start->x + m;
start_oc = calc_outcode(pt1, clip);
}
else if(start_oc & OUT_BOTTOM)
{
n = start->y - clip->bottom + 1;
if(xmajor)
m = (n * two_dx - bias - dx) / two_dy + 1;
else
m = (n * two_dx + bias + dy - 1) / two_dy;
pt1->y = clip->bottom - 1;
if(neg_slope) m = -m;
pt1->x = start->x - m;
start_oc = calc_outcode(pt1, clip);
}
else if(end_oc & OUT_LEFT)
{
m = clip->left - end->x;
if(xmajor)
n = (m * two_dy - bias + dx) / two_dx;
else
n = (m * two_dy + bias - dy - 1) / two_dx + 1;
pt2->x = clip->left;
if(neg_slope) n = -n;
pt2->y = end->y + n;
end_oc = calc_outcode(pt2, clip);
}
else if(end_oc & OUT_RIGHT)
{
m = end->x - clip->right + 1;
if(xmajor)
n = (m * two_dy - bias + dx) / two_dx;
else
n = (m * two_dy + bias - dy - 1) / two_dx + 1;
pt2->x = clip->right - 1;
if(neg_slope) n = -n;
pt2->y = end->y - n;
end_oc = calc_outcode(pt2, clip);
}
else if(end_oc & OUT_TOP)
{
n = clip->top - end->y;
if(xmajor)
m = (n * two_dx + bias - dx - 1) / two_dy + 1;
else
m = (n * two_dx - bias + dy) / two_dy;
pt2->y = clip->top;
if(neg_slope) m = -m;
pt2->x = end->x + m;
end_oc = calc_outcode(pt2, clip);
}
else if(end_oc & OUT_BOTTOM)
{
n = end->y - clip->bottom + 1;
if(xmajor)
m = (n * two_dx + bias - dx - 1) / two_dy + 1;
else
m = (n * two_dx - bias + dy) / two_dy;
pt2->y = clip->bottom - 1;
if(neg_slope) m = -m;
pt2->x = end->x - m;
end_oc = calc_outcode(pt2, clip);
}
}
}
static void bres_line_with_bias(const POINT *start, const struct line_params *params,
void (* callback)(dibdrv_physdev*,INT,INT), dibdrv_physdev *pdev)
{
POINT pt = *start;
int len = params->length, err = params->err_start;
if (params->x_major)
{
while(len--)
{
callback(pdev, pt.x, pt.y);
if (err + params->bias > 0)
{
pt.y += params->y_inc;
err += params->err_add_1;
}
else err += params->err_add_2;
pt.x += params->x_inc;
}
}
else
{
while(len--)
{
callback(pdev, pt.x, pt.y);
if (err + params->bias > 0)
{
pt.x += params->x_inc;
err += params->err_add_1;
}
else err += params->err_add_2;
pt.y += params->y_inc;
}
}
}
static BOOL solid_pen_line(dibdrv_physdev *pdev, POINT *start, POINT *end)
{
const WINEREGION *clip = get_wine_region(pdev->clip);
if(start->y == end->y)
{
RECT rect;
int i;
rect.left = start->x;
rect.top = start->y;
rect.right = end->x;
rect.bottom = end->y + 1;
order_end_points(&rect.left, &rect.right);
for(i = 0; i < clip->numRects; i++)
{
if(clip->rects[i].top >= rect.bottom) break;
if(clip->rects[i].bottom <= rect.top) continue;
/* Optimize the unclipped case */
if(clip->rects[i].left <= rect.left && clip->rects[i].right >= rect.right)
{
pdev->dib.funcs->solid_rects(&pdev->dib, 1, &rect, pdev->pen_and, pdev->pen_xor);
break;
}
if(clip->rects[i].right > rect.left && clip->rects[i].left < rect.right)
{
RECT tmp = rect;
tmp.left = max(rect.left, clip->rects[i].left);
tmp.right = min(rect.right, clip->rects[i].right);
pdev->dib.funcs->solid_rects(&pdev->dib, 1, &tmp, pdev->pen_and, pdev->pen_xor);
}
}
}
else if(start->x == end->x)
{
RECT rect;
int i;
rect.left = start->x;
rect.top = start->y;
rect.right = end->x + 1;
rect.bottom = end->y;
order_end_points(&rect.top, &rect.bottom);
for(i = 0; i < clip->numRects; i++)
{
/* Optimize unclipped case */
if(clip->rects[i].top <= rect.top && clip->rects[i].bottom >= rect.bottom &&
clip->rects[i].left <= rect.left && clip->rects[i].right >= rect.right)
{
pdev->dib.funcs->solid_rects(&pdev->dib, 1, &rect, pdev->pen_and, pdev->pen_xor);
break;
}
if(clip->rects[i].top >= rect.bottom) break;
if(clip->rects[i].bottom <= rect.top) continue;
if(clip->rects[i].right > rect.left && clip->rects[i].left < rect.right)
{
RECT tmp = rect;
tmp.top = max(rect.top, clip->rects[i].top);
tmp.bottom = min(rect.bottom, clip->rects[i].bottom);
pdev->dib.funcs->solid_rects(&pdev->dib, 1, &tmp, pdev->pen_and, pdev->pen_xor);
}
}
}
else
{
bres_params clip_params;
struct line_params line_params;
INT dx = end->x - start->x, dy = end->y - start->y;
INT abs_dx = abs(dx), abs_dy = abs(dy);
INT i;
clip_params.dx = abs_dx;
clip_params.dy = abs_dy;
clip_params.octant = get_octant_mask(dx, dy);
clip_params.bias = get_bias( clip_params.octant );
line_params.bias = clip_params.bias;
line_params.x_major = is_xmajor( clip_params.octant );
line_params.x_inc = is_x_increasing( clip_params.octant ) ? 1 : -1;
line_params.y_inc = is_y_increasing( clip_params.octant ) ? 1 : -1;
if (line_params.x_major)
{
line_params.err_add_1 = 2 * abs_dy - 2 * abs_dx;
line_params.err_add_2 = 2 * abs_dy;
}
else
{
line_params.err_add_1 = 2 * abs_dx - 2 * abs_dy;
line_params.err_add_2 = 2 * abs_dx;
}
for(i = 0; i < clip->numRects; i++)
{
POINT clipped_start, clipped_end;
int clip_status;
clip_status = clip_line(start, end, clip->rects + i, &clip_params, &clipped_start, &clipped_end);
if(clip_status)
{
int m = abs(clipped_start.x - start->x);
int n = abs(clipped_start.y - start->y);
if (line_params.x_major)
{
line_params.err_start = 2 * abs_dy - abs_dx + m * 2 * abs_dy - n * 2 * abs_dx;
line_params.length = abs( clipped_end.x - clipped_start.x ) + 1;
}
else
{
line_params.err_start = 2 * abs_dx - abs_dy + n * 2 * abs_dx - m * 2 * abs_dy;
line_params.length = abs( clipped_end.y - clipped_start.y ) + 1;
}
if (clipped_end.x == end->x && clipped_end.y == end->y) line_params.length--;
pdev->dib.funcs->solid_line( &pdev->dib, &clipped_start, &line_params,
pdev->pen_and, pdev->pen_xor );
if(clip_status == 2) break; /* completely unclipped, so we can finish */
}
}
}
release_wine_region(pdev->clip);
return TRUE;
}
static BOOL solid_pen_lines(dibdrv_physdev *pdev, int num, POINT *pts, BOOL close)
{
int i;
assert( num >= 2 );
for (i = 0; i < num - 1; i++)
if (!solid_pen_line( pdev, pts + i, pts + i + 1 ))
return FALSE;
if (close) return solid_pen_line( pdev, pts + num - 1, pts );
return TRUE;
}
void reset_dash_origin(dibdrv_physdev *pdev)
{
pdev->dash_pos.cur_dash = 0;
pdev->dash_pos.left_in_dash = pdev->pen_pattern.dashes[0];
pdev->dash_pos.mark = TRUE;
}
static inline void skip_dash(dibdrv_physdev *pdev, unsigned int skip)
{
skip %= pdev->pen_pattern.total_len;
while(skip)
{
if(pdev->dash_pos.left_in_dash > skip)
{
pdev->dash_pos.left_in_dash -= skip;
return;
}
skip -= pdev->dash_pos.left_in_dash;
pdev->dash_pos.cur_dash++;
if(pdev->dash_pos.cur_dash == pdev->pen_pattern.count) pdev->dash_pos.cur_dash = 0;
pdev->dash_pos.left_in_dash = pdev->pen_pattern.dashes[pdev->dash_pos.cur_dash];
pdev->dash_pos.mark = !pdev->dash_pos.mark;
}
}
static inline void get_dash_colors(const dibdrv_physdev *pdev, DWORD *and, DWORD *xor)
{
if(pdev->dash_pos.mark)
{
*and = pdev->pen_and;
*xor = pdev->pen_xor;
}
else /* space */
{
get_pen_bkgnd_masks( pdev, and, xor );
}
}
static void dashed_pen_line_callback(dibdrv_physdev *pdev, INT x, INT y)
{
RECT rect;
DWORD and, xor;
get_dash_colors(pdev, &and, &xor);
skip_dash(pdev, 1);
rect.left = x;
rect.right = x + 1;
rect.top = y;
rect.bottom = y + 1;
pdev->dib.funcs->solid_rects(&pdev->dib, 1, &rect, and, xor);
return;
}
static BOOL dashed_pen_line(dibdrv_physdev *pdev, POINT *start, POINT *end)
{
const WINEREGION *clip = get_wine_region(pdev->clip);
DWORD and, xor;
int i, dash_len;
RECT rect;
const dash_pos start_pos = pdev->dash_pos;
if(start->y == end->y) /* hline */
{
BOOL l_to_r;
INT left, right, cur_x;
rect.top = start->y;
rect.bottom = start->y + 1;
if(start->x <= end->x)
{
left = start->x;
right = end->x - 1;
l_to_r = TRUE;
}
else
{
left = end->x + 1;
right = start->x;
l_to_r = FALSE;
}
for(i = 0; i < clip->numRects; i++)
{
if(clip->rects[i].top > start->y) break;
if(clip->rects[i].bottom <= start->y) continue;
if(clip->rects[i].right > left && clip->rects[i].left <= right)
{
int clipped_left = max(clip->rects[i].left, left);
int clipped_right = min(clip->rects[i].right - 1, right);
pdev->dash_pos = start_pos;
if(l_to_r)
{
cur_x = clipped_left;
if(cur_x != left)
skip_dash(pdev, clipped_left - left);
while(cur_x <= clipped_right)
{
get_dash_colors(pdev, &and, &xor);
dash_len = pdev->dash_pos.left_in_dash;
if(cur_x + dash_len > clipped_right + 1)
dash_len = clipped_right - cur_x + 1;
rect.left = cur_x;
rect.right = cur_x + dash_len;
pdev->dib.funcs->solid_rects(&pdev->dib, 1, &rect, and, xor);
cur_x += dash_len;
skip_dash(pdev, dash_len);
}
}
else
{
cur_x = clipped_right;
if(cur_x != right)
skip_dash(pdev, right - clipped_right);
while(cur_x >= clipped_left)
{
get_dash_colors(pdev, &and, &xor);
dash_len = pdev->dash_pos.left_in_dash;
if(cur_x - dash_len < clipped_left - 1)
dash_len = cur_x - clipped_left + 1;
rect.left = cur_x - dash_len + 1;
rect.right = cur_x + 1;
pdev->dib.funcs->solid_rects(&pdev->dib, 1, &rect, and, xor);
cur_x -= dash_len;
skip_dash(pdev, dash_len);
}
}
}
}
pdev->dash_pos = start_pos;
skip_dash(pdev, right - left + 1);
}
else if(start->x == end->x) /* vline */
{
BOOL t_to_b;
INT top, bottom, cur_y;
rect.left = start->x;
rect.right = start->x + 1;
if(start->y <= end->y)
{
top = start->y;
bottom = end->y - 1;
t_to_b = TRUE;
}
else
{
top = end->y + 1;
bottom = start->y;
t_to_b = FALSE;
}
for(i = 0; i < clip->numRects; i++)
{
if(clip->rects[i].top > bottom) break;
if(clip->rects[i].bottom <= top) continue;
if(clip->rects[i].right > start->x && clip->rects[i].left <= start->x)
{
int clipped_top = max(clip->rects[i].top, top);
int clipped_bottom = min(clip->rects[i].bottom - 1, bottom);
pdev->dash_pos = start_pos;
if(t_to_b)
{
cur_y = clipped_top;
if(cur_y != top)
skip_dash(pdev, clipped_top - top);
while(cur_y <= clipped_bottom)
{
get_dash_colors(pdev, &and, &xor);
dash_len = pdev->dash_pos.left_in_dash;
if(cur_y + dash_len > clipped_bottom + 1)
dash_len = clipped_bottom - cur_y + 1;
rect.top = cur_y;
rect.bottom = cur_y + dash_len;
pdev->dib.funcs->solid_rects(&pdev->dib, 1, &rect, and, xor);
cur_y += dash_len;
skip_dash(pdev, dash_len);
}
}
else
{
cur_y = clipped_bottom;
if(cur_y != bottom)
skip_dash(pdev, bottom - clipped_bottom);
while(cur_y >= clipped_top)
{
get_dash_colors(pdev, &and, &xor);
dash_len = pdev->dash_pos.left_in_dash;
if(cur_y - dash_len < clipped_top - 1)
dash_len = cur_y - clipped_top + 1;
rect.top = cur_y - dash_len + 1;
rect.bottom = cur_y + 1;
pdev->dib.funcs->solid_rects(&pdev->dib, 1, &rect, and, xor);
cur_y -= dash_len;
skip_dash(pdev, dash_len);
}
}
}
}
pdev->dash_pos = start_pos;
skip_dash(pdev, bottom - top + 1);
}
else
{
bres_params clip_params;
struct line_params line_params;
INT dx = end->x - start->x, dy = end->y - start->y;
INT abs_dx = abs(dx), abs_dy = abs(dy);
INT i;
clip_params.dx = abs_dx;
clip_params.dy = abs_dy;
clip_params.octant = get_octant_mask(dx, dy);
clip_params.bias = get_bias( clip_params.octant );
line_params.bias = clip_params.bias;
line_params.x_major = is_xmajor( clip_params.octant );
line_params.x_inc = is_x_increasing( clip_params.octant ) ? 1 : -1;
line_params.y_inc = is_y_increasing( clip_params.octant ) ? 1 : -1;
if (line_params.x_major)
{
line_params.err_add_1 = 2 * abs_dy - 2 * abs_dx;
line_params.err_add_2 = 2 * abs_dy;
}
else
{
line_params.err_add_1 = 2 * abs_dx - 2 * abs_dy;
line_params.err_add_2 = 2 * abs_dx;
}
for(i = 0; i < clip->numRects; i++)
{
POINT clipped_start, clipped_end;
int clip_status;
clip_status = clip_line(start, end, clip->rects + i, &clip_params, &clipped_start, &clipped_end);
if(clip_status)
{
int m = abs(clipped_start.x - start->x);
int n = abs(clipped_start.y - start->y);
pdev->dash_pos = start_pos;
if (line_params.x_major)
{
line_params.err_start = 2 * abs_dy - abs_dx + m * 2 * abs_dy - n * 2 * abs_dx;
line_params.length = abs( clipped_end.x - clipped_start.x ) + 1;
skip_dash(pdev, m);
}
else
{
line_params.err_start = 2 * abs_dx - abs_dy + n * 2 * abs_dx - m * 2 * abs_dy;
line_params.length = abs( clipped_end.y - clipped_start.y ) + 1;
skip_dash(pdev, n);
}
if (clipped_end.x == end->x && clipped_end.y == end->y) line_params.length--;
bres_line_with_bias( &clipped_start, &line_params, dashed_pen_line_callback, pdev );
if(clip_status == 2) break; /* completely unclipped, so we can finish */
}
}
pdev->dash_pos = start_pos;
if(line_params.x_major)
skip_dash(pdev, abs_dx);
else
skip_dash(pdev, abs_dy);
}
release_wine_region(pdev->clip);
return TRUE;
}
static BOOL dashed_pen_lines(dibdrv_physdev *pdev, int num, POINT *pts, BOOL close)
{
int i;
assert( num >= 2 );
for (i = 0; i < num - 1; i++)
if (!dashed_pen_line( pdev, pts + i, pts + i + 1 ))
return FALSE;
if (close) return dashed_pen_line( pdev, pts + num - 1, pts );
return TRUE;
}
static BOOL null_pen_lines(dibdrv_physdev *pdev, int num, POINT *pts, BOOL close)
{
return TRUE;
}
static const dash_pattern dash_patterns[5] =
{
{0, {0}, 0}, /* PS_SOLID - a pseudo-pattern used to initialise unpatterned pens. */
{2, {18, 6}, 24}, /* PS_DASH */
{2, {3, 3}, 6}, /* PS_DOT */
{4, {9, 6, 3, 6}, 24}, /* PS_DASHDOT */
{6, {9, 3, 3, 3, 3, 3}, 24} /* PS_DASHDOTDOT */
};
/***********************************************************************
* dibdrv_SelectPen
*/
HPEN dibdrv_SelectPen( PHYSDEV dev, HPEN hpen )
{
PHYSDEV next = GET_NEXT_PHYSDEV( dev, pSelectPen );
dibdrv_physdev *pdev = get_dibdrv_pdev(dev);
LOGPEN logpen;
DWORD style;
TRACE("(%p, %p)\n", dev, hpen);
if (!GetObjectW( hpen, sizeof(logpen), &logpen ))
{
/* must be an extended pen */
EXTLOGPEN *elp;
INT size = GetObjectW( hpen, 0, NULL );
if (!size) return 0;
elp = HeapAlloc( GetProcessHeap(), 0, size );
GetObjectW( hpen, size, elp );
/* FIXME: add support for user style pens */
logpen.lopnStyle = elp->elpPenStyle;
logpen.lopnWidth.x = elp->elpWidth;
logpen.lopnWidth.y = 0;
logpen.lopnColor = elp->elpColor;
HeapFree( GetProcessHeap(), 0, elp );
}
if (hpen == GetStockObject( DC_PEN ))
logpen.lopnColor = GetDCPenColor( dev->hdc );
pdev->pen_colorref = logpen.lopnColor;
pdev->pen_color = get_pixel_color( pdev, pdev->pen_colorref, TRUE );
calc_and_xor_masks(GetROP2(dev->hdc), pdev->pen_color, &pdev->pen_and, &pdev->pen_xor);
pdev->pen_pattern = dash_patterns[PS_SOLID];
pdev->defer |= DEFER_PEN;
style = logpen.lopnStyle & PS_STYLE_MASK;
switch(style)
{
case PS_SOLID:
if(logpen.lopnStyle & PS_GEOMETRIC) break;
if(logpen.lopnWidth.x > 1) break;
pdev->pen_lines = solid_pen_lines;
pdev->defer &= ~DEFER_PEN;
break;
case PS_DASH:
case PS_DOT:
case PS_DASHDOT:
case PS_DASHDOTDOT:
if(logpen.lopnStyle & PS_GEOMETRIC) break;
if(logpen.lopnWidth.x > 1) break;
pdev->pen_lines = dashed_pen_lines;
pdev->pen_pattern = dash_patterns[style];
pdev->defer &= ~DEFER_PEN;
break;
case PS_NULL:
pdev->pen_lines = null_pen_lines;
pdev->defer &= ~DEFER_PEN;
break;
default:
break;
}
return next->funcs->pSelectPen( next, hpen );
}
/***********************************************************************
* dibdrv_SetDCPenColor
*/
COLORREF dibdrv_SetDCPenColor( PHYSDEV dev, COLORREF color )
{
PHYSDEV next = GET_NEXT_PHYSDEV( dev, pSetDCPenColor );
dibdrv_physdev *pdev = get_dibdrv_pdev(dev);
if (GetCurrentObject(dev->hdc, OBJ_PEN) == GetStockObject( DC_PEN ))
{
pdev->pen_colorref = color;
pdev->pen_color = get_pixel_color( pdev, pdev->pen_colorref, TRUE );
calc_and_xor_masks(GetROP2(dev->hdc), pdev->pen_color, &pdev->pen_and, &pdev->pen_xor);
}
return next->funcs->pSetDCPenColor( next, color );
}
void solid_rects( dib_info *dib, int num, const RECT *rects, const rop_mask *color, HRGN region )
{
int i, j;
const WINEREGION *clip;
if (!region)
{
dib->funcs->solid_rects( dib, num, rects, color->and, color->xor );
return;
}
clip = get_wine_region( region );
for(i = 0; i < num; i++)
{
for(j = 0; j < clip->numRects; j++)
{
RECT clipped_rect;
if (intersect_rect( &clipped_rect, rects + i, clip->rects + j ))
dib->funcs->solid_rects( dib, 1, &clipped_rect, color->and, color->xor );
}
}
release_wine_region( region );
}
/**********************************************************************
* solid_brush
*
* Fill a number of rectangles with the solid brush
*/
static BOOL solid_brush(dibdrv_physdev *pdev, dib_info *dib, int num, const RECT *rects, HRGN region)
{
rop_mask brush_color;
brush_color.and = pdev->brush_and;
brush_color.xor = pdev->brush_xor;
solid_rects( dib, num, rects, &brush_color, region );
return TRUE;
}
static void free_pattern_brush_bits( dibdrv_physdev *pdev )
{
HeapFree(GetProcessHeap(), 0, pdev->brush_and_bits);
HeapFree(GetProcessHeap(), 0, pdev->brush_xor_bits);
pdev->brush_and_bits = NULL;
pdev->brush_xor_bits = NULL;
}
void free_pattern_brush( dibdrv_physdev *pdev )
{
free_pattern_brush_bits( pdev );
free_dib_info( &pdev->brush_dib );
}
static BOOL create_pattern_brush_bits(dibdrv_physdev *pdev)
{
DWORD size = pdev->brush_dib.height * abs(pdev->brush_dib.stride);
DWORD *brush_bits = pdev->brush_dib.bits.ptr;
DWORD *and_bits, *xor_bits;
assert(pdev->brush_and_bits == NULL);
assert(pdev->brush_xor_bits == NULL);
assert(pdev->brush_dib.stride > 0);
and_bits = pdev->brush_and_bits = HeapAlloc(GetProcessHeap(), 0, size);
xor_bits = pdev->brush_xor_bits = HeapAlloc(GetProcessHeap(), 0, size);
if(!and_bits || !xor_bits)
{
ERR("Failed to create pattern brush bits\n");
free_pattern_brush_bits( pdev );
return FALSE;
}
while(size)
{
calc_and_xor_masks(pdev->brush_rop, *brush_bits++, and_bits++, xor_bits++);
size -= 4;
}
return TRUE;
}
static const DWORD hatches[6][8] =
{
{ 0x00, 0x00, 0x00, 0xff, 0x00, 0x00, 0x00, 0x00 }, /* HS_HORIZONTAL */
{ 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08 }, /* HS_VERTICAL */
{ 0x80, 0x40, 0x20, 0x10, 0x08, 0x04, 0x02, 0x01 }, /* HS_FDIAGONAL */
{ 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80 }, /* HS_BDIAGONAL */
{ 0x08, 0x08, 0x08, 0xff, 0x08, 0x08, 0x08, 0x08 }, /* HS_CROSS */
{ 0x81, 0x42, 0x24, 0x18, 0x18, 0x24, 0x42, 0x81 } /* HS_DIAGCROSS */
};
static BOOL create_hatch_brush_bits(dibdrv_physdev *pdev)
{
dib_info hatch;
rop_mask fg_mask, bg_mask;
rop_mask_bits mask_bits;
DWORD size;
BOOL ret;
assert(pdev->brush_and_bits == NULL);
assert(pdev->brush_xor_bits == NULL);
/* Just initialise brush_dib with the color / sizing info. We don't
need the bits as we'll calculate the rop masks straight from
the hatch patterns. */
copy_dib_color_info(&pdev->brush_dib, &pdev->dib);
pdev->brush_dib.width = 8;
pdev->brush_dib.height = 8;
pdev->brush_dib.stride = get_dib_stride( pdev->brush_dib.width, pdev->brush_dib.bit_count );
size = pdev->brush_dib.height * pdev->brush_dib.stride;
mask_bits.and = pdev->brush_and_bits = HeapAlloc(GetProcessHeap(), 0, size);
mask_bits.xor = pdev->brush_xor_bits = HeapAlloc(GetProcessHeap(), 0, size);
if(!mask_bits.and || !mask_bits.xor)
{
ERR("Failed to create pattern brush bits\n");
free_pattern_brush_bits( pdev );
return FALSE;
}
hatch.bit_count = 1;
hatch.height = hatch.width = 8;
hatch.stride = 4;
hatch.bits.ptr = (void *) hatches[pdev->brush_hatch];
hatch.bits.free = hatch.bits.param = NULL;
hatch.bits.is_copy = FALSE;
fg_mask.and = pdev->brush_and;
fg_mask.xor = pdev->brush_xor;
get_brush_bkgnd_masks( pdev, &bg_mask.and, &bg_mask.xor );
ret = pdev->brush_dib.funcs->create_rop_masks( &pdev->brush_dib, &hatch, &fg_mask, &bg_mask, &mask_bits );
if(!ret) free_pattern_brush_bits( pdev );
return ret;
}
static BOOL matching_pattern_format( dib_info *dib, dib_info *pattern )
{
if (dib->bit_count != pattern->bit_count) return FALSE;
if (dib->stride != pattern->stride) return FALSE;
switch (dib->bit_count)
{
case 1:
case 4:
case 8:
if (dib->color_table_size != pattern->color_table_size) return FALSE;
return !memcmp( dib->color_table, pattern->color_table, dib->color_table_size * sizeof(RGBQUAD) );
case 16:
case 32:
return (dib->red_mask == pattern->red_mask &&
dib->green_mask == pattern->green_mask &&
dib->blue_mask == pattern->blue_mask);
}
return TRUE;
}
static void select_pattern_brush( dibdrv_physdev *pdev, dib_info *pattern )
{
RECT rect;
free_pattern_brush( pdev );
copy_dib_color_info(&pdev->brush_dib, &pdev->dib);
pdev->brush_dib.height = pattern->height;
pdev->brush_dib.width = pattern->width;
pdev->brush_dib.stride = get_dib_stride( pdev->brush_dib.width, pdev->brush_dib.bit_count );
if (matching_pattern_format( &pdev->brush_dib, pattern ))
{
pdev->brush_dib.bits.ptr = pattern->bits.ptr;
pdev->brush_dib.bits.is_copy = FALSE;
pdev->brush_dib.bits.free = NULL;
return;
}
pdev->brush_dib.bits.ptr = HeapAlloc( GetProcessHeap(), 0,
pdev->brush_dib.height * pdev->brush_dib.stride );
pdev->brush_dib.bits.is_copy = TRUE;
pdev->brush_dib.bits.free = free_heap_bits;
rect.left = rect.top = 0;
rect.right = pattern->width;
rect.bottom = pattern->height;
pdev->brush_dib.funcs->convert_to(&pdev->brush_dib, pattern, &rect);
}
/**********************************************************************
* pattern_brush
*
* Fill a number of rectangles with the pattern brush
* FIXME: Should we insist l < r && t < b? Currently we assume this.
*/
static BOOL pattern_brush(dibdrv_physdev *pdev, dib_info *dib, int num, const RECT *rects, HRGN region)
{
int i, j;
const WINEREGION *clip;
POINT origin;
if(pdev->brush_and_bits == NULL)
{
switch(pdev->brush_style)
{
case BS_DIBPATTERN:
if (pdev->brush_pattern_usage == DIB_PAL_COLORS)
{
dib_info pattern;
HPALETTE pal = GetCurrentObject( pdev->dev.hdc, OBJ_PAL );
if (!init_dib_info_from_brush( &pattern, pdev->brush_pattern_info,
pdev->brush_pattern_bits, DIB_PAL_COLORS, pal ))
return FALSE;
select_pattern_brush( pdev, &pattern );
free_dib_info( &pattern );
}
if(!create_pattern_brush_bits(pdev))
return FALSE;
break;
case BS_HATCHED:
if(!create_hatch_brush_bits(pdev))
return FALSE;
break;
default:
ERR("Unexpected brush style %d\n", pdev->brush_style);
return FALSE;
}
}
GetBrushOrgEx(pdev->dev.hdc, &origin);
clip = get_wine_region( region );
if (!clip)
{
dib->funcs->pattern_rects( dib, num, rects, &origin, &pdev->brush_dib, pdev->brush_and_bits, pdev->brush_xor_bits );
return TRUE;
}
for(i = 0; i < num; i++)
{
for(j = 0; j < clip->numRects; j++)
{
RECT rect = rects[i];
/* Optimize unclipped case */
if(clip->rects[j].top <= rect.top && clip->rects[j].bottom >= rect.bottom &&
clip->rects[j].left <= rect.left && clip->rects[j].right >= rect.right)
{
dib->funcs->pattern_rects( dib, 1, &rect, &origin, &pdev->brush_dib, pdev->brush_and_bits, pdev->brush_xor_bits );
break;
}
if(clip->rects[j].top >= rect.bottom) break;
if(clip->rects[j].bottom <= rect.top) continue;
if(clip->rects[j].right > rect.left && clip->rects[j].left < rect.right)
{
rect.left = max(rect.left, clip->rects[j].left);
rect.top = max(rect.top, clip->rects[j].top);
rect.right = min(rect.right, clip->rects[j].right);
rect.bottom = min(rect.bottom, clip->rects[j].bottom);
dib->funcs->pattern_rects( dib, 1, &rect, &origin, &pdev->brush_dib, pdev->brush_and_bits, pdev->brush_xor_bits );
}
}
}
release_wine_region( region );
/* we need to recompute the bits each time for DIB_PAL_COLORS */
if (pdev->brush_style == BS_DIBPATTERN && pdev->brush_pattern_usage == DIB_PAL_COLORS)
free_pattern_brush_bits( pdev );
return TRUE;
}
static BOOL null_brush(dibdrv_physdev *pdev, dib_info *dib, int num, const RECT *rects, HRGN region)
{
return TRUE;
}
void update_brush_rop( dibdrv_physdev *pdev, INT rop )
{
pdev->brush_rop = rop;
if(pdev->brush_style == BS_SOLID || pdev->brush_style == BS_HATCHED)
calc_and_xor_masks(rop, pdev->brush_color, &pdev->brush_and, &pdev->brush_xor);
free_pattern_brush_bits( pdev );
}
/***********************************************************************
* dibdrv_SelectBrush
*/
HBRUSH dibdrv_SelectBrush( PHYSDEV dev, HBRUSH hbrush, HBITMAP bitmap,
const BITMAPINFO *info, void *bits, UINT usage )
{
PHYSDEV next = GET_NEXT_PHYSDEV( dev, pSelectBrush );
dibdrv_physdev *pdev = get_dibdrv_pdev(dev);
LOGBRUSH logbrush;
TRACE("(%p, %p)\n", dev, hbrush);
if (bitmap || info) /* pattern brush */
{
dib_info pattern;
BOOL ret;
if (!info)
{
BITMAPOBJ *bmp = GDI_GetObjPtr( bitmap, OBJ_BITMAP );
if (!bmp) return 0;
ret = init_dib_info_from_bitmapobj( &pattern, bmp, 0 );
GDI_ReleaseObj( bitmap );
if (!ret) return 0;
select_pattern_brush( pdev, &pattern );
free_dib_info( &pattern );
}
else if (usage != DIB_PAL_COLORS)
{
if (!init_dib_info_from_brush( &pattern, info, bits, DIB_RGB_COLORS, 0 )) return 0;
select_pattern_brush( pdev, &pattern );
free_dib_info( &pattern );
}
else
{
/* brush is actually selected only when it's used */
free_pattern_brush( pdev );
}
pdev->brush_rects = pattern_brush;
pdev->brush_style = BS_DIBPATTERN;
pdev->brush_pattern_info = info;
pdev->brush_pattern_bits = bits;
pdev->brush_pattern_usage = usage;
pdev->defer &= ~DEFER_BRUSH;
return next->funcs->pSelectBrush( next, hbrush, bitmap, info, bits, usage );
}
if (!GetObjectW( hbrush, sizeof(logbrush), &logbrush )) return 0;
if (hbrush == GetStockObject( DC_BRUSH ))
logbrush.lbColor = GetDCBrushColor( dev->hdc );
pdev->brush_style = logbrush.lbStyle;
pdev->defer |= DEFER_BRUSH;
free_pattern_brush( pdev );
switch(logbrush.lbStyle)
{
case BS_SOLID:
pdev->brush_colorref = logbrush.lbColor;
pdev->brush_color = get_pixel_color( pdev, pdev->brush_colorref, TRUE );
calc_and_xor_masks(GetROP2(dev->hdc), pdev->brush_color, &pdev->brush_and, &pdev->brush_xor);
pdev->brush_rects = solid_brush;
pdev->defer &= ~DEFER_BRUSH;
break;
case BS_NULL:
pdev->brush_rects = null_brush;
pdev->defer &= ~DEFER_BRUSH;
break;
case BS_HATCHED:
if(logbrush.lbHatch > HS_DIAGCROSS) return 0;
pdev->brush_hatch = logbrush.lbHatch;
pdev->brush_colorref = logbrush.lbColor;
pdev->brush_color = get_pixel_color( pdev, pdev->brush_colorref, TRUE );
calc_and_xor_masks(GetROP2(dev->hdc), pdev->brush_color, &pdev->brush_and, &pdev->brush_xor);
pdev->brush_rects = pattern_brush;
pdev->defer &= ~DEFER_BRUSH;
break;
default:
return 0;
}
return next->funcs->pSelectBrush( next, hbrush, bitmap, info, bits, usage );
}
/***********************************************************************
* dibdrv_SetDCBrushColor
*/
COLORREF dibdrv_SetDCBrushColor( PHYSDEV dev, COLORREF color )
{
PHYSDEV next = GET_NEXT_PHYSDEV( dev, pSetDCBrushColor );
dibdrv_physdev *pdev = get_dibdrv_pdev(dev);
if (GetCurrentObject(dev->hdc, OBJ_BRUSH) == GetStockObject( DC_BRUSH ))
{
pdev->brush_colorref = color;
pdev->brush_color = get_pixel_color( pdev, pdev->brush_colorref, TRUE );
calc_and_xor_masks(GetROP2(dev->hdc), pdev->brush_color, &pdev->brush_and, &pdev->brush_xor);
}
return next->funcs->pSetDCBrushColor( next, color );
}
BOOL brush_rects(dibdrv_physdev *pdev, int num, const RECT *rects)
{
return pdev->brush_rects( pdev, &pdev->dib, num, rects, pdev->clip );
}
Reference in New Issue View Git Blame Copy Permalink