Cross Reference: /xsrc/external/mit/xorg-server/dist/dix/region.c

Lines Matching refs:numRects
175 if (!(pReg)->data || (((pReg)->data->numRects + (n)) > (pReg)->data->size)) \
179 if (!(pReg)->data || (((pReg)->data->numRects + (n)) > (pReg)->data->size)) \
193     if (!(pReg)->data || ((pReg)->data->numRects == (pReg)->data->size))\
200     pReg->data->numRects++;						\
201     assert(pReg->data->numRects<=pReg->data->size);			\
204 #define DOWNSIZE(reg,numRects)						 \
205 if (((numRects) < ((reg)->data->size >> 1)) && ((reg)->data->size > 50)) \
207     size_t NewSize = RegionSizeof(numRects);				 \
212 	NewData->size = (numRects);					 \
296     int i, numRects;
301     numRects = RegionNumRects(reg);
302     if (!numRects)
306     else if (numRects == 1)
314         box.y2 = pboxP[numRects - 1].y2;
316         for (i = numRects; --i > 0; pboxP++, pboxN++) {
356         pRgn->data->numRects = 1;
364         pRgn->data->numRects = 0;
368             n = pRgn->data->numRects;
372         n += pRgn->data->numRects;
401  *	    - pReg->data->numRects will be decreased.
412     int numRects;               /* Number rectangles in both bands   */
418     numRects = curStart - prevStart;
419     assert(numRects == pReg->data->numRects - curStart);
421     if (!numRects)
447         numRects--;
448     } while (numRects);
454     numRects = curStart - prevStart;
455     pReg->data->numRects -= numRects;
459         numRects--;
460     } while (numRects);
467     if (curBand - prevBand == newReg->data->numRects - curBand) {	\
484  *	pReg->data->numRects is incremented and the rectangles overwritten
504     pReg->data->numRects += newRects;
530 	newReg->data->numRects += newRects;				\
600     int numRects;
619     numRects = RegionNumRects(reg2);
621     r2End = r2 + numRects;
627         ((newReg == reg2) && (numRects > 1))) {
632     if (numRects > newSize)
633         newSize = numRects;
638         newReg->data->numRects = 0;
697                     curBand = newReg->data->numRects;
709                     curBand = newReg->data->numRects;
726             curBand = newReg->data->numRects;
754         curBand = newReg->data->numRects;
764         curBand = newReg->data->numRects;
773     if (!(numRects = newReg->data->numRects)) {
777     else if (numRects == 1) {
783         DOWNSIZE(newReg, numRects);
969     int numRects, dnumRects, size;
982     numRects = RegionNumRects(rgn);
983     if (!numRects)
986     size = numRects;
1010             last = old + (numRects - 1);
1026         new = RegionBox(dstrgn, numRects);
1036     if (numRects == 1)
1039         memmove((char *) new, (char *) old, numRects * sizeof(BoxRec));
1040     dstrgn->data->numRects += numRects;
1053 QuickSortRects(BoxRec rects[], int numRects)
1060     /* Always called with numRects > 1 */
1063         if (numRects == 2) {
1071         ExchangeRects(0, numRects >> 1);
1077         j = numRects;
1083             } while (i != numRects &&
1098         if (numRects - j - 1 > 1)
1099             QuickSortRects(&rects[j + 1], numRects - j - 1);
1100         numRects = j;
1101     } while (numRects > 1);
1146     int numRects;               /* Original numRects for badreg         */
1164     numRects = badreg->data->numRects;
1165     if (!numRects) {
1172         if ((numRects) == 1) {
1177             DOWNSIZE(badreg, numRects);
1184     QuickSortRects(RegionBoxptr(badreg), numRects);
1200     ri[0].reg.data->numRects = 1;
1208     for (i = numRects; --i > 0;) {
1227                     reg->data->numRects++;
1238                 rit->curBand = reg->data->numRects;
1241                 reg->data->numRects++;
1277         if (reg->data->numRects == 1) { /* keep unions happy below */
1371         pData->numRects = pBox - (BoxPtr) (pData + 1);