| /external/skia/src/gpu/ |
| H A D | GrBufferAllocPool.cpp | 43 : fBlocks(8) {
57 if (fBlocks.count()) {
58 GrBuffer* buffer = fBlocks.back().fBuffer;
60 UNMAP_BUFFER(fBlocks.back());
63 while (!fBlocks.empty()) {
88 BufferBlock& block = fBlocks.back();
93 this->flushCpuData(fBlocks.back(), flushSize);
104 SkASSERT(!fBlocks.empty());
105 if (fBlocks.back().fBuffer->isMapped()) {
106 GrBuffer* buf = fBlocks
[all...] |
| H A D | GrAllocator.h | 41 fBlocks.push_back() = initialBlock;
54 fBlocks.push_back() = sk_malloc_throw(fBlockSize);
57 void* ret = (char*)fBlocks.back() + fItemSize * fInsertionIndexInBlock;
73 if (fBlocks.count() > 1) {
74 sk_free(fBlocks.back());
75 fBlocks.pop_back();
86 for (int i = firstBlockToFree; i < fBlocks.count(); ++i) {
87 sk_free(fBlocks[i]);
90 fBlocks.reset();
94 fBlocks
216 SkSTArray<NUM_INIT_BLOCK_PTRS, void*, true> fBlocks; member in class:GrAllocator
[all...] |
| H A D | GrBufferAllocPool.h | 143 SkTArray<BufferBlock> fBlocks; member in class:GrBufferAllocPool
|
| /external/skqp/src/gpu/ |
| H A D | GrBufferAllocPool.cpp | 43 : fBlocks(8) {
57 if (fBlocks.count()) {
58 GrBuffer* buffer = fBlocks.back().fBuffer;
60 UNMAP_BUFFER(fBlocks.back());
63 while (!fBlocks.empty()) {
88 BufferBlock& block = fBlocks.back();
93 this->flushCpuData(fBlocks.back(), flushSize);
104 SkASSERT(!fBlocks.empty());
105 if (fBlocks.back().fBuffer->isMapped()) {
106 GrBuffer* buf = fBlocks
[all...] |
| H A D | GrAllocator.h | 41 fBlocks.push_back() = initialBlock;
54 fBlocks.push_back() = sk_malloc_throw(fBlockSize);
57 void* ret = (char*)fBlocks.back() + fItemSize * fInsertionIndexInBlock;
73 if (fBlocks.count() > 1) {
74 sk_free(fBlocks.back());
75 fBlocks.pop_back();
86 for (int i = firstBlockToFree; i < fBlocks.count(); ++i) {
87 sk_free(fBlocks[i]);
90 fBlocks.reset();
94 fBlocks
216 SkSTArray<NUM_INIT_BLOCK_PTRS, void*, true> fBlocks; member in class:GrAllocator
[all...] |
| H A D | GrBufferAllocPool.h | 143 SkTArray<BufferBlock> fBlocks; member in class:GrBufferAllocPool
|
| /external/skia/src/sksl/ |
| H A D | SkSLCFGGenerator.cpp | 31 BlockId result = fBlocks.size();
32 fBlocks.emplace_back();
33 if (fBlocks.size() > 1) {
41 BlockId result = fBlocks.size();
42 fBlocks.emplace_back();
47 if (from == 0 || fBlocks[from].fEntrances.size()) {
48 fBlocks[from].fExits.insert(to);
49 fBlocks[to].fEntrances.insert(from);
54 for (size_t i = 0; i < fBlocks.size(); i++) {
57 for (auto iter = fBlocks[
[all...] |
| H A D | SkSLCFGGenerator.h | 19 // index of a block within CFG.fBlocks
123 std::vector<BasicBlock> fBlocks; member in struct:SkSL::CFG
|
| H A D | SkSLCompiler.cpp | 336 BasicBlock& block = cfg->fBlocks[blockId];
346 BasicBlock& exit = cfg->fBlocks[exitId];
376 for (const auto& block : cfg.fBlocks) {
431 cfg->fBlocks[cfg->fStart].fBefore = compute_start_state(*cfg);
433 for (BlockId i = 0; i < cfg->fBlocks.size(); i++) {
1053 for (size_t i = 0; i < cfg.fBlocks.size(); i++) {
1054 if (i != cfg.fStart && !cfg.fBlocks[i].fEntrances.size() &&
1055 cfg.fBlocks[i].fNodes.size()) {
1057 switch (cfg.fBlocks[i].fNodes[0].fKind) {
1059 offset = (*cfg.fBlocks[
[all...] |
| /external/skqp/src/sksl/ |
| H A D | SkSLCFGGenerator.cpp | 31 BlockId result = fBlocks.size();
32 fBlocks.emplace_back();
33 if (fBlocks.size() > 1) {
41 BlockId result = fBlocks.size();
42 fBlocks.emplace_back();
47 if (from == 0 || fBlocks[from].fEntrances.size()) {
48 fBlocks[from].fExits.insert(to);
49 fBlocks[to].fEntrances.insert(from);
54 for (size_t i = 0; i < fBlocks.size(); i++) {
57 for (auto iter = fBlocks[
[all...] |
| H A D | SkSLCFGGenerator.h | 19 // index of a block within CFG.fBlocks
123 std::vector<BasicBlock> fBlocks; member in struct:SkSL::CFG
|
| H A D | SkSLCompiler.cpp | 336 BasicBlock& block = cfg->fBlocks[blockId];
346 BasicBlock& exit = cfg->fBlocks[exitId];
376 for (const auto& block : cfg.fBlocks) {
431 cfg->fBlocks[cfg->fStart].fBefore = compute_start_state(*cfg);
433 for (BlockId i = 0; i < cfg->fBlocks.size(); i++) {
1053 for (size_t i = 0; i < cfg.fBlocks.size(); i++) {
1054 if (i != cfg.fStart && !cfg.fBlocks[i].fEntrances.size() &&
1055 cfg.fBlocks[i].fNodes.size()) {
1057 switch (cfg.fBlocks[i].fNodes[0].fKind) {
1059 offset = (*cfg.fBlocks[
[all...] |
| /external/skia/tools/trace/ |
| H A D | SkChromeTracingTracer.h | 76 SkTArray<TraceEventBlock> fBlocks; member in class:SkChromeTracingTracer
|
| H A D | SkChromeTracingTracer.cpp | 76 fBlocks.push_back(std::move(fCurBlock));
302 if (fBlocks.count() > 0) {
303 clockOffset = reinterpret_cast<TraceEvent*>(fBlocks[0].fBlock.get())->fClockBegin;
319 for (int i = 0; i < fBlocks.count(); ++i) {
320 event_block_to_json(&writer, fBlocks[i], &serializationState);
|
| /external/skqp/tools/trace/ |
| H A D | SkChromeTracingTracer.h | 76 SkTArray<TraceEventBlock> fBlocks; member in class:SkChromeTracingTracer
|
| H A D | SkChromeTracingTracer.cpp | 76 fBlocks.push_back(std::move(fCurBlock));
302 if (fBlocks.count() > 0) {
303 clockOffset = reinterpret_cast<TraceEvent*>(fBlocks[0].fBlock.get())->fClockBegin;
319 for (int i = 0; i < fBlocks.count(); ++i) {
320 event_block_to_json(&writer, fBlocks[i], &serializationState);
|