Searched refs:fBlocks (Results 1 – 6 of 6) sorted by relevance
44 : fBlocks(8) { in GrBufferAllocPool()58 if (fBlocks.count()) { in deleteBlocks()59 GrBuffer* buffer = fBlocks.back().fBuffer; in deleteBlocks()61 UNMAP_BUFFER(fBlocks.back()); in deleteBlocks()64 while (!fBlocks.empty()) { in deleteBlocks()89 BufferBlock& block = fBlocks.back(); in unmap()94 this->flushCpuData(fBlocks.back(), flushSize); in unmap()105 SkASSERT(!fBlocks.empty()); in validate()106 if (fBlocks.back().fBuffer->isMapped()) { in validate()107 GrBuffer* buf = fBlocks.back().fBuffer; in validate()[all …]
41 fBlocks.push_back() = initialBlock; in GrAllocator()54 fBlocks.push_back() = sk_malloc_throw(fBlockSize); in push_back()57 void* ret = (char*)fBlocks.back() + fItemSize * fInsertionIndexInBlock; in push_back()73 if (fBlocks.count() > 1) { in pop_back()74 sk_free(fBlocks.back()); in pop_back()75 fBlocks.pop_back(); in pop_back()86 for (int i = firstBlockToFree; i < fBlocks.count(); ++i) { in reset()87 sk_free(fBlocks[i]); in reset()90 fBlocks.reset(); in reset()94 fBlocks.pop_back_n(fBlocks.count() - 1); in reset()[all …]
143 SkTArray<BufferBlock> fBlocks; variable
31 BlockId result = fBlocks.size(); in newBlock()32 fBlocks.emplace_back(); in newBlock()33 if (fBlocks.size() > 1) { in newBlock()41 BlockId result = fBlocks.size(); in newIsolatedBlock()42 fBlocks.emplace_back(); in newIsolatedBlock()47 if (from == 0 || fBlocks[from].fEntrances.size()) { in addExit()48 fBlocks[from].fExits.insert(to); in addExit()49 fBlocks[to].fEntrances.insert(from); in addExit()54 for (size_t i = 0; i < fBlocks.size(); i++) { in dump()57 for (auto iter = fBlocks[i].fBefore.begin(); iter != fBlocks[i].fBefore.end(); iter++) { in dump()[all …]
289 BasicBlock& block = cfg->fBlocks[blockId]; in scanCFG()299 BasicBlock& exit = cfg->fBlocks[exitId]; in scanCFG()329 for (const auto& block : cfg.fBlocks) { in compute_start_state()380 cfg->fBlocks[cfg->fStart].fBefore = compute_start_state(*cfg); in computeDataFlow()382 for (BlockId i = 0; i < cfg->fBlocks.size(); i++) { in computeDataFlow()991 for (size_t i = 0; i < cfg.fBlocks.size(); i++) { in scanCFG()992 if (i != cfg.fStart && !cfg.fBlocks[i].fEntrances.size() && in scanCFG()993 cfg.fBlocks[i].fNodes.size()) { in scanCFG()995 switch (cfg.fBlocks[i].fNodes[0].fKind) { in scanCFG()997 p = (*cfg.fBlocks[i].fNodes[0].statement())->fPosition; in scanCFG()[all …]
123 std::vector<BasicBlock> fBlocks; member