painting/qregion.cpp

Switch to Source code Preprocessed file

Line Source Code Coverage

1 -

2 -

3 -

4 QRegion::QRegion(int x, int y, int w, int h, RegionType t) -

5 { -

6 QRegion tmp(QRect(x, y, w, h), t); -

7 tmp.d->ref.ref(); -

8 d = tmp.d; -

executed: }

Execution Count:14706

14706

10 void QRegion::detach() -

11 { -

if (d->ref.load() != 1)

evaluated: d->ref.load() != 1

TRUE	FALSE
yes Evaluation Count:64594	yes Evaluation Count:42399

42399-64594

*this = copy();

executed: *this = copy();

Execution Count:64594

64594

executed: }

Execution Count:106993

106993

15 void QRegion::exec(const QByteArray &buffer, int ver, QDataStream::ByteOrder byteOrder) -

16 { -

17 QByteArray copy = buffer; -

18 QDataStream s(&copy, QIODevice::ReadOnly); -

if (ver)

partially evaluated: ver

TRUE	FALSE
yes Evaluation Count:74	no Evaluation Count:0

0-74

s.setVersion(ver);

executed: s.setVersion(ver);

Execution Count:74

74

21 s.setByteOrder(byteOrder); -

22 QRegion rgn; -

23 -

24 -

25 -

while (!s.atEnd()) {

evaluated: !s.atEnd()

TRUE	FALSE
yes Evaluation Count:31	yes Evaluation Count:74

31-74

27 qint32 id; -

if (s.version() == 1) {

partially evaluated: s.version() == 1

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:31

0-31

29 int id_int; -

30 s >> id_int; -

31 id = id_int; -

} else {

never executed: }

0

33 s >> id; -

}

executed: }

Execution Count:31

31

35 -

36 -

37 -

38 -

39 -

if (id == 1 || id == 2) {

partially evaluated: id == 1

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:31

partially evaluated: id == 2

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:31

0-31

41 QRect r; -

42 s >> r; -

43 rgn = QRegion(r, id == 1 ? Rectangle : Ellipse); -

} else if (id == 3 || id == 4) {

never executed: }

partially evaluated: id == 3

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:31

partially evaluated: id == 4

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:31

0-31

45 QPolygon a; -

46 s >> a; -

47 rgn = QRegion(a, id == 4 ? Qt::WindingFill : Qt::OddEvenFill); -

} else if (id == 5) {

partially evaluated: id == 5

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:31

never executed: }

0-31

49 QPoint p; -

50 s >> p; -

51 rgn.translate(p.x(), p.y()); -

} else if (id >= 6 && id <= 9) {

partially evaluated: id >= 6

TRUE	FALSE
yes Evaluation Count:31	no Evaluation Count:0

partially evaluated: id <= 9

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:31

never executed: }

0-31

53 QByteArray bop1, bop2; -

54 QRegion r1, r2; -

55 s >> bop1; -

56 r1.exec(bop1); -

57 s >> bop2; -

58 r2.exec(bop2); -

59 -

60 switch (id) { -

61 case 6: -

62 rgn = r1.united(r2); -

break;

never executed: break;

0

64 case 7: -

65 rgn = r1.intersected(r2); -

break;

never executed: break;

0

67 case 8: -

68 rgn = r1.subtracted(r2); -

break;

never executed: break;

0

70 case 9: -

71 rgn = r1.xored(r2); -

break;

never executed: break;

0

73 } -

} else if (id == 10) {

never executed: }

partially evaluated: id == 10

TRUE	FALSE
yes Evaluation Count:31	no Evaluation Count:0

0-31

75 -

76 quint32 n; -

77 s >> n; -

78 QRect r; -

for (int i=0; i<(int)n; i++) {

evaluated: i<(int)n

TRUE	FALSE
yes Evaluation Count:31	yes Evaluation Count:31

31

80 s >> r; -

81 rgn = rgn.united(QRegion(r)); -

}

executed: }

Execution Count:31

31

}

executed: }

Execution Count:31

31

84 } -

85 *this = rgn; -

executed: }

Execution Count:74

74

87 QDataStream &operator<<(QDataStream &s, const QRegion &r) -

88 { -

89 QVector<QRect> a = r.rects(); -

if (a.isEmpty()) {

evaluated: a.isEmpty()

TRUE	FALSE
yes Evaluation Count:43	yes Evaluation Count:31

31-43

91 s << (quint32)0; -

} else {

executed: }

Execution Count:43

43

if (s.version() == 1) {

partially evaluated: s.version() == 1

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:31

0-31

94 int i; -

for (i = a.size() - 1; i > 0; --i) {

never evaluated: i > 0

0

96 s << (quint32)(12 + i * 24); -

97 s << (int)6; -

}

never executed: }

0

for (i = 0; i < a.size(); ++i) {

never evaluated: i < a.size()

0

100 s << (quint32)(4+8) << (int)1 << a[i]; -

}

never executed: }

0

} else {

never executed: }

0

103 s << (quint32)(4 + 4 + 16 * a.size()); -

104 s << (qint32)10; -

105 s << a; -

}

executed: }

Execution Count:31

31

107 } -

executed: return s;

Execution Count:74

74

109 } -

110 QDataStream &operator>>(QDataStream &s, QRegion &r) -

111 { -

112 QByteArray b; -

113 s >> b; -

114 r.exec(b, s.version(), s.byteOrder()); -

executed: return s;

Execution Count:74

74

116 } -

117 -

118 -

119 -

120 QDebug operator<<(QDebug s, const QRegion &r) -

121 { -

122 QVector<QRect> rects = r.rects(); -

123 s.nospace() << "QRegion(size=" << rects.size() << "), " -

124 << "bounds = " << r.boundingRect() << '\n'; -

for (int i=0; i<rects.size(); ++i)

partially evaluated: i<rects.size()

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:1

0-1

s << "- " << i << rects.at(i) << '\n';

never executed: s << "- " << i << rects.at(i) << '\n';

0

executed: return s;

Execution Count:1

1

128 } -

129 const QRegion QRegion::operator|(const QRegion &r) const -

{ return united(r); }

executed: return united(r);

Execution Count:19683

19683

131 -

132 -

133 -

134 -

135 -

136 -

137 -

138 const QRegion QRegion::operator+(const QRegion &r) const -

{ return united(r); }

executed: return united(r);

Execution Count:56

56

140 -

141 -

142 -

143 -

144 -

145 const QRegion QRegion::operator+(const QRect &r) const -

{ return united(r); }

executed: return united(r);

Execution Count:34

34

147 -

148 -

149 -

150 -

151 -

152 -

153 -

154 const QRegion QRegion::operator&(const QRegion &r) const -

{ return intersected(r); }

executed: return intersected(r);

Execution Count:417

417

156 -

157 -

158 -

159 -

160 -

161 const QRegion QRegion::operator&(const QRect &r) const -

162 { -

return intersected(r);

executed: return intersected(r);

Execution Count:94128

94128

164 } -

165 -

166 -

167 -

168 -

169 -

170 -

171 -

172 const QRegion QRegion::operator-(const QRegion &r) const -

{ return subtracted(r); }

executed: return subtracted(r);

Execution Count:22593

22593

174 -

175 -

176 -

177 -

178 -

179 -

180 -

181 const QRegion QRegion::operator^(const QRegion &r) const -

{ return xored(r); }

executed: return xored(r);

Execution Count:21

21

183 QRegion& QRegion::operator|=(const QRegion &r) -

{ return *this = *this | r; }

executed: return *this = *this | r;

Execution Count:3059

3059

185 QRegion& QRegion::operator&=(const QRegion &r) -

{ return *this = *this & r; }

executed: return *this = *this & r;

Execution Count:103

103

187 -

188 -

189 -

190 -

191 -

192 -

193 QRegion& QRegion::operator&=(const QRect &r) -

194 { -

return *this = *this & r;

executed: return *this = *this & r;

Execution Count:50457

50457

196 } -

197 QRegion& QRegion::operator-=(const QRegion &r) -

{ return *this = *this - r; }

executed: return *this = *this - r;

Execution Count:18760

18760

199 QRegion& QRegion::operator^=(const QRegion &r) -

{ return *this = *this ^ r; }

executed: return *this = *this ^ r;

Execution Count:11

11

201 QRegion::operator QVariant() const -

202 { -

return QVariant(QVariant::Region, this);

executed: return QVariant(QVariant::Region, this);

Execution Count:1

1

204 } -

205 QRegion -

206 QRegion::translated(int dx, int dy) const -

207 { -

208 QRegion ret(*this); -

209 ret.translate(dx, dy); -

executed: return ret;

Execution Count:38831

38831

211 } -

212 -

213 -

214 inline bool rect_intersects(const QRect &r1, const QRect &r2) -

215 { -

216 return (r1.right() >= r2.left() && r1.left() <= r2.right() && 38201

r1.bottom() >= r2.top() && r1.top() <= r2.bottom());

executed: return (r1.right() >= r2.left() && r1.left() <= r2.right() && r1.bottom() >= r2.top() && r1.top() <= r2.bottom());

Execution Count:38201

38201

218 } -

219 -

220 -

221 -

222 -

223 -

224 -

225 -

226 bool QRegion::intersects(const QRegion &region) const -

227 { -

if (isEmpty() || region.isEmpty())

evaluated: isEmpty()

TRUE	FALSE
yes Evaluation Count:3241	yes Evaluation Count:4839

partially evaluated: region.isEmpty()

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:4839

0-4839

executed: return false;

Execution Count:3241

3241

230 -

if (!rect_intersects(boundingRect(), region.boundingRect()))

evaluated: !rect_intersects(boundingRect(), region.boundingRect())

TRUE	FALSE
yes Evaluation Count:55	yes Evaluation Count:4784

55-4784

executed: return false;

Execution Count:55

55

if (rectCount() == 1 && region.rectCount() == 1)

evaluated: rectCount() == 1

TRUE	FALSE
yes Evaluation Count:3258	yes Evaluation Count:1526

evaluated: region.rectCount() == 1

TRUE	FALSE
yes Evaluation Count:2614	yes Evaluation Count:644

644-3258

executed: return true;

Execution Count:2614

2614

235 -

236 const QVector<QRect> myRects = rects(); -

237 const QVector<QRect> otherRects = region.rects(); -

238 -

for (QVector<QRect>::const_iterator i1 = myRects.constBegin(); i1 < myRects.constEnd(); ++i1)

evaluated: i1 < myRects.constEnd()

TRUE	FALSE
yes Evaluation Count:3190	yes Evaluation Count:182

182-3190

for (QVector<QRect>::const_iterator i2 = otherRects.constBegin(); i2 < otherRects.constEnd(); ++i2)

evaluated: i2 < otherRects.constEnd()

TRUE	FALSE
yes Evaluation Count:13000	yes Evaluation Count:1202

1202-13000

if (rect_intersects(*i1, *i2))

evaluated: rect_intersects(*i1, *i2)

TRUE	FALSE
yes Evaluation Count:1988	yes Evaluation Count:11012

1988-11012

return true;

executed: return true;

Execution Count:1988

1988

executed: return false;

Execution Count:182

182

244 } -

245 namespace { -

246 -

247 struct Segment -

248 { -

249 Segment() {} -

250 Segment(const QPoint &p) -

251 : added(false) -

252 , point(p) -

253 { -

}

never executed: }

0

255 -

256 int left() const -

257 { -

return qMin(point.x(), next->point.x());

never executed: return qMin(point.x(), next->point.x());

0

259 } -

260 -

261 int right() const -

262 { -

return qMax(point.x(), next->point.x());

never executed: return qMax(point.x(), next->point.x());

0

264 } -

265 -

266 bool overlaps(const Segment &other) const -

267 { -

return left() < other.right() && other.left() < right();

never executed: return left() < other.right() && other.left() < right();

0

269 } -

270 -

271 void connect(Segment &other) -

272 { -

273 next = &other; -

274 other.prev = this; -

275 -

276 horizontal = (point.y() == other.point.y()); -

}

never executed: }

0

278 -

279 void merge(Segment &other) -

280 { -

if (right() <= other.right()) {

never evaluated: right() <= other.right()

0

282 QPoint p = other.point; -

283 Segment *oprev = other.prev; -

284 -

285 other.point = point; -

286 other.prev = prev; -

287 prev->next = &other; -

288 -

289 point = p; -

290 prev = oprev; -

291 oprev->next = this; -

} else {

never executed: }

0

293 Segment *onext = other.next; -

294 other.next = next; -

295 next->prev = &other; -

296 -

297 next = onext; -

298 next->prev = this; -

}

never executed: }

0

300 } -

301 -

302 int horizontal : 1; -

303 int added : 1; -

304 -

305 QPoint point; -

306 Segment *prev; -

307 Segment *next; -

308 }; -

309 -

310 void mergeSegments(Segment *a, int na, Segment *b, int nb) -

311 { -

312 int i = 0; -

313 int j = 0; -

314 -

while (i != na && j != nb) {

never evaluated: i != na

never evaluated: j != nb

0

316 Segment &sa = a[i]; -

317 Segment &sb = b[j]; -

318 const int ra = sa.right(); -

319 const int rb = sb.right(); -

if (sa.overlaps(sb))

never evaluated: sa.overlaps(sb)

0

never executed: sa.merge(sb);

0

322 i += (rb >= ra); -

323 j += (ra >= rb); -

}

never executed: }

0

never executed: }

0

326 -

327 void addSegmentsToPath(Segment *segment, QPainterPath &path) -

328 { -

329 Segment *current = segment; -

330 path.moveTo(current->point); -

331 -

332 current->added = true; -

333 -

334 Segment *last = current; -

335 current = current->next; -

while (current != segment) {

never evaluated: current != segment

0

if (current->horizontal != last->horizontal)

never evaluated: current->horizontal != last->horizontal

0

path.lineTo(current->point);

never executed: path.lineTo(current->point);

0

339 current->added = true; -

340 last = current; -

341 current = current->next; -

}

never executed: }

0

never executed: }

0

344 -

345 } -

346 -

347 __attribute__((visibility("default"))) QPainterPath qt_regionToPath(const QRegion &region) -

348 { -

349 QPainterPath result; -

if (region.rectCount() == 1) {

partially evaluated: region.rectCount() == 1

TRUE	FALSE
yes Evaluation Count:7	no Evaluation Count:0

0-7

351 result.addRect(region.boundingRect()); -

executed: return result;

Execution Count:7

7

353 } -

354 -

355 const QVector<QRect> rects = region.rects(); -

356 -

357 QVarLengthArray<Segment> segments; -

358 segments.resize(4 * rects.size()); -

359 -

360 const QRect *rect = rects.constData(); -

361 const QRect *end = rect + rects.size(); -

362 -

363 int lastRowSegmentCount = 0; -

364 Segment *lastRowSegments = 0; -

365 -

366 int lastSegment = 0; -

367 int lastY = 0; -

while (rect != end) {

never evaluated: rect != end

0

369 const int y = rect[0].y(); -

370 int count = 0; -

while (&rect[count] != end && rect[count].y() == y)

never evaluated: &rect[count] != end

never evaluated: rect[count].y() == y

0

++count;

never executed: ++count;

0

373 -

for (int i = 0; i < count; ++i) {

never evaluated: i < count

0

375 int offset = lastSegment + i; -

376 segments[offset] = Segment(rect[i].topLeft()); -

377 segments[offset += count] = Segment(rect[i].topRight() + QPoint(1, 0)); -

378 segments[offset += count] = Segment(rect[i].bottomRight() + QPoint(1, 1)); -

379 segments[offset += count] = Segment(rect[i].bottomLeft() + QPoint(0, 1)); -

380 -

381 offset = lastSegment + i; -

for (int j = 0; j < 4; ++j)

never evaluated: j < 4

0

segments[offset + j * count].connect(segments[offset + ((j + 1) % 4) * count]);

never executed: segments[offset + j * count].connect(segments[offset + ((j + 1) % 4) * count]);

0

}

never executed: }

0

385 -

if (lastRowSegments && lastY == y)

never evaluated: lastRowSegments

never evaluated: lastY == y

0

mergeSegments(lastRowSegments, lastRowSegmentCount, &segments[lastSegment], count);

never executed: mergeSegments(lastRowSegments, lastRowSegmentCount, &segments[lastSegment], count);

0

388 -

389 lastRowSegments = &segments[lastSegment + 2 * count]; -

390 lastRowSegmentCount = count; -

391 lastSegment += 4 * count; -

392 lastY = y + rect[0].height(); -

393 rect += count; -

}

never executed: }

0

395 -

for (int i = 0; i < lastSegment; ++i) {

never evaluated: i < lastSegment

0

397 Segment *segment = &segments[i]; -

if (!segment->added)

never evaluated: !segment->added

0

addSegmentsToPath(segment, result);

never executed: addSegmentsToPath(segment, result);

0

}

never executed: }

0

401 -

never executed: return result;

0

403 } -

404 struct QRegionPrivate { -

405 int numRects; -

406 QVector<QRect> rects; -

407 QRect extents; -

408 QRect innerRect; -

409 int innerArea; -

410 -

inline QRegionPrivate() : numRects(0), innerArea(-1) {}

executed: }

Execution Count:270

270

412 inline QRegionPrivate(const QRect &r) { -

413 numRects = 1; -

414 extents = r; -

415 innerRect = r; -

416 innerArea = r.width() * r.height(); -

}

executed: }

Execution Count:145820

145820

418 -

419 inline QRegionPrivate(const QRegionPrivate &r) { -

420 rects = r.rects; -

421 numRects = r.numRects; -

422 extents = r.extents; -

423 innerRect = r.innerRect; -

424 innerArea = r.innerArea; -

}

executed: }

Execution Count:64594

64594

426 -

427 inline QRegionPrivate &operator=(const QRegionPrivate &r) { -

428 rects = r.rects; -

429 numRects = r.numRects; -

430 extents = r.extents; -

431 innerRect = r.innerRect; -

432 innerArea = r.innerArea; -

executed: return *this;

Execution Count:24

24

434 } -

435 -

436 void intersect(const QRect &r); -

437 -

438 -

439 -

440 -

441 -

442 inline bool contains(const QRegionPrivate &r) const { -

return contains(r.extents);

executed: return contains(r.extents);

Execution Count:85126

85126

444 } -

445 -

446 inline bool contains(const QRect &r2) const { -

447 const QRect &r1 = innerRect; -

448 return r2.left() >= r1.left() && r2.right() <= r1.right() 124294

&& r2.top() >= r1.top() && r2.bottom() <= r1.bottom();

executed: return r2.left() >= r1.left() && r2.right() <= r1.right() && r2.top() >= r1.top() && r2.bottom() <= r1.bottom();

Execution Count:124294

124294

450 } -

451 -

452 -

453 -

454 -

455 inline bool within(const QRect &r1) const { -

456 const QRect &r2 = extents; -

457 return r2.left() >= r1.left() && r2.right() <= r1.right() 98601

&& r2.top() >= r1.top() && r2.bottom() <= r1.bottom();

executed: return r2.left() >= r1.left() && r2.right() <= r1.right() && r2.top() >= r1.top() && r2.bottom() <= r1.bottom();

Execution Count:98601

98601

459 } -

460 -

461 inline void updateInnerRect(const QRect &rect) { -

462 const int area = rect.width() * rect.height(); -

if (area > innerArea) {

evaluated: area > innerArea

TRUE	FALSE
yes Evaluation Count:40552	yes Evaluation Count:101805

40552-101805

464 innerArea = area; -

465 innerRect = rect; -

}

executed: }

Execution Count:40552

40552

}

executed: }

Execution Count:142357

142357

468 -

469 inline void vectorize() { -

if (numRects == 1) {

evaluated: numRects == 1

TRUE	FALSE
yes Evaluation Count:57667	yes Evaluation Count:49630

49630-57667

if (!rects.size())

evaluated: !rects.size()

TRUE	FALSE
yes Evaluation Count:43040	yes Evaluation Count:14627

14627-43040

rects.resize(1);

executed: rects.resize(1);

Execution Count:43040

43040

473 rects[0] = extents; -

}

executed: }

Execution Count:57667

57667

}

executed: }

Execution Count:107297

107297

476 -

477 inline void append(const QRect *r); -

478 void append(const QRegionPrivate *r); -

479 void prepend(const QRect *r); -

480 void prepend(const QRegionPrivate *r); -

481 inline bool canAppend(const QRect *r) const; -

482 inline bool canAppend(const QRegionPrivate *r) const; -

483 inline bool canPrepend(const QRect *r) const; -

484 inline bool canPrepend(const QRegionPrivate *r) const; -

485 -

486 inline bool mergeFromRight(QRect *left, const QRect *right); -

487 inline bool mergeFromLeft(QRect *left, const QRect *right); -

488 inline bool mergeFromBelow(QRect *top, const QRect *bottom, -

489 const QRect *nextToTop, -

490 const QRect *nextToBottom); -

491 inline bool mergeFromAbove(QRect *bottom, const QRect *top, -

492 const QRect *nextToBottom, -

493 const QRect *nextToTop); -

494 -

495 -

496 -

497 -

498 }; -

499 -

500 static inline bool isEmptyHelper(const QRegionPrivate *preg) -

501 { -

return !preg || preg->numRects == 0;

executed: return !preg || preg->numRects == 0;

Execution Count:696768

696768

503 } -

504 -

505 static inline bool canMergeFromRight(const QRect *left, const QRect *right) -

506 { -

507 return (right->top() == left->top() 16952

508 && right->bottom() == left->bottom() 16952

&& right->left() <= (left->right() + 1));

executed: return (right->top() == left->top() && right->bottom() == left->bottom() && right->left() <= (left->right() + 1));

Execution Count:16952

16952

510 } -

511 -

512 static inline bool canMergeFromLeft(const QRect *right, const QRect *left) -

513 { -

return canMergeFromRight(left, right);

executed: return canMergeFromRight(left, right);

Execution Count:5071

5071

515 } -

516 -

517 bool QRegionPrivate::mergeFromRight(QRect *left, const QRect *right) -

518 { -

if (canMergeFromRight(left, right)) {

evaluated: canMergeFromRight(left, right)

TRUE	FALSE
yes Evaluation Count:1844	yes Evaluation Count:10037

1844-10037

520 left->setRight(right->right()); -

521 updateInnerRect(*left); -

executed: return true;

Execution Count:1844

1844

523 } -

executed: return false;

Execution Count:10037

10037

525 } -

526 -

527 bool QRegionPrivate::mergeFromLeft(QRect *right, const QRect *left) -

528 { -

if (canMergeFromLeft(right, left)) {

evaluated: canMergeFromLeft(right, left)

TRUE	FALSE
yes Evaluation Count:1633	yes Evaluation Count:3438

1633-3438

530 right->setLeft(left->left()); -

531 updateInnerRect(*right); -

executed: return true;

Execution Count:1633

1633

533 } -

executed: return false;

Execution Count:3438

3438

535 } -

536 -

537 static inline bool canMergeFromBelow(const QRect *top, const QRect *bottom, -

538 const QRect *nextToTop, -

539 const QRect *nextToBottom) -

540 { -

if (nextToTop && nextToTop->y() == top->y())

evaluated: nextToTop

TRUE	FALSE
yes Evaluation Count:6564	yes Evaluation Count:11025

evaluated: nextToTop->y() == top->y()

TRUE	FALSE
yes Evaluation Count:2247	yes Evaluation Count:4317

2247-11025

executed: return false;

Execution Count:2247

2247

if (nextToBottom && nextToBottom->y() == bottom->y())

evaluated: nextToBottom

TRUE	FALSE
yes Evaluation Count:447	yes Evaluation Count:14895

evaluated: nextToBottom->y() == bottom->y()

TRUE	FALSE
yes Evaluation Count:59	yes Evaluation Count:388

59-14895

executed: return false;

Execution Count:59

59

545 -

546 return ((top->bottom() >= (bottom->top() - 1)) 15283

547 && top->left() == bottom->left() 15283

&& top->right() == bottom->right());

executed: return ((top->bottom() >= (bottom->top() - 1)) && top->left() == bottom->left() && top->right() == bottom->right());

Execution Count:15283

15283

549 } -

550 -

551 bool QRegionPrivate::mergeFromBelow(QRect *top, const QRect *bottom, -

552 const QRect *nextToTop, -

553 const QRect *nextToBottom) -

554 { -

if (canMergeFromBelow(top, bottom, nextToTop, nextToBottom)) {

evaluated: canMergeFromBelow(top, bottom, nextToTop, nextToBottom)

TRUE	FALSE
yes Evaluation Count:1608	yes Evaluation Count:9301

1608-9301

556 top->setBottom(bottom->bottom()); -

557 updateInnerRect(*top); -

executed: return true;

Execution Count:1608

1608

559 } -

executed: return false;

Execution Count:9301

9301

561 } -

562 -

563 bool QRegionPrivate::mergeFromAbove(QRect *bottom, const QRect *top, -

564 const QRect *nextToBottom, -

565 const QRect *nextToTop) -

566 { -

if (canMergeFromBelow(top, bottom, nextToTop, nextToBottom)) {

evaluated: canMergeFromBelow(top, bottom, nextToTop, nextToBottom)

TRUE	FALSE
yes Evaluation Count:2201	yes Evaluation Count:2428

2201-2428

568 bottom->setTop(top->top()); -

569 updateInnerRect(*bottom); -

executed: return true;

Execution Count:2201

2201

571 } -

executed: return false;

Execution Count:2428

2428

573 } -

574 -

575 static inline QRect qt_rect_intersect_normalized(const QRect &r1, -

576 const QRect &r2) -

577 { -

578 QRect r; -

579 r.setLeft(qMax(r1.left(), r2.left())); -

580 r.setRight(qMin(r1.right(), r2.right())); -

581 r.setTop(qMax(r1.top(), r2.top())); -

582 r.setBottom(qMin(r1.bottom(), r2.bottom())); -

executed: return r;

Execution Count:20026

20026

584 } -

585 -

586 void QRegionPrivate::intersect(const QRect &rect) -

587 { -

588 qt_noop(); -

589 qt_noop(); -

590 -

591 -

592 -

593 -

594 -

595 const QRect r = rect.normalized(); -

596 extents = QRect(); -

597 innerRect = QRect(); -

598 innerArea = -1; -

599 -

600 QRect *dest = rects.data(); -

601 const QRect *src = dest; -

602 int n = numRects; -

603 numRects = 0; -

while (n--) {

evaluated: n--

TRUE	FALSE
yes Evaluation Count:19373	yes Evaluation Count:4145

4145-19373

605 *dest = qt_rect_intersect_normalized(*src++, r); -

if (dest->isEmpty())

evaluated: dest->isEmpty()

TRUE	FALSE
yes Evaluation Count:14988	yes Evaluation Count:4385

4385-14988

continue;

executed: continue;

Execution Count:14988

14988

608 -

if (numRects == 0) {

evaluated: numRects == 0

TRUE	FALSE
yes Evaluation Count:2334	yes Evaluation Count:2051

2051-2334

610 extents = *dest; -

} else {

executed: }

Execution Count:2334

2334

612 extents.setLeft(qMin(extents.left(), dest->left())); -

613 -

614 -

615 extents.setRight(qMax(extents.right(), dest->right())); -

616 extents.setBottom(qMax(extents.bottom(), dest->bottom())); -

617 -

const QRect *nextToLast = (numRects > 1 ? dest - 2 : 0);

evaluated: numRects > 1

TRUE	FALSE
yes Evaluation Count:1207	yes Evaluation Count:844

844-1207

619 -

620 -

if (canMergeFromBelow(dest - 1, dest, nextToLast, 0)) {

evaluated: canMergeFromBelow(dest - 1, dest, nextToLast, 0)

TRUE	FALSE
yes Evaluation Count:255	yes Evaluation Count:1796

255-1796

if (!n || src->y() != dest->y() || src->left() > r.right()) {

evaluated: !n

TRUE	FALSE
yes Evaluation Count:56	yes Evaluation Count:199

evaluated: src->y() != dest->y()

TRUE	FALSE
yes Evaluation Count:159	yes Evaluation Count:40

evaluated: src->left() > r.right()

TRUE	FALSE
yes Evaluation Count:33	yes Evaluation Count:7

7-199

623 QRect *prev = dest - 1; -

624 prev->setBottom(dest->bottom()); -

625 updateInnerRect(*prev); -

continue;

executed: continue;

Execution Count:248

248

627 } -

}

executed: }

Execution Count:7

7

}

executed: }

Execution Count:1803

1803

630 updateInnerRect(*dest); -

631 ++dest; -

632 ++numRects; -

}

executed: }

Execution Count:4137

4137

634 -

635 -

636 -

executed: }

Execution Count:4145

4145

638 -

639 void QRegionPrivate::append(const QRect *r) -

640 { -

641 qt_noop(); -

642 -

QRect *myLast = (numRects == 1 ? &extents : rects.data() + (numRects - 1));

evaluated: numRects == 1

TRUE	FALSE
yes Evaluation Count:6553	yes Evaluation Count:4946

4946-6553

if (mergeFromRight(myLast, r)) {

evaluated: mergeFromRight(myLast, r)

TRUE	FALSE
yes Evaluation Count:1505	yes Evaluation Count:9994

1505-9994

if (numRects > 1) {

evaluated: numRects > 1

TRUE	FALSE
yes Evaluation Count:530	yes Evaluation Count:975

530-975

const QRect *nextToTop = (numRects > 2 ? myLast - 2 : 0);

evaluated: numRects > 2

TRUE	FALSE
yes Evaluation Count:461	yes Evaluation Count:69

69-461

if (mergeFromBelow(myLast - 1, myLast, nextToTop, 0))

evaluated: mergeFromBelow(myLast - 1, myLast, nextToTop, 0)

TRUE	FALSE
yes Evaluation Count:47	yes Evaluation Count:483

47-483

--numRects;

executed: --numRects;

Execution Count:47

47

}

executed: }

Execution Count:530

530

} else if (mergeFromBelow(myLast, r, (numRects > 1 ? myLast - 1 : 0), 0)) {

executed: }

Execution Count:1505

evaluated: mergeFromBelow(myLast, r, (numRects > 1 ? myLast - 1 : 0), 0)

TRUE	FALSE
yes Evaluation Count:1211	yes Evaluation Count:8783

1211-8783

651 -

} else {

executed: }

Execution Count:1211

1211

653 vectorize(); -

654 ++numRects; -

655 updateInnerRect(*r); -

if (rects.size() < numRects)

evaluated: rects.size() < numRects

TRUE	FALSE
yes Evaluation Count:8101	yes Evaluation Count:682

682-8101

rects.resize(numRects);

executed: rects.resize(numRects);

Execution Count:8101

8101

658 rects[numRects - 1] = *r; -

}

executed: }

Execution Count:8783

8783

660 extents.setCoords(qMin(extents.left(), r->left()), -

661 qMin(extents.top(), r->top()), -

662 qMax(extents.right(), r->right()), -

663 qMax(extents.bottom(), r->bottom())); -

664 -

665 -

666 -

667 -

executed: }

Execution Count:11499

11499

669 -

670 void QRegionPrivate::append(const QRegionPrivate *r) -

671 { -

672 qt_noop(); -

673 -

if (r->numRects == 1) {

evaluated: r->numRects == 1

TRUE	FALSE
yes Evaluation Count:8960	yes Evaluation Count:382

382-8960

675 append(&r->extents); -

return;

executed: return;

Execution Count:8960

8960

677 } -

678 -

679 vectorize(); -

680 -

681 QRect *destRect = rects.data() + numRects; -

682 const QRect *srcRect = r->rects.constData(); -

683 int numAppend = r->numRects; -

684 -

685 -

686 { -

687 const QRect *rFirst = srcRect; -

688 QRect *myLast = destRect - 1; -

const QRect *nextToLast = (numRects > 1 ? myLast - 1 : 0);

evaluated: numRects > 1

TRUE	FALSE
yes Evaluation Count:3	yes Evaluation Count:379

3-379

if (mergeFromRight(myLast, rFirst)) {

evaluated: mergeFromRight(myLast, rFirst)

TRUE	FALSE
yes Evaluation Count:339	yes Evaluation Count:43

43-339

691 ++srcRect; -

692 --numAppend; -

const QRect *rNextToFirst = (numAppend > 1 ? rFirst + 2 : 0);

partially evaluated: numAppend > 1

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:339

0-339

if (mergeFromBelow(myLast, rFirst + 1, nextToLast, rNextToFirst)) {

partially evaluated: mergeFromBelow(myLast, rFirst + 1, nextToLast, rNextToFirst)

TRUE	FALSE
yes Evaluation Count:339	no Evaluation Count:0

0-339

695 ++srcRect; -

696 --numAppend; -

}

executed: }

Execution Count:339

339

if (numRects > 1) {

evaluated: numRects > 1

TRUE	FALSE
yes Evaluation Count:3	yes Evaluation Count:336

3-336

nextToLast = (numRects > 2 ? myLast - 2 : 0);

partially evaluated: numRects > 2

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:3

0-3

rNextToFirst = (numAppend > 0 ? srcRect : 0);

partially evaluated: numAppend > 0

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:3

0-3

if (mergeFromBelow(myLast - 1, myLast, nextToLast, rNextToFirst)) {

partially evaluated: mergeFromBelow(myLast - 1, myLast, nextToLast, rNextToFirst)

TRUE	FALSE
yes Evaluation Count:3	no Evaluation Count:0

0-3

702 --destRect; -

703 --numRects; -

}

executed: }

Execution Count:3

3

}

executed: }

Execution Count:3

3

} else if (mergeFromBelow(myLast, rFirst, nextToLast, rFirst + 1)) {

executed: }

Execution Count:339

evaluated: mergeFromBelow(myLast, rFirst, nextToLast, rFirst + 1)

TRUE	FALSE
yes Evaluation Count:8	yes Evaluation Count:35

8-339

707 ++srcRect; -

708 --numAppend; -

}

executed: }

Execution Count:8

8

710 } -

711 -

712 -

if (numAppend > 0) {

evaluated: numAppend > 0

TRUE	FALSE
yes Evaluation Count:43	yes Evaluation Count:339

43-339

714 const int newNumRects = numRects + numAppend; -

if (newNumRects > rects.size()) {

partially evaluated: newNumRects > rects.size()

TRUE	FALSE
yes Evaluation Count:43	no Evaluation Count:0

0-43

716 rects.resize(newNumRects); -

717 destRect = rects.data() + numRects; -

}

executed: }

Execution Count:43

43

719 memcpy(destRect, srcRect, numAppend * sizeof(QRect)); -

720 -

721 numRects = newNumRects; -

}

executed: }

Execution Count:43

43

723 -

724 -

if (innerArea < r->innerArea) {

evaluated: innerArea < r->innerArea

TRUE	FALSE
yes Evaluation Count:8	yes Evaluation Count:374

8-374

726 innerArea = r->innerArea; -

727 innerRect = r->innerRect; -

}

executed: }

Execution Count:8

8

729 -

730 -

731 destRect = &extents; -

732 srcRect = &r->extents; -

733 extents.setCoords(qMin(destRect->left(), srcRect->left()), -

734 qMin(destRect->top(), srcRect->top()), -

735 qMax(destRect->right(), srcRect->right()), -

736 qMax(destRect->bottom(), srcRect->bottom())); -

737 -

738 -

739 -

740 -

executed: }

Execution Count:382

382

742 -

743 void QRegionPrivate::prepend(const QRegionPrivate *r) -

744 { -

745 qt_noop(); -

746 -

if (r->numRects == 1) {

evaluated: r->numRects == 1

TRUE	FALSE
yes Evaluation Count:3988	yes Evaluation Count:495

495-3988

748 prepend(&r->extents); -

return;

executed: return;

Execution Count:3988

3988

750 } -

751 -

752 vectorize(); -

753 -

754 int numPrepend = r->numRects; -

755 int numSkip = 0; -

756 -

757 -

758 { -

759 QRect *myFirst = rects.data(); -

const QRect *nextToFirst = (numRects > 1 ? myFirst + 1 : 0);

evaluated: numRects > 1

TRUE	FALSE
yes Evaluation Count:5	yes Evaluation Count:490

5-490

761 const QRect *rLast = r->rects.constData() + r->numRects - 1; -

const QRect *rNextToLast = (r->numRects > 1 ? rLast - 1 : 0);

partially evaluated: r->numRects > 1

TRUE	FALSE
yes Evaluation Count:495	no Evaluation Count:0

0-495

if (mergeFromLeft(myFirst, rLast)) {

evaluated: mergeFromLeft(myFirst, rLast)

TRUE	FALSE
yes Evaluation Count:18	yes Evaluation Count:477

18-477

764 --numPrepend; -

765 --rLast; -

rNextToLast = (numPrepend > 1 ? rLast - 1 : 0);

partially evaluated: numPrepend > 1

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:18

0-18

if (mergeFromAbove(myFirst, rLast, nextToFirst, rNextToLast)) {

partially evaluated: mergeFromAbove(myFirst, rLast, nextToFirst, rNextToLast)

TRUE	FALSE
yes Evaluation Count:18	no Evaluation Count:0

0-18

768 --numPrepend; -

769 --rLast; -

}

executed: }

Execution Count:18

18

if (numRects > 1) {

evaluated: numRects > 1

TRUE	FALSE
yes Evaluation Count:3	yes Evaluation Count:15

3-15

nextToFirst = (numRects > 2? myFirst + 2 : 0);

partially evaluated: numRects > 2

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:3

0-3

rNextToLast = (numPrepend > 0 ? rLast : 0);

partially evaluated: numPrepend > 0

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:3

0-3

if (mergeFromAbove(myFirst + 1, myFirst, nextToFirst, rNextToLast)) {

partially evaluated: mergeFromAbove(myFirst + 1, myFirst, nextToFirst, rNextToLast)

TRUE	FALSE
yes Evaluation Count:3	no Evaluation Count:0

0-3

775 --numRects; -

776 ++numSkip; -

}

executed: }

Execution Count:3

3

}

executed: }

Execution Count:3

3

} else if (mergeFromAbove(myFirst, rLast, nextToFirst, rNextToLast)) {

executed: }

Execution Count:18

evaluated: mergeFromAbove(myFirst, rLast, nextToFirst, rNextToLast)

TRUE	FALSE
yes Evaluation Count:263	yes Evaluation Count:214

18-263

780 --numPrepend; -

}

executed: }

Execution Count:263

263

782 } -

783 -

if (numPrepend > 0) {

evaluated: numPrepend > 0

TRUE	FALSE
yes Evaluation Count:477	yes Evaluation Count:18

18-477

785 const int newNumRects = numRects + numPrepend; -

if (newNumRects > rects.size())

evaluated: newNumRects > rects.size()

TRUE	FALSE
yes Evaluation Count:475	yes Evaluation Count:2

2-475

rects.resize(newNumRects);

executed: rects.resize(newNumRects);

Execution Count:475

475

788 -

789 -

790 memmove(rects.data() + numPrepend, rects.constData() + numSkip, -

791 numRects * sizeof(QRect)); -

792 -

793 -

794 memcpy(rects.data(), r->rects.constData(), numPrepend * sizeof(QRect)); -

795 -

796 numRects = newNumRects; -

}

executed: }

Execution Count:477

477

798 -

799 -

if (innerArea < r->innerArea) {

evaluated: innerArea < r->innerArea

TRUE	FALSE
yes Evaluation Count:12	yes Evaluation Count:483

12-483

801 innerArea = r->innerArea; -

802 innerRect = r->innerRect; -

}

executed: }

Execution Count:12

12

804 -

805 -

806 extents.setCoords(qMin(extents.left(), r->extents.left()), -

807 qMin(extents.top(), r->extents.top()), -

808 qMax(extents.right(), r->extents.right()), -

809 qMax(extents.bottom(), r->extents.bottom())); -

810 -

811 -

812 -

813 -

executed: }

Execution Count:495

495

815 -

816 void QRegionPrivate::prepend(const QRect *r) -

817 { -

818 qt_noop(); -

819 -

QRect *myFirst = (numRects == 1 ? &extents : rects.data());

evaluated: numRects == 1

TRUE	FALSE
yes Evaluation Count:3041	yes Evaluation Count:1535

1535-3041

if (mergeFromLeft(myFirst, r)) {

evaluated: mergeFromLeft(myFirst, r)

TRUE	FALSE
yes Evaluation Count:1615	yes Evaluation Count:2961

1615-2961

if (numRects > 1) {

evaluated: numRects > 1

TRUE	FALSE
yes Evaluation Count:1170	yes Evaluation Count:445

445-1170

const QRect *nextToFirst = (numRects > 2 ? myFirst + 2 : 0);

evaluated: numRects > 2

TRUE	FALSE
yes Evaluation Count:34	yes Evaluation Count:1136

34-1136

if (mergeFromAbove(myFirst + 1, myFirst, nextToFirst, 0)) {

evaluated: mergeFromAbove(myFirst + 1, myFirst, nextToFirst, 0)

TRUE	FALSE
yes Evaluation Count:1100	yes Evaluation Count:70

70-1100

825 --numRects; -

826 memmove(rects.data(), rects.constData() + 1, -

827 numRects * sizeof(QRect)); -

}

executed: }

Execution Count:1100

1100

}

executed: }

Execution Count:1170

1170

} else if (mergeFromAbove(myFirst, r, (numRects > 1 ? myFirst + 1 : 0), 0)) {

executed: }

Execution Count:1615

evaluated: mergeFromAbove(myFirst, r, (numRects > 1 ? myFirst + 1 : 0), 0)

TRUE	FALSE
yes Evaluation Count:817	yes Evaluation Count:2144

817-2144

831 -

} else {

executed: }

Execution Count:817

817

833 vectorize(); -

834 ++numRects; -

835 updateInnerRect(*r); -

836 rects.prepend(*r); -

}

executed: }

Execution Count:2144

2144

838 extents.setCoords(qMin(extents.left(), r->left()), -

839 qMin(extents.top(), r->top()), -

840 qMax(extents.right(), r->right()), -

841 qMax(extents.bottom(), r->bottom())); -

842 -

843 -

844 -

845 -

executed: }

Execution Count:4576

4576

847 -

848 bool QRegionPrivate::canAppend(const QRect *r) const -

849 { -

850 qt_noop(); -

851 -

const QRect *myLast = (numRects == 1) ? &extents : (rects.constData() + (numRects - 1));

evaluated: (numRects == 1)

TRUE	FALSE
yes Evaluation Count:13429	yes Evaluation Count:23598

13429-23598

if (r->top() > myLast->bottom())

evaluated: r->top() > myLast->bottom()

TRUE	FALSE
yes Evaluation Count:7528	yes Evaluation Count:29499

7528-29499

executed: return true;

Execution Count:7528

7528

if (r->top() == myLast->top()

evaluated: r->top() == myLast->top()

TRUE	FALSE
yes Evaluation Count:7364	yes Evaluation Count:22135

7364-22135

&& r->height() == myLast->height()

evaluated: r->height() == myLast->height()

TRUE	FALSE
yes Evaluation Count:6009	yes Evaluation Count:1355

1355-6009

&& r->left() > myLast->right())

evaluated: r->left() > myLast->right()

TRUE	FALSE
yes Evaluation Count:4353	yes Evaluation Count:1656

1656-4353

858 { -

executed: return true;

Execution Count:4353

4353

860 } -

861 -

executed: return false;

Execution Count:25146

25146

863 } -

864 -

865 bool QRegionPrivate::canAppend(const QRegionPrivate *r) const -

866 { -

return canAppend(r->numRects == 1 ? &r->extents : r->rects.constData());

executed: return canAppend(r->numRects == 1 ? &r->extents : r->rects.constData());

Execution Count:27912

27912

868 } -

869 -

870 bool QRegionPrivate::canPrepend(const QRect *r) const -

871 { -

872 qt_noop(); -

873 -

const QRect *myFirst = (numRects == 1) ? &extents : rects.constData();

evaluated: (numRects == 1)

TRUE	FALSE
yes Evaluation Count:6497	yes Evaluation Count:18649

6497-18649

if (r->bottom() < myFirst->top())

evaluated: r->bottom() < myFirst->top()

TRUE	FALSE
yes Evaluation Count:3070	yes Evaluation Count:22076

3070-22076

executed: return true;

Execution Count:3070

3070

if (r->top() == myFirst->top()

evaluated: r->top() == myFirst->top()

TRUE	FALSE
yes Evaluation Count:11999	yes Evaluation Count:10077

10077-11999

&& r->height() == myFirst->height()

evaluated: r->height() == myFirst->height()

TRUE	FALSE
yes Evaluation Count:7254	yes Evaluation Count:4745

4745-7254

&& r->right() < myFirst->left())

evaluated: r->right() < myFirst->left()

TRUE	FALSE
yes Evaluation Count:2001	yes Evaluation Count:5253

2001-5253

880 { -

executed: return true;

Execution Count:2001

2001

882 } -

883 -

executed: return false;

Execution Count:20075

20075

885 } -

886 -

887 bool QRegionPrivate::canPrepend(const QRegionPrivate *r) const -

888 { -

return canPrepend(r->numRects == 1 ? &r->extents : r->rects.constData() + r->numRects - 1);

executed: return canPrepend(r->numRects == 1 ? &r->extents : r->rects.constData() + r->numRects - 1);

Execution Count:18570

18570

890 } -

891 static QRegionPrivate qrp; -

892 QRegion::QRegionData QRegion::shared_empty = {{ (1) }, &qrp}; -

893 -

894 typedef void (*OverlapFunc)(register QRegionPrivate &dest, register const QRect *r1, const QRect *r1End, -

895 register const QRect *r2, const QRect *r2End, register int y1, register int y2); -

896 typedef void (*NonOverlapFunc)(register QRegionPrivate &dest, register const QRect *r, const QRect *rEnd, -

897 register int y1, register int y2); -

898 -

899 static bool EqualRegion(const QRegionPrivate *r1, const QRegionPrivate *r2); -

900 static void UnionRegion(const QRegionPrivate *reg1, const QRegionPrivate *reg2, QRegionPrivate &dest); -

901 static void miRegionOp(register QRegionPrivate &dest, const QRegionPrivate *reg1, const QRegionPrivate *reg2, -

902 OverlapFunc overlapFunc, NonOverlapFunc nonOverlap1Func, -

903 NonOverlapFunc nonOverlap2Func); -

904 -

905 -

906 typedef struct _POINTBLOCK { -

907 int data[200 * sizeof(QPoint)]; -

908 QPoint *pts; -

909 struct _POINTBLOCK *next; -

910 } POINTBLOCK; -

911 static void UnionRectWithRegion(register const QRect *rect, const QRegionPrivate *source, -

912 QRegionPrivate &dest) -

913 { -

if (rect->isEmpty())

partially evaluated: rect->isEmpty()

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:315

0-315

return;

never executed: return;

0

916 -

917 qt_noop(); -

918 -

if (dest.numRects == 0) {

evaluated: dest.numRects == 0

TRUE	FALSE
yes Evaluation Count:5	yes Evaluation Count:310

5-310

920 dest = QRegionPrivate(*rect); -

} else if (dest.canAppend(rect)) {

executed: }

Execution Count:5

partially evaluated: dest.canAppend(rect)

TRUE	FALSE
yes Evaluation Count:310	no Evaluation Count:0

0-310

922 dest.append(rect); -

} else {

executed: }

Execution Count:310

310

924 QRegionPrivate p(*rect); -

925 UnionRegion(&p, source, dest); -

}

never executed: }

0

927 } -

928 static void miSetExtents(QRegionPrivate &dest) -

929 { -

930 register const QRect *pBox, -

931 *pBoxEnd; -

932 register QRect *pExtents; -

933 -

934 dest.innerRect.setCoords(0, 0, -1, -1); -

935 dest.innerArea = -1; -

if (dest.numRects == 0) {

evaluated: dest.numRects == 0

TRUE	FALSE
yes Evaluation Count:121	yes Evaluation Count:15074

121-15074

937 dest.extents.setCoords(0, 0, -1, -1); -

return;

executed: return;

Execution Count:121

121

939 } -

940 -

941 pExtents = &dest.extents; -

if (dest.rects.isEmpty())

partially evaluated: dest.rects.isEmpty()

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:15074

0-15074

pBox = &dest.extents;

never executed: pBox = &dest.extents;

0

944 else -

pBox = dest.rects.constData();

executed: pBox = dest.rects.constData();

Execution Count:15074

15074

946 pBoxEnd = pBox + dest.numRects - 1; -

947 pExtents->setLeft(pBox->left()); -

948 pExtents->setTop(pBox->top()); -

949 pExtents->setRight(pBoxEnd->right()); -

950 pExtents->setBottom(pBoxEnd->bottom()); -

951 -

952 qt_noop(); -

while (pBox <= pBoxEnd) {

evaluated: pBox <= pBoxEnd

TRUE	FALSE
yes Evaluation Count:54212	yes Evaluation Count:15074

15074-54212

if (pBox->left() < pExtents->left())

evaluated: pBox->left() < pExtents->left()

TRUE	FALSE
yes Evaluation Count:1293	yes Evaluation Count:52919

1293-52919

pExtents->setLeft(pBox->left());

executed: pExtents->setLeft(pBox->left());

Execution Count:1293

1293

if (pBox->right() > pExtents->right())

evaluated: pBox->right() > pExtents->right()

TRUE	FALSE
yes Evaluation Count:1352	yes Evaluation Count:52860

1352-52860

pExtents->setRight(pBox->right());

executed: pExtents->setRight(pBox->right());

Execution Count:1352

1352

958 dest.updateInnerRect(*pBox); -

959 ++pBox; -

}

executed: }

Execution Count:54212

54212

961 qt_noop(); -

executed: }

Execution Count:15074

15074

963 -

964 -

965 -

966 -

967 -

968 -

969 static void OffsetRegion(register QRegionPrivate &region, register int x, register int y) -

970 { -

if (region.rects.size()) {

evaluated: region.rects.size()

TRUE	FALSE
yes Evaluation Count:14078	yes Evaluation Count:37047

14078-37047

972 register QRect *pbox = region.rects.data(); -

973 register int nbox = region.numRects; -

974 -

while (nbox--) {

evaluated: nbox--

TRUE	FALSE
yes Evaluation Count:376133	yes Evaluation Count:14078

14078-376133

976 pbox->translate(x, y); -

977 ++pbox; -

}

executed: }

Execution Count:376133

376133

}

executed: }

Execution Count:14078

14078

980 region.extents.translate(x, y); -

981 region.innerRect.translate(x, y); -

executed: }

Execution Count:51125

51125

983 static void miIntersectO(register QRegionPrivate &dest, register const QRect *r1, const QRect *r1End, -

984 register const QRect *r2, const QRect *r2End, int y1, int y2) -

985 { -

986 register int x1; -

987 register int x2; -

988 register QRect *pNextRect; -

989 -

990 pNextRect = dest.rects.data() + dest.numRects; -

991 -

while (r1 != r1End && r2 != r2End) {

evaluated: r1 != r1End

TRUE	FALSE
yes Evaluation Count:977	yes Evaluation Count:495

evaluated: r2 != r2End

TRUE	FALSE
yes Evaluation Count:768	yes Evaluation Count:209

209-977

993 x1 = qMax(r1->left(), r2->left()); -

994 x2 = qMin(r1->right(), r2->right()); -

if (x1 <= x2) {

partially evaluated: x1 <= x2

TRUE	FALSE
yes Evaluation Count:768	no Evaluation Count:0

0-768

996 qt_noop(); -

{ if ((dest).numRects >= ((dest).rects.size()-1)){ dest.rects.resize(dest.rects.size() * 2); (pNextRect) = (dest.rects).data() + (dest).numRects; } }

never executed: }

partially evaluated: (dest).numRects >= ((dest).rects.size()-1)

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:768

0-768

998 pNextRect->setCoords(x1, y1, x2, y2); -

999 ++dest.numRects; -

1000 ++pNextRect; -

}

executed: }

Execution Count:768

768

1002 -

1003 -

1004 -

1005 -

1006 -

1007 -

if (r1->right() < r2->right()) {

evaluated: r1->right() < r2->right()

TRUE	FALSE
yes Evaluation Count:199	yes Evaluation Count:569

199-569

1009 ++r1; -

} else if (r2->right() < r1->right()) {

executed: }

Execution Count:199

evaluated: r2->right() < r1->right()

TRUE	FALSE
yes Evaluation Count:235	yes Evaluation Count:334

199-334

1011 ++r2; -

} else {

executed: }

Execution Count:235

235

1013 ++r1; -

1014 ++r2; -

}

executed: }

Execution Count:334

334

1016 } -

executed: }

Execution Count:704

704

1018 static int miCoalesce(register QRegionPrivate &dest, int prevStart, int curStart) -

1019 { -

1020 register QRect *pPrevBox; -

1021 register QRect *pCurBox; -

1022 register QRect *pRegEnd; -

1023 int curNumRects; -

1024 int prevNumRects; -

1025 int bandY1; -

1026 QRect *rData = dest.rects.data(); -

1027 -

1028 pRegEnd = rData + dest.numRects; -

1029 -

1030 pPrevBox = rData + prevStart; -

1031 prevNumRects = curStart - prevStart; -

1032 -

1033 -

1034 -

1035 -

1036 -

1037 -

1038 pCurBox = rData + curStart; -

1039 bandY1 = pCurBox->top(); -

for (curNumRects = 0; pCurBox != pRegEnd && pCurBox->top() == bandY1; ++curNumRects) {

evaluated: pCurBox != pRegEnd

TRUE	FALSE
yes Evaluation Count:132327	yes Evaluation Count:92085

evaluated: pCurBox->top() == bandY1

TRUE	FALSE
yes Evaluation Count:127488	yes Evaluation Count:4839

4839-132327

1041 ++pCurBox; -

}

executed: }

Execution Count:127488

127488

1043 -

if (pCurBox != pRegEnd) {

evaluated: pCurBox != pRegEnd

TRUE	FALSE
yes Evaluation Count:4839	yes Evaluation Count:92085

4839-92085

1045 -

1046 -

1047 -

1048 -

1049 -

1050 -

1051 --pRegEnd; -

while ((pRegEnd - 1)->top() == pRegEnd->top())

evaluated: (pRegEnd - 1)->top() == pRegEnd->top()

TRUE	FALSE
yes Evaluation Count:217	yes Evaluation Count:4839

217-4839

--pRegEnd;

executed: --pRegEnd;

Execution Count:217

217

1054 curStart = pRegEnd - rData; -

1055 pRegEnd = rData + dest.numRects; -

}

executed: }

Execution Count:4839

4839

1057 -

if (curNumRects == prevNumRects && curNumRects != 0) {

evaluated: curNumRects == prevNumRects

TRUE	FALSE
yes Evaluation Count:40656	yes Evaluation Count:56268

partially evaluated: curNumRects != 0

TRUE	FALSE
yes Evaluation Count:40656	no Evaluation Count:0

0-56268

1059 pCurBox -= curNumRects; -

1060 -

1061 -

1062 -

1063 -

if (pPrevBox->bottom() == pCurBox->top() - 1) {

evaluated: pPrevBox->bottom() == pCurBox->top() - 1

TRUE	FALSE
yes Evaluation Count:37167	yes Evaluation Count:3489

3489-37167

1065 -

1066 -

1067 -

1068 -

1069 -

1070 -

1071 do { -

if (pPrevBox->left() != pCurBox->left() || pPrevBox->right() != pCurBox->right()) {

evaluated: pPrevBox->left() != pCurBox->left()

TRUE	FALSE
yes Evaluation Count:20526	yes Evaluation Count:17493

evaluated: pPrevBox->right() != pCurBox->right()

TRUE	FALSE
yes Evaluation Count:12043	yes Evaluation Count:5450

5450-20526

1073 -

return curStart;

executed: return curStart;

Execution Count:32569

32569

1075 } -

1076 ++pPrevBox; -

1077 ++pCurBox; -

1078 --prevNumRects; -

} while (prevNumRects != 0);

executed: }

Execution Count:5450

evaluated: prevNumRects != 0

TRUE	FALSE
yes Evaluation Count:852	yes Evaluation Count:4598

852-5450

1080 -

1081 dest.numRects -= curNumRects; -

1082 pCurBox -= curNumRects; -

1083 pPrevBox -= curNumRects; -

1084 -

1085 -

1086 -

1087 -

1088 -

1089 -

1090 do { -

1091 pPrevBox->setBottom(pCurBox->bottom()); -

1092 dest.updateInnerRect(*pPrevBox); -

1093 ++pPrevBox; -

1094 ++pCurBox; -

1095 curNumRects -= 1; -

} while (curNumRects != 0);

executed: }

Execution Count:4914

evaluated: curNumRects != 0

TRUE	FALSE
yes Evaluation Count:316	yes Evaluation Count:4598

316-4914

if (pCurBox == pRegEnd) {

evaluated: pCurBox == pRegEnd

TRUE	FALSE
yes Evaluation Count:4500	yes Evaluation Count:98

98-4500

1098 curStart = prevStart; -

} else {

executed: }

Execution Count:4500

4500

1100 do { -

1101 *pPrevBox++ = *pCurBox++; -

1102 dest.updateInnerRect(*pPrevBox); -

} while (pCurBox != pRegEnd);

executed: }

Execution Count:184

evaluated: pCurBox != pRegEnd

TRUE	FALSE
yes Evaluation Count:86	yes Evaluation Count:98

86-184

}

executed: }

Execution Count:98

98

1105 } -

}

executed: }

Execution Count:8087

8087

return curStart;

executed: return curStart;

Execution Count:64355

64355

1108 } -

1109 static void miRegionOp(register QRegionPrivate &dest, -

1110 const QRegionPrivate *reg1, const QRegionPrivate *reg2, -

1111 OverlapFunc overlapFunc, NonOverlapFunc nonOverlap1Func, -

1112 NonOverlapFunc nonOverlap2Func) -

1113 { -

1114 register const QRect *r1; -

1115 register const QRect *r2; -

1116 const QRect *r1End; -

1117 const QRect *r2End; -

1118 register int ybot; -

1119 register int ytop; -

1120 int prevBand; -

1121 int curBand; -

1122 register const QRect *r1BandEnd; -

1123 register const QRect *r2BandEnd; -

1124 int top; -

1125 int bot; -

if (reg1->numRects == 1)

evaluated: reg1->numRects == 1

TRUE	FALSE
yes Evaluation Count:13480	yes Evaluation Count:21576

13480-21576

r1 = &reg1->extents;

executed: r1 = &reg1->extents;

Execution Count:13480

13480

1128 else -

r1 = reg1->rects.constData();

executed: r1 = reg1->rects.constData();

Execution Count:21576

21576

if (reg2->numRects == 1)

evaluated: reg2->numRects == 1

TRUE	FALSE
yes Evaluation Count:32302	yes Evaluation Count:2754

2754-32302

r2 = &reg2->extents;

executed: r2 = &reg2->extents;

Execution Count:32302

32302

1132 else -

r2 = reg2->rects.constData();

executed: r2 = reg2->rects.constData();

Execution Count:2754

2754

1134 -

1135 r1End = r1 + reg1->numRects; -

1136 r2End = r2 + reg2->numRects; -

1137 -

1138 dest.vectorize(); -

1139 -

1140 QVector<QRect> oldRects = dest.rects; -

1141 -

1142 dest.numRects = 0; -

1143 dest.rects.resize(qMax(reg1->numRects,reg2->numRects) * 2); -

if (reg1->extents.top() < reg2->extents.top())

evaluated: reg1->extents.top() < reg2->extents.top()

TRUE	FALSE
yes Evaluation Count:18733	yes Evaluation Count:16323

16323-18733

ybot = reg1->extents.top() - 1;

executed: ybot = reg1->extents.top() - 1;

Execution Count:18733

18733

1146 else -

ybot = reg2->extents.top() - 1;

executed: ybot = reg2->extents.top() - 1;

Execution Count:16323

16323

1148 prevBand = 0; -

1149 -

1150 do { -

1151 curBand = dest.numRects; -

1152 r1BandEnd = r1; -

while (r1BandEnd != r1End && r1BandEnd->top() == r1->top())

evaluated: r1BandEnd != r1End

TRUE	FALSE
yes Evaluation Count:128573	yes Evaluation Count:24365

evaluated: r1BandEnd->top() == r1->top()

TRUE	FALSE
yes Evaluation Count:86971	yes Evaluation Count:41602

24365-128573

executed: ++r1BandEnd;

Execution Count:86971

86971

1155 -

1156 r2BandEnd = r2; -

while (r2BandEnd != r2End && r2BandEnd->top() == r2->top())

evaluated: r2BandEnd != r2End

TRUE	FALSE
yes Evaluation Count:75476	yes Evaluation Count:58436

evaluated: r2BandEnd->top() == r2->top()

TRUE	FALSE
yes Evaluation Count:67945	yes Evaluation Count:7531

7531-75476

executed: ++r2BandEnd;

Execution Count:67945

67945

if (r1->top() < r2->top()) {

evaluated: r1->top() < r2->top()

TRUE	FALSE
yes Evaluation Count:25210	yes Evaluation Count:40757

25210-40757

1160 top = qMax(r1->top(), ybot + 1); -

1161 bot = qMin(r1->bottom(), r2->top() - 1); -

1162 -

if (nonOverlap1Func != 0 && bot >= top)

evaluated: nonOverlap1Func != 0

TRUE	FALSE
yes Evaluation Count:24975	yes Evaluation Count:235

evaluated: bot >= top

TRUE	FALSE
yes Evaluation Count:22867	yes Evaluation Count:2108

235-24975

(*nonOverlap1Func)(dest, r1, r1BandEnd, top, bot);

executed: (*nonOverlap1Func)(dest, r1, r1BandEnd, top, bot);

Execution Count:22867

22867

1165 ytop = r2->top(); -

} else if (r2->top() < r1->top()) {

executed: }

Execution Count:25210

evaluated: r2->top() < r1->top()

TRUE	FALSE
yes Evaluation Count:13188	yes Evaluation Count:27569

13188-27569

1167 top = qMax(r2->top(), ybot + 1); -

1168 bot = qMin(r2->bottom(), r1->top() - 1); -

1169 -

if (nonOverlap2Func != 0 && bot >= top)

evaluated: nonOverlap2Func != 0

TRUE	FALSE
yes Evaluation Count:12366	yes Evaluation Count:822

evaluated: bot >= top

TRUE	FALSE
yes Evaluation Count:1739	yes Evaluation Count:10627

822-12366

(*nonOverlap2Func)(dest, r2, r2BandEnd, top, bot);

executed: (*nonOverlap2Func)(dest, r2, r2BandEnd, top, bot);

Execution Count:1739

1739

1172 ytop = r1->top(); -

} else {

executed: }

Execution Count:13188

13188

1174 ytop = r1->top(); -

}

executed: }

Execution Count:27569

27569

1176 -

1177 -

1178 -

1179 -

1180 -

1181 -

1182 -

if (dest.numRects != curBand)

evaluated: dest.numRects != curBand

TRUE	FALSE
yes Evaluation Count:24606	yes Evaluation Count:41361

24606-41361

prevBand = miCoalesce(dest, prevBand, curBand);

executed: prevBand = miCoalesce(dest, prevBand, curBand);

Execution Count:24606

24606

1185 -

1186 -

1187 -

1188 -

1189 -

1190 ybot = qMin(r1->bottom(), r2->bottom()); -

1191 curBand = dest.numRects; -

if (ybot >= ytop)

evaluated: ybot >= ytop

TRUE	FALSE
yes Evaluation Count:50028	yes Evaluation Count:15939

15939-50028

(*overlapFunc)(dest, r1, r1BandEnd, r2, r2BandEnd, ytop, ybot);

executed: (*overlapFunc)(dest, r1, r1BandEnd, r2, r2BandEnd, ytop, ybot);

Execution Count:50028

50028

1194 -

if (dest.numRects != curBand)

evaluated: dest.numRects != curBand

TRUE	FALSE
yes Evaluation Count:48108	yes Evaluation Count:17859

17859-48108

prevBand = miCoalesce(dest, prevBand, curBand);

executed: prevBand = miCoalesce(dest, prevBand, curBand);

Execution Count:48108

48108

1197 -

1198 -

1199 -

1200 -

1201 -

if (r1->bottom() == ybot)

evaluated: r1->bottom() == ybot

TRUE	FALSE
yes Evaluation Count:53500	yes Evaluation Count:12467

12467-53500

r1 = r1BandEnd;

executed: r1 = r1BandEnd;

Execution Count:53500

53500

if (r2->bottom() == ybot)

evaluated: r2->bottom() == ybot

TRUE	FALSE
yes Evaluation Count:38387	yes Evaluation Count:27580

27580-38387

r2 = r2BandEnd;

executed: r2 = r2BandEnd;

Execution Count:38387

38387

} while (r1 != r1End && r2 != r2End);

executed: }

Execution Count:65967

evaluated: r1 != r1End

TRUE	FALSE
yes Evaluation Count:53220	yes Evaluation Count:12747

evaluated: r2 != r2End

TRUE	FALSE
yes Evaluation Count:30911	yes Evaluation Count:22309

12747-65967

1207 -

1208 -

1209 -

1210 -

1211 curBand = dest.numRects; -

if (r1 != r1End) {

evaluated: r1 != r1End

TRUE	FALSE
yes Evaluation Count:22309	yes Evaluation Count:12747

12747-22309

if (nonOverlap1Func != 0) {

evaluated: nonOverlap1Func != 0

TRUE	FALSE
yes Evaluation Count:22305	yes Evaluation Count:4

4-22305

1214 do { -

1215 r1BandEnd = r1; -

while (r1BandEnd < r1End && r1BandEnd->top() == r1->top())

evaluated: r1BandEnd < r1End

TRUE	FALSE
yes Evaluation Count:33554	yes Evaluation Count:22305

evaluated: r1BandEnd->top() == r1->top()

TRUE	FALSE
yes Evaluation Count:28361	yes Evaluation Count:5193

5193-33554

++r1BandEnd;

executed: ++r1BandEnd;

Execution Count:28361

28361

1218 (*nonOverlap1Func)(dest, r1, r1BandEnd, qMax(r1->top(), ybot + 1), r1->bottom()); -

1219 r1 = r1BandEnd; -

} while (r1 != r1End);

executed: }

Execution Count:27498

evaluated: r1 != r1End

TRUE	FALSE
yes Evaluation Count:5193	yes Evaluation Count:22305

5193-27498

}

executed: }

Execution Count:22305

22305

} else if ((r2 != r2End) && (nonOverlap2Func != 0)) {

executed: }

Execution Count:22309

evaluated: (r2 != r2End)

TRUE	FALSE
yes Evaluation Count:2311	yes Evaluation Count:10436

evaluated: (nonOverlap2Func != 0)

TRUE	FALSE
yes Evaluation Count:1905	yes Evaluation Count:406

406-22309

1223 do { -

1224 r2BandEnd = r2; -

while (r2BandEnd < r2End && r2BandEnd->top() == r2->top())

evaluated: r2BandEnd < r2End

TRUE	FALSE
yes Evaluation Count:2198	yes Evaluation Count:1905

evaluated: r2BandEnd->top() == r2->top()

TRUE	FALSE
yes Evaluation Count:2092	yes Evaluation Count:106

106-2198

++r2BandEnd;

executed: ++r2BandEnd;

Execution Count:2092

2092

1227 (*nonOverlap2Func)(dest, r2, r2BandEnd, qMax(r2->top(), ybot + 1), r2->bottom()); -

1228 r2 = r2BandEnd; -

} while (r2 != r2End);

executed: }

Execution Count:2011

evaluated: r2 != r2End

TRUE	FALSE
yes Evaluation Count:106	yes Evaluation Count:1905

106-2011

}

executed: }

Execution Count:1905

1905

1231 -

if (dest.numRects != curBand)

evaluated: dest.numRects != curBand

TRUE	FALSE
yes Evaluation Count:24210	yes Evaluation Count:10846

10846-24210

(void)miCoalesce(dest, prevBand, curBand);

executed: (void)miCoalesce(dest, prevBand, curBand);

Execution Count:24210

24210

if (qMax(4, dest.numRects) < (dest.rects.size() >> 1))

evaluated: qMax(4, dest.numRects) < (dest.rects.size() >> 1)

TRUE	FALSE
yes Evaluation Count:337	yes Evaluation Count:34719

337-34719

dest.rects.resize(dest.numRects);

executed: dest.rects.resize(dest.numRects);

Execution Count:337

337

executed: }

Execution Count:35056

35056

1237 static void miUnionNonO(register QRegionPrivate &dest, register const QRect *r, const QRect *rEnd, -

1238 register int y1, register int y2) -

1239 { -

1240 register QRect *pNextRect; -

1241 -

1242 pNextRect = dest.rects.data() + dest.numRects; -

1243 -

1244 qt_noop(); -

1245 -

while (r != rEnd) {

evaluated: r != rEnd

TRUE	FALSE
yes Evaluation Count:37295	yes Evaluation Count:31946

31946-37295

1247 qt_noop(); -

{ if ((dest).numRects >= ((dest).rects.size()-1)){ dest.rects.resize(dest.rects.size() * 2); (pNextRect) = (dest.rects).data() + (dest).numRects; } }

executed: }

Execution Count:10187

evaluated: (dest).numRects >= ((dest).rects.size()-1)

TRUE	FALSE
yes Evaluation Count:10187	yes Evaluation Count:27108

10187-27108

1249 pNextRect->setCoords(r->left(), y1, r->right(), y2); -

1250 dest.numRects++; -

1251 ++pNextRect; -

1252 ++r; -

}

executed: }

Execution Count:37295

37295

executed: }

Execution Count:31946

31946

1255 static void miUnionO(register QRegionPrivate &dest, register const QRect *r1, const QRect *r1End, -

1256 register const QRect *r2, const QRect *r2End, register int y1, register int y2) -

1257 { -

1258 register QRect *pNextRect; -

1259 -

1260 pNextRect = dest.rects.data() + dest.numRects; -

1261 qt_noop(); -

while (r1 != r1End && r2 != r2End) {

evaluated: r1 != r1End

TRUE	FALSE
yes Evaluation Count:56341	yes Evaluation Count:14479

evaluated: r2 != r2End

TRUE	FALSE
yes Evaluation Count:38238	yes Evaluation Count:18103

14479-56341

if (r1->left() < r2->left()) {

evaluated: r1->left() < r2->left()

TRUE	FALSE
yes Evaluation Count:19133	yes Evaluation Count:19105

19105-19133

if ((dest.numRects != 0) && (pNextRect[-1].top() == y1) && (pNextRect[-1].bottom() == y2) && (pNextRect[-1].right() >= r1->left()-1)) { if (pNextRect[-1].right() < r1->right()) { pNextRect[-1].setRight(r1->right()); dest.updateInnerRect(pNextRect[-1]); qt_noop(); } } else { { if ((dest).numRects >= ((dest).rects.size()-1)){ dest.rects.resize(dest.rects.size() * 2); (pNextRect) = (dest.rects).data() + (dest).numRects; } } pNextRect->setCoords(r1->left(), y1, r1->right(), y2); dest.updateInnerRect(*pNextRect); dest.numRects++; pNextRect++; } r1++;

executed: }

Execution Count:864

executed: }

Execution Count:900

executed: }

Execution Count:8578

executed: }

Execution Count:18233

evaluated: pNextRect[-1].right() < r1->right()

TRUE	FALSE
yes Evaluation Count:864	yes Evaluation Count:36

evaluated: (dest).numRects >= ((dest).rects.size()-1)

TRUE	FALSE
yes Evaluation Count:8578	yes Evaluation Count:9655

evaluated: (dest.numRects != 0)

TRUE	FALSE
yes Evaluation Count:17041	yes Evaluation Count:2092

evaluated: (pNextRect[-1].top() == y1)

TRUE	FALSE
yes Evaluation Count:4843	yes Evaluation Count:12198

partially evaluated: (pNextRect[-1].bottom() == y2)

TRUE	FALSE
yes Evaluation Count:4843	no Evaluation Count:0

evaluated: (pNextRect[-1].right() >= r1->left()-1)

TRUE	FALSE
yes Evaluation Count:900	yes Evaluation Count:3943

0-18233

} else {

executed: }

Execution Count:19133

19133

if ((dest.numRects != 0) && (pNextRect[-1].top() == y1) && (pNextRect[-1].bottom() == y2) && (pNextRect[-1].right() >= r2->left()-1)) { if (pNextRect[-1].right() < r2->right()) { pNextRect[-1].setRight(r2->right()); dest.updateInnerRect(pNextRect[-1]); qt_noop(); } } else { { if ((dest).numRects >= ((dest).rects.size()-1)){ dest.rects.resize(dest.rects.size() * 2); (pNextRect) = (dest.rects).data() + (dest).numRects; } } pNextRect->setCoords(r2->left(), y1, r2->right(), y2); dest.updateInnerRect(*pNextRect); dest.numRects++; pNextRect++; } r2++;

executed: }

Execution Count:285

executed: }

Execution Count:357

executed: }

Execution Count:2966

executed: }

Execution Count:18748

evaluated: pNextRect[-1].right() < r2->right()

TRUE	FALSE
yes Evaluation Count:285	yes Evaluation Count:72

evaluated: (dest).numRects >= ((dest).rects.size()-1)

TRUE	FALSE
yes Evaluation Count:2966	yes Evaluation Count:15782

evaluated: (dest.numRects != 0)

TRUE	FALSE
yes Evaluation Count:10259	yes Evaluation Count:8846

evaluated: (pNextRect[-1].top() == y1)

TRUE	FALSE
yes Evaluation Count:813	yes Evaluation Count:9446

partially evaluated: (pNextRect[-1].bottom() == y2)

TRUE	FALSE
yes Evaluation Count:813	no Evaluation Count:0

evaluated: (pNextRect[-1].right() >= r2->left()-1)

TRUE	FALSE
yes Evaluation Count:357	yes Evaluation Count:456

0-18748

}

executed: }

Execution Count:19105

19105

1268 } -

1269 -

if (r1 != r1End) {

evaluated: r1 != r1End

TRUE	FALSE
yes Evaluation Count:18103	yes Evaluation Count:14479

14479-18103

1271 do { -

if ((dest.numRects != 0) && (pNextRect[-1].top() == y1) && (pNextRect[-1].bottom() == y2) && (pNextRect[-1].right() >= r1->left()-1)) { if (pNextRect[-1].right() < r1->right()) { pNextRect[-1].setRight(r1->right()); dest.updateInnerRect(pNextRect[-1]); qt_noop(); } } else { { if ((dest).numRects >= ((dest).rects.size()-1)){ dest.rects.resize(dest.rects.size() * 2); (pNextRect) = (dest.rects).data() + (dest).numRects; } } pNextRect->setCoords(r1->left(), y1, r1->right(), y2); dest.updateInnerRect(*pNextRect); dest.numRects++; pNextRect++; } r1++;

executed: }

Execution Count:10634

executed: }

Execution Count:17764

executed: }

Execution Count:507

executed: }

Execution Count:2709

evaluated: pNextRect[-1].right() < r1->right()

TRUE	FALSE
yes Evaluation Count:10634	yes Evaluation Count:7130

evaluated: (dest).numRects >= ((dest).rects.size()-1)

TRUE	FALSE
yes Evaluation Count:507	yes Evaluation Count:2202

partially evaluated: (dest.numRects != 0)

TRUE	FALSE
yes Evaluation Count:20473	no Evaluation Count:0

partially evaluated: (pNextRect[-1].top() == y1)

TRUE	FALSE
yes Evaluation Count:20473	no Evaluation Count:0

partially evaluated: (pNextRect[-1].bottom() == y2)

TRUE	FALSE
yes Evaluation Count:20473	no Evaluation Count:0

evaluated: (pNextRect[-1].right() >= r1->left()-1)

TRUE	FALSE
yes Evaluation Count:17764	yes Evaluation Count:2709

0-20473

} while (r1 != r1End);

executed: }

Execution Count:20473

evaluated: r1 != r1End

TRUE	FALSE
yes Evaluation Count:2370	yes Evaluation Count:18103

2370-20473

} else {

executed: }

Execution Count:18103

18103

while (r2 != r2End) {

evaluated: r2 != r2End

TRUE	FALSE
yes Evaluation Count:14945	yes Evaluation Count:14479

14479-14945

if ((dest.numRects != 0) && (pNextRect[-1].top() == y1) && (pNextRect[-1].bottom() == y2) && (pNextRect[-1].right() >= r2->left()-1)) { if (pNextRect[-1].right() < r2->right()) { pNextRect[-1].setRight(r2->right()); dest.updateInnerRect(pNextRect[-1]); qt_noop(); } } else { { if ((dest).numRects >= ((dest).rects.size()-1)){ dest.rects.resize(dest.rects.size() * 2); (pNextRect) = (dest.rects).data() + (dest).numRects; } } pNextRect->setCoords(r2->left(), y1, r2->right(), y2); dest.updateInnerRect(*pNextRect); dest.numRects++; pNextRect++; } r2++;

executed: }

Execution Count:5045

executed: }

Execution Count:13537

executed: }

Execution Count:250

executed: }

Execution Count:1408

evaluated: pNextRect[-1].right() < r2->right()

TRUE	FALSE
yes Evaluation Count:5045	yes Evaluation Count:8492

evaluated: (dest).numRects >= ((dest).rects.size()-1)

TRUE	FALSE
yes Evaluation Count:250	yes Evaluation Count:1158

partially evaluated: (dest.numRects != 0)

TRUE	FALSE
yes Evaluation Count:14945	no Evaluation Count:0

partially evaluated: (pNextRect[-1].top() == y1)

TRUE	FALSE
yes Evaluation Count:14945	no Evaluation Count:0

partially evaluated: (pNextRect[-1].bottom() == y2)

TRUE	FALSE
yes Evaluation Count:14945	no Evaluation Count:0

evaluated: (pNextRect[-1].right() >= r2->left()-1)

TRUE	FALSE
yes Evaluation Count:13537	yes Evaluation Count:1408

0-14945

}

executed: }

Execution Count:14945

14945

}

executed: }

Execution Count:14479

14479

1279 } -

1280 -

1281 static void UnionRegion(const QRegionPrivate *reg1, const QRegionPrivate *reg2, QRegionPrivate &dest) -

1282 { -

1283 qt_noop(); -

1284 qt_noop(); -

1285 qt_noop(); -

1286 qt_noop(); -

1287 qt_noop(); -

1288 qt_noop(); -

1289 -

if (reg1->innerArea > reg2->innerArea) {

evaluated: reg1->innerArea > reg2->innerArea

TRUE	FALSE
yes Evaluation Count:16866	yes Evaluation Count:2995

2995-16866

1291 dest.innerArea = reg1->innerArea; -

1292 dest.innerRect = reg1->innerRect; -

} else {

executed: }

Execution Count:16866

16866

1294 dest.innerArea = reg2->innerArea; -

1295 dest.innerRect = reg2->innerRect; -

}

executed: }

Execution Count:2995

2995

1297 miRegionOp(dest, reg1, reg2, miUnionO, miUnionNonO, miUnionNonO); -

1298 -

1299 dest.extents.setCoords(qMin(reg1->extents.left(), reg2->extents.left()), -

1300 qMin(reg1->extents.top(), reg2->extents.top()), -

1301 qMax(reg1->extents.right(), reg2->extents.right()), -

1302 qMax(reg1->extents.bottom(), reg2->extents.bottom())); -

executed: }

Execution Count:19861

19861

1304 static void miSubtractNonO1(register QRegionPrivate &dest, register const QRect *r, -

1305 const QRect *rEnd, register int y1, register int y2) -

1306 { -

1307 register QRect *pNextRect; -

1308 -

1309 pNextRect = dest.rects.data() + dest.numRects; -

1310 -

1311 qt_noop(); -

1312 -

while (r != rEnd) {

evaluated: r != rEnd

TRUE	FALSE
yes Evaluation Count:22270	yes Evaluation Count:22169

22169-22270

1314 qt_noop(); -

{ if ((dest).numRects >= ((dest).rects.size()-1)){ dest.rects.resize(dest.rects.size() * 2); (pNextRect) = (dest.rects).data() + (dest).numRects; } }

executed: }

Execution Count:5312

evaluated: (dest).numRects >= ((dest).rects.size()-1)

TRUE	FALSE
yes Evaluation Count:5312	yes Evaluation Count:16958

5312-16958

1316 pNextRect->setCoords(r->left(), y1, r->right(), y2); -

1317 ++dest.numRects; -

1318 ++pNextRect; -

1319 ++r; -

}

executed: }

Execution Count:22270

22270

executed: }

Execution Count:22169

22169

1322 static void miSubtractO(register QRegionPrivate &dest, register const QRect *r1, const QRect *r1End, -

1323 register const QRect *r2, const QRect *r2End, register int y1, register int y2) -

1324 { -

1325 register QRect *pNextRect; -

1326 register int x1; -

1327 -

1328 x1 = r1->left(); -

1329 -

1330 qt_noop(); -

1331 pNextRect = dest.rects.data() + dest.numRects; -

1332 -

while (r1 != r1End && r2 != r2End) {

evaluated: r1 != r1End

TRUE	FALSE
yes Evaluation Count:36788	yes Evaluation Count:4669

evaluated: r2 != r2End

TRUE	FALSE
yes Evaluation Count:24715	yes Evaluation Count:12073

4669-36788

if (r2->right() < x1) {

evaluated: r2->right() < x1

TRUE	FALSE
yes Evaluation Count:2076	yes Evaluation Count:22639

2076-22639

1335 -

1336 -

1337 -

1338 ++r2; -

} else if (r2->left() <= x1) {

executed: }

Execution Count:2076

evaluated: r2->left() <= x1

TRUE	FALSE
yes Evaluation Count:4859	yes Evaluation Count:17780

2076-17780

1340 -

1341 -

1342 -

1343 x1 = r2->right() + 1; -

if (x1 > r1->right()) {

evaluated: x1 > r1->right()

TRUE	FALSE
yes Evaluation Count:2007	yes Evaluation Count:2852

2007-2852

1345 -

1346 -

1347 -

1348 -

1349 ++r1; -

if (r1 != r1End)

evaluated: r1 != r1End

TRUE	FALSE
yes Evaluation Count:74	yes Evaluation Count:1933

74-1933

x1 = r1->left();

executed: x1 = r1->left();

Execution Count:74

74

} else {

executed: }

Execution Count:2007

2007

1353 -

1354 ++r2; -

}

executed: }

Execution Count:2852

2852

} else if (r2->left() <= r1->right()) {

evaluated: r2->left() <= r1->right()

TRUE	FALSE
yes Evaluation Count:10177	yes Evaluation Count:7603

7603-10177

1357 -

1358 -

1359 -

1360 -

1361 qt_noop(); -

{ if ((dest).numRects >= ((dest).rects.size()-1)){ dest.rects.resize(dest.rects.size() * 2); (pNextRect) = (dest.rects).data() + (dest).numRects; } }

executed: }

Execution Count:4942

evaluated: (dest).numRects >= ((dest).rects.size()-1)

TRUE	FALSE
yes Evaluation Count:4942	yes Evaluation Count:5235

4942-5235

1363 pNextRect->setCoords(x1, y1, r2->left() - 1, y2); -

1364 ++dest.numRects; -

1365 ++pNextRect; -

1366 -

1367 x1 = r2->right() + 1; -

if (x1 > r1->right()) {

evaluated: x1 > r1->right()

TRUE	FALSE
yes Evaluation Count:2709	yes Evaluation Count:7468

2709-7468

1369 -

1370 -

1371 -

1372 ++r1; -

if (r1 != r1End)

evaluated: r1 != r1End

TRUE	FALSE
yes Evaluation Count:35	yes Evaluation Count:2674

35-2674

x1 = r1->left();

executed: x1 = r1->left();

Execution Count:35

35

} else {

executed: }

Execution Count:2709

2709

1376 -

1377 ++r2; -

}

executed: }

Execution Count:7468

7468

1379 } else { -

1380 -

1381 -

1382 -

if (r1->right() >= x1) {

partially evaluated: r1->right() >= x1

TRUE	FALSE
yes Evaluation Count:7603	no Evaluation Count:0

0-7603

{ if ((dest).numRects >= ((dest).rects.size()-1)){ dest.rects.resize(dest.rects.size() * 2); (pNextRect) = (dest.rects).data() + (dest).numRects; } }

never executed: }

partially evaluated: (dest).numRects >= ((dest).rects.size()-1)

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:7603

0-7603

1385 pNextRect->setCoords(x1, y1, r1->right(), y2); -

1386 ++dest.numRects; -

1387 ++pNextRect; -

}

executed: }

Execution Count:7603

7603

1389 ++r1; -

if (r1 != r1End)

evaluated: r1 != r1End

TRUE	FALSE
yes Evaluation Count:7541	yes Evaluation Count:62

62-7541

x1 = r1->left();

executed: x1 = r1->left();

Execution Count:7541

7541

}

executed: }

Execution Count:7603

7603

1393 } -

1394 -

1395 -

1396 -

1397 -

while (r1 != r1End) {

evaluated: r1 != r1End

TRUE	FALSE
yes Evaluation Count:14055	yes Evaluation Count:16742

14055-16742

1399 qt_noop(); -

{ if ((dest).numRects >= ((dest).rects.size()-1)){ dest.rects.resize(dest.rects.size() * 2); (pNextRect) = (dest.rects).data() + (dest).numRects; } }

executed: }

Execution Count:1112

evaluated: (dest).numRects >= ((dest).rects.size()-1)

TRUE	FALSE
yes Evaluation Count:1112	yes Evaluation Count:12943

1112-12943

1401 pNextRect->setCoords(x1, y1, r1->right(), y2); -

1402 ++dest.numRects; -

1403 ++pNextRect; -

1404 -

1405 ++r1; -

if (r1 != r1End)

evaluated: r1 != r1End

TRUE	FALSE
yes Evaluation Count:1982	yes Evaluation Count:12073

1982-12073

x1 = r1->left();

executed: x1 = r1->left();

Execution Count:1982

1982

}

executed: }

Execution Count:14055

14055

executed: }

Execution Count:16742

16742

1410 static void SubtractRegion(QRegionPrivate *regM, QRegionPrivate *regS, -

1411 register QRegionPrivate &dest) -

1412 { -

1413 qt_noop(); -

1414 qt_noop(); -

1415 qt_noop(); -

1416 qt_noop(); -

1417 qt_noop(); -

1418 -

1419 miRegionOp(dest, regM, regS, miSubtractO, miSubtractNonO1, 0); -

1420 miSetExtents(dest); -

executed: }

Execution Count:15171

15171

1422 -

1423 static void XorRegion(QRegionPrivate *sra, QRegionPrivate *srb, QRegionPrivate &dest) -

1424 { -

1425 qt_noop(); -

1426 qt_noop(); -

1427 qt_noop(); -

1428 -

1429 QRegionPrivate tra, trb; -

1430 -

if (!srb->contains(*sra))

evaluated: !srb->contains(*sra)

TRUE	FALSE
yes Evaluation Count:16	yes Evaluation Count:3

3-16

SubtractRegion(sra, srb, tra);

executed: SubtractRegion(sra, srb, tra);

Execution Count:16

16

if (!sra->contains(*srb))

evaluated: !sra->contains(*srb)

TRUE	FALSE
yes Evaluation Count:7	yes Evaluation Count:12

7-12

SubtractRegion(srb, sra, trb);

executed: SubtractRegion(srb, sra, trb);

Execution Count:7

7

1435 -

1436 qt_noop(); -

1437 qt_noop(); -

1438 -

if (isEmptyHelper(&tra)) {

evaluated: isEmptyHelper(&tra)

TRUE	FALSE
yes Evaluation Count:3	yes Evaluation Count:16

3-16

1440 dest = trb; -

} else if (isEmptyHelper(&trb)) {

executed: }

Execution Count:3

partially evaluated: isEmptyHelper(&trb)

TRUE	FALSE
yes Evaluation Count:16	no Evaluation Count:0

0-16

1442 dest = tra; -

} else if (tra.canAppend(&trb)) {

executed: }

Execution Count:16

never evaluated: tra.canAppend(&trb)

0-16

1444 dest = tra; -

1445 dest.append(&trb); -

} else if (trb.canAppend(&tra)) {

never executed: }

never evaluated: trb.canAppend(&tra)

0

1447 dest = trb; -

1448 dest.append(&tra); -

} else {

never executed: }

0

1450 UnionRegion(&tra, &trb, dest); -

}

never executed: }

0

1452 } -

1453 -

1454 -

1455 -

1456 -

1457 static bool EqualRegion(const QRegionPrivate *r1, const QRegionPrivate *r2) -

1458 { -

if (r1->numRects != r2->numRects) {

evaluated: r1->numRects != r2->numRects

TRUE	FALSE
yes Evaluation Count:17244	yes Evaluation Count:12519

12519-17244

executed: return false;

Execution Count:17244

17244

} else if (r1->numRects == 0) {

evaluated: r1->numRects == 0

TRUE	FALSE
yes Evaluation Count:10	yes Evaluation Count:12509

10-12509

executed: return true;

Execution Count:10

10

} else if (r1->extents != r2->extents) {

evaluated: r1->extents != r2->extents

TRUE	FALSE
yes Evaluation Count:11650	yes Evaluation Count:859

859-11650

executed: return false;

Execution Count:11650

11650

} else if (r1->numRects == 1 && r2->numRects == 1) {

evaluated: r1->numRects == 1

TRUE	FALSE
yes Evaluation Count:345	yes Evaluation Count:514

partially evaluated: r2->numRects == 1

TRUE	FALSE
yes Evaluation Count:345	no Evaluation Count:0

0-514

executed: return true;

Execution Count:345

345

1467 } else { -

const QRect *rr1 = (r1->numRects == 1) ? &r1->extents : r1->rects.constData();

partially evaluated: (r1->numRects == 1)

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:514

0-514

const QRect *rr2 = (r2->numRects == 1) ? &r2->extents : r2->rects.constData();

partially evaluated: (r2->numRects == 1)

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:514

0-514

for (int i = 0; i < r1->numRects; ++i, ++rr1, ++rr2) {

evaluated: i < r1->numRects

TRUE	FALSE
yes Evaluation Count:1566	yes Evaluation Count:319

319-1566

if (*rr1 != *rr2)

evaluated: *rr1 != *rr2

TRUE	FALSE
yes Evaluation Count:195	yes Evaluation Count:1371

195-1371

return false;

executed: return false;

Execution Count:195

195

}

executed: }

Execution Count:1371

1371

}

executed: }

Execution Count:319

319

1475 -

executed: return true;

Execution Count:319

319

1477 } -

1478 -

1479 static bool PointInRegion(QRegionPrivate *pRegion, int x, int y) -

1480 { -

1481 int i; -

1482 -

if (isEmptyHelper(pRegion))

evaluated: isEmptyHelper(pRegion)

TRUE	FALSE
yes Evaluation Count:1	yes Evaluation Count:200047

1-200047

executed: return false;

Execution Count:1

1

if (!pRegion->extents.contains(x, y))

evaluated: !pRegion->extents.contains(x, y)

TRUE	FALSE
yes Evaluation Count:45120	yes Evaluation Count:154927

45120-154927

executed: return false;

Execution Count:45120

45120

if (pRegion->numRects == 1)

evaluated: pRegion->numRects == 1

TRUE	FALSE
yes Evaluation Count:20	yes Evaluation Count:154907

20-154907

return pRegion->extents.contains(x, y);

executed: return pRegion->extents.contains(x, y);

Execution Count:20

20

if (pRegion->innerRect.contains(x, y))

evaluated: pRegion->innerRect.contains(x, y)

TRUE	FALSE
yes Evaluation Count:19711	yes Evaluation Count:135196

19711-135196

executed: return true;

Execution Count:19711

19711

for (i = 0; i < pRegion->numRects; ++i) {

evaluated: i < pRegion->numRects

TRUE	FALSE
yes Evaluation Count:4551005	yes Evaluation Count:60214

60214-4551005

if (pRegion->rects[i].contains(x, y))

evaluated: pRegion->rects[i].contains(x, y)

TRUE	FALSE
yes Evaluation Count:74982	yes Evaluation Count:4476023

74982-4476023

executed: return true;

Execution Count:74982

74982

}

executed: }

Execution Count:4476023

4476023

executed: return false;

Execution Count:60214

60214

1496 } -

1497 -

1498 static bool RectInRegion(register QRegionPrivate *region, int rx, int ry, uint rwidth, uint rheight) -

1499 { -

1500 register const QRect *pbox; -

1501 register const QRect *pboxEnd; -

1502 QRect rect(rx, ry, rwidth, rheight); -

1503 register QRect *prect = &rect; -

1504 int partIn, partOut; -

1505 -

if (!region || region->numRects == 0 || !((&region->extents)->right() >= (prect)->left() && (&region->extents)->left() <= (prect)->right() && (&region->extents)->bottom() >= (prect)->top() && (&region->extents)->top() <= (prect)->bottom()))

partially evaluated: !region

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:41

partially evaluated: region->numRects == 0

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:41

evaluated: (&region->extents)->right() >= (prect)->left()

TRUE	FALSE
yes Evaluation Count:35	yes Evaluation Count:6

evaluated: (&region->extents)->left() <= (prect)->right()

TRUE	FALSE
yes Evaluation Count:32	yes Evaluation Count:3

partially evaluated: (&region->extents)->bottom() >= (prect)->top()

TRUE	FALSE
yes Evaluation Count:32	no Evaluation Count:0

partially evaluated: (&region->extents)->top() <= (prect)->bottom()

TRUE	FALSE
yes Evaluation Count:32	no Evaluation Count:0

0-41

executed: return 0;

Execution Count:9

9

1508 -

1509 partOut = false; -

1510 partIn = false; -

1511 -

1512 -

pbox = (region->numRects == 1) ? &region->extents : region->rects.constData();

evaluated: (region->numRects == 1)

TRUE	FALSE
yes Evaluation Count:21	yes Evaluation Count:11

11-21

1514 pboxEnd = pbox + region->numRects; -

for (; pbox < pboxEnd; ++pbox) {

evaluated: pbox < pboxEnd

TRUE	FALSE
yes Evaluation Count:43	yes Evaluation Count:9

9-43

if (pbox->bottom() < ry)

evaluated: pbox->bottom() < ry

TRUE	FALSE
yes Evaluation Count:4	yes Evaluation Count:39

4-39

continue;

executed: continue;

Execution Count:4

4

1518 -

if (pbox->top() > ry) {

evaluated: pbox->top() > ry

TRUE	FALSE
yes Evaluation Count:5	yes Evaluation Count:34

5-34

1520 partOut = true; -

if (partIn || pbox->top() > prect->bottom())

evaluated: partIn

TRUE	FALSE
yes Evaluation Count:3	yes Evaluation Count:2

partially evaluated: pbox->top() > prect->bottom()

TRUE	FALSE
yes Evaluation Count:2	no Evaluation Count:0

0-3

break;

executed: break;

Execution Count:5

5

1523 ry = pbox->top(); -

}

never executed: }

0

1525 -

if (pbox->right() < rx)

evaluated: pbox->right() < rx

TRUE	FALSE
yes Evaluation Count:4	yes Evaluation Count:30

4-30

continue;

executed: continue;

Execution Count:4

4

1528 -

if (pbox->left() > rx) {

evaluated: pbox->left() > rx

TRUE	FALSE
yes Evaluation Count:2	yes Evaluation Count:28

2-28

1530 partOut = true; -

if (partIn)

partially evaluated: partIn

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:2

0-2

break;

never executed: break;

0

}

executed: }

Execution Count:2

2

1534 -

if (pbox->left() <= prect->right()) {

evaluated: pbox->left() <= prect->right()

TRUE	FALSE
yes Evaluation Count:28	yes Evaluation Count:2

2-28

1536 partIn = true; -

if (partOut)

partially evaluated: partOut

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:28

0-28

break;

never executed: break;

0

}

executed: }

Execution Count:28

28

1540 -

if (pbox->right() >= prect->right()) {

partially evaluated: pbox->right() >= prect->right()

TRUE	FALSE
yes Evaluation Count:30	no Evaluation Count:0

0-30

1542 ry = pbox->bottom() + 1; -

if (ry > prect->bottom())

evaluated: ry > prect->bottom()

TRUE	FALSE
yes Evaluation Count:18	yes Evaluation Count:12

12-18

break;

executed: break;

Execution Count:18

18

1545 rx = prect->left(); -

} else {

executed: }

Execution Count:12

12

1547 -

1548 -

1549 -

1550 -

1551 -

1552 -

1553 -

break;

never executed: break;

0

1555 } -

1556 } -

return partIn ? ((ry <= prect->bottom()) ? 2 : 1) : 0;

executed: return partIn ? ((ry <= prect->bottom()) ? 2 : 1) : 0;

Execution Count:32

32

1558 } -

1559 typedef struct { -

1560 int minor_axis; -

1561 int d; -

1562 int m, m1; -

1563 int incr1, incr2; -

1564 } BRESINFO; -

1565 typedef struct _EdgeTableEntry { -

1566 int ymax; -

1567 BRESINFO bres; -

1568 struct _EdgeTableEntry *next; -

1569 struct _EdgeTableEntry *back; -

1570 struct _EdgeTableEntry *nextWETE; -

1571 int ClockWise; -

1572 } EdgeTableEntry; -

1573 -

1574 -

1575 typedef struct _ScanLineList{ -

1576 int scanline; -

1577 EdgeTableEntry *edgelist; -

1578 struct _ScanLineList *next; -

1579 } ScanLineList; -

1580 -

1581 -

1582 typedef struct { -

1583 int ymax; -

1584 int ymin; -

1585 ScanLineList scanlines; -

1586 } EdgeTable; -

1587 typedef struct _ScanLineListBlock { -

1588 ScanLineList SLLs[25]; -

1589 struct _ScanLineListBlock *next; -

1590 } ScanLineListBlock; -

1591 static void InsertEdgeInET(EdgeTable *ET, EdgeTableEntry *ETE, int scanline, -

1592 ScanLineListBlock **SLLBlock, int *iSLLBlock) -

1593 { -

1594 register EdgeTableEntry *start, *prev; -

1595 register ScanLineList *pSLL, *pPrevSLL; -

1596 ScanLineListBlock *tmpSLLBlock; -

1597 -

1598 -

1599 -

1600 -

1601 pPrevSLL = &ET->scanlines; -

1602 pSLL = pPrevSLL->next; -

while (pSLL && (pSLL->scanline < scanline)) {

evaluated: pSLL

TRUE	FALSE
yes Evaluation Count:3866	yes Evaluation Count:181

evaluated: (pSLL->scanline < scanline)

TRUE	FALSE
yes Evaluation Count:3352	yes Evaluation Count:514

181-3866

1604 pPrevSLL = pSLL; -

1605 pSLL = pSLL->next; -

}

executed: }

Execution Count:3352

3352

1607 -

1608 -

1609 -

1610 -

if ((!pSLL) || (pSLL->scanline > scanline)) {

evaluated: (!pSLL)

TRUE	FALSE
yes Evaluation Count:181	yes Evaluation Count:514

evaluated: (pSLL->scanline > scanline)

TRUE	FALSE
yes Evaluation Count:165	yes Evaluation Count:349

165-514

if (*iSLLBlock > 25 -1)

evaluated: *iSLLBlock > 25 -1

TRUE	FALSE
yes Evaluation Count:8	yes Evaluation Count:338

8-338

1613 { -

1614 tmpSLLBlock = -

1615 (ScanLineListBlock *)malloc(sizeof(ScanLineListBlock)); -

1616 qt_noop(); -

1617 (*SLLBlock)->next = tmpSLLBlock; -

1618 tmpSLLBlock->next = (ScanLineListBlock *)__null; -

1619 *SLLBlock = tmpSLLBlock; -

1620 *iSLLBlock = 0; -

}

executed: }

Execution Count:8

8

1622 pSLL = &((*SLLBlock)->SLLs[(*iSLLBlock)++]); -

1623 -

1624 pSLL->next = pPrevSLL->next; -

1625 pSLL->edgelist = (EdgeTableEntry *)__null; -

1626 pPrevSLL->next = pSLL; -

}

executed: }

Execution Count:346

346

1628 pSLL->scanline = scanline; -

1629 -

1630 -

1631 -

1632 -

1633 prev = 0; -

1634 start = pSLL->edgelist; -

while (start && (start->bres.minor_axis < ETE->bres.minor_axis)) {

evaluated: start

TRUE	FALSE
yes Evaluation Count:355	yes Evaluation Count:509

evaluated: (start->bres.minor_axis < ETE->bres.minor_axis)

TRUE	FALSE
yes Evaluation Count:169	yes Evaluation Count:186

169-509

1636 prev = start; -

1637 start = start->next; -

}

executed: }

Execution Count:169

169

1639 ETE->next = start; -

1640 -

if (prev)

evaluated: prev

TRUE	FALSE
yes Evaluation Count:163	yes Evaluation Count:532

163-532

prev->next = ETE;

executed: prev->next = ETE;

Execution Count:163

163

1643 else -

pSLL->edgelist = ETE;

executed: pSLL->edgelist = ETE;

Execution Count:532

532

1645 } -

1646 static void CreateETandAET(register int count, register const QPoint *pts, -

1647 EdgeTable *ET, EdgeTableEntry *AET, register EdgeTableEntry *pETEs, -

1648 ScanLineListBlock *pSLLBlock) -

1649 { -

1650 register const QPoint *top, -

1651 *bottom, -

1652 *PrevPt, -

1653 *CurrPt; -

1654 int iSLLBlock = 0; -

1655 int dy; -

1656 -

partially evaluated: count < 2

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:21

0-21

return;

never executed: return;

0

1659 -

1660 -

1661 -

1662 -

1663 AET->next = 0; -

1664 AET->back = 0; -

1665 AET->nextWETE = 0; -

1666 AET->bres.minor_axis = (-2147483647 - 1); -

1667 -

1668 -

1669 -

1670 -

1671 ET->scanlines.next = 0; -

1672 ET->ymax = (-2147483647 - 1); -

1673 ET->ymin = 2147483647; -

1674 pSLLBlock->next = 0; -

1675 -

1676 PrevPt = &pts[count - 1]; -

1677 -

1678 -

1679 -

1680 -

1681 -

1682 -

while (count--) {

evaluated: count--

TRUE	FALSE
yes Evaluation Count:750	yes Evaluation Count:21

21-750

1684 CurrPt = pts++; -

1685 -

1686 -

1687 -

1688 -

if (PrevPt->y() > CurrPt->y()) {

evaluated: PrevPt->y() > CurrPt->y()

TRUE	FALSE
yes Evaluation Count:346	yes Evaluation Count:404

346-404

1690 bottom = PrevPt; -

1691 top = CurrPt; -

1692 pETEs->ClockWise = 0; -

} else {

executed: }

Execution Count:346

346

1694 bottom = CurrPt; -

1695 top = PrevPt; -

1696 pETEs->ClockWise = 1; -

}

executed: }

Execution Count:404

404

1698 -

1699 -

1700 -

1701 -

if (bottom->y() != top->y()) {

evaluated: bottom->y() != top->y()

TRUE	FALSE
yes Evaluation Count:695	yes Evaluation Count:55

55-695

1703 pETEs->ymax = bottom->y() - 1; -

1704 -

1705 -

1706 -

1707 -

1708 dy = bottom->y() - top->y(); -

{ int dx; if ((dy) != 0) { pETEs->bres.minor_axis = (top->x()); dx = (bottom->x()) - pETEs->bres.minor_axis; if (dx < 0) { pETEs->bres.m = dx / (dy); pETEs->bres.m1 = pETEs->bres.m - 1; pETEs->bres.incr1 = -2 * dx + 2 * (dy) * pETEs->bres.m1; pETEs->bres.incr2 = -2 * dx + 2 * (dy) * pETEs->bres.m; pETEs->bres.d = 2 * pETEs->bres.m * (dy) - 2 * dx - 2 * (dy); } else { pETEs->bres.m = dx / (dy); pETEs->bres.m1 = pETEs->bres.m + 1; pETEs->bres.incr1 = 2 * dx - 2 * (dy) * pETEs->bres.m1; pETEs->bres.incr2 = 2 * dx - 2 * (dy) * pETEs->bres.m; pETEs->bres.d = -2 * pETEs->bres.m * (dy) + 2 * dx; } } }

executed: }

Execution Count:324

executed: }

Execution Count:371

partially evaluated: (dy) != 0

TRUE	FALSE
yes Evaluation Count:695	no Evaluation Count:0

evaluated: dx < 0

TRUE	FALSE
yes Evaluation Count:324	yes Evaluation Count:371

0-695

1710 -

1711 InsertEdgeInET(ET, pETEs, top->y(), &pSLLBlock, &iSLLBlock); -

1712 -

if (PrevPt->y() > ET->ymax)

evaluated: PrevPt->y() > ET->ymax

TRUE	FALSE
yes Evaluation Count:199	yes Evaluation Count:496

199-496

ET->ymax = PrevPt->y();

executed: ET->ymax = PrevPt->y();

Execution Count:199

199

if (PrevPt->y() < ET->ymin)

evaluated: PrevPt->y() < ET->ymin

TRUE	FALSE
yes Evaluation Count:188	yes Evaluation Count:507

188-507

ET->ymin = PrevPt->y();

executed: ET->ymin = PrevPt->y();

Execution Count:188

188

1717 ++pETEs; -

}

executed: }

Execution Count:695

695

1719 -

1720 PrevPt = CurrPt; -

}

executed: }

Execution Count:750

750

executed: }

Execution Count:21

21

1723 static void loadAET(register EdgeTableEntry *AET, register EdgeTableEntry *ETEs) -

1724 { -

1725 register EdgeTableEntry *pPrevAET; -

1726 register EdgeTableEntry *tmp; -

1727 -

1728 pPrevAET = AET; -

1729 AET = AET->next; -

while (ETEs) {

evaluated: ETEs

TRUE	FALSE
yes Evaluation Count:695	yes Evaluation Count:346

346-695

while (AET && AET->bres.minor_axis < ETEs->bres.minor_axis) {

evaluated: AET

TRUE	FALSE
yes Evaluation Count:8	yes Evaluation Count:689

evaluated: AET->bres.minor_axis < ETEs->bres.minor_axis

TRUE	FALSE
yes Evaluation Count:2	yes Evaluation Count:6

2-689

1732 pPrevAET = AET; -

1733 AET = AET->next; -

}

executed: }

Execution Count:2

2

1735 tmp = ETEs->next; -

1736 ETEs->next = AET; -

if (AET)

evaluated: AET

TRUE	FALSE
yes Evaluation Count:6	yes Evaluation Count:689

6-689

AET->back = ETEs;

executed: AET->back = ETEs;

Execution Count:6

6

1739 ETEs->back = pPrevAET; -

1740 pPrevAET->next = ETEs; -

1741 pPrevAET = ETEs; -

1742 -

1743 ETEs = tmp; -

}

executed: }

Execution Count:695

695

executed: }

Execution Count:346

346

1746 static void computeWAET(register EdgeTableEntry *AET) -

1747 { -

1748 register EdgeTableEntry *pWETE; -

1749 register int inside = 1; -

1750 register int isInside = 0; -

1751 -

1752 AET->nextWETE = 0; -

1753 pWETE = AET; -

1754 AET = AET->next; -

while (AET) {

never evaluated: AET

0

if (AET->ClockWise)

never evaluated: AET->ClockWise

0

++isInside;

never executed: ++isInside;

0

1758 else -

--isInside;

never executed: --isInside;

0

1760 -

if ((!inside && !isInside) || (inside && isInside)) {

never evaluated: !inside

never evaluated: !isInside

never evaluated: inside

never evaluated: isInside

0

1762 pWETE->nextWETE = AET; -

1763 pWETE = AET; -

1764 inside = !inside; -

}

never executed: }

0

1766 AET = AET->next; -

}

never executed: }

0

1768 pWETE->nextWETE = 0; -

never executed: }

0

1770 static int InsertionSort(register EdgeTableEntry *AET) -

1771 { -

1772 register EdgeTableEntry *pETEchase; -

1773 register EdgeTableEntry *pETEinsert; -

1774 register EdgeTableEntry *pETEchaseBackTMP; -

1775 register int changed = 0; -

1776 -

1777 AET = AET->next; -

while (AET) {

evaluated: AET

TRUE	FALSE
yes Evaluation Count:8639	yes Evaluation Count:4477

4477-8639

1779 pETEinsert = AET; -

1780 pETEchase = AET; -

while (pETEchase->back->bres.minor_axis > AET->bres.minor_axis)

evaluated: pETEchase->back->bres.minor_axis > AET->bres.minor_axis

TRUE	FALSE
yes Evaluation Count:3	yes Evaluation Count:8639

3-8639

pETEchase = pETEchase->back;

executed: pETEchase = pETEchase->back;

Execution Count:3

3

1783 -

1784 AET = AET->next; -

if (pETEchase != pETEinsert) {

evaluated: pETEchase != pETEinsert

TRUE	FALSE
yes Evaluation Count:2	yes Evaluation Count:8637

2-8637

1786 pETEchaseBackTMP = pETEchase->back; -

1787 pETEinsert->back->next = AET; -

if (AET)

evaluated: AET

TRUE	FALSE
yes Evaluation Count:1	yes Evaluation Count:1

1

AET->back = pETEinsert->back;

executed: AET->back = pETEinsert->back;

Execution Count:1

1

1790 pETEinsert->next = pETEchase; -

1791 pETEchase->back->next = pETEinsert; -

1792 pETEchase->back = pETEinsert; -

1793 pETEinsert->back = pETEchaseBackTMP; -

1794 changed = 1; -

}

executed: }

Execution Count:2

2

}

executed: }

Execution Count:8639

8639

return changed;

executed: return changed;

Execution Count:4477

4477

1798 } -

1799 -

1800 -

1801 -

1802 -

1803 static void FreeStorage(register ScanLineListBlock *pSLLBlock) -

1804 { -

1805 register ScanLineListBlock *tmpSLLBlock; -

1806 -

while (pSLLBlock) {

evaluated: pSLLBlock

TRUE	FALSE
yes Evaluation Count:8	yes Evaluation Count:21

8-21

1808 tmpSLLBlock = pSLLBlock->next; -

1809 free(pSLLBlock); -

1810 pSLLBlock = tmpSLLBlock; -

}

executed: }

Execution Count:8

8

executed: }

Execution Count:21

21

1813 -

1814 struct QRegionSpan { -

1815 QRegionSpan() {} -

QRegionSpan(int x1_, int x2_) : x1(x1_), x2(x2_) {}

executed: }

Execution Count:4544

4544

1817 -

1818 int x1; -

1819 int x2; -

int width() const { return x2 - x1; }

executed: return x2 - x1;

Execution Count:2464

2464

1821 }; -

1822 -

1823 template<> class QTypeInfo<QRegionSpan > { public: enum { isComplex = (((Q_PRIMITIVE_TYPE) & Q_PRIMITIVE_TYPE) == 0), isStatic = (((Q_PRIMITIVE_TYPE) & (Q_MOVABLE_TYPE | Q_PRIMITIVE_TYPE)) == 0), isLarge = (sizeof(QRegionSpan)>sizeof(void*)), isPointer = false, isDummy = (((Q_PRIMITIVE_TYPE) & Q_DUMMY_TYPE) != 0), sizeOf = sizeof(QRegionSpan) }; static inline const char *name() { return "QRegionSpan"; } }; -

1824 -

1825 static inline void flushRow(const QRegionSpan *spans, int y, int numSpans, QRegionPrivate *reg, int *lastRow, int *extendTo, bool *needsExtend) -

1826 { -

1827 QRect *regRects = reg->rects.data() + *lastRow; -

bool canExtend = reg->rects.size() - *lastRow == numSpans

evaluated: reg->rects.size() - *lastRow == numSpans

TRUE	FALSE
yes Evaluation Count:4349	yes Evaluation Count:25

25-4349

&& !(*needsExtend && *extendTo + 1 != y)

evaluated: *needsExtend

TRUE	FALSE
yes Evaluation Count:1904	yes Evaluation Count:2445

evaluated: *extendTo + 1 != y

TRUE	FALSE
yes Evaluation Count:1	yes Evaluation Count:1903

1-2445

&& (*needsExtend || regRects[0].y() + regRects[0].height() == y);

evaluated: *needsExtend

TRUE	FALSE
yes Evaluation Count:1903	yes Evaluation Count:2445

evaluated: regRects[0].y() + regRects[0].height() == y

TRUE	FALSE
yes Evaluation Count:2444	yes Evaluation Count:1

1-2445

1831 -

for (int i = 0; i < numSpans && canExtend; ++i) {

evaluated: i < numSpans

TRUE	FALSE
yes Evaluation Count:4541	yes Evaluation Count:4347

evaluated: canExtend

TRUE	FALSE
yes Evaluation Count:4514	yes Evaluation Count:27

27-4541

if (regRects[i].x() != spans[i].x1 || regRects[i].right() != spans[i].x2 - 1)

evaluated: regRects[i].x() != spans[i].x1

TRUE	FALSE
yes Evaluation Count:2138	yes Evaluation Count:2376

evaluated: regRects[i].right() != spans[i].x2 - 1

TRUE	FALSE
yes Evaluation Count:296	yes Evaluation Count:2080

296-2376

canExtend = false;

executed: canExtend = false;

Execution Count:2434

2434

}

executed: }

Execution Count:4514

4514

1836 -

if (canExtend) {

evaluated: canExtend

TRUE	FALSE
yes Evaluation Count:1913	yes Evaluation Count:2461

1913-2461

1838 *extendTo = y; -

1839 *needsExtend = true; -

} else {

executed: }

Execution Count:1913

1913

if (*needsExtend) {

evaluated: *needsExtend

TRUE	FALSE
yes Evaluation Count:254	yes Evaluation Count:2207

254-2207

for (int i = 0; i < reg->rects.size() - *lastRow; ++i)

evaluated: i < reg->rects.size() - *lastRow

TRUE	FALSE
yes Evaluation Count:257	yes Evaluation Count:254

254-257

regRects[i].setBottom(*extendTo);

executed: regRects[i].setBottom(*extendTo);

Execution Count:257

257

}

executed: }

Execution Count:254

254

1845 -

1846 *lastRow = reg->rects.size(); -

1847 reg->rects.reserve(*lastRow + numSpans); -

for (int i = 0; i < numSpans; ++i)

evaluated: i < numSpans

TRUE	FALSE
yes Evaluation Count:2464	yes Evaluation Count:2461

2461-2464

reg->rects << QRect(spans[i].x1, y, spans[i].width(), 1);

executed: reg->rects << QRect(spans[i].x1, y, spans[i].width(), 1);

Execution Count:2464

2464

1850 -

if (spans[0].x1 < reg->extents.left())

evaluated: spans[0].x1 < reg->extents.left()

TRUE	FALSE
yes Evaluation Count:966	yes Evaluation Count:1495

966-1495

reg->extents.setLeft(spans[0].x1);

executed: reg->extents.setLeft(spans[0].x1);

Execution Count:966

966

1853 -

if (spans[numSpans-1].x2 - 1 > reg->extents.right())

evaluated: spans[numSpans-1].x2 - 1 > reg->extents.right()

TRUE	FALSE
yes Evaluation Count:1124	yes Evaluation Count:1337

1124-1337

reg->extents.setRight(spans[numSpans-1].x2 - 1);

executed: reg->extents.setRight(spans[numSpans-1].x2 - 1);

Execution Count:1124

1124

1856 -

1857 *needsExtend = false; -

}

executed: }

Execution Count:2461

2461

1859 } -

1860 static void PtsToRegion(register int numFullPtBlocks, register int iCurPtBlock, -

1861 POINTBLOCK *FirstPtBlock, QRegionPrivate *reg) -

1862 { -

1863 int lastRow = 0; -

1864 int extendTo = 0; -

1865 bool needsExtend = false; -

1866 QVarLengthArray<QRegionSpan> row; -

1867 int rowSize = 0; -

1868 -

1869 reg->extents.setLeft(2147483647); -

1870 reg->extents.setRight((-2147483647 - 1)); -

1871 reg->innerArea = -1; -

1872 -

1873 POINTBLOCK *CurPtBlock = FirstPtBlock; -

for (; numFullPtBlocks >= 0; --numFullPtBlocks) {

evaluated: numFullPtBlocks >= 0

TRUE	FALSE
yes Evaluation Count:63	yes Evaluation Count:21

21-63

1875 -

1876 int i = 200 >> 1; -

if (!numFullPtBlocks)

evaluated: !numFullPtBlocks

TRUE	FALSE
yes Evaluation Count:21	yes Evaluation Count:42

21-42

i = iCurPtBlock >> 1;

executed: i = iCurPtBlock >> 1;

Execution Count:21

21

if(i) {

evaluated: i

TRUE	FALSE
yes Evaluation Count:52	yes Evaluation Count:11

11-52

1880 row.resize(qMax(row.size(), rowSize + i)); -

for (QPoint *pts = CurPtBlock->pts; i--; pts += 2) {

evaluated: i--

TRUE	FALSE
yes Evaluation Count:4667	yes Evaluation Count:52

52-4667

1882 const int width = pts[1].x() - pts[0].x(); -

if (width) {

evaluated: width

TRUE	FALSE
yes Evaluation Count:4553	yes Evaluation Count:114

114-4553

if (rowSize && row[rowSize-1].x2 == pts[0].x())

evaluated: rowSize

TRUE	FALSE
yes Evaluation Count:179	yes Evaluation Count:4374

evaluated: row[rowSize-1].x2 == pts[0].x()

TRUE	FALSE
yes Evaluation Count:9	yes Evaluation Count:170

9-4374

row[rowSize-1].x2 = pts[1].x();

executed: row[rowSize-1].x2 = pts[1].x();

Execution Count:9

9

1886 else -

row[rowSize++] = QRegionSpan(pts[0].x(), pts[1].x());

executed: row[rowSize++] = QRegionSpan(pts[0].x(), pts[1].x());

Execution Count:4544

4544

1888 } -

1889 -

if (rowSize) {

evaluated: rowSize

TRUE	FALSE
yes Evaluation Count:4553	yes Evaluation Count:114

114-4553

QPoint *next = i ? &pts[2] : (numFullPtBlocks ? CurPtBlock->next->pts : 0);

evaluated: i

TRUE	FALSE
yes Evaluation Count:4502	yes Evaluation Count:51

51-4502

1892 -

if (!next || next->y() != pts[0].y()) {

evaluated: !next

TRUE	FALSE
yes Evaluation Count:10	yes Evaluation Count:4543

evaluated: next->y() != pts[0].y()

TRUE	FALSE
yes Evaluation Count:4364	yes Evaluation Count:179

10-4543

1894 flushRow(row.data(), pts[0].y(), rowSize, reg, &lastRow, &extendTo, &needsExtend); -

1895 rowSize = 0; -

}

executed: }

Execution Count:4374

4374

}

executed: }

Execution Count:4553

4553

}

executed: }

Execution Count:4667

4667

}

executed: }

Execution Count:52

52

1900 CurPtBlock = CurPtBlock->next; -

}

executed: }

Execution Count:63

63

1902 -

if (needsExtend) {

evaluated: needsExtend

TRUE	FALSE
yes Evaluation Count:5	yes Evaluation Count:16

5-16

for (int i = lastRow; i < reg->rects.size(); ++i)

evaluated: i < reg->rects.size()

TRUE	FALSE
yes Evaluation Count:5	yes Evaluation Count:5

5

reg->rects[i].setBottom(extendTo);

executed: reg->rects[i].setBottom(extendTo);

Execution Count:5

5

}

executed: }

Execution Count:5

5

1907 -

1908 reg->numRects = reg->rects.size(); -

1909 -

if (reg->numRects) {

partially evaluated: reg->numRects

TRUE	FALSE
yes Evaluation Count:21	no Evaluation Count:0

0-21

1911 reg->extents.setTop(reg->rects[0].top()); -

1912 reg->extents.setBottom(reg->rects[lastRow].bottom()); -

1913 -

for (int i = 0; i < reg->rects.size(); ++i)

evaluated: i < reg->rects.size()

TRUE	FALSE
yes Evaluation Count:2464	yes Evaluation Count:21

21-2464

reg->updateInnerRect(reg->rects[i]);

executed: reg->updateInnerRect(reg->rects[i]);

Execution Count:2464

2464

} else {

executed: }

Execution Count:21

21

1917 reg->extents.setCoords(0, 0, 0, 0); -

}

never executed: }

0

1919 } -

1920 static QRegionPrivate *PolygonRegion(const QPoint *Pts, int Count, int rule) -

1921 -

1922 -

1923 -

1924 { -

1925 QRegionPrivate *region; -

1926 register EdgeTableEntry *pAET; -

1927 register int y; -

1928 register int iPts = 0; -

1929 register EdgeTableEntry *pWETE; -

1930 register ScanLineList *pSLL; -

1931 register QPoint *pts; -

1932 EdgeTableEntry *pPrevAET; -

1933 EdgeTable ET; -

1934 EdgeTableEntry AET; -

1935 EdgeTableEntry *pETEs; -

1936 ScanLineListBlock SLLBlock; -

1937 int fixWAET = false; -

1938 POINTBLOCK FirstPtBlock, *curPtBlock; -

1939 FirstPtBlock.pts = reinterpret_cast<QPoint *>(FirstPtBlock.data); -

1940 POINTBLOCK *tmpPtBlock; -

1941 int numFullPtBlocks = 0; -

1942 -

if (!(region = new QRegionPrivate))

partially evaluated: !(region = new QRegionPrivate)

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:27

0-27

never executed: return 0;

0

1945 -

1946 -

if (((Count == 4) ||

evaluated: (Count == 4)

TRUE	FALSE
yes Evaluation Count:2	yes Evaluation Count:25

2-25

((Count == 5) && (Pts[4].x() == Pts[0].x()) && (Pts[4].y() == Pts[0].y())))

evaluated: (Count == 5)

TRUE	FALSE
yes Evaluation Count:7	yes Evaluation Count:18

partially evaluated: (Pts[4].x() == Pts[0].x())

TRUE	FALSE
yes Evaluation Count:7	no Evaluation Count:0

partially evaluated: (Pts[4].y() == Pts[0].y())

TRUE	FALSE
yes Evaluation Count:7	no Evaluation Count:0

0-18

&& (((Pts[0].y() == Pts[1].y()) && (Pts[1].x() == Pts[2].x()) && (Pts[2].y() == Pts[3].y())

evaluated: (Pts[0].y() == Pts[1].y())

TRUE	FALSE
yes Evaluation Count:1	yes Evaluation Count:8

partially evaluated: (Pts[1].x() == Pts[2].x())

TRUE	FALSE
yes Evaluation Count:1	no Evaluation Count:0

partially evaluated: (Pts[2].y() == Pts[3].y())

TRUE	FALSE
yes Evaluation Count:1	no Evaluation Count:0

0-8

&& (Pts[3].x() == Pts[0].x())) || ((Pts[0].x() == Pts[1].x())

partially evaluated: (Pts[3].x() == Pts[0].x())

TRUE	FALSE
yes Evaluation Count:1	no Evaluation Count:0

evaluated: (Pts[0].x() == Pts[1].x())

TRUE	FALSE
yes Evaluation Count:5	yes Evaluation Count:3

0-5

&& (Pts[1].y() == Pts[2].y()) && (Pts[2].x() == Pts[3].x())

partially evaluated: (Pts[1].y() == Pts[2].y())

TRUE	FALSE
yes Evaluation Count:5	no Evaluation Count:0

partially evaluated: (Pts[2].x() == Pts[3].x())

TRUE	FALSE
yes Evaluation Count:5	no Evaluation Count:0

0-5

&& (Pts[3].y() == Pts[0].y())))) {

partially evaluated: (Pts[3].y() == Pts[0].y())

TRUE	FALSE
yes Evaluation Count:5	no Evaluation Count:0

0-5

1953 int x = qMin(Pts[0].x(), Pts[2].x()); -

1954 region->extents.setLeft(x); -

1955 int y = qMin(Pts[0].y(), Pts[2].y()); -

1956 region->extents.setTop(y); -

1957 region->extents.setWidth(qMax(Pts[0].x(), Pts[2].x()) - x); -

1958 region->extents.setHeight(qMax(Pts[0].y(), Pts[2].y()) - y); -

if ((region->extents.left() <= region->extents.right()) &&

partially evaluated: (region->extents.left() <= region->extents.right())

TRUE	FALSE
yes Evaluation Count:6	no Evaluation Count:0

0-6

(region->extents.top() <= region->extents.bottom())) {

partially evaluated: (region->extents.top() <= region->extents.bottom())

TRUE	FALSE
yes Evaluation Count:6	no Evaluation Count:0

0-6

1961 region->numRects = 1; -

1962 region->innerRect = region->extents; -

1963 region->innerArea = region->innerRect.width() * region->innerRect.height(); -

}

executed: }

Execution Count:6

6

executed: return region;

Execution Count:6

6

1966 } -

1967 -

if (!(pETEs = static_cast<EdgeTableEntry *>(malloc(sizeof(EdgeTableEntry) * Count))))

partially evaluated: !(pETEs = static_cast<EdgeTableEntry *>(malloc(sizeof(EdgeTableEntry) * Count)))

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:21

0-21

never executed: return 0;

0

1970 -

1971 region->vectorize(); -

1972 -

1973 pts = FirstPtBlock.pts; -

1974 CreateETandAET(Count, Pts, &ET, &AET, pETEs, &SLLBlock); -

1975 -

1976 pSLL = ET.scanlines.next; -

1977 curPtBlock = &FirstPtBlock; -

1978 -

1979 -

if (ET.ymax - ET.ymin > 100000) {

partially evaluated: ET.ymax - ET.ymin > 100000

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:21

0-21

1981 -

1982 -

1983 -

1984 -

1985 delete region; -

never executed: return 0;

0

1987 } -

1988 -

1989 -

if (true) {

partially evaluated: true

TRUE	FALSE
yes Evaluation Count:21	no Evaluation Count:0

0-21

if (rule == 0) {

partially evaluated: rule == 0

TRUE	FALSE
yes Evaluation Count:21	no Evaluation Count:0

0-21

1992 -

1993 -

1994 -

for (y = ET.ymin; y < ET.ymax; ++y) {

evaluated: y < ET.ymax

TRUE	FALSE
yes Evaluation Count:4477	yes Evaluation Count:21

21-4477

1996 -

1997 -

1998 -

1999 -

2000 -

if (pSLL && y == pSLL->scanline) {

evaluated: pSLL

TRUE	FALSE
yes Evaluation Count:2660	yes Evaluation Count:1817

evaluated: y == pSLL->scanline

TRUE	FALSE
yes Evaluation Count:346	yes Evaluation Count:2314

346-2660

2002 loadAET(&AET, pSLL->edgelist); -

2003 pSLL = pSLL->next; -

}

executed: }

Execution Count:346

346

2005 pPrevAET = &AET; -

2006 pAET = AET.next; -

2007 -

2008 -

2009 -

2010 -

while (pAET) {

evaluated: pAET

TRUE	FALSE
yes Evaluation Count:9334	yes Evaluation Count:4477

4477-9334

2012 pts->setX(pAET->bres.minor_axis); -

2013 pts->setY(y); -

2014 ++pts; -

2015 ++iPts; -

2016 -

2017 -

2018 -

2019 -

if (iPts == 200) {

evaluated: iPts == 200

TRUE	FALSE
yes Evaluation Count:42	yes Evaluation Count:9292

42-9292

2021 tmpPtBlock = (POINTBLOCK *)malloc(sizeof(POINTBLOCK)); -

2022 qt_noop(); -

2023 tmpPtBlock->pts = reinterpret_cast<QPoint *>(tmpPtBlock->data); -

2024 curPtBlock->next = tmpPtBlock; -

2025 curPtBlock = tmpPtBlock; -

2026 pts = curPtBlock->pts; -

2027 ++numFullPtBlocks; -

2028 iPts = 0; -

}

executed: }

Execution Count:42

42

{ if (pAET->ymax == y) { pPrevAET->next = pAET->next; pAET = pPrevAET->next; if (pAET) pAET->back = pPrevAET; } else { { if (pAET->bres.m1 > 0) { if (pAET->bres.d > 0) { pAET->bres.minor_axis += pAET->bres.m1; pAET->bres.d += pAET->bres.incr1; } else { pAET->bres.minor_axis += pAET->bres.m; pAET->bres.d += pAET->bres.incr2; } } else { if (pAET->bres.d >= 0) { pAET->bres.minor_axis += pAET->bres.m1; pAET->bres.d += pAET->bres.incr1; } else { pAET->bres.minor_axis += pAET->bres.m; pAET->bres.d += pAET->bres.incr2; } } } pPrevAET = pAET; pAET = pAET->next; } }

executed: pAET->back = pPrevAET;

Execution Count:353

executed: }

Execution Count:695

executed: }

Execution Count:1204

executed: }

Execution Count:5157

executed: }

Execution Count:500

executed: }

Execution Count:1778

executed: }

Execution Count:8639

evaluated: pAET

TRUE	FALSE
yes Evaluation Count:353	yes Evaluation Count:342

evaluated: pAET->ymax == y

TRUE	FALSE
yes Evaluation Count:695	yes Evaluation Count:8639

evaluated: pAET->bres.m1 > 0

TRUE	FALSE
yes Evaluation Count:6361	yes Evaluation Count:2278

evaluated: pAET->bres.d > 0

TRUE	FALSE
yes Evaluation Count:1204	yes Evaluation Count:5157

evaluated: pAET->bres.d >= 0

TRUE	FALSE
yes Evaluation Count:500	yes Evaluation Count:1778

342-8639

2031 } -

2032 InsertionSort(&AET); -

}

executed: }

Execution Count:4477

4477

} else {

executed: }

Execution Count:21

21

2035 -

2036 -

2037 -

for (y = ET.ymin; y < ET.ymax; ++y) {

never evaluated: y < ET.ymax

0

2039 -

2040 -

2041 -

2042 -

if (pSLL && y == pSLL->scanline) {

never evaluated: pSLL

never evaluated: y == pSLL->scanline

0

2044 loadAET(&AET, pSLL->edgelist); -

2045 computeWAET(&AET); -

2046 pSLL = pSLL->next; -

}

never executed: }

0

2048 pPrevAET = &AET; -

2049 pAET = AET.next; -

2050 pWETE = pAET; -

2051 -

2052 -

2053 -

2054 -

while (pAET) {

never evaluated: pAET

0

2056 -

2057 -

2058 -

2059 -

if (pWETE == pAET) {

never evaluated: pWETE == pAET

0

2061 pts->setX(pAET->bres.minor_axis); -

2062 pts->setY(y); -

2063 ++pts; -

2064 ++iPts; -

2065 -

2066 -

2067 -

2068 -

if (iPts == 200) {

never evaluated: iPts == 200

0

2070 tmpPtBlock = static_cast<POINTBLOCK *>(malloc(sizeof(POINTBLOCK))); -

2071 tmpPtBlock->pts = reinterpret_cast<QPoint *>(tmpPtBlock->data); -

2072 curPtBlock->next = tmpPtBlock; -

2073 curPtBlock = tmpPtBlock; -

2074 pts = curPtBlock->pts; -

2075 ++numFullPtBlocks; -

2076 iPts = 0; -

}

never executed: }

0

2078 pWETE = pWETE->nextWETE; -

}

never executed: }

0

{ if (pAET->ymax == y) { pPrevAET->next = pAET->next; pAET = pPrevAET->next; fixWAET = 1; if (pAET) pAET->back = pPrevAET; } else { { if (pAET->bres.m1 > 0) { if (pAET->bres.d > 0) { pAET->bres.minor_axis += pAET->bres.m1; pAET->bres.d += pAET->bres.incr1; } else { pAET->bres.minor_axis += pAET->bres.m; pAET->bres.d += pAET->bres.incr2; } } else { if (pAET->bres.d >= 0) { pAET->bres.minor_axis += pAET->bres.m1; pAET->bres.d += pAET->bres.incr1; } else { pAET->bres.minor_axis += pAET->bres.m; pAET->bres.d += pAET->bres.incr2; } } } pPrevAET = pAET; pAET = pAET->next; } }

never executed: pAET->back = pPrevAET;

never executed: }

never executed: }

never executed: }

never executed: }

never executed: }

never executed: }

never evaluated: pAET

never evaluated: pAET->ymax == y

never evaluated: pAET->bres.m1 > 0

never evaluated: pAET->bres.d > 0

never evaluated: pAET->bres.d >= 0

0

2081 } -

2082 -

2083 -

2084 -

2085 -

2086 -

if (InsertionSort(&AET) || fixWAET) {

never evaluated: InsertionSort(&AET)

never evaluated: fixWAET

0

2088 computeWAET(&AET); -

2089 fixWAET = false; -

}

never executed: }

0

}

never executed: }

0

}

never executed: }

0

2093 } else { -

2094 FreeStorage(SLLBlock.next); -

2095 PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); -

for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) {

never evaluated: --numFullPtBlocks >= 0

0

2097 tmpPtBlock = curPtBlock->next; -

2098 free(curPtBlock); -

2099 curPtBlock = tmpPtBlock; -

}

never executed: }

0

2101 free(pETEs); -

never executed: return 0;

0

2103 } -

2104 -

2105 FreeStorage(SLLBlock.next); -

2106 PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); -

for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) {

evaluated: --numFullPtBlocks >= 0

TRUE	FALSE
yes Evaluation Count:42	yes Evaluation Count:21

21-42

2108 tmpPtBlock = curPtBlock->next; -

2109 free(curPtBlock); -

2110 curPtBlock = tmpPtBlock; -

}

executed: }

Execution Count:42

42

2112 free(pETEs); -

executed: return region;

Execution Count:21

21

2114 } -

2115 -

2116 -

2117 QRegionPrivate *qt_bitmapToRegion(const QBitmap& bitmap) -

2118 { -

2119 QImage image = bitmap.toImage(); -

2120 -

2121 QRegionPrivate *region = new QRegionPrivate; -

2122 -

2123 QRect xr; -

2124 -

2125 -

2126 -

2127 -

2128 -

2129 -

2130 -

2131 const uchar zero = 0; -

2132 bool little = image.format() == QImage::Format_MonoLSB; -

2133 -

2134 int x, -

2135 y; -

for (y = 0; y < image.height(); ++y) {

evaluated: y < image.height()

TRUE	FALSE
yes Evaluation Count:315	yes Evaluation Count:5

5-315

2137 uchar *line = image.scanLine(y); -

2138 int w = image.width(); -

2139 uchar all = zero; -

2140 int prev1 = -1; -

for (x = 0; x < w;) {

evaluated: x < w

TRUE	FALSE
yes Evaluation Count:4485	yes Evaluation Count:315

315-4485

2142 uchar byte = line[x / 8]; -

if (x > w - 8 || byte!=all) {

evaluated: x > w - 8

TRUE	FALSE
yes Evaluation Count:315	yes Evaluation Count:4170

evaluated: byte!=all

TRUE	FALSE
yes Evaluation Count:391	yes Evaluation Count:3779

315-4170

if (little) {

partially evaluated: little

TRUE	FALSE
yes Evaluation Count:706	no Evaluation Count:0

0-706

for (int b = 8; b > 0 && x < w; --b) {

evaluated: b > 0

TRUE	FALSE
yes Evaluation Count:4113	yes Evaluation Count:391

evaluated: x < w

TRUE	FALSE
yes Evaluation Count:3798	yes Evaluation Count:315

315-4113

if (!(byte & 0x01) == !all) {

evaluated: !(byte & 0x01) == !all

TRUE	FALSE
yes Evaluation Count:3337	yes Evaluation Count:461

461-3337

2147 -

} else {

executed: }

Execution Count:3337

3337

2149 -

if (all!=zero) {

evaluated: all!=zero

TRUE	FALSE
yes Evaluation Count:146	yes Evaluation Count:315

146-315

2151 { xr.setCoords(prev1, y, x-1, y); UnionRectWithRegion(&xr, region, *region); } -

2152 all = zero; -

} else {

executed: }

Execution Count:146

146

2154 prev1 = x; -

2155 all = ~zero; -

}

executed: }

Execution Count:315

315

2157 } -

2158 byte >>= 1; -

2159 ++x; -

}

executed: }

Execution Count:3798

3798

} else {

executed: }

Execution Count:706

706

for (int b = 8; b > 0 && x < w; --b) {

never evaluated: b > 0

never evaluated: x < w

0

if (!(byte & 0x80) == !all) {

never evaluated: !(byte & 0x80) == !all

0

2164 -

} else {

never executed: }

0

2166 -

if (all != zero) {

never evaluated: all != zero

0

2168 { xr.setCoords(prev1, y, x-1, y); UnionRectWithRegion(&xr, region, *region); } -

2169 all = zero; -

} else {

never executed: }

0

2171 prev1 = x; -

2172 all = ~zero; -

}

never executed: }

0

2174 } -

2175 byte <<= 1; -

2176 ++x; -

}

never executed: }

0

}

never executed: }

0

2179 } else { -

2180 x += 8; -

}

executed: }

Execution Count:3779

3779

2182 } -

if (all != zero) {

evaluated: all != zero

TRUE	FALSE
yes Evaluation Count:169	yes Evaluation Count:146

146-169

2184 { xr.setCoords(prev1, y, x-1, y); UnionRectWithRegion(&xr, region, *region); } -

}

executed: }

Execution Count:169

169

}

executed: }

Execution Count:315

315

2187 -

2188 -

executed: return region;

Execution Count:5

5

2190 } -

2191 -

2192 QRegion::QRegion() -

2193 : d(&shared_empty) -

2194 { -

2195 d->ref.ref(); -

executed: }

Execution Count:499990

499990

2197 -

2198 QRegion::QRegion(const QRect &r, RegionType t) -

2199 { -

if (r.isEmpty()) {

evaluated: r.isEmpty()

TRUE	FALSE
yes Evaluation Count:8172	yes Evaluation Count:139839

8172-139839

2201 d = &shared_empty; -

2202 d->ref.ref(); -

} else {

executed: }

Execution Count:8172

8172

2204 d = new QRegionData; -

2205 d->ref.store(1); -

if (t == Rectangle) {

evaluated: t == Rectangle

TRUE	FALSE
yes Evaluation Count:139827	yes Evaluation Count:12

12-139827

2207 d->qt_rgn = new QRegionPrivate(r); -

} else if (t == Ellipse) {

executed: }

Execution Count:139827

partially evaluated: t == Ellipse

TRUE	FALSE
yes Evaluation Count:12	no Evaluation Count:0

0-139827

2209 QPainterPath path; -

2210 path.addEllipse(r.x(), r.y(), r.width(), r.height()); -

2211 QPolygon a = path.toSubpathPolygons().at(0).toPolygon(); -

2212 d->qt_rgn = PolygonRegion(a.constData(), a.size(), 0); -

}

executed: }

Execution Count:12

12

2214 } -

2215 } -

2216 -

2217 QRegion::QRegion(const QPolygon &a, Qt::FillRule fillRule) -

2218 { -

if (a.count() > 2) {

evaluated: a.count() > 2

TRUE	FALSE
yes Evaluation Count:15	yes Evaluation Count:6

6-15

2220 QRegionPrivate *qt_rgn = PolygonRegion(a.constData(), a.size(), -

2221 fillRule == Qt::WindingFill ? 1 : 0); -

if (qt_rgn) {

partially evaluated: qt_rgn

TRUE	FALSE
yes Evaluation Count:15	no Evaluation Count:0

0-15

2223 d = new QRegionData; -

2224 d->ref.store(1); -

2225 d->qt_rgn = qt_rgn; -

} else {

executed: }

Execution Count:15

15

2227 d = &shared_empty; -

2228 d->ref.ref(); -

}

never executed: }

0

2230 } else { -

2231 d = &shared_empty; -

2232 d->ref.ref(); -

}

executed: }

Execution Count:6

6

2234 } -

2235 -

2236 QRegion::QRegion(const QRegion &r) -

2237 { -

2238 d = r.d; -

2239 d->ref.ref(); -

executed: }

Execution Count:372035

372035

2241 -

2242 -

2243 QRegion::QRegion(const QBitmap &bm) -

2244 { -

if (bm.isNull()) {

evaluated: bm.isNull()

TRUE	FALSE
yes Evaluation Count:1	yes Evaluation Count:5

1-5

2246 d = &shared_empty; -

2247 d->ref.ref(); -

} else {

executed: }

Execution Count:1

1

2249 d = new QRegionData; -

2250 d->ref.store(1); -

2251 d->qt_rgn = qt_bitmapToRegion(bm); -

}

executed: }

Execution Count:5

5

2253 } -

2254 -

2255 void QRegion::cleanUp(QRegion::QRegionData *x) -

2256 { -

2257 delete x->qt_rgn; -

2258 delete x; -

executed: }

Execution Count:204421

204421

2260 -

2261 QRegion::~QRegion() -

2262 { -

if (!d->ref.deref())

evaluated: !d->ref.deref()

TRUE	FALSE
yes Evaluation Count:172111	yes Evaluation Count:853049

172111-853049

executed: cleanUp(d);

Execution Count:172111

172111

executed: }

Execution Count:1025160

1025160

2266 -

2267 -

2268 QRegion &QRegion::operator=(const QRegion &r) -

2269 { -

2270 r.d->ref.ref(); -

if (!d->ref.deref())

evaluated: !d->ref.deref()

TRUE	FALSE
yes Evaluation Count:32310	yes Evaluation Count:127335

32310-127335

executed: cleanUp(d);

Execution Count:32310

32310

2273 d = r.d; -

executed: return *this;

Execution Count:159645

159645

2275 } -

2276 -

2277 -

2278 -

2279 -

2280 -

2281 QRegion QRegion::copy() const -

2282 { -

2283 QRegion r; -

2284 QScopedPointer<QRegionData> x(new QRegionData); -

2285 x->ref.store(1); -

partially evaluated: d->qt_rgn

TRUE	FALSE
yes Evaluation Count:64594	no Evaluation Count:0

0-64594

x->qt_rgn = new QRegionPrivate(*d->qt_rgn);

executed: x->qt_rgn = new QRegionPrivate(*d->qt_rgn);

Execution Count:64594

64594

2288 else -

x->qt_rgn = new QRegionPrivate;

never executed: x->qt_rgn = new QRegionPrivate;

0

if (!r.d->ref.deref())

partially evaluated: !r.d->ref.deref()

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:64594

0-64594

never executed: cleanUp(r.d);

0

2292 r.d = x.take(); -

executed: return r;

Execution Count:64594

64594

2294 } -

2295 -

2296 bool QRegion::isEmpty() const -

2297 { -

return d == &shared_empty || d->qt_rgn->numRects == 0;

executed: return d == &shared_empty || d->qt_rgn->numRects == 0;

Execution Count:310727

310727

2299 } -

2300 -

2301 bool QRegion::isNull() const -

2302 { -

return d == &shared_empty || d->qt_rgn->numRects == 0;

executed: return d == &shared_empty || d->qt_rgn->numRects == 0;

Execution Count:3369

3369

2304 } -

2305 -

2306 bool QRegion::contains(const QPoint &p) const -

2307 { -

return PointInRegion(d->qt_rgn, p.x(), p.y());

executed: return PointInRegion(d->qt_rgn, p.x(), p.y());

Execution Count:200048

200048

2309 } -

2310 -

2311 bool QRegion::contains(const QRect &r) const -

2312 { -

return RectInRegion(d->qt_rgn, r.left(), r.top(), r.width(), r.height()) != 0;

executed: return RectInRegion(d->qt_rgn, r.left(), r.top(), r.width(), r.height()) != 0;

Execution Count:41

41

2314 } -

2315 -

2316 -

2317 -

2318 void QRegion::translate(int dx, int dy) -

2319 { -

if ((dx == 0 && dy == 0) || isEmptyHelper(d->qt_rgn))

evaluated: dx == 0

TRUE	FALSE
yes Evaluation Count:15945	yes Evaluation Count:52449

evaluated: dy == 0

TRUE	FALSE
yes Evaluation Count:12033	yes Evaluation Count:3912

evaluated: isEmptyHelper(d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:5236	yes Evaluation Count:51125

3912-52449

return;

executed: return;

Execution Count:17269

17269

2322 -

2323 detach(); -

2324 OffsetRegion(*d->qt_rgn, dx, dy); -

executed: }

Execution Count:51125

51125

2326 -

2327 QRegion QRegion::united(const QRegion &r) const -

2328 { -

if (isEmptyHelper(d->qt_rgn))

evaluated: isEmptyHelper(d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:7375	yes Evaluation Count:12395

7375-12395

executed: return r;

Execution Count:7375

7375

if (isEmptyHelper(r.d->qt_rgn))

evaluated: isEmptyHelper(r.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:688	yes Evaluation Count:11707

688-11707

executed: return *this;

Execution Count:688

688

if (d == r.d)

evaluated: d == r.d

TRUE	FALSE
yes Evaluation Count:4	yes Evaluation Count:11703

4-11703

executed: return *this;

Execution Count:4

4

2335 -

if (d->qt_rgn->contains(*r.d->qt_rgn)) {

evaluated: d->qt_rgn->contains(*r.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:2477	yes Evaluation Count:9226

2477-9226

executed: return *this;

Execution Count:2477

2477

} else if (r.d->qt_rgn->contains(*d->qt_rgn)) {

evaluated: r.d->qt_rgn->contains(*d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:86	yes Evaluation Count:9140

86-9140

executed: return r;

Execution Count:86

86

} else if (d->qt_rgn->canAppend(r.d->qt_rgn)) {

evaluated: d->qt_rgn->canAppend(r.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:7006	yes Evaluation Count:2134

2134-7006

2341 QRegion result(*this); -

2342 result.detach(); -

2343 result.d->qt_rgn->append(r.d->qt_rgn); -

executed: return result;

Execution Count:7006

7006

} else if (d->qt_rgn->canPrepend(r.d->qt_rgn)) {

evaluated: d->qt_rgn->canPrepend(r.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:1870	yes Evaluation Count:264

264-1870

2346 QRegion result(*this); -

2347 result.detach(); -

2348 result.d->qt_rgn->prepend(r.d->qt_rgn); -

executed: return result;

Execution Count:1870

1870

} else if (EqualRegion(d->qt_rgn, r.d->qt_rgn)) {

partially evaluated: EqualRegion(d->qt_rgn, r.d->qt_rgn)

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:264

0-264

never executed: return *this;

0

2352 } else { -

2353 QRegion result; -

2354 result.detach(); -

2355 UnionRegion(d->qt_rgn, r.d->qt_rgn, *result.d->qt_rgn); -

executed: return result;

Execution Count:264

264

2357 } -

2358 } -

2359 -

2360 QRegion& QRegion::operator+=(const QRegion &r) -

2361 { -

if (isEmptyHelper(d->qt_rgn))

evaluated: isEmptyHelper(d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:15939	yes Evaluation Count:26096

15939-26096

return *this = r;

executed: return *this = r;

Execution Count:15939

15939

if (isEmptyHelper(r.d->qt_rgn))

evaluated: isEmptyHelper(r.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:2	yes Evaluation Count:26094

2-26094

executed: return *this;

Execution Count:2

2

if (d == r.d)

evaluated: d == r.d

TRUE	FALSE
yes Evaluation Count:12	yes Evaluation Count:26082

12-26082

executed: return *this;

Execution Count:12

12

2368 -

if (d->qt_rgn->contains(*r.d->qt_rgn)) {

evaluated: d->qt_rgn->contains(*r.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:6685	yes Evaluation Count:19397

6685-19397

executed: return *this;

Execution Count:6685

6685

} else if (r.d->qt_rgn->contains(*d->qt_rgn)) {

evaluated: r.d->qt_rgn->contains(*d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:625	yes Evaluation Count:18772

625-18772

return *this = r;

executed: return *this = r;

Execution Count:625

625

} else if (d->qt_rgn->canAppend(r.d->qt_rgn)) {

evaluated: d->qt_rgn->canAppend(r.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:2336	yes Evaluation Count:16436

2336-16436

2374 detach(); -

2375 d->qt_rgn->append(r.d->qt_rgn); -

executed: return *this;

Execution Count:2336

2336

} else if (d->qt_rgn->canPrepend(r.d->qt_rgn)) {

evaluated: d->qt_rgn->canPrepend(r.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:2613	yes Evaluation Count:13823

2613-13823

2378 detach(); -

2379 d->qt_rgn->prepend(r.d->qt_rgn); -

executed: return *this;

Execution Count:2613

2613

} else if (EqualRegion(d->qt_rgn, r.d->qt_rgn)) {

evaluated: EqualRegion(d->qt_rgn, r.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:214	yes Evaluation Count:13609

214-13609

executed: return *this;

Execution Count:214

214

2383 } else { -

2384 detach(); -

2385 UnionRegion(d->qt_rgn, r.d->qt_rgn, *d->qt_rgn); -

executed: return *this;

Execution Count:13609

13609

2387 } -

2388 } -

2389 -

2390 QRegion QRegion::united(const QRect &r) const -

2391 { -

if (isEmptyHelper(d->qt_rgn))

evaluated: isEmptyHelper(d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:3	yes Evaluation Count:31

3-31

executed: return r;

Execution Count:3

3

if (r.isEmpty())

evaluated: r.isEmpty()

TRUE	FALSE
yes Evaluation Count:1	yes Evaluation Count:30

1-30

executed: return *this;

Execution Count:1

1

2396 -

if (d->qt_rgn->contains(r)) {

evaluated: d->qt_rgn->contains(r)

TRUE	FALSE
yes Evaluation Count:4	yes Evaluation Count:26

4-26

executed: return *this;

Execution Count:4

4

} else if (d->qt_rgn->within(r)) {

partially evaluated: d->qt_rgn->within(r)

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:26

0-26

never executed: return r;

0

} else if (d->qt_rgn->numRects == 1 && d->qt_rgn->extents == r) {

evaluated: d->qt_rgn->numRects == 1

TRUE	FALSE
yes Evaluation Count:20	yes Evaluation Count:6

partially evaluated: d->qt_rgn->extents == r

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:20

0-20

never executed: return *this;

0

} else if (d->qt_rgn->canAppend(&r)) {

evaluated: d->qt_rgn->canAppend(&r)

TRUE	FALSE
yes Evaluation Count:13	yes Evaluation Count:13

13

2404 QRegion result(*this); -

2405 result.detach(); -

2406 result.d->qt_rgn->append(&r); -

executed: return result;

Execution Count:13

13

} else if (d->qt_rgn->canPrepend(&r)) {

evaluated: d->qt_rgn->canPrepend(&r)

TRUE	FALSE
yes Evaluation Count:5	yes Evaluation Count:8

5-8

2409 QRegion result(*this); -

2410 result.detach(); -

2411 result.d->qt_rgn->prepend(&r); -

executed: return result;

Execution Count:5

5

2413 } else { -

2414 QRegion result; -

2415 result.detach(); -

2416 QRegionPrivate rp(r); -

2417 UnionRegion(d->qt_rgn, &rp, *result.d->qt_rgn); -

executed: return result;

Execution Count:8

8

2419 } -

2420 } -

2421 -

2422 QRegion& QRegion::operator+=(const QRect &r) -

2423 { -

if (isEmptyHelper(d->qt_rgn))

evaluated: isEmptyHelper(d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:8183	yes Evaluation Count:11051

8183-11051

return *this = r;

executed: return *this = r;

Execution Count:8183

8183

if (r.isEmpty())

partially evaluated: r.isEmpty()

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:11051

0-11051

never executed: return *this;

0

2428 -

if (d->qt_rgn->contains(r)) {

evaluated: d->qt_rgn->contains(r)

TRUE	FALSE
yes Evaluation Count:426	yes Evaluation Count:10625

426-10625

executed: return *this;

Execution Count:426

426

} else if (d->qt_rgn->within(r)) {

evaluated: d->qt_rgn->within(r)

TRUE	FALSE
yes Evaluation Count:1846	yes Evaluation Count:8779

1846-8779

return *this = r;

executed: return *this = r;

Execution Count:1846

1846

} else if (d->qt_rgn->canAppend(&r)) {

evaluated: d->qt_rgn->canAppend(&r)

TRUE	FALSE
yes Evaluation Count:2216	yes Evaluation Count:6563

2216-6563

2434 detach(); -

2435 d->qt_rgn->append(&r); -

executed: return *this;

Execution Count:2216

2216

} else if (d->qt_rgn->canPrepend(&r)) {

evaluated: d->qt_rgn->canPrepend(&r)

TRUE	FALSE
yes Evaluation Count:583	yes Evaluation Count:5980

583-5980

2438 detach(); -

2439 d->qt_rgn->prepend(&r); -

executed: return *this;

Execution Count:583

583

} else if (d->qt_rgn->numRects == 1 && d->qt_rgn->extents == r) {

evaluated: d->qt_rgn->numRects == 1

TRUE	FALSE
yes Evaluation Count:821	yes Evaluation Count:5159

partially evaluated: d->qt_rgn->extents == r

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:821

0-5159

never executed: return *this;

0

2443 } else { -

2444 detach(); -

2445 QRegionPrivate p(r); -

2446 UnionRegion(d->qt_rgn, &p, *d->qt_rgn); -

executed: return *this;

Execution Count:5980

5980

2448 } -

2449 } -

2450 -

2451 QRegion QRegion::intersected(const QRegion &r) const -

2452 { -

if (isEmptyHelper(d->qt_rgn) || isEmptyHelper(r.d->qt_rgn)

evaluated: isEmptyHelper(d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:268	yes Evaluation Count:150

evaluated: isEmptyHelper(r.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:5	yes Evaluation Count:145

5-268

|| !((&d->qt_rgn->extents)->right() >= (&r.d->qt_rgn->extents)->left() && (&d->qt_rgn->extents)->left() <= (&r.d->qt_rgn->extents)->right() && (&d->qt_rgn->extents)->bottom() >= (&r.d->qt_rgn->extents)->top() && (&d->qt_rgn->extents)->top() <= (&r.d->qt_rgn->extents)->bottom()))

partially evaluated: (&d->qt_rgn->extents)->right() >= (&r.d->qt_rgn->extents)->left()

TRUE	FALSE
yes Evaluation Count:145	no Evaluation Count:0

evaluated: (&d->qt_rgn->extents)->left() <= (&r.d->qt_rgn->extents)->right()

TRUE	FALSE
yes Evaluation Count:144	yes Evaluation Count:1

partially evaluated: (&d->qt_rgn->extents)->bottom() >= (&r.d->qt_rgn->extents)->top()

TRUE	FALSE
yes Evaluation Count:144	no Evaluation Count:0

evaluated: (&d->qt_rgn->extents)->top() <= (&r.d->qt_rgn->extents)->bottom()

TRUE	FALSE
yes Evaluation Count:142	yes Evaluation Count:2

0-145

return QRegion();

executed: return QRegion();

Execution Count:276

276

2456 -

2457 -

if (r.d->qt_rgn->contains(*d->qt_rgn))

evaluated: r.d->qt_rgn->contains(*d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:33	yes Evaluation Count:109

33-109

executed: return *this;

Execution Count:33

33

2460 -

2461 -

if (d->qt_rgn->contains(*r.d->qt_rgn))

evaluated: d->qt_rgn->contains(*r.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:44	yes Evaluation Count:65

44-65

executed: return r;

Execution Count:44

44

2464 -

if (r.d->qt_rgn->numRects == 1 && d->qt_rgn->numRects == 1) {

evaluated: r.d->qt_rgn->numRects == 1

TRUE	FALSE
yes Evaluation Count:29	yes Evaluation Count:36

evaluated: d->qt_rgn->numRects == 1

TRUE	FALSE
yes Evaluation Count:3	yes Evaluation Count:26

3-36

2466 const QRect rect = qt_rect_intersect_normalized(r.d->qt_rgn->extents, -

2467 d->qt_rgn->extents); -

return QRegion(rect);

executed: return QRegion(rect);

Execution Count:3

3

} else if (r.d->qt_rgn->numRects == 1) {

evaluated: r.d->qt_rgn->numRects == 1

TRUE	FALSE
yes Evaluation Count:26	yes Evaluation Count:36

26-36

2470 QRegion result(*this); -

2471 result.detach(); -

2472 result.d->qt_rgn->intersect(r.d->qt_rgn->extents); -

executed: return result;

Execution Count:26

26

} else if (d->qt_rgn->numRects == 1) {

evaluated: d->qt_rgn->numRects == 1

TRUE	FALSE
yes Evaluation Count:12	yes Evaluation Count:24

12-24

2475 QRegion result(r); -

2476 result.detach(); -

2477 result.d->qt_rgn->intersect(d->qt_rgn->extents); -

executed: return result;

Execution Count:12

12

2479 } -

2480 -

2481 QRegion result; -

2482 result.detach(); -

2483 miRegionOp(*result.d->qt_rgn, d->qt_rgn, r.d->qt_rgn, miIntersectO, 0, 0); -

2484 miSetExtents(*result.d->qt_rgn); -

executed: return result;

Execution Count:24

24

2486 } -

2487 -

2488 QRegion QRegion::intersected(const QRect &r) const -

2489 { -

if (isEmptyHelper(d->qt_rgn) || r.isEmpty()

evaluated: isEmptyHelper(d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:5647	yes Evaluation Count:88481

evaluated: r.isEmpty()

TRUE	FALSE
yes Evaluation Count:522	yes Evaluation Count:87959

522-88481

|| !((&d->qt_rgn->extents)->right() >= (&r)->left() && (&d->qt_rgn->extents)->left() <= (&r)->right() && (&d->qt_rgn->extents)->bottom() >= (&r)->top() && (&d->qt_rgn->extents)->top() <= (&r)->bottom()))

evaluated: (&d->qt_rgn->extents)->right() >= (&r)->left()

TRUE	FALSE
yes Evaluation Count:87956	yes Evaluation Count:3

evaluated: (&d->qt_rgn->extents)->left() <= (&r)->right()

TRUE	FALSE
yes Evaluation Count:87951	yes Evaluation Count:5

partially evaluated: (&d->qt_rgn->extents)->bottom() >= (&r)->top()

TRUE	FALSE
yes Evaluation Count:87951	no Evaluation Count:0

evaluated: (&d->qt_rgn->extents)->top() <= (&r)->bottom()

TRUE	FALSE
yes Evaluation Count:87950	yes Evaluation Count:1

0-87956

return QRegion();

executed: return QRegion();

Execution Count:6178

6178

2493 -

2494 -

if (d->qt_rgn->within(r))

evaluated: d->qt_rgn->within(r)

TRUE	FALSE
yes Evaluation Count:59863	yes Evaluation Count:28087

28087-59863

executed: return *this;

Execution Count:59863

59863

2497 -

2498 -

if (d->qt_rgn->contains(r))

evaluated: d->qt_rgn->contains(r)

TRUE	FALSE
yes Evaluation Count:23330	yes Evaluation Count:4757

4757-23330

executed: return r;

Execution Count:23330

23330

2501 -

if (d->qt_rgn->numRects == 1) {

evaluated: d->qt_rgn->numRects == 1

TRUE	FALSE
yes Evaluation Count:650	yes Evaluation Count:4107

650-4107

2503 const QRect rect = qt_rect_intersect_normalized(d->qt_rgn->extents, -

2504 r.normalized()); -

return QRegion(rect);

executed: return QRegion(rect);

Execution Count:650

650

2506 } -

2507 -

2508 QRegion result(*this); -

2509 result.detach(); -

2510 result.d->qt_rgn->intersect(r); -

executed: return result;

Execution Count:4107

4107

2512 } -

2513 -

2514 QRegion QRegion::subtracted(const QRegion &r) const -

2515 { -

if (isEmptyHelper(d->qt_rgn) || isEmptyHelper(r.d->qt_rgn))

evaluated: isEmptyHelper(d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:1221	yes Evaluation Count:21375

evaluated: isEmptyHelper(r.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:2946	yes Evaluation Count:18429

1221-21375

executed: return *this;

Execution Count:4167

4167

if (r.d->qt_rgn->contains(*d->qt_rgn))

evaluated: r.d->qt_rgn->contains(*d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:3022	yes Evaluation Count:15407

3022-15407

return QRegion();

executed: return QRegion();

Execution Count:3022

3022

if (!((&d->qt_rgn->extents)->right() >= (&r.d->qt_rgn->extents)->left() && (&d->qt_rgn->extents)->left() <= (&r.d->qt_rgn->extents)->right() && (&d->qt_rgn->extents)->bottom() >= (&r.d->qt_rgn->extents)->top() && (&d->qt_rgn->extents)->top() <= (&r.d->qt_rgn->extents)->bottom()))

evaluated: (&d->qt_rgn->extents)->right() >= (&r.d->qt_rgn->extents)->left()

TRUE	FALSE
yes Evaluation Count:15375	yes Evaluation Count:32

evaluated: (&d->qt_rgn->extents)->left() <= (&r.d->qt_rgn->extents)->right()

TRUE	FALSE
yes Evaluation Count:15348	yes Evaluation Count:27

evaluated: (&d->qt_rgn->extents)->bottom() >= (&r.d->qt_rgn->extents)->top()

TRUE	FALSE
yes Evaluation Count:15302	yes Evaluation Count:46

evaluated: (&d->qt_rgn->extents)->top() <= (&r.d->qt_rgn->extents)->bottom()

TRUE	FALSE
yes Evaluation Count:15148	yes Evaluation Count:154

27-15375

executed: return *this;

Execution Count:259

259

if (d == r.d || EqualRegion(d->qt_rgn, r.d->qt_rgn))

partially evaluated: d == r.d

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:15148

partially evaluated: EqualRegion(d->qt_rgn, r.d->qt_rgn)

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:15148

0-15148

return QRegion();

never executed: return QRegion();

0

2524 -

2525 -

2526 -

2527 -

2528 -

2529 -

2530 QRegion result; -

2531 result.detach(); -

2532 SubtractRegion(d->qt_rgn, r.d->qt_rgn, *result.d->qt_rgn); -

2533 -

2534 -

2535 -

executed: return result;

Execution Count:15148

15148

2537 } -

2538 -

2539 QRegion QRegion::xored(const QRegion &r) const -

2540 { -

if (isEmptyHelper(d->qt_rgn)) {

evaluated: isEmptyHelper(d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:6	yes Evaluation Count:25

6-25

executed: return r;

Execution Count:6

6

} else if (isEmptyHelper(r.d->qt_rgn)) {

evaluated: isEmptyHelper(r.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:3	yes Evaluation Count:22

3-22

executed: return *this;

Execution Count:3

3

} else if (!((&d->qt_rgn->extents)->right() >= (&r.d->qt_rgn->extents)->left() && (&d->qt_rgn->extents)->left() <= (&r.d->qt_rgn->extents)->right() && (&d->qt_rgn->extents)->bottom() >= (&r.d->qt_rgn->extents)->top() && (&d->qt_rgn->extents)->top() <= (&r.d->qt_rgn->extents)->bottom())) {

partially evaluated: (&d->qt_rgn->extents)->right() >= (&r.d->qt_rgn->extents)->left()

TRUE	FALSE
yes Evaluation Count:22	no Evaluation Count:0

partially evaluated: (&d->qt_rgn->extents)->left() <= (&r.d->qt_rgn->extents)->right()

TRUE	FALSE
yes Evaluation Count:22	no Evaluation Count:0

partially evaluated: (&d->qt_rgn->extents)->bottom() >= (&r.d->qt_rgn->extents)->top()

TRUE	FALSE
yes Evaluation Count:22	no Evaluation Count:0

partially evaluated: (&d->qt_rgn->extents)->top() <= (&r.d->qt_rgn->extents)->bottom()

TRUE	FALSE
yes Evaluation Count:22	no Evaluation Count:0

0-22

return (*this + r);

never executed: return (*this + r);

0

} else if (d == r.d || EqualRegion(d->qt_rgn, r.d->qt_rgn)) {

evaluated: d == r.d

TRUE	FALSE
yes Evaluation Count:3	yes Evaluation Count:19

partially evaluated: EqualRegion(d->qt_rgn, r.d->qt_rgn)

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:19

0-19

return QRegion();

executed: return QRegion();

Execution Count:3

3

2549 } else { -

2550 QRegion result; -

2551 result.detach(); -

2552 XorRegion(d->qt_rgn, r.d->qt_rgn, *result.d->qt_rgn); -

executed: return result;

Execution Count:19

19

2554 } -

2555 } -

2556 -

2557 QRect QRegion::boundingRect() const -

2558 { -

evaluated: isEmpty()

TRUE	FALSE
yes Evaluation Count:3419	yes Evaluation Count:75877

3419-75877

return QRect();

executed: return QRect();

Execution Count:3419

3419

return d->qt_rgn->extents;

executed: return d->qt_rgn->extents;

Execution Count:75877

75877

2562 } -

2563 -

2564 -

2565 -

2566 -

2567 -

2568 __attribute__((visibility("default"))) -

2569 bool qt_region_strictContains(const QRegion &region, const QRect &rect) -

2570 { -

if (isEmptyHelper(region.d->qt_rgn) || !rect.isValid())

evaluated: isEmptyHelper(region.d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:35005	yes Evaluation Count:122253

evaluated: !rect.isValid()

TRUE	FALSE
yes Evaluation Count:13	yes Evaluation Count:122240

13-122253

executed: return false;

Execution Count:35018

35018

2573 const QRect r1 = region.d->qt_rgn->innerRect; -

2574 return (rect.left() >= r1.left() && rect.right() <= r1.right() 122240

&& rect.top() >= r1.top() && rect.bottom() <= r1.bottom());

executed:

return (rect.left() >= r1.left() && rect.right() <= r1.right() && rect.top() >= r1.top() && rect.bottom() <= r1.bottom());

Execution Count:122240

122240

2576 } -

2577 -

2578 QVector<QRect> QRegion::rects() const -

2579 { -

if (d->qt_rgn) {

partially evaluated: d->qt_rgn

TRUE	FALSE
yes Evaluation Count:60416	no Evaluation Count:0

0-60416

2581 d->qt_rgn->vectorize(); -

2582 d->qt_rgn->rects.reserve(d->qt_rgn->numRects); -

2583 d->qt_rgn->rects.resize(d->qt_rgn->numRects); -

return d->qt_rgn->rects;

executed: return d->qt_rgn->rects;

Execution Count:60416

60416

2585 } else { -

return QVector<QRect>();

never executed: return QVector<QRect>();

0

2587 } -

2588 } -

2589 -

2590 void QRegion::setRects(const QRect *rects, int num) -

2591 { -

2592 *this = QRegion(); -

if (!rects || num == 0 || (num == 1 && rects->isEmpty()))

evaluated: !rects

TRUE	FALSE
yes Evaluation Count:1	yes Evaluation Count:31

evaluated: num == 0

TRUE	FALSE
yes Evaluation Count:1	yes Evaluation Count:30

evaluated: num == 1

TRUE	FALSE
yes Evaluation Count:5	yes Evaluation Count:25

evaluated: rects->isEmpty()

TRUE	FALSE
yes Evaluation Count:1	yes Evaluation Count:4

1-31

return;

executed: return;

Execution Count:3

3

2595 -

2596 detach(); -

2597 -

2598 d->qt_rgn->numRects = num; -

if (num == 1) {

evaluated: num == 1

TRUE	FALSE
yes Evaluation Count:4	yes Evaluation Count:25

4-25

2600 d->qt_rgn->extents = *rects; -

2601 d->qt_rgn->innerRect = *rects; -

} else {

executed: }

Execution Count:4

4

2603 d->qt_rgn->rects.resize(num); -

2604 -

2605 int left = 2147483647, -

2606 right = (-2147483647 - 1), -

2607 top = 2147483647, -

2608 bottom = (-2147483647 - 1); -

for (int i = 0; i < num; ++i) {

evaluated: i < num

TRUE	FALSE
yes Evaluation Count:59	yes Evaluation Count:25

25-59

2610 const QRect &rect = rects[i]; -

2611 d->qt_rgn->rects[i] = rect; -

2612 left = qMin(rect.left(), left); -

2613 right = qMax(rect.right(), right); -

2614 top = qMin(rect.top(), top); -

2615 bottom = qMax(rect.bottom(), bottom); -

2616 d->qt_rgn->updateInnerRect(rect); -

}

executed: }

Execution Count:59

59

2618 d->qt_rgn->extents = QRect(QPoint(left, top), QPoint(right, bottom)); -

}

executed: }

Execution Count:25

25

2620 } -

2621 -

2622 int QRegion::rectCount() const -

2623 { -

return (d->qt_rgn ? d->qt_rgn->numRects : 0);

executed: return (d->qt_rgn ? d->qt_rgn->numRects : 0);

Execution Count:48459

48459

2625 } -

2626 -

2627 -

2628 bool QRegion::operator==(const QRegion &r) const -

2629 { -

if (!d->qt_rgn)

partially evaluated: !d->qt_rgn

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:698

0-698

return r.isEmpty();

never executed: return r.isEmpty();

0

if (!r.d->qt_rgn)

partially evaluated: !r.d->qt_rgn

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:698

0-698

return isEmpty();

never executed: return isEmpty();

0

2634 -

if (d == r.d)

evaluated: d == r.d

TRUE	FALSE
yes Evaluation Count:189	yes Evaluation Count:509

189-509

executed: return true;

Execution Count:189

189

2637 else -

return EqualRegion(d->qt_rgn, r.d->qt_rgn);

executed: return EqualRegion(d->qt_rgn, r.d->qt_rgn);

Execution Count:509

509

2639 } -

2640 -

2641 bool QRegion::intersects(const QRect &rect) const -

2642 { -

if (isEmptyHelper(d->qt_rgn) || rect.isNull())

evaluated: isEmptyHelper(d->qt_rgn)

TRUE	FALSE
yes Evaluation Count:8129	yes Evaluation Count:16650

partially evaluated: rect.isNull()

TRUE	FALSE
no Evaluation Count:0	yes Evaluation Count:16650

0-16650

executed: return false;

Execution Count:8129

8129

2645 -

2646 const QRect r = rect.normalized(); -

if (!rect_intersects(d->qt_rgn->extents, r))

evaluated: !rect_intersects(d->qt_rgn->extents, r)

TRUE	FALSE
yes Evaluation Count:1023	yes Evaluation Count:15627

1023-15627

executed: return false;

Execution Count:1023

1023

if (d->qt_rgn->numRects == 1)

evaluated: d->qt_rgn->numRects == 1

TRUE	FALSE
yes Evaluation Count:13444	yes Evaluation Count:2183

2183-13444

executed: return true;

Execution Count:13444

13444

2651 -

2652 const QVector<QRect> myRects = rects(); -

for (QVector<QRect>::const_iterator it = myRects.constBegin(); it < myRects.constEnd(); ++it)

evaluated: it < myRects.constEnd()

TRUE	FALSE
yes Evaluation Count:3712	yes Evaluation Count:709

709-3712

if (rect_intersects(r, *it))

evaluated: rect_intersects(r, *it)

TRUE	FALSE
yes Evaluation Count:1474	yes Evaluation Count:2238

1474-2238

executed: return true;

Execution Count:1474

1474

executed: return false;

Execution Count:709

709

2657 } -

2658 -

2659 -

2660 -

2661 -

2662 -

Switch to Source code Preprocessed file

Generated by Squish Coco Non-Commercial