diff --git a/BUILDING.txt b/BUILDING.txt

index 9449810..99c8698 100644

--- a/BUILDING.txt

+++ b/BUILDING.txt

@@ -11,6 +11,8 @@ Build Requirements (All Systems)

 -- zlib

+-- pixman

+

 -- FLTK 1.3.3 or later

 -- If building TLS support:

diff --git a/CMakeLists.txt b/CMakeLists.txt

index 94ec2ef..dfdf197 100644

--- a/CMakeLists.txt

+++ b/CMakeLists.txt

@@ -134,6 +134,9 @@ endif()

 # Check for zlib

 find_package(ZLIB REQUIRED)

+# Check for pixman

+find_package(Pixman REQUIRED)

+

 # Check for gettext

 option(ENABLE_NLS "Enable translation of program messages" ON)

 if(ENABLE_NLS)

diff --git a/cmake/Modules/FindPixman.cmake b/cmake/Modules/FindPixman.cmake

new file mode 100644

index 0000000..7bfca77

--- /dev/null

+++ b/cmake/Modules/FindPixman.cmake

@@ -0,0 +1,40 @@

+# - Find Pixman

+# Find the Pixman libraries

+#

+#  This module defines the following variables:

+#     PIXMAN_FOUND        - true if PIXMAN_INCLUDE_DIR & PIXMAN_LIBRARY are found

+#     PIXMAN_LIBRARIES    - Set when PIXMAN_LIBRARY is found

+#     PIXMAN_INCLUDE_DIRS - Set when PIXMAN_INCLUDE_DIR is found

+#

+#     PIXMAN_INCLUDE_DIR  - where to find pixman.h, etc.

+#     PIXMAN_LIBRARY      - the Pixman library

+#

+

+#=============================================================================

+# Copyright 2013 Marc-Andre Moreau <marcandre.moreau@gmail.com>

+#

+# Licensed under the Apache License, Version 2.0 (the "License");

+# you may not use this file except in compliance with the License.

+# You may obtain a copy of the License at

+#

+#     http://www.apache.org/licenses/LICENSE-2.0

+#

+# Unless required by applicable law or agreed to in writing, software

+# distributed under the License is distributed on an "AS IS" BASIS,

+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.

+# See the License for the specific language governing permissions and

+# limitations under the License.

+#=============================================================================

+

+find_path(PIXMAN_INCLUDE_DIR NAMES pixman.h PATH_SUFFIXES pixman-1)

+

+find_library(PIXMAN_LIBRARY NAMES pixman-1)

+

+find_package_handle_standard_args(pixman-1 DEFAULT_MSG PIXMAN_LIBRARY PIXMAN_INCLUDE_DIR)

+

+if(PIXMAN-1_FOUND)

+	set(PIXMAN_LIBRARIES ${PIXMAN_LIBRARY})

+	set(PIXMAN_INCLUDE_DIRS ${PIXMAN_INCLUDE_DIR})

+endif()

+

+mark_as_advanced(PIXMAN_INCLUDE_DIR PIXMAN_LIBRARY)

diff --git a/cmake/StaticBuild.cmake b/cmake/StaticBuild.cmake

index 6db0e14..db30c5c 100644

--- a/cmake/StaticBuild.cmake

+++ b/cmake/StaticBuild.cmake

@@ -19,6 +19,7 @@ if(BUILD_STATIC)

   set(BUILD_STATIC_GCC 1)

   set(JPEG_LIBRARIES "-Wl,-Bstatic -ljpeg -Wl,-Bdynamic")

+  set(PIXMAN_LIBRARY "-Wl,-Bstatic -lpixman-1 -Wl,-Bdynamic")

   if(WIN32)

     set(ZLIB_LIBRARIES "-Wl,-Bstatic -lz -Wl,-Bdynamic")

@@ -133,7 +134,7 @@ if(BUILD_STATIC_GCC)

     # these things again

     set(STATIC_BASE_LIBRARIES "${STATIC_BASE_LIBRARIES} -lmingw32 -lgcc_eh -lgcc -lmoldname -lmingwex -lmsvcrt")

   else()

-    set(STATIC_BASE_LIBRARIES "${STATIC_BASE_LIBRARIES} -lgcc -lgcc_eh -lc")

+    set(STATIC_BASE_LIBRARIES "${STATIC_BASE_LIBRARIES} -lm -lgcc -lgcc_eh -lc")

   endif()

   set(CMAKE_CXX_LINK_EXECUTABLE "${CMAKE_CXX_LINK_EXECUTABLE} ${STATIC_BASE_LIBRARIES}")

 endif()

diff --git a/common/CMakeLists.txt b/common/CMakeLists.txt

index e4489f6..6fd1e10 100644

--- a/common/CMakeLists.txt

+++ b/common/CMakeLists.txt

@@ -1,7 +1,6 @@

 add_subdirectory(os)

 add_subdirectory(rdr)

 add_subdirectory(network)

-add_subdirectory(Xregion)

 add_subdirectory(rfb)

 # For any convenience libraries that are linked into libvnc.so, we need to

@@ -10,6 +9,6 @@ add_subdirectory(rfb)

 # is passed (additionally, libvnc is not used on Windows.)

 if(NOT WIN32)

-  set_target_properties(os rdr network Xregion rfb

+  set_target_properties(os rdr network rfb

     PROPERTIES COMPILE_FLAGS -fPIC)

 endif()

diff --git a/common/Xregion/CMakeLists.txt b/common/Xregion/CMakeLists.txt

deleted file mode 100644

index 40ca97e..0000000

--- a/common/Xregion/CMakeLists.txt

+++ /dev/null

@@ -1,6 +0,0 @@

-add_library(Xregion STATIC

-  Region.c)

-

-if(UNIX)

-  libtool_create_control_file(Xregion)

-endif()

diff --git a/common/Xregion/Region.c b/common/Xregion/Region.c

deleted file mode 100644

index 1acf581..0000000

--- a/common/Xregion/Region.c

+++ /dev/null

@@ -1,1612 +0,0 @@

-/************************************************************************

-

-Copyright 1987, 1988, 1998  The Open Group

-

-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.

-

-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

-OPEN GROUP 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 Open Group 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 Open Group.

-

-

-Copyright 1987, 1988 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.

-

-************************************************************************/

-/*

- * The functions in this file implement the Region abstraction, similar to one

- * used in the X11 sample server. A Region is simply an area, as the name

- * implies, and is implemented as a "y-x-banded" array of rectangles. To

- * explain: Each Region is made up of a certain number of rectangles sorted

- * by y coordinate first, and then by x coordinate.

- *

- * Furthermore, the rectangles are banded such that every rectangle with a

- * given upper-left y coordinate (y1) will have the same lower-right y

- * coordinate (y2) and vice versa. If a rectangle has scanlines in a band, it

- * will span the entire vertical distance of the band. This means that some

- * areas that could be merged into a taller rectangle will be represented as

- * several shorter rectangles to account for shorter rectangles to its left

- * or right but within its "vertical scope".

- *

- * An added constraint on the rectangles is that they must cover as much

- * horizontal area as possible. E.g. no two rectangles in a band are allowed

- * to touch.

- *

- * Whenever possible, bands will be merged together to cover a greater vertical

- * distance (and thus reduce the number of rectangles). Two bands can be merged

- * only if the bottom of one touches the top of the other and they have

- * rectangles in the same places (of the same width, of course). This maintains

- * the y-x-banding that's so nice to have...

- */

-

-#include <string.h>

-

-#include "Xlibint.h"

-#include "Xutil.h"

-#include "Xregion.h"

-

-#ifndef min

-#define min(a,b)            (((a) < (b)) ? (a) : (b))

-#endif

-#ifndef max

-#define max(a,b)            (((a) > (b)) ? (a) : (b))

-#endif

-

-#ifdef DEBUG

-#include <stdio.h>

-#define assert(expr) {if (!(expr)) fprintf(stderr,\

-"Assertion failed file %s, line %d: expr\n", __FILE__, __LINE__); }

-#else

-#define assert(expr)

-#endif

-

-typedef int (*overlapProcp)(

-        register Region     pReg,

-        register BoxPtr     r1,

-        BoxPtr              r1End,

-        register BoxPtr     r2,

-        BoxPtr              r2End,

-        short               y1,

-        short               y2);

-

-typedef int (*nonOverlapProcp)(

-    register Region     pReg,

-    register BoxPtr     r,

-    BoxPtr              rEnd,

-    register short      y1,

-    register short      y2);

-

-static void miRegionOp(

-    register Region 	newReg,	    	    	/* Place to store result */

-    Region	  	reg1,	    	    	/* First region in operation */

-    Region	  	reg2,	    	    	/* 2d region in operation */

-    int    	  	(*overlapFunc)(

-        register Region     pReg,

-        register BoxPtr     r1,

-        BoxPtr              r1End,

-        register BoxPtr     r2,

-        BoxPtr              r2End,

-        short               y1,

-        short               y2),                /* Function to call for over-

-						 * lapping bands */

-    int    	  	(*nonOverlap1Func)(

-        register Region     pReg,

-        register BoxPtr     r,

-        BoxPtr              rEnd,

-        register short      y1,

-        register short      y2),                /* Function to call for non-

-						 * overlapping bands in region

-						 * 1 */

-    int    	  	(*nonOverlap2Func)(

-        register Region     pReg,

-        register BoxPtr     r,

-        BoxPtr              rEnd,

-        register short      y1,

-        register short      y2));               /* Function to call for non-

-						 * overlapping bands in region

-						 * 2 */

-

-

-/*	Create a new empty region	*/

-Region

-XCreateRegion(void)

-{

-    Region temp;

-

-    if (! (temp = Xmalloc(sizeof( REGION ))))

-	return (Region) NULL;

-    if (! (temp->rects = Xmalloc(sizeof( BOX )))) {

-	Xfree(temp);

-	return (Region) NULL;

-    }

-    temp->numRects = 0;

-    temp->extents.x1 = 0;

-    temp->extents.y1 = 0;

-    temp->extents.x2 = 0;

-    temp->extents.y2 = 0;

-    temp->size = 1;

-    return( temp );

-}

-

-int

-XClipBox(

-    Region r,

-    XRectangle *rect)

-{

-    rect->x = r->extents.x1;

-    rect->y = r->extents.y1;

-    rect->width = r->extents.x2 - r->extents.x1;

-    rect->height = r->extents.y2 - r->extents.y1;

-    return 1;

-}

-

-int

-XUnionRectWithRegion(

-    register XRectangle *rect,

-    Region source, Region dest)

-{

-    REGION region;

-

-    if (!rect->width || !rect->height)

-	return 0;

-    region.rects = &region.extents;

-    region.numRects = 1;

-    region.extents.x1 = rect->x;

-    region.extents.y1 = rect->y;

-    region.extents.x2 = rect->x + rect->width;

-    region.extents.y2 = rect->y + rect->height;

-    region.size = 1;

-

-    return XUnionRegion(&region, source, dest);

-}

-

-/*-

- *-----------------------------------------------------------------------

- * miSetExtents --

- *	Reset the extents of a region to what they should be. Called by

- *	miSubtract and miIntersect b/c they can't figure it out along the

- *	way or do so easily, as miUnion can.

- *

- * Results:

- *	None.

- *

- * Side Effects:

- *	The region's 'extents' structure is overwritten.

- *

- *-----------------------------------------------------------------------

- */

-static void

-miSetExtents (

-    Region	  	pReg)

-{

-    register BoxPtr	pBox,

-			pBoxEnd,

-			pExtents;

-

-    if (pReg->numRects == 0)

-    {

-	pReg->extents.x1 = 0;

-	pReg->extents.y1 = 0;

-	pReg->extents.x2 = 0;

-	pReg->extents.y2 = 0;

-	return;

-    }

-

-    pExtents = &pReg->extents;

-    pBox = pReg->rects;

-    pBoxEnd = &pBox[pReg->numRects - 1];

-

-    /*

-     * Since pBox is the first rectangle in the region, it must have the

-     * smallest y1 and since pBoxEnd is the last rectangle in the region,

-     * it must have the largest y2, because of banding. Initialize x1 and

-     * x2 from  pBox and pBoxEnd, resp., as good things to initialize them

-     * to...

-     */

-    pExtents->x1 = pBox->x1;

-    pExtents->y1 = pBox->y1;

-    pExtents->x2 = pBoxEnd->x2;

-    pExtents->y2 = pBoxEnd->y2;

-

-    assert(pExtents->y1 < pExtents->y2);

-    while (pBox <= pBoxEnd)

-    {

-	if (pBox->x1 < pExtents->x1)

-	{

-	    pExtents->x1 = pBox->x1;

-	}

-	if (pBox->x2 > pExtents->x2)

-	{

-	    pExtents->x2 = pBox->x2;

-	}

-	pBox++;

-    }

-    assert(pExtents->x1 < pExtents->x2);

-}

-

-#if 0

-int

-XSetRegion(

-    Display *dpy,

-    GC gc,

-    register Region r)

-{

-    register int i;

-    register XRectangle *xr, *pr;

-    register BOX *pb;

-    unsigned long total;

-

-    LockDisplay (dpy);

-    total = r->numRects * sizeof (XRectangle);

-    if ((xr = (XRectangle *) _XAllocTemp(dpy, total))) {

-	for (pr = xr, pb = r->rects, i = r->numRects; --i >= 0; pr++, pb++) {

-	    pr->x = pb->x1;

-	    pr->y = pb->y1;

-	    pr->width = pb->x2 - pb->x1;

-	    pr->height = pb->y2 - pb->y1;

-	}

-    }

-    if (xr || !r->numRects)

-	_XSetClipRectangles(dpy, gc, 0, 0, xr, r->numRects, YXBanded);

-    if (xr)

-	_XFreeTemp(dpy, (char *)xr, total);

-    UnlockDisplay(dpy);

-    SyncHandle();

-    return 1;

-}

-#endif

-

-int

-XDestroyRegion(

-    Region r)

-{

-    Xfree( (char *) r->rects );

-    Xfree( (char *) r );

-    return 1;

-}

-

-

-/* TranslateRegion(pRegion, x, y)

-   translates in place

-   added by raymond

-*/

-

-int

-XOffsetRegion(

-    register Region pRegion,

-    register int x,

-    register int y)

-{

-    register int nbox;

-    register BOX *pbox;

-

-    pbox = pRegion->rects;

-    nbox = pRegion->numRects;

-

-    while(nbox--)

-    {

-	pbox->x1 += x;

-	pbox->x2 += x;

-	pbox->y1 += y;

-	pbox->y2 += y;

-	pbox++;

-    }

-    pRegion->extents.x1 += x;

-    pRegion->extents.x2 += x;

-    pRegion->extents.y1 += y;

-    pRegion->extents.y2 += y;

-    return 1;

-}

-

-/*

-   Utility procedure Compress:

-   Replace r by the region r', where

-     p in r' iff (Quantifer m <= dx) (p + m in r), and

-     Quantifier is Exists if grow is TRUE, For all if grow is FALSE, and

-     (x,y) + m = (x+m,y) if xdir is TRUE; (x,y+m) if xdir is FALSE.

-

-   Thus, if xdir is TRUE and grow is FALSE, r is replaced by the region

-   of all points p such that p and the next dx points on the same

-   horizontal scan line are all in r.  We do this using by noting

-   that p is the head of a run of length 2^i + k iff p is the head

-   of a run of length 2^i and p+2^i is the head of a run of length

-   k. Thus, the loop invariant: s contains the region corresponding

-   to the runs of length shift.  r contains the region corresponding

-   to the runs of length 1 + dxo & (shift-1), where dxo is the original

-   value of dx.  dx = dxo & ~(shift-1).  As parameters, s and t are

-   scratch regions, so that we don't have to allocate them on every

-   call.

-*/

-

-#define ZOpRegion(a,b,c) if (grow) XUnionRegion(a,b,c); \

-			 else XIntersectRegion(a,b,c)

-#define ZShiftRegion(a,b) if (xdir) XOffsetRegion(a,b,0); \

-			  else XOffsetRegion(a,0,b)

-#define ZCopyRegion(a,b) XUnionRegion(a,a,b)

-

-static void

-Compress(

-    Region r, Region s, Region t,

-    register unsigned dx,

-    register int xdir, register int grow)

-{

-    register unsigned shift = 1;

-

-    ZCopyRegion(r, s);

-    while (dx) {

-        if (dx & shift) {

-            ZShiftRegion(r, -(int)shift);

-            ZOpRegion(r, s, r);

-            dx -= shift;

-            if (!dx) break;

-        }

-        ZCopyRegion(s, t);

-        ZShiftRegion(s, -(int)shift);

-        ZOpRegion(s, t, s);

-        shift <<= 1;

-    }

-}

-

-#undef ZOpRegion

-#undef ZShiftRegion

-#undef ZCopyRegion

-

-int

-XShrinkRegion(

-    Region r,

-    int dx, int dy)

-{

-    Region s, t;

-    int grow;

-

-    if (!dx && !dy) return 0;

-    if (! (s = XCreateRegion()) )

-	return 0;

-    if (! (t = XCreateRegion()) ) {

-	XDestroyRegion(s);

-	return 0;

-    }

-    if ((grow = (dx < 0))) dx = -dx;

-    if (dx) Compress(r, s, t, (unsigned) 2*dx, TRUE, grow);

-    if ((grow = (dy < 0))) dy = -dy;

-    if (dy) Compress(r, s, t, (unsigned) 2*dy, FALSE, grow);

-    XOffsetRegion(r, dx, dy);

-    XDestroyRegion(s);

-    XDestroyRegion(t);

-    return 0;

-}

-

-

-/*======================================================================

- *	    Region Intersection

- *====================================================================*/

-/*-

- *-----------------------------------------------------------------------

- * miIntersectO --

- *	Handle an overlapping band for miIntersect.

- *

- * Results:

- *	None.

- *

- * Side Effects:

- *	Rectangles may be added to the region.

- *

- *-----------------------------------------------------------------------

- */

-/* static void*/

-static int

-miIntersectO (

-    register Region	pReg,

-    register BoxPtr	r1,

-    BoxPtr  	  	r1End,

-    register BoxPtr	r2,

-    BoxPtr  	  	r2End,

-    short    	  	y1,

-    short    	  	y2)

-{

-    register short  	x1;

-    register short  	x2;

-    register BoxPtr	pNextRect;

-

-    pNextRect = &pReg->rects[pReg->numRects];

-

-    while ((r1 != r1End) && (r2 != r2End))

-    {

-	x1 = max(r1->x1,r2->x1);

-	x2 = min(r1->x2,r2->x2);

-

-	/*

-	 * If there's any overlap between the two rectangles, add that

-	 * overlap to the new region.

-	 * There's no need to check for subsumption because the only way

-	 * such a need could arise is if some region has two rectangles

-	 * right next to each other. Since that should never happen...

-	 */

-	if (x1 < x2)

-	{

-	    assert(y1

-

-	    MEMCHECK(pReg, pNextRect, pReg->rects);

-	    pNextRect->x1 = x1;

-	    pNextRect->y1 = y1;

-	    pNextRect->x2 = x2;

-	    pNextRect->y2 = y2;

-	    pReg->numRects += 1;

-	    pNextRect++;

-	    assert(pReg->numRects <= pReg->size);

-	}

-

-	/*

-	 * Need to advance the pointers. Shift the one that extends

-	 * to the right the least, since the other still has a chance to

-	 * overlap with that region's next rectangle, if you see what I mean.

-	 */

-	if (r1->x2 < r2->x2)

-	{

-	    r1++;

-	}

-	else if (r2->x2 < r1->x2)

-	{

-	    r2++;

-	}

-	else

-	{

-	    r1++;

-	    r2++;

-	}

-    }

-    return 0;	/* lint */

-}

-

-int

-XIntersectRegion(

-    Region 	  	reg1,

-    Region	  	reg2,          /* source regions     */

-    register Region 	newReg)               /* destination Region */

-{

-   /* check for trivial reject */

-    if ( (!(reg1->numRects)) || (!(reg2->numRects))  ||

-	(!EXTENTCHECK(&reg1->extents, &reg2->extents)))

-        newReg->numRects = 0;

-    else

-	miRegionOp (newReg, reg1, reg2,

-    		miIntersectO, NULL, NULL);

-

-    /*

-     * Can't alter newReg's extents before we call miRegionOp because

-     * it might be one of the source regions and miRegionOp depends

-     * on the extents of those regions being the same. Besides, this

-     * way there's no checking against rectangles that will be nuked

-     * due to coalescing, so we have to examine fewer rectangles.

-     */

-    miSetExtents(newReg);

-    return 1;

-}

-

-static int

-miRegionCopy(

-    register Region dstrgn,

-    register Region rgn)

-

-{

-    if (dstrgn != rgn) /*  don't want to copy to itself */

-    {

-        if (dstrgn->size < rgn->numRects)

-        {

-            if (dstrgn->rects)

-            {

-		BOX *prevRects = dstrgn->rects;

-

-		dstrgn->rects = Xrealloc(dstrgn->rects,

-					 rgn->numRects * (sizeof(BOX)));

-		if (! dstrgn->rects) {

-		    Xfree(prevRects);

-		    dstrgn->size = 0;

-		    return 0;

-		}

-            }

-            dstrgn->size = rgn->numRects;

-	}

-        dstrgn->numRects = rgn->numRects;

-        dstrgn->extents.x1 = rgn->extents.x1;

-        dstrgn->extents.y1 = rgn->extents.y1;

-        dstrgn->extents.x2 = rgn->extents.x2;

-        dstrgn->extents.y2 = rgn->extents.y2;

-

-	memcpy((char *) dstrgn->rects, (char *) rgn->rects,

-	       (int) (rgn->numRects * sizeof(BOX)));

-    }

-    return 1;

-}

-

-/*======================================================================

- *	    Generic Region Operator

- *====================================================================*/

-

-/*-

- *-----------------------------------------------------------------------

- * miCoalesce --

- *	Attempt to merge the boxes in the current band with those in the

- *	previous one. Used only by miRegionOp.

- *

- * Results:

- *	The new index for the previous band.

- *

- * Side Effects:

- *	If coalescing takes place:

- *	    - rectangles in the previous band will have their y2 fields

- *	      altered.

- *	    - pReg->numRects will be decreased.

- *

- *-----------------------------------------------------------------------

- */

-/* static int*/

-static int

-miCoalesce(

-    register Region	pReg,	    	/* Region to coalesce */

-    int	    	  	prevStart,  	/* Index of start of previous band */

-    int	    	  	curStart)   	/* Index of start of current band */

-{

-    register BoxPtr	pPrevBox;   	/* Current box in previous band */

-    register BoxPtr	pCurBox;    	/* Current box in current band */

-    register BoxPtr	pRegEnd;    	/* End of region */

-    int	    	  	curNumRects;	/* Number of rectangles in current

-					 * band */

-    int	    	  	prevNumRects;	/* Number of rectangles in previous

-					 * band */