mirror of
git://source.winehq.org/git/wine.git
synced 2024-09-05 23:20:43 +00:00
![Alexandre Julliard](/assets/img/avatar_default.png)
Fri Sep 11 13:14:35 1998 Andreas Mohr <100.30936@germany.net> * [files/file.c] [include/file.h] Fixed SetFilePointer to allow negative positions as in DOS. * [graphics/ddraw.c] Added some methods to IDirect3D. * [ole/compobj.c] [if1632/compobj.spec] Added/implemented CoCreateStandardMalloc16, CoGetClassObject, CoCreateInstance, LookupETask, SetETask, CoGetState16. * [loader/task.c] MakeProcInstance: return 0 if func == NULL. * [*/*] [tools/winapi-check] Added zillions of missing WINAPI's and __cdecl's. (oops, several caused by myself) Wrote script for automated checking. * [if1632/compobj.spec] Many stub names. * [misc/ddeml.c] [ole/compobj.c] Some stubs. Tue Sep 9 21:36:48 1998 Anders Carlsson <anders.carlsson@linux.nu> * [dlls/comctl32/Makefile.in] [dlls/comctl32/commctrl.c] [dlls/comctl32/tab.c] [include/commctrl.h] [include/tab.h] Added preliminary tab control support. Sat Sep 5 16:27:20 1998 Huw D M Davies <daviesh@abacus.physics.ox.ac.uk> * [graphics/psdrv/*] More changes to the PostScript driver: Implemented pens and solid brushes. Colour/greyscale for fonts, pens and brushes. To get coloured output you need to have *ColorDevice set to true in your PPD, otherwise you'll get greyscale. Landscape mode now works, as does non-A4 page sizes. Encoding of fonts to ANSI is better, Symbol works again. * [objects/dc.c] [include/gdi.h] [*/*] Moved dc->w.{text,background}Pixel to X11DRV_PDEVICE where they belong. Sat Sep 5 05:12:09 1998 Ove Kaaven <ovek@arcticnet.no> * [include/dosexe.h] [include/miscemu.h] [include/msdos.h] [loader/dos/dosvm.c] [loader/dos/module.c] [msdos/dpmi.c] [msdos/int2f.c] [msdos/interrupts.c] Fixed portability. Adapted some code to make it easier to integrate the DOS subsystem with the DPMI subsystem, made the DPMI simulated real-mode interrupts be handled the V86 way. Added support for .COM files. Made int2f DPMI check fail, to avoid pkunzip crashing in attempting to use DPMI. Generally moved stuff around a little. It is now technically possible to load several DOS programs into the same memory space. Not tested, though. Fri Sep 4 21:40:45 1998 Marcus Meissner <marcus@jet.franken.de> * [if1632/kernel.spec] Changed 500-53x stubnames accordingly to nt3.51 krnl386.exe. * [win32/except.c] Fixed one bad program behaviour, (deleting SEH while in first walk). RtlUnwind is broken too I think (it should unwind on success, not while walking the exception chain). * [ole/ole2nls.c] Get*DefaultLCID returns 0x400|id. expected by one application. * [if1632/snoop.c] Handle non-standard SP returns more graceful. * [windows/class.c] hinstances are mostly irrelevant for win32. * [memory/string.c] [misc/registry.c] lstrcmpi32W: use toupper for characters < 0x100. (speedup hack for registry.c) Some small speedup hacks for registry.c Thu Sep 3 20:40:16 1998 Eric Kohl <ekohl@abo.rhein-zeitung.de> * [Makefile.in][configure][configure.in][dlls/Makefile.in] [dlls/comctl32/Makefile.in] Created dlls/comctl32 and moved the common controls stuff to it. * [misc/version.c] Removed COMCTL32_DllGetVersion. The fixed function is part of the common controls stuff. * [dlls/comctl32/*.c][include/commctrl.h] Added structure size tests. * [dlls/comctl32/toolbar.c] Fixed a bug in TOOLBAR_GetMaxWidth(). * [dlls/comctl32/animate.c][include/animate.h] [dlls/comctl32/comboex.c][include/comboex.h] [dlls/comctl32/hotkey.c][include/hotkey.h] [dlls/comctl32/listview.c][include/listview.h] [dlls/comctl32/commctrl.c][include/commctrl.h] New files. Added Animation, ComboBoxEx, Hotkey and Listview control dummies. * [dlls/comctl32/tooltips.c] Fixed a display bug and font selection. * [dlls/comctl32/comctl32undoc.c][include/commctrl.h] Added missing DPA functions. Fixed bugs and published the function prototypes. * [documentation/common_controls] Updated. Wed Sep 2 15:43:45 1998 Patrik Stridvall <ps@leissner.se> * [AUTHORS] [include/authors.h] Added myself as a Wine author. * [memory/virtual.c] [objects/dc.c] Fixed runtime errors for Solaris. * [misc/ddeml.c] [objects/gdiobj.c] Minor fixes. * [win32/device.c] Added stubs for IFSMgr VxDCall and a partial implementation of IFSMgr DeviceIo. * [relay32/Makefile.in] [relay32/builtin32.c] [relay32/imm32.spec] [relay32/msnet32.spec] [relay32/oledlg.spec] Added new spec files for IMM32.DLL, MSNET32.DLL, OLEDLG.DLL. * [misc/Makefile.in] [misc/imm.c] [include/imm.h] Added news files for implementation of IMM32.DLL. All functions return 0 as is correct for all Western Languages. * [ole/Makefile.in] [ole/oledlg.c] [include/oledlg.h] Added new files for implementation of OLEDLG.DLL. Added stubs with FIXME:s for all functions. Wed Sep 2 10:50:00 1998 Juergen Schmied <juergen.schmied@metronet.de> * [dlls/shell32/contmenu.c][dlls/shell32/shellole.c] [dlls/shell32/shlfolder.c][dlls/shell32/shlview.c] [documentation/shell32][include/shell.h] Clean up, bugfixes. * [dlls/shell32/enumidlist.c] Fileattributes implemented. * [dlls/shell32/pidl.c] Class pidlmgr splited into functions, structures changed, some functions rewritten. * [dlls/shell32/shell32_main.c] Small changes and bugfixes SHGetFileInfoA, SHGetSpecialFolderLocation. * [dlls/shell32/shellord.c][relay32/shell32.spec] Parameter documented, implemented SHCloneSpecialIDList. Stub improved ShellExecuteEx32A. New stubs SHFind_InitMenuPopup, FileMenu_InitMenuPopup, FileMenu_Create, FileMenu_TrackPopupMenuEx, SHWinHelp, SHRunConrolPanel, DAD_ShowDragImage, FileMenu_Destroy, SHGetDataFromIDListA, SHFileOperationA. * [include/winnls.h][include/ole2nls.c] TIME_FORCE24HOURFORMAT, TIME_NOTIMEMARKER implemented in OLE_GetFormatA, GetTimeFormat32A. * [win32/code_page.c] WideCharToMultiByte: parameter checking and returning of strlen implemented. * [windows/keyboard.c][windows/defwnd.c] Debug messages added. * [windows/win.c] WIN_SetWindowLong GWL_STYLE and GWL_EXSTYLE implemented. * [controls/menu.c] Missing line added. * [include/winerror.h] Macros for SUCCEEDED and FAILED added. Mon Aug 31 00:55:31 1998 Ulrich Weigand <weigand@informatik.uni-erlangen.de> * [loader/module.c] Bugfix: LoadModule16 should *not* call LoadModule32. * [files/dos_fs.c] Bugfix: don't crash if given directory doesn't exist. Sat Aug 29 15:00:49 1998 Turchanov Sergey <turchanov@usa.net> * [include/mmsystem.h][multimedia/mmsystem.c][relay32/winmm.spec] Almost completed implementation of [snd]PlaySound (except flags SND_ALIAS_ID and SND_APPLICATION). * [if1632/user.spec][windows/winpos.c] Added SetWindowRgn16 stub. Sat Aug 29 02:53:31 1998 Alexander Lukyanov <lav@long.yar.ru> * [files/drive.c] GetDriveType32A: return DRIVE_DOESNOTEXIST in case of non existent drive. * [msdos/int21.c] INT21_FindFirstFCB: check drive validity to prevent oops. * [win32/file.c] CreateFile32A: duplicate STD_{INPUT,OUTPUT}_HANDLE. * [files/dos_fs.c] Make DOSFS_OpenDir treat "" as "/". DOSFS_OpenDevice: duplicate STD_{INPUT,OUTPUT}_HANDLE. * [windows/dialog.c] GetNextDlgTabItem32: use last/first item instead of first/last when hwndCtrl==0. This fixes initial focus. Sat Aug 29 02:46:32 1998 Adrian Harvey <adrian@select.com.au> * [include/process.h] [include/process.c] Renamed PROCESS_SELF to CURRENT_PROCESS_PSEUDOHANDLE in line with thread constant, and Win32 documentation (which calls it a pseudohandle.) Made GetCurrentProcess actually use this constant instead of the value. * [include/process.h] [include/thread.h] [scheduler/thread.c] [scheduler/process.c] [scheduler/handle.c] Modify HANDLE_GetObjPtr to understand about CURRENT_THREAD_PSEUDOHANDLE and CURRENT_PROCESS_PSEUDOHANDLE. This allows DuplicateHandle to do the correct thing with these handles. Removed now duplicate functionality from THREAD_GetPtr and PROCESS_GetPtr. * [loader/ne/segment.c] Fixed two places where HFILE32s were being created and passed to 16-bit code. This should unbreak NE self-loading code. Added two casts to remove compile time warnings. Fri Aug 28 21:04:13 1998 Joseph Pranevich <knight@baltimore.wwaves.com> * [msdos/dosmem.c] [msdos/int2f.c] Added beginnings of DOS error table. * [msdos/int1a.c] Stub for subfunction 0xb0. * [msdos/int10.c] [loader/dos/dosvm.c] INT 10 support completely rewritten and lots of debugging added. Now, DOS apps that use INT 10 to write to the screen will work. (Beyond Zork does, at least. Somewhat.) * [include/miscemu.h] [msdos/dosmem.c] [msdos/int21.c] Another shot at getting MS's generic error message facility right. * [msdos/int21.c] Command.Com wanted to set its own PSP address. I let it. Wed Aug 26 12:26:20 1998 Matthew Toseland <Matthew.Toseland@btinternet.com> * [include/file.h] [misc/lzexpand.c] Fixed LZCopy16 by fixing HFILE16/HFILE32 convertor macros so don't convert lzw handles. Tue Aug 25 22:22:55 1998 Uwe Bonnes <bon@elektron.ikp.physik.tu-darmstadt.de> * [misc/registry.c] In RegEnumvalue, ivalue == 0 is a legal request and should return the first entry. * [msdos/int21.c] Add handling for Int21-48/49 in Win16. Makes blinker demo work. * [windows/winproc.c] Add Msg32A<->Msg32W translation for LB_ADDSTRING. Tue Aug 25 21:03:31 1998 Kristian Nielsen <kristian.nielsen@risoe.dk> * [windows/win.c] Fix for SetParent(): MS Windows 3.11 does not clear the WS_CHILD flag when a child window is reparented to the desktop window. Mon Aug 24 20:55:22 1998 Berend Reitsma <berend at asset-control dot com> * [controls/menu.c] Menus created with SetMenuItemInfo and InsertMenuItem should work now. Sun Aug 23 23:23:23 1998 Alex Korobka <korobka@ams.sunysb.edu> * [controls/combo.c] Added CB_GETITEMHEIGHT. * [windows/winpos.c] WM_NCHITTEST, SWP_FRAMECHANGED bugfixes. Sat Aug 22 21:15:29 1998 Alex Priem <alexp@sci.kun.nl> * [files/profile.c] [include/windows.h] Added GetPrivateProfileSectionNames[AW],GetPrivateProfileSectionW, GetPrivateProfileStructW, GetProfileSectionW, WriteProfileSection[AW], WritePrivateProfileStructW.
387 lines
13 KiB
C
387 lines
13 KiB
C
/*
|
|
* GDI region definitions
|
|
* Mainly taken from the X11 distribution.
|
|
* Modifications: Copyright 1998 Huw Davies
|
|
*/
|
|
|
|
/************************************************************************
|
|
|
|
Copyright (c) 1987 X Consortium
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
of this software and associated documentation files (the "Software"), to deal
|
|
in the Software without restriction, including without limitation the rights
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
furnished to do so, subject to the following conditions:
|
|
|
|
The above copyright notice and this permission notice shall be included in
|
|
all copies or substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
|
|
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
Except as contained in this notice, the name of the X Consortium shall not be
|
|
used in advertising or otherwise to promote the sale, use or other dealings
|
|
in this Software without prior written authorization from the X Consortium.
|
|
|
|
|
|
Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts.
|
|
|
|
All Rights Reserved
|
|
|
|
Permission to use, copy, modify, and distribute this software and its
|
|
documentation for any purpose and without fee is hereby granted,
|
|
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 Digital not be
|
|
used in advertising or publicity pertaining to distribution of the
|
|
software without specific, written prior permission.
|
|
|
|
DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
|
|
ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
|
|
DIGITAL 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.
|
|
|
|
************************************************************************/
|
|
#ifndef __WINE_REGION_H
|
|
#define __WINE_REGION_H
|
|
|
|
#include "windows.h"
|
|
#include "gdi.h"
|
|
|
|
|
|
typedef struct {
|
|
INT32 size;
|
|
INT32 numRects;
|
|
INT32 type; /* NULL, SIMPLE or COMPLEX */
|
|
RECT32 *rects;
|
|
RECT32 extents;
|
|
} WINEREGION;
|
|
|
|
/* GDI logical region object */
|
|
typedef struct
|
|
{
|
|
GDIOBJHDR header;
|
|
WINEREGION *rgn;
|
|
} RGNOBJ;
|
|
|
|
/* 1 if two RECTs overlap.
|
|
* 0 if two RECTs do not overlap.
|
|
*/
|
|
#define EXTENTCHECK(r1, r2) \
|
|
((r1)->right > (r2)->left && \
|
|
(r1)->left < (r2)->right && \
|
|
(r1)->bottom > (r2)->top && \
|
|
(r1)->top < (r2)->bottom)
|
|
|
|
/*
|
|
* Check to see if there is enough memory in the present region.
|
|
*/
|
|
#define MEMCHECK(reg, rect, firstrect){\
|
|
if ((reg)->numRects >= ((reg)->size - 1)){\
|
|
(firstrect) = HeapReAlloc( SystemHeap, 0, \
|
|
(firstrect), (2 * (sizeof(RECT32)) * ((reg)->size)));\
|
|
if ((firstrect) == 0)\
|
|
return;\
|
|
(reg)->size *= 2;\
|
|
(rect) = &(firstrect)[(reg)->numRects];\
|
|
}\
|
|
}
|
|
|
|
#define EMPTY_REGION(pReg) { \
|
|
(pReg)->numRects = 0; \
|
|
(pReg)->extents.left = (pReg)->extents.top = 0; \
|
|
(pReg)->extents.right = (pReg)->extents.bottom = 0; \
|
|
(pReg)->type = NULLREGION; \
|
|
}
|
|
|
|
#define REGION_NOT_EMPTY(pReg) pReg->numRects
|
|
|
|
#define INRECT(r, x, y) \
|
|
( ( ((r).right > x)) && \
|
|
( ((r).left <= x)) && \
|
|
( ((r).bottom > y)) && \
|
|
( ((r).top <= y)) )
|
|
|
|
|
|
/*
|
|
* number of points to buffer before sending them off
|
|
* to scanlines() : Must be an even number
|
|
*/
|
|
#define NUMPTSTOBUFFER 200
|
|
|
|
/*
|
|
* used to allocate buffers for points and link
|
|
* the buffers together
|
|
*/
|
|
|
|
typedef struct _POINTBLOCK {
|
|
POINT32 pts[NUMPTSTOBUFFER];
|
|
struct _POINTBLOCK *next;
|
|
} POINTBLOCK;
|
|
|
|
|
|
|
|
/*
|
|
* This file contains a few macros to help track
|
|
* the edge of a filled object. The object is assumed
|
|
* to be filled in scanline order, and thus the
|
|
* algorithm used is an extension of Bresenham's line
|
|
* drawing algorithm which assumes that y is always the
|
|
* major axis.
|
|
* Since these pieces of code are the same for any filled shape,
|
|
* it is more convenient to gather the library in one
|
|
* place, but since these pieces of code are also in
|
|
* the inner loops of output primitives, procedure call
|
|
* overhead is out of the question.
|
|
* See the author for a derivation if needed.
|
|
*/
|
|
|
|
|
|
/*
|
|
* In scan converting polygons, we want to choose those pixels
|
|
* which are inside the polygon. Thus, we add .5 to the starting
|
|
* x coordinate for both left and right edges. Now we choose the
|
|
* first pixel which is inside the pgon for the left edge and the
|
|
* first pixel which is outside the pgon for the right edge.
|
|
* Draw the left pixel, but not the right.
|
|
*
|
|
* How to add .5 to the starting x coordinate:
|
|
* If the edge is moving to the right, then subtract dy from the
|
|
* error term from the general form of the algorithm.
|
|
* If the edge is moving to the left, then add dy to the error term.
|
|
*
|
|
* The reason for the difference between edges moving to the left
|
|
* and edges moving to the right is simple: If an edge is moving
|
|
* to the right, then we want the algorithm to flip immediately.
|
|
* If it is moving to the left, then we don't want it to flip until
|
|
* we traverse an entire pixel.
|
|
*/
|
|
#define BRESINITPGON(dy, x1, x2, xStart, d, m, m1, incr1, incr2) { \
|
|
int dx; /* local storage */ \
|
|
\
|
|
/* \
|
|
* if the edge is horizontal, then it is ignored \
|
|
* and assumed not to be processed. Otherwise, do this stuff. \
|
|
*/ \
|
|
if ((dy) != 0) { \
|
|
xStart = (x1); \
|
|
dx = (x2) - xStart; \
|
|
if (dx < 0) { \
|
|
m = dx / (dy); \
|
|
m1 = m - 1; \
|
|
incr1 = -2 * dx + 2 * (dy) * m1; \
|
|
incr2 = -2 * dx + 2 * (dy) * m; \
|
|
d = 2 * m * (dy) - 2 * dx - 2 * (dy); \
|
|
} else { \
|
|
m = dx / (dy); \
|
|
m1 = m + 1; \
|
|
incr1 = 2 * dx - 2 * (dy) * m1; \
|
|
incr2 = 2 * dx - 2 * (dy) * m; \
|
|
d = -2 * m * (dy) + 2 * dx; \
|
|
} \
|
|
} \
|
|
}
|
|
|
|
#define BRESINCRPGON(d, minval, m, m1, incr1, incr2) { \
|
|
if (m1 > 0) { \
|
|
if (d > 0) { \
|
|
minval += m1; \
|
|
d += incr1; \
|
|
} \
|
|
else { \
|
|
minval += m; \
|
|
d += incr2; \
|
|
} \
|
|
} else {\
|
|
if (d >= 0) { \
|
|
minval += m1; \
|
|
d += incr1; \
|
|
} \
|
|
else { \
|
|
minval += m; \
|
|
d += incr2; \
|
|
} \
|
|
} \
|
|
}
|
|
|
|
/*
|
|
* This structure contains all of the information needed
|
|
* to run the bresenham algorithm.
|
|
* The variables may be hardcoded into the declarations
|
|
* instead of using this structure to make use of
|
|
* register declarations.
|
|
*/
|
|
typedef struct {
|
|
INT32 minor_axis; /* minor axis */
|
|
INT32 d; /* decision variable */
|
|
INT32 m, m1; /* slope and slope+1 */
|
|
INT32 incr1, incr2; /* error increments */
|
|
} BRESINFO;
|
|
|
|
|
|
#define BRESINITPGONSTRUCT(dmaj, min1, min2, bres) \
|
|
BRESINITPGON(dmaj, min1, min2, bres.minor_axis, bres.d, \
|
|
bres.m, bres.m1, bres.incr1, bres.incr2)
|
|
|
|
#define BRESINCRPGONSTRUCT(bres) \
|
|
BRESINCRPGON(bres.d, bres.minor_axis, bres.m, bres.m1, bres.incr1, bres.incr2)
|
|
|
|
|
|
|
|
/*
|
|
* These are the data structures needed to scan
|
|
* convert regions. Two different scan conversion
|
|
* methods are available -- the even-odd method, and
|
|
* the winding number method.
|
|
* The even-odd rule states that a point is inside
|
|
* the polygon if a ray drawn from that point in any
|
|
* direction will pass through an odd number of
|
|
* path segments.
|
|
* By the winding number rule, a point is decided
|
|
* to be inside the polygon if a ray drawn from that
|
|
* point in any direction passes through a different
|
|
* number of clockwise and counter-clockwise path
|
|
* segments.
|
|
*
|
|
* These data structures are adapted somewhat from
|
|
* the algorithm in (Foley/Van Dam) for scan converting
|
|
* polygons.
|
|
* The basic algorithm is to start at the top (smallest y)
|
|
* of the polygon, stepping down to the bottom of
|
|
* the polygon by incrementing the y coordinate. We
|
|
* keep a list of edges which the current scanline crosses,
|
|
* sorted by x. This list is called the Active Edge Table (AET)
|
|
* As we change the y-coordinate, we update each entry in
|
|
* in the active edge table to reflect the edges new xcoord.
|
|
* This list must be sorted at each scanline in case
|
|
* two edges intersect.
|
|
* We also keep a data structure known as the Edge Table (ET),
|
|
* which keeps track of all the edges which the current
|
|
* scanline has not yet reached. The ET is basically a
|
|
* list of ScanLineList structures containing a list of
|
|
* edges which are entered at a given scanline. There is one
|
|
* ScanLineList per scanline at which an edge is entered.
|
|
* When we enter a new edge, we move it from the ET to the AET.
|
|
*
|
|
* From the AET, we can implement the even-odd rule as in
|
|
* (Foley/Van Dam).
|
|
* The winding number rule is a little trickier. We also
|
|
* keep the EdgeTableEntries in the AET linked by the
|
|
* nextWETE (winding EdgeTableEntry) link. This allows
|
|
* the edges to be linked just as before for updating
|
|
* purposes, but only uses the edges linked by the nextWETE
|
|
* link as edges representing spans of the polygon to
|
|
* drawn (as with the even-odd rule).
|
|
*/
|
|
|
|
/*
|
|
* for the winding number rule
|
|
*/
|
|
#define CLOCKWISE 1
|
|
#define COUNTERCLOCKWISE -1
|
|
|
|
typedef struct _EdgeTableEntry {
|
|
INT32 ymax; /* ycoord at which we exit this edge. */
|
|
BRESINFO bres; /* Bresenham info to run the edge */
|
|
struct _EdgeTableEntry *next; /* next in the list */
|
|
struct _EdgeTableEntry *back; /* for insertion sort */
|
|
struct _EdgeTableEntry *nextWETE; /* for winding num rule */
|
|
int ClockWise; /* flag for winding number rule */
|
|
} EdgeTableEntry;
|
|
|
|
|
|
typedef struct _ScanLineList{
|
|
INT32 scanline; /* the scanline represented */
|
|
EdgeTableEntry *edgelist; /* header node */
|
|
struct _ScanLineList *next; /* next in the list */
|
|
} ScanLineList;
|
|
|
|
|
|
typedef struct {
|
|
INT32 ymax; /* ymax for the polygon */
|
|
INT32 ymin; /* ymin for the polygon */
|
|
ScanLineList scanlines; /* header node */
|
|
} EdgeTable;
|
|
|
|
|
|
/*
|
|
* Here is a struct to help with storage allocation
|
|
* so we can allocate a big chunk at a time, and then take
|
|
* pieces from this heap when we need to.
|
|
*/
|
|
#define SLLSPERBLOCK 25
|
|
|
|
typedef struct _ScanLineListBlock {
|
|
ScanLineList SLLs[SLLSPERBLOCK];
|
|
struct _ScanLineListBlock *next;
|
|
} ScanLineListBlock;
|
|
|
|
|
|
/*
|
|
*
|
|
* a few macros for the inner loops of the fill code where
|
|
* performance considerations don't allow a procedure call.
|
|
*
|
|
* Evaluate the given edge at the given scanline.
|
|
* If the edge has expired, then we leave it and fix up
|
|
* the active edge table; otherwise, we increment the
|
|
* x value to be ready for the next scanline.
|
|
* The winding number rule is in effect, so we must notify
|
|
* the caller when the edge has been removed so he
|
|
* can reorder the Winding Active Edge Table.
|
|
*/
|
|
#define EVALUATEEDGEWINDING(pAET, pPrevAET, y, fixWAET) { \
|
|
if (pAET->ymax == y) { /* leaving this edge */ \
|
|
pPrevAET->next = pAET->next; \
|
|
pAET = pPrevAET->next; \
|
|
fixWAET = 1; \
|
|
if (pAET) \
|
|
pAET->back = pPrevAET; \
|
|
} \
|
|
else { \
|
|
BRESINCRPGONSTRUCT(pAET->bres); \
|
|
pPrevAET = pAET; \
|
|
pAET = pAET->next; \
|
|
} \
|
|
}
|
|
|
|
|
|
/*
|
|
* Evaluate the given edge at the given scanline.
|
|
* If the edge has expired, then we leave it and fix up
|
|
* the active edge table; otherwise, we increment the
|
|
* x value to be ready for the next scanline.
|
|
* The even-odd rule is in effect.
|
|
*/
|
|
#define EVALUATEEDGEEVENODD(pAET, pPrevAET, y) { \
|
|
if (pAET->ymax == y) { /* leaving this edge */ \
|
|
pPrevAET->next = pAET->next; \
|
|
pAET = pPrevAET->next; \
|
|
if (pAET) \
|
|
pAET->back = pPrevAET; \
|
|
} \
|
|
else { \
|
|
BRESINCRPGONSTRUCT(pAET->bres); \
|
|
pPrevAET = pAET; \
|
|
pAET = pAET->next; \
|
|
} \
|
|
}
|
|
|
|
extern BOOL32 REGION_DeleteObject( HRGN32 hrgn, RGNOBJ * obj );
|
|
extern BOOL32 REGION_UnionRectWithRgn( HRGN32 hrgn, const RECT32 *lpRect );
|
|
extern BOOL32 REGION_FrameRgn( HRGN32 dest, HRGN32 src, INT32 x, INT32 y );
|
|
extern BOOL32 REGION_LPTODP( HDC32 hdc, HRGN32 hDest, HRGN32 hSrc );
|
|
|
|
#endif /* __WINE_REGION_H */
|
|
|
|
|