| Line | Source | Count |
| 1 | | - |
| 2 | | - |
| 3 | void QSGNinePatchNode::rebuildGeometry(QSGTexture *texture, QSGGeometry *geometry, const QVector4D &padding, | - |
| 4 | const QRectF &bounds, qreal dpr) | - |
| 5 | { | - |
| 6 | if (padding.x() <= 0| TRUE | never evaluated | | FALSE | never evaluated |
&& padding.y() <= 0| TRUE | never evaluated | | FALSE | never evaluated |
&& padding.z() <= 0| TRUE | never evaluated | | FALSE | never evaluated |
&& padding.w() <= 0| TRUE | never evaluated | | FALSE | never evaluated |
) { | 0 |
| 7 | geometry->allocate(4, 0); | - |
| 8 | QSGGeometry::updateTexturedRectGeometry(geometry, bounds, texture->normalizedTextureSubRect()); | - |
| 9 | return; never executed: return; | 0 |
| 10 | } | - |
| 11 | | - |
| 12 | QRectF tc = texture->normalizedTextureSubRect(); | - |
| 13 | QSize ts = texture->textureSize(); | - |
| 14 | ts.setHeight(ts.height() / dpr); | - |
| 15 | ts.setWidth(ts.width() / dpr); | - |
| 16 | | - |
| 17 | qreal invtw = tc.width() / ts.width(); | - |
| 18 | qreal invth = tc.height() / ts.height(); | - |
| 19 | | - |
| 20 | struct Coord { qreal p; qreal t; }; | - |
| 21 | Coord cx[4] = { { bounds.left(), tc.left() }, | - |
| 22 | { bounds.left() + padding.x(), tc.left() + padding.x() * invtw }, | - |
| 23 | { bounds.right() - padding.z(), tc.right() - padding.z() * invtw }, | - |
| 24 | { bounds.right(), tc.right() } | - |
| 25 | }; | - |
| 26 | Coord cy[4] = { { bounds.top(), tc.top() }, | - |
| 27 | { bounds.top() + padding.y(), tc.top() + padding.y() * invth }, | - |
| 28 | { bounds.bottom() - padding.w(), tc.bottom() - padding.w() * invth }, | - |
| 29 | { bounds.bottom(), tc.bottom() } | - |
| 30 | }; | - |
| 31 | | - |
| 32 | geometry->allocate(16, 28); | - |
| 33 | QSGGeometry::TexturedPoint2D *v = geometry->vertexDataAsTexturedPoint2D(); | - |
| 34 | for (int y = 0; y < 4| TRUE | never evaluated | | FALSE | never evaluated |
; ++y) { | 0 |
| 35 | for (int x = 0; x < 4| TRUE | never evaluated | | FALSE | never evaluated |
; ++x) { | 0 |
| 36 | v->set(cx[x].p, cy[y].p, cx[x].t, cy[y].t); | - |
| 37 | ++v; | - |
| 38 | } never executed: end of block | 0 |
| 39 | } never executed: end of block | 0 |
| 40 | | - |
| 41 | quint16 *i = geometry->indexDataAsUShort(); | - |
| 42 | for (int r = 0; r < 3| TRUE | never evaluated | | FALSE | never evaluated |
; ++r) { | 0 |
| 43 | if (r > 0| TRUE | never evaluated | | FALSE | never evaluated |
) | 0 |
| 44 | * never executed: *i++ = 4 * r; i++ = 4 * r;never executed: *i++ = 4 * r; | 0 |
| 45 | for (int c = 0; c < 4| TRUE | never evaluated | | FALSE | never evaluated |
; ++c) { | 0 |
| 46 | i[0] = 4 * r + c; | - |
| 47 | i[1] = 4 * r + c + 4; | - |
| 48 | i += 2; | - |
| 49 | } never executed: end of block | 0 |
| 50 | if (r < 2| TRUE | never evaluated | | FALSE | never evaluated |
) | 0 |
| 51 | * never executed: *i++ = 4 * r + 3 + 4; i++ = 4 * r + 3 + 4;never executed: *i++ = 4 * r + 3 + 4; | 0 |
| 52 | } never executed: end of block | 0 |
| 53 | } never executed: end of block | 0 |
| 54 | | - |
| 55 | | - |
| | |