/external/ceres-solver/internal/ceres/ |
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 | 73 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; 86 MatrixRef(blocks_[cells[c].block_id], 96 // MatrixRef(blocks_[cells[c].block_id], 107 MatrixRef block(blocks_[c], size, size); 123 ConstMatrixRef D(blocks_[c], size, size);
|
block_random_access_sparse_matrix.h | 94 const vector<int> blocks_; member in class:ceres::internal::BlockRandomAccessSparseMatrix
|
schur_complement_solver.cc | 185 blocks_.resize(num_col_blocks - num_eliminate_blocks, 0); 187 blocks_[i - num_eliminate_blocks] = bs->cols[i].size; 191 for (int i = 0; i < blocks_.size(); ++i) { 244 set_lhs(new BlockRandomAccessSparseMatrix(blocks_, block_pairs)); 297 factor_ = ss_.BlockAnalyzeCholesky(cholmod_lhs, blocks_, blocks_);
|
schur_complement_solver.h | 167 vector<int> blocks_; member in class:ceres::internal::SparseSchurComplementSolver
|
/external/marisa-trie/lib/marisa/ |
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
|
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_id] [all...] |
/external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
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
|
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_id] [all...] |
/external/chromium/net/tools/flip_server/ |
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_[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...] |
/sdk/emulator/qtools/ |
trace_reader_base.h | 102 StaticBlock *GetStaticBlock(uint64_t bb_num) { return &blocks_[bb_num]; } 103 uint32_t *GetInsns(uint64_t bb_num) { return blocks_[bb_num].insns; } 105 return blocks_[bb_num].rec.bb_addr & ~1; 108 return blocks_[bb_num].rec.bb_addr & 1; 139 StaticBlock *blocks_; member in class:TraceReaderBase
|
trace_reader.cpp | 630 blocks_ = NULL; 663 if (blocks_) { 666 delete[] blocks_[ii].insns; 668 delete[] blocks_; 777 blocks_ = new StaticBlock[num_static_bb]; 781 ReadStatic(&blocks_[ii].rec); 782 int num_insns = blocks_[ii].rec.num_insns; 784 blocks_[ii].insns = new uint32_t[num_insns]; 785 ReadStaticInsns(num_insns, blocks_[ii].insns); 787 blocks_[ii].insns = NULL [all...] |
/external/v8/src/ |
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_.is_empty() && prev_limit == NULL) | [all...] |
hydrogen.h | 217 blocks_(8), 219 blocks_.Add(loop_header); 224 const ZoneList<HBasicBlock*>* blocks() const { return &blocks_; } 239 ZoneList<HBasicBlock*> blocks_; member in class:v8::internal::HLoopInformation 251 const ZoneList<HBasicBlock*>* blocks() const { return &blocks_; } 365 ZoneList<HBasicBlock*> blocks_; member in class:v8::internal::HGraph [all...] |
hydrogen.cc | 427 blocks_.Add(block); 485 for (int i = 0; i < blocks_.length(); i++) { 486 HBasicBlock* block = blocks_.at(i); 533 ASSERT(blocks_.at(0)->predecessors()->is_empty()); 537 ReachabilityAnalyzer analyzer(entry_block_, blocks_.length(), NULL); 538 ASSERT(analyzer.visited_count() == blocks_.length()); 544 for (int i = 0; i < blocks_.length(); ++i) { 545 HBasicBlock* block = blocks_.at(i); 552 blocks_.length(), 672 blocks_(8) [all...] |