Searched refs:blocks_ (Results 1 - 25 of 26) sorted by relevance

12

/external/chromium_org/gpu/command_buffer/client/
H A Dfenced_allocator.cc43 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_[
[all...]
H A Dring_buffer.cc30 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_
[all...]
H A Dring_buffer.h111 Container blocks_; member in class:gpu::RingBuffer
H A Dfenced_allocator.h144 Container blocks_; member in class:gpu::FencedAllocator
/external/ceres-solver/internal/ceres/
H A Dblock_random_access_diagonal_matrix.cc49 : 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];
H A Dblock_random_access_sparse_matrix.cc51 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_i
[all...]
H A Dblock_jacobi_preconditioner.cc55 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);
H A Dblock_jacobi_preconditioner.h69 std::vector<double*> blocks_; member in class:ceres::internal::BlockJacobiPreconditioner
H A Dblock_random_access_diagonal_matrix.h83 const vector<int> blocks_; member in class:ceres::internal::BlockRandomAccessDiagonalMatrix
H A Dblock_random_access_sparse_matrix.h93 const vector<int> blocks_; member in class:ceres::internal::BlockRandomAccessSparseMatrix
H A Dschur_complement_solver.cc188 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_);
H A Dschur_complement_solver.h180 vector<int> blocks_; member in class:ceres::internal::SparseSchurComplementSolver
/external/chromium_org/third_party/leveldatabase/src/util/
H A Darena.h30 return blocks_memory_ + blocks_.capacity() * sizeof(char*);
42 std::vector<char*> blocks_; member in class:leveldb::Arena
H A Darena.cc19 for (size_t i = 0; i < blocks_.size(); i++) {
20 delete[] blocks_[i];
64 blocks_.push_back(result);
/external/chromium_org/net/tools/balsa/
H A Dbalsa_headers.cc107 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_[
[all...]
H A Dbalsa_headers.h105 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_
198 Blocks blocks_; member in class:net::BalsaBuffer
[all...]
/external/chromium_org/content/browser/
H A Dbrowser_shutdown_profile_dumper.h69 int blocks_; member in class:content::BrowserShutdownProfileDumper
H A Dbrowser_shutdown_profile_dumper.cc24 blocks_(0),
98 if (blocks_) {
103 ++blocks_;
/external/chromium_org/third_party/leveldatabase/src/helpers/memenv/
H A Dmemenv.cc70 *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::__anon12454::FileState
/external/chromium_org/v8/src/
H A Dapi.h472 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_
[all...]
H A Dglobal-handles.h364 return &blocks_[index >> kShift][index & kMask];
368 List<Object**> blocks_; member in class:v8::internal::EternalHandles
H A Dglobal-handles.cc1000 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;
H A Dhydrogen.cc510 blocks_.Add(block, block->zone());
571 for (int i = 0; i < blocks_.length(); i++) {
572 HBasicBlock* block = blocks_.at(i);
621 DCHECK(blocks_.at(0)->predecessors()->is_empty());
625 ReachabilityAnalyzer analyzer(entry_block_, blocks_.length(), NULL);
626 DCHECK(analyzer.visited_count() == blocks_.length());
632 for (int i = 0; i < blocks_.length(); ++i) {
633 HBasicBlock* block = blocks_.at(i);
640 blocks_.length(),
3420 blocks_(
[all...]
H A Dapi.cc7583 while (!blocks_.is_empty()) {
7584 Object** block_start = blocks_.last();
7590 deferred->blocks_.Add(blocks_.last());
7591 blocks_.RemoveLast();
7594 // deferred->blocks_ now contains the blocks installed on the
7598 DCHECK(prev_limit == NULL || !blocks_.is_empty());
7600 DCHECK(!blocks_.is_empty() && prev_limit != NULL);
7616 for (int i = 0; i < blocks_.length(); i++) {
7618 HandleScope::ZapRange(blocks_[
[all...]
H A Dhydrogen.h261 blocks_(8, zone),
263 blocks_.Add(loop_header, zone);
268 const ZoneList<HBasicBlock*>* blocks() const { return &blocks_; }
297 ZoneList<HBasicBlock*> blocks_; member in class:v8::internal::FINAL
312 const ZoneList<HBasicBlock*>* blocks() const { return &blocks_; }
488 ZoneList<HBasicBlock*> blocks_; member in class:v8::internal::FINAL

Completed in 1118 milliseconds

12