Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 1 | /* |
| 2 | * Copyright 2017 Google Inc. |
| 3 | * |
| 4 | * Use of this source code is governed by a BSD-style license that can be |
| 5 | * found in the LICENSE file. |
| 6 | */ |
| 7 | |
| 8 | #include "GrCoverageCountingPathRenderer.h" |
| 9 | |
| 10 | #include "GrCaps.h" |
| 11 | #include "GrClip.h" |
Robert Phillips | 777707b | 2018-01-17 11:40:14 -0500 | [diff] [blame] | 12 | #include "GrProxyProvider.h" |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 13 | #include "SkMakeUnique.h" |
Chris Dalton | a039d3b | 2017-09-28 11:16:36 -0600 | [diff] [blame] | 14 | #include "SkPathOps.h" |
Chris Dalton | 383a2ef | 2018-01-08 17:21:41 -0500 | [diff] [blame] | 15 | #include "ccpr/GrCCClipProcessor.h" |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 16 | #include "ccpr/GrCCDrawPathsOp.h" |
Chris Dalton | a2b5b64 | 2018-06-24 13:08:57 -0600 | [diff] [blame] | 17 | #include "ccpr/GrCCPathCache.h" |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 18 | |
Chris Dalton | 5ba36ba | 2018-05-09 01:08:38 -0600 | [diff] [blame] | 19 | using PathInstance = GrCCPathProcessor::Instance; |
Chris Dalton | a32a3c3 | 2017-12-05 10:05:21 -0700 | [diff] [blame] | 20 | |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 21 | bool GrCoverageCountingPathRenderer::IsSupported(const GrCaps& caps) { |
| 22 | const GrShaderCaps& shaderCaps = *caps.shaderCaps(); |
Chris Dalton | 383a2ef | 2018-01-08 17:21:41 -0500 | [diff] [blame] | 23 | return shaderCaps.integerSupport() && shaderCaps.flatInterpolationSupport() && |
| 24 | caps.instanceAttribSupport() && GrCaps::kNone_MapFlags != caps.mapBufferFlags() && |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 25 | caps.isConfigTexturable(kAlpha_half_GrPixelConfig) && |
Brian Salomon | bdecacf | 2018-02-02 20:32:49 -0500 | [diff] [blame] | 26 | caps.isConfigRenderable(kAlpha_half_GrPixelConfig) && |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 27 | caps.isConfigTexturable(kAlpha_8_GrPixelConfig) && |
| 28 | caps.isConfigRenderable(kAlpha_8_GrPixelConfig) && |
Chris Dalton | e4679fa | 2017-09-29 13:58:26 -0600 | [diff] [blame] | 29 | !caps.blacklistCoverageCounting(); |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 30 | } |
| 31 | |
Chris Dalton | 383a2ef | 2018-01-08 17:21:41 -0500 | [diff] [blame] | 32 | sk_sp<GrCoverageCountingPathRenderer> GrCoverageCountingPathRenderer::CreateIfSupported( |
Chris Dalton | a2b5b64 | 2018-06-24 13:08:57 -0600 | [diff] [blame] | 33 | const GrCaps& caps, AllowCaching allowCaching) { |
| 34 | return sk_sp<GrCoverageCountingPathRenderer>( |
| 35 | IsSupported(caps) ? new GrCoverageCountingPathRenderer(allowCaching) : nullptr); |
| 36 | } |
| 37 | |
| 38 | GrCoverageCountingPathRenderer::GrCoverageCountingPathRenderer(AllowCaching allowCaching) { |
| 39 | if (AllowCaching::kYes == allowCaching) { |
| 40 | fPathCache = skstd::make_unique<GrCCPathCache>(); |
| 41 | } |
| 42 | } |
| 43 | |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 44 | GrCCPerOpListPaths* GrCoverageCountingPathRenderer::lookupPendingPaths(uint32_t opListID) { |
| 45 | auto it = fPendingPaths.find(opListID); |
| 46 | if (fPendingPaths.end() == it) { |
Robert Phillips | 774168e | 2018-05-31 12:43:27 -0400 | [diff] [blame] | 47 | sk_sp<GrCCPerOpListPaths> paths = sk_make_sp<GrCCPerOpListPaths>(); |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 48 | it = fPendingPaths.insert(std::make_pair(opListID, std::move(paths))).first; |
| 49 | } |
| 50 | return it->second.get(); |
Chris Dalton | 5ba36ba | 2018-05-09 01:08:38 -0600 | [diff] [blame] | 51 | } |
| 52 | |
Chris Dalton | 383a2ef | 2018-01-08 17:21:41 -0500 | [diff] [blame] | 53 | GrPathRenderer::CanDrawPath GrCoverageCountingPathRenderer::onCanDrawPath( |
| 54 | const CanDrawPathArgs& args) const { |
Chris Dalton | 09a7bb2 | 2018-08-31 19:53:15 +0800 | [diff] [blame] | 55 | const GrShape& shape = *args.fShape; |
| 56 | if (GrAAType::kCoverage != args.fAAType || shape.style().hasPathEffect() || |
| 57 | args.fViewMatrix->hasPerspective() || shape.inverseFilled()) { |
Chris Dalton | 5ed4423 | 2017-09-07 13:22:46 -0600 | [diff] [blame] | 58 | return CanDrawPath::kNo; |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 59 | } |
| 60 | |
| 61 | SkPath path; |
Chris Dalton | 09a7bb2 | 2018-08-31 19:53:15 +0800 | [diff] [blame] | 62 | shape.asPath(&path); |
Chris Dalton | a2b5b64 | 2018-06-24 13:08:57 -0600 | [diff] [blame] | 63 | |
Chris Dalton | 82de18f | 2018-09-12 17:24:09 -0600 | [diff] [blame] | 64 | const SkStrokeRec& stroke = shape.style().strokeRec(); |
| 65 | switch (stroke.getStyle()) { |
Chris Dalton | 09a7bb2 | 2018-08-31 19:53:15 +0800 | [diff] [blame] | 66 | case SkStrokeRec::kFill_Style: { |
| 67 | SkRect devBounds; |
| 68 | args.fViewMatrix->mapRect(&devBounds, path.getBounds()); |
Chris Dalton | a2b5b64 | 2018-06-24 13:08:57 -0600 | [diff] [blame] | 69 | |
Chris Dalton | 09a7bb2 | 2018-08-31 19:53:15 +0800 | [diff] [blame] | 70 | SkIRect clippedIBounds; |
| 71 | devBounds.roundOut(&clippedIBounds); |
| 72 | if (!clippedIBounds.intersect(*args.fClipConservativeBounds)) { |
| 73 | // The path is completely clipped away. Our code will eventually notice this before |
| 74 | // doing any real work. |
| 75 | return CanDrawPath::kYes; |
| 76 | } |
| 77 | |
| 78 | int64_t numPixels = sk_64_mul(clippedIBounds.height(), clippedIBounds.width()); |
| 79 | if (path.countVerbs() > 1000 && path.countPoints() > numPixels) { |
| 80 | // This is a complicated path that has more vertices than pixels! Let's let the SW |
| 81 | // renderer have this one: It will probably be faster and a bitmap will require less |
| 82 | // total memory on the GPU than CCPR instance buffers would for the raw path data. |
| 83 | return CanDrawPath::kNo; |
| 84 | } |
| 85 | |
| 86 | if (numPixels > 256 * 256) { |
| 87 | // Large paths can blow up the atlas fast. And they are not ideal for a two-pass |
| 88 | // rendering algorithm. Give the simpler direct renderers a chance before we commit |
| 89 | // to drawing it. |
| 90 | return CanDrawPath::kAsBackup; |
| 91 | } |
| 92 | |
| 93 | if (args.fShape->hasUnstyledKey() && path.countVerbs() > 50) { |
| 94 | // Complex paths do better cached in an SDF, if the renderer will accept them. |
| 95 | return CanDrawPath::kAsBackup; |
| 96 | } |
| 97 | |
| 98 | return CanDrawPath::kYes; |
| 99 | } |
| 100 | |
| 101 | case SkStrokeRec::kStroke_Style: |
| 102 | if (!args.fViewMatrix->isSimilarity()) { |
| 103 | // The stroker currently only supports rigid-body transfoms for the stroke lines |
| 104 | // themselves. This limitation doesn't affect hairlines since their stroke lines are |
| 105 | // defined relative to device space. |
| 106 | return CanDrawPath::kNo; |
| 107 | } |
| 108 | // fallthru |
Chris Dalton | 82de18f | 2018-09-12 17:24:09 -0600 | [diff] [blame] | 109 | case SkStrokeRec::kHairline_Style: { |
| 110 | float inflationRadius; |
| 111 | GetStrokeDevWidth(*args.fViewMatrix, stroke, &inflationRadius); |
| 112 | if (!(inflationRadius <= kMaxBoundsInflationFromStroke)) { |
| 113 | // Let extremely wide strokes be converted to fill paths and drawn by the CCPR |
| 114 | // filler instead. (Cast the logic negatively in order to also catch r=NaN.) |
| 115 | return CanDrawPath::kNo; |
| 116 | } |
| 117 | SkASSERT(!SkScalarIsNaN(inflationRadius)); |
| 118 | if (SkPathPriv::ConicWeightCnt(path)) { |
| 119 | // The stroker does not support conics yet. |
| 120 | return CanDrawPath::kNo; |
| 121 | } |
| 122 | return CanDrawPath::kYes; |
| 123 | } |
Chris Dalton | 09a7bb2 | 2018-08-31 19:53:15 +0800 | [diff] [blame] | 124 | |
| 125 | case SkStrokeRec::kStrokeAndFill_Style: |
| 126 | return CanDrawPath::kNo; |
Chris Dalton | db91c6e | 2017-09-08 16:25:08 -0600 | [diff] [blame] | 127 | } |
| 128 | |
Chris Dalton | 09a7bb2 | 2018-08-31 19:53:15 +0800 | [diff] [blame] | 129 | SK_ABORT("Invalid stroke style."); |
| 130 | return CanDrawPath::kNo; |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 131 | } |
| 132 | |
| 133 | bool GrCoverageCountingPathRenderer::onDrawPath(const DrawPathArgs& args) { |
| 134 | SkASSERT(!fFlushing); |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 135 | |
Chris Dalton | 5ba36ba | 2018-05-09 01:08:38 -0600 | [diff] [blame] | 136 | SkIRect clipIBounds; |
| 137 | GrRenderTargetContext* rtc = args.fRenderTargetContext; |
| 138 | args.fClip->getConservativeBounds(rtc->width(), rtc->height(), &clipIBounds, nullptr); |
| 139 | |
Chris Dalton | 09a7bb2 | 2018-08-31 19:53:15 +0800 | [diff] [blame] | 140 | auto op = GrCCDrawPathsOp::Make(args.fContext, clipIBounds, *args.fViewMatrix, *args.fShape, |
| 141 | std::move(args.fPaint)); |
Chris Dalton | 42c2115 | 2018-06-13 15:28:19 -0600 | [diff] [blame] | 142 | this->recordOp(std::move(op), args); |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 143 | return true; |
| 144 | } |
| 145 | |
Chris Dalton | 42c2115 | 2018-06-13 15:28:19 -0600 | [diff] [blame] | 146 | void GrCoverageCountingPathRenderer::recordOp(std::unique_ptr<GrCCDrawPathsOp> opHolder, |
| 147 | const DrawPathArgs& args) { |
| 148 | if (GrCCDrawPathsOp* op = opHolder.get()) { |
| 149 | GrRenderTargetContext* rtc = args.fRenderTargetContext; |
| 150 | if (uint32_t opListID = rtc->addDrawOp(*args.fClip, std::move(opHolder))) { |
Chris Dalton | b68bcc4 | 2018-09-14 00:44:22 -0600 | [diff] [blame^] | 151 | op->wasRecorded(sk_ref_sp(this->lookupPendingPaths(opListID))); |
Chris Dalton | 42c2115 | 2018-06-13 15:28:19 -0600 | [diff] [blame] | 152 | } |
| 153 | } |
| 154 | } |
| 155 | |
Chris Dalton | 383a2ef | 2018-01-08 17:21:41 -0500 | [diff] [blame] | 156 | std::unique_ptr<GrFragmentProcessor> GrCoverageCountingPathRenderer::makeClipProcessor( |
Chris Dalton | 4c458b1 | 2018-06-16 17:22:59 -0600 | [diff] [blame] | 157 | uint32_t opListID, const SkPath& deviceSpacePath, const SkIRect& accessRect, int rtWidth, |
| 158 | int rtHeight, const GrCaps& caps) { |
Chris Dalton | 383a2ef | 2018-01-08 17:21:41 -0500 | [diff] [blame] | 159 | using MustCheckBounds = GrCCClipProcessor::MustCheckBounds; |
Chris Dalton | a32a3c3 | 2017-12-05 10:05:21 -0700 | [diff] [blame] | 160 | |
| 161 | SkASSERT(!fFlushing); |
Chris Dalton | a32a3c3 | 2017-12-05 10:05:21 -0700 | [diff] [blame] | 162 | |
Chris Dalton | 5ba36ba | 2018-05-09 01:08:38 -0600 | [diff] [blame] | 163 | GrCCClipPath& clipPath = |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 164 | this->lookupPendingPaths(opListID)->fClipPaths[deviceSpacePath.getGenerationID()]; |
Chris Dalton | 5ba36ba | 2018-05-09 01:08:38 -0600 | [diff] [blame] | 165 | if (!clipPath.isInitialized()) { |
Chris Dalton | a32a3c3 | 2017-12-05 10:05:21 -0700 | [diff] [blame] | 166 | // This ClipPath was just created during lookup. Initialize it. |
Chris Dalton | 5ba36ba | 2018-05-09 01:08:38 -0600 | [diff] [blame] | 167 | const SkRect& pathDevBounds = deviceSpacePath.getBounds(); |
| 168 | if (SkTMax(pathDevBounds.height(), pathDevBounds.width()) > kPathCropThreshold) { |
| 169 | // The path is too large. Crop it or analytic AA can run out of fp32 precision. |
| 170 | SkPath croppedPath; |
Chris Dalton | 4c458b1 | 2018-06-16 17:22:59 -0600 | [diff] [blame] | 171 | int maxRTSize = caps.maxRenderTargetSize(); |
Chris Dalton | 09a7bb2 | 2018-08-31 19:53:15 +0800 | [diff] [blame] | 172 | CropPath(deviceSpacePath, SkIRect::MakeWH(maxRTSize, maxRTSize), &croppedPath); |
Chris Dalton | 4c458b1 | 2018-06-16 17:22:59 -0600 | [diff] [blame] | 173 | clipPath.init(croppedPath, accessRect, rtWidth, rtHeight, caps); |
Chris Dalton | 5ba36ba | 2018-05-09 01:08:38 -0600 | [diff] [blame] | 174 | } else { |
Chris Dalton | 4c458b1 | 2018-06-16 17:22:59 -0600 | [diff] [blame] | 175 | clipPath.init(deviceSpacePath, accessRect, rtWidth, rtHeight, caps); |
Chris Dalton | 5ba36ba | 2018-05-09 01:08:38 -0600 | [diff] [blame] | 176 | } |
Chris Dalton | a32a3c3 | 2017-12-05 10:05:21 -0700 | [diff] [blame] | 177 | } else { |
| 178 | clipPath.addAccess(accessRect); |
| 179 | } |
| 180 | |
| 181 | bool mustCheckBounds = !clipPath.pathDevIBounds().contains(accessRect); |
Chris Dalton | 383a2ef | 2018-01-08 17:21:41 -0500 | [diff] [blame] | 182 | return skstd::make_unique<GrCCClipProcessor>(&clipPath, MustCheckBounds(mustCheckBounds), |
| 183 | deviceSpacePath.getFillType()); |
Chris Dalton | a32a3c3 | 2017-12-05 10:05:21 -0700 | [diff] [blame] | 184 | } |
| 185 | |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 186 | void GrCoverageCountingPathRenderer::preFlush(GrOnFlushResourceProvider* onFlushRP, |
| 187 | const uint32_t* opListIDs, int numOpListIDs, |
Chris Dalton | 9414c96 | 2018-06-14 10:14:50 -0600 | [diff] [blame] | 188 | SkTArray<sk_sp<GrRenderTargetContext>>* out) { |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 189 | using DoCopiesToCache = GrCCDrawPathsOp::DoCopiesToCache; |
Chris Dalton | a32a3c3 | 2017-12-05 10:05:21 -0700 | [diff] [blame] | 190 | SkASSERT(!fFlushing); |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 191 | SkASSERT(fFlushingPaths.empty()); |
Chris Dalton | 383a2ef | 2018-01-08 17:21:41 -0500 | [diff] [blame] | 192 | SkDEBUGCODE(fFlushing = true); |
Chris Dalton | a32a3c3 | 2017-12-05 10:05:21 -0700 | [diff] [blame] | 193 | |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 194 | // Dig up the stashed atlas from the previous flush (if any) so we can attempt to copy any |
| 195 | // reusable paths out of it and into the resource cache. We also need to clear its unique key. |
| 196 | sk_sp<GrTextureProxy> stashedAtlasProxy; |
| 197 | if (fStashedAtlasKey.isValid()) { |
| 198 | stashedAtlasProxy = onFlushRP->findOrCreateProxyByUniqueKey(fStashedAtlasKey, |
| 199 | GrCCAtlas::kTextureOrigin); |
| 200 | if (stashedAtlasProxy) { |
| 201 | // Instantiate the proxy so we can clear the underlying texture's unique key. |
| 202 | onFlushRP->instatiateProxy(stashedAtlasProxy.get()); |
| 203 | onFlushRP->removeUniqueKeyFromProxy(fStashedAtlasKey, stashedAtlasProxy.get()); |
| 204 | } else { |
| 205 | fStashedAtlasKey.reset(); // Indicate there is no stashed atlas to copy from. |
| 206 | } |
| 207 | } |
| 208 | |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 209 | if (fPendingPaths.empty()) { |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 210 | fStashedAtlasKey.reset(); |
Chris Dalton | 383a2ef | 2018-01-08 17:21:41 -0500 | [diff] [blame] | 211 | return; // Nothing to draw. |
Chris Dalton | a32a3c3 | 2017-12-05 10:05:21 -0700 | [diff] [blame] | 212 | } |
Chris Dalton | c1e5963 | 2017-09-05 00:30:07 -0600 | [diff] [blame] | 213 | |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 214 | GrCCPerFlushResourceSpecs specs; |
Chris Dalton | 42c2115 | 2018-06-13 15:28:19 -0600 | [diff] [blame] | 215 | int maxPreferredRTSize = onFlushRP->caps()->maxPreferredRenderTargetSize(); |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 216 | specs.fCopyAtlasSpecs.fMaxPreferredTextureSize = SkTMin(2048, maxPreferredRTSize); |
| 217 | SkASSERT(0 == specs.fCopyAtlasSpecs.fMinTextureSize); |
| 218 | specs.fRenderedAtlasSpecs.fMaxPreferredTextureSize = maxPreferredRTSize; |
Chris Dalton | a2b5b64 | 2018-06-24 13:08:57 -0600 | [diff] [blame] | 219 | specs.fRenderedAtlasSpecs.fMinTextureSize = SkTMin(512, maxPreferredRTSize); |
Chris Dalton | 42c2115 | 2018-06-13 15:28:19 -0600 | [diff] [blame] | 220 | |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 221 | // Move the per-opList paths that are about to be flushed from fPendingPaths to fFlushingPaths, |
Chris Dalton | 42c2115 | 2018-06-13 15:28:19 -0600 | [diff] [blame] | 222 | // and count them up so we can preallocate buffers. |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 223 | fFlushingPaths.reserve(numOpListIDs); |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 224 | for (int i = 0; i < numOpListIDs; ++i) { |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 225 | auto iter = fPendingPaths.find(opListIDs[i]); |
| 226 | if (fPendingPaths.end() == iter) { |
| 227 | continue; // No paths on this opList. |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 228 | } |
Chris Dalton | a32a3c3 | 2017-12-05 10:05:21 -0700 | [diff] [blame] | 229 | |
tzik | bdb4956 | 2018-05-28 14:58:00 +0900 | [diff] [blame] | 230 | fFlushingPaths.push_back(std::move(iter->second)); |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 231 | fPendingPaths.erase(iter); |
| 232 | |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 233 | for (GrCCDrawPathsOp* op : fFlushingPaths.back()->fDrawOps) { |
Chris Dalton | a2b5b64 | 2018-06-24 13:08:57 -0600 | [diff] [blame] | 234 | op->accountForOwnPaths(fPathCache.get(), onFlushRP, fStashedAtlasKey, &specs); |
Chris Dalton | 080baa4 | 2017-11-06 14:19:19 -0700 | [diff] [blame] | 235 | } |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 236 | for (const auto& clipsIter : fFlushingPaths.back()->fClipPaths) { |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 237 | clipsIter.second.accountForOwnPath(&specs); |
Chris Dalton | a32a3c3 | 2017-12-05 10:05:21 -0700 | [diff] [blame] | 238 | } |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 239 | } |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 240 | fStashedAtlasKey.reset(); |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 241 | |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 242 | if (specs.isEmpty()) { |
Chris Dalton | 383a2ef | 2018-01-08 17:21:41 -0500 | [diff] [blame] | 243 | return; // Nothing to draw. |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 244 | } |
| 245 | |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 246 | // Determine if there are enough reusable paths from last flush for it to be worth our time to |
| 247 | // copy them to cached atlas(es). |
Chris Dalton | 09a7bb2 | 2018-08-31 19:53:15 +0800 | [diff] [blame] | 248 | int numCopies = specs.fNumCopiedPaths[GrCCPerFlushResourceSpecs::kFillIdx] + |
| 249 | specs.fNumCopiedPaths[GrCCPerFlushResourceSpecs::kStrokeIdx]; |
| 250 | DoCopiesToCache doCopies = DoCopiesToCache(numCopies > 100 || |
Chris Dalton | a2b5b64 | 2018-06-24 13:08:57 -0600 | [diff] [blame] | 251 | specs.fCopyAtlasSpecs.fApproxNumPixels > 256 * 256); |
Chris Dalton | 09a7bb2 | 2018-08-31 19:53:15 +0800 | [diff] [blame] | 252 | if (numCopies && DoCopiesToCache::kNo == doCopies) { |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 253 | specs.convertCopiesToRenders(); |
Chris Dalton | 09a7bb2 | 2018-08-31 19:53:15 +0800 | [diff] [blame] | 254 | SkASSERT(!specs.fNumCopiedPaths[GrCCPerFlushResourceSpecs::kFillIdx]); |
| 255 | SkASSERT(!specs.fNumCopiedPaths[GrCCPerFlushResourceSpecs::kStrokeIdx]); |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 256 | } |
| 257 | |
| 258 | auto resources = sk_make_sp<GrCCPerFlushResources>(onFlushRP, specs); |
Chris Dalton | 5ba36ba | 2018-05-09 01:08:38 -0600 | [diff] [blame] | 259 | if (!resources->isMapped()) { |
| 260 | return; // Some allocation failed. |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 261 | } |
| 262 | |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 263 | // Layout the atlas(es) and parse paths. |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 264 | for (const auto& flushingPaths : fFlushingPaths) { |
| 265 | for (GrCCDrawPathsOp* op : flushingPaths->fDrawOps) { |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 266 | op->setupResources(onFlushRP, resources.get(), doCopies); |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 267 | } |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 268 | for (auto& clipsIter : flushingPaths->fClipPaths) { |
Chris Dalton | daef06a | 2018-05-23 17:11:09 -0600 | [diff] [blame] | 269 | clipsIter.second.renderPathInAtlas(resources.get(), onFlushRP); |
Chris Dalton | c1e5963 | 2017-09-05 00:30:07 -0600 | [diff] [blame] | 270 | } |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 271 | } |
| 272 | |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 273 | // Allocate resources and then render the atlas(es). |
| 274 | if (!resources->finalize(onFlushRP, std::move(stashedAtlasProxy), out)) { |
Chris Dalton | c1e5963 | 2017-09-05 00:30:07 -0600 | [diff] [blame] | 275 | return; |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 276 | } |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 277 | // Verify the stashed atlas got released so its texture could be recycled. |
| 278 | SkASSERT(!stashedAtlasProxy); |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 279 | |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 280 | // Commit flushing paths to the resources once they are successfully completed. |
| 281 | for (auto& flushingPaths : fFlushingPaths) { |
Robert Phillips | 774168e | 2018-05-31 12:43:27 -0400 | [diff] [blame] | 282 | SkASSERT(!flushingPaths->fFlushResources); |
Chris Dalton | d7e2227 | 2018-05-23 10:17:17 -0600 | [diff] [blame] | 283 | flushingPaths->fFlushResources = resources; |
| 284 | } |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 285 | } |
| 286 | |
Chris Dalton | 3968ff9 | 2017-11-27 12:26:31 -0700 | [diff] [blame] | 287 | void GrCoverageCountingPathRenderer::postFlush(GrDeferredUploadToken, const uint32_t* opListIDs, |
| 288 | int numOpListIDs) { |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 289 | SkASSERT(fFlushing); |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 290 | SkASSERT(!fStashedAtlasKey.isValid()); // Should have been cleared in preFlush(). |
Robert Phillips | 774168e | 2018-05-31 12:43:27 -0400 | [diff] [blame] | 291 | |
Chris Dalton | 4da7019 | 2018-06-18 09:51:36 -0600 | [diff] [blame] | 292 | if (!fFlushingPaths.empty()) { |
| 293 | // Note the stashed atlas's key for next flush, if any. |
| 294 | auto resources = fFlushingPaths.front()->fFlushResources.get(); |
| 295 | if (resources && resources->hasStashedAtlas()) { |
| 296 | fStashedAtlasKey = resources->stashedAtlasKey(); |
| 297 | } |
| 298 | |
| 299 | // In DDL mode these aren't guaranteed to be deleted so we must clear out the perFlush |
| 300 | // resources manually. |
| 301 | for (auto& flushingPaths : fFlushingPaths) { |
| 302 | flushingPaths->fFlushResources = nullptr; |
| 303 | } |
| 304 | |
| 305 | // We wait to erase these until after flush, once Ops and FPs are done accessing their data. |
| 306 | fFlushingPaths.reset(); |
Robert Phillips | 774168e | 2018-05-31 12:43:27 -0400 | [diff] [blame] | 307 | } |
| 308 | |
Chris Dalton | 383a2ef | 2018-01-08 17:21:41 -0500 | [diff] [blame] | 309 | SkDEBUGCODE(fFlushing = false); |
Chris Dalton | 1a325d2 | 2017-07-14 15:17:41 -0600 | [diff] [blame] | 310 | } |
Chris Dalton | 09a7bb2 | 2018-08-31 19:53:15 +0800 | [diff] [blame] | 311 | |
| 312 | void GrCoverageCountingPathRenderer::CropPath(const SkPath& path, const SkIRect& cropbox, |
| 313 | SkPath* out) { |
| 314 | SkPath cropboxPath; |
| 315 | cropboxPath.addRect(SkRect::Make(cropbox)); |
| 316 | if (!Op(cropboxPath, path, kIntersect_SkPathOp, out)) { |
| 317 | // This can fail if the PathOps encounter NaN or infinities. |
| 318 | out->reset(); |
| 319 | } |
| 320 | out->setIsVolatile(true); |
| 321 | } |
Chris Dalton | 82de18f | 2018-09-12 17:24:09 -0600 | [diff] [blame] | 322 | |
| 323 | float GrCoverageCountingPathRenderer::GetStrokeDevWidth(const SkMatrix& m, |
| 324 | const SkStrokeRec& stroke, |
| 325 | float* inflationRadius) { |
| 326 | float strokeDevWidth; |
| 327 | if (stroke.isHairlineStyle()) { |
| 328 | strokeDevWidth = 1; |
| 329 | } else { |
| 330 | SkASSERT(SkStrokeRec::kStroke_Style == stroke.getStyle()); |
| 331 | SkASSERT(m.isSimilarity()); // Otherwise matrixScaleFactor = m.getMaxScale(). |
| 332 | float matrixScaleFactor = SkVector::Length(m.getScaleX(), m.getSkewY()); |
| 333 | strokeDevWidth = stroke.getWidth() * matrixScaleFactor; |
| 334 | } |
| 335 | if (inflationRadius) { |
| 336 | // Inflate for a minimum stroke width of 1. In some cases when the stroke is less than 1px |
| 337 | // wide, we may inflate it to 1px and instead reduce the opacity. |
| 338 | *inflationRadius = SkStrokeRec::GetInflationRadius( |
| 339 | stroke.getJoin(), stroke.getMiter(), stroke.getCap(), SkTMax(strokeDevWidth, 1.f)); |
| 340 | } |
| 341 | return strokeDevWidth; |
| 342 | } |