Searched refs:prevInChain (Results 1 – 7 of 7) sorted by relevance
54 SkASSERT(op == this || (op->prevInChain() && op->prevInChain()->nextInChain() == op)); in validateChain()57 SkASSERT(op->nextInChain()->prevInChain() == op); in validateChain()
776 for (const GrOp* tmp = this->prevInChain(); tmp; tmp = tmp->prevInChain()) { in validate()860 for (const GrOp* tmp = this->prevInChain(); tmp; tmp = tmp->prevInChain()) { in numChainedQuads()953 for (GrOp* tmp = this->prevInChain(); tmp; tmp = tmp->prevInChain()) { in propagateCoverageAAThroughoutChain()
247 GrOp* prevInChain() const { return fPrevInChain; } in prevInChain() function
68 SkASSERT(op == this || (op->prevInChain() && op->prevInChain()->nextInChain() == op)); in validateChain()71 SkASSERT(op->nextInChain()->prevInChain() == op); in validateChain()
237 GrOp* prevInChain() const { return fPrevInChain; } in prevInChain() function
69 while (head->prevInChain()) { head = head->prevInChain(); } in removeOp()72 auto prev = op->prevInChain(); in removeOp()198 origATail = a->prevInChain(); in DoConcat()216 a = a->prevInChain(); in DoConcat()
74 while (head->prevInChain()) { head = head->prevInChain(); } in removeOp()77 auto prev = op->prevInChain(); in removeOp()204 origATail = a->prevInChain(); in DoConcat()223 a = a->prevInChain(); in DoConcat()