qregion.cpp

Absolute File Name:

/home/qt/qt5_coco/qt5/qtbase/src/gui/painting/qregion.cpp

Source code

Switch to Preprocessed file

Line Source Count

1 /**************************************************************************** -

2 ** -

3 ** Copyright (C) 2016 The Qt Company Ltd. -

4 ** Contact: https://www.qt.io/licensing/ -

5 ** -

6 ** This file is part of the QtGui module of the Qt Toolkit. -

7 ** -

8 ** $QT_BEGIN_LICENSE:LGPL$ -

9 ** Commercial License Usage -

10 ** Licensees holding valid commercial Qt licenses may use this file in -

11 ** accordance with the commercial license agreement provided with the -

12 ** Software or, alternatively, in accordance with the terms contained in -

13 ** a written agreement between you and The Qt Company. For licensing terms -

14 ** and conditions see https://www.qt.io/terms-conditions. For further -

15 ** information use the contact form at https://www.qt.io/contact-us. -

16 ** -

17 ** GNU Lesser General Public License Usage -

18 ** Alternatively, this file may be used under the terms of the GNU Lesser -

19 ** General Public License version 3 as published by the Free Software -

20 ** Foundation and appearing in the file LICENSE.LGPL3 included in the -

21 ** packaging of this file. Please review the following information to -

22 ** ensure the GNU Lesser General Public License version 3 requirements -

23 ** will be met: https://www.gnu.org/licenses/lgpl-3.0.html. -

24 ** -

25 ** GNU General Public License Usage -

26 ** Alternatively, this file may be used under the terms of the GNU -

27 ** General Public License version 2.0 or (at your option) the GNU General -

28 ** Public license version 3 or any later version approved by the KDE Free -

29 ** Qt Foundation. The licenses are as published by the Free Software -

30 ** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3 -

31 ** included in the packaging of this file. Please review the following -

32 ** information to ensure the GNU General Public License requirements will -

33 ** be met: https://www.gnu.org/licenses/gpl-2.0.html and -

34 ** https://www.gnu.org/licenses/gpl-3.0.html. -

35 ** -

36 ** $QT_END_LICENSE$ -

37 ** -

38 ****************************************************************************/ -

39 -

40 #include "qregion.h" -

41 #include "qpainterpath.h" -

42 #include "qpolygon.h" -

43 #include "qbuffer.h" -

44 #include "qdatastream.h" -

45 #include "qvariant.h" -

46 #include "qvarlengtharray.h" -

47 #include "qimage.h" -

48 #include "qbitmap.h" -

49 -

50 #include <private/qdebug_p.h> -

51 -

52 QT_BEGIN_NAMESPACE -

53 -

54 /*! -

55 \class QRegion -

56 \brief The QRegion class specifies a clip region for a painter. -

57 -

58 \inmodule QtGui -

59 \ingroup painting -

60 \ingroup shared -

61 -

62 QRegion is used with QPainter::setClipRegion() to limit the paint -

63 area to what needs to be painted. There is also a QWidget::repaint() -

64 function that takes a QRegion parameter. QRegion is the best tool for -

65 minimizing the amount of screen area to be updated by a repaint. -

66 -

67 This class is not suitable for constructing shapes for rendering, especially -

68 as outlines. Use QPainterPath to create paths and shapes for use with -

69 QPainter. -

70 -

71 QRegion is an \l{implicitly shared} class. -

72 -

73 \section1 Creating and Using Regions -

74 -

75 A region can be created from a rectangle, an ellipse, a polygon or -

76 a bitmap. Complex regions may be created by combining simple -

77 regions using united(), intersected(), subtracted(), or xored() (exclusive -

78 or). You can move a region using translate(). -

79 -

80 You can test whether a region isEmpty() or if it -

81 contains() a QPoint or QRect. The bounding rectangle can be found -

82 with boundingRect(). -

83 -

84 The function rects() gives a decomposition of the region into -

85 rectangles. -

86 -

87 Example of using complex regions: -

88 \snippet code/src_gui_painting_qregion.cpp 0 -

89 -

90 \section1 Additional License Information -

91 -

92 On Embedded Linux and X11 platforms, parts of this class rely on -

93 code obtained under the following licenses: -

94 -

95 \legalese -

96 Copyright (c) 1987 X Consortium -

97 -

98 Permission is hereby granted, free of charge, to any person obtaining a copy -

99 of this software and associated documentation files (the "Software"), to deal -

100 in the Software without restriction, including without limitation the rights -

101 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -

102 copies of the Software, and to permit persons to whom the Software is -

103 furnished to do so, subject to the following conditions: -

104 -

105 The above copyright notice and this permission notice shall be included in -

106 all copies or substantial portions of the Software. -

107 -

108 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -

109 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -

110 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -

111 X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN -

112 AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN -

113 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. -

114 -

115 Except as contained in this notice, the name of the X Consortium shall not be -

116 used in advertising or otherwise to promote the sale, use or other dealings -

117 in this Software without prior written authorization from the X Consortium. -

118 \endlegalese -

119 -

120 \br -

121 -

122 \legalese -

123 Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts. -

124 -

125 All Rights Reserved -

126 -

127 Permission to use, copy, modify, and distribute this software and its -

128 documentation for any purpose and without fee is hereby granted, -

129 provided that the above copyright notice appear in all copies and that -

130 both that copyright notice and this permission notice appear in -

131 supporting documentation, and that the name of Digital not be -

132 used in advertising or publicity pertaining to distribution of the -

133 software without specific, written prior permission. -

134 -

135 DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING -

136 ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL -

137 DIGITAL BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR -

138 ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, -

139 WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, -

140 ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS -

141 SOFTWARE. -

142 \endlegalese -

143 -

144 \sa QPainter::setClipRegion(), QPainter::setClipRect(), QPainterPath -

145 */ -

146 -

147 -

148 /*! -

149 \enum QRegion::RegionType -

150 -

151 Specifies the shape of the region to be created. -

152 -

153 \value Rectangle the region covers the entire rectangle. -

154 \value Ellipse the region is an ellipse inside the rectangle. -

155 */ -

156 -

157 /*! -

158 \fn void QRegion::translate(const QPoint &point) -

159 -

160 \overload -

161 -

162 Translates the region \a{point}\e{.x()} along the x axis and -

163 \a{point}\e{.y()} along the y axis, relative to the current -

164 position. Positive values move the region to the right and down. -

165 -

166 Translates to the given \a point. -

167 */ -

168 -

169 /***************************************************************************** -

170 QRegion member functions -

171 *****************************************************************************/ -

172 -

173 /*! -

174 \fn QRegion::QRegion() -

175 -

176 Constructs an empty region. -

177 -

178 \sa isEmpty() -

179 */ -

180 -

181 /*! -

182 \fn QRegion::QRegion(const QRect &r, RegionType t) -

183 \overload -

184 -

185 Create a region based on the rectange \a r with region type \a t. -

186 -

187 If the rectangle is invalid a null region will be created. -

188 -

189 \sa QRegion::RegionType -

190 */ -

191 -

192 /*! -

193 \fn QRegion::QRegion(const QPolygon &a, Qt::FillRule fillRule) -

194 -

195 Constructs a polygon region from the point array \a a with the fill rule -

196 specified by \a fillRule. -

197 -

198 If \a fillRule is \l{Qt::WindingFill}, the polygon region is defined -

199 using the winding algorithm; if it is \l{Qt::OddEvenFill}, the odd-even fill -

200 algorithm is used. -

201 -

202 \warning This constructor can be used to create complex regions that will -

203 slow down painting when used. -

204 */ -

205 -

206 /*! -

207 \fn QRegion::QRegion(const QRegion &r) -

208 -

209 Constructs a new region which is equal to region \a r. -

210 */ -

211 -

212 /*! -

213 \fn QRegion::QRegion(QRegion &&other) -

214 \since 5.7 -

215 -

216 Move-constructs a new region from region \a other. -

217 After the call, \a other is null. -

218 -

219 \sa isNull() -

220 */ -

221 -

222 /*! -

223 \fn QRegion::QRegion(const QBitmap &bm) -

224 -

225 Constructs a region from the bitmap \a bm. -

226 -

227 The resulting region consists of the pixels in bitmap \a bm that -

228 are Qt::color1, as if each pixel was a 1 by 1 rectangle. -

229 -

230 This constructor may create complex regions that will slow down -

231 painting when used. Note that drawing masked pixmaps can be done -

232 much faster using QPixmap::setMask(). -

233 */ -

234 -

235 /*! -

236 Constructs a rectangular or elliptic region. -

237 -

238 If \a t is \c Rectangle, the region is the filled rectangle (\a x, -

239 \a y, \a w, \a h). If \a t is \c Ellipse, the region is the filled -

240 ellipse with center at (\a x + \a w / 2, \a y + \a h / 2) and size -

241 (\a w ,\a h). -

242 */ -

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

244 { -

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

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

247 d = tmp.d; -

}

never executed: end of block

0

249 -

250 /*! -

251 \fn QRegion::~QRegion() -

252 \internal -

253 -

254 Destroys the region. -

255 */ -

256 -

257 void QRegion::detach() -

258 { -

if (d->ref.isShared())

d->ref.isShared()	Description
TRUE	never evaluated
FALSE	never evaluated

0

*this = copy();

never executed: *this = copy();

0

}

never executed: end of block

0

262 -

263 // duplicates in qregion_win.cpp and qregion_wce.cpp -

264 #define QRGN_SETRECT 1 // region stream commands -

265 #define QRGN_SETELLIPSE 2 // (these are internal) -

266 #define QRGN_SETPTARRAY_ALT 3 -

267 #define QRGN_SETPTARRAY_WIND 4 -

268 #define QRGN_TRANSLATE 5 -

269 #define QRGN_OR 6 -

270 #define QRGN_AND 7 -

271 #define QRGN_SUB 8 -

272 #define QRGN_XOR 9 -

273 #define QRGN_RECTS 10 -

274 -

275 -

276 #ifndef QT_NO_DATASTREAM -

277 -

278 /* -

279 Executes region commands in the internal buffer and rebuilds the -

280 original region. -

281 -

282 We do this when we read a region from the data stream. -

283 -

284 If \a ver is non-0, uses the format version \a ver on reading the -

285 byte array. -

286 */ -

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

288 { -

289 QByteArray copy = buffer; -

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

if (ver)

ver	Description
TRUE	never evaluated
FALSE	never evaluated

0

s.setVersion(ver);

never executed: s.setVersion(ver);

0

293 s.setByteOrder(byteOrder); -

294 QRegion rgn; -

295 #ifndef QT_NO_DEBUG -

296 int test_cnt = 0; -

297 #endif -

while (!s.atEnd()) {

!s.atEnd()	Description
TRUE	never evaluated
FALSE	never evaluated

0

299 qint32 id; -

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

s.version() == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

301 int id_int; -

302 s >> id_int; -

303 id = id_int; -

} else {

never executed: end of block

0

305 s >> id; -

}

never executed: end of block

0

307 #ifndef QT_NO_DEBUG -

if (test_cnt > 0 && id != QRGN_TRANSLATE)

test_cnt > 0	Description
TRUE	never evaluated
FALSE	never evaluated

id != 5	Description
TRUE	never evaluated
FALSE	never evaluated

0

qWarning("QRegion::exec: Internal error");

never executed: QMessageLogger(__FILE__, 309, __PRETTY_FUNCTION__).warning("QRegion::exec: Internal error");

0

310 test_cnt++; -

311 #endif -

if (id == QRGN_SETRECT || id == QRGN_SETELLIPSE) {

id == 1	Description
TRUE	never evaluated
FALSE	never evaluated

id == 2	Description
TRUE	never evaluated
FALSE	never evaluated

0

313 QRect r; -

314 s >> r; -

315 rgn = QRegion(r, id == QRGN_SETRECT ? Rectangle : Ellipse); -

} else if (id == QRGN_SETPTARRAY_ALT || id == QRGN_SETPTARRAY_WIND) {

never executed: end of block

id == 3	Description
TRUE	never evaluated
FALSE	never evaluated

id == 4	Description
TRUE	never evaluated
FALSE	never evaluated

0

317 QPolygon a; -

318 s >> a; -

319 rgn = QRegion(a, id == QRGN_SETPTARRAY_WIND ? Qt::WindingFill : Qt::OddEvenFill); -

} else if (id == QRGN_TRANSLATE) {

never executed: end of block

id == 5	Description
TRUE	never evaluated
FALSE	never evaluated

0

321 QPoint p; -

322 s >> p; -

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

} else if (id >= QRGN_OR && id <= QRGN_XOR) {

never executed: end of block

id >= 6	Description
TRUE	never evaluated
FALSE	never evaluated

id <= 9	Description
TRUE	never evaluated
FALSE	never evaluated

0

325 QByteArray bop1, bop2; -

326 QRegion r1, r2; -

327 s >> bop1; -

328 r1.exec(bop1); -

329 s >> bop2; -

330 r2.exec(bop2); -

331 -

332 switch (id) { -

case QRGN_OR:

never executed: case 6:

0

334 rgn = r1.united(r2); -

break;

never executed: break;

0

case QRGN_AND:

never executed: case 7:

0

337 rgn = r1.intersected(r2); -

break;

never executed: break;

0

case QRGN_SUB:

never executed: case 8:

0

340 rgn = r1.subtracted(r2); -

break;

never executed: break;

0

case QRGN_XOR:

never executed: case 9:

0

343 rgn = r1.xored(r2); -

break;

never executed: break;

0

345 } -

} else if (id == QRGN_RECTS) {

never executed: end of block

id == 10	Description
TRUE	never evaluated
FALSE	never evaluated

0

347 // (This is the only form used in Qt 2.0) -

348 quint32 n; -

349 s >> n; -

350 QRect r; -

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

i<(int)n	Description
TRUE	never evaluated
FALSE	never evaluated

0

352 s >> r; -

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

}

never executed: end of block

0

}

never executed: end of block

0

}

never executed: end of block

0

357 *this = rgn; -

}

never executed: end of block

0

359 -

360 -

361 /***************************************************************************** -

362 QRegion stream functions -

363 *****************************************************************************/ -

364 -

365 /*! -

366 \fn QRegion &QRegion::operator=(const QRegion &r) -

367 -

368 Assigns \a r to this region and returns a reference to the region. -

369 */ -

370 -

371 /*! -

372 \fn QRegion &QRegion::operator=(QRegion &&other) -

373 -

374 Move-assigns \a other to this QRegion instance. -

375 -

376 \since 5.2 -

377 */ -

378 -

379 /*! -

380 \fn void QRegion::swap(QRegion &other) -

381 \since 4.8 -

382 -

383 Swaps region \a other with this region. This operation is very -

384 fast and never fails. -

385 */ -

386 -

387 /*! -

388 \relates QRegion -

389 -

390 Writes the region \a r to the stream \a s and returns a reference -

391 to the stream. -

392 -

393 \sa{Serializing Qt Data Types}{Format of the QDataStream operators} -

394 */ -

395 -

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

397 { -

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

if (a.isEmpty()) {

a.isEmpty()	Description
TRUE	never evaluated
FALSE	never evaluated

0

400 s << (quint32)0; -

} else {

never executed: end of block

0

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

s.version() == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

403 int i; -

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

i > 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

406 s << (int)QRGN_OR; -

}

never executed: end of block

0

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

i < a.size()	Description
TRUE	never evaluated
FALSE	never evaluated

0

409 s << (quint32)(4+8) << (int)QRGN_SETRECT << a[i]; -

}

never executed: end of block

0

} else {

never executed: end of block

0

412 s << (quint32)(4 + 4 + 16 * a.size()); // 16: storage size of QRect -

413 s << (qint32)QRGN_RECTS; -

414 s << a; -

}

never executed: end of block

0

416 } -

return s;

never executed: return s;

0

418 } -

419 -

420 /*! -

421 \relates QRegion -

422 -

423 Reads a region from the stream \a s into \a r and returns a -

424 reference to the stream. -

425 -

426 \sa{Serializing Qt Data Types}{Format of the QDataStream operators} -

427 */ -

428 -

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

430 { -

431 QByteArray b; -

432 s >> b; -

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

return s;

never executed: return s;

0

435 } -

436 #endif //QT_NO_DATASTREAM -

437 -

438 #ifndef QT_NO_DEBUG_STREAM -

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

440 { -

441 QDebugStateSaver saver(s); -

442 s.nospace(); -

443 s << "QRegion("; -

if (r.isNull()) {

r.isNull()	Description
TRUE	never evaluated
FALSE	never evaluated

0

445 s << "null"; -

} else if (r.isEmpty()) {

never executed: end of block

r.isEmpty()	Description
TRUE	never evaluated
FALSE	never evaluated

0

447 s << "empty"; -

} else {

never executed: end of block

0

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

450 const int count = rects.size(); -

if (count > 1)

count > 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

s << "size=" << count << ", bounds=(";

never executed: s << "size=" << count << ", bounds=(";

0

453 QtDebugUtils::formatQRect(s, r.boundingRect()); -

if (count > 1) {

count > 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

455 s << ") - ["; -

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

i < count	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (i)

i	Description
TRUE	never evaluated
FALSE	never evaluated

0

s << ", ";

never executed: s << ", ";

0

459 s << '('; -

460 QtDebugUtils::formatQRect(s, rects.at(i)); -

461 s << ')'; -

}

never executed: end of block

0

463 s << ']'; -

}

never executed: end of block

0

}

never executed: end of block

0

466 s << ')'; -

return s;

never executed: return s;

0

468 } -

469 #endif -

470 -

471 -

472 // These are not inline - they can be implemented better on some platforms -

473 // (eg. Windows at least provides 3-variable operations). For now, simple. -

474 -

475 -

476 /*! -

477 Applies the united() function to this region and \a r. \c r1|r2 is -

478 equivalent to \c r1.united(r2). -

479 -

480 \sa united(), operator+() -

481 */ -

482 #ifdef Q_COMPILER_MANGLES_RETURN_TYPE -

483 const -

484 #endif -

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

{ return united(r); }

never executed: return united(r);

0

487 -

488 /*! -

489 Applies the united() function to this region and \a r. \c r1+r2 is -

490 equivalent to \c r1.united(r2). -

491 -

492 \sa united(), operator|() -

493 */ -

494 #ifdef Q_COMPILER_MANGLES_RETURN_TYPE -

495 const -

496 #endif -

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

{ return united(r); }

never executed: return united(r);

0

499 -

500 /*! -

501 \overload -

502 \since 4.4 -

503 */ -

504 #ifdef Q_COMPILER_MANGLES_RETURN_TYPE -

505 const -

506 #endif -

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

{ return united(r); }

never executed: return united(r);

0

509 -

510 /*! -

511 Applies the intersected() function to this region and \a r. \c r1&r2 -

512 is equivalent to \c r1.intersected(r2). -

513 -

514 \sa intersected() -

515 */ -

516 #ifdef Q_COMPILER_MANGLES_RETURN_TYPE -

517 const -

518 #endif -

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

{ return intersected(r); }

never executed: return intersected(r);

0

521 -

522 /*! -

523 \overload -

524 \since 4.4 -

525 */ -

526 #ifdef Q_COMPILER_MANGLES_RETURN_TYPE -

527 const -

528 #endif -

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

530 { -

return intersected(r);

never executed: return intersected(r);

0

532 } -

533 -

534 /*! -

535 Applies the subtracted() function to this region and \a r. \c r1-r2 -

536 is equivalent to \c r1.subtracted(r2). -

537 -

538 \sa subtracted() -

539 */ -

540 #ifdef Q_COMPILER_MANGLES_RETURN_TYPE -

541 const -

542 #endif -

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

{ return subtracted(r); }

never executed: return subtracted(r);

0

545 -

546 /*! -

547 Applies the xored() function to this region and \a r. \c r1^r2 is -

548 equivalent to \c r1.xored(r2). -

549 -

550 \sa xored() -

551 */ -

552 #ifdef Q_COMPILER_MANGLES_RETURN_TYPE -

553 const -

554 #endif -

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

{ return xored(r); }

never executed: return xored(r);

0

557 -

558 /*! -

559 Applies the united() function to this region and \a r and assigns -

560 the result to this region. \c r1|=r2 is equivalent to \c -

561 {r1 = r1.united(r2)}. -

562 -

563 \sa united() -

564 */ -

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

{ return *this = *this | r; }

never executed: return *this = *this | r;

0

567 -

568 /*! -

569 \fn QRegion& QRegion::operator+=(const QRect &rect) -

570 -

571 Returns a region that is the union of this region with the specified \a rect. -

572 -

573 \sa united() -

574 */ -

575 /*! -

576 \fn QRegion& QRegion::operator+=(const QRegion &r) -

577 -

578 Applies the united() function to this region and \a r and assigns -

579 the result to this region. \c r1+=r2 is equivalent to \c -

580 {r1 = r1.united(r2)}. -

581 -

582 \sa intersected() -

583 */ -

584 #if !defined (Q_OS_UNIX) && !defined (Q_OS_WIN) -

585 QRegion& QRegion::operator+=(const QRect &r) -

586 { -

587 return operator+=(QRegion(r)); -

588 } -

589 #endif -

590 -

591 /*! -

592 \fn QRegion& QRegion::operator&=(const QRegion &r) -

593 -

594 Applies the intersected() function to this region and \a r and -

595 assigns the result to this region. \c r1&=r2 is equivalent to \c -

596 r1 = r1.intersected(r2). -

597 -

598 \sa intersected() -

599 */ -

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

{ return *this = *this & r; }

never executed: return *this = *this & r;

0

602 -

603 /*! -

604 \overload -

605 \since 4.4 -

606 */ -

607 #if defined (Q_OS_UNIX) || defined (Q_OS_WIN) -

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

609 { -

return *this = *this & r;

never executed: return *this = *this & r;

0

611 } -

612 #else -

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

614 { -

615 return *this &= (QRegion(r)); -

616 } -

617 #endif -

618 -

619 /*! -

620 \fn QRegion& QRegion::operator-=(const QRegion &r) -

621 -

622 Applies the subtracted() function to this region and \a r and -

623 assigns the result to this region. \c r1-=r2 is equivalent to \c -

624 {r1 = r1.subtracted(r2)}. -

625 -

626 \sa subtracted() -

627 */ -

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

{ return *this = *this - r; }

never executed: return *this = *this - r;

0

630 -

631 /*! -

632 Applies the xored() function to this region and \a r and -

633 assigns the result to this region. \c r1^=r2 is equivalent to \c -

634 {r1 = r1.xored(r2)}. -

635 -

636 \sa xored() -

637 */ -

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

{ return *this = *this ^ r; }

never executed: return *this = *this ^ r;

0

640 -

641 /*! -

642 \fn bool QRegion::operator!=(const QRegion &other) const -

643 -

644 Returns \c true if this region is different from the \a other region; -

645 otherwise returns \c false. -

646 */ -

647 -

648 /*! -

649 Returns the region as a QVariant -

650 */ -

651 QRegion::operator QVariant() const -

652 { -

return QVariant(QVariant::Region, this);

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

0

654 } -

655 -

656 /*! -

657 \fn bool QRegion::operator==(const QRegion &r) const -

658 -

659 Returns \c true if the region is equal to \a r; otherwise returns -

660 false. -

661 */ -

662 -

663 /*! -

664 \fn void QRegion::translate(int dx, int dy) -

665 -

666 Translates (moves) the region \a dx along the X axis and \a dy -

667 along the Y axis. -

668 */ -

669 -

670 /*! -

671 \fn QRegion QRegion::translated(const QPoint &p) const -

672 \overload -

673 \since 4.1 -

674 -

675 Returns a copy of the regtion that is translated \a{p}\e{.x()} -

676 along the x axis and \a{p}\e{.y()} along the y axis, relative to -

677 the current position. Positive values move the rectangle to the -

678 right and down. -

679 -

680 \sa translate() -

681 */ -

682 -

683 /*! -

684 \since 4.1 -

685 -

686 Returns a copy of the region that is translated \a dx along the -

687 x axis and \a dy along the y axis, relative to the current -

688 position. Positive values move the region to the right and -

689 down. -

690 -

691 \sa translate() -

692 */ -

693 -

694 QRegion -

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

696 { -

697 QRegion ret(*this); -

698 ret.translate(dx, dy); -

return ret;

never executed: return ret;

0

700 } -

701 -

702 -

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

704 { -

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

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

0

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

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

0

707 } -

708 -

709 /*! -

710 \since 4.2 -

711 -

712 Returns \c true if this region intersects with \a region, otherwise -

713 returns \c false. -

714 */ -

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

716 { -

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

isEmpty()	Description
TRUE	never evaluated
FALSE	never evaluated

region.isEmpty()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return false;

never executed: return false;

0

719 -

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

!rect_intersec...oundingRect())	Description
TRUE	never evaluated
FALSE	never evaluated

0

return false;

never executed: return false;

0

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

rectCount() == 1	Description
TRUE	never evaluated
FALSE	never evaluated

region.rectCount() == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

return true;

never executed: return true;

0

724 -

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

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

727 -

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

i1 < myRects.constEnd()	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

i2 < otherRects.constEnd()	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (rect_intersects(*i1, *i2))

rect_intersects(i1, i2)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return true;

never executed: return true;

0

return false;

never executed: return false;

0

733 } -

734 -

735 /*! -

736 \fn bool QRegion::intersects(const QRect &rect) const -

737 \since 4.2 -

738 -

739 Returns \c true if this region intersects with \a rect, otherwise -

740 returns \c false. -

741 */ -

742 -

743 -

744 #if !defined (Q_OS_UNIX) && !defined (Q_OS_WIN) -

745 /*! -

746 \overload -

747 \since 4.4 -

748 */ -

749 QRegion QRegion::intersect(const QRect &r) const -

750 { -

751 return intersect(QRegion(r)); -

752 } -

753 #endif -

754 -

755 /*! -

756 \fn int QRegion::rectCount() const -

757 \since 4.6 -

758 -

759 Returns the number of rectangles that will be returned in rects(). -

760 */ -

761 -

762 /*! -

763 \fn bool QRegion::isEmpty() const -

764 -

765 Returns \c true if the region is empty; otherwise returns \c false. An -

766 empty region is a region that contains no points. -

767 -

768 Example: -

769 \snippet code/src_gui_painting_qregion_unix.cpp 0 -

770 */ -

771 -

772 /*! -

773 \fn bool QRegion::isNull() const -

774 \since 5.0 -

775 -

776 Returns \c true if the region is empty; otherwise returns \c false. An -

777 empty region is a region that contains no points. This function is -

778 the same as isEmpty -

779 -

780 \sa isEmpty() -

781 */ -

782 -

783 /*! -

784 \fn bool QRegion::contains(const QPoint &p) const -

785 -

786 Returns \c true if the region contains the point \a p; otherwise -

787 returns \c false. -

788 */ -

789 -

790 /*! -

791 \fn bool QRegion::contains(const QRect &r) const -

792 \overload -

793 -

794 Returns \c true if the region overlaps the rectangle \a r; otherwise -

795 returns \c false. -

796 */ -

797 -

798 /*! -

799 \fn QRegion QRegion::unite(const QRegion &r) const -

800 \obsolete -

801 -

802 Use united(\a r) instead. -

803 */ -

804 -

805 /*! -

806 \fn QRegion QRegion::unite(const QRect &rect) const -

807 \since 4.4 -

808 \obsolete -

809 -

810 Use united(\a rect) instead. -

811 */ -

812 -

813 /*! -

814 \fn QRegion QRegion::united(const QRect &rect) const -

815 \since 4.4 -

816 -

817 Returns a region which is the union of this region and the given \a rect. -

818 -

819 \sa intersected(), subtracted(), xored() -

820 */ -

821 -

822 /*! -

823 \fn QRegion QRegion::united(const QRegion &r) const -

824 \since 4.2 -

825 -

826 Returns a region which is the union of this region and \a r. -

827 -

828 \image runion.png Region Union -

829 -

830 The figure shows the union of two elliptical regions. -

831 -

832 \sa intersected(), subtracted(), xored() -

833 */ -

834 -

835 /*! -

836 \fn QRegion QRegion::intersect(const QRegion &r) const -

837 \obsolete -

838 -

839 Use intersected(\a r) instead. -

840 */ -

841 -

842 /*! -

843 \fn QRegion QRegion::intersect(const QRect &rect) const -

844 \since 4.4 -

845 \obsolete -

846 -

847 Use intersected(\a rect) instead. -

848 */ -

849 -

850 /*! -

851 \fn QRegion QRegion::intersected(const QRect &rect) const -

852 \since 4.4 -

853 -

854 Returns a region which is the intersection of this region and the given \a rect. -

855 -

856 \sa subtracted(), united(), xored() -

857 */ -

858 -

859 /*! -

860 \fn QRegion QRegion::intersected(const QRegion &r) const -

861 \since 4.2 -

862 -

863 Returns a region which is the intersection of this region and \a r. -

864 -

865 \image rintersect.png Region Intersection -

866 -

867 The figure shows the intersection of two elliptical regions. -

868 -

869 \sa subtracted(), united(), xored() -

870 */ -

871 -

872 /*! -

873 \fn QRegion QRegion::subtract(const QRegion &r) const -

874 \obsolete -

875 -

876 Use subtracted(\a r) instead. -

877 */ -

878 -

879 /*! -

880 \fn QRegion QRegion::subtracted(const QRegion &r) const -

881 \since 4.2 -

882 -

883 Returns a region which is \a r subtracted from this region. -

884 -

885 \image rsubtract.png Region Subtraction -

886 -

887 The figure shows the result when the ellipse on the right is -

888 subtracted from the ellipse on the left (\c {left - right}). -

889 -

890 \sa intersected(), united(), xored() -

891 */ -

892 -

893 /*! -

894 \fn QRegion QRegion::eor(const QRegion &r) const -

895 \obsolete -

896 -

897 Use xored(\a r) instead. -

898 */ -

899 -

900 /*! -

901 \fn QRegion QRegion::xored(const QRegion &r) const -

902 \since 4.2 -

903 -

904 Returns a region which is the exclusive or (XOR) of this region -

905 and \a r. -

906 -

907 \image rxor.png Region XORed -

908 -

909 The figure shows the exclusive or of two elliptical regions. -

910 -

911 \sa intersected(), united(), subtracted() -

912 */ -

913 -

914 /*! -

915 \fn QRect QRegion::boundingRect() const -

916 -

917 Returns the bounding rectangle of this region. An empty region -

918 gives a rectangle that is QRect::isNull(). -

919 */ -

920 -

921 /*! -

922 \fn QVector<QRect> QRegion::rects() const -

923 -

924 Returns an array of non-overlapping rectangles that make up the -

925 region. -

926 -

927 The union of all the rectangles is equal to the original region. -

928 */ -

929 -

930 /*! -

931 \fn void QRegion::setRects(const QRect *rects, int number) -

932 -

933 Sets the region using the array of rectangles specified by \a rects and -

934 \a number. -

935 The rectangles \e must be optimally Y-X sorted and follow these restrictions: -

936 -

937 \list -

938 \li The rectangles must not intersect. -

939 \li All rectangles with a given top coordinate must have the same height. -

940 \li No two rectangles may abut horizontally (they should be combined -

941 into a single wider rectangle in that case). -

942 \li The rectangles must be sorted in ascending order, with Y as the major -

943 sort key and X as the minor sort key. -

944 \endlist -

945 \omit -

946 Only some platforms have these restrictions (Qt for Embedded Linux, X11 and \macos). -

947 \endomit -

948 */ -

949 -

950 namespace { -

951 -

952 struct Segment -

953 { -

954 Segment() {} -

955 Segment(const QPoint &p) -

956 : added(false) -

957 , point(p) -

958 { -

}

never executed: end of block

0

960 -

961 int left() const -

962 { -

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

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

0

964 } -

965 -

966 int right() const -

967 { -

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

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

0

969 } -

970 -

971 bool overlaps(const Segment &other) const -

972 { -

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

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

0

974 } -

975 -

976 void connect(Segment &other) -

977 { -

978 next = &other; -

979 other.prev = this; -

980 -

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

}

never executed: end of block

0

983 -

984 void merge(Segment &other) -

985 { -

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

right() <= other.right()	Description
TRUE	never evaluated
FALSE	never evaluated

0

987 QPoint p = other.point; -

988 Segment *oprev = other.prev; -

989 -

990 other.point = point; -

991 other.prev = prev; -

992 prev->next = &other; -

993 -

994 point = p; -

995 prev = oprev; -

996 oprev->next = this; -

} else {

never executed: end of block

0

998 Segment *onext = other.next; -

999 other.next = next; -

1000 next->prev = &other; -

1001 -

1002 next = onext; -

1003 next->prev = this; -

}

never executed: end of block

0

1005 } -

1006 -

1007 int horizontal : 1; -

1008 int added : 1; -

1009 -

1010 QPoint point; -

1011 Segment *prev; -

1012 Segment *next; -

1013 }; -

1014 -

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

1016 { -

1017 int i = 0; -

1018 int j = 0; -

1019 -

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

i != na	Description
TRUE	never evaluated
FALSE	never evaluated

j != nb	Description
TRUE	never evaluated
FALSE	never evaluated

0

1021 Segment &sa = a[i]; -

1022 Segment &sb = b[j]; -

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

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

if (sa.overlaps(sb))

sa.overlaps(sb)	Description
TRUE	never evaluated
FALSE	never evaluated

0

sa.merge(sb);

never executed: sa.merge(sb);

0

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

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

}

never executed: end of block

0

}

never executed: end of block

0

1031 -

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

1033 { -

1034 Segment *current = segment; -

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

1036 -

1037 current->added = true; -

1038 -

1039 Segment *last = current; -

1040 current = current->next; -

while (current != segment) {

current != segment	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

current->horiz...st->horizontal	Description
TRUE	never evaluated
FALSE	never evaluated

0

path.lineTo(current->point);

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

0

1044 current->added = true; -

1045 last = current; -

1046 current = current->next; -

}

never executed: end of block

0

}

never executed: end of block

0

1049 -

1050 } // unnamed namespace -

1051 -

1052 // the following is really a lie, because Segments cannot be relocated, as they -

1053 // reference each other by address. For the same reason, they aren't even copyable, -

1054 // but the code works with the compiler-generated (wrong) copy and move special -

1055 // members, so use this as an optimization. The only container these are used in -

1056 // (a QVarLengthArray in qt_regionToPath()) is resized once up-front, so doesn't -

1057 // have a problem with this, but benefits from not having to run Segment ctors: -

1058 Q_DECLARE_TYPEINFO(Segment, Q_PRIMITIVE_TYPE); -

1059 -

1060 Q_GUI_EXPORT QPainterPath qt_regionToPath(const QRegion &region) -

1061 { -

1062 QPainterPath result; -

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

region.rectCount() == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

return result;

never executed: return result;

0

1066 } -

1067 -

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

1069 -

1070 QVarLengthArray<Segment> segments; -

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

1072 -

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

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

1075 -

1076 int lastRowSegmentCount = 0; -

1077 Segment *lastRowSegments = 0; -

1078 -

1079 int lastSegment = 0; -

1080 int lastY = 0; -

while (rect != end) {

rect != end	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

1083 int count = 0; -

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

&rect[count] != end	Description
TRUE	never evaluated
FALSE	never evaluated

rect[count].y() == y	Description
TRUE	never evaluated
FALSE	never evaluated

0

++count;

never executed: ++count;

0

1086 -

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

i < count	Description
TRUE	never evaluated
FALSE	never evaluated

0

1088 int offset = lastSegment + i; -

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

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

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

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

1093 -

1094 offset = lastSegment + i; -

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

j < 4	Description
TRUE	never evaluated
FALSE	never evaluated

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: end of block

0

1098 -

if (lastRowSegments && lastY == y)

lastRowSegments	Description
TRUE	never evaluated
FALSE	never evaluated

lastY == y	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

0

1101 -

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

1103 lastRowSegmentCount = count; -

1104 lastSegment += 4 * count; -

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

1106 rect += count; -

}

never executed: end of block

0

1108 -

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

i < lastSegment	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

if (!segment->added)

!segment->added	Description
TRUE	never evaluated
FALSE	never evaluated

0

addSegmentsToPath(segment, result);

never executed: addSegmentsToPath(segment, result);

0

}

never executed: end of block

0

1114 -

return result;

never executed: return result;

0

1116 } -

1117 -

1118 #if defined(Q_OS_UNIX) || defined(Q_OS_WIN) -

1119 -

1120 //#define QT_REGION_DEBUG -

1121 /* -

1122 * clip region -

1123 */ -

1124 -

1125 struct QRegionPrivate { -

1126 int numRects; -

1127 int innerArea; -

1128 QVector<QRect> rects; -

1129 QRect extents; -

1130 QRect innerRect; -

1131 -

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

never executed: end of block

0

1133 inline QRegionPrivate(const QRect &r) -

1134 : numRects(1), -

1135 innerArea(r.width() * r.height()), -

1136 extents(r), -

1137 innerRect(r) -

1138 { -

}

never executed: end of block

0

1140 -

1141 void intersect(const QRect &r); -

1142 -

1143 /* -

1144 * Returns \c true if r is guaranteed to be fully contained in this region. -

1145 * A false return value does not guarantee the opposite. -

1146 */ -

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

return contains(r.extents);

never executed: return contains(r.extents);

0

1149 } -

1150 -

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

1152 const QRect &r1 = innerRect; -

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

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

0

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

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

0

1155 } -

1156 -

1157 /* -

1158 * Returns \c true if this region is guaranteed to be fully contained in r. -

1159 */ -

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

1161 const QRect &r2 = extents; -

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

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

0

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

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

0

1164 } -

1165 -

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

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

if (area > innerArea) {

area > innerArea	Description
TRUE	never evaluated
FALSE	never evaluated

0

1169 innerArea = area; -

1170 innerRect = rect; -

}

never executed: end of block

0

}

never executed: end of block

0

1173 -

1174 inline void vectorize() { -

if (numRects == 1) {

numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (!rects.size())

!rects.size()	Description
TRUE	never evaluated
FALSE	never evaluated

0

rects.resize(1);

never executed: rects.resize(1);

0

1178 rects[0] = extents; -

}

never executed: end of block

0

}

never executed: end of block

0

1181 -

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

1183 void append(const QRegionPrivate *r); -

1184 void prepend(const QRect *r); -

1185 void prepend(const QRegionPrivate *r); -

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

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

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

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

1190 -

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

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

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

1194 const QRect *nextToTop, -

1195 const QRect *nextToBottom); -

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

1197 const QRect *nextToBottom, -

1198 const QRect *nextToTop); -

1199 -

1200 #ifdef QT_REGION_DEBUG -

1201 void selfTest() const; -

1202 #endif -

1203 }; -

1204 -

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

1206 { -

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

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

0

1208 } -

1209 -

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

1211 { -

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

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

0

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

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

0

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

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

0

1215 } -

1216 -

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

1218 { -

return canMergeFromRight(left, right);

never executed: return canMergeFromRight(left, right);

0

1220 } -

1221 -

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

1223 { -

if (canMergeFromRight(left, right)) {

canMergeFromRight(left, right)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

1226 updateInnerRect(*left); -

return true;

never executed: return true;

0

1228 } -

return false;

never executed: return false;

0

1230 } -

1231 -

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

1233 { -

if (canMergeFromLeft(right, left)) {

canMergeFromLeft(right, left)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

1236 updateInnerRect(*right); -

return true;

never executed: return true;

0

1238 } -

return false;

never executed: return false;

0

1240 } -

1241 -

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

1243 const QRect *nextToTop, -

1244 const QRect *nextToBottom) -

1245 { -

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

nextToTop	Description
TRUE	never evaluated
FALSE	never evaluated

nextToTop->y() == top->y()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return false;

never executed: return false;

0

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

nextToBottom	Description
TRUE	never evaluated
FALSE	never evaluated

nextToBottom->...== bottom->y()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return false;

never executed: return false;

0

1250 -

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

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

0

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

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

0

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

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

0

1254 } -

1255 -

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

1257 const QRect *nextToTop, -

1258 const QRect *nextToBottom) -

1259 { -

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

canMergeFromBe... nextToBottom)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

1262 updateInnerRect(*top); -

return true;

never executed: return true;

0

1264 } -

return false;

never executed: return false;

0

1266 } -

1267 -

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

1269 const QRect *nextToBottom, -

1270 const QRect *nextToTop) -

1271 { -

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

canMergeFromBe... nextToBottom)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

1274 updateInnerRect(*bottom); -

return true;

never executed: return true;

0

1276 } -

return false;

never executed: return false;

0

1278 } -

1279 -

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

1281 const QRect &r2) -

1282 { -

1283 QRect r; -

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

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

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

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

return r;

never executed: return r;

0

1289 } -

1290 -

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

1292 { -

1293 Q_ASSERT(extents.intersects(rect)); -

1294 Q_ASSERT(numRects > 1); -

1295 -

1296 #ifdef QT_REGION_DEBUG -

1297 selfTest(); -

1298 #endif -

1299 -

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

1301 extents = QRect(); -

1302 innerRect = QRect(); -

1303 innerArea = -1; -

1304 -

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

1306 const QRect *src = dest; -

1307 int n = numRects; -

1308 numRects = 0; -

while (n--) {

n--	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

if (dest->isEmpty())

dest->isEmpty()	Description
TRUE	never evaluated
FALSE	never evaluated

0

continue;

never executed: continue;

0

1313 -

if (numRects == 0) {

numRects == 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

1315 extents = *dest; -

} else {

never executed: end of block

0

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

1318 // hw: extents.top() will never change after initialization -

1319 //extents.setTop(qMin(extents.top(), dest->top())); -

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

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

1322 -

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

numRects > 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

1324 -

1325 // mergeFromBelow inlined and optimized -

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

canMergeFromBe...nextToLast, 0)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

!n	Description
TRUE	never evaluated
FALSE	never evaluated

src->y() != dest->y()	Description
TRUE	never evaluated
FALSE	never evaluated

src->left() > r.right()	Description
TRUE	never evaluated
FALSE	never evaluated

0

1328 QRect *prev = dest - 1; -

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

1330 updateInnerRect(*prev); -

continue;

never executed: continue;

0

1332 } -

}

never executed: end of block

0

}

never executed: end of block

0

1335 updateInnerRect(*dest); -

1336 ++dest; -

1337 ++numRects; -

}

never executed: end of block

0

1339 #ifdef QT_REGION_DEBUG -

1340 selfTest(); -

1341 #endif -

}

never executed: end of block

0

1343 -

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

1345 { -

1346 Q_ASSERT(!r->isEmpty()); -

1347 -

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

numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (mergeFromRight(myLast, r)) {

mergeFromRight(myLast, r)	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (numRects > 1) {

numRects > 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

numRects > 2	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

mergeFromBelow... nextToTop, 0)	Description
TRUE	never evaluated
FALSE	never evaluated

0

--numRects;

never executed: --numRects;

0

}

never executed: end of block

0

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

never executed: end of block

mergeFromBelow...t - 1 : 0), 0)	Description
TRUE	never evaluated
FALSE	never evaluated

0

1356 // nothing -

} else {

never executed: end of block

0

1358 vectorize(); -

1359 ++numRects; -

1360 updateInnerRect(*r); -

if (rects.size() < numRects)

rects.size() < numRects	Description
TRUE	never evaluated
FALSE	never evaluated

0

rects.resize(numRects);

never executed: rects.resize(numRects);

0

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

}

never executed: end of block

0

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

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

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

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

1369 -

1370 #ifdef QT_REGION_DEBUG -

1371 selfTest(); -

1372 #endif -

}

never executed: end of block

0

1374 -

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

1376 { -

1377 Q_ASSERT(!isEmptyHelper(r)); -

1378 -

if (r->numRects == 1) {

r->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

1380 append(&r->extents); -

return;

never executed: return;

0

1382 } -

1383 -

1384 vectorize(); -

1385 -

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

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

1388 int numAppend = r->numRects; -

1389 -

1390 // try merging -

1391 { -

1392 const QRect *rFirst = srcRect; -

1393 QRect *myLast = destRect - 1; -

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

numRects > 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (mergeFromRight(myLast, rFirst)) {

mergeFromRight(myLast, rFirst)	Description
TRUE	never evaluated
FALSE	never evaluated

0

1396 ++srcRect; -

1397 --numAppend; -

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

numAppend > 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

mergeFromBelow... rNextToFirst)	Description
TRUE	never evaluated
FALSE	never evaluated

0

1400 ++srcRect; -

1401 --numAppend; -

}

never executed: end of block

0

if (numRects > 1) {

numRects > 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

numRects > 2	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

numAppend > 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

mergeFromBelow... rNextToFirst)	Description
TRUE	never evaluated
FALSE	never evaluated

0

1407 --destRect; -

1408 --numRects; -

}

never executed: end of block

0

}

never executed: end of block

0

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

never executed: end of block

mergeFromBelow...t, rFirst + 1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

1412 ++srcRect; -

1413 --numAppend; -

}

never executed: end of block

0

1415 } -

1416 -

1417 // append rectangles -

if (numAppend > 0) {

numAppend > 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

1419 const int newNumRects = numRects + numAppend; -

if (newNumRects > rects.size()) {

newNumRects > rects.size()	Description
TRUE	never evaluated
FALSE	never evaluated

0

1421 rects.resize(newNumRects); -

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

}

never executed: end of block

0

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

1425 -

1426 numRects = newNumRects; -

}

never executed: end of block

0

1428 -

1429 // update inner rectangle -

if (innerArea < r->innerArea) {

innerArea < r->innerArea	Description
TRUE	never evaluated
FALSE	never evaluated

0

1431 innerArea = r->innerArea; -

1432 innerRect = r->innerRect; -

}

never executed: end of block

0

1434 -

1435 // update extents -

1436 destRect = &extents; -

1437 srcRect = &r->extents; -

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

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

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

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

1442 -

1443 #ifdef QT_REGION_DEBUG -

1444 selfTest(); -

1445 #endif -

}

never executed: end of block

0

1447 -

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

1449 { -

1450 Q_ASSERT(!isEmptyHelper(r)); -

1451 -

if (r->numRects == 1) {

r->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

1453 prepend(&r->extents); -

return;

never executed: return;

0

1455 } -

1456 -

1457 vectorize(); -

1458 -

1459 int numPrepend = r->numRects; -

1460 int numSkip = 0; -

1461 -

1462 // try merging -

1463 { -

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

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

numRects > 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

r->numRects > 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (mergeFromLeft(myFirst, rLast)) {

mergeFromLeft(myFirst, rLast)	Description
TRUE	never evaluated
FALSE	never evaluated

0

1469 --numPrepend; -

1470 --rLast; -

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

numPrepend > 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

mergeFromAbove..., rNextToLast)	Description
TRUE	never evaluated
FALSE	never evaluated

0

1473 --numPrepend; -

1474 --rLast; -

}

never executed: end of block

0

if (numRects > 1) {

numRects > 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

numRects > 2	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

numPrepend > 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

mergeFromAbove..., rNextToLast)	Description
TRUE	never evaluated
FALSE	never evaluated

0

1480 --numRects; -

1481 ++numSkip; -

}

never executed: end of block

0

}

never executed: end of block

0

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

never executed: end of block

mergeFromAbove..., rNextToLast)	Description
TRUE	never evaluated
FALSE	never evaluated

0

1485 --numPrepend; -

}

never executed: end of block

0

1487 } -

1488 -

if (numPrepend > 0) {

numPrepend > 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

1490 const int newNumRects = numRects + numPrepend; -

if (newNumRects > rects.size())

newNumRects > rects.size()	Description
TRUE	never evaluated
FALSE	never evaluated

0

rects.resize(newNumRects);

never executed: rects.resize(newNumRects);

0

1493 -

1494 // move existing rectangles -

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

1496 numRects * sizeof(QRect)); -

1497 -

1498 // prepend new rectangles -

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

1500 -

1501 numRects = newNumRects; -

}

never executed: end of block

0

1503 -

1504 // update inner rectangle -

if (innerArea < r->innerArea) {

innerArea < r->innerArea	Description
TRUE	never evaluated
FALSE	never evaluated

0

1506 innerArea = r->innerArea; -

1507 innerRect = r->innerRect; -

}

never executed: end of block

0

1509 -

1510 // update extents -

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

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

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

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

1515 -

1516 #ifdef QT_REGION_DEBUG -

1517 selfTest(); -

1518 #endif -

}

never executed: end of block

0

1520 -

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

1522 { -

1523 Q_ASSERT(!r->isEmpty()); -

1524 -

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

numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (mergeFromLeft(myFirst, r)) {

mergeFromLeft(myFirst, r)	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (numRects > 1) {

numRects > 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

numRects > 2	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

mergeFromAbove...extToFirst, 0)	Description
TRUE	never evaluated
FALSE	never evaluated

0

1530 --numRects; -

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

1532 numRects * sizeof(QRect)); -

}

never executed: end of block

0

}

never executed: end of block

0

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

never executed: end of block

mergeFromAbove...t + 1 : 0), 0)	Description
TRUE	never evaluated
FALSE	never evaluated

0

1536 // nothing -

} else {

never executed: end of block

0

1538 vectorize(); -

1539 ++numRects; -

1540 updateInnerRect(*r); -

1541 rects.prepend(*r); -

}

never executed: end of block

0

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

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

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

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

1547 -

1548 #ifdef QT_REGION_DEBUG -

1549 selfTest(); -

1550 #endif -

}

never executed: end of block

0

1552 -

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

1554 { -

1555 Q_ASSERT(!r->isEmpty()); -

1556 -

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

(numRects == 1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

r->top() > myLast->bottom()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return true;

never executed: return true;

0

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

r->top() == myLast->top()	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

r->height() ==...Last->height()	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

r->left() > myLast->right()	Description
TRUE	never evaluated
FALSE	never evaluated

0

1563 { -

return true;

never executed: return true;

0

1565 } -

1566 -

return false;

never executed: return false;

0

1568 } -

1569 -

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

1571 { -

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

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

0

1573 } -

1574 -

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

1576 { -

1577 Q_ASSERT(!r->isEmpty()); -

1578 -

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

(numRects == 1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (r->bottom() < myFirst->top()) // not overlapping

r->bottom() < myFirst->top()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return true;

never executed: return true;

0

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

r->top() == myFirst->top()	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

r->height() ==...irst->height()	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

r->right() < myFirst->left()	Description
TRUE	never evaluated
FALSE	never evaluated

0

1585 { -

return true;

never executed: return true;

0

1587 } -

1588 -

return false;

never executed: return false;

0

1590 } -

1591 -

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

1593 { -

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

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

0

1595 } -

1596 -

1597 #ifdef QT_REGION_DEBUG -

1598 void QRegionPrivate::selfTest() const -

1599 { -

1600 if (numRects == 0) { -

1601 Q_ASSERT(extents.isEmpty()); -

1602 Q_ASSERT(innerRect.isEmpty()); -

1603 return; -

1604 } -

1605 -

1606 Q_ASSERT(innerArea == (innerRect.width() * innerRect.height())); -

1607 -

1608 if (numRects == 1) { -

1609 Q_ASSERT(innerRect == extents); -

1610 Q_ASSERT(!innerRect.isEmpty()); -

1611 return; -

1612 } -

1613 -

1614 for (int i = 0; i < numRects; ++i) { -

1615 const QRect r = rects.at(i); -

1616 if ((r.width() * r.height()) > innerArea) -

1617 qDebug() << "selfTest(): innerRect" << innerRect << '<' << r; -

1618 } -

1619 -

1620 QRect r = rects.first(); -

1621 for (int i = 1; i < numRects; ++i) { -

1622 const QRect r2 = rects.at(i); -

1623 Q_ASSERT(!r2.isEmpty()); -

1624 if (r2.y() == r.y()) { -

1625 Q_ASSERT(r.bottom() == r2.bottom()); -

1626 Q_ASSERT(r.right() < (r2.left() + 1)); -

1627 } else { -

1628 Q_ASSERT(r2.y() >= r.bottom()); -

1629 } -

1630 r = r2; -

1631 } -

1632 } -

1633 #endif // QT_REGION_DEBUG -

1634 -

1635 static QRegionPrivate qrp; -

1636 const QRegion::QRegionData QRegion::shared_empty = {Q_REFCOUNT_INITIALIZE_STATIC, &qrp}; -

1637 -

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

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

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

1641 int y1, int y2); -

1642 -

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

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

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

1646 OverlapFunc overlapFunc, NonOverlapFunc nonOverlap1Func, -

1647 NonOverlapFunc nonOverlap2Func); -

1648 -

1649 #define RectangleOut 0 -

1650 #define RectangleIn 1 -

1651 #define RectanglePart 2 -

1652 #define EvenOddRule 0 -

1653 #define WindingRule 1 -

1654 -

1655 // START OF region.h extract -

1656 /* $XConsortium: region.h,v 11.14 94/04/17 20:22:20 rws Exp $ */ -

1657 /************************************************************************ -

1658 -

1659 Copyright (c) 1987 X Consortium -

1660 -

1661 Permission is hereby granted, free of charge, to any person obtaining a copy -

1662 of this software and associated documentation files (the "Software"), to deal -

1663 in the Software without restriction, including without limitation the rights -

1664 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -

1665 copies of the Software, and to permit persons to whom the Software is -

1666 furnished to do so, subject to the following conditions: -

1667 -

1668 The above copyright notice and this permission notice shall be included in -

1669 all copies or substantial portions of the Software. -

1670 -

1671 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -

1672 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -

1673 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -

1674 X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN -

1675 AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN -

1676 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. -

1677 -

1678 Except as contained in this notice, the name of the X Consortium shall not be -

1679 used in advertising or otherwise to promote the sale, use or other dealings -

1680 in this Software without prior written authorization from the X Consortium. -

1681 -

1682 -

1683 Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts. -

1684 -

1685 All Rights Reserved -

1686 -

1687 Permission to use, copy, modify, and distribute this software and its -

1688 documentation for any purpose and without fee is hereby granted, -

1689 provided that the above copyright notice appear in all copies and that -

1690 both that copyright notice and this permission notice appear in -

1691 supporting documentation, and that the name of Digital not be -

1692 used in advertising or publicity pertaining to distribution of the -

1693 software without specific, written prior permission. -

1694 -

1695 DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING -

1696 ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL -

1697 DIGITAL BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR -

1698 ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, -

1699 WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, -

1700 ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS -

1701 SOFTWARE. -

1702 -

1703 ************************************************************************/ -

1704 -

1705 #ifndef _XREGION_H -

1706 #define _XREGION_H -

1707 -

1708 QT_BEGIN_INCLUDE_NAMESPACE -

1709 #include <limits.h> -

1710 QT_END_INCLUDE_NAMESPACE -

1711 -

1712 /* 1 if two BOXes overlap. -

1713 * 0 if two BOXes do not overlap. -

1714 * Remember, x2 and y2 are not in the region -

1715 */ -

1716 #define EXTENTCHECK(r1, r2) \ -

1717 ((r1)->right() >= (r2)->left() && \ -

1718 (r1)->left() <= (r2)->right() && \ -

1719 (r1)->bottom() >= (r2)->top() && \ -

1720 (r1)->top() <= (r2)->bottom()) -

1721 -

1722 /* -

1723 * update region extents -

1724 */ -

1725 #define EXTENTS(r,idRect){\ -

1726 if((r)->left() < (idRect)->extents.left())\ -

1727 (idRect)->extents.setLeft((r)->left());\ -

1728 if((r)->top() < (idRect)->extents.top())\ -

1729 (idRect)->extents.setTop((r)->top());\ -

1730 if((r)->right() > (idRect)->extents.right())\ -

1731 (idRect)->extents.setRight((r)->right());\ -

1732 if((r)->bottom() > (idRect)->extents.bottom())\ -

1733 (idRect)->extents.setBottom((r)->bottom());\ -

1734 } -

1735 -

1736 /* -

1737 * Check to see if there is enough memory in the present region. -

1738 */ -

1739 #define MEMCHECK(dest, rect, firstrect){\ -

1740 if ((dest).numRects >= ((dest).rects.size()-1)){\ -

1741 firstrect.resize(firstrect.size() * 2); \ -

1742 (rect) = (firstrect).data() + (dest).numRects;\ -

1743 }\ -

1744 } -

1745 -

1746 -

1747 /* -

1748 * number of points to buffer before sending them off -

1749 * to scanlines(): Must be an even number -

1750 */ -

1751 #define NUMPTSTOBUFFER 200 -

1752 -

1753 /* -

1754 * used to allocate buffers for points and link -

1755 * the buffers together -

1756 */ -

1757 typedef struct _POINTBLOCK { -

1758 char data[NUMPTSTOBUFFER * sizeof(QPoint)]; -

1759 QPoint *pts; -

1760 struct _POINTBLOCK *next; -

1761 } POINTBLOCK; -

1762 -

1763 #endif -

1764 // END OF region.h extract -

1765 -

1766 // START OF Region.c extract -

1767 /* $XConsortium: Region.c /main/30 1996/10/22 14:21:24 kaleb $ */ -

1768 /************************************************************************ -

1769 -

1770 Copyright (c) 1987, 1988 X Consortium -

1771 -

1772 Permission is hereby granted, free of charge, to any person obtaining a copy -

1773 of this software and associated documentation files (the "Software"), to deal -

1774 in the Software without restriction, including without limitation the rights -

1775 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -

1776 copies of the Software, and to permit persons to whom the Software is -

1777 furnished to do so, subject to the following conditions: -

1778 -

1779 The above copyright notice and this permission notice shall be included in -

1780 all copies or substantial portions of the Software. -

1781 -

1782 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -

1783 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -

1784 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -

1785 X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN -

1786 AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN -

1787 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. -

1788 -

1789 Except as contained in this notice, the name of the X Consortium shall not be -

1790 used in advertising or otherwise to promote the sale, use or other dealings -

1791 in this Software without prior written authorization from the X Consortium. -

1792 -

1793 -

1794 Copyright 1987, 1988 by Digital Equipment Corporation, Maynard, Massachusetts. -

1795 -

1796 All Rights Reserved -

1797 -

1798 Permission to use, copy, modify, and distribute this software and its -

1799 documentation for any purpose and without fee is hereby granted, -

1800 provided that the above copyright notice appear in all copies and that -

1801 both that copyright notice and this permission notice appear in -

1802 supporting documentation, and that the name of Digital not be -

1803 used in advertising or publicity pertaining to distribution of the -

1804 software without specific, written prior permission. -

1805 -

1806 DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING -

1807 ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL -

1808 DIGITAL BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR -

1809 ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, -

1810 WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, -

1811 ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS -

1812 SOFTWARE. -

1813 -

1814 ************************************************************************/ -

1815 /* -

1816 * The functions in this file implement the Region abstraction, similar to one -

1817 * used in the X11 sample server. A Region is simply an area, as the name -

1818 * implies, and is implemented as a "y-x-banded" array of rectangles. To -

1819 * explain: Each Region is made up of a certain number of rectangles sorted -

1820 * by y coordinate first, and then by x coordinate. -

1821 * -

1822 * Furthermore, the rectangles are banded such that every rectangle with a -

1823 * given upper-left y coordinate (y1) will have the same lower-right y -

1824 * coordinate (y2) and vice versa. If a rectangle has scanlines in a band, it -

1825 * will span the entire vertical distance of the band. This means that some -

1826 * areas that could be merged into a taller rectangle will be represented as -

1827 * several shorter rectangles to account for shorter rectangles to its left -

1828 * or right but within its "vertical scope". -

1829 * -

1830 * An added constraint on the rectangles is that they must cover as much -

1831 * horizontal area as possible. E.g. no two rectangles in a band are allowed -

1832 * to touch. -

1833 * -

1834 * Whenever possible, bands will be merged together to cover a greater vertical -

1835 * distance (and thus reduce the number of rectangles). Two bands can be merged -

1836 * only if the bottom of one touches the top of the other and they have -

1837 * rectangles in the same places (of the same width, of course). This maintains -

1838 * the y-x-banding that's so nice to have... -

1839 */ -

1840 /* $XFree86: xc/lib/X11/Region.c,v 1.1.1.2.2.2 1998/10/04 15:22:50 hohndel Exp $ */ -

1841 -

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

1843 QRegionPrivate &dest) -

1844 { -

if (rect->isEmpty())

rect->isEmpty()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return;

never executed: return;

0

1847 -

1848 Q_ASSERT(EqualRegion(source, &dest)); -

1849 -

if (dest.numRects == 0) {

dest.numRects == 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

1851 dest = QRegionPrivate(*rect); -

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

never executed: end of block

dest.canAppend(rect)	Description
TRUE	never evaluated
FALSE	never evaluated

0

1853 dest.append(rect); -

} else {

never executed: end of block

0

1855 QRegionPrivate p(*rect); -

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

}

never executed: end of block

0

1858 } -

1859 -

1860 /*- -

1861 *----------------------------------------------------------------------- -

1862 * miSetExtents -- -

1863 * Reset the extents and innerRect of a region to what they should be. -

1864 * Called by miSubtract and miIntersect b/c they can't figure it out -

1865 * along the way or do so easily, as miUnion can. -

1866 * -

1867 * Results: -

1868 * None. -

1869 * -

1870 * Side Effects: -

1871 * The region's 'extents' and 'innerRect' structure is overwritten. -

1872 * -

1873 *----------------------------------------------------------------------- -

1874 */ -

1875 static void miSetExtents(QRegionPrivate &dest) -

1876 { -

1877 const QRect *pBox, -

1878 *pBoxEnd; -

1879 QRect *pExtents; -

1880 -

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

1882 dest.innerArea = -1; -

if (dest.numRects == 0) {

dest.numRects == 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

return;

never executed: return;

0

1886 } -

1887 -

1888 pExtents = &dest.extents; -

if (dest.rects.isEmpty())

dest.rects.isEmpty()	Description
TRUE	never evaluated
FALSE	never evaluated

0

pBox = &dest.extents;

never executed: pBox = &dest.extents;

0

1891 else -

pBox = dest.rects.constData();

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

0

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

1894 -

1895 /* -

1896 * Since pBox is the first rectangle in the region, it must have the -

1897 * smallest y1 and since pBoxEnd is the last rectangle in the region, -

1898 * it must have the largest y2, because of banding. Initialize x1 and -

1899 * x2 from pBox and pBoxEnd, resp., as good things to initialize them -

1900 * to... -

1901 */ -

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

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

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

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

1906 -

1907 Q_ASSERT(pExtents->top() <= pExtents->bottom()); -

while (pBox <= pBoxEnd) {

pBox <= pBoxEnd	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

pBox->left() <...xtents->left()	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

0

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

pBox->right() ...tents->right()	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

0

1913 dest.updateInnerRect(*pBox); -

1914 ++pBox; -

}

never executed: end of block

0

1916 Q_ASSERT(pExtents->left() <= pExtents->right()); -

}

never executed: end of block

0

1918 -

1919 /* TranslateRegion(pRegion, x, y) -

1920 translates in place -

1921 added by raymond -

1922 */ -

1923 -

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

1925 { -

if (region.rects.size()) {

region.rects.size()	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

1928 int nbox = region.numRects; -

1929 -

while (nbox--) {

nbox--	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

1932 ++pbox; -

}

never executed: end of block

0

}

never executed: end of block

0

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

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

}

never executed: end of block

0

1938 -

1939 /*====================================================================== -

1940 * Region Intersection -

1941 *====================================================================*/ -

1942 /*- -

1943 *----------------------------------------------------------------------- -

1944 * miIntersectO -- -

1945 * Handle an overlapping band for miIntersect. -

1946 * -

1947 * Results: -

1948 * None. -

1949 * -

1950 * Side Effects: -

1951 * Rectangles may be added to the region. -

1952 * -

1953 *----------------------------------------------------------------------- -

1954 */ -

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

1956 const QRect *r2, const QRect *r2End, int y1, int y2) -

1957 { -

1958 int x1; -

1959 int x2; -

1960 QRect *pNextRect; -

1961 -

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

1963 -

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

r1 != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

r2 != r2End	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

1967 -

1968 /* -

1969 * If there's any overlap between the two rectangles, add that -

1970 * overlap to the new region. -

1971 * There's no need to check for subsumption because the only way -

1972 * such a need could arise is if some region has two rectangles -

1973 * right next to each other. Since that should never happen... -

1974 */ -

if (x1 <= x2) {

x1 <= x2	Description
TRUE	never evaluated
FALSE	never evaluated

0

1976 Q_ASSERT(y1 <= y2); -

MEMCHECK(dest, pNextRect, dest.rects)

never executed: end of block

(dest).numRect...ects.size()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

1979 ++dest.numRects; -

1980 ++pNextRect; -

}

never executed: end of block

0

1982 -

1983 /* -

1984 * Need to advance the pointers. Shift the one that extends -

1985 * to the right the least, since the other still has a chance to -

1986 * overlap with that region's next rectangle, if you see what I mean. -

1987 */ -

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

r1->right() < r2->right()	Description
TRUE	never evaluated
FALSE	never evaluated

0

1989 ++r1; -

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

never executed: end of block

r2->right() < r1->right()	Description
TRUE	never evaluated
FALSE	never evaluated

0

1991 ++r2; -

} else {

never executed: end of block

0

1993 ++r1; -

1994 ++r2; -

}

never executed: end of block

0

1996 } -

}

never executed: end of block

0

1998 -

1999 /*====================================================================== -

2000 * Generic Region Operator -

2001 *====================================================================*/ -

2002 -

2003 /*- -

2004 *----------------------------------------------------------------------- -

2005 * miCoalesce -- -

2006 * Attempt to merge the boxes in the current band with those in the -

2007 * previous one. Used only by miRegionOp. -

2008 * -

2009 * Results: -

2010 * The new index for the previous band. -

2011 * -

2012 * Side Effects: -

2013 * If coalescing takes place: -

2014 * - rectangles in the previous band will have their y2 fields -

2015 * altered. -

2016 * - dest.numRects will be decreased. -

2017 * -

2018 *----------------------------------------------------------------------- -

2019 */ -

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

2021 { -

2022 QRect *pPrevBox; /* Current box in previous band */ -

2023 QRect *pCurBox; /* Current box in current band */ -

2024 QRect *pRegEnd; /* End of region */ -

2025 int curNumRects; /* Number of rectangles in current band */ -

2026 int prevNumRects; /* Number of rectangles in previous band */ -

2027 int bandY1; /* Y1 coordinate for current band */ -

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

2029 -

2030 pRegEnd = rData + dest.numRects; -

2031 -

2032 pPrevBox = rData + prevStart; -

2033 prevNumRects = curStart - prevStart; -

2034 -

2035 /* -

2036 * Figure out how many rectangles are in the current band. Have to do -

2037 * this because multiple bands could have been added in miRegionOp -

2038 * at the end when one region has been exhausted. -

2039 */ -

2040 pCurBox = rData + curStart; -

2041 bandY1 = pCurBox->top(); -

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

pCurBox != pRegEnd	Description
TRUE	never evaluated
FALSE	never evaluated

pCurBox->top() == bandY1	Description
TRUE	never evaluated
FALSE	never evaluated

0

2043 ++pCurBox; -

}

never executed: end of block

0

2045 -

if (pCurBox != pRegEnd) {

pCurBox != pRegEnd	Description
TRUE	never evaluated
FALSE	never evaluated

0

2047 /* -

2048 * If more than one band was added, we have to find the start -

2049 * of the last band added so the next coalescing job can start -

2050 * at the right place... (given when multiple bands are added, -

2051 * this may be pointless -- see above). -

2052 */ -

2053 --pRegEnd; -

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

(pRegEnd - 1)-...pRegEnd->top()	Description
TRUE	never evaluated
FALSE	never evaluated

0

--pRegEnd;

never executed: --pRegEnd;

0

2056 curStart = pRegEnd - rData; -

2057 pRegEnd = rData + dest.numRects; -

}

never executed: end of block

0

2059 -

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

curNumRects == prevNumRects	Description
TRUE	never evaluated
FALSE	never evaluated

curNumRects != 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

2061 pCurBox -= curNumRects; -

2062 /* -

2063 * The bands may only be coalesced if the bottom of the previous -

2064 * matches the top scanline of the current. -

2065 */ -

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

pPrevBox->bott...Box->top() - 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

2067 /* -

2068 * Make sure the bands have boxes in the same places. This -

2069 * assumes that boxes have been added in such a way that they -

2070 * cover the most area possible. I.e. two boxes in a band must -

2071 * have some horizontal space between them. -

2072 */ -

2073 do { -

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

pPrevBox->left...CurBox->left()	Description
TRUE	never evaluated
FALSE	never evaluated

pPrevBox->righ...urBox->right()	Description
TRUE	never evaluated
FALSE	never evaluated

0

2075 // The bands don't line up so they can't be coalesced. -

return curStart;

never executed: return curStart;

0

2077 } -

2078 ++pPrevBox; -

2079 ++pCurBox; -

2080 --prevNumRects; -

} while (prevNumRects != 0);

never executed: end of block

prevNumRects != 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

2082 -

2083 dest.numRects -= curNumRects; -

2084 pCurBox -= curNumRects; -

2085 pPrevBox -= curNumRects; -

2086 -

2087 /* -

2088 * The bands may be merged, so set the bottom y of each box -

2089 * in the previous band to that of the corresponding box in -

2090 * the current band. -

2091 */ -

2092 do { -

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

2094 dest.updateInnerRect(*pPrevBox); -

2095 ++pPrevBox; -

2096 ++pCurBox; -

2097 curNumRects -= 1; -

} while (curNumRects != 0);

never executed: end of block

curNumRects != 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

2099 -

2100 /* -

2101 * If only one band was added to the region, we have to backup -

2102 * curStart to the start of the previous band. -

2103 * -

2104 * If more than one band was added to the region, copy the -

2105 * other bands down. The assumption here is that the other bands -

2106 * came from the same region as the current one and no further -

2107 * coalescing can be done on them since it's all been done -

2108 * already... curStart is already in the right place. -

2109 */ -

if (pCurBox == pRegEnd) {

pCurBox == pRegEnd	Description
TRUE	never evaluated
FALSE	never evaluated

0

2111 curStart = prevStart; -

} else {

never executed: end of block

0

2113 do { -

2114 *pPrevBox++ = *pCurBox++; -

2115 dest.updateInnerRect(*pPrevBox); -

} while (pCurBox != pRegEnd);

never executed: end of block

pCurBox != pRegEnd	Description
TRUE	never evaluated
FALSE	never evaluated

0

}

never executed: end of block

0

2118 } -

}

never executed: end of block

0

return curStart;

never executed: return curStart;

0

2121 } -

2122 -

2123 /*- -

2124 *----------------------------------------------------------------------- -

2125 * miRegionOp -- -

2126 * Apply an operation to two regions. Called by miUnion, miInverse, -

2127 * miSubtract, miIntersect... -

2128 * -

2129 * Results: -

2130 * None. -

2131 * -

2132 * Side Effects: -

2133 * The new region is overwritten. -

2134 * -

2135 * Notes: -

2136 * The idea behind this function is to view the two regions as sets. -

2137 * Together they cover a rectangle of area that this function divides -

2138 * into horizontal bands where points are covered only by one region -

2139 * or by both. For the first case, the nonOverlapFunc is called with -

2140 * each the band and the band's upper and lower extents. For the -

2141 * second, the overlapFunc is called to process the entire band. It -

2142 * is responsible for clipping the rectangles in the band, though -

2143 * this function provides the boundaries. -

2144 * At the end of each band, the new region is coalesced, if possible, -

2145 * to reduce the number of rectangles in the region. -

2146 * -

2147 *----------------------------------------------------------------------- -

2148 */ -

2149 static void miRegionOp(QRegionPrivate &dest, -

2150 const QRegionPrivate *reg1, const QRegionPrivate *reg2, -

2151 OverlapFunc overlapFunc, NonOverlapFunc nonOverlap1Func, -

2152 NonOverlapFunc nonOverlap2Func) -

2153 { -

2154 const QRect *r1; // Pointer into first region -

2155 const QRect *r2; // Pointer into 2d region -

2156 const QRect *r1End; // End of 1st region -

2157 const QRect *r2End; // End of 2d region -

2158 int ybot; // Bottom of intersection -

2159 int ytop; // Top of intersection -

2160 int prevBand; // Index of start of previous band in dest -

2161 int curBand; // Index of start of current band in dest -

2162 const QRect *r1BandEnd; // End of current band in r1 -

2163 const QRect *r2BandEnd; // End of current band in r2 -

2164 int top; // Top of non-overlapping band -

2165 int bot; // Bottom of non-overlapping band -

2166 -

2167 /* -

2168 * Initialization: -

2169 * set r1, r2, r1End and r2End appropriately, preserve the important -

2170 * parts of the destination region until the end in case it's one of -

2171 * the two source regions, then mark the "new" region empty, allocating -

2172 * another array of rectangles for it to use. -

2173 */ -

if (reg1->numRects == 1)

reg1->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

r1 = &reg1->extents;

never executed: r1 = &reg1->extents;

0

2176 else -

r1 = reg1->rects.constData();

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

0

if (reg2->numRects == 1)

reg2->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

r2 = &reg2->extents;

never executed: r2 = &reg2->extents;

0

2180 else -

r2 = reg2->rects.constData();

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

0

2182 -

2183 r1End = r1 + reg1->numRects; -

2184 r2End = r2 + reg2->numRects; -

2185 -

2186 dest.vectorize(); -

2187 -

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

2189 -

2190 dest.numRects = 0; -

2191 -

2192 /* -

2193 * Allocate a reasonable number of rectangles for the new region. The idea -

2194 * is to allocate enough so the individual functions don't need to -

2195 * reallocate and copy the array, which is time consuming, yet we don't -

2196 * have to worry about using too much memory. I hope to be able to -

2197 * nuke the realloc() at the end of this function eventually. -

2198 */ -

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

2200 -

2201 /* -

2202 * Initialize ybot and ytop. -

2203 * In the upcoming loop, ybot and ytop serve different functions depending -

2204 * on whether the band being handled is an overlapping or non-overlapping -

2205 * band. -

2206 * In the case of a non-overlapping band (only one of the regions -

2207 * has points in the band), ybot is the bottom of the most recent -

2208 * intersection and thus clips the top of the rectangles in that band. -

2209 * ytop is the top of the next intersection between the two regions and -

2210 * serves to clip the bottom of the rectangles in the current band. -

2211 * For an overlapping band (where the two regions intersect), ytop clips -

2212 * the top of the rectangles of both regions and ybot clips the bottoms. -

2213 */ -

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

reg1->extents....>extents.top()	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

0

2216 else -

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

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

0

2218 -

2219 /* -

2220 * prevBand serves to mark the start of the previous band so rectangles -

2221 * can be coalesced into larger rectangles. qv. miCoalesce, above. -

2222 * In the beginning, there is no previous band, so prevBand == curBand -

2223 * (curBand is set later on, of course, but the first band will always -

2224 * start at index 0). prevBand and curBand must be indices because of -

2225 * the possible expansion, and resultant moving, of the new region's -

2226 * array of rectangles. -

2227 */ -

2228 prevBand = 0; -

2229 -

2230 do { -

2231 curBand = dest.numRects; -

2232 -

2233 /* -

2234 * This algorithm proceeds one source-band (as opposed to a -

2235 * destination band, which is determined by where the two regions -

2236 * intersect) at a time. r1BandEnd and r2BandEnd serve to mark the -

2237 * rectangle after the last one in the current band for their -

2238 * respective regions. -

2239 */ -

2240 r1BandEnd = r1; -

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

r1BandEnd != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

r1BandEnd->top() == r1->top()	Description
TRUE	never evaluated
FALSE	never evaluated

0

++r1BandEnd;

never executed: ++r1BandEnd;

0

2243 -

2244 r2BandEnd = r2; -

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

r2BandEnd != r2End	Description
TRUE	never evaluated
FALSE	never evaluated

r2BandEnd->top() == r2->top()	Description
TRUE	never evaluated
FALSE	never evaluated

0

++r2BandEnd;

never executed: ++r2BandEnd;

0

2247 -

2248 /* -

2249 * First handle the band that doesn't intersect, if any. -

2250 * -

2251 * Note that attention is restricted to one band in the -

2252 * non-intersecting region at once, so if a region has n -

2253 * bands between the current position and the next place it overlaps -

2254 * the other, this entire loop will be passed through n times. -

2255 */ -

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

r1->top() < r2->top()	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

2259 -

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

nonOverlap1Func != 0	Description
TRUE	never evaluated
FALSE	never evaluated

bot >= top	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

0

2262 ytop = r2->top(); -

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

never executed: end of block

r2->top() < r1->top()	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

2266 -

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

nonOverlap2Func != 0	Description
TRUE	never evaluated
FALSE	never evaluated

bot >= top	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

0

2269 ytop = r1->top(); -

} else {

never executed: end of block

0

2271 ytop = r1->top(); -

}

never executed: end of block

0

2273 -

2274 /* -

2275 * If any rectangles got added to the region, try and coalesce them -

2276 * with rectangles from the previous band. Note we could just do -

2277 * this test in miCoalesce, but some machines incur a not -

2278 * inconsiderable cost for function calls, so... -

2279 */ -

if (dest.numRects != curBand)

dest.numRects != curBand	Description
TRUE	never evaluated
FALSE	never evaluated

0

prevBand = miCoalesce(dest, prevBand, curBand);

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

0

2282 -

2283 /* -

2284 * Now see if we've hit an intersecting band. The two bands only -

2285 * intersect if ybot >= ytop -

2286 */ -

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

2288 curBand = dest.numRects; -

if (ybot >= ytop)

ybot >= ytop	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

0

2291 -

if (dest.numRects != curBand)

dest.numRects != curBand	Description
TRUE	never evaluated
FALSE	never evaluated

0

prevBand = miCoalesce(dest, prevBand, curBand);

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

0

2294 -

2295 /* -

2296 * If we've finished with a band (y2 == ybot) we skip forward -

2297 * in the region to the next band. -

2298 */ -

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

r1->bottom() == ybot	Description
TRUE	never evaluated
FALSE	never evaluated

0

r1 = r1BandEnd;

never executed: r1 = r1BandEnd;

0

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

r2->bottom() == ybot	Description
TRUE	never evaluated
FALSE	never evaluated

0

r2 = r2BandEnd;

never executed: r2 = r2BandEnd;

0

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

never executed: end of block

r1 != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

r2 != r2End	Description
TRUE	never evaluated
FALSE	never evaluated

0

2304 -

2305 /* -

2306 * Deal with whichever region still has rectangles left. -

2307 */ -

2308 curBand = dest.numRects; -

if (r1 != r1End) {

r1 != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (nonOverlap1Func != 0) {

nonOverlap1Func != 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

2311 do { -

2312 r1BandEnd = r1; -

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

r1BandEnd < r1End	Description
TRUE	never evaluated
FALSE	never evaluated

r1BandEnd->top() == r1->top()	Description
TRUE	never evaluated
FALSE	never evaluated

0

++r1BandEnd;

never executed: ++r1BandEnd;

0

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

2316 r1 = r1BandEnd; -

} while (r1 != r1End);

never executed: end of block

r1 != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

0

}

never executed: end of block

0

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

never executed: end of block

(r2 != r2End)	Description
TRUE	never evaluated
FALSE	never evaluated

(nonOverlap2Func != 0)	Description
TRUE	never evaluated
FALSE	never evaluated

0

2320 do { -

2321 r2BandEnd = r2; -

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

r2BandEnd < r2End	Description
TRUE	never evaluated
FALSE	never evaluated

r2BandEnd->top() == r2->top()	Description
TRUE	never evaluated
FALSE	never evaluated

0

++r2BandEnd;

never executed: ++r2BandEnd;

0

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

2325 r2 = r2BandEnd; -

} while (r2 != r2End);

never executed: end of block

r2 != r2End	Description
TRUE	never evaluated
FALSE	never evaluated

0

}

never executed: end of block

0

2328 -

if (dest.numRects != curBand)

dest.numRects != curBand	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

0

2331 -

2332 /* -

2333 * A bit of cleanup. To keep regions from growing without bound, -

2334 * we shrink the array of rectangles to match the new number of -

2335 * rectangles in the region. -

2336 * -

2337 * Only do this stuff if the number of rectangles allocated is more than -

2338 * twice the number of rectangles in the region (a simple optimization). -

2339 */ -

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

qMax(4, dest.n...s.size() >> 1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

dest.rects.resize(dest.numRects);

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

0

}

never executed: end of block

0

2343 -

2344 /*====================================================================== -

2345 * Region Union -

2346 *====================================================================*/ -

2347 -

2348 /*- -

2349 *----------------------------------------------------------------------- -

2350 * miUnionNonO -- -

2351 * Handle a non-overlapping band for the union operation. Just -

2352 * Adds the rectangles into the region. Doesn't have to check for -

2353 * subsumption or anything. -

2354 * -

2355 * Results: -

2356 * None. -

2357 * -

2358 * Side Effects: -

2359 * dest.numRects is incremented and the final rectangles overwritten -

2360 * with the rectangles we're passed. -

2361 * -

2362 *----------------------------------------------------------------------- -

2363 */ -

2364 -

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

2366 int y1, int y2) -

2367 { -

2368 QRect *pNextRect; -

2369 -

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

2371 -

2372 Q_ASSERT(y1 <= y2); -

2373 -

while (r != rEnd) {

r != rEnd	Description
TRUE	never evaluated
FALSE	never evaluated

0

2375 Q_ASSERT(r->left() <= r->right()); -

MEMCHECK(dest, pNextRect, dest.rects)

never executed: end of block

(dest).numRect...ects.size()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

2378 dest.numRects++; -

2379 ++pNextRect; -

2380 ++r; -

}

never executed: end of block

0

}

never executed: end of block

0

2383 -

2384 -

2385 /*- -

2386 *----------------------------------------------------------------------- -

2387 * miUnionO -- -

2388 * Handle an overlapping band for the union operation. Picks the -

2389 * left-most rectangle each time and merges it into the region. -

2390 * -

2391 * Results: -

2392 * None. -

2393 * -

2394 * Side Effects: -

2395 * Rectangles are overwritten in dest.rects and dest.numRects will -

2396 * be changed. -

2397 * -

2398 *----------------------------------------------------------------------- -

2399 */ -

2400 -

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

2402 const QRect *r2, const QRect *r2End, int y1, int y2) -

2403 { -

2404 QRect *pNextRect; -

2405 -

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

2407 -

2408 #define MERGERECT(r) \ -

2409 if ((dest.numRects != 0) && \ -

2410 (pNextRect[-1].top() == y1) && \ -

2411 (pNextRect[-1].bottom() == y2) && \ -

2412 (pNextRect[-1].right() >= r->left()-1)) { \ -

2413 if (pNextRect[-1].right() < r->right()) { \ -

2414 pNextRect[-1].setRight(r->right()); \ -

2415 dest.updateInnerRect(pNextRect[-1]); \ -

2416 Q_ASSERT(pNextRect[-1].left() <= pNextRect[-1].right()); \ -

2417 } \ -

2418 } else { \ -

2419 MEMCHECK(dest, pNextRect, dest.rects) \ -

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

2421 dest.updateInnerRect(*pNextRect); \ -

2422 dest.numRects++; \ -

2423 pNextRect++; \ -

2424 } \ -

2425 r++; -

2426 -

2427 Q_ASSERT(y1 <= y2); -

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

r1 != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

r2 != r2End	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

r1->left() < r2->left()	Description
TRUE	never evaluated
FALSE	never evaluated

0

MERGERECT(r1)

never executed: end of block

never executed: end of block

never executed: end of block

never executed: end of block

pNextRect[-1].... < r1->right()	Description
TRUE	never evaluated
FALSE	never evaluated

(dest).numRect...ects.size()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

(dest.numRects != 0)	Description
TRUE	never evaluated
FALSE	never evaluated

(pNextRect[-1].top() == y1)	Description
TRUE	never evaluated
FALSE	never evaluated

(pNextRect[-1].bottom() == y2)	Description
TRUE	never evaluated
FALSE	never evaluated

(pNextRect[-1]... r1->left()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

} else {

never executed: end of block

0

MERGERECT(r2)

never executed: end of block

never executed: end of block

never executed: end of block

never executed: end of block

pNextRect[-1].... < r2->right()	Description
TRUE	never evaluated
FALSE	never evaluated

(dest).numRect...ects.size()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

(dest.numRects != 0)	Description
TRUE	never evaluated
FALSE	never evaluated

(pNextRect[-1].top() == y1)	Description
TRUE	never evaluated
FALSE	never evaluated

(pNextRect[-1].bottom() == y2)	Description
TRUE	never evaluated
FALSE	never evaluated

(pNextRect[-1]... r2->left()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

}

never executed: end of block

0

2434 } -

2435 -

if (r1 != r1End) {

r1 != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

0

2437 do { -

MERGERECT(r1)

never executed: end of block

never executed: end of block

never executed: end of block

never executed: end of block

pNextRect[-1].... < r1->right()	Description
TRUE	never evaluated
FALSE	never evaluated

(dest).numRect...ects.size()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

(dest.numRects != 0)	Description
TRUE	never evaluated
FALSE	never evaluated

(pNextRect[-1].top() == y1)	Description
TRUE	never evaluated
FALSE	never evaluated

(pNextRect[-1].bottom() == y2)	Description
TRUE	never evaluated
FALSE	never evaluated

(pNextRect[-1]... r1->left()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

} while (r1 != r1End);

never executed: end of block

r1 != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

0

} else {

never executed: end of block

0

while (r2 != r2End) {

r2 != r2End	Description
TRUE	never evaluated
FALSE	never evaluated

0

MERGERECT(r2)

never executed: end of block

never executed: end of block

never executed: end of block

never executed: end of block

pNextRect[-1].... < r2->right()	Description
TRUE	never evaluated
FALSE	never evaluated

(dest).numRect...ects.size()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

(dest.numRects != 0)	Description
TRUE	never evaluated
FALSE	never evaluated

(pNextRect[-1].top() == y1)	Description
TRUE	never evaluated
FALSE	never evaluated

(pNextRect[-1].bottom() == y2)	Description
TRUE	never evaluated
FALSE	never evaluated

(pNextRect[-1]... r2->left()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

}

never executed: end of block

0

}

never executed: end of block

0

2445 } -

2446 -

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

2448 { -

2449 Q_ASSERT(!isEmptyHelper(reg1) && !isEmptyHelper(reg2)); -

2450 Q_ASSERT(!reg1->contains(*reg2)); -

2451 Q_ASSERT(!reg2->contains(*reg1)); -

2452 Q_ASSERT(!EqualRegion(reg1, reg2)); -

2453 Q_ASSERT(!reg1->canAppend(reg2)); -

2454 Q_ASSERT(!reg2->canAppend(reg1)); -

2455 -

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

reg1->innerAre...eg2->innerArea	Description
TRUE	never evaluated
FALSE	never evaluated

0

2457 dest.innerArea = reg1->innerArea; -

2458 dest.innerRect = reg1->innerRect; -

} else {

never executed: end of block

0

2460 dest.innerArea = reg2->innerArea; -

2461 dest.innerRect = reg2->innerRect; -

}

never executed: end of block

0

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

2464 -

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

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

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

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

}

never executed: end of block

0

2470 -

2471 /*====================================================================== -

2472 * Region Subtraction -

2473 *====================================================================*/ -

2474 -

2475 /*- -

2476 *----------------------------------------------------------------------- -

2477 * miSubtractNonO -- -

2478 * Deal with non-overlapping band for subtraction. Any parts from -

2479 * region 2 we discard. Anything from region 1 we add to the region. -

2480 * -

2481 * Results: -

2482 * None. -

2483 * -

2484 * Side Effects: -

2485 * dest may be affected. -

2486 * -

2487 *----------------------------------------------------------------------- -

2488 */ -

2489 -

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

2491 const QRect *rEnd, int y1, int y2) -

2492 { -

2493 QRect *pNextRect; -

2494 -

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

2496 -

2497 Q_ASSERT(y1<=y2); -

2498 -

while (r != rEnd) {

r != rEnd	Description
TRUE	never evaluated
FALSE	never evaluated

0

2500 Q_ASSERT(r->left() <= r->right()); -

MEMCHECK(dest, pNextRect, dest.rects)

never executed: end of block

(dest).numRect...ects.size()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

2503 ++dest.numRects; -

2504 ++pNextRect; -

2505 ++r; -

}

never executed: end of block

0

}

never executed: end of block

0

2508 -

2509 /*- -

2510 *----------------------------------------------------------------------- -

2511 * miSubtractO -- -

2512 * Overlapping band subtraction. x1 is the left-most point not yet -

2513 * checked. -

2514 * -

2515 * Results: -

2516 * None. -

2517 * -

2518 * Side Effects: -

2519 * dest may have rectangles added to it. -

2520 * -

2521 *----------------------------------------------------------------------- -

2522 */ -

2523 -

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

2525 const QRect *r2, const QRect *r2End, int y1, int y2) -

2526 { -

2527 QRect *pNextRect; -

2528 int x1; -

2529 -

2530 x1 = r1->left(); -

2531 -

2532 Q_ASSERT(y1 <= y2); -

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

2534 -

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

r1 != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

r2 != r2End	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

r2->right() < x1	Description
TRUE	never evaluated
FALSE	never evaluated

0

2537 /* -

2538 * Subtrahend missed the boat: go to next subtrahend. -

2539 */ -

2540 ++r2; -

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

never executed: end of block

r2->left() <= x1	Description
TRUE	never evaluated
FALSE	never evaluated

0

2542 /* -

2543 * Subtrahend precedes minuend: nuke left edge of minuend. -

2544 */ -

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

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

x1 > r1->right()	Description
TRUE	never evaluated
FALSE	never evaluated

0

2547 /* -

2548 * Minuend completely covered: advance to next minuend and -

2549 * reset left fence to edge of new minuend. -

2550 */ -

2551 ++r1; -

if (r1 != r1End)

r1 != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

0

x1 = r1->left();

never executed: x1 = r1->left();

0

} else {

never executed: end of block

0

2555 // Subtrahend now used up since it doesn't extend beyond minuend -

2556 ++r2; -

}

never executed: end of block

0

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

r2->left() <= r1->right()	Description
TRUE	never evaluated
FALSE	never evaluated

0

2559 /* -

2560 * Left part of subtrahend covers part of minuend: add uncovered -

2561 * part of minuend to region and skip to next subtrahend. -

2562 */ -

2563 Q_ASSERT(x1 < r2->left()); -

MEMCHECK(dest, pNextRect, dest.rects)

never executed: end of block

(dest).numRect...ects.size()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

2566 ++dest.numRects; -

2567 ++pNextRect; -

2568 -

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

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

x1 > r1->right()	Description
TRUE	never evaluated
FALSE	never evaluated

0

2571 /* -

2572 * Minuend used up: advance to new... -

2573 */ -

2574 ++r1; -

if (r1 != r1End)

r1 != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

0

x1 = r1->left();

never executed: x1 = r1->left();

0

} else {

never executed: end of block

0

2578 // Subtrahend used up -

2579 ++r2; -

}

never executed: end of block

0

2581 } else { -

2582 /* -

2583 * Minuend used up: add any remaining piece before advancing. -

2584 */ -

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

r1->right() >= x1	Description
TRUE	never evaluated
FALSE	never evaluated

0

MEMCHECK(dest, pNextRect, dest.rects)

never executed: end of block

(dest).numRect...ects.size()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

2588 ++dest.numRects; -

2589 ++pNextRect; -

}

never executed: end of block

0

2591 ++r1; -

if (r1 != r1End)

r1 != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

0

x1 = r1->left();

never executed: x1 = r1->left();

0

}

never executed: end of block

0

2595 } -

2596 -

2597 /* -

2598 * Add remaining minuend rectangles to region. -

2599 */ -

while (r1 != r1End) {

r1 != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

0

2601 Q_ASSERT(x1 <= r1->right()); -

MEMCHECK(dest, pNextRect, dest.rects)

never executed: end of block

(dest).numRect...ects.size()-1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

2604 ++dest.numRects; -

2605 ++pNextRect; -

2606 -

2607 ++r1; -

if (r1 != r1End)

r1 != r1End	Description
TRUE	never evaluated
FALSE	never evaluated

0

x1 = r1->left();

never executed: x1 = r1->left();

0

}

never executed: end of block

0

}

never executed: end of block

0

2612 -

2613 /*- -

2614 *----------------------------------------------------------------------- -

2615 * miSubtract -- -

2616 * Subtract regS from regM and leave the result in regD. -

2617 * S stands for subtrahend, M for minuend and D for difference. -

2618 * -

2619 * Side Effects: -

2620 * regD is overwritten. -

2621 * -

2622 *----------------------------------------------------------------------- -

2623 */ -

2624 -

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

2626 QRegionPrivate &dest) -

2627 { -

2628 Q_ASSERT(!isEmptyHelper(regM)); -

2629 Q_ASSERT(!isEmptyHelper(regS)); -

2630 Q_ASSERT(EXTENTCHECK(&regM->extents, &regS->extents)); -

2631 Q_ASSERT(!regS->contains(*regM)); -

2632 Q_ASSERT(!EqualRegion(regM, regS)); -

2633 -

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

2635 -

2636 /* -

2637 * Can't alter dest's extents before we call miRegionOp because -

2638 * it might be one of the source regions and miRegionOp depends -

2639 * on the extents of those regions being the unaltered. Besides, this -

2640 * way there's no checking against rectangles that will be nuked -

2641 * due to coalescing, so we have to examine fewer rectangles. -

2642 */ -

2643 miSetExtents(dest); -

}

never executed: end of block

0

2645 -

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

2647 { -

2648 Q_ASSERT(!isEmptyHelper(sra) && !isEmptyHelper(srb)); -

2649 Q_ASSERT(EXTENTCHECK(&sra->extents, &srb->extents)); -

2650 Q_ASSERT(!EqualRegion(sra, srb)); -

2651 -

2652 QRegionPrivate tra, trb; -

2653 -

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

!srb->contains(*sra)	Description
TRUE	never evaluated
FALSE	never evaluated

0

SubtractRegion(sra, srb, tra);

never executed: SubtractRegion(sra, srb, tra);

0

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

!sra->contains(*srb)	Description
TRUE	never evaluated
FALSE	never evaluated

0

SubtractRegion(srb, sra, trb);

never executed: SubtractRegion(srb, sra, trb);

0

2658 -

2659 Q_ASSERT(isEmptyHelper(&trb) || !tra.contains(trb)); -

2660 Q_ASSERT(isEmptyHelper(&tra) || !trb.contains(tra)); -

2661 -

if (isEmptyHelper(&tra)) {

isEmptyHelper(&tra)	Description
TRUE	never evaluated
FALSE	never evaluated

0

2663 dest = trb; -

} else if (isEmptyHelper(&trb)) {

never executed: end of block

isEmptyHelper(&trb)	Description
TRUE	never evaluated
FALSE	never evaluated

0

2665 dest = tra; -

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

never executed: end of block

tra.canAppend(&trb)	Description
TRUE	never evaluated
FALSE	never evaluated

0

2667 dest = tra; -

2668 dest.append(&trb); -

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

never executed: end of block

trb.canAppend(&tra)	Description
TRUE	never evaluated
FALSE	never evaluated

0

2670 dest = trb; -

2671 dest.append(&tra); -

} else {

never executed: end of block

0

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

}

never executed: end of block

0

2675 } -

2676 -

2677 /* -

2678 * Check to see if two regions are equal -

2679 */ -

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

2681 { -

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

r1->numRects != r2->numRects	Description
TRUE	never evaluated
FALSE	never evaluated

0

return false;

never executed: return false;

0

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

r1->numRects == 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

return true;

never executed: return true;

0

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

r1->extents != r2->extents	Description
TRUE	never evaluated
FALSE	never evaluated

0

return false;

never executed: return false;

0

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

r1->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

r2->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

return true; // equality tested in previous if-statement

never executed: return true;

0

2690 } else { -

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

(r1->numRects == 1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

(r2->numRects == 1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

i < r1->numRects	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (*rr1 != *rr2)

rr1 != rr2	Description
TRUE	never evaluated
FALSE	never evaluated

0

return false;

never executed: return false;

0

}

never executed: end of block

0

}

never executed: end of block

0

2698 -

return true;

never executed: return true;

0

2700 } -

2701 -

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

2703 { -

2704 int i; -

2705 -

if (isEmptyHelper(pRegion))

isEmptyHelper(pRegion)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return false;

never executed: return false;

0

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

!pRegion->exte...contains(x, y)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return false;

never executed: return false;

0

if (pRegion->numRects == 1)

pRegion->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

0

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

pRegion->inner...contains(x, y)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return true;

never executed: return true;

0

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

i < pRegion->numRects	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

pRegion->rects...contains(x, y)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return true;

never executed: return true;

0

}

never executed: end of block

0

return false;

never executed: return false;

0

2719 } -

2720 -

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

2722 { -

2723 const QRect *pbox; -

2724 const QRect *pboxEnd; -

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

2726 QRect *prect = &rect; -

2727 int partIn, partOut; -

2728 -

if (!region || region->numRects == 0 || !EXTENTCHECK(&region->extents, prect))

!region	Description
TRUE	never evaluated
FALSE	never evaluated

region->numRects == 0	Description
TRUE	never evaluated
FALSE	never evaluated

(&region->exte...prect)->left()	Description
TRUE	never evaluated
FALSE	never evaluated

(&region->exte...rect)->right()	Description
TRUE	never evaluated
FALSE	never evaluated

(&region->exte...(prect)->top()	Description
TRUE	never evaluated
FALSE	never evaluated

(&region->exte...ect)->bottom()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return RectangleOut;

never executed: return 0;

0

2731 -

2732 partOut = false; -

2733 partIn = false; -

2734 -

2735 /* can stop when both partOut and partIn are true, or we reach prect->y2 */ -

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

(region->numRects == 1)	Description
TRUE	never evaluated
FALSE	never evaluated

0

2737 pboxEnd = pbox + region->numRects; -

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

pbox < pboxEnd	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (pbox->bottom() < ry)

pbox->bottom() < ry	Description
TRUE	never evaluated
FALSE	never evaluated

0

continue;

never executed: continue;

0

2741 -

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

pbox->top() > ry	Description
TRUE	never evaluated
FALSE	never evaluated

0

2743 partOut = true; -

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

partIn	Description
TRUE	never evaluated
FALSE	never evaluated

pbox->top() > prect->bottom()	Description
TRUE	never evaluated
FALSE	never evaluated

0

break;

never executed: break;

0

2746 ry = pbox->top(); -

}

never executed: end of block

0

2748 -

if (pbox->right() < rx)

pbox->right() < rx	Description
TRUE	never evaluated
FALSE	never evaluated

0

continue; /* not far enough over yet */

never executed: continue;

0

2751 -

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

pbox->left() > rx	Description
TRUE	never evaluated
FALSE	never evaluated

0

2753 partOut = true; /* missed part of rectangle to left */ -

if (partIn)

partIn	Description
TRUE	never evaluated
FALSE	never evaluated

0

break;

never executed: break;

0

}

never executed: end of block

0

2757 -

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

pbox->left() <= prect->right()	Description
TRUE	never evaluated
FALSE	never evaluated

0

2759 partIn = true; /* definitely overlap */ -

if (partOut)

partOut	Description
TRUE	never evaluated
FALSE	never evaluated

0

break;

never executed: break;

0

}

never executed: end of block

0

2763 -

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

pbox->right() ...prect->right()	Description
TRUE	never evaluated
FALSE	never evaluated

0

2765 ry = pbox->bottom() + 1; /* finished with this band */ -

if (ry > prect->bottom())

ry > prect->bottom()	Description
TRUE	never evaluated
FALSE	never evaluated

0

break;

never executed: break;

0

2768 rx = prect->left(); /* reset x out to left again */ -

} else {

never executed: end of block

0

2770 /* -

2771 * Because boxes in a band are maximal width, if the first box -

2772 * to overlap the rectangle doesn't completely cover it in that -

2773 * band, the rectangle must be partially out, since some of it -

2774 * will be uncovered in that band. partIn will have been set true -

2775 * by now... -

2776 */ -

break;

never executed: break;

0

2778 } -

2779 } -

return partIn ? ((ry <= prect->bottom()) ? RectanglePart : RectangleIn) : RectangleOut;

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

0

2781 } -

2782 // END OF Region.c extract -

2783 // START OF poly.h extract -

2784 /* $XConsortium: poly.h,v 1.4 94/04/17 20:22:19 rws Exp $ */ -

2785 /************************************************************************ -

2786 -

2787 Copyright (c) 1987 X Consortium -

2788 -

2789 Permission is hereby granted, free of charge, to any person obtaining a copy -

2790 of this software and associated documentation files (the "Software"), to deal -

2791 in the Software without restriction, including without limitation the rights -

2792 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -

2793 copies of the Software, and to permit persons to whom the Software is -

2794 furnished to do so, subject to the following conditions: -

2795 -

2796 The above copyright notice and this permission notice shall be included in -

2797 all copies or substantial portions of the Software. -

2798 -

2799 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -

2800 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -

2801 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -

2802 X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN -

2803 AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN -

2804 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. -

2805 -

2806 Except as contained in this notice, the name of the X Consortium shall not be -

2807 used in advertising or otherwise to promote the sale, use or other dealings -

2808 in this Software without prior written authorization from the X Consortium. -

2809 -

2810 -

2811 Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts. -

2812 -

2813 All Rights Reserved -

2814 -

2815 Permission to use, copy, modify, and distribute this software and its -

2816 documentation for any purpose and without fee is hereby granted, -

2817 provided that the above copyright notice appear in all copies and that -

2818 both that copyright notice and this permission notice appear in -

2819 supporting documentation, and that the name of Digital not be -

2820 used in advertising or publicity pertaining to distribution of the -

2821 software without specific, written prior permission. -

2822 -

2823 DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING -

2824 ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL -

2825 DIGITAL BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR -

2826 ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, -

2827 WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, -

2828 ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS -

2829 SOFTWARE. -

2830 -

2831 ************************************************************************/ -

2832 -

2833 /* -

2834 * This file contains a few macros to help track -

2835 * the edge of a filled object. The object is assumed -

2836 * to be filled in scanline order, and thus the -

2837 * algorithm used is an extension of Bresenham's line -

2838 * drawing algorithm which assumes that y is always the -

2839 * major axis. -

2840 * Since these pieces of code are the same for any filled shape, -

2841 * it is more convenient to gather the library in one -

2842 * place, but since these pieces of code are also in -

2843 * the inner loops of output primitives, procedure call -

2844 * overhead is out of the question. -

2845 * See the author for a derivation if needed. -

2846 */ -

2847 -

2848 -

2849 /* -

2850 * In scan converting polygons, we want to choose those pixels -

2851 * which are inside the polygon. Thus, we add .5 to the starting -

2852 * x coordinate for both left and right edges. Now we choose the -

2853 * first pixel which is inside the pgon for the left edge and the -

2854 * first pixel which is outside the pgon for the right edge. -

2855 * Draw the left pixel, but not the right. -

2856 * -

2857 * How to add .5 to the starting x coordinate: -

2858 * If the edge is moving to the right, then subtract dy from the -

2859 * error term from the general form of the algorithm. -

2860 * If the edge is moving to the left, then add dy to the error term. -

2861 * -

2862 * The reason for the difference between edges moving to the left -

2863 * and edges moving to the right is simple: If an edge is moving -

2864 * to the right, then we want the algorithm to flip immediately. -

2865 * If it is moving to the left, then we don't want it to flip until -

2866 * we traverse an entire pixel. -

2867 */ -

2868 #define BRESINITPGON(dy, x1, x2, xStart, d, m, m1, incr1, incr2) { \ -

2869 int dx; /* local storage */ \ -

2870 \ -

2871 /* \ -

2872 * if the edge is horizontal, then it is ignored \ -

2873 * and assumed not to be processed. Otherwise, do this stuff. \ -

2874 */ \ -

2875 if ((dy) != 0) { \ -

2876 xStart = (x1); \ -

2877 dx = (x2) - xStart; \ -

2878 if (dx < 0) { \ -

2879 m = dx / (dy); \ -

2880 m1 = m - 1; \ -

2881 incr1 = -2 * dx + 2 * (dy) * m1; \ -

2882 incr2 = -2 * dx + 2 * (dy) * m; \ -

2883 d = 2 * m * (dy) - 2 * dx - 2 * (dy); \ -

2884 } else { \ -

2885 m = dx / (dy); \ -

2886 m1 = m + 1; \ -

2887 incr1 = 2 * dx - 2 * (dy) * m1; \ -

2888 incr2 = 2 * dx - 2 * (dy) * m; \ -

2889 d = -2 * m * (dy) + 2 * dx; \ -

2890 } \ -

2891 } \ -

2892 } -

2893 -

2894 #define BRESINCRPGON(d, minval, m, m1, incr1, incr2) { \ -

2895 if (m1 > 0) { \ -

2896 if (d > 0) { \ -

2897 minval += m1; \ -

2898 d += incr1; \ -

2899 } \ -

2900 else { \ -

2901 minval += m; \ -

2902 d += incr2; \ -

2903 } \ -

2904 } else {\ -

2905 if (d >= 0) { \ -

2906 minval += m1; \ -

2907 d += incr1; \ -

2908 } \ -

2909 else { \ -

2910 minval += m; \ -

2911 d += incr2; \ -

2912 } \ -

2913 } \ -

2914 } -

2915 -

2916 -

2917 /* -

2918 * This structure contains all of the information needed -

2919 * to run the bresenham algorithm. -

2920 * The variables may be hardcoded into the declarations -

2921 * instead of using this structure to make use of -

2922 * register declarations. -

2923 */ -

2924 typedef struct { -

2925 int minor_axis; /* minor axis */ -

2926 int d; /* decision variable */ -

2927 int m, m1; /* slope and slope+1 */ -

2928 int incr1, incr2; /* error increments */ -

2929 } BRESINFO; -

2930 -

2931 -

2932 #define BRESINITPGONSTRUCT(dmaj, min1, min2, bres) \ -

2933 BRESINITPGON(dmaj, min1, min2, bres.minor_axis, bres.d, \ -

2934 bres.m, bres.m1, bres.incr1, bres.incr2) -

2935 -

2936 #define BRESINCRPGONSTRUCT(bres) \ -

2937 BRESINCRPGON(bres.d, bres.minor_axis, bres.m, bres.m1, bres.incr1, bres.incr2) -

2938 -

2939 -

2940 -

2941 /* -

2942 * These are the data structures needed to scan -

2943 * convert regions. Two different scan conversion -

2944 * methods are available -- the even-odd method, and -

2945 * the winding number method. -

2946 * The even-odd rule states that a point is inside -

2947 * the polygon if a ray drawn from that point in any -

2948 * direction will pass through an odd number of -

2949 * path segments. -

2950 * By the winding number rule, a point is decided -

2951 * to be inside the polygon if a ray drawn from that -

2952 * point in any direction passes through a different -

2953 * number of clockwise and counter-clockwise path -

2954 * segments. -

2955 * -

2956 * These data structures are adapted somewhat from -

2957 * the algorithm in (Foley/Van Dam) for scan converting -

2958 * polygons. -

2959 * The basic algorithm is to start at the top (smallest y) -

2960 * of the polygon, stepping down to the bottom of -

2961 * the polygon by incrementing the y coordinate. We -

2962 * keep a list of edges which the current scanline crosses, -

2963 * sorted by x. This list is called the Active Edge Table (AET) -

2964 * As we change the y-coordinate, we update each entry in -

2965 * in the active edge table to reflect the edges new xcoord. -

2966 * This list must be sorted at each scanline in case -

2967 * two edges intersect. -

2968 * We also keep a data structure known as the Edge Table (ET), -

2969 * which keeps track of all the edges which the current -

2970 * scanline has not yet reached. The ET is basically a -

2971 * list of ScanLineList structures containing a list of -

2972 * edges which are entered at a given scanline. There is one -

2973 * ScanLineList per scanline at which an edge is entered. -

2974 * When we enter a new edge, we move it from the ET to the AET. -

2975 * -

2976 * From the AET, we can implement the even-odd rule as in -

2977 * (Foley/Van Dam). -

2978 * The winding number rule is a little trickier. We also -

2979 * keep the EdgeTableEntries in the AET linked by the -

2980 * nextWETE (winding EdgeTableEntry) link. This allows -

2981 * the edges to be linked just as before for updating -

2982 * purposes, but only uses the edges linked by the nextWETE -

2983 * link as edges representing spans of the polygon to -

2984 * drawn (as with the even-odd rule). -

2985 */ -

2986 -

2987 /* -

2988 * for the winding number rule -

2989 */ -

2990 #define CLOCKWISE 1 -

2991 #define COUNTERCLOCKWISE -1 -

2992 -

2993 typedef struct _EdgeTableEntry { -

2994 int ymax; /* ycoord at which we exit this edge. */ -

2995 int ClockWise; /* flag for winding number rule */ -

2996 BRESINFO bres; /* Bresenham info to run the edge */ -

2997 struct _EdgeTableEntry *next; /* next in the list */ -

2998 struct _EdgeTableEntry *back; /* for insertion sort */ -

2999 struct _EdgeTableEntry *nextWETE; /* for winding num rule */ -

3000 } EdgeTableEntry; -

3001 -

3002 -

3003 typedef struct _ScanLineList{ -

3004 int scanline; /* the scanline represented */ -

3005 EdgeTableEntry *edgelist; /* header node */ -

3006 struct _ScanLineList *next; /* next in the list */ -

3007 } ScanLineList; -

3008 -

3009 -

3010 typedef struct { -

3011 int ymax; /* ymax for the polygon */ -

3012 int ymin; /* ymin for the polygon */ -

3013 ScanLineList scanlines; /* header node */ -

3014 } EdgeTable; -

3015 -

3016 -

3017 /* -

3018 * Here is a struct to help with storage allocation -

3019 * so we can allocate a big chunk at a time, and then take -

3020 * pieces from this heap when we need to. -

3021 */ -

3022 #define SLLSPERBLOCK 25 -

3023 -

3024 typedef struct _ScanLineListBlock { -

3025 ScanLineList SLLs[SLLSPERBLOCK]; -

3026 struct _ScanLineListBlock *next; -

3027 } ScanLineListBlock; -

3028 -

3029 -

3030 -

3031 /* -

3032 * -

3033 * a few macros for the inner loops of the fill code where -

3034 * performance considerations don't allow a procedure call. -

3035 * -

3036 * Evaluate the given edge at the given scanline. -

3037 * If the edge has expired, then we leave it and fix up -

3038 * the active edge table; otherwise, we increment the -

3039 * x value to be ready for the next scanline. -

3040 * The winding number rule is in effect, so we must notify -

3041 * the caller when the edge has been removed so he -

3042 * can reorder the Winding Active Edge Table. -

3043 */ -

3044 #define EVALUATEEDGEWINDING(pAET, pPrevAET, y, fixWAET) { \ -

3045 if (pAET->ymax == y) { /* leaving this edge */ \ -

3046 pPrevAET->next = pAET->next; \ -

3047 pAET = pPrevAET->next; \ -

3048 fixWAET = 1; \ -

3049 if (pAET) \ -

3050 pAET->back = pPrevAET; \ -

3051 } \ -

3052 else { \ -

3053 BRESINCRPGONSTRUCT(pAET->bres) \ -

3054 pPrevAET = pAET; \ -

3055 pAET = pAET->next; \ -

3056 } \ -

3057 } -

3058 -

3059 -

3060 /* -

3061 * Evaluate the given edge at the given scanline. -

3062 * If the edge has expired, then we leave it and fix up -

3063 * the active edge table; otherwise, we increment the -

3064 * x value to be ready for the next scanline. -

3065 * The even-odd rule is in effect. -

3066 */ -

3067 #define EVALUATEEDGEEVENODD(pAET, pPrevAET, y) { \ -

3068 if (pAET->ymax == y) { /* leaving this edge */ \ -

3069 pPrevAET->next = pAET->next; \ -

3070 pAET = pPrevAET->next; \ -

3071 if (pAET) \ -

3072 pAET->back = pPrevAET; \ -

3073 } \ -

3074 else { \ -

3075 BRESINCRPGONSTRUCT(pAET->bres) \ -

3076 pPrevAET = pAET; \ -

3077 pAET = pAET->next; \ -

3078 } \ -

3079 } -

3080 // END OF poly.h extract -

3081 // START OF PolyReg.c extract -

3082 /* $XConsortium: PolyReg.c,v 11.23 94/11/17 21:59:37 converse Exp $ */ -

3083 /************************************************************************ -

3084 -

3085 Copyright (c) 1987 X Consortium -

3086 -

3087 Permission is hereby granted, free of charge, to any person obtaining a copy -

3088 of this software and associated documentation files (the "Software"), to deal -

3089 in the Software without restriction, including without limitation the rights -

3090 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -

3091 copies of the Software, and to permit persons to whom the Software is -

3092 furnished to do so, subject to the following conditions: -

3093 -

3094 The above copyright notice and this permission notice shall be included in -

3095 all copies or substantial portions of the Software. -

3096 -

3097 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -

3098 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -

3099 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -

3100 X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN -

3101 AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN -

3102 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. -

3103 -

3104 Except as contained in this notice, the name of the X Consortium shall not be -

3105 used in advertising or otherwise to promote the sale, use or other dealings -

3106 in this Software without prior written authorization from the X Consortium. -

3107 -

3108 -

3109 Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts. -

3110 -

3111 All Rights Reserved -

3112 -

3113 Permission to use, copy, modify, and distribute this software and its -

3114 documentation for any purpose and without fee is hereby granted, -

3115 provided that the above copyright notice appear in all copies and that -

3116 both that copyright notice and this permission notice appear in -

3117 supporting documentation, and that the name of Digital not be -

3118 used in advertising or publicity pertaining to distribution of the -

3119 software without specific, written prior permission. -

3120 -

3121 DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING -

3122 ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL -

3123 DIGITAL BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR -

3124 ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, -

3125 WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, -

3126 ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS -

3127 SOFTWARE. -

3128 -

3129 ************************************************************************/ -

3130 /* $XFree86: xc/lib/X11/PolyReg.c,v 1.1.1.2.8.2 1998/10/04 15:22:49 hohndel Exp $ */ -

3131 -

3132 #define LARGE_COORDINATE INT_MAX -

3133 #define SMALL_COORDINATE INT_MIN -

3134 -

3135 /* -

3136 * InsertEdgeInET -

3137 * -

3138 * Insert the given edge into the edge table. -

3139 * First we must find the correct bucket in the -

3140 * Edge table, then find the right slot in the -

3141 * bucket. Finally, we can insert it. -

3142 * -

3143 */ -

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

3145 ScanLineListBlock **SLLBlock, int *iSLLBlock) -

3146 { -

3147 EdgeTableEntry *start, *prev; -

3148 ScanLineList *pSLL, *pPrevSLL; -

3149 ScanLineListBlock *tmpSLLBlock; -

3150 -

3151 /* -

3152 * find the right bucket to put the edge into -

3153 */ -

3154 pPrevSLL = &ET->scanlines; -

3155 pSLL = pPrevSLL->next; -

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

pSLL	Description
TRUE	never evaluated
FALSE	never evaluated

(pSLL->scanline < scanline)	Description
TRUE	never evaluated
FALSE	never evaluated

0

3157 pPrevSLL = pSLL; -

3158 pSLL = pSLL->next; -

}

never executed: end of block

0

3160 -

3161 /* -

3162 * reassign pSLL (pointer to ScanLineList) if necessary -

3163 */ -

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

(!pSLL)	Description
TRUE	never evaluated
FALSE	never evaluated

(pSLL->scanline > scanline)	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (*iSLLBlock > SLLSPERBLOCK-1)

*iSLLBlock > 25 -1	Description
TRUE	never evaluated
FALSE	never evaluated

0

3166 { -

3167 tmpSLLBlock = -

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

Q_CHECK_PTR(tmpSLLBlock);

never executed: qt_check_pointer(__FILE__,3169);

!(tmpSLLBlock)	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

3171 tmpSLLBlock->next = (ScanLineListBlock *)NULL; -

3172 *SLLBlock = tmpSLLBlock; -

3173 *iSLLBlock = 0; -

}

never executed: end of block

0

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

3176 -

3177 pSLL->next = pPrevSLL->next; -

3178 pSLL->edgelist = (EdgeTableEntry *)NULL; -

3179 pPrevSLL->next = pSLL; -

}

never executed: end of block

0

3181 pSLL->scanline = scanline; -

3182 -

3183 /* -

3184 * now insert the edge in the right bucket -

3185 */ -

3186 prev = 0; -

3187 start = pSLL->edgelist; -

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

start	Description
TRUE	never evaluated
FALSE	never evaluated

(start->bres.m...es.minor_axis)	Description
TRUE	never evaluated
FALSE	never evaluated

0

3189 prev = start; -

3190 start = start->next; -

}

never executed: end of block

0

3192 ETE->next = start; -

3193 -

if (prev)

prev	Description
TRUE	never evaluated
FALSE	never evaluated

0

prev->next = ETE;

never executed: prev->next = ETE;

0

3196 else -

pSLL->edgelist = ETE;

never executed: pSLL->edgelist = ETE;

0

3198 } -

3199 -

3200 /* -

3201 * CreateEdgeTable -

3202 * -

3203 * This routine creates the edge table for -

3204 * scan converting polygons. -

3205 * The Edge Table (ET) looks like: -

3206 * -

3207 * EdgeTable -

3208 * -------- -

3209 * | ymax | ScanLineLists -

3210 * |scanline|-->------------>-------------->... -

3211 * -------- |scanline| |scanline| -

3212 * |edgelist| |edgelist| -

3213 * --------- --------- -

3214 * | | -

3215 * | | -

3216 * V V -

3217 * list of ETEs list of ETEs -

3218 * -

3219 * where ETE is an EdgeTableEntry data structure, -

3220 * and there is one ScanLineList per scanline at -

3221 * which an edge is initially entered. -

3222 * -

3223 */ -

3224 -

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

3226 EdgeTable *ET, EdgeTableEntry *AET, EdgeTableEntry *pETEs, -

3227 ScanLineListBlock *pSLLBlock) -

3228 { -

3229 const QPoint *top, -

3230 *bottom, -

3231 *PrevPt, -

3232 *CurrPt; -

3233 int iSLLBlock = 0; -

3234 int dy; -

3235 -

if (count < 2)

count < 2	Description
TRUE	never evaluated
FALSE	never evaluated

0

return;

never executed: return;

0

3238 -

3239 /* -

3240 * initialize the Active Edge Table -

3241 */ -

3242 AET->next = 0; -

3243 AET->back = 0; -

3244 AET->nextWETE = 0; -

3245 AET->bres.minor_axis = SMALL_COORDINATE; -

3246 -

3247 /* -

3248 * initialize the Edge Table. -

3249 */ -

3250 ET->scanlines.next = 0; -

3251 ET->ymax = SMALL_COORDINATE; -

3252 ET->ymin = LARGE_COORDINATE; -

3253 pSLLBlock->next = 0; -

3254 -

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

3256 -

3257 /* -

3258 * for each vertex in the array of points. -

3259 * In this loop we are dealing with two vertices at -

3260 * a time -- these make up one edge of the polygon. -

3261 */ -

while (count--) {

count--	Description
TRUE	never evaluated
FALSE	never evaluated

0

3263 CurrPt = pts++; -

3264 -

3265 /* -

3266 * find out which point is above and which is below. -

3267 */ -

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

PrevPt->y() > CurrPt->y()	Description
TRUE	never evaluated
FALSE	never evaluated

0

3269 bottom = PrevPt; -

3270 top = CurrPt; -

3271 pETEs->ClockWise = 0; -

} else {

never executed: end of block

0

3273 bottom = CurrPt; -

3274 top = PrevPt; -

3275 pETEs->ClockWise = 1; -

}

never executed: end of block

0

3277 -

3278 /* -

3279 * don't add horizontal edges to the Edge table. -

3280 */ -

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

bottom->y() != top->y()	Description
TRUE	never evaluated
FALSE	never evaluated

0

3282 pETEs->ymax = bottom->y() - 1; /* -1 so we don't get last scanline */ -

3283 -

3284 /* -

3285 * initialize integer edge algorithm -

3286 */ -

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

BRESINITPGONSTRUCT(dy, top->x(), bottom->x(), pETEs->bres)

never executed: end of block

never executed: end of block

(dy) != 0	Description
TRUE	never evaluated
FALSE	never evaluated

dx < 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

3289 -

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

3291 -

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

PrevPt->y() > ET->ymax	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

0

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

PrevPt->y() < ET->ymin	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

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

0

3296 ++pETEs; -

}

never executed: end of block

0

3298 -

3299 PrevPt = CurrPt; -

}

never executed: end of block

0

}

never executed: end of block

0

3302 -

3303 /* -

3304 * loadAET -

3305 * -

3306 * This routine moves EdgeTableEntries from the -

3307 * EdgeTable into the Active Edge Table, -

3308 * leaving them sorted by smaller x coordinate. -

3309 * -

3310 */ -

3311 -

3312 static void loadAET(EdgeTableEntry *AET, EdgeTableEntry *ETEs) -

3313 { -

3314 EdgeTableEntry *pPrevAET; -

3315 EdgeTableEntry *tmp; -

3316 -

3317 pPrevAET = AET; -

3318 AET = AET->next; -

while (ETEs) {

ETEs	Description
TRUE	never evaluated
FALSE	never evaluated

0

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

AET	Description
TRUE	never evaluated
FALSE	never evaluated

AET->bres.mino...res.minor_axis	Description
TRUE	never evaluated
FALSE	never evaluated

0

3321 pPrevAET = AET; -

3322 AET = AET->next; -

}

never executed: end of block

0

3324 tmp = ETEs->next; -

3325 ETEs->next = AET; -

if (AET)

AET	Description
TRUE	never evaluated
FALSE	never evaluated

0

AET->back = ETEs;

never executed: AET->back = ETEs;

0

3328 ETEs->back = pPrevAET; -

3329 pPrevAET->next = ETEs; -

3330 pPrevAET = ETEs; -

3331 -

3332 ETEs = tmp; -

}

never executed: end of block

0

}

never executed: end of block

0

3335 -

3336 /* -

3337 * computeWAET -

3338 * -

3339 * This routine links the AET by the -

3340 * nextWETE (winding EdgeTableEntry) link for -

3341 * use by the winding number rule. The final -

3342 * Active Edge Table (AET) might look something -

3343 * like: -

3344 * -

3345 * AET -

3346 * ---------- --------- --------- -

3347 * |ymax | |ymax | |ymax | -

3348 * | ... | |... | |... | -

3349 * |next |->|next |->|next |->... -

3350 * |nextWETE| |nextWETE| |nextWETE| -

3351 * --------- --------- ^-------- -

3352 * | | | -

3353 * V-------------------> V---> ... -

3354 * -

3355 */ -

3356 static void computeWAET(EdgeTableEntry *AET) -

3357 { -

3358 EdgeTableEntry *pWETE; -

3359 int inside = 1; -

3360 int isInside = 0; -

3361 -

3362 AET->nextWETE = 0; -

3363 pWETE = AET; -

3364 AET = AET->next; -

while (AET) {

AET	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (AET->ClockWise)

AET->ClockWise	Description
TRUE	never evaluated
FALSE	never evaluated

0

++isInside;

never executed: ++isInside;

0

3368 else -

--isInside;

never executed: --isInside;

0

3370 -

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

!inside	Description
TRUE	never evaluated
FALSE	never evaluated

!isInside	Description
TRUE	never evaluated
FALSE	never evaluated

inside	Description
TRUE	never evaluated
FALSE	never evaluated

isInside	Description
TRUE	never evaluated
FALSE	never evaluated

0

3372 pWETE->nextWETE = AET; -

3373 pWETE = AET; -

3374 inside = !inside; -

}

never executed: end of block

0

3376 AET = AET->next; -

}

never executed: end of block

0

3378 pWETE->nextWETE = 0; -

}

never executed: end of block

0

3380 -

3381 /* -

3382 * InsertionSort -

3383 * -

3384 * Just a simple insertion sort using -

3385 * pointers and back pointers to sort the Active -

3386 * Edge Table. -

3387 * -

3388 */ -

3389 -

3390 static int InsertionSort(EdgeTableEntry *AET) -

3391 { -

3392 EdgeTableEntry *pETEchase; -

3393 EdgeTableEntry *pETEinsert; -

3394 EdgeTableEntry *pETEchaseBackTMP; -

3395 int changed = 0; -

3396 -

3397 AET = AET->next; -

while (AET) {

AET	Description
TRUE	never evaluated
FALSE	never evaluated

0

3399 pETEinsert = AET; -

3400 pETEchase = AET; -

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

pETEchase->bac...res.minor_axis	Description
TRUE	never evaluated
FALSE	never evaluated

0

pETEchase = pETEchase->back;

never executed: pETEchase = pETEchase->back;

0

3403 -

3404 AET = AET->next; -

if (pETEchase != pETEinsert) {

pETEchase != pETEinsert	Description
TRUE	never evaluated
FALSE	never evaluated

0

3406 pETEchaseBackTMP = pETEchase->back; -

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

if (AET)

AET	Description
TRUE	never evaluated
FALSE	never evaluated

0

AET->back = pETEinsert->back;

never executed: AET->back = pETEinsert->back;

0

3410 pETEinsert->next = pETEchase; -

3411 pETEchase->back->next = pETEinsert; -

3412 pETEchase->back = pETEinsert; -

3413 pETEinsert->back = pETEchaseBackTMP; -

3414 changed = 1; -

}

never executed: end of block

0

}

never executed: end of block

0

return changed;

never executed: return changed;

0

3418 } -

3419 -

3420 /* -

3421 * Clean up our act. -

3422 */ -

3423 static void FreeStorage(ScanLineListBlock *pSLLBlock) -

3424 { -

3425 ScanLineListBlock *tmpSLLBlock; -

3426 -

while (pSLLBlock) {

pSLLBlock	Description
TRUE	never evaluated
FALSE	never evaluated

0

3428 tmpSLLBlock = pSLLBlock->next; -

3429 free(pSLLBlock); -

3430 pSLLBlock = tmpSLLBlock; -

}

never executed: end of block

0

}

never executed: end of block

0

3433 -

3434 struct QRegionSpan { -

3435 QRegionSpan() {} -

QRegionSpan(int x1_, int x2_) : x1(x1_), x2(x2_) {}

never executed: end of block

0

3437 -

3438 int x1; -

3439 int x2; -

int width() const { return x2 - x1; }

never executed: return x2 - x1;

0

3441 }; -

3442 -

3443 Q_DECLARE_TYPEINFO(QRegionSpan, Q_PRIMITIVE_TYPE); -

3444 -

3445 static inline void flushRow(const QRegionSpan *spans, int y, int numSpans, QRegionPrivate *reg, int *lastRow, int *extendTo, bool *needsExtend) -

3446 { -

3447 QRect *regRects = reg->rects.data() + *lastRow; -

bool canExtend = reg->rects.size() - *lastRow == numSpans

reg->rects.siz...ow == numSpans	Description
TRUE	never evaluated
FALSE	never evaluated

0

&& !(*needsExtend && *extendTo + 1 != y)

*needsExtend	Description
TRUE	never evaluated
FALSE	never evaluated

*extendTo + 1 != y	Description
TRUE	never evaluated
FALSE	never evaluated

0

&& (*needsExtend || regRects[0].y() + regRects[0].height() == y);

*needsExtend	Description
TRUE	never evaluated
FALSE	never evaluated

regRects[0].y(....height() == y	Description
TRUE	never evaluated
FALSE	never evaluated

0

3451 -

for (int i = 0; i < numSpans && canExtend; ++i) {

i < numSpans	Description
TRUE	never evaluated
FALSE	never evaluated

canExtend	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (regRects[i].x() != spans[i].x1 || regRects[i].right() != spans[i].x2 - 1)

regRects[i].x() != spans[i].x1	Description
TRUE	never evaluated
FALSE	never evaluated

regRects[i].ri...pans[i].x2 - 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

canExtend = false;

never executed: canExtend = false;

0

}

never executed: end of block

0

3456 -

if (canExtend) {

canExtend	Description
TRUE	never evaluated
FALSE	never evaluated

0

3458 *extendTo = y; -

3459 *needsExtend = true; -

} else {

never executed: end of block

0

if (*needsExtend) {

*needsExtend	Description
TRUE	never evaluated
FALSE	never evaluated

0

for (int i = 0; i < reg->rects.size() - *lastRow; ++i)

i < reg->rects...e() - *lastRow	Description
TRUE	never evaluated
FALSE	never evaluated

0

regRects[i].setBottom(*extendTo);

never executed: regRects[i].setBottom(*extendTo);

0

}

never executed: end of block

0

3465 -

3466 *lastRow = reg->rects.size(); -

3467 reg->rects.reserve(*lastRow + numSpans); -

for (int i = 0; i < numSpans; ++i)

i < numSpans	Description
TRUE	never evaluated
FALSE	never evaluated

0

reg->rects << QRect(spans[i].x1, y, spans[i].width(), 1);

never executed: reg->rects << QRect(spans[i].x1, y, spans[i].width(), 1);

0

3470 -

if (spans[0].x1 < reg->extents.left())

spans[0].x1 < ...extents.left()	Description
TRUE	never evaluated
FALSE	never evaluated

0

reg->extents.setLeft(spans[0].x1);

never executed: reg->extents.setLeft(spans[0].x1);

0

3473 -

if (spans[numSpans-1].x2 - 1 > reg->extents.right())

spans[numSpans...xtents.right()	Description
TRUE	never evaluated
FALSE	never evaluated

0

reg->extents.setRight(spans[numSpans-1].x2 - 1);

never executed: reg->extents.setRight(spans[numSpans-1].x2 - 1);

0

3476 -

3477 *needsExtend = false; -

}

never executed: end of block

0

3479 } -

3480 -

3481 /* -

3482 * Create an array of rectangles from a list of points. -

3483 * If indeed these things (POINTS, RECTS) are the same, -

3484 * then this proc is still needed, because it allocates -

3485 * storage for the array, which was allocated on the -

3486 * stack by the calling procedure. -

3487 * -

3488 */ -

3489 static void PtsToRegion(int numFullPtBlocks, int iCurPtBlock, -

3490 POINTBLOCK *FirstPtBlock, QRegionPrivate *reg) -

3491 { -

3492 int lastRow = 0; -

3493 int extendTo = 0; -

3494 bool needsExtend = false; -

3495 QVarLengthArray<QRegionSpan> row; -

3496 int rowSize = 0; -

3497 -

3498 reg->extents.setLeft(INT_MAX); -

3499 reg->extents.setRight(INT_MIN); -

3500 reg->innerArea = -1; -

3501 -

3502 POINTBLOCK *CurPtBlock = FirstPtBlock; -

for (; numFullPtBlocks >= 0; --numFullPtBlocks) {

numFullPtBlocks >= 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

3504 /* the loop uses 2 points per iteration */ -

3505 int i = NUMPTSTOBUFFER >> 1; -

if (!numFullPtBlocks)

!numFullPtBlocks	Description
TRUE	never evaluated
FALSE	never evaluated

0

i = iCurPtBlock >> 1;

never executed: i = iCurPtBlock >> 1;

0

if(i) {

i	Description
TRUE	never evaluated
FALSE	never evaluated

0

3509 row.resize(qMax(row.size(), rowSize + i)); -

for (QPoint *pts = CurPtBlock->pts; i--; pts += 2) {

i--	Description
TRUE	never evaluated
FALSE	never evaluated

0

3511 const int width = pts[1].x() - pts[0].x(); -

if (width) {

width	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (rowSize && row[rowSize-1].x2 == pts[0].x())

rowSize	Description
TRUE	never evaluated
FALSE	never evaluated

row[rowSize-1]... == pts[0].x()	Description
TRUE	never evaluated
FALSE	never evaluated

0

row[rowSize-1].x2 = pts[1].x();

never executed: row[rowSize-1].x2 = pts[1].x();

0

3515 else -

row[rowSize++] = QRegionSpan(pts[0].x(), pts[1].x());

never executed: row[rowSize++] = QRegionSpan(pts[0].x(), pts[1].x());

0

3517 } -

3518 -

if (rowSize) {

rowSize	Description
TRUE	never evaluated
FALSE	never evaluated

0

QPoint *next = i ? &pts[2] : (numFullPtBlocks && iCurPtBlock ? CurPtBlock->next->pts : Q_NULLPTR);

i	Description
TRUE	never evaluated
FALSE	never evaluated

numFullPtBlocks	Description
TRUE	never evaluated
FALSE	never evaluated

iCurPtBlock	Description
TRUE	never evaluated
FALSE	never evaluated

0

3521 -

if (!next || next->y() != pts[0].y()) {

!next	Description
TRUE	never evaluated
FALSE	never evaluated

next->y() != pts[0].y()	Description
TRUE	never evaluated
FALSE	never evaluated

0

3523 flushRow(row.data(), pts[0].y(), rowSize, reg, &lastRow, &extendTo, &needsExtend); -

3524 rowSize = 0; -

}

never executed: end of block

0

}

never executed: end of block

0

}

never executed: end of block

0

}

never executed: end of block

0

3529 CurPtBlock = CurPtBlock->next; -

}

never executed: end of block

0

3531 -

if (needsExtend) {

needsExtend	Description
TRUE	never evaluated
FALSE	never evaluated

0

for (int i = lastRow; i < reg->rects.size(); ++i)

i < reg->rects.size()	Description
TRUE	never evaluated
FALSE	never evaluated

0

reg->rects[i].setBottom(extendTo);

never executed: reg->rects[i].setBottom(extendTo);

0

}

never executed: end of block

0

3536 -

3537 reg->numRects = reg->rects.size(); -

3538 -

if (reg->numRects) {

reg->numRects	Description
TRUE	never evaluated
FALSE	never evaluated

0

3540 reg->extents.setTop(reg->rects[0].top()); -

3541 reg->extents.setBottom(reg->rects[lastRow].bottom()); -

3542 -

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

i < reg->rects.size()	Description
TRUE	never evaluated
FALSE	never evaluated

0

reg->updateInnerRect(reg->rects[i]);

never executed: reg->updateInnerRect(reg->rects[i]);

0

} else {

never executed: end of block

0

3546 reg->extents.setCoords(0, 0, 0, 0); -

}

never executed: end of block

0

3548 } -

3549 -

3550 /* -

3551 * polytoregion -

3552 * -

3553 * Scan converts a polygon by returning a run-length -

3554 * encoding of the resultant bitmap -- the run-length -

3555 * encoding is in the form of an array of rectangles. -

3556 * -

3557 * Can return 0 in case of errors. -

3558 */ -

3559 static QRegionPrivate *PolygonRegion(const QPoint *Pts, int Count, int rule) -

3560 //Point *Pts; /* the pts */ -

3561 //int Count; /* number of pts */ -

3562 //int rule; /* winding rule */ -

3563 { -

3564 QRegionPrivate *region; -

3565 EdgeTableEntry *pAET; /* Active Edge Table */ -

3566 int y; /* current scanline */ -

3567 int iPts = 0; /* number of pts in buffer */ -

3568 EdgeTableEntry *pWETE; /* Winding Edge Table Entry*/ -

3569 ScanLineList *pSLL; /* current scanLineList */ -

3570 QPoint *pts; /* output buffer */ -

3571 EdgeTableEntry *pPrevAET; /* ptr to previous AET */ -

3572 EdgeTable ET; /* header node for ET */ -

3573 EdgeTableEntry *AET; /* header node for AET */ -

3574 EdgeTableEntry *pETEs; /* EdgeTableEntries pool */ -

3575 ScanLineListBlock SLLBlock; /* header for scanlinelist */ -

3576 int fixWAET = false; -

3577 POINTBLOCK FirstPtBlock, *curPtBlock; /* PtBlock buffers */ -

3578 FirstPtBlock.pts = reinterpret_cast<QPoint *>(FirstPtBlock.data); -

3579 POINTBLOCK *tmpPtBlock; -

3580 int numFullPtBlocks = 0; -

3581 -

3582 region = new QRegionPrivate; -

3583 -

3584 /* special case a rectangle */ -

if (((Count == 4) ||

(Count == 4)	Description
TRUE	never evaluated
FALSE	never evaluated

0

((Count == 5) && (Pts[4].x() == Pts[0].x()) && (Pts[4].y() == Pts[0].y())))

(Count == 5)	Description
TRUE	never evaluated
FALSE	never evaluated

(Pts[4].x() == Pts[0].x())	Description
TRUE	never evaluated
FALSE	never evaluated

(Pts[4].y() == Pts[0].y())	Description
TRUE	never evaluated
FALSE	never evaluated

0

&& (((Pts[0].y() == Pts[1].y()) && (Pts[1].x() == Pts[2].x()) && (Pts[2].y() == Pts[3].y())

(Pts[0].y() == Pts[1].y())	Description
TRUE	never evaluated
FALSE	never evaluated

(Pts[1].x() == Pts[2].x())	Description
TRUE	never evaluated
FALSE	never evaluated

(Pts[2].y() == Pts[3].y())	Description
TRUE	never evaluated
FALSE	never evaluated

0

&& (Pts[3].x() == Pts[0].x())) || ((Pts[0].x() == Pts[1].x())

(Pts[3].x() == Pts[0].x())	Description
TRUE	never evaluated
FALSE	never evaluated

(Pts[0].x() == Pts[1].x())	Description
TRUE	never evaluated
FALSE	never evaluated

0

&& (Pts[1].y() == Pts[2].y()) && (Pts[2].x() == Pts[3].x())

(Pts[1].y() == Pts[2].y())	Description
TRUE	never evaluated
FALSE	never evaluated

(Pts[2].x() == Pts[3].x())	Description
TRUE	never evaluated
FALSE	never evaluated

0

&& (Pts[3].y() == Pts[0].y())))) {

(Pts[3].y() == Pts[0].y())	Description
TRUE	never evaluated
FALSE	never evaluated

0

3591 int x = qMin(Pts[0].x(), Pts[2].x()); -

3592 region->extents.setLeft(x); -

3593 int y = qMin(Pts[0].y(), Pts[2].y()); -

3594 region->extents.setTop(y); -

3595 region->extents.setWidth(qMax(Pts[0].x(), Pts[2].x()) - x); -

3596 region->extents.setHeight(qMax(Pts[0].y(), Pts[2].y()) - y); -

if ((region->extents.left() <= region->extents.right()) &&

(region->exten...tents.right())	Description
TRUE	never evaluated
FALSE	never evaluated

0

(region->extents.top() <= region->extents.bottom())) {

(region->exten...ents.bottom())	Description
TRUE	never evaluated
FALSE	never evaluated

0

3599 region->numRects = 1; -

3600 region->innerRect = region->extents; -

3601 region->innerArea = region->innerRect.width() * region->innerRect.height(); -

}

never executed: end of block

0

return region;

never executed: return region;

0

3604 } -

3605 -

if (!(pETEs = static_cast<EdgeTableEntry *>(malloc(sizeof(EdgeTableEntry) * Count)))) {

!(pETEs = stat...ry) * Count)))	Description
TRUE	never evaluated
FALSE	never evaluated

0

3607 delete region; -

return 0;

never executed: return 0;

0

3609 } -

3610 -

3611 region->vectorize(); -

3612 -

3613 AET = new EdgeTableEntry; -

3614 pts = FirstPtBlock.pts; -

3615 CreateETandAET(Count, Pts, &ET, AET, pETEs, &SLLBlock); -

3616 -

3617 pSLL = ET.scanlines.next; -

3618 curPtBlock = &FirstPtBlock; -

3619 -

3620 // sanity check that the region won't become too big... -

if (ET.ymax - ET.ymin > 100000) {

ET.ymax - ET.ymin > 100000	Description
TRUE	never evaluated
FALSE	never evaluated

0

3622 // clean up region ptr -

3623 #ifndef QT_NO_DEBUG -

3624 qWarning("QRegion: creating region from big polygon failed...!"); -

3625 #endif -

3626 delete AET; -

3627 delete region; -

return 0;

never executed: return 0;

0

3629 } -

3630 -

3631 -

3632 QT_TRY { -

if (rule == EvenOddRule) {

rule == 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

3634 /* -

3635 * for each scanline -

3636 */ -

for (y = ET.ymin; y < ET.ymax; ++y) {

y < ET.ymax	Description
TRUE	never evaluated
FALSE	never evaluated

0

3638 -

3639 /* -

3640 * Add a new edge to the active edge table when we -

3641 * get to the next edge. -

3642 */ -

if (pSLL && y == pSLL->scanline) {

pSLL	Description
TRUE	never evaluated
FALSE	never evaluated

y == pSLL->scanline	Description
TRUE	never evaluated
FALSE	never evaluated

0

3644 loadAET(AET, pSLL->edgelist); -

3645 pSLL = pSLL->next; -

}

never executed: end of block

0

3647 pPrevAET = AET; -

3648 pAET = AET->next; -

3649 -

3650 /* -

3651 * for each active edge -

3652 */ -

while (pAET) {

pAET	Description
TRUE	never evaluated
FALSE	never evaluated

0

3654 pts->setX(pAET->bres.minor_axis); -

3655 pts->setY(y); -

3656 ++pts; -

3657 ++iPts; -

3658 -

3659 /* -

3660 * send out the buffer -

3661 */ -

if (iPts == NUMPTSTOBUFFER) {

iPts == 200	Description
TRUE	never evaluated
FALSE	never evaluated

0

3663 tmpPtBlock = (POINTBLOCK *)malloc(sizeof(POINTBLOCK)); -

Q_CHECK_PTR(tmpPtBlock);

never executed: qt_check_pointer(__FILE__,3664);

!(tmpPtBlock)	Description
TRUE	never evaluated
FALSE	never evaluated

0

3665 tmpPtBlock->pts = reinterpret_cast<QPoint *>(tmpPtBlock->data); -

3666 curPtBlock->next = tmpPtBlock; -

3667 curPtBlock = tmpPtBlock; -

3668 pts = curPtBlock->pts; -

3669 ++numFullPtBlocks; -

3670 iPts = 0; -

}

never executed: end of block

0

EVALUATEEDGEEVENODD(pAET, pPrevAET, y)

never executed: pAET->back = pPrevAET;

never executed: end of block

never executed: end of block

never executed: end of block

never executed: end of block

never executed: end of block

never executed: end of block

pAET	Description
TRUE	never evaluated
FALSE	never evaluated

pAET->ymax == y	Description
TRUE	never evaluated
FALSE	never evaluated

pAET->bres.m1 > 0	Description
TRUE	never evaluated
FALSE	never evaluated

pAET->bres.d > 0	Description
TRUE	never evaluated
FALSE	never evaluated

pAET->bres.d >= 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

3673 } -

3674 InsertionSort(AET); -

}

never executed: end of block

0

} else {

never executed: end of block

0

3677 /* -

3678 * for each scanline -

3679 */ -

for (y = ET.ymin; y < ET.ymax; ++y) {

y < ET.ymax	Description
TRUE	never evaluated
FALSE	never evaluated

0

3681 /* -

3682 * Add a new edge to the active edge table when we -

3683 * get to the next edge. -

3684 */ -

if (pSLL && y == pSLL->scanline) {

pSLL	Description
TRUE	never evaluated
FALSE	never evaluated

y == pSLL->scanline	Description
TRUE	never evaluated
FALSE	never evaluated

0

3686 loadAET(AET, pSLL->edgelist); -

3687 computeWAET(AET); -

3688 pSLL = pSLL->next; -

}

never executed: end of block

0

3690 pPrevAET = AET; -

3691 pAET = AET->next; -

3692 pWETE = pAET; -

3693 -

3694 /* -

3695 * for each active edge -

3696 */ -

while (pAET) {

pAET	Description
TRUE	never evaluated
FALSE	never evaluated

0

3698 /* -

3699 * add to the buffer only those edges that -

3700 * are in the Winding active edge table. -

3701 */ -

if (pWETE == pAET) {

pWETE == pAET	Description
TRUE	never evaluated
FALSE	never evaluated

0

3703 pts->setX(pAET->bres.minor_axis); -

3704 pts->setY(y); -

3705 ++pts; -

3706 ++iPts; -

3707 -

3708 /* -

3709 * send out the buffer -

3710 */ -

if (iPts == NUMPTSTOBUFFER) {

iPts == 200	Description
TRUE	never evaluated
FALSE	never evaluated

0

3712 tmpPtBlock = static_cast<POINTBLOCK *>(malloc(sizeof(POINTBLOCK))); -

3713 tmpPtBlock->pts = reinterpret_cast<QPoint *>(tmpPtBlock->data); -

3714 curPtBlock->next = tmpPtBlock; -

3715 curPtBlock = tmpPtBlock; -

3716 pts = curPtBlock->pts; -

3717 ++numFullPtBlocks; -

3718 iPts = 0; -

}

never executed: end of block

0

3720 pWETE = pWETE->nextWETE; -

}

never executed: end of block

0

EVALUATEEDGEWINDING(pAET, pPrevAET, y, fixWAET)

never executed: pAET->back = pPrevAET;

never executed: end of block

never executed: end of block

never executed: end of block

never executed: end of block

never executed: end of block

never executed: end of block

pAET	Description
TRUE	never evaluated
FALSE	never evaluated

pAET->ymax == y	Description
TRUE	never evaluated
FALSE	never evaluated

pAET->bres.m1 > 0	Description
TRUE	never evaluated
FALSE	never evaluated

pAET->bres.d > 0	Description
TRUE	never evaluated
FALSE	never evaluated

pAET->bres.d >= 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

3723 } -

3724 -

3725 /* -

3726 * recompute the winding active edge table if -

3727 * we just resorted or have exited an edge. -

3728 */ -

if (InsertionSort(AET) || fixWAET) {

InsertionSort(AET)	Description
TRUE	never evaluated
FALSE	never evaluated

fixWAET	Description
TRUE	never evaluated
FALSE	never evaluated

0

3730 computeWAET(AET); -

3731 fixWAET = false; -

}

never executed: end of block

0

}

never executed: end of block

0

}

never executed: end of block

0

} QT_CATCH(...) {

dead code:

{ FreeStorage(SLLBlock.next); PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) { tmpPtBlock = curPtBlock->next; free(curPtBlock); curPtBlock = tmpPtBlock; } free(pETEs); return 0; }

-

FreeStorage(SLLBlock.next);

dead code:

{ FreeStorage(SLLBlock.next); PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) { tmpPtBlock = curPtBlock->next; free(curPtBlock); curPtBlock = tmpPtBlock; } free(pETEs); return 0; }

-

PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region);

dead code:

{ FreeStorage(SLLBlock.next); PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) { tmpPtBlock = curPtBlock->next; free(curPtBlock); curPtBlock = tmpPtBlock; } free(pETEs); return 0; }

-

for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) {

dead code:

{ FreeStorage(SLLBlock.next); PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) { tmpPtBlock = curPtBlock->next; free(curPtBlock); curPtBlock = tmpPtBlock; } free(pETEs); return 0; }

-

tmpPtBlock = curPtBlock->next;

dead code:

{ FreeStorage(SLLBlock.next); PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) { tmpPtBlock = curPtBlock->next; free(curPtBlock); curPtBlock = tmpPtBlock; } free(pETEs); return 0; }

-

free(curPtBlock);

dead code:

{ FreeStorage(SLLBlock.next); PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) { tmpPtBlock = curPtBlock->next; free(curPtBlock); curPtBlock = tmpPtBlock; } free(pETEs); return 0; }

-

curPtBlock = tmpPtBlock;

dead code:

{ FreeStorage(SLLBlock.next); PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) { tmpPtBlock = curPtBlock->next; free(curPtBlock); curPtBlock = tmpPtBlock; } free(pETEs); return 0; }

-

}

dead code:

{ FreeStorage(SLLBlock.next); PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) { tmpPtBlock = curPtBlock->next; free(curPtBlock); curPtBlock = tmpPtBlock; } free(pETEs); return 0; }

-

free(pETEs);

dead code:

{ FreeStorage(SLLBlock.next); PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) { tmpPtBlock = curPtBlock->next; free(curPtBlock); curPtBlock = tmpPtBlock; } free(pETEs); return 0; }

-

return 0; // this function returns 0 in case of an error

dead code:

{ FreeStorage(SLLBlock.next); PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) { tmpPtBlock = curPtBlock->next; free(curPtBlock); curPtBlock = tmpPtBlock; } free(pETEs); return 0; }

-

}

dead code:

{ FreeStorage(SLLBlock.next); PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) { tmpPtBlock = curPtBlock->next; free(curPtBlock); curPtBlock = tmpPtBlock; } free(pETEs); return 0; }

-

3746 -

3747 FreeStorage(SLLBlock.next); -

3748 PtsToRegion(numFullPtBlocks, iPts, &FirstPtBlock, region); -

for (curPtBlock = FirstPtBlock.next; --numFullPtBlocks >= 0;) {

--numFullPtBlocks >= 0	Description
TRUE	never evaluated
FALSE	never evaluated

0

3750 tmpPtBlock = curPtBlock->next; -

3751 free(curPtBlock); -

3752 curPtBlock = tmpPtBlock; -

}

never executed: end of block

0

3754 delete AET; -

3755 free(pETEs); -

return region;

never executed: return region;

0

3757 } -

3758 // END OF PolyReg.c extract -

3759 -

3760 QRegionPrivate *qt_bitmapToRegion(const QBitmap& bitmap) -

3761 { -

3762 const QImage image = bitmap.toImage(); -

3763 -

3764 QRegionPrivate *region = new QRegionPrivate; -

3765 -

3766 QRect xr; -

3767 -

3768 #define AddSpan \ -

3769 { \ -

3770 xr.setCoords(prev1, y, x-1, y); \ -

3771 UnionRectWithRegion(&xr, region, *region); \ -

3772 } -

3773 -

3774 const uchar zero = 0; -

3775 bool little = image.format() == QImage::Format_MonoLSB; -

3776 -

3777 int x, -

3778 y; -

for (y = 0; y < image.height(); ++y) {

y < image.height()	Description
TRUE	never evaluated
FALSE	never evaluated

0

3780 const uchar *line = image.constScanLine(y); -

3781 int w = image.width(); -

3782 uchar all = zero; -

3783 int prev1 = -1; -

for (x = 0; x < w;) {

x < w	Description
TRUE	never evaluated
FALSE	never evaluated

0

3785 uchar byte = line[x / 8]; -

if (x > w - 8 || byte!=all) {

x > w - 8	Description
TRUE	never evaluated
FALSE	never evaluated

byte!=all	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (little) {

little	Description
TRUE	never evaluated
FALSE	never evaluated

0

for (int b = 8; b > 0 && x < w; --b) {

b > 0	Description
TRUE	never evaluated
FALSE	never evaluated

x < w	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (!(byte & 0x01) == !all) {

!(byte & 0x01) == !all	Description
TRUE	never evaluated
FALSE	never evaluated

0

3790 // More of the same -

} else {

never executed: end of block

0

3792 // A change. -

if (all!=zero) {

all!=zero	Description
TRUE	never evaluated
FALSE	never evaluated

0

3794 AddSpan -

3795 all = zero; -

} else {

never executed: end of block

0

3797 prev1 = x; -

3798 all = ~zero; -

}

never executed: end of block

0

3800 } -

3801 byte >>= 1; -

3802 ++x; -

}

never executed: end of block

0

} else {

never executed: end of block

0

for (int b = 8; b > 0 && x < w; --b) {

b > 0	Description
TRUE	never evaluated
FALSE	never evaluated

x < w	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (!(byte & 0x80) == !all) {

!(byte & 0x80) == !all	Description
TRUE	never evaluated
FALSE	never evaluated

0

3807 // More of the same -

} else {

never executed: end of block

0

3809 // A change. -

if (all != zero) {

all != zero	Description
TRUE	never evaluated
FALSE	never evaluated

0

3811 AddSpan -

3812 all = zero; -

} else {

never executed: end of block

0

3814 prev1 = x; -

3815 all = ~zero; -

}

never executed: end of block

0

3817 } -

3818 byte <<= 1; -

3819 ++x; -

}

never executed: end of block

0

}

never executed: end of block

0

3822 } else { -

3823 x += 8; -

}

never executed: end of block

0

3825 } -

if (all != zero) {

all != zero	Description
TRUE	never evaluated
FALSE	never evaluated

0

3827 AddSpan -

}

never executed: end of block

0

}

never executed: end of block

0

3830 #undef AddSpan -

3831 -

return region;

never executed: return region;

0

3833 } -

3834 -

3835 QRegion::QRegion() -

3836 : d(const_cast<QRegionData*>(&shared_empty)) -

3837 { -

}

never executed: end of block

0

3839 -

3840 QRegion::QRegion(const QRect &r, RegionType t) -

3841 { -

if (r.isEmpty()) {

r.isEmpty()	Description
TRUE	never evaluated
FALSE	never evaluated

0

3843 d = const_cast<QRegionData*>(&shared_empty); -

} else {

never executed: end of block

0

3845 d = new QRegionData; -

3846 d->ref.initializeOwned(); -

if (t == Rectangle) {

t == Rectangle	Description
TRUE	never evaluated
FALSE	never evaluated

0

3848 d->qt_rgn = new QRegionPrivate(r); -

} else if (t == Ellipse) {

never executed: end of block

t == Ellipse	Description
TRUE	never evaluated
FALSE	never evaluated

0

3850 QPainterPath path; -

3851 path.addEllipse(r.x(), r.y(), r.width(), r.height()); -

3852 QPolygon a = path.toSubpathPolygons().at(0).toPolygon(); -

3853 d->qt_rgn = PolygonRegion(a.constData(), a.size(), EvenOddRule); -

}

never executed: end of block

0

}

never executed: end of block

0

3856 } -

3857 -

3858 QRegion::QRegion(const QPolygon &a, Qt::FillRule fillRule) -

3859 { -

if (a.count() > 2) {

a.count() > 2	Description
TRUE	never evaluated
FALSE	never evaluated

0

3861 QRegionPrivate *qt_rgn = PolygonRegion(a.constData(), a.size(), -

3862 fillRule == Qt::WindingFill ? WindingRule : EvenOddRule); -

if (qt_rgn) {

qt_rgn	Description
TRUE	never evaluated
FALSE	never evaluated

0

3864 d = new QRegionData; -

3865 d->ref.initializeOwned(); -

3866 d->qt_rgn = qt_rgn; -

} else {

never executed: end of block

0

3868 d = const_cast<QRegionData*>(&shared_empty); -

}

never executed: end of block

0

3870 } else { -

3871 d = const_cast<QRegionData*>(&shared_empty); -

}

never executed: end of block

0

3873 } -

3874 -

3875 QRegion::QRegion(const QRegion &r) -

3876 { -

3877 d = r.d; -

3878 d->ref.ref(); -

}

never executed: end of block

0

3880 -

3881 -

3882 QRegion::QRegion(const QBitmap &bm) -

3883 { -

if (bm.isNull()) {

bm.isNull()	Description
TRUE	never evaluated
FALSE	never evaluated

0

3885 d = const_cast<QRegionData*>(&shared_empty); -

} else {

never executed: end of block

0

3887 d = new QRegionData; -

3888 d->ref.initializeOwned(); -

3889 d->qt_rgn = qt_bitmapToRegion(bm); -

}

never executed: end of block

0

3891 } -

3892 -

3893 void QRegion::cleanUp(QRegion::QRegionData *x) -

3894 { -

3895 delete x->qt_rgn; -

3896 delete x; -

}

never executed: end of block

0

3898 -

3899 QRegion::~QRegion() -

3900 { -

if (!d->ref.deref())

!d->ref.deref()	Description
TRUE	never evaluated
FALSE	never evaluated

0

cleanUp(d);

never executed: cleanUp(d);

0

}

never executed: end of block

0

3904 -

3905 -

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

3907 { -

3908 r.d->ref.ref(); -

if (!d->ref.deref())

!d->ref.deref()	Description
TRUE	never evaluated
FALSE	never evaluated

0

cleanUp(d);

never executed: cleanUp(d);

0

3911 d = r.d; -

return *this;

never executed: return *this;

0

3913 } -

3914 -

3915 -

3916 /*! -

3917 \internal -

3918 */ -

3919 QRegion QRegion::copy() const -

3920 { -

3921 QRegion r; -

3922 QScopedPointer<QRegionData> x(new QRegionData); -

3923 x->ref.initializeOwned(); -

if (d->qt_rgn)

d->qt_rgn	Description
TRUE	never evaluated
FALSE	never evaluated

0

x->qt_rgn = new QRegionPrivate(*d->qt_rgn);

never executed: x->qt_rgn = new QRegionPrivate(*d->qt_rgn);

0

3926 else -

x->qt_rgn = new QRegionPrivate;

never executed: x->qt_rgn = new QRegionPrivate;

0

if (!r.d->ref.deref())

!r.d->ref.deref()	Description
TRUE	never evaluated
FALSE	never evaluated

0

cleanUp(r.d);

never executed: cleanUp(r.d);

0

3930 r.d = x.take(); -

return r;

never executed: return r;

0

3932 } -

3933 -

3934 bool QRegion::isEmpty() const -

3935 { -

return d == &shared_empty || d->qt_rgn->numRects == 0;

never executed: return d == &shared_empty || d->qt_rgn->numRects == 0;

0

3937 } -

3938 -

3939 bool QRegion::isNull() const -

3940 { -

return d == &shared_empty || d->qt_rgn->numRects == 0;

never executed: return d == &shared_empty || d->qt_rgn->numRects == 0;

0

3942 } -

3943 -

3944 bool QRegion::contains(const QPoint &p) const -

3945 { -

return PointInRegion(d->qt_rgn, p.x(), p.y());

never executed: return PointInRegion(d->qt_rgn, p.x(), p.y());

0

3947 } -

3948 -

3949 bool QRegion::contains(const QRect &r) const -

3950 { -

return RectInRegion(d->qt_rgn, r.left(), r.top(), r.width(), r.height()) != RectangleOut;

never executed: return RectInRegion(d->qt_rgn, r.left(), r.top(), r.width(), r.height()) != 0;

0

3952 } -

3953 -

3954 -

3955 -

3956 void QRegion::translate(int dx, int dy) -

3957 { -

if ((dx == 0 && dy == 0) || isEmptyHelper(d->qt_rgn))

dx == 0	Description
TRUE	never evaluated
FALSE	never evaluated

dy == 0	Description
TRUE	never evaluated
FALSE	never evaluated

isEmptyHelper(d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return;

never executed: return;

0

3960 -

3961 detach(); -

3962 OffsetRegion(*d->qt_rgn, dx, dy); -

}

never executed: end of block

0

3964 -

3965 QRegion QRegion::united(const QRegion &r) const -

3966 { -

if (isEmptyHelper(d->qt_rgn))

isEmptyHelper(d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return r;

never executed: return r;

0

if (isEmptyHelper(r.d->qt_rgn))

isEmptyHelper(r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

if (d == r.d)

d == r.d	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

3973 -

if (d->qt_rgn->contains(*r.d->qt_rgn)) {

d->qt_rgn->con...(*r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

} else if (r.d->qt_rgn->contains(*d->qt_rgn)) {

r.d->qt_rgn->c...ns(*d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return r;

never executed: return r;

0

} else if (d->qt_rgn->canAppend(r.d->qt_rgn)) {

d->qt_rgn->can...d(r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

3979 QRegion result(*this); -

3980 result.detach(); -

3981 result.d->qt_rgn->append(r.d->qt_rgn); -

return result;

never executed: return result;

0

} else if (d->qt_rgn->canPrepend(r.d->qt_rgn)) {

d->qt_rgn->can...d(r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

3984 QRegion result(*this); -

3985 result.detach(); -

3986 result.d->qt_rgn->prepend(r.d->qt_rgn); -

return result;

never executed: return result;

0

} else if (EqualRegion(d->qt_rgn, r.d->qt_rgn)) {

EqualRegion(d-..., r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

3990 } else { -

3991 QRegion result; -

3992 result.detach(); -

3993 UnionRegion(d->qt_rgn, r.d->qt_rgn, *result.d->qt_rgn); -

return result;

never executed: return result;

0

3995 } -

3996 } -

3997 -

3998 QRegion& QRegion::operator+=(const QRegion &r) -

3999 { -

if (isEmptyHelper(d->qt_rgn))

isEmptyHelper(d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this = r;

never executed: return *this = r;

0

if (isEmptyHelper(r.d->qt_rgn))

isEmptyHelper(r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

if (d == r.d)

d == r.d	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

4006 -

if (d->qt_rgn->contains(*r.d->qt_rgn)) {

d->qt_rgn->con...(*r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

} else if (r.d->qt_rgn->contains(*d->qt_rgn)) {

r.d->qt_rgn->c...ns(*d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this = r;

never executed: return *this = r;

0

} else if (d->qt_rgn->canAppend(r.d->qt_rgn)) {

d->qt_rgn->can...d(r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

4012 detach(); -

4013 d->qt_rgn->append(r.d->qt_rgn); -

return *this;

never executed: return *this;

0

} else if (d->qt_rgn->canPrepend(r.d->qt_rgn)) {

d->qt_rgn->can...d(r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

4016 detach(); -

4017 d->qt_rgn->prepend(r.d->qt_rgn); -

return *this;

never executed: return *this;

0

} else if (EqualRegion(d->qt_rgn, r.d->qt_rgn)) {

EqualRegion(d-..., r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

4021 } else { -

4022 detach(); -

4023 UnionRegion(d->qt_rgn, r.d->qt_rgn, *d->qt_rgn); -

return *this;

never executed: return *this;

0

4025 } -

4026 } -

4027 -

4028 QRegion QRegion::united(const QRect &r) const -

4029 { -

if (isEmptyHelper(d->qt_rgn))

isEmptyHelper(d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return r;

never executed: return r;

0

if (r.isEmpty())

r.isEmpty()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

4034 -

if (d->qt_rgn->contains(r)) {

d->qt_rgn->contains(r)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

} else if (d->qt_rgn->within(r)) {

d->qt_rgn->within(r)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return r;

never executed: return r;

0

} else if (d->qt_rgn->numRects == 1 && d->qt_rgn->extents == r) {

d->qt_rgn->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

d->qt_rgn->extents == r	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

} else if (d->qt_rgn->canAppend(&r)) {

d->qt_rgn->canAppend(&r)	Description
TRUE	never evaluated
FALSE	never evaluated

0

4042 QRegion result(*this); -

4043 result.detach(); -

4044 result.d->qt_rgn->append(&r); -

return result;

never executed: return result;

0

} else if (d->qt_rgn->canPrepend(&r)) {

d->qt_rgn->canPrepend(&r)	Description
TRUE	never evaluated
FALSE	never evaluated

0

4047 QRegion result(*this); -

4048 result.detach(); -

4049 result.d->qt_rgn->prepend(&r); -

return result;

never executed: return result;

0

4051 } else { -

4052 QRegion result; -

4053 result.detach(); -

4054 QRegionPrivate rp(r); -

4055 UnionRegion(d->qt_rgn, &rp, *result.d->qt_rgn); -

return result;

never executed: return result;

0

4057 } -

4058 } -

4059 -

4060 QRegion& QRegion::operator+=(const QRect &r) -

4061 { -

if (isEmptyHelper(d->qt_rgn))

isEmptyHelper(d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this = r;

never executed: return *this = r;

0

if (r.isEmpty())

r.isEmpty()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

4066 -

if (d->qt_rgn->contains(r)) {

d->qt_rgn->contains(r)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

} else if (d->qt_rgn->within(r)) {

d->qt_rgn->within(r)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this = r;

never executed: return *this = r;

0

} else if (d->qt_rgn->canAppend(&r)) {

d->qt_rgn->canAppend(&r)	Description
TRUE	never evaluated
FALSE	never evaluated

0

4072 detach(); -

4073 d->qt_rgn->append(&r); -

return *this;

never executed: return *this;

0

} else if (d->qt_rgn->canPrepend(&r)) {

d->qt_rgn->canPrepend(&r)	Description
TRUE	never evaluated
FALSE	never evaluated

0

4076 detach(); -

4077 d->qt_rgn->prepend(&r); -

return *this;

never executed: return *this;

0

} else if (d->qt_rgn->numRects == 1 && d->qt_rgn->extents == r) {

d->qt_rgn->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

d->qt_rgn->extents == r	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

4081 } else { -

4082 detach(); -

4083 QRegionPrivate p(r); -

4084 UnionRegion(d->qt_rgn, &p, *d->qt_rgn); -

return *this;

never executed: return *this;

0

4086 } -

4087 } -

4088 -

4089 QRegion QRegion::intersected(const QRegion &r) const -

4090 { -

if (isEmptyHelper(d->qt_rgn) || isEmptyHelper(r.d->qt_rgn)

isEmptyHelper(d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

isEmptyHelper(r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

|| !EXTENTCHECK(&d->qt_rgn->extents, &r.d->qt_rgn->extents))

(&d->qt_rgn->e...tents)->left()	Description
TRUE	never evaluated
FALSE	never evaluated

(&d->qt_rgn->e...ents)->right()	Description
TRUE	never evaluated
FALSE	never evaluated

(&d->qt_rgn->e...xtents)->top()	Description
TRUE	never evaluated
FALSE	never evaluated

(&d->qt_rgn->e...nts)->bottom()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return QRegion();

never executed: return QRegion();

0

4094 -

4095 /* this is fully contained in r */ -

if (r.d->qt_rgn->contains(*d->qt_rgn))

r.d->qt_rgn->c...ns(*d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

4098 -

4099 /* r is fully contained in this */ -

if (d->qt_rgn->contains(*r.d->qt_rgn))

d->qt_rgn->con...(*r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return r;

never executed: return r;

0

4102 -

if (r.d->qt_rgn->numRects == 1 && d->qt_rgn->numRects == 1) {

r.d->qt_rgn->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

d->qt_rgn->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

4104 const QRect rect = qt_rect_intersect_normalized(r.d->qt_rgn->extents, -

4105 d->qt_rgn->extents); -

return QRegion(rect);

never executed: return QRegion(rect);

0

} else if (r.d->qt_rgn->numRects == 1) {

r.d->qt_rgn->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

4108 QRegion result(*this); -

4109 result.detach(); -

4110 result.d->qt_rgn->intersect(r.d->qt_rgn->extents); -

return result;

never executed: return result;

0

} else if (d->qt_rgn->numRects == 1) {

d->qt_rgn->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

4113 QRegion result(r); -

4114 result.detach(); -

4115 result.d->qt_rgn->intersect(d->qt_rgn->extents); -

return result;

never executed: return result;

0

4117 } -

4118 -

4119 QRegion result; -

4120 result.detach(); -

4121 miRegionOp(*result.d->qt_rgn, d->qt_rgn, r.d->qt_rgn, miIntersectO, 0, 0); -

4122 -

4123 /* -

4124 * Can't alter dest's extents before we call miRegionOp because -

4125 * it might be one of the source regions and miRegionOp depends -

4126 * on the extents of those regions being the same. Besides, this -

4127 * way there's no checking against rectangles that will be nuked -

4128 * due to coalescing, so we have to examine fewer rectangles. -

4129 */ -

4130 miSetExtents(*result.d->qt_rgn); -

return result;

never executed: return result;

0

4132 } -

4133 -

4134 QRegion QRegion::intersected(const QRect &r) const -

4135 { -

if (isEmptyHelper(d->qt_rgn) || r.isEmpty()

isEmptyHelper(d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

r.isEmpty()	Description
TRUE	never evaluated
FALSE	never evaluated

0

|| !EXTENTCHECK(&d->qt_rgn->extents, &r))

(&d->qt_rgn->e...= (&r)->left()	Description
TRUE	never evaluated
FALSE	never evaluated

(&d->qt_rgn->e... (&r)->right()	Description
TRUE	never evaluated
FALSE	never evaluated

(&d->qt_rgn->e...>= (&r)->top()	Description
TRUE	never evaluated
FALSE	never evaluated

(&d->qt_rgn->e...(&r)->bottom()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return QRegion();

never executed: return QRegion();

0

4139 -

4140 /* this is fully contained in r */ -

if (d->qt_rgn->within(r))

d->qt_rgn->within(r)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

4143 -

4144 /* r is fully contained in this */ -

if (d->qt_rgn->contains(r))

d->qt_rgn->contains(r)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return r;

never executed: return r;

0

4147 -

if (d->qt_rgn->numRects == 1) {

d->qt_rgn->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

4149 const QRect rect = qt_rect_intersect_normalized(d->qt_rgn->extents, -

4150 r.normalized()); -

return QRegion(rect);

never executed: return QRegion(rect);

0

4152 } -

4153 -

4154 QRegion result(*this); -

4155 result.detach(); -

4156 result.d->qt_rgn->intersect(r); -

return result;

never executed: return result;

0

4158 } -

4159 -

4160 QRegion QRegion::subtracted(const QRegion &r) const -

4161 { -

if (isEmptyHelper(d->qt_rgn) || isEmptyHelper(r.d->qt_rgn))

isEmptyHelper(d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

isEmptyHelper(r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

if (r.d->qt_rgn->contains(*d->qt_rgn))

r.d->qt_rgn->c...ns(*d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return QRegion();

never executed: return QRegion();

0

if (!EXTENTCHECK(&d->qt_rgn->extents, &r.d->qt_rgn->extents))

(&d->qt_rgn->e...tents)->left()	Description
TRUE	never evaluated
FALSE	never evaluated

(&d->qt_rgn->e...ents)->right()	Description
TRUE	never evaluated
FALSE	never evaluated

(&d->qt_rgn->e...xtents)->top()	Description
TRUE	never evaluated
FALSE	never evaluated

(&d->qt_rgn->e...nts)->bottom()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

if (d == r.d || EqualRegion(d->qt_rgn, r.d->qt_rgn))

d == r.d	Description
TRUE	never evaluated
FALSE	never evaluated

EqualRegion(d-..., r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return QRegion();

never executed: return QRegion();

0

4170 -

4171 #ifdef QT_REGION_DEBUG -

4172 d->qt_rgn->selfTest(); -

4173 r.d->qt_rgn->selfTest(); -

4174 #endif -

4175 -

4176 QRegion result; -

4177 result.detach(); -

4178 SubtractRegion(d->qt_rgn, r.d->qt_rgn, *result.d->qt_rgn); -

4179 #ifdef QT_REGION_DEBUG -

4180 result.d->qt_rgn->selfTest(); -

4181 #endif -

return result;

never executed: return result;

0

4183 } -

4184 -

4185 QRegion QRegion::xored(const QRegion &r) const -

4186 { -

if (isEmptyHelper(d->qt_rgn)) {

isEmptyHelper(d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return r;

never executed: return r;

0

} else if (isEmptyHelper(r.d->qt_rgn)) {

isEmptyHelper(r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return *this;

never executed: return *this;

0

} else if (!EXTENTCHECK(&d->qt_rgn->extents, &r.d->qt_rgn->extents)) {

(&d->qt_rgn->e...tents)->left()	Description
TRUE	never evaluated
FALSE	never evaluated

(&d->qt_rgn->e...ents)->right()	Description
TRUE	never evaluated
FALSE	never evaluated

(&d->qt_rgn->e...xtents)->top()	Description
TRUE	never evaluated
FALSE	never evaluated

(&d->qt_rgn->e...nts)->bottom()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return (*this + r);

never executed: return (*this + r);

0

} else if (d == r.d || EqualRegion(d->qt_rgn, r.d->qt_rgn)) {

d == r.d	Description
TRUE	never evaluated
FALSE	never evaluated

EqualRegion(d-..., r.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return QRegion();

never executed: return QRegion();

0

4195 } else { -

4196 QRegion result; -

4197 result.detach(); -

4198 XorRegion(d->qt_rgn, r.d->qt_rgn, *result.d->qt_rgn); -

return result;

never executed: return result;

0

4200 } -

4201 } -

4202 -

4203 QRect QRegion::boundingRect() const -

4204 { -

if (isEmpty())

isEmpty()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return QRect();

never executed: return QRect();

0

return d->qt_rgn->extents;

never executed: return d->qt_rgn->extents;

0

4208 } -

4209 -

4210 /*! \internal -

4211 Returns \c true if \a rect is guaranteed to be fully contained in \a region. -

4212 A false return value does not guarantee the opposite. -

4213 */ -

4214 Q_GUI_EXPORT -

4215 bool qt_region_strictContains(const QRegion &region, const QRect &rect) -

4216 { -

if (isEmptyHelper(region.d->qt_rgn) || !rect.isValid())

isEmptyHelper(...ion.d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

!rect.isValid()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return false;

never executed: return false;

0

4219 -

4220 #if 0 // TEST_INNERRECT -

4221 static bool guard = false; -

4222 if (guard) -

4223 return false; -

4224 guard = true; -

4225 QRegion inner = region.d->qt_rgn->innerRect; -

4226 Q_ASSERT((inner - region).isEmpty()); -

4227 guard = false; -

4228 -

4229 int maxArea = 0; -

4230 for (int i = 0; i < region.d->qt_rgn->numRects; ++i) { -

4231 const QRect r = region.d->qt_rgn->rects.at(i); -

4232 if (r.width() * r.height() > maxArea) -

4233 maxArea = r.width() * r.height(); -

4234 } -

4235 -

4236 if (maxArea > region.d->qt_rgn->innerArea) { -

4237 qDebug() << "not largest rectangle" << region << region.d->qt_rgn->innerRect; -

4238 } -

4239 Q_ASSERT(maxArea <= region.d->qt_rgn->innerArea); -

4240 #endif -

4241 -

4242 const QRect r1 = region.d->qt_rgn->innerRect; -

return (rect.left() >= r1.left() && rect.right() <= r1.right()

never executed:

return (rect.left() >= r1.left() && rect.right() <= r1.right() && rect.top() >= r1.top() && rect.bottom() <= r1.bottom());

0

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

never executed:

return (rect.left() >= r1.left() && rect.right() <= r1.right() && rect.top() >= r1.top() && rect.bottom() <= r1.bottom());

0

4245 } -

4246 -

4247 QVector<QRect> QRegion::rects() const -

4248 { -

if (d->qt_rgn) {

d->qt_rgn	Description
TRUE	never evaluated
FALSE	never evaluated

0

4250 d->qt_rgn->vectorize(); -

4251 d->qt_rgn->rects.reserve(d->qt_rgn->numRects); -

4252 d->qt_rgn->rects.resize(d->qt_rgn->numRects); -

return d->qt_rgn->rects;

never executed: return d->qt_rgn->rects;

0

4254 } else { -

return QVector<QRect>();

never executed: return QVector<QRect>();

0

4256 } -

4257 } -

4258 -

4259 void QRegion::setRects(const QRect *rects, int num) -

4260 { -

4261 *this = QRegion(); -

if (!rects || num == 0 || (num == 1 && rects->isEmpty()))

!rects	Description
TRUE	never evaluated
FALSE	never evaluated

num == 0	Description
TRUE	never evaluated
FALSE	never evaluated

num == 1	Description
TRUE	never evaluated
FALSE	never evaluated

rects->isEmpty()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return;

never executed: return;

0

4264 -

4265 detach(); -

4266 -

4267 d->qt_rgn->numRects = num; -

if (num == 1) {

num == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

4269 d->qt_rgn->extents = *rects; -

4270 d->qt_rgn->innerRect = *rects; -

} else {

never executed: end of block

0

4272 d->qt_rgn->rects.resize(num); -

4273 -

4274 int left = INT_MAX, -

4275 right = INT_MIN, -

4276 top = INT_MAX, -

4277 bottom = INT_MIN; -

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

i < num	Description
TRUE	never evaluated
FALSE	never evaluated

0

4279 const QRect &rect = rects[i]; -

4280 d->qt_rgn->rects[i] = rect; -

4281 left = qMin(rect.left(), left); -

4282 right = qMax(rect.right(), right); -

4283 top = qMin(rect.top(), top); -

4284 bottom = qMax(rect.bottom(), bottom); -

4285 d->qt_rgn->updateInnerRect(rect); -

}

never executed: end of block

0

4287 d->qt_rgn->extents = QRect(QPoint(left, top), QPoint(right, bottom)); -

}

never executed: end of block

0

4289 } -

4290 -

4291 int QRegion::rectCount() const -

4292 { -

return (d->qt_rgn ? d->qt_rgn->numRects : 0);

never executed: return (d->qt_rgn ? d->qt_rgn->numRects : 0);

0

4294 } -

4295 -

4296 -

4297 bool QRegion::operator==(const QRegion &r) const -

4298 { -

if (!d->qt_rgn)

!d->qt_rgn	Description
TRUE	never evaluated
FALSE	never evaluated

0

return r.isEmpty();

never executed: return r.isEmpty();

0

if (!r.d->qt_rgn)

!r.d->qt_rgn	Description
TRUE	never evaluated
FALSE	never evaluated

0

return isEmpty();

never executed: return isEmpty();

0

4303 -

if (d == r.d)

d == r.d	Description
TRUE	never evaluated
FALSE	never evaluated

0

return true;

never executed: return true;

0

4306 else -

return EqualRegion(d->qt_rgn, r.d->qt_rgn);

never executed: return EqualRegion(d->qt_rgn, r.d->qt_rgn);

0

4308 } -

4309 -

4310 bool QRegion::intersects(const QRect &rect) const -

4311 { -

if (isEmptyHelper(d->qt_rgn) || rect.isNull())

isEmptyHelper(d->qt_rgn)	Description
TRUE	never evaluated
FALSE	never evaluated

rect.isNull()	Description
TRUE	never evaluated
FALSE	never evaluated

0

return false;

never executed: return false;

0

4314 -

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

if (!rect_intersects(d->qt_rgn->extents, r))

!rect_intersec...n->extents, r)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return false;

never executed: return false;

0

if (d->qt_rgn->numRects == 1)

d->qt_rgn->numRects == 1	Description
TRUE	never evaluated
FALSE	never evaluated

0

return true;

never executed: return true;

0

4320 -

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

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

it < myRects.constEnd()	Description
TRUE	never evaluated
FALSE	never evaluated

0

if (rect_intersects(r, *it))

rect_intersects(r, *it)	Description
TRUE	never evaluated
FALSE	never evaluated

0

return true;

never executed: return true;

0

return false;

never executed: return false;

0

4326 } -

4327 -

4328 -

4329 #endif -

4330 QT_END_NAMESPACE -

Source code

Switch to Preprocessed file

Generated by Squish Coco Non-Commercial 4.3.0-BETA-master-30-08-2018-4cb69e9