Lines Matching refs:fOpChains
404 for (auto& chain : fOpChains) {
407 fOpChains.reset();
481 for (const auto& chain : fOpChains) {
511 for (const auto& chain : fOpChains) {
651 for (const auto& chain : fOpChains) {
739 addlOpChainCount += toMerge->fOpChains.count();
762 fOpChains.reserve_back(addlOpChainCount);
774 fOpChains.move_back_n(toMerge->fOpChains.count(),
775 toMerge->fOpChains.data());
778 toMerge->fOpChains.reset();
849 SkDebugf("%s%d ops:\n", indent.c_str(), fOpChains.count());
850 for (int i = 0; i < fOpChains.count(); ++i) {
852 if (!fOpChains[i].head()) {
855 SkDebugf("%s%d: %s\n", indent.c_str(), i, fOpChains[i].head()->name());
856 SkRect bounds = fOpChains[i].bounds();
860 for (const auto& op : GrOp::ChainRange<>(fOpChains[i].head())) {
884 for (const OpChain& chain : fOpChains) {
941 if (fOpChains.count()) {
944 alloc->addInterval(targetProxy, cur, cur + fOpChains.count() - 1,
963 for (const OpChain& recordedOp : fOpChains) {
1012 int maxCandidates = std::min(kMaxOpChainDistance, fOpChains.count());
1016 OpChain& candidate = fOpChains.fromBack(i);
1040 fOpChains.emplace_back(std::move(op), processorAnalysis, clip, dstProxyView);
1045 GrOP_INFO("opsTask: %d ForwardCombine %d ops:\n", this->uniqueID(), fOpChains.count());
1047 for (int i = 0; i < fOpChains.count() - 1; ++i) {
1048 OpChain& chain = fOpChains[i];
1049 int maxCandidateIdx = std::min(i + kMaxOpChainDistance, fOpChains.count() - 1);
1052 OpChain& candidate = fOpChains[j];