Searched refs:chainA (Results 1 – 2 of 2) sorted by relevance
| /external/skia/src/gpu/ |
| D | GrRenderTargetOpList.cpp | 158 List chainA, List chainB, const GrCaps& caps, GrOpMemoryPool* pool, in DoConcat() argument
170 GrOp* origATail = chainA.tail(); in DoConcat()
175 bool noSkip = (origATail == chainA.tail()); in DoConcat()
182 (a == chainA.tail()) || can_reorder(a->bounds(), forwardMergeBounds); in DoConcat()
202 std::unique_ptr<GrOp> detachedA = chainA.removeOp(a); in DoConcat()
205 if (chainA.empty()) { in DoConcat()
224 chainA.pushTail(chainB.popHead()); in DoConcat()
225 skipBounds.joinNonEmptyArg(chainA.tail()->bounds()); in DoConcat()
228 return chainA; in DoConcat()
|
| /external/skqp/src/gpu/ |
| D | GrRenderTargetOpList.cpp | 156 List chainA, List chainB, const GrCaps& caps, GrOpMemoryPool* pool, in DoConcat() argument
168 GrOp* origATail = chainA.tail(); in DoConcat()
173 bool noSkip = (origATail == chainA.tail()); in DoConcat()
180 (a == chainA.tail()) || can_reorder(a->bounds(), forwardMergeBounds); in DoConcat()
200 std::unique_ptr<GrOp> detachedA = chainA.removeOp(a); in DoConcat()
203 if (chainA.empty()) { in DoConcat()
222 chainA.pushTail(chainB.popHead()); in DoConcat()
223 skipBounds.joinNonEmptyArg(chainA.tail()->bounds()); in DoConcat()
226 return chainA; in DoConcat()
|