/external/chromium_org/gpu/command_buffer/client/ |
H A D | fenced_allocator.cc | 38 blocks_.push_back(block); 43 for (unsigned int i = 0; i < blocks_.size(); ++i) { 44 if (blocks_[i].state == FREE_PENDING_TOKEN) { 49 // GPU_DCHECK_EQ(blocks_.size(), 1u); 50 // GPU_DCHECK_EQ(blocks_[0].state, FREE); 69 for (unsigned int i = 0; i < blocks_.size(); ++i) { 70 Block &block = blocks_[i]; 78 for (unsigned int i = 0; i < blocks_.size(); ++i) { 79 if (blocks_[i].state != FREE_PENDING_TOKEN) 82 if (blocks_[ [all...] |
H A D | ring_buffer.cc | 24 while (!blocks_.empty()) { 30 GPU_DCHECK(!blocks_.empty()) << "no free blocks"; 31 Block& block = blocks_.front(); 46 blocks_.pop_front(); 51 GPU_DCHECK(blocks_.empty() || blocks_.back().state != IN_USE) 64 blocks_.push_back(Block(free_offset_, size_ - free_offset_, PADDING)); 69 blocks_.push_back(Block(offset, size, IN_USE)); 80 GPU_DCHECK(!blocks_.empty()) << "no allocations to free"; 81 for (Container::reverse_iterator it = blocks_ [all...] |
H A D | ring_buffer.h | 93 Container blocks_; member in class:gpu::RingBuffer
|
H A D | fenced_allocator.h | 136 Container blocks_; member in class:gpu::FencedAllocator
|
/external/ceres-solver/internal/ceres/ |
H A D | block_random_access_crs_matrix.cc | 52 blocks_(blocks) { 55 col_layout_.resize(blocks_.size(), 0); 56 row_strides_.resize(blocks_.size(), 0); 61 for (int i = 0; i < blocks_.size(); ++i) { 63 num_cols += blocks_[i]; 71 const int row_block_size = blocks_[it->first]; 72 const int col_block_size = blocks_[it->second]; 97 const int row_block_size = blocks_[row_block_id]; 103 num_cols += blocks_[it->second]; 116 const int col_block_size = blocks_[col_block_i [all...] |
H A D | 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_i [all...] |
H A D | 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], 106 MatrixRef block(blocks_[c], size, size); 125 ConstMatrixRef D(blocks_[c], size, size);
|
H A D | block_jacobi_preconditioner.h | 69 std::vector<double*> blocks_; member in class:ceres::internal::BlockJacobiPreconditioner
|
H A D | block_random_access_crs_matrix.h | 91 const vector<int> blocks_; member in class:ceres::internal::BlockRandomAccessCRSMatrix
|
H A D | block_random_access_sparse_matrix.h | 93 const vector<int> blocks_; member in class:ceres::internal::BlockRandomAccessSparseMatrix
|
H A D | schur_complement_solver.cc | 182 blocks_.resize(num_col_blocks - num_eliminate_blocks, 0); 184 blocks_[i - num_eliminate_blocks] = bs->cols[i].size; 188 for (int i = 0; i < blocks_.size(); ++i) { 241 set_lhs(new BlockRandomAccessSparseMatrix(blocks_, block_pairs)); 291 factor_ = ss_.BlockAnalyzeCholesky(cholmod_lhs, blocks_, blocks_); 359 CHECK_NOTNULL(cxsparse_.BlockAnalyzeCholesky(lhs, blocks_, blocks_));
|
H A D | schur_complement_solver.h | 168 vector<int> blocks_; member in class:ceres::internal::SparseSchurComplementSolver
|
/external/marisa-trie/lib/marisa/ |
H A D | bitvector.h | 44 blocks_.push_back(0); 47 blocks_.back() |= 1U << (size_ % 32); 54 return (blocks_[i / 32] & (1U << (i % 32))) != 0; 70 return blocks_.empty(); 76 return blocks_.total_size() + sizeof(size_) + ranks_.total_size() 84 Vector<UInt32> blocks_; member in class:marisa::BitVector
|
H A D | bitvector.cc | 157 : blocks_(), size_(0), ranks_(), select0s_(), select1s_() {} 250 blocks_.shrink(); 272 temp.blocks_.map(mapper); 304 temp.blocks_.read(reader); 335 blocks_.write(writer); 378 offset += PopCount(blocks_[(i / 32) - 1]).lo32(); 381 offset += PopCount(blocks_[i / 32] & ((1U << (i % 32)) - 1)).lo32(); 444 UInt32 block = ~blocks_[block_id]; 449 block = ~blocks_[block_id]; 528 UInt32 block = blocks_[block_i [all...] |
/external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
H A D | bitvector.h | 44 blocks_.push_back(0); 47 blocks_.back() |= 1U << (size_ % 32); 54 return (blocks_[i / 32] & (1U << (i % 32))) != 0; 70 return blocks_.empty(); 76 return blocks_.total_size() + sizeof(size_) + ranks_.total_size() 84 Vector<UInt32> blocks_; member in class:marisa_alpha::BitVector
|
H A D | bitvector.cc | 157 : blocks_(), size_(0), ranks_(), select0s_(), select1s_() {} 250 blocks_.shrink(); 272 temp.blocks_.map(mapper); 304 temp.blocks_.read(reader); 335 blocks_.write(writer); 378 offset += PopCount(blocks_[(i / 32) - 1]).lo32(); 381 offset += PopCount(blocks_[i / 32] & ((1U << (i % 32)) - 1)).lo32(); 445 UInt32 block = ~blocks_[block_id]; 450 block = ~blocks_[block_id]; 530 UInt32 block = blocks_[block_i [all...] |
/external/chromium_org/third_party/leveldatabase/src/util/ |
H A D | arena.h | 30 return blocks_memory_ + blocks_.capacity() * sizeof(char*); 42 std::vector<char*> blocks_; member in class:leveldb::Arena
|
H A D | arena.cc | 19 for (size_t i = 0; i < blocks_.size(); i++) { 20 delete[] blocks_[i]; 64 blocks_.push_back(result);
|
/external/chromium/net/tools/flip_server/ |
H A D | balsa_headers.cc | 84 for (Blocks::const_iterator iter = blocks_.begin(); 85 iter != blocks_.end(); 97 DCHECK_GE(blocks_.size(), 1u); 98 if (blocks_[0].buffer == NULL && sp.size() <= blocksize_) { 99 blocks_[0] = AllocBlock(); 100 memcpy(blocks_[0].start_of_unused_bytes(), sp.data(), sp.size()); 101 } else if (blocks_[0].bytes_free < sp.size()) { 103 const size_t old_storage_size_used = blocks_[0].bytes_used(); 106 char* old_storage = blocks_[0].buffer; 111 blocks_[ [all...] |
H A D | 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_ 198 Blocks blocks_; member in class:net::BalsaBuffer [all...] |
/external/chromium_org/net/tools/flip_server/ |
H A D | balsa_headers.cc | 98 for (Blocks::const_iterator iter = blocks_.begin(); 99 iter != blocks_.end(); 111 DCHECK_GE(blocks_.size(), 1u); 112 if (blocks_[0].buffer == NULL && sp.size() <= blocksize_) { 113 blocks_[0] = AllocBlock(); 114 memcpy(blocks_[0].start_of_unused_bytes(), sp.data(), sp.size()); 115 } else if (blocks_[0].bytes_free < sp.size()) { 117 const size_t old_storage_size_used = blocks_[0].bytes_used(); 120 char* old_storage = blocks_[0].buffer; 125 blocks_[ [all...] |
H A D | 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_ 198 Blocks blocks_; member in class:net::BalsaBuffer [all...] |
/external/chromium_org/third_party/leveldatabase/src/helpers/memenv/ |
H A D | 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::__anon11262::FileState
|
/external/v8/src/ |
H A D | api.h | 401 blocks_(0), 440 inline List<internal::Object**>* blocks() { return &blocks_; } 444 blocks_.Initialize(0); 452 ASSERT(blocks_.length() == 0); 455 blocks_.Free(); 466 List<internal::Object**> blocks_; member in class:v8::internal::HandleScopeImplementer 531 while (!blocks_.is_empty()) { 532 internal::Object** block_start = blocks_.last(); 541 blocks_.RemoveLast(); 550 ASSERT((blocks_ [all...] |
/external/chromium_org/v8/src/ |
H A D | api.h | 492 List<Object**> blocks_; member in class:v8::internal::DeferredHandles 516 blocks_(0), 556 inline List<internal::Object**>* blocks() { return &blocks_; } 567 blocks_.Initialize(0); 576 ASSERT(blocks_.length() == 0); 579 blocks_.Free(); 593 List<internal::Object**> blocks_; member in class:v8::internal::HandleScopeImplementer 662 while (!blocks_.is_empty()) { 663 internal::Object** block_start = blocks_.last(); 677 blocks_ [all...] |