| /external/chromium_org/gpu/command_buffer/client/ |
| fenced_allocator.cc | 43 blocks_.push_back(block);
48 for (unsigned int i = 0; i < blocks_.size(); ++i) {
49 if (blocks_[i].state == FREE_PENDING_TOKEN) {
54 DCHECK_EQ(blocks_.size(), 1u);
55 DCHECK_EQ(blocks_[0].state, FREE);
74 for (unsigned int i = 0; i < blocks_.size(); ++i) {
75 Block &block = blocks_[i];
83 for (unsigned int i = 0; i < blocks_.size(); ++i) {
84 if (blocks_[i].state != FREE_PENDING_TOKEN)
87 if (blocks_[i].size >= size
[all...] |
| ring_buffer.cc | 30 while (!blocks_.empty()) {
36 DCHECK(!blocks_.empty()) << "no free blocks";
37 Block& block = blocks_.front();
52 blocks_.pop_front();
57 DCHECK(blocks_.empty() || blocks_.back().state != IN_USE)
73 blocks_.push_back(Block(free_offset_, size_ - free_offset_, PADDING));
78 blocks_.push_back(Block(offset, size, IN_USE));
90 DCHECK(!blocks_.empty()) << "no allocations to free";
91 for (Container::reverse_iterator it = blocks_.rbegin()
[all...] |
| ring_buffer.h | 111 Container blocks_; member in class:gpu::RingBuffer
|
| fenced_allocator.h | 144 Container blocks_; member in class:gpu::FencedAllocator
|
| /external/ceres-solver/internal/ceres/ |
| block_random_access_diagonal_matrix.cc | 49 : blocks_(blocks) {
55 for (int i = 0; i < blocks_.size(); ++i) {
57 num_cols += blocks_[i];
58 num_nonzeros += blocks_[i] * blocks_[i];
72 for (int i = 0; i < blocks_.size(); ++i) {
73 const int block_size = blocks_[i];
100 const int stride = blocks_[row_block_id];
|
| block_random_access_sparse_matrix.cc | 51 blocks_(blocks) {
58 for (int i = 0; i < blocks_.size(); ++i) {
60 num_cols += blocks_[i];
70 const int row_block_size = blocks_[it->first];
71 const int col_block_size = blocks_[it->second];
89 const int row_block_size = blocks_[it->first];
90 const int col_block_size = blocks_[it->second];
102 const int row_block_size = blocks_[row_block_id];
103 const int col_block_size = blocks_[col_block_id];
143 *row_stride = blocks_[row_block_id]
[all...] |
| block_jacobi_preconditioner.h | 69 std::vector<double*> blocks_; member in class:ceres::internal::BlockJacobiPreconditioner
|
| block_jacobi_preconditioner.cc | 55 blocks_.resize(block_structure_.cols.size());
62 blocks_[c] = block_cursor;
85 MatrixRef(blocks_[cells[c].block_id],
95 // MatrixRef(blocks_[cells[c].block_id],
108 MatrixRef block(blocks_[c], size, size);
127 ConstMatrixRef D(blocks_[c], size, size);
|
| block_random_access_diagonal_matrix.h | 83 const vector<int> blocks_; member in class:ceres::internal::BlockRandomAccessDiagonalMatrix
|
| block_random_access_sparse_matrix.h | 93 const vector<int> blocks_; member in class:ceres::internal::BlockRandomAccessSparseMatrix
|
| schur_complement_solver.cc | 188 blocks_.resize(num_col_blocks - num_eliminate_blocks, 0);
190 blocks_[i - num_eliminate_blocks] = bs->cols[i].size;
194 for (int i = 0; i < blocks_.size(); ++i) {
247 set_lhs(new BlockRandomAccessSparseMatrix(blocks_, block_pairs));
315 blocks_,
316 blocks_,
414 cxsparse_factor_ = cxsparse_.BlockAnalyzeCholesky(lhs, blocks_, blocks_);
|
| schur_complement_solver.h | 180 vector<int> blocks_; member in class:ceres::internal::SparseSchurComplementSolver
|
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| arena.h | 30 return blocks_memory_ + blocks_.capacity() * sizeof(char*);
42 std::vector<char*> blocks_; member in class:leveldb::Arena
|
| arena.cc | 19 for (size_t i = 0; i < blocks_.size(); i++) {
20 delete[] blocks_[i];
64 blocks_.push_back(result);
|
| /external/chromium_org/net/tools/balsa/ |
| balsa_headers.cc | 107 for (Blocks::const_iterator iter = blocks_.begin();
108 iter != blocks_.end();
120 DCHECK_GE(blocks_.size(), 1u);
121 if (blocks_[0].buffer == NULL && sp.size() <= blocksize_) {
122 blocks_[0] = AllocBlock();
123 memcpy(blocks_[0].start_of_unused_bytes(), sp.data(), sp.size());
124 } else if (blocks_[0].bytes_free < sp.size()) {
126 const size_t old_storage_size_used = blocks_[0].bytes_used();
129 char* old_storage = blocks_[0].buffer;
134 blocks_[0].buffer = new_storage
[all...] |
| balsa_headers.h | 105 DCHECK_LT(block_idx, blocks_.size())
106 << block_idx << ", " << blocks_.size();
107 return blocks_[block_idx].buffer;
111 DCHECK_LT(block_idx, blocks_.size())
112 << block_idx << ", " << blocks_.size();
113 return blocks_[block_idx].buffer;
166 return blocks_[0].buffer;
170 return blocks_[0].buffer + blocks_[0].bytes_used();
177 Blocks::size_type num_blocks() const { return blocks_.size();
198 Blocks blocks_; member in class:net::BalsaBuffer
[all...] |
| /external/chromium_org/content/browser/ |
| browser_shutdown_profile_dumper.h | 69 int blocks_; member in class:content::BrowserShutdownProfileDumper
|
| browser_shutdown_profile_dumper.cc | 24 blocks_(0),
98 if (blocks_) {
103 ++blocks_;
|
| /art/compiler/optimizing/ |
| nodes.cc | 24 block->SetBlockId(blocks_.Size());
25 blocks_.Add(block);
29 ArenaBitVector visiting(arena_, blocks_.Size(), false);
34 for (size_t i = 0; i < blocks_.Size(); ++i) {
36 HBasicBlock* block = blocks_.Get(i);
70 ArenaBitVector visited(arena_, blocks_.Size(), false);
87 GrowableArray<size_t> visits(arena_, blocks_.Size());
88 visits.SetSize(blocks_.Size());
96 ArenaBitVector visited(arena_, blocks_.Size(), false);
203 for (size_t i = 0; i < blocks_.Size(); ++i)
[all...] |
| nodes.h | 75 blocks_(arena, kDefaultNumberOfBlocks),
84 const GrowableArray<HBasicBlock*>& GetBlocks() const { return blocks_; }
164 GrowableArray<HBasicBlock*> blocks_; member in class:art::HGraph
195 blocks_(graph->GetArena(), graph->GetBlocks().Size(), false) {}
242 const ArenaBitVector& GetBlocks() const { return blocks_; }
250 ArenaBitVector blocks_; member in class:art::HLoopInformation
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/helpers/memenv/ |
| memenv.cc | 70 *result = Slice(blocks_[block] + block_offset, n);
82 memcpy(dst, blocks_[block] + block_offset, avail);
107 blocks_.push_back(new char[kBlockSize]);
114 memcpy(blocks_.back() + offset, src, avail);
126 for (std::vector<char*>::iterator i = blocks_.begin(); i != blocks_.end();
142 std::vector<char*> blocks_; member in class:leveldb::__anon17079::FileState
|
| /art/compiler/sea_ir/code_gen/ |
| code_gen.h | 33 builder_(*context_), function_(), blocks_(), values_() { }
36 std::map<int, llvm::BasicBlock*>::iterator block_it = blocks_.find(region_id);
37 DCHECK(block_it != blocks_.end());
46 blocks_.insert(std::pair<int, llvm::BasicBlock*>(region_id, block));
80 std::map<int, llvm::BasicBlock*> blocks_; member in class:sea_ir::CodeGenData
|
| /external/chromium_org/v8/src/ |
| api.h | 472 List<Object**> blocks_; member in class:v8::internal::DeferredHandles
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_; member in class:v8::internal::HandleScopeImplementer
646 while (!blocks_.is_empty()) {
647 internal::Object** block_start = blocks_.last();
661 blocks_.RemoveLast()
[all...] |
| global-handles.h | 364 return &blocks_[index >> kShift][index & kMask];
368 List<Object**> blocks_; member in class:v8::internal::EternalHandles
|
| global-handles.cc | 1000 for (int i = 0; i < blocks_.length(); i++) delete[] blocks_[i];
1006 for (int i = 0; i < blocks_.length(); i++) {
1008 Object** block = blocks_[i];
1045 blocks_.Add(next_block);
1047 DCHECK_EQ(isolate->heap()->the_hole_value(), blocks_[block][offset]);
1048 blocks_[block][offset] = object;
|
