kits/interface/RegionSupport.cpp

469     const BRegion*	  	reg2,          /* source regions     */
473     if ( (!(reg1->fCount)) || (!(reg2->fCount))  ||
474 	(!EXTENTCHECK(&reg1->fBounds, &reg2->fBounds)))
477 	miRegionOp (newReg, reg1, reg2,
504  *  combinRegs(newReg, reg1, reg2)
512     BRegion* reg2)
521     rects2 = reg2->fData;
523     total = reg1->fCount + reg2->fCount;
528     if (reg1->fBounds.top > reg2->fBounds.top)
530         miRegionCopy(tempReg, reg2);
545     tempReg->fCount = reg1->fCount + reg2->fCount;
546     EXTENTS(&reg2->fBounds, tempReg);
559 QuickCheck(BRegion* newReg, BRegion* reg1, BRegion* reg2)
563     if ( (reg1 == reg2) || (!(reg1->fCount)) )
565         miRegionCopy(newReg, reg2);
570     if (!(reg2->fCount))
578     if ((reg1->fBounds.top >= reg2->fBounds.bottom) ||
579         (reg2->fBounds.top >= reg1->fBounds.bottom) )
581         combineRegs(newReg, reg1, reg2);
587 /*   TopRects(fData, reg1, reg2)
588  * N.B. We now assume that reg1 and reg2 intersect.  Therefore we are
598     register BRegion* reg2,
604     if (reg1->fBounds.top < reg2->fBounds.top)
607         while(tempRects->top < reg2->fBounds.top)
611 		       tempRects->right, min_c(tempRects->bottom, reg2->fBounds.top));
616     if (reg2->fBounds.top < reg1->fBounds.top)
618         tempRects = reg2->fData;
807     const BRegion*	  	reg2,	    	    	/* 2d region in operation */
860     r2 = reg2->fData;
862     r2End = r2 + reg2->fCount;
875     if (!newReg->_SetSize(max_c(reg1->fCount,reg2->fCount) * 2)) {
892     if (reg1->fBounds.top < reg2->fBounds.top)
895 	ybot = reg2->fBounds.top;
1217     const BRegion*	  reg2,             /* source regions     */
1225     if ( (reg1 == reg2) || (!(reg1->fCount)) )
1227         if (newReg != reg2)
1228             miRegionCopy(newReg, reg2);
1235     if (!(reg2->fCount))
1246 	(reg1->fBounds.left <= reg2->fBounds.left) &&
1247 	(reg1->fBounds.top <= reg2->fBounds.top) &&
1248 	(reg1->fBounds.right >= reg2->fBounds.right) &&
1249 	(reg1->fBounds.bottom >= reg2->fBounds.bottom))
1259     if ((reg2->fCount == 1) &&
1260 	(reg2->fBounds.left <= reg1->fBounds.left) &&
1261 	(reg2->fBounds.top <= reg1->fBounds.top) &&
1262 	(reg2->fBounds.right >= reg1->fBounds.right) &&
1263 	(reg2->fBounds.bottom >= reg1->fBounds.bottom))
1265         if (newReg != reg2)
1266             miRegionCopy(newReg, reg2);
1270     miRegionOp (newReg, reg1, reg2, miUnionO,
1273     newReg->fBounds.left = min_c(reg1->fBounds.left, reg2->fBounds.left);
1274     newReg->fBounds.top = min_c(reg1->fBounds.top, reg2->fBounds.top);
1275     newReg->fBounds.right = max_c(reg1->fBounds.right, reg2->fBounds.right);
1276     newReg->fBounds.bottom = max_c(reg1->fBounds.bottom, reg2->fBounds.bottom);