Lines Matching refs:numRects

149     temp->numRects = 0;
180 region.numRects = 1;
213 if (pReg->numRects == 0)
224 pBoxEnd = &pBox[pReg->numRects - 1];
266 total = r->numRects * sizeof (XRectangle);
268 for (pr = xr, pb = r->rects, i = r->numRects; --i >= 0; pr++, pb++) {
275 if (xr || !r->numRects)
276 _XSetClipRectangles(dpy, gc, 0, 0, xr, r->numRects, YXBanded);
309 nbox = pRegion->numRects;
437 pNextRect = &pReg->rects[pReg->numRects];
460 pReg->numRects += 1;
462 assert(pReg->numRects <= pReg->size);
494 if ( (!(reg1->numRects)) || (!(reg2->numRects)) ||
496 newReg->numRects = 0;
520 if (dstrgn->size < rgn->numRects)
527 rgn->numRects, sizeof(BOX));
534 dstrgn->size = rgn->numRects;
536 dstrgn->numRects = rgn->numRects;
543 (int) (rgn->numRects * sizeof(BOX)));
565 * - pReg->numRects will be decreased.
585 pRegEnd = &pReg->rects[pReg->numRects];
618 pRegEnd = pReg->rects + pReg->numRects;
650 pReg->numRects -= curNumRects;
779 r1End = r1 + reg1->numRects;
780 r2End = r2 + reg2->numRects;
793 newReg->size = max(reg1->numRects,reg2->numRects) * 2;
831 curBand = newReg->numRects;
895 if (newReg->numRects != curBand)
905 curBand = newReg->numRects;
912 if (newReg->numRects != curBand)
934 curBand = newReg->numRects;
967 if (newReg->numRects != curBand)
980 if (newReg->numRects < (newReg->size >> 1))
986 newReg->numRects, sizeof(BoxRec));
990 newReg->size = newReg->numRects;
1024 * pReg->numRects is incremented and the final rectangles overwritten
1040 pNextRect = &pReg->rects[pReg->numRects];
1052 pReg->numRects += 1;
1055 assert(pReg->numRects<=pReg->size);
1072 * Rectangles are overwritten in pReg->rects and pReg->numRects will
1091 pNextRect = &pReg->rects[pReg->numRects];
1094 if ((pReg->numRects != 0) && \
1112 pReg->numRects += 1; \
1115 assert(pReg->numRects<=pReg->size);\
1156 if ( (reg1 == reg2) || (!(reg1->numRects)) )
1166 if (!(reg2->numRects))
1176 if ((reg1->numRects == 1) &&
1190 if ((reg2->numRects == 1) &&
1243 pNextRect = &pReg->rects[pReg->numRects];
1255 pReg->numRects += 1;
1258 assert(pReg->numRects <= pReg->size);
1296 pNextRect = &pReg->rects[pReg->numRects];
1344 pReg->numRects += 1;
1347 assert(pReg->numRects<=pReg->size);
1379 pReg->numRects += 1;
1381 assert(pReg->numRects<=pReg->size);
1400 pReg->numRects += 1;
1403 assert(pReg->numRects<=pReg->size);
1436 if ( (!(regM->numRects)) || (!(regS->numRects)) ||
1483 if( r->numRects == 0 ) return TRUE;
1495 if( r1->numRects != r2->numRects ) return FALSE;
1496 else if( r1->numRects == 0 ) return TRUE;
1501 else for( i=0; i < r1->numRects; i++ ) {
1517 if (pRegion->numRects == 0)
1521 for (i=0; i<pRegion->numRects; i++)
1547 if ((region->numRects == 0) || !EXTENTCHECK(&region->extents, prect))
1554 for (pbox = region->rects, pboxEnd = pbox + region->numRects;