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); \
205 #define DOWNSIZE(reg,numRects) \
206 if (((numRects) < ((reg)->data->size >> 1)) && ((reg)->data->size > 50)) \
208 size_t NewSize = RegionSizeof(numRects); \
213 NewData->size = (numRects); \
282 int i, numRects;
287 numRects = RegionNumRects(reg);
288 if (!numRects)
292 else if (numRects == 1)
301 box.y2 = pboxP[numRects-1].y2;
303 for (i = numRects; --i > 0; pboxP++, pboxN++)
347 pRgn->data->numRects = 1;
356 pRgn->data->numRects = 0;
362 n = pRgn->data->numRects;
366 n += pRgn->data->numRects;
395 * - pReg->data->numRects will be decreased.
407 int numRects; /* Number rectangles in both bands */
412 numRects = curStart - prevStart;
413 assert(numRects == pReg->data->numRects - curStart);
415 if (!numRects) return curStart;
439 numRects--;
440 } while (numRects);
446 numRects = curStart - prevStart;
447 pReg->data->numRects -= numRects;
451 numRects--;
452 } while (numRects);
460 if (curBand - prevBand == newReg->data->numRects - curBand) { \
477 * pReg->data->numRects is incremented and the rectangles overwritten
502 pReg->data->numRects += newRects;
528 newReg->data->numRects += newRects; \
602 int numRects;
621 numRects = RegionNumRects(reg2);
623 r2End = r2 + numRects;
629 ((newReg == reg2) && (numRects > 1)))
635 if (numRects > newSize)
636 newSize = numRects;
641 newReg->data->numRects = 0;
700 curBand = newReg->data->numRects;
711 curBand = newReg->data->numRects;
727 curBand = newReg->data->numRects;
753 curBand = newReg->data->numRects;
762 curBand = newReg->data->numRects;
771 if (!(numRects = newReg->data->numRects))
776 else if (numRects == 1)
784 DOWNSIZE(newReg, numRects);
982 int numRects, dnumRects, size;
996 numRects = RegionNumRects(rgn);
997 if (!numRects)
1000 size = numRects;
1027 last = old + (numRects - 1);
1045 new = RegionBox(dstrgn, numRects);
1055 if (numRects == 1)
1058 memmove((char *)new, (char *)old, numRects * sizeof(BoxRec));
1059 dstrgn->data->numRects += numRects;
1075 int numRects)
1082 /* Always called with numRects > 1 */
1086 if (numRects == 2)
1095 ExchangeRects(0, numRects >> 1);
1101 j = numRects;
1109 } while (i != numRects &&
1125 if (numRects-j-1 > 1)
1126 QuickSortRects(&rects[j+1], numRects-j-1);
1127 numRects = j;
1128 } while (numRects > 1);
1173 int numRects; /* Original numRects for badreg */
1192 numRects = badreg->data->numRects;
1193 if (!numRects)
1202 if ((numRects) == 1)
1209 DOWNSIZE(badreg, numRects);
1216 QuickSortRects(RegionBoxptr(badreg), numRects);
1232 ri[0].reg.data->numRects = 1;
1240 for (i = numRects; --i > 0;)
1262 reg->data->numRects++;
1272 rit->curBand = reg->data->numRects;
1275 reg->data->numRects++;
1312 if (reg->data->numRects == 1) /* keep unions happy below */
1414 pData->numRects = pBox - (BoxPtr) (pData + 1);
1564 int numRects;
1605 else if ((numRects = prgnDst->data->numRects))
1619 pboxLast = pboxBandStart + numRects;