/* * DBpaint.c -- * * Fast paint primitive. * This uses a very fast, heavily tuned algorithm for painting. * The basic outer loop is a non-recursive area enumeration, and * the inner loop attempts to avoid merging as much as possible. * * ********************************************************************* * * Copyright (C) 1985, 1990 Regents of the University of California. * * * 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. The University of California * * * makes no representations about the suitability of this * * * software for any purpose. It is provided "as is" without * * * express or implied warranty. Export of this software outside * * * of the United States of America may require an export license. * * ********************************************************************* */ /* #define PAINTDEBUG /* For debugging */ #ifndef lint static char rcsid[] = "$Header: /ufs/repository/magic/database/DBpaint.c,v 1.4 2001/04/13 20:02:58 tim Exp $"; #endif #include #include #include "misc/magic.h" #include "utils/malloc.h" #include "utils/geometry.h" #include "tiles/tile.h" #include "utils/hash.h" #include "database/database.h" #include "database/databaseInt.h" #include "graphics/graphics.h" #include "windows/windows.h" #include "dbwind/dbwind.h" #include "signals/signals.h" #include "textio/textio.h" #include "undo/undo.h" /* ---------------------- Imports from DBundo.c ----------------------- */ extern CellDef *dbUndoLastCell; extern UndoType dbUndoIDPaint; /* ----------------------- Forward declarations ----------------------- */ Tile *dbPaintMerge(); Tile *dbMergeType(); Tile *dbPaintMergeVert(); #ifdef NONMANHATTAN bool TiNMSplitX(); bool TiNMSplitY(); #endif #ifdef PAINTDEBUG int dbPaintDebug = 0; #endif /* ----------------------- Flags to dbPaintMerge ---------------------- */ #define MRG_TOP 0x01 #define MRG_LEFT 0x02 #define MRG_RIGHT 0x04 #define MRG_BOTTOM 0x08 /* -------------- Macros to see if merging is possible ---------------- */ #define CANMERGE_Y(t1, t2) ( LEFT(t1) == LEFT(t2) \ && TiGetTypeExact(t1) == TiGetTypeExact(t2) \ && RIGHT(t1) == RIGHT(t2) ) #define CANMERGE_X(t1, t2) ( BOTTOM(t1) == BOTTOM(t2) \ && TiGetTypeExact(t1) == TiGetTypeExact(t2) \ && TOP(t1) == TOP(t2) ) #define SELMERGE_Y(t1, t2, msk) ( LEFT(t1) == LEFT(t2) \ && TiGetTypeExact(t1) == TiGetTypeExact(t2) \ && RIGHT(t1) == RIGHT(t2) \ && ! TTMaskHasType(msk, TiGetType(t1)) ) #define SELMERGE_X(t1, t2, msk) ( BOTTOM(t1) == BOTTOM(t2) \ && TiGetTypeExact(t1) == TiGetTypeExact(t2) \ && TOP(t1) == TOP(t2) \ && ! TTMaskHasType(msk, TiGetType(t1)) ) /* This macro seems to buy us about 15% in speed */ #define TISPLITX(res, otile, xcoord) \ { \ register Tile *xtile = otile, *xxnew, *xp; \ register int x = xcoord; \ \ MALLOC(Tile *, xxnew, sizeof (Tile)); \ xxnew->ti_client = (ClientData) MINFINITY; \ \ LEFT(xxnew) = x, BOTTOM(xxnew) = BOTTOM(xtile); \ BL(xxnew) = xtile, TR(xxnew) = TR(xtile), RT(xxnew) = RT(xtile); \ \ /* Left edge */ \ for (xp = TR(xtile); BL(xp) == xtile; xp = LB(xp)) BL(xp) = xxnew; \ TR(xtile) = xxnew; \ \ /* Top edge */ \ for (xp = RT(xtile); LEFT(xp) >= x; xp = BL(xp)) LB(xp) = xxnew; \ RT(xtile) = xp; \ \ /* Bottom edge */ \ for (xp = LB(xtile); RIGHT(xp) <= x; xp = TR(xp)) /* nothing */; \ for (LB(xxnew) = xp; RT(xp) == xtile; RT(xp) = xxnew, xp = TR(xp)); \ res = xxnew; \ } /* Record undo information */ #define DBPAINTUNDO(tile, newType, undo) \ { \ register paintUE *xxpup; \ \ if (undo->pu_def != dbUndoLastCell) dbUndoEdit(undo->pu_def); \ \ xxpup = (paintUE *) UndoNewEvent(dbUndoIDPaint, sizeof(paintUE)); \ if (xxpup) \ { \ xxpup->pue_rect.r_xbot = LEFT(tile); \ xxpup->pue_rect.r_xtop = RIGHT(tile); \ xxpup->pue_rect.r_ybot = BOTTOM(tile); \ xxpup->pue_rect.r_ytop = TOP(tile); \ xxpup->pue_oldtype = TiGetTypeExact(tile); \ xxpup->pue_newtype = newType; \ xxpup->pue_plane = undo->pu_pNum; \ } \ } /* * ---------------------------------------------------------------------------- * * DBPaintPlane -- * * Paint a rectangular area ('area') on a single tile plane ('plane'). * * The argument 'resultTbl' is a table, indexed by the type of each tile * found while enumerating 'area', that gives the result type for this * operation. The semantics of painting, erasing, and "writing" (storing * a new type in the area without regard to the previous contents) are * all encapsulated in this table. (Note: There is now a procedure called * DBPaintPlaneByProc for those cases where a table doesn't suffice.) * * If undo is desired, 'undo' should point to a PaintUndoInfo struct * that contains everything needed to build an undo record. Otherwise, * 'undo' can be NULL. * * Results: * None. * * Side effects: * Modifies the database plane that contains the given tile. * * REMINDER: * Callers should remember to set the CDMODIFIED and CDGETNEWSTAMP * bits in the cell definition containing the plane being painted. * * ---------------------------------------------------------------------------- */ Void DBPaintPlane(plane, area, resultTbl, undo) Plane *plane; /* Plane whose paint is to be modified */ register Rect *area; /* Area to be changed */ PaintResultType *resultTbl; /* Table, indexed by the type of tile already * present in the plane, giving the type to * which the existing tile must change as a * result of this paint operation. */ PaintUndoInfo *undo; /* Record containing everything needed to * save undo entries for this operation. * If NULL, the undo package is not used. */ { Point start; int clipTop, mergeFlags; TileType oldType, newType; Tile *tile, *newtile; register Tile *tpnew; /* Used for area search */ register Tile *tp; /* Used for paint */ #ifdef NONMANHATTAN bool haschanged; #endif if (area->r_xtop <= area->r_xbot || area->r_ytop <= area->r_ybot) return; /* * The following is a modified version of the area enumeration * algorithm. It expects the in-line paint code below to leave * 'tile' pointing to the tile from which we should continue the * search. */ start.p_x = area->r_xbot; start.p_y = area->r_ytop - 1; tile = plane->pl_hint; GOTOPOINT(tile, &start); /* Each iteration visits another tile on the LHS of the search area */ while (TOP(tile) > area->r_ybot) { /*** *** AREA SEARCH. *** Each iteration enumerates another tile. ***/ enumerate: if (SigInterruptPending) break; clipTop = TOP(tile); if (clipTop > area->r_ytop) clipTop = area->r_ytop; oldType = TiGetTypeExact(tile); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "area enum"); #endif /*** *** ---------- THE FOLLOWING IS IN-LINE PAINT CODE ---------- ***/ /* * Set up the directions in which we will have to * merge initially. Clipping can cause some of these * to be turned off. */ mergeFlags = MRG_TOP | MRG_LEFT; if (RIGHT(tile) >= area->r_xtop) mergeFlags |= MRG_RIGHT; if (BOTTOM(tile) <= area->r_ybot) mergeFlags |= MRG_BOTTOM; /* * The following is a kludge for plowing that should go away * once the plowing code gets stable. Make sure that the intermediate * coordinate of this tile is reset to "uninitialized". */ tile->ti_client = (ClientData) MINFINITY; /* * Determine new type of this tile. * Change the type if necessary. */ #ifdef NONMANHATTAN haschanged = FALSE; /* If the source tile is split, apply table to each side */ if (IsSplit(tile)) newType = resultTbl[SplitLeftType(tile)] | (resultTbl[SplitRightType(tile)] << 14) | (oldType & (TT_DIAGONAL | TT_DIRECTION | TT_SIDE)); else #endif newType = resultTbl[oldType]; if (oldType != newType) { /* * Clip the tile against the clipping rectangle. * Merging is only necessary if we clip to the left or to * the right, and then only to the top or the bottom. * We do the merge in-line for efficiency. */ /* Clip up */ if (TOP(tile) > area->r_ytop) { #ifdef NONMANHATTAN if (IsSplit(tile)) { haschanged = TiNMSplitY(&tile, &newtile, area->r_ytop, 1, undo); if (!IsSplit(tile)) { oldType = TiGetTypeExact(tile); newType = resultTbl[oldType]; } } else { #endif newtile = TiSplitY(tile, area->r_ytop); TiSetBody(newtile, TiGetBody(tile)); #ifdef NONMANHATTAN } #endif mergeFlags &= ~MRG_TOP; } #ifdef NONMANHATTAN /* Clipping diagonals can cause the new tile to no longer be */ /* in the search path! */ if (RIGHT(tile) <= area->r_xbot) goto paintdone; #endif /* Clip down */ if (BOTTOM(tile) < area->r_ybot) { #ifdef NONMANHATTAN if (IsSplit(tile)) { haschanged = TiNMSplitY(&tile, &newtile, area->r_ybot, 0, undo); if (!IsSplit(tile)) { oldType = TiGetTypeExact(tile); newType = resultTbl[oldType]; } } else { #endif newtile = tile, tile = TiSplitY(tile, area->r_ybot); TiSetBody(tile, TiGetBody(newtile)); #ifdef NONMANHATTAN } #endif mergeFlags &= ~MRG_BOTTOM; } #ifdef NONMANHATTAN /* Clipping diagonals can cause the new tile to no longer be */ /* in the search path! */ if (RIGHT(tile) <= area->r_xbot) goto paintdone; #endif /* Clip right */ if (RIGHT(tile) > area->r_xtop) { #ifdef NONMANHATTAN if (IsSplit(tile)) { haschanged = TiNMSplitX(&tile, &newtile, area->r_xtop, 1, undo); if (!IsSplit(tile)) { oldType = TiGetTypeExact(tile); newType = resultTbl[oldType]; } } else { #endif TISPLITX(newtile, tile, area->r_xtop); TiSetBody(newtile, TiGetBody(tile)); #ifdef NONMANHATTAN } #endif mergeFlags &= ~MRG_RIGHT; /* Merge the outside tile to its top */ tp = RT(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); /* Merge the outside tile to its bottom */ tp = LB(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); } #ifdef NONMANHATTAN /* Clipping diagonals can cause the new tile */ /* to no longer be in the search path! */ if (BOTTOM(tile) >= area->r_ytop) goto paintdone; #endif /* Clip left */ if (LEFT(tile) < area->r_xbot) { #ifdef NONMANHATTAN if (IsSplit(tile)) { haschanged = TiNMSplitX(&tile, &newtile, area->r_xbot, 0, undo); if (!IsSplit(tile)) { oldType = TiGetTypeExact(tile); newType = resultTbl[oldType]; } } else { #endif newtile = tile; TISPLITX(tile, tile, area->r_xbot); TiSetBody(tile, TiGetBody(newtile)); #ifdef NONMANHATTAN } #endif mergeFlags &= ~MRG_LEFT; /* Merge the outside tile to its top */ tp = RT(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); /* Merge the outside tile to its bottom */ tp = LB(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); } #ifdef NONMANHATTAN /* Clipping diagonals can cause the new tile */ /* to no longer be in the search path! */ if (BOTTOM(tile) >= area->r_ytop) goto paintdone; #endif #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "after clip"); #endif } #ifdef NONMANHATTAN if (newType & TT_DIAGONAL) { /* If left and right types of a diagonal tile are */ /* the same, revert back to a rectangular tile. */ if ((newType & TT_LEFTMASK) == ((newType & TT_RIGHTMASK) >> 14)) { newType &= TT_LEFTMASK; if (undo && UndoIsEnabled()) DBPAINTUNDO(tile, newType, undo); TiSetBody(tile, newType); mergeFlags = MRG_LEFT | MRG_RIGHT | MRG_TOP | MRG_BOTTOM; } else mergeFlags = 0; } #endif /* * Merge the tile back into the parts of the plane that have * already been visited. Note that if we clipped in a particular * direction we avoid merging in that direction. * * We avoid calling dbPaintMerge if at all possible. */ if (mergeFlags & MRG_LEFT) { for (tp = BL(tile); BOTTOM(tp) < TOP(tile); tp = RT(tp)) if (TiGetTypeExact(tp) == newType) { tile = dbPaintMerge(tile, newType, plane, mergeFlags, undo); goto paintdone; } mergeFlags &= ~MRG_LEFT; } if (mergeFlags & MRG_RIGHT) { for (tp = TR(tile); TOP(tp) > BOTTOM(tile); tp = LB(tp)) if (TiGetTypeExact(tp) == newType) { tile = dbPaintMerge(tile, newType, plane, mergeFlags, undo); goto paintdone; } mergeFlags &= ~MRG_RIGHT; } /* * Cheap and dirty merge -- we don't have to merge to the * left or right, so the top/bottom merge is very fast. * * Now it's safe to change the type of this tile, and * record the event on the undo list. */ #ifdef NONMANHATTAN if (undo && UndoIsEnabled()) if (haschanged || (oldType != newType)) #else if (undo && oldType != newType && UndoIsEnabled()) #endif DBPAINTUNDO(tile, newType, undo); TiSetBody(tile, newType); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "changed type"); #endif if (mergeFlags & MRG_TOP) { tp = RT(tile); if (CANMERGE_Y(tile, tp)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "merged up (CHEAP)"); #endif } if (mergeFlags & MRG_BOTTOM) { tp = LB(tile); if (CANMERGE_Y(tile, tp)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "merged down (CHEAP)"); #endif } /*** *** END OF PAINT CODE *** ---------- BACK TO AREA SEARCH ---------- ***/ paintdone: /* Move right if possible */ tpnew = TR(tile); if (LEFT(tpnew) < area->r_xtop) { /* Move back down into clipping area if necessary */ while (BOTTOM(tpnew) >= clipTop) tpnew = LB(tpnew); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto enumerate; } } /* Each iteration returns one tile further to the left */ while (LEFT(tile) > area->r_xbot) { /* Move left if necessary */ if (BOTTOM(tile) <= area->r_ybot) goto done; /* Move down if possible; left otherwise */ tpnew = LB(tile); tile = BL(tile); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto enumerate; } } /* At left edge -- walk down to next tile along the left edge */ for (tile = LB(tile); RIGHT(tile) <= area->r_xbot; tile = TR(tile)) /* Nothing */; } done: plane->pl_hint = tile; } /* * ---------------------------------------------------------------------------- * * DBPaintPlaneByProc -- * * Just like "DBPaintPlane", but it calls a client-supplied procedure to * compute the new tile type instead of looking it up in a table. * * See "DBPaintPlane" for more details on how this works. * * Results: * None. * * Side effects: * Modifies the database plane that contains the given tile. * * IMPLEMENTATION NOTES: * 1) This procedure is identical to "DBPaintPlane" except for the arguments * and the line marked "CHANGED". Be sure to keep the two procedures in * sync when updating code! * 2) Use of this function for non-manhattan geometry (NONMANHATTAN defined) * is superceded by DBNMPaintPlane(), as that function determines if * a diagonal is being painted, and may split the area to be painted * before calling DBPaintPlaneByProc() or DBPaintPlane() on each sub- * area, as required. * * REMINDER: * Callers should remember to set the CDMODIFIED and CDGETNEWSTAMP * bits in the cell definition containing the plane being painted. * * ---------------------------------------------------------------------------- */ Void DBPaintPlaneByProc(plane, area, proc, parg, undo) Plane *plane; /* Plane whose paint is to be modified */ register Rect *area; /* Area to be changed */ Void (*proc)(); /* Proc to determine new type of material. * This proc should be of the form: * * int * foo(oldtype, parg) * int oldtype; * Clientdata parg; * { * return int; * } * * Oldtype is the type of material that * is already there, and the proc should * return the type that is to replace it. * "parg" is used to pass other information * to the procedure. */ ClientData parg; PaintUndoInfo *undo; /* Record containing everything needed to * save undo entries for this operation. * If NULL, the undo package is not used. */ { Point start; int clipTop, mergeFlags; TileType oldType, newType; Tile *tile, *newtile; register Tile *tpnew; /* Used for area search */ register Tile *tp; /* Used for paint */ #ifdef NONMANHATTAN bool haschanged; #endif if (area->r_xtop <= area->r_xbot || area->r_ytop <= area->r_ybot) return; /* * The following is a modified version of the area enumeration * algorithm. It expects the in-line paint code below to leave * 'tile' pointing to the tile from which we should continue the * search. */ start.p_x = area->r_xbot; start.p_y = area->r_ytop - 1; tile = plane->pl_hint; GOTOPOINT(tile, &start); /* Each iteration visits another tile on the LHS of the search area */ while (TOP(tile) > area->r_ybot) { /*** *** AREA SEARCH. *** Each iteration enumerates another tile. ***/ enumerate: if (SigInterruptPending) break; clipTop = TOP(tile); if (clipTop > area->r_ytop) clipTop = area->r_ytop; oldType = TiGetTypeExact(tile); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "area enum"); #endif /*** *** ---------- THE FOLLOWING IS IN-LINE PAINT CODE ---------- ***/ /* * Set up the directions in which we will have to * merge initially. Clipping can cause some of these * to be turned off. */ mergeFlags = MRG_TOP | MRG_LEFT; if (RIGHT(tile) >= area->r_xtop) mergeFlags |= MRG_RIGHT; if (BOTTOM(tile) <= area->r_ybot) mergeFlags |= MRG_BOTTOM; /* * The following is a kludge for plowing that should go away * once the plowing code gets stable. Make sure that the intermediate * coordinate of this tile is reset to "uninitialized". */ tile->ti_client = (ClientData) MINFINITY; /* * Determine new type of this tile. * Change the type if necessary. */ #ifdef NONMANHATTAN haschanged = FALSE; #endif newType = (*proc)(oldType, parg); /* CHANGED */ if (oldType != newType) { /* * Clip the tile against the clipping rectangle. * Merging is only necessary if we clip to the left or to * the right, and then only to the top or the bottom. * We do the merge in-line for efficiency. */ /* Clip up */ if (TOP(tile) > area->r_ytop) { #ifdef NONMANHATTAN if (IsSplit(tile)) { haschanged = TiNMSplitY(&tile, &newtile, area->r_ytop, 1, undo); if (!IsSplit(tile)) { oldType = TiGetTypeExact(tile); newType = (*proc)(oldType, parg); } } else { #endif newtile = TiSplitY(tile, area->r_ytop); TiSetBody(newtile, TiGetBody(tile)); #ifdef NONMANHATTAN } #endif mergeFlags &= ~MRG_TOP; } #ifdef NONMANHATTAN /* Clipping diagonals can cause the new tile to no longer be */ /* in the search path! */ if (RIGHT(tile) <= area->r_xbot) goto paintdone; #endif /* Clip down */ if (BOTTOM(tile) < area->r_ybot) { #ifdef NONMANHATTAN if (IsSplit(tile)) { haschanged = TiNMSplitY(&tile, &newtile, area->r_ybot, 0, undo); if (!IsSplit(tile)) { oldType = TiGetTypeExact(tile); newType = (*proc)(oldType, parg); } } else { #endif newtile = tile, tile = TiSplitY(tile, area->r_ybot); TiSetBody(tile, TiGetBody(newtile)); #ifdef NONMANHATTAN } #endif mergeFlags &= ~MRG_BOTTOM; } #ifdef NONMANHATTAN /* Clipping diagonals can cause the new tile to no longer be */ /* in the search path! */ if (RIGHT(tile) <= area->r_xbot) goto paintdone; #endif /* Clip right */ if (RIGHT(tile) > area->r_xtop) { #ifdef NONMANHATTAN if (IsSplit(tile)) { haschanged = TiNMSplitX(&tile, &newtile, area->r_xtop, 1, undo); if (!IsSplit(tile)) { oldType = TiGetTypeExact(tile); newType = (*proc)(oldType, parg); } } else { #endif TISPLITX(newtile, tile, area->r_xtop); TiSetBody(newtile, TiGetBody(tile)); #ifdef NONMANHATTAN } #endif mergeFlags &= ~MRG_RIGHT; /* Merge the outside tile to its top */ tp = RT(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); /* Merge the outside tile to its bottom */ tp = LB(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); } #ifdef NONMANHATTAN /* Clipping diagonals can cause the new tile */ /* to no longer be in the search path! */ if (BOTTOM(tile) >= area->r_ytop) goto paintdone; #endif /* Clip left */ if (LEFT(tile) < area->r_xbot) { #ifdef NONMANHATTAN if (IsSplit(tile)) { haschanged = TiNMSplitX(&tile, &newtile, area->r_xbot, 0, undo); if (!IsSplit(tile)) { oldType = TiGetTypeExact(tile); newType = (*proc)(oldType, parg); } } else { #endif newtile = tile; TISPLITX(tile, tile, area->r_xbot); TiSetBody(tile, TiGetBody(newtile)); #ifdef NONMANHATTAN } #endif mergeFlags &= ~MRG_LEFT; /* Merge the outside tile to its top */ tp = RT(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); /* Merge the outside tile to its bottom */ tp = LB(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); } #ifdef NONMANHATTAN /* Clipping diagonals can cause the new tile */ /* to no longer be in the search path! */ if (BOTTOM(tile) >= area->r_ytop) goto paintdone; #endif #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "after clip"); #endif } #ifdef NONMANHATTAN if (newType & TT_DIAGONAL) { /* If left and right types of a diagonal tile are */ /* the same, revert back to a rectangular tile. */ if ((newType & TT_LEFTMASK) == ((newType & TT_RIGHTMASK) >> 14)) { newType &= TT_LEFTMASK; if (undo && UndoIsEnabled()) DBPAINTUNDO(tile, newType, undo); TiSetBody(tile, newType); mergeFlags = MRG_LEFT | MRG_RIGHT | MRG_TOP | MRG_BOTTOM; } else mergeFlags = 0; } #endif /* * Merge the tile back into the parts of the plane that have * already been visited. Note that if we clipped in a particular * direction we avoid merging in that direction. * * We avoid calling dbPaintMerge if at all possible. */ if (mergeFlags & MRG_LEFT) { for (tp = BL(tile); BOTTOM(tp) < TOP(tile); tp = RT(tp)) if (TiGetTypeExact(tp) == newType) { tile = dbPaintMerge(tile, newType, plane, mergeFlags, undo); goto paintdone; } mergeFlags &= ~MRG_LEFT; } if (mergeFlags & MRG_RIGHT) { for (tp = TR(tile); TOP(tp) > BOTTOM(tile); tp = LB(tp)) if (TiGetTypeExact(tp) == newType) { tile = dbPaintMerge(tile, newType, plane, mergeFlags, undo); goto paintdone; } mergeFlags &= ~MRG_RIGHT; } /* * Cheap and dirty merge -- we don't have to merge to the * left or right, so the top/bottom merge is very fast. * * Now it's safe to change the type of this tile, and * record the event on the undo list. */ #ifdef NONMANHATTAN if (undo && UndoIsEnabled()) if (haschanged || (oldType != newType)) #else if (undo && oldType != newType && UndoIsEnabled()) #endif DBPAINTUNDO(tile, newType, undo); TiSetBody(tile, newType); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "changed type"); #endif if (mergeFlags & MRG_TOP) { tp = RT(tile); if (CANMERGE_Y(tile, tp)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "merged up (CHEAP)"); #endif } if (mergeFlags & MRG_BOTTOM) { tp = LB(tile); if (CANMERGE_Y(tile, tp)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "merged down (CHEAP)"); #endif } /*** *** END OF PAINT CODE *** ---------- BACK TO AREA SEARCH ---------- ***/ paintdone: /* Move right if possible */ tpnew = TR(tile); if (LEFT(tpnew) < area->r_xtop) { /* Move back down into clipping area if necessary */ while (BOTTOM(tpnew) >= clipTop) tpnew = LB(tpnew); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto enumerate; } } /* Each iteration returns one tile further to the left */ while (LEFT(tile) > area->r_xbot) { /* Move left if necessary */ if (BOTTOM(tile) <= area->r_ybot) goto done; /* Move down if possible; left otherwise */ tpnew = LB(tile); tile = BL(tile); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto enumerate; } } /* At left edge -- walk down to next tile along the left edge */ for (tile = LB(tile); RIGHT(tile) <= area->r_xbot; tile = TR(tile)) /* Nothing */; } done: plane->pl_hint = tile; } #ifdef NONMANHATTAN /* * ---------------------------------------------------------------------------- * * DBFracturePlane -- * * This routine fractures the plane around the given area, splitting * existing tiles which cross the area boundary. After fracturing, * it merges tiles where possible inside and outside the area boundary, * but retains the boundary. This boundary will be used by DBNMPaintPlane * to paint a non-manhattan diagonally split tile. This routine does no * painting, except where sub-splitting diagonal tiles requires a change * in tile type. * * Results: * Returns TRUE if any tiles inside the area were cut. * * Side effects: * Modifies the database plane that contains the given tile. * * ---------------------------------------------------------------------------- */ bool DBFracturePlane(plane, area, undo) Plane *plane; /* Plane whose paint is to be modified */ register Rect *area; /* Area to be changed */ PaintUndoInfo *undo; /* Record containing everything needed to * save undo entries for this operation. * If NULL, the undo package is not used. */ { Point start; int clipTop, mergeFlags = 0; TileType oldType; Tile *tile, *newtile; register Tile *tpnew; /* Used for area search */ register Tile *tp; /* Used for paint */ if (area->r_xtop <= area->r_xbot || area->r_ytop <= area->r_ybot) return FALSE; /* * The following is a modified version of the area enumeration * algorithm. It expects the in-line paint code below to leave * 'tile' pointing to the tile from which we should continue the * search. */ start.p_x = area->r_xbot; start.p_y = area->r_ytop - 1; tile = plane->pl_hint; GOTOPOINT(tile, &start); /* Each iteration visits another tile on the LHS of the search area */ while (TOP(tile) > area->r_ybot) { /*** *** AREA SEARCH. *** Each iteration enumerates another tile. ***/ enumerate: if (SigInterruptPending) break; clipTop = TOP(tile); if (clipTop > area->r_ytop) clipTop = area->r_ytop; oldType = TiGetTypeExact(tile); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "area enum"); #endif /*** *** ---------- THE FOLLOWING IS IN-LINE PAINT CODE ---------- ***/ if (RIGHT(tile) < area->r_xtop) mergeFlags |= MRG_RIGHT; if (BOTTOM(tile) > area->r_ybot) mergeFlags |= MRG_BOTTOM; if (LEFT(tile) > area->r_xbot) mergeFlags |= MRG_LEFT; if (TOP(tile) < area->r_ytop) mergeFlags |= MRG_TOP; /* * Clip the tile against the clipping rectangle. * Merging is only necessary if we clip to the left or to * the right, and then only to the top or the bottom. * We do the merge in-line for efficiency. */ /* Clip up */ if (TOP(tile) > area->r_ytop) { if (IsSplit(tile)) { TiNMSplitY(&tile, &newtile, area->r_ytop, 1, undo); if (!IsSplit(tile)) oldType = TiGetTypeExact(tile); } else { newtile = TiSplitY(tile, area->r_ytop); TiSetBody(newtile, TiGetBody(tile)); } } /* Clipping diagonals can cause the new tile to no longer be */ /* in the search path! */ if (RIGHT(tile) <= area->r_xbot) goto paintdone; /* Clip down */ if (BOTTOM(tile) < area->r_ybot) { if (IsSplit(tile)) { TiNMSplitY(&tile, &newtile, area->r_ybot, 0, undo); if (!IsSplit(tile)) oldType = TiGetTypeExact(tile); } else { newtile = tile, tile = TiSplitY(tile, area->r_ybot); TiSetBody(tile, TiGetBody(newtile)); } } /* Clipping diagonals can cause the new tile to no longer be */ /* in the search path! */ if (RIGHT(tile) <= area->r_xbot) goto paintdone; /* Clip right */ if (RIGHT(tile) > area->r_xtop) { if (IsSplit(tile)) { TiNMSplitX(&tile, &newtile, area->r_xtop, 1, undo); if (!IsSplit(tile)) oldType = TiGetTypeExact(tile); } else { TISPLITX(newtile, tile, area->r_xtop); TiSetBody(newtile, TiGetBody(tile)); } /* Merge the outside tile to its top */ tp = RT(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); /* Merge the outside tile to its bottom */ tp = LB(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); } /* Clipping diagonals can cause the new tile */ /* to no longer be in the search path! */ if (BOTTOM(tile) >= area->r_ytop) goto paintdone; /* Clip left */ if (LEFT(tile) < area->r_xbot) { if (IsSplit(tile)) { TiNMSplitX(&tile, &newtile, area->r_xbot, 0, undo); if (!IsSplit(tile)) oldType = TiGetTypeExact(tile); } else { newtile = tile; TISPLITX(tile, tile, area->r_xbot); TiSetBody(tile, TiGetBody(newtile)); } /* Merge the outside tile to its top */ tp = RT(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); /* Merge the outside tile to its bottom */ tp = LB(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); } /* Clipping diagonals can cause the new tile */ /* to no longer be in the search path! */ if (BOTTOM(tile) >= area->r_ytop) goto paintdone; #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "after clip"); #endif /* * Merge the tile back into the parts of the plane that have * already been visited. Note that if we clipped in a particular * direction we avoid merging in that direction. * * We avoid calling dbPaintMerge if at all possible. */ if (mergeFlags & MRG_LEFT) { for (tp = BL(tile); BOTTOM(tp) < TOP(tile); tp = RT(tp)) if (TiGetTypeExact(tp) == oldType) { tile = dbPaintMerge(tile, oldType, plane, mergeFlags, undo); goto paintdone; } mergeFlags &= ~MRG_LEFT; } if (mergeFlags & MRG_RIGHT) { for (tp = TR(tile); TOP(tp) > BOTTOM(tile); tp = LB(tp)) if (TiGetTypeExact(tp) == oldType) { tile = dbPaintMerge(tile, oldType, plane, mergeFlags, undo); goto paintdone; } mergeFlags &= ~MRG_RIGHT; } /* * Cheap and dirty merge -- we don't have to merge to the * left or right, so the top/bottom merge is very fast. * */ if (mergeFlags & MRG_TOP) { tp = RT(tile); if (CANMERGE_Y(tile, tp)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "merged up (CHEAP)"); #endif } if (mergeFlags & MRG_BOTTOM) { tp = LB(tile); if (CANMERGE_Y(tile, tp)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "merged down (CHEAP)"); #endif } /*** *** END OF PAINT CODE *** ---------- BACK TO AREA SEARCH ---------- ***/ paintdone: /* Move right if possible */ tpnew = TR(tile); if (LEFT(tpnew) < area->r_xtop) { /* Move back down into clipping area if necessary */ while (BOTTOM(tpnew) >= clipTop) tpnew = LB(tpnew); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto enumerate; } } /* Each iteration returns one tile further to the left */ while (LEFT(tile) > area->r_xbot) { /* Move left if necessary */ if (BOTTOM(tile) <= area->r_ybot) goto done; /* Move down if possible; left otherwise */ tpnew = LB(tile); tile = BL(tile); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto enumerate; } } /* At left edge -- walk down to next tile along the left edge */ for (tile = LB(tile); RIGHT(tile) <= area->r_xbot; tile = TR(tile)) /* Nothing */; } done: plane->pl_hint = tile; } /* * ---------------------------------------------------------------------------- * DBDiagonalProc(type) -- * * Return the result type of a diagonal tile painted on oldtype; * Argument "cdata", gives direction and side of diagonal, and the * paint result table for the given diagonal side. * * This routine will be called separately for each side of the * diagonal, if necessary. * * This routine is called only from DBPaintPlaneByProc(), which itself * is called only from DBNMPaintPlane(). * * Results: * Returns the new type to be painted. * * Side Effects: * None. * ---------------------------------------------------------------------------- */ int DBDiagonalProc(oldtype, cdata) int oldtype; ClientData cdata; { int newtype; DiagInfo *dinfo = (DiagInfo *)cdata; PaintResultType *resultTbl = dinfo->resultTbl; if (oldtype & TT_DIAGONAL) { if (dinfo->side == 0) newtype = (resultTbl[oldtype & TT_LEFTMASK]) | (oldtype & TT_RIGHTMASK); else newtype = (resultTbl[(oldtype & TT_RIGHTMASK) >> 14] << 14) | (oldtype & TT_LEFTMASK); } else { newtype = (dinfo->side == 0) ? resultTbl[oldtype] : (resultTbl[oldtype] << 14); /* Preserve oldtype on the side not painted */ newtype |= (dinfo->side == 0) ? oldtype << 14 : oldtype; } /* For purposes of the undo command, record which side we just painted */ if (dinfo->side) newtype |= TT_SIDE; if (dinfo->dir) newtype |= TT_DIRECTION; return newtype | TT_DIAGONAL; } /* * ---------------------------------------------------------------------------- * * DBNMPaintPlane -- * * Non-Manhattan PaintPlane function (wrapper for DBPaintPlane and * DBPaintPlaneByProc) * * Due to the intricacies of painting diagonals, it is necessary to * perform a search on the area to paint and return a list of sub-areas * matching the tiles underneath. The sub-areas are checked against the * diagonal and further subdivided as necessary to prevent attempts to * paint quadrangular (clipped triangle) areas. * * Results: * None. * * Side Effects: * Plane is painted with a diagonal. The plane may be hacked up * to deal with the numerous situations involved in painting * diagonal tiles and/or painting on diagonal tiles. * * ---------------------------------------------------------------------------- */ Void DBNMPaintPlane(plane, exacttype, area, resultTbl, undo) Plane *plane; /* Plane whose paint is to be modified */ TileType exacttype; /* diagonal info for tile to be changed */ register Rect *area; /* Area to be changed */ PaintResultType *resultTbl; /* Table, indexed by the type of tile already * present in the plane, giving the type to * which the existing tile must change as a * result of this paint operation. */ PaintUndoInfo *undo; /* Record containing everything needed to * save undo entries for this operation. * If NULL, the undo package is not used. */ #define RES_LEFT 0 /* Result is rect to left of diagonal */ #define RES_DIAG 1 /* Resulting rectangle is on diagonal */ #define RES_RIGHT 2 /* Result is rect to right of diagonal */ { DiagInfo dinfo; LinkedRect *lhead, *lr, *newlr; int xc, yc, width, height, xref, yref; int resstate; if (exacttype & TT_DIAGONAL) { int dbNMEnumFunc(); /* Forward reference */ dinfo.resultTbl = resultTbl; dinfo.dir = (exacttype & TT_DIRECTION) ? 1 : 0; dinfo.side = (exacttype & TT_SIDE) ? 1 : 0; height = area->r_ytop - area->r_ybot; width = area->r_xtop - area->r_xbot; /* Break the plane up around the specified boundary */ DBFracturePlane(plane, area, undo); /* Find all tiles under the area to paint, and make a */ /* linked list out of them. */ lhead = NULL; (void) DBSrPaintArea((Tile *) NULL, plane, area, &DBAllTypeBits, dbNMEnumFunc, (ClientData) &lhead); /*--------------------------------------------------------*/ /* If there's only one tile underneath, we can just paint */ /* it with the diagonal. Otherwise, we subsplit the area */ /* and call this routine recursively until the area does */ /* not fracture any further. */ /*--------------------------------------------------------*/ lr = lhead; if (lr != NULL) if (lhead->r_next == NULL) { GeoClip(&lhead->r_r, area); DBPaintPlaneByProc(plane, &lhead->r_r, (Void *)DBDiagonalProc, (ClientData) &dinfo, undo); freeMagic((char *) lr); return; } /*------------------------------------------------------*/ /* Further subdivide the rects so that every rect is */ /* either a (non-clipped) triangle or a rectangle. */ /* Call DBPaintPlaneByProc() on triangular areas, and */ /* DBPaintPlane() on rectangular areas. Reject areas */ /* which contain no paint. */ /*------------------------------------------------------*/ while (lr != NULL) { resstate = RES_DIAG; /* Clip to area: DBFracturePlane() is supposed to do this, */ /* but I need to fix it. Currently it can still merge */ /* across the fracture boundary. */ GeoClip(&lr->r_r, area); /* Split off left */ yref = width * ((dinfo.dir) ? lr->r_r.r_ytop - area->r_ytop : lr->r_r.r_ybot - area->r_ybot); xc = (((yref % height) << 1) >= height) ? 1 : 0; /* round */ if (dinfo.dir) yref = -yref; xc += area->r_xbot + yref / height; if (xc > lr->r_r.r_xbot && xc < lr->r_r.r_xtop) { newlr = (LinkedRect *) mallocMagic(sizeof(LinkedRect)); newlr->r_r.r_xtop = lr->r_r.r_xtop; newlr->r_r.r_xbot = xc; newlr->r_r.r_ybot = lr->r_r.r_ybot; newlr->r_r.r_ytop = lr->r_r.r_ytop; newlr->r_next = lr->r_next; lr->r_r.r_xtop = xc; lr->r_next = newlr; resstate = RES_LEFT; } else if (xc >= lr->r_r.r_xtop) { if (dinfo.side == 0) resstate = RES_LEFT; else goto nextrect; } if (resstate != RES_DIAG) goto paintrect; /* Split off right */ yref = width * ((dinfo.dir) ? lr->r_r.r_ybot - area->r_ytop : lr->r_r.r_ytop - area->r_ybot); xc = (((yref % height) << 1) >= height) ? 1 : 0; /* round */ if (dinfo.dir) yref = -yref; xc += area->r_xbot + yref / height; if (xc > lr->r_r.r_xbot && xc < lr->r_r.r_xtop) { newlr = (LinkedRect *) mallocMagic(sizeof(LinkedRect)); newlr->r_r.r_xtop = xc; newlr->r_r.r_xbot = lr->r_r.r_xbot; newlr->r_r.r_ybot = lr->r_r.r_ybot; newlr->r_r.r_ytop = lr->r_r.r_ytop; newlr->r_next = lr->r_next; lr->r_r.r_xbot = xc; lr->r_next = newlr; resstate = RES_RIGHT; } else if (xc <= lr->r_r.r_xbot) { if (dinfo.side == 1) resstate = RES_RIGHT; else goto nextrect; } if (resstate != RES_DIAG) goto paintrect; /* Split off top */ xref = height * ((dinfo.dir) ? lr->r_r.r_xbot - area->r_xtop : lr->r_r.r_xtop - area->r_xbot); yc = (((xref % width) << 1) >= width) ? 1 : 0; /* round */ if (dinfo.dir) xref = -xref; yc += area->r_ybot + xref / width; if (yc > lr->r_r.r_ybot && yc < lr->r_r.r_ytop) { newlr = (LinkedRect *) mallocMagic(sizeof(LinkedRect)); newlr->r_r.r_xbot = lr->r_r.r_xbot; newlr->r_r.r_xtop = lr->r_r.r_xtop; newlr->r_r.r_ytop = yc; newlr->r_r.r_ybot = lr->r_r.r_ybot; newlr->r_next = lr->r_next; lr->r_r.r_ybot = yc; lr->r_next = newlr; resstate = (dinfo.dir) ? RES_RIGHT : RES_LEFT; } else if (yc <= lr->r_r.r_ybot) { if (dinfo.side == dinfo.dir) resstate = (dinfo.side) ? RES_RIGHT : RES_LEFT; else goto nextrect; } if (resstate != RES_DIAG) goto paintrect; /* Split off bottom */ xref = height * ((dinfo.dir) ? lr->r_r.r_xtop - area->r_xtop : lr->r_r.r_xbot - area->r_xbot); yc = (((xref % width) << 1) >= width) ? 1 : 0; if (dinfo.dir) xref = -xref; yc += area->r_ybot + xref / width; if (yc > lr->r_r.r_ybot && yc < lr->r_r.r_ytop) { newlr = (LinkedRect *) mallocMagic(sizeof(LinkedRect)); newlr->r_r.r_xbot = lr->r_r.r_xbot; newlr->r_r.r_xtop = lr->r_r.r_xtop; newlr->r_r.r_ytop = lr->r_r.r_ytop; newlr->r_r.r_ybot = yc; newlr->r_next = lr->r_next; lr->r_r.r_ytop = yc; lr->r_next = newlr; resstate = (dinfo.dir) ? RES_LEFT : RES_RIGHT; } else if (yc >= lr->r_r.r_ytop) { if (dinfo.side != dinfo.dir) resstate = (dinfo.side) ? RES_RIGHT : RES_LEFT; else goto nextrect; } paintrect: if (resstate == RES_DIAG) { /* Recursive call to self on sub-area */ DBNMPaintPlane(plane, exacttype, &(lr->r_r), resultTbl, undo); } else if ((resstate == RES_LEFT && !dinfo.side) || (resstate == RES_RIGHT && dinfo.side)) { DBPaintPlane(plane, &(lr->r_r), resultTbl, undo); } /* else: rectangle does not contain type and should be ignored. */ nextrect: lr = lr->r_next; } lr = lhead; while (lr != NULL) { freeMagic((char *) lr); lr = lr->r_next; } } else DBPaintPlane(plane, area, resultTbl, undo); } int dbNMEnumFunc(tile, arg) Tile *tile; LinkedRect **arg; { LinkedRect *lr; /* Ignore the second call to any diagonal---only count once! */ if (IsSplit(tile) && SplitSide(tile)) return 0; lr = (LinkedRect *) mallocMagic(sizeof(LinkedRect)); TiToRect(tile, &lr->r_r); lr->r_next = (*arg); (*arg) = lr; return 0; } #endif /* * ---------------------------------------------------------------------------- * * DBPaintPlaneMergeOnce -- * * Paint a rectangular area ('area') on a single tile plane ('plane'). * This is identical to DBPaintPlane(), except that we work in two * passes: * * Pass 1: clip all tiles to lie inside the area to be painted, * merging all outside tiles as required. Change the * types of each of these internal tiles. * * Pass 2: re split and merge to insure that the database is * once again in maximal horizontal strips. * * See DBPaintPlane for other comments. * * Results: * None. * * Side effects: * Modifies the database plane that contains the given tile. * * ---------------------------------------------------------------------------- */ /* Currently, the non-manhattan version is non-functional, other than */ /* to declare the proper parameters to match DBNMPaintPlane(). The */ /* non-manhattan functionality will need to be added for proper DRC */ /* checking of non-manhattan geometry. */ #ifdef NONMANHATTAN Void DBPaintPlaneMergeOnce(plane, exacttype, area, resultTbl, undo) Plane *plane; /* Plane whose paint is to be modified */ TileType exacttype; /* Source tile type, including diagonal info */ register Rect *area; /* Area to be changed */ PaintResultType *resultTbl; /* Table, indexed by the type of tile already * present in the plane, giving the type to * which the existing tile must change as a * result of this paint operation. */ PaintUndoInfo *undo; /* Record containing everything needed to * save undo entries for this operation. * If NULL, the undo package is not used. */ #else Void DBPaintPlaneMergeOnce(plane, area, resultTbl, undo) Plane *plane; /* Plane whose paint is to be modified */ register Rect *area; /* Area to be changed */ PaintResultType *resultTbl; /* Table, indexed by the type of tile already * present in the plane, giving the type to * which the existing tile must change as a * result of this paint operation. */ PaintUndoInfo *undo; /* Record containing everything needed to * save undo entries for this operation. * If NULL, the undo package is not used. */ #endif { Point start; int clipTop, mergeFlags; TileType oldType, newType; Tile *tile, *newtile; register Tile *tpnew; /* Used for area search */ register Tile *tp; /* Used for paint */ if (area->r_xtop <= area->r_xbot || area->r_ytop <= area->r_ybot) return; /* * The following is a modified version of the area enumeration * algorithm. It expects the in-line paint code below to leave * 'tile' pointing to the tile from which we should continue the * search. */ start.p_x = area->r_xbot; start.p_y = area->r_ytop - 1; tile = plane->pl_hint; GOTOPOINT(tile, &start); /* Each iteration visits another tile on the LHS of the search area */ while (TOP(tile) > area->r_ybot) { /*** *** AREA SEARCH. *** Each iteration enumerates another tile. ***/ enumerate: if (SigInterruptPending) break; clipTop = TOP(tile); if (clipTop > area->r_ytop) clipTop = area->r_ytop; oldType = TiGetTypeExact(tile); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "first area enum"); #endif /*** *** ---------- THE FOLLOWING IS IN-LINE PAINT CODE ---------- ***/ /* * Determine new type of this tile. * Change the type if necessary. */ newType = resultTbl[oldType]; if (oldType != newType) { /* * Clip the tile against the clipping rectangle. * Merging of the outside tiles is only necessary if we clip * to the left or to the right, and then only to the top or * the bottom. We do the merge in-line for efficiency. */ /* Clip up */ if (TOP(tile) > area->r_ytop) { newtile = TiSplitY(tile, area->r_ytop); TiSetBody(newtile, TiGetBody(tile)); } /* Clip down */ if (BOTTOM(tile) < area->r_ybot) { newtile = tile, tile = TiSplitY(tile, area->r_ybot); TiSetBody(tile, TiGetBody(newtile)); } /* Clip right */ if (RIGHT(tile) > area->r_xtop) { TISPLITX(newtile, tile, area->r_xtop); TiSetBody(newtile, TiGetBody(tile)); /* Merge the outside tile to its top */ tp = RT(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); /* Merge the outside tile to its bottom */ tp = LB(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); } /* Clip left */ if (LEFT(tile) < area->r_xbot) { newtile = tile; TISPLITX(tile, tile, area->r_xbot); TiSetBody(tile, TiGetBody(newtile)); /* Merge the outside tile to its top */ tp = RT(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); /* Merge the outside tile to its bottom */ tp = LB(newtile); if (CANMERGE_Y(newtile, tp)) TiJoinY(newtile, tp, plane); } #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "after clip"); #endif /* Record the type of the new tile */ if (undo && UndoIsEnabled()) DBPAINTUNDO(tile, newType, undo); TiSetBody(tile, newType); } paintdone: /*** *** END OF PAINT CODE *** ---------- BACK TO AREA SEARCH ---------- ***/ /* Move right if possible */ tpnew = TR(tile); if (LEFT(tpnew) < area->r_xtop) { /* Move back down into clipping area if necessary */ while (BOTTOM(tpnew) >= clipTop) tpnew = LB(tpnew); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto enumerate; } } /* Each iteration returns one tile further to the left */ while (LEFT(tile) > area->r_xbot) { /* Move left if necessary */ if (BOTTOM(tile) <= area->r_ybot) goto changedone; /* Move down if possible; left otherwise */ tpnew = LB(tile); tile = BL(tile); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto enumerate; } } /* At left edge -- walk down to next tile along the left edge */ for (tile = LB(tile); RIGHT(tile) <= area->r_xbot; tile = TR(tile)) /* Nothing */; } changedone: /* * Done with the area enumeration to change the types of all tiles * in this area. Now go back and re-merge everything to form * maximal horizontal strips. The following is another in-line * version of area enumeration, but is non-interruptible. */ GOTOPOINT(tile, &start); /* Each iteration visits another tile on the LHS of the search area */ while (TOP(tile) > area->r_ybot) { /*** *** AREA SEARCH. *** Each iteration enumerates another tile. ***/ mergenum: clipTop = TOP(tile); if (clipTop > area->r_ytop) clipTop = area->r_ytop; oldType = TiGetTypeExact(tile); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "merge area enum"); #endif /*** *** ---------- THE FOLLOWING IS IN-LINE MERGE CODE ---------- ***/ /* Set up initial merge directions */ mergeFlags = MRG_TOP | MRG_LEFT; if (RIGHT(tile) >= area->r_xtop) mergeFlags |= MRG_RIGHT; if (BOTTOM(tile) <= area->r_ybot) mergeFlags |= MRG_BOTTOM; /* * Merge the tile back into the parts of the plane that have * already been visited. Note that if we clipped in a particular * direction we avoid merging in that direction. * We avoid calling dbPaintMerge if at all possible. */ newType = TiGetTypeExact(tile); if (mergeFlags & MRG_LEFT) { for (tp = BL(tile); BOTTOM(tp) < TOP(tile); tp = RT(tp)) if (TiGetTypeExact(tp) == newType) { tile = dbPaintMerge(tile, newType, plane, mergeFlags, (PaintUndoInfo *) NULL); goto mergedone; } mergeFlags &= ~MRG_LEFT; } if (mergeFlags & MRG_RIGHT) { for (tp = TR(tile); TOP(tp) > BOTTOM(tile); tp = LB(tp)) if (TiGetTypeExact(tp) == newType) { tile = dbPaintMerge(tile, newType, plane, mergeFlags, (PaintUndoInfo *) NULL); goto mergedone; } mergeFlags &= ~MRG_RIGHT; } /* * Cheap and dirty merge -- we don't have to merge to the * left or right, so the top/bottom merge is very fast. */ if (mergeFlags & MRG_TOP) { tp = RT(tile); if (CANMERGE_Y(tile, tp)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "merged up (CHEAP)"); #endif } if (mergeFlags & MRG_BOTTOM) { tp = LB(tile); if (CANMERGE_Y(tile, tp)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "merged down (CHEAP)"); #endif } /*** *** END OF MERGE CODE *** ---------- BACK TO AREA SEARCH ---------- ***/ mergedone: /* Move right if possible */ tpnew = TR(tile); if (LEFT(tpnew) < area->r_xtop) { /* Move back down into clipping area if necessary */ while (BOTTOM(tpnew) >= clipTop) tpnew = LB(tpnew); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto mergenum; } } /* Each iteration returns one tile further to the left */ while (LEFT(tile) > area->r_xbot) { /* Move left if necessary */ if (BOTTOM(tile) <= area->r_ybot) goto done; /* Move down if possible; left otherwise */ tpnew = LB(tile); tile = BL(tile); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto mergenum; } } /* At left edge -- walk down to next tile along the left edge */ for (tile = LB(tile); RIGHT(tile) <= area->r_xbot; tile = TR(tile)) /* Nothing */; } done: plane->pl_hint = tile; } /* * ---------------------------------------------------------------------------- * * dbPaintMerge -- * * The tile 'tp' is to be changed to type 'newtype'. To maintain * maximal horizontal strips, it may be necessary to merge the new * 'tp' with its neighbors. * * This procedure splits off the biggest segment along the top of the * tile 'tp' that can be merged with its neighbors to the left and right * (depending on which of MRG_LEFT and MRG_RIGHT are set in the merge flags), * then changes the type of 'tp' to 'newtype' and merges to the left, right, * top, and bottom (in that order). * * Results: * Returns a pointer to the topmost tile resulting from any splits * and merges of the original tile 'tp'. By the maximal horizontal * strip property and the fact that the original tile 'tp' gets * painted a single color, we know that this topmost resulting tile * extends across the entire top of the area occupied by 'tp'. * * NOTE: the only tile whose type is changed is 'tp'. Any tiles * resulting from splits below this tile will not have had their * types changed. * * Side effects: * Modifies the database plane that contains the given tile. * * THIS IS SLOW, SO SHOULD BE AVOIDED IF AT ALL POSSIBLE. * THE CODE ABOVE GOES TO GREAT LENGTHS TO DO SO. * * ---------------------------------------------------------------------------- */ Tile * dbPaintMerge(tile, newType, plane, mergeFlags, undo) register Tile *tile; /* Tile to be merged with its neighbors */ register TileType newType; /* Type to which we will change 'tile' */ Plane *plane; /* Plane on which this resides */ int mergeFlags; /* Specify which directions to merge */ PaintUndoInfo *undo; /* See DBPaintPlane() above */ { register Tile *tp, *tpLast; register int ysplit; ysplit = BOTTOM(tile); if (mergeFlags & MRG_LEFT) { /* * Find the split point along the LHS of tile. * If the topmost tile 'tp' along the LHS is of type 'newType' * the split point will be no lower than the bottom of 'tp'. * If the topmost tile is NOT of type 'newType', then the split * point will be no lower than the top of the first tile along * the LHS that is of type 'newType'. */ for (tpLast = NULL, tp = BL(tile); BOTTOM(tp) < TOP(tile); tp = RT(tp)) if (TiGetTypeExact(tp) == newType) tpLast = tp; /* If the topmost LHS tile is not of type 'newType', we don't merge */ if (tpLast == NULL || TOP(tpLast) < TOP(tile)) { mergeFlags &= ~MRG_LEFT; if (tpLast && TOP(tpLast) > ysplit) ysplit = TOP(tpLast); } else if (BOTTOM(tpLast) > ysplit) ysplit = BOTTOM(tpLast); } if (mergeFlags & MRG_RIGHT) { /* * Find the split point along the RHS of 'tile'. * If the topmost tile 'tp' along the RHS is of type 'newType' * the split point will be no lower than the bottom of 'tp'. * If the topmost tile is NOT of type 'newType', then the split * point will be no lower than the top of the first tile along * the RHS that is of type 'newType'. */ tp = TR(tile); if (TiGetTypeExact(tp) == newType) { if (BOTTOM(tp) > ysplit) ysplit = BOTTOM(tp); } else { /* Topmost RHS tile is not of type 'newType', so don't merge */ do tp = LB(tp); while (TiGetTypeExact(tp) != newType && TOP(tp) > ysplit); if (TOP(tp) > ysplit) ysplit = TOP(tp); mergeFlags &= ~MRG_RIGHT; } } /* * If 'tile' must be split horizontally, do so. * Any merging to the bottom will be delayed until the split-off * bottom tile is processed on a subsequent iteration of the area * enumeration loop in DBPaintPlane(). */ if (ysplit > BOTTOM(tile)) { mergeFlags &= ~MRG_BOTTOM; tp = TiSplitY(tile, ysplit); TiSetBody(tp, TiGetTypeExact(tile)); tile = tp; #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) after split"); #endif } /* * Set the type of the new tile. * Record any undo information. */ if (undo && TiGetTypeExact(tile) != newType && UndoIsEnabled()) DBPAINTUNDO(tile, newType, undo); TiSetBody(tile, newType); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) changed type"); #endif /* * Do the merging. * We are guaranteed that at most one tile abuts 'tile' on * any side that we will merge to, and that this tile is * of type 'newType'. */ if (mergeFlags & MRG_LEFT) { tp = BL(tile); if (TOP(tp) > TOP(tile)) tpLast = TiSplitY(tp, TOP(tile)), TiSetBody(tpLast, newType); if (BOTTOM(tp) < BOTTOM(tile)) tp = TiSplitY(tp, BOTTOM(tile)); TiJoinX(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) merged left"); #endif } if (mergeFlags & MRG_RIGHT) { tp = TR(tile); if (TOP(tp) > TOP(tile)) tpLast = TiSplitY(tp, TOP(tile)), TiSetBody(tpLast, newType); if (BOTTOM(tp) < BOTTOM(tile)) tp = TiSplitY(tp, BOTTOM(tile)); TiJoinX(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) merged right"); #endif } if (mergeFlags&MRG_TOP) { tp = RT(tile); if (CANMERGE_Y(tp, tile)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) merged up"); #endif } if (mergeFlags&MRG_BOTTOM) { tp = LB(tile); if (CANMERGE_Y(tp, tile)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) merged down"); #endif } return (tile); } /* * ---------------------------------------------------------------------------- * * DBPaintType -- * * Paint a rectangular area ('area') of type ('newType') on plane ('plane'). * Merge only with neighbors of the same type and client data. * * If undo is desired, 'undo' should point to a PaintUndoInfo struct * that contains everything needed to build an undo record. Otherwise, * 'undo' can be NULL. * * Results: * None. * * Side effects: * Modifies the database plane that contains the given tile. * * REMINDER: * Callers should remember to set the CDMODIFIED and CDGETNEWSTAMP * bits in the cell definition containing the plane being painted. * * ---------------------------------------------------------------------------- */ Void DBPaintType(plane, area, resultTbl, client, undo, tileMask) Plane *plane; /* Plane whose paint is to be modified */ register Rect *area; /* Area to be changed */ PaintResultType *resultTbl; /* Table, indexed by the type of tile already * present in the plane, giving the type to * which the existing tile must change as a * result of this paint operation. */ ClientData client; /* ClientData for tile */ PaintUndoInfo *undo; /* Record containing everything needed to * save undo entries for this operation. * If NULL, the undo package is not used. */ TileTypeBitMask *tileMask; /* Mask of un-mergable tile types */ { Point start; int clipTop, mergeFlags; TileType oldType; register Tile *tile, *tpnew; /* Used for area search */ register Tile *newtile, *tp; /* Used for paint */ TileType newType; /* Type of new tile to be painted */ if (area->r_xtop <= area->r_xbot || area->r_ytop <= area->r_ybot) return; /* * The following is a modified version of the area enumeration * algorithm. It expects the in-line paint code below to leave * 'tile' pointing to the tile from which we should continue the * search. */ start.p_x = area->r_xbot; start.p_y = area->r_ytop - 1; tile = plane->pl_hint; GOTOPOINT(tile, &start); /* Each iteration visits another tile on the LHS of the search area */ while (TOP(tile) > area->r_ybot) { /*** *** AREA SEARCH. *** Each iteration enumerates another tile. ***/ enumerate: clipTop = TOP(tile); if (clipTop > area->r_ytop) clipTop = area->r_ytop; #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "area enum"); #endif /*** *** ---------- THE FOLLOWING IS IN-LINE PAINT CODE ---------- ***/ /* * Set up the directions in which we will have to * merge initially. Clipping can cause some of these * to be turned off. */ mergeFlags = MRG_TOP | MRG_LEFT; if (RIGHT(tile) >= area->r_xtop) mergeFlags |= MRG_RIGHT; if (BOTTOM(tile) <= area->r_ybot) mergeFlags |= MRG_BOTTOM; /* * Map tile types using the *resultTbl* table. * If the client field of the existing tile differs * from the given client, ignore the type of the existing * tile and treat as painting over space. */ oldType = TiGetTypeExact(tile); if ( TiGetClient(tile) == client ) newType = resultTbl[oldType]; else { if ( oldType != TT_SPACE ) /*DEBUG*/ TxPrintf("Overwrite tile type %d\n",oldType); newType = resultTbl[TT_SPACE]; } if (oldType != newType) { /* * Clip the tile against the clipping rectangle. * Merging is only necessary if we clip to the left or to * the right, and then only to the top or the bottom. * We do the merge in-line for efficiency. */ /* Clip up */ if (TOP(tile) > area->r_ytop) { newtile = TiSplitY(tile, area->r_ytop); TiSetBody(newtile, TiGetBody(tile)); TiSetClient(newtile, TiGetClient(tile)); mergeFlags &= ~MRG_TOP; } /* Clip down */ if (BOTTOM(tile) < area->r_ybot) { newtile = tile, tile = TiSplitY(tile, area->r_ybot); TiSetBody(tile, TiGetBody(newtile)); TiSetClient(tile, TiGetClient(newtile)); mergeFlags &= ~MRG_BOTTOM; } /* Clip right */ if (RIGHT(tile) > area->r_xtop) { TISPLITX(newtile, tile, area->r_xtop); TiSetBody(newtile, TiGetBody(tile)); TiSetClient(newtile, TiGetClient(tile)); mergeFlags &= ~MRG_RIGHT; /* Merge the outside tile to its top */ tp = RT(newtile); if (CANMERGE_Y(newtile, tp) && ( (TiGetClient(tp) == TiGetClient(newtile)) || ( ! TTMaskHasType(tileMask, TiGetTypeExact(tp)) ) ) ) TiJoinY(newtile, tp, plane); /* Merge the outside tile to its bottom */ tp = LB(newtile); if (CANMERGE_Y(newtile, tp) && ( (TiGetClient(tp) == TiGetClient(newtile)) || ( ! TTMaskHasType(tileMask, TiGetTypeExact(tp)) ) ) ) TiJoinY(newtile, tp, plane); } /* Clip left */ if (LEFT(tile) < area->r_xbot) { newtile = tile; TISPLITX(tile, tile, area->r_xbot); TiSetBody(tile, TiGetBody(newtile)); TiSetClient(tile, TiGetClient(newtile)); mergeFlags &= ~MRG_LEFT; /* Merge the outside tile to its top */ tp = RT(newtile); if (CANMERGE_Y(newtile, tp) && ( (TiGetClient(tp) == TiGetClient(newtile)) || ( ! TTMaskHasType(tileMask, TiGetTypeExact(tp)) ) ) ) TiJoinY(newtile, tp, plane); /* Merge the outside tile to its bottom */ tp = LB(newtile); if (CANMERGE_Y(newtile, tp) && ( (TiGetClient(tp) == TiGetClient(newtile)) || ( ! TTMaskHasType(tileMask, TiGetTypeExact(tp)) ) ) ) TiJoinY(newtile, tp, plane); } #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "after clip"); #endif } /* * Merge the tile back into the parts of the plane that have * already been visited. Note that if we clipped in a particular * direction we avoid merging in that direction. * * We avoid calling dbPaintMerge if at all possible. */ if (mergeFlags & MRG_LEFT) { for (tp = BL(tile); BOTTOM(tp) < TOP(tile); tp = RT(tp)) if ( (TiGetTypeExact(tp) == newType) && (tp->ti_client == client) ) { tile = dbMergeType(tile, newType, plane, mergeFlags, undo, client); goto paintdone; } mergeFlags &= ~MRG_LEFT; } if (mergeFlags & MRG_RIGHT) { for (tp = TR(tile); TOP(tp) > BOTTOM(tile); tp = LB(tp)) if ( (TiGetTypeExact(tp) == newType) && (tp->ti_client == client) ) { tile = dbMergeType(tile, newType, plane, mergeFlags, undo, client); goto paintdone; } mergeFlags &= ~MRG_RIGHT; } /* * Cheap and dirty merge -- we don't have to merge to the * left or right, so the top/bottom merge is very fast. * * Now it's safe to change the type of this tile, and * record the event on the undo list. */ if (undo && oldType != newType && UndoIsEnabled()) DBPAINTUNDO(tile, newType, undo); TiSetBody(tile, newType); TiSetClient(tile, client); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "changed type"); #endif if (mergeFlags & MRG_TOP) { tp = RT(tile); if (CANMERGE_Y(tile, tp) && (tp->ti_client == client)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "merged up (CHEAP)"); #endif } if (mergeFlags & MRG_BOTTOM) { tp = LB(tile); if (CANMERGE_Y(tile, tp) && (tp->ti_client == client)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "merged down (CHEAP)"); #endif } /*** *** END OF PAINT CODE *** ---------- BACK TO AREA SEARCH ---------- ***/ paintdone: /* Move right if possible */ tpnew = TR(tile); if (LEFT(tpnew) < area->r_xtop) { /* Move back down into clipping area if necessary */ while (BOTTOM(tpnew) >= clipTop) tpnew = LB(tpnew); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto enumerate; } } /* Each iteration returns one tile further to the left */ while (LEFT(tile) > area->r_xbot) { /* Move left if necessary */ if (BOTTOM(tile) <= area->r_ybot) goto done; /* Move down if possible; left otherwise */ tpnew = LB(tile); tile = BL(tile); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto enumerate; } } /* At left edge -- walk down to next tile along the left edge */ for (tile = LB(tile); RIGHT(tile) <= area->r_xbot; tile = TR(tile)) /* Nothing */; } done: plane->pl_hint = tile; } /* * ---------------------------------------------------------------------------- * * dbMergeType -- * * The tile 'tp' is to be changed to type 'newtype'. To maintain * maximal horizontal strips, it may be necessary to merge the new * 'tp' with its neighbors. * * This procedure splits off the biggest segment along the top of the * tile 'tp' that can be merged with its neighbors to the left and right * (depending on which of MRG_LEFT and MRG_RIGHT are set in the merge flags), * then changes the type of 'tp' to 'newtype' and merges to the left, right, * top, and bottom (in that order). * * Results: * Returns a pointer to the topmost tile resulting from any splits * and merges of the original tile 'tp'. By the maximal horizontal * strip property and the fact that the original tile 'tp' gets * painted a single color, we know that this topmost resulting tile * extends across the entire top of the area occupied by 'tp'. * * NOTE: the only tile whose type is changed is 'tp'. Any tiles * resulting from splits below this tile will not have had their * types changed. * * Side effects: * Modifies the database plane that contains the given tile. * * THIS IS SLOW, SO SHOULD BE AVOIDED IF AT ALL POSSIBLE. * THE CODE ABOVE GOES TO GREAT LENGTHS TO DO SO. * * ---------------------------------------------------------------------------- */ Tile * dbMergeType(tile, newType, plane, mergeFlags, undo, client) register Tile *tile; /* Tile to be merged with its neighbors */ register TileType newType; /* Type to which we will change 'tile' */ Plane *plane; /* Plane on which this resides */ int mergeFlags; /* Specify which directions to merge */ PaintUndoInfo *undo; /* See DBPaintPlane() above */ ClientData client; { register Tile *tp, *tpLast; register int ysplit; ysplit = BOTTOM(tile); if (mergeFlags & MRG_LEFT) { /* * Find the split point along the LHS of tile. * If the topmost tile 'tp' along the LHS is of type 'newType' * the split point will be no lower than the bottom of 'tp'. * If the topmost tile is NOT of type 'newType', then the split * point will be no lower than the top of the first tile along * the LHS that is of type 'newType'. */ for (tpLast = NULL, tp = BL(tile); BOTTOM(tp) < TOP(tile); tp = RT(tp)) if ((TiGetTypeExact(tp) == newType) && (tp->ti_client == client) ) tpLast = tp; /* If the topmost LHS tile is not of type 'newType', we don't merge */ if (tpLast == NULL || TOP(tpLast) < TOP(tile)) { mergeFlags &= ~MRG_LEFT; if (tpLast && TOP(tpLast) > ysplit) ysplit = TOP(tpLast); } else if (BOTTOM(tpLast) > ysplit) ysplit = BOTTOM(tpLast); } if (mergeFlags & MRG_RIGHT) { /* * Find the split point along the RHS of 'tile'. * If the topmost tile 'tp' along the RHS is of type 'newType' * the split point will be no lower than the bottom of 'tp'. * If the topmost tile is NOT of type 'newType', then the split * point will be no lower than the top of the first tile along * the RHS that is of type 'newType'. */ tp = TR(tile); if ((TiGetTypeExact(tp) == newType) && (tp->ti_client == client)) { if (BOTTOM(tp) > ysplit) ysplit = BOTTOM(tp); } else { /* Topmost RHS tile is not of type 'newType', so don't merge */ do tp = LB(tp); while (TiGetTypeExact(tp) != newType && TOP(tp) > ysplit); if (TOP(tp) > ysplit) ysplit = TOP(tp); mergeFlags &= ~MRG_RIGHT; } } /* * If 'tile' must be split horizontally, do so. * Any merging to the bottom will be delayed until the split-off * bottom tile is processed on a subsequent iteration of the area * enumeration loop in DBPaintPlane(). */ if (ysplit > BOTTOM(tile)) { mergeFlags &= ~MRG_BOTTOM; tp = TiSplitY(tile, ysplit); TiSetBody(tp, TiGetTypeExact(tile)); TiSetClient(tp, TiGetClient(tile)); tile = tp; #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) after split"); #endif } /* * Set the type of the new tile. * Record any undo information. */ if (undo && TiGetTypeExact(tile) != newType && UndoIsEnabled()) DBPAINTUNDO(tile, newType, undo); TiSetBody(tile, newType); TiSetClient(tile, client); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) changed type"); #endif /* * Do the merging. * We are guaranteed that at most one tile abuts 'tile' on * any side that we will merge to, and that this tile is * of type 'newType'. */ if (mergeFlags & MRG_LEFT) { tp = BL(tile); if (TOP(tp) > TOP(tile)) { tpLast = TiSplitY(tp, TOP(tile)); TiSetBody(tpLast, newType); TiSetClient(tpLast, client); } if (BOTTOM(tp) < BOTTOM(tile)) tp = TiSplitY(tp, BOTTOM(tile)); TiJoinX(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) merged left"); #endif } if (mergeFlags & MRG_RIGHT) { tp = TR(tile); if (TOP(tp) > TOP(tile)) { tpLast = TiSplitY(tp, TOP(tile)); TiSetBody(tpLast, newType); TiSetClient(tpLast, client); } if (BOTTOM(tp) < BOTTOM(tile)) tp = TiSplitY(tp, BOTTOM(tile)); TiJoinX(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) merged right"); #endif } if (mergeFlags&MRG_TOP) { tp = RT(tile); if (CANMERGE_Y(tp, tile) && (tp->ti_client == client)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) merged up"); #endif } if (mergeFlags&MRG_BOTTOM) { tp = LB(tile); if (CANMERGE_Y(tp, tile) && (tp->ti_client == client)) TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) merged down"); #endif } return (tile); } /* * ---------------------------------------------------------------------------- * * DBPaintPlaneVert -- * * Paint a rectangular area ('area') on a single tile plane ('plane'). * * -------------------------------------------------------------------- * This is identical to DBPaintPlane above, except we merge in maximal * VERTICAL strips instead of maximal HORIZONTAL. See the comments for * DBPaintPlane for details. * -------------------------------------------------------------------- * * Results: * None. * * Side effects: * Modifies the database plane that contains the given tile. * * REMINDER: * Callers should remember to set the CDMODIFIED and CDGETNEWSTAMP * bits in the cell definition containing the plane being painted. * * ---------------------------------------------------------------------------- */ Void DBPaintPlaneVert(plane, area, resultTbl, undo) Plane *plane; /* Plane whose paint is to be modified */ register Rect *area; /* Area to be changed */ PaintResultType *resultTbl; /* Table, indexed by the type of tile already * present in the plane, giving the type to * which the existing tile must change as a * result of this paint operation. */ PaintUndoInfo *undo; /* Record containing everything needed to * save undo entries for this operation. * If NULL, the undo package is not used. */ { Point start; int clipTop, mergeFlags; TileType oldType, newType; register Tile *tile, *tpnew; /* Used for area search */ register Tile *newtile, *tp; /* Used for paint */ if (area->r_xtop <= area->r_xbot || area->r_ytop <= area->r_ybot) return; /* * The following is a modified version of the area enumeration * algorithm. It expects the in-line paint code below to leave * 'tile' pointing to the tile from which we should continue the * search. */ start.p_x = area->r_xbot; start.p_y = area->r_ytop - 1; tile = plane->pl_hint; GOTOPOINT(tile, &start); /* Each iteration visits another tile on the LHS of the search area */ while (TOP(tile) > area->r_ybot) { /*** *** AREA SEARCH. *** Each iteration enumerates another tile. ***/ enumerate: if (SigInterruptPending) break; clipTop = TOP(tile); if (clipTop > area->r_ytop) clipTop = area->r_ytop; oldType = TiGetTypeExact(tile); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "area enum"); #endif /*** *** ---------- THE FOLLOWING IS IN-LINE PAINT CODE ---------- ***/ /* * Set up the directions in which we will have to * merge initially. Clipping can cause some of these * to be turned off. */ mergeFlags = MRG_TOP | MRG_LEFT; if (RIGHT(tile) >= area->r_xtop) mergeFlags |= MRG_RIGHT; if (BOTTOM(tile) <= area->r_ybot) mergeFlags |= MRG_BOTTOM; /* * Determine new type of this tile. * Change the type if necessary. */ newType = resultTbl[oldType]; if (oldType != newType) { /* * Clip the tile against the clipping rectangle. * Merging is only necessary if we clip to the top or to * the bottom, and then only to the left or the right. * * *** REMEMBER, THESE ARE MAXIMAL VERTICAL STRIPS HERE *** * * We do the merge in-line for efficiency. */ /* Clip right */ if (RIGHT(tile) > area->r_xtop) { TISPLITX(newtile, tile, area->r_xtop); TiSetBody(newtile, TiGetBody(tile)); mergeFlags &= ~MRG_RIGHT; } /* Clip left */ if (LEFT(tile) < area->r_xbot) { newtile = tile; TISPLITX(tile, tile, area->r_xbot); TiSetBody(tile, TiGetBody(newtile)); mergeFlags &= ~MRG_LEFT; } /* Clip up */ if (TOP(tile) > area->r_ytop) { newtile = TiSplitY(tile, area->r_ytop); TiSetBody(newtile, TiGetBody(tile)); mergeFlags &= ~MRG_TOP; /* Merge the outside tile to its left */ tp = BL(newtile); if (CANMERGE_X(newtile, tp)) TiJoinX(newtile, tp, plane); /* Merge the outside tile to its right */ tp = TR(newtile); if (CANMERGE_X(newtile, tp)) TiJoinX(newtile, tp, plane); } /* Clip down */ if (BOTTOM(tile) < area->r_ybot) { newtile = tile, tile = TiSplitY(tile, area->r_ybot); TiSetBody(tile, TiGetBody(newtile)); mergeFlags &= ~MRG_BOTTOM; /* Merge the outside tile to its left */ tp = BL(newtile); if (CANMERGE_X(newtile, tp)) TiJoinX(newtile, tp, plane); /* Merge the outside tile to its right */ tp = TR(newtile); if (CANMERGE_X(newtile, tp)) TiJoinX(newtile, tp, plane); } #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "after clip"); #endif } /* * Merge the tile back into the parts of the plane that have * already been visited. Note that if we clipped in a particular * direction we avoid merging in that direction. * * We avoid calling dbPaintMerge if at all possible. */ if (mergeFlags & MRG_BOTTOM) { for (tp = LB(tile); LEFT(tp) < RIGHT(tile); tp = TR(tp)) if (TiGetTypeExact(tp) == newType) { tile = dbPaintMergeVert(tile, newType, plane, mergeFlags, undo); goto paintdone; } mergeFlags &= ~MRG_BOTTOM; } if (mergeFlags & MRG_TOP) { for (tp = RT(tile); RIGHT(tp) > LEFT(tile); tp = BL(tp)) if (TiGetTypeExact(tp) == newType) { tile = dbPaintMergeVert(tile, newType, plane, mergeFlags, undo); goto paintdone; } mergeFlags &= ~MRG_TOP; } /* * Cheap and dirty merge -- we don't have to merge to the * top or bottom, so the left/right merge is very fast. * * Now it's safe to change the type of this tile, and * record the event on the undo list. */ if (undo && oldType != newType && UndoIsEnabled()) DBPAINTUNDO(tile, newType, undo); TiSetBody(tile, newType); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "changed type"); #endif if (mergeFlags & MRG_LEFT) { tp = BL(tile); if (CANMERGE_X(tile, tp)) TiJoinX(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "merged left (CHEAP)"); #endif } if (mergeFlags & MRG_RIGHT) { tp = TR(tile); if (CANMERGE_X(tile, tp)) TiJoinX(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "merged right (CHEAP)"); #endif } /*** *** END OF PAINT CODE *** ---------- BACK TO AREA SEARCH ---------- ***/ paintdone: /* Move right if possible */ tpnew = TR(tile); if (LEFT(tpnew) < area->r_xtop) { /* Move back down into clipping area if necessary */ while (BOTTOM(tpnew) >= clipTop) tpnew = LB(tpnew); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto enumerate; } } /* Each iteration returns one tile further to the left */ while (LEFT(tile) > area->r_xbot) { /* Move left if necessary */ if (BOTTOM(tile) <= area->r_ybot) goto done; /* Move down if possible; left otherwise */ tpnew = LB(tile); tile = BL(tile); if (BOTTOM(tpnew) >= BOTTOM(tile) || BOTTOM(tile) <= area->r_ybot) { tile = tpnew; goto enumerate; } } /* At left edge -- walk down to next tile along the left edge */ for (tile = LB(tile); RIGHT(tile) <= area->r_xbot; tile = TR(tile)) /* Nothing */; } done: plane->pl_hint = tile; } /* * ---------------------------------------------------------------------------- * * dbPaintMergeVert -- * * The tile 'tp' is to be changed to type 'newtype'. To maintain * maximal vertical strips, it may be necessary to merge the new * 'tp' with its neighbors. * * -------------------------------------------------------------------- * This is identical to dbPaintMerge above, except we merge in maximal * VERTICAL strips instead of maximal HORIZONTAL. See the comments for * dbPaintMerge for details. * -------------------------------------------------------------------- * * This procedure splits off the biggest segment along the left of the * tile 'tp' that can be merged with its neighbors to the top and bottom * (depending on which of MRG_TOP and MRG_BOTTOM are set in the merge flags), * then changes the type of 'tp' to 'newtype' and merges to the top, bottom, * left, and right (in that order). * * Results: * Returns a pointer to the leftmost tile resulting from any splits * and merges of the original tile 'tp'. By the maximal vertical * strip property and the fact that the original tile 'tp' gets * painted a single color, we know that this leftmost resulting tile * extends across the entire LHS of the area occupied by 'tp'. * * NOTE: the only tile whose type is changed is 'tp'. Any tiles * resulting from splits to the right of this tile will not have * had their types changed. * * Side effects: * Modifies the database plane that contains the given tile. * * THIS IS SLOW, SO SHOULD BE AVOIDED IF AT ALL POSSIBLE. * THE CODE ABOVE GOES TO GREAT LENGTHS TO DO SO. * * ---------------------------------------------------------------------------- */ Tile * dbPaintMergeVert(tile, newType, plane, mergeFlags, undo) register Tile *tile; /* Tile to be merged with its neighbors */ register TileType newType; /* Type to which we will change 'tile' */ Plane *plane; /* Plane on which this resides */ int mergeFlags; /* Specify which directions to merge */ PaintUndoInfo *undo; /* See DBPaintPlane() above */ { register Tile *tp, *tpLast; register int xsplit; xsplit = RIGHT(tile); if (mergeFlags & MRG_TOP) { /* * Find the split point along the top of tile. * If the leftmost tile 'tp' along the top is of type 'newType' * the split point will be no further right than the RHS of 'tp'. * If the leftmost tile is NOT of type 'newType', then the split * point will be no further right than the LHS of the first tile * along the top that is of type 'newType'. */ for (tpLast = NULL, tp = RT(tile); RIGHT(tp) > LEFT(tile); tp = BL(tp)) if (TiGetTypeExact(tp) == newType) tpLast = tp; /* If the leftmost top tile is not of type 'newType', don't merge */ if (tpLast == NULL || LEFT(tpLast) > LEFT(tile)) { mergeFlags &= ~MRG_TOP; if (tpLast && LEFT(tpLast) < xsplit) xsplit = LEFT(tpLast); } else if (RIGHT(tpLast) < xsplit) xsplit = RIGHT(tpLast); } if (mergeFlags & MRG_BOTTOM) { /* * Find the split point along the bottom of 'tile'. * If the leftmost tile 'tp' along the bottom is of type 'newType' * the split point will be no further right than the LHS of 'tp'. * If the leftmost tile is NOT of type 'newType', then the split * point will be no further right than the LHS of the first tile * along the bottom that is of type 'newType'. */ tp = LB(tile); if (TiGetTypeExact(tp) == newType) { if (RIGHT(tp) < xsplit) xsplit = RIGHT(tp); } else { /* Leftmost bottom tile is not of type 'newType', so don't merge */ do tp = TR(tp); while (TiGetTypeExact(tp) != newType && LEFT(tp) < xsplit); if (LEFT(tp) < xsplit) xsplit = LEFT(tp); mergeFlags &= ~MRG_BOTTOM; } } /* * If 'tile' must be split vertically, do so. * Any merging to the right will be delayed until the split-off * right tile is processed on a subsequent iteration of the area * enumeration loop in DBPaintPlaneVert(). */ if (xsplit < RIGHT(tile)) { mergeFlags &= ~MRG_RIGHT; tp = TiSplitX(tile, xsplit); TiSetBody(tp, TiGetTypeExact(tile)); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) after split"); #endif } /* * Set the type of the new tile. * Record any undo information. */ if (undo && TiGetTypeExact(tile) != newType && UndoIsEnabled()) DBPAINTUNDO(tile, newType, undo); TiSetBody(tile, newType); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) changed type"); #endif /* * Do the merging. * We are guaranteed that at most one tile abuts 'tile' on * any side that we will merge to, and that this tile is * of type 'newType'. */ if (mergeFlags & MRG_TOP) { tp = RT(tile); if (LEFT(tp) < LEFT(tile)) tp = TiSplitX(tp, LEFT(tile)); if (RIGHT(tp) > RIGHT(tile)) tpLast = TiSplitX(tp, RIGHT(tile)), TiSetBody(tpLast, newType); TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) merged up"); #endif } if (mergeFlags & MRG_BOTTOM) { tp = LB(tile); if (LEFT(tp) < LEFT(tile)) tp = TiSplitX(tp, LEFT(tile)); if (RIGHT(tp) > RIGHT(tile)) tpLast = TiSplitX(tp, RIGHT(tile)), TiSetBody(tpLast, newType); TiJoinY(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) merged down"); #endif } if (mergeFlags&MRG_LEFT) { tp = BL(tile); if (CANMERGE_X(tp, tile)) TiJoinX(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) merged left"); #endif } if (mergeFlags&MRG_RIGHT) { tp = TR(tile); if (CANMERGE_X(tp, tile)) TiJoinX(tile, tp, plane); #ifdef PAINTDEBUG if (dbPaintDebug) dbPaintShowTile(tile, undo, "(DBMERGE) merged right"); #endif } return (tile); } #ifdef PAINTDEBUG /* * ---------------------------------------------------------------------------- * * dbPaintShowTile -- * * Show the tile 'tp' in the cell undo->pu_def in a highlighted style, * then print a message, wait for more, and erase the highlights. * This procedure is for debugging the new paint code only. * * Results: * None. * * Side effects: * Redisplays. * * ---------------------------------------------------------------------------- */ #include "styles.h" dbPaintShowTile(tile, undo, str) Tile *tile; /* Tile to be highlighted */ PaintUndoInfo *undo; /* Cell to which tile belongs is undo->pu_def */ char *str; /* Message to be displayed */ { char answer[100]; Rect r; if (undo == NULL) return; TiToRect(tile, &r); DBWAreaChanged(undo->pu_def, &r, DBW_ALLWINDOWS, &DBAllButSpaceBits); DBWFeedbackAdd(&r, str, undo->pu_def, 1, STYLE_MEDIUMHIGHLIGHTS); DBWFeedbackShow(); WindUpdate(); TxPrintf("%s --more--", str); fflush(stdout); (void) TxGetLine(answer, sizeof answer); DBWFeedbackClear(); } #endif #ifdef NONMANHATTAN /* * -------------------------------------------------------------------- * * TiNMSplitY -- * * Extension of TiSplitY to the non-manhattan case. * Assumes that the tile has alredy been checked for type diagonal. * * When splitting diagonal tiles, a Y split must be accompanied by * an X split, cutting the tile vertically at the intersection of * the tile's diagonal and the horizontal Y cut. If it is not * an integer number, it will be rounded down. * * Results: * Returns TRUE if rounding fractional values has caused a * change in the tile geometry. May be used by the calling * function for DBWAreaChanged(). * * Side Effects: * May change the geometry of the split tile by a fraction of * an internal unit. * * -------------------------------------------------------------------- */ bool TiNMSplitY(oldtile, newtile, y, dir, undo) register Tile **oldtile; /* Tile to be split */ register Tile **newtile; /* Tile to be generated */ register int y; /* Y coordinate of split */ register int dir; /* 1: new tile on top, 0: new tile on bottom */ PaintUndoInfo *undo; /* Undo record */ { register int x, delx, height; register bool haschanged; /* If split changes the geometry */ Tile *newxtop, *newxbot; Rect r; height = TOP(*oldtile) - BOTTOM(*oldtile); delx = (y - BOTTOM(*oldtile)) * (RIGHT(*oldtile) - LEFT(*oldtile)); haschanged = (x = (delx % height) << 1) ? ((undo) ? TRUE : FALSE) : FALSE; x = (x >= height) ? 1 : 0; delx /= height; delx += x; /* fprintf(stderr, "delx = %d\n", delx); */ if (SplitDirection(*oldtile)) x = RIGHT(*oldtile) - delx; else x = LEFT(*oldtile) + delx; /* fprintf(stderr, "x = %d, left = %d, right = %d\n", */ /* x, LEFT(*oldtile), RIGHT(*oldtile)); */ if (haschanged) { TiToRect(*oldtile, &r); DBPAINTUNDO(*oldtile, TiGetTypeExact(*oldtile), undo); } *newtile = TiSplitY(*oldtile, y); /* Only split if there is enough space to split */ if (x > LEFT(*oldtile) && x < RIGHT(*oldtile)) { newxbot = TiSplitX(*oldtile, x); newxtop = TiSplitX(*newtile, x); /* fprintf(stderr, "Double split x = %d, y = %d\n", x, y); */ if (SplitDirection(*oldtile)) { TiSetBody(newxbot, TiGetBody(*oldtile)); TiSetBody(*newtile, TiGetBody(*oldtile)); TiSetBody(newxtop, SplitRightType(*oldtile)); TiSetBody(*oldtile, SplitLeftType(*oldtile)); } else { TiSetBody(newxtop, TiGetBody(*oldtile)); TiSetBody(newxbot, SplitRightType(*oldtile)); TiSetBody(*newtile, SplitLeftType(*oldtile)); } } else { TiSetBody(*newtile, TiGetBody(*oldtile)); if (x == LEFT(*oldtile)) { if (SplitDirection(*newtile)) TiSetBody(*newtile, SplitRightType(*oldtile)); else TiSetBody(*oldtile, SplitRightType(*oldtile)); } else { if (SplitDirection(*newtile)) TiSetBody(*oldtile, SplitLeftType(*oldtile)); else TiSetBody(*newtile, SplitLeftType(*oldtile)); } } if (!dir) { newxtop = *oldtile; *oldtile = *newtile; *newtile = newxtop; } /* Requires repaint if tile geometry was altered by integer round-off */ if (haschanged) DBWAreaChanged(undo->pu_def, &r, DBW_ALLWINDOWS, &DBAllButSpaceBits); return haschanged; } /* * -------------------------------------------------------------------- * * TiNMSplitX -- * * Extension of TiSplitX to the non-manhattan case. * Assumes that the tile has alredy been checked for type diagonal. * * When splitting diagonal tiles, an X split must be accompanied by * a Y split, cutting the tile horizontally at the intersection of * the tile's diagonal and the vertical X cut. If it is not * an integer number, it will be rounded to the nearest integer. * * Results: * Returns TRUE if rounding fractional values has caused a * change in the tile geometry. May be used by the calling * function for DBWAreaChanged(). * * Side Effects: * May change the geometry of the split tile by a fraction of * an internal unit. * * -------------------------------------------------------------------- */ bool TiNMSplitX(oldtile, newtile, x, dir, undo) register Tile **oldtile; /* Tile to be split */ register Tile **newtile; /* Tile to be generated */ register int x; /* X coordinate of split */ register int dir; /* 1: new tile on right, 0: new tile on left */ PaintUndoInfo *undo; /* Undo record */ { register int y, dely, width; register bool haschanged; /* If split changes the geometry */ Tile *newyright, *newyleft; Rect r; width = RIGHT(*oldtile) - LEFT(*oldtile); dely = (x - LEFT(*oldtile)) * (TOP(*oldtile) - BOTTOM(*oldtile)); haschanged = (y = (dely % width) << 1) ? ((undo) ? TRUE : FALSE) : FALSE; y = (y >= width) ? 1 : 0; dely /= width; dely += y; /* fprintf(stderr, "dely = %d\n", dely); */ if (SplitDirection(*oldtile)) y = TOP(*oldtile) - dely; else y = BOTTOM(*oldtile) + dely; if (haschanged) { TiToRect(*oldtile, &r); DBPAINTUNDO(*oldtile, TiGetTypeExact(*oldtile), undo); } *newtile = TiSplitX(*oldtile, x); /* fprintf(stderr, "y = %d, bottom = %d, top = %d\n", */ /* y, BOTTOM(*oldtile), TOP(*oldtile)); */ /* Only split if there is enough space to split */ if (y > BOTTOM(*oldtile) && y < TOP(*oldtile)) { newyleft = *oldtile; *oldtile = TiSplitY(newyleft, y); newyright = *newtile; *newtile = TiSplitY(newyright, y); /* fprintf(stderr, "Double split x = %d, y = %d\n", x, y); */ if (SplitDirection(newyleft)) { TiSetBody(*oldtile, TiGetBody(newyleft)); TiSetBody(newyright, TiGetBody(newyleft)); TiSetBody(*newtile, SplitRightType(newyleft)); TiSetBody(newyleft, SplitLeftType(newyleft)); } else { TiSetBody(*newtile, TiGetBody(newyleft)); TiSetBody(newyright, SplitRightType(newyleft)); TiSetBody(*oldtile, SplitLeftType(newyleft)); } } else { TiSetBody(*newtile, TiGetBody(*oldtile)); if (y == BOTTOM(*oldtile)) { if (SplitDirection(*newtile)) TiSetBody(*newtile, SplitRightType(*oldtile)); else TiSetBody(*oldtile, SplitLeftType(*oldtile)); } else { if (SplitDirection(*newtile)) TiSetBody(*oldtile, SplitLeftType(*oldtile)); else TiSetBody(*newtile, SplitRightType(*oldtile)); } } if (!dir) { newyright = *oldtile; *oldtile = *newtile; *newtile = newyright; } /* Requires repaint if tile geometry was altered by integer round-off */ if (haschanged) DBWAreaChanged(undo->pu_def, &r, DBW_ALLWINDOWS, &DBAllButSpaceBits); return haschanged; } #endif