| /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/marisa-trie/lib/marisa/ |
| D | bitvector.h | 44 blocks_.push_back(0); in push_back()
47 blocks_.back() |= 1U << (size_ % 32); in push_back()
54 return (blocks_[i / 32] & (1U << (i % 32))) != 0;
70 return blocks_.empty(); in empty()
76 return blocks_.total_size() + sizeof(size_) + ranks_.total_size() in total_size()
84 Vector<UInt32> blocks_;
|
| D | bitvector.cc | 157 : blocks_(), size_(0), ranks_(), select0s_(), select1s_() {} in BitVector()
250 blocks_.shrink(); in build()
272 temp.blocks_.map(mapper); in map()
304 temp.blocks_.read(reader); in read()
335 blocks_.write(writer); in write()
378 offset += PopCount(blocks_[(i / 32) - 1]).lo32(); in rank1()
381 offset += PopCount(blocks_[i / 32] & ((1U << (i % 32)) - 1)).lo32(); in rank1()
444 UInt32 block = ~blocks_[block_id]; in select0()
449 block = ~blocks_[block_id]; in select0()
528 UInt32 block = blocks_[block_id]; in select1()
[all …]
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| D | bitvector.h | 44 blocks_.push_back(0); in push_back()
47 blocks_.back() |= 1U << (size_ % 32); in push_back()
54 return (blocks_[i / 32] & (1U << (i % 32))) != 0;
70 return blocks_.empty(); in empty()
76 return blocks_.total_size() + sizeof(size_) + ranks_.total_size() in total_size()
84 Vector<UInt32> blocks_;
|
| D | bitvector.cc | 157 : blocks_(), size_(0), ranks_(), select0s_(), select1s_() {} in BitVector()
250 blocks_.shrink(); in build()
272 temp.blocks_.map(mapper); in map()
304 temp.blocks_.read(reader); in read()
335 blocks_.write(writer); in write()
378 offset += PopCount(blocks_[(i / 32) - 1]).lo32(); in rank1()
381 offset += PopCount(blocks_[i / 32] & ((1U << (i % 32)) - 1)).lo32(); in rank1()
445 UInt32 block = ~blocks_[block_id]; in select0()
450 block = ~blocks_[block_id]; in select0()
530 UInt32 block = blocks_[block_id]; in select1()
[all …]
|
| /external/v8/src/compiler/ |
| D | liveness-analyzer.cc | 18 : zone_(zone), blocks_(zone), local_count_(local_count), queue_(zone) {} in LivenessAnalyzer()
22 for (auto block : blocks_) { in Print()
32 LivenessAnalyzerBlock(blocks_.size(), local_count_, zone()); in NewBlock()
33 blocks_.push_back(result); in NewBlock()
62 for (auto block : blocks_) { in Run()
81 for (auto block : blocks_) { in Run()
|
| D | liveness-analyzer.h | 73 ZoneDeque<LivenessAnalyzerBlock*> blocks_; variable
|
| /external/v8/src/ |
| D | api.h | 428 List<Object**> blocks_; local
452 blocks_(0),
525 inline List<internal::Object**>* blocks() { return &blocks_; }
536 blocks_.Initialize(0);
545 DCHECK(blocks_.length() == 0);
548 blocks_.Free();
562 List<internal::Object**> blocks_; local
651 while (!blocks_.is_empty()) {
652 internal::Object** block_start = blocks_.last();
663 blocks_.RemoveLast();
[all …]
|
| D | global-handles.h | 450 return &blocks_[index >> kShift][index & kMask]; in GetLocation()
454 List<Object**> blocks_; variable
|
| D | global-handles.cc | 1457 for (int i = 0; i < blocks_.length(); i++) delete[] blocks_[i]; in ~EternalHandles()
1463 for (int i = 0; i < blocks_.length(); i++) { in IterateAllRoots()
1465 Object** block = blocks_[i]; in IterateAllRoots()
1502 blocks_.Add(next_block); in Create()
1504 DCHECK_EQ(isolate->heap()->the_hole_value(), blocks_[block][offset]); in Create()
1505 blocks_[block][offset] = object; in Create()
|
| D | api.cc | 8823 while (!blocks_.is_empty()) { in Detach()
8824 Object** block_start = blocks_.last(); in Detach()
8830 deferred->blocks_.Add(blocks_.last()); in Detach()
8831 blocks_.RemoveLast(); in Detach()
8838 DCHECK(prev_limit == NULL || !blocks_.is_empty()); in Detach()
8840 DCHECK(!blocks_.is_empty() && prev_limit != NULL); in Detach()
8856 for (int i = 0; i < blocks_.length(); i++) { in ~DeferredHandles()
8858 HandleScope::ZapRange(blocks_[i], &blocks_[i][kHandleBlockSize]); in ~DeferredHandles()
8860 isolate_->handle_scope_implementer()->ReturnBlock(blocks_[i]); in ~DeferredHandles()
8866 DCHECK(!blocks_.is_empty()); in Iterate()
[all …]
|
| D | isolate.cc | 250 List<Object**>* blocks = &deferred->blocks_; in IsDeferredHandle()
|
| /external/v8/test/cctest/compiler/ |
| D | test-jump-threading.cc | 18 blocks_(main_zone()), in TestCode()
19 sequence_(main_isolate(), main_zone(), &blocks_), in TestCode()
23 ZoneVector<InstructionBlock*> blocks_; member in v8::internal::compiler::TestCode
91 blocks_.push_back(current_); in Start()
|
| /external/v8/src/crankshaft/ |
| D | hydrogen.cc | 681 blocks_.Add(block, block->zone()); in AddBlock()
742 for (int i = 0; i < blocks_.length(); i++) { in Verify()
743 HBasicBlock* block = blocks_.at(i); in Verify()
792 DCHECK(blocks_.at(0)->predecessors()->is_empty()); in Verify()
796 ReachabilityAnalyzer analyzer(entry_block_, blocks_.length(), NULL); in Verify()
797 DCHECK(analyzer.visited_count() == blocks_.length()); in Verify()
803 for (int i = 0; i < blocks_.length(); ++i) { in Verify()
804 HBasicBlock* block = blocks_.at(i); in Verify()
811 blocks_.length(), in Verify()
3784 blocks_(8, info->zone()), in HGraph()
[all …]
|
| D | hydrogen.h | 280 blocks_(8, zone), in HLoopInformation()
282 blocks_.Add(loop_header, zone); in HLoopInformation()
287 const ZoneList<HBasicBlock*>* blocks() const { return &blocks_; } in blocks()
316 ZoneList<HBasicBlock*> blocks_; variable
335 const ZoneList<HBasicBlock*>* blocks() const { return &blocks_; } in blocks()
493 ZoneList<HBasicBlock*> blocks_; variable
|