| /external/chromium_org/gpu/command_buffer/client/ |
| D | fenced_allocator.cc | 43 blocks_.push_back(block); in FencedAllocator()
48 for (unsigned int i = 0; i < blocks_.size(); ++i) { in ~FencedAllocator()
49 if (blocks_[i].state == FREE_PENDING_TOKEN) { in ~FencedAllocator()
54 DCHECK_EQ(blocks_.size(), 1u); in ~FencedAllocator()
55 DCHECK_EQ(blocks_[0].state, FREE); in ~FencedAllocator()
74 for (unsigned int i = 0; i < blocks_.size(); ++i) { in Alloc()
75 Block &block = blocks_[i]; in Alloc()
83 for (unsigned int i = 0; i < blocks_.size(); ++i) { in Alloc()
84 if (blocks_[i].state != FREE_PENDING_TOKEN) in Alloc()
87 if (blocks_[i].size >= size) in Alloc()
[all …]
|
| D | ring_buffer.cc | 30 while (!blocks_.empty()) { in ~RingBuffer()
36 DCHECK(!blocks_.empty()) << "no free blocks"; in FreeOldestBlock()
37 Block& block = blocks_.front(); in FreeOldestBlock()
52 blocks_.pop_front(); in FreeOldestBlock()
57 DCHECK(blocks_.empty() || blocks_.back().state != IN_USE) in Alloc()
73 blocks_.push_back(Block(free_offset_, size_ - free_offset_, PADDING)); in Alloc()
78 blocks_.push_back(Block(offset, size, IN_USE)); in Alloc()
90 DCHECK(!blocks_.empty()) << "no allocations to free"; in FreePendingToken()
91 for (Container::reverse_iterator it = blocks_.rbegin(); in FreePendingToken()
92 it != blocks_.rend(); in FreePendingToken()
[all …]
|
| D | ring_buffer.h | 111 Container blocks_; variable
|
| D | fenced_allocator.h | 144 Container blocks_; variable
|
| /external/ceres-solver/internal/ceres/ |
| D | block_random_access_sparse_matrix.cc | 51 blocks_(blocks) { in BlockRandomAccessSparseMatrix()
58 for (int i = 0; i < blocks_.size(); ++i) { in BlockRandomAccessSparseMatrix()
60 num_cols += blocks_[i]; in BlockRandomAccessSparseMatrix()
70 const int row_block_size = blocks_[it->first]; in BlockRandomAccessSparseMatrix()
71 const int col_block_size = blocks_[it->second]; in BlockRandomAccessSparseMatrix()
89 const int row_block_size = blocks_[it->first]; in BlockRandomAccessSparseMatrix()
90 const int col_block_size = blocks_[it->second]; in BlockRandomAccessSparseMatrix()
102 const int row_block_size = blocks_[row_block_id]; in BlockRandomAccessSparseMatrix()
103 const int col_block_size = blocks_[col_block_id]; in BlockRandomAccessSparseMatrix()
143 *row_stride = blocks_[row_block_id]; in GetCell()
[all …]
|
| D | block_random_access_diagonal_matrix.cc | 49 : blocks_(blocks) { in BlockRandomAccessDiagonalMatrix()
55 for (int i = 0; i < blocks_.size(); ++i) { in BlockRandomAccessDiagonalMatrix()
57 num_cols += blocks_[i]; in BlockRandomAccessDiagonalMatrix()
58 num_nonzeros += blocks_[i] * blocks_[i]; in BlockRandomAccessDiagonalMatrix()
72 for (int i = 0; i < blocks_.size(); ++i) { in BlockRandomAccessDiagonalMatrix()
73 const int block_size = blocks_[i]; in BlockRandomAccessDiagonalMatrix()
100 const int stride = blocks_[row_block_id]; in GetCell()
|
| D | block_jacobi_preconditioner.cc | 55 blocks_.resize(block_structure_.cols.size()); in BlockJacobiPreconditioner()
62 blocks_[c] = block_cursor; in BlockJacobiPreconditioner()
85 MatrixRef(blocks_[cells[c].block_id], in UpdateImpl()
108 MatrixRef block(blocks_[c], size, size); in UpdateImpl()
127 ConstMatrixRef D(blocks_[c], size, size); in RightMultiply()
|
| D | schur_complement_solver.cc | 188 blocks_.resize(num_col_blocks - num_eliminate_blocks, 0); in InitStorage()
190 blocks_[i - num_eliminate_blocks] = bs->cols[i].size; in InitStorage()
194 for (int i = 0; i < blocks_.size(); ++i) { in InitStorage()
247 set_lhs(new BlockRandomAccessSparseMatrix(blocks_, block_pairs)); in InitStorage()
315 blocks_, in SolveReducedLinearSystemUsingSuiteSparse()
316 blocks_, in SolveReducedLinearSystemUsingSuiteSparse()
414 cxsparse_factor_ = cxsparse_.BlockAnalyzeCholesky(lhs, blocks_, blocks_); in SolveReducedLinearSystemUsingCXSparse()
|
| D | block_jacobi_preconditioner.h | 69 std::vector<double*> blocks_; variable
|
| D | block_random_access_diagonal_matrix.h | 83 const vector<int> blocks_;
|
| D | block_random_access_sparse_matrix.h | 93 const vector<int> blocks_; variable
|
| D | schur_complement_solver.h | 180 vector<int> blocks_; variable
|
| /external/chromium_org/net/tools/balsa/ |
| D | balsa_headers.cc | 107 for (Blocks::const_iterator iter = blocks_.begin(); in GetTotalBufferBlockSize()
108 iter != blocks_.end(); in GetTotalBufferBlockSize()
120 DCHECK_GE(blocks_.size(), 1u); in WriteToContiguousBuffer()
121 if (blocks_[0].buffer == NULL && sp.size() <= blocksize_) { in WriteToContiguousBuffer()
122 blocks_[0] = AllocBlock(); in WriteToContiguousBuffer()
123 memcpy(blocks_[0].start_of_unused_bytes(), sp.data(), sp.size()); in WriteToContiguousBuffer()
124 } else if (blocks_[0].bytes_free < sp.size()) { in WriteToContiguousBuffer()
126 const size_t old_storage_size_used = blocks_[0].bytes_used(); in WriteToContiguousBuffer()
129 char* old_storage = blocks_[0].buffer; in WriteToContiguousBuffer()
134 blocks_[0].buffer = new_storage; in WriteToContiguousBuffer()
[all …]
|
| D | balsa_headers.h | 105 DCHECK_LT(block_idx, blocks_.size()) in GetPtr()
106 << block_idx << ", " << blocks_.size(); in GetPtr()
107 return blocks_[block_idx].buffer; in GetPtr()
111 DCHECK_LT(block_idx, blocks_.size()) in GetPtr()
112 << block_idx << ", " << blocks_.size(); in GetPtr()
113 return blocks_[block_idx].buffer; in GetPtr()
166 return blocks_[0].buffer; in StartOfFirstBlock()
170 return blocks_[0].buffer + blocks_[0].bytes_used(); in EndOfFirstBlock()
177 Blocks::size_type num_blocks() const { return blocks_.size(); } in num_blocks()
178 size_t buffer_size(size_t idx) const { return blocks_[idx].buffer_size; } in buffer_size()
[all …]
|
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| D | arena.cc | 19 for (size_t i = 0; i < blocks_.size(); i++) { in ~Arena()
20 delete[] blocks_[i]; in ~Arena()
64 blocks_.push_back(result); in AllocateNewBlock()
|
| D | arena.h | 30 return blocks_memory_ + blocks_.capacity() * sizeof(char*); in MemoryUsage()
42 std::vector<char*> blocks_; variable
|
| /external/chromium_org/third_party/leveldatabase/src/helpers/memenv/ |
| D | memenv.cc | 70 *result = Slice(blocks_[block] + block_offset, n); in Read()
82 memcpy(dst, blocks_[block] + block_offset, avail); in Read()
107 blocks_.push_back(new char[kBlockSize]); in Append()
114 memcpy(blocks_.back() + offset, src, avail); in Append()
126 for (std::vector<char*>::iterator i = blocks_.begin(); i != blocks_.end(); in ~FileState()
142 std::vector<char*> blocks_; member in leveldb::__anonbe87b3830111::FileState
|
| /external/chromium_org/content/browser/ |
| D | browser_shutdown_profile_dumper.cc | 24 blocks_(0), in BrowserShutdownProfileDumper()
98 if (blocks_) { in WriteTraceDataCollected()
103 ++blocks_; in WriteTraceDataCollected()
|
| D | browser_shutdown_profile_dumper.h | 69 int blocks_; variable
|
| /external/chromium_org/v8/src/ |
| D | api.h | 472 List<Object**> blocks_; local
496 blocks_(0),
537 inline List<internal::Object**>* blocks() { return &blocks_; }
548 blocks_.Initialize(0);
557 DCHECK(blocks_.length() == 0);
560 blocks_.Free();
574 List<internal::Object**> blocks_; local
646 while (!blocks_.is_empty()) {
647 internal::Object** block_start = blocks_.last();
661 blocks_.RemoveLast();
[all …]
|
| D | global-handles.cc | 1000 for (int i = 0; i < blocks_.length(); i++) delete[] blocks_[i]; in ~EternalHandles()
1006 for (int i = 0; i < blocks_.length(); i++) { in IterateAllRoots()
1008 Object** block = blocks_[i]; in IterateAllRoots()
1045 blocks_.Add(next_block); in Create()
1047 DCHECK_EQ(isolate->heap()->the_hole_value(), blocks_[block][offset]); in Create()
1048 blocks_[block][offset] = object; in Create()
|
| D | global-handles.h | 364 return &blocks_[index >> kShift][index & kMask]; in GetLocation()
368 List<Object**> blocks_; variable
|
| D | hydrogen.cc | 510 blocks_.Add(block, block->zone()); in AddBlock()
571 for (int i = 0; i < blocks_.length(); i++) { in Verify()
572 HBasicBlock* block = blocks_.at(i); in Verify()
621 DCHECK(blocks_.at(0)->predecessors()->is_empty()); in Verify()
625 ReachabilityAnalyzer analyzer(entry_block_, blocks_.length(), NULL); in Verify()
626 DCHECK(analyzer.visited_count() == blocks_.length()); in Verify()
632 for (int i = 0; i < blocks_.length(); ++i) { in Verify()
633 HBasicBlock* block = blocks_.at(i); in Verify()
640 blocks_.length(), in Verify()
3420 blocks_(8, info->zone()), in HGraph()
[all …]
|
| D | hydrogen.h | 261 blocks_(8, zone), in HLoopInformation()
263 blocks_.Add(loop_header, zone); in HLoopInformation()
268 const ZoneList<HBasicBlock*>* blocks() const { return &blocks_; } in blocks()
297 ZoneList<HBasicBlock*> blocks_; variable
312 const ZoneList<HBasicBlock*>* blocks() const { return &blocks_; } in blocks()
488 ZoneList<HBasicBlock*> blocks_; variable
|
| D | api.cc | 7583 while (!blocks_.is_empty()) { in Detach()
7584 Object** block_start = blocks_.last(); in Detach()
7590 deferred->blocks_.Add(blocks_.last()); in Detach()
7591 blocks_.RemoveLast(); in Detach()
7598 DCHECK(prev_limit == NULL || !blocks_.is_empty()); in Detach()
7600 DCHECK(!blocks_.is_empty() && prev_limit != NULL); in Detach()
7616 for (int i = 0; i < blocks_.length(); i++) { in ~DeferredHandles()
7618 HandleScope::ZapRange(blocks_[i], &blocks_[i][kHandleBlockSize]); in ~DeferredHandles()
7620 isolate_->handle_scope_implementer()->ReturnBlock(blocks_[i]); in ~DeferredHandles()
7626 DCHECK(!blocks_.is_empty()); in Iterate()
[all …]
|