Home
last modified time | relevance | path

Searched refs:blocks_ (Results 1 – 22 of 22) sorted by relevance

/external/perfetto/src/trace_processor/
Dstring_pool.cc25 blocks_.emplace_back(); in StringPool()
28 PERFETTO_CHECK(blocks_.back().TryInsert(NullTermStringView())); in StringPool()
43 auto* ptr = blocks_.back().TryInsert(str); in InsertString()
50 blocks_.emplace_back(); in InsertString()
53 ptr = blocks_.back().TryInsert(str); in InsertString()
91 PERFETTO_DCHECK(block_id_ < pool_->blocks_.size()); in operator ++()
94 const auto& block = pool_->blocks_[block_id_]; in operator ++()
110 return block_id_ < pool_->blocks_.size(); in operator bool()
114 PERFETTO_DCHECK(block_id_ < pool_->blocks_.size()); in StringView()
115 PERFETTO_DCHECK(block_offset_ < pool_->blocks_[block_id_].pos()); in StringView()
[all …]
Dstring_pool.h141 PERFETTO_DCHECK(blocks_.size() == 1); in PtrToId()
142 return blocks_.back().OffsetOf(ptr); in PtrToId()
158 PERFETTO_DCHECK(blocks_.size() == 1); in IdToPtr()
159 return blocks_.back().Get(id); in IdToPtr()
183 std::vector<Block> blocks_; variable
/external/deqp-deps/SPIRV-Tools/source/opt/
Dfunction.h87 const std::unique_ptr<BasicBlock>& entry() const { return blocks_.front(); } in entry()
89 iterator begin() { return iterator(&blocks_, blocks_.begin()); } in begin()
90 iterator end() { return iterator(&blocks_, blocks_.end()); } in end()
94 return const_iterator(&blocks_, blocks_.cbegin()); in cbegin()
97 return const_iterator(&blocks_, blocks_.cend()); in cend()
143 std::vector<std::unique_ptr<BasicBlock>> blocks_; variable
169 blocks_.insert(ip.Get(), std::make_move_iterator(src_begin), in AddBasicBlocks()
180 blocks_.erase(std::find(std::begin(blocks_), std::end(blocks_), nullptr)); in MoveBasicBlockToAfter()
185 std::remove_if(std::begin(blocks_), std::end(blocks_), in RemoveEmptyBlocks()
189 blocks_.erase(first_empty, std::end(blocks_)); in RemoveEmptyBlocks()
Dfunction.cpp36 clone->blocks_.reserve(blocks_.size()); in Clone()
37 for (const auto& b : blocks_) { in Clone()
51 for (auto& bb : blocks_) bb->ForEachInst(f, run_on_debug_line_insts); in ForEachInst()
65 for (const auto& bb : blocks_) in ForEachInst()
103 IRContext* ctx = blocks_.front()->GetLabel()->context(); in IsRecursive()
Dpropagator.cpp36 blocks_.push(dest_bb); in AddControlEdge()
243 while (!blocks_.empty() || !ssa_edge_uses_.empty()) { in Run()
246 if (!blocks_.empty()) { in Run()
247 auto block = blocks_.front(); in Run()
249 blocks_.pop(); in Run()
Dpropagator.h285 std::queue<BasicBlock*> blocks_; variable
/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Dfunction.h87 const std::unique_ptr<BasicBlock>& entry() const { return blocks_.front(); } in entry()
89 iterator begin() { return iterator(&blocks_, blocks_.begin()); } in begin()
90 iterator end() { return iterator(&blocks_, blocks_.end()); } in end()
94 return const_iterator(&blocks_, blocks_.cbegin()); in cbegin()
97 return const_iterator(&blocks_, blocks_.cend()); in cend()
147 std::vector<std::unique_ptr<BasicBlock>> blocks_; variable
173 blocks_.insert(ip.Get(), std::make_move_iterator(src_begin), in AddBasicBlocks()
184 blocks_.erase(std::find(std::begin(blocks_), std::end(blocks_), nullptr)); in MoveBasicBlockToAfter()
189 std::remove_if(std::begin(blocks_), std::end(blocks_), in RemoveEmptyBlocks()
193 blocks_.erase(first_empty, std::end(blocks_)); in RemoveEmptyBlocks()
Dfunction.cpp36 clone->blocks_.reserve(blocks_.size()); in Clone()
37 for (const auto& b : blocks_) { in Clone()
81 for (auto& bb : blocks_) { in WhileEachInst()
108 for (const auto& bb : blocks_) { in WhileEachInst()
151 IRContext* ctx = blocks_.front()->GetLabel()->context(); in IsRecursive()
Dpropagator.cpp36 blocks_.push(dest_bb); in AddControlEdge()
243 while (!blocks_.empty() || !ssa_edge_uses_.empty()) { in Run()
246 if (!blocks_.empty()) { in Run()
247 auto block = blocks_.front(); in Run()
249 blocks_.pop(); in Run()
Dpropagator.h285 std::queue<BasicBlock*> blocks_; variable
/external/protobuf/src/google/protobuf/
Darena.cc60 blocks_ = 0; in Init()
157 b->next = reinterpret_cast<Block*>(google::protobuf::internal::NoBarrier_Load(&blocks_)); in AddBlockInternal()
158 …google::protobuf::internal::Release_Store(&blocks_, reinterpret_cast<google::protobuf::internal::A… in AddBlockInternal()
234 Block* b = reinterpret_cast<Block*>(google::protobuf::internal::NoBarrier_Load(&blocks_)); in SpaceAllocated()
244 Block* b = reinterpret_cast<Block*>(google::protobuf::internal::NoBarrier_Load(&blocks_)); in SpaceUsed()
256 Block* b = reinterpret_cast<Block*>(google::protobuf::internal::NoBarrier_Load(&blocks_)); in SpaceAllocatedAndUsed()
267 Block* b = reinterpret_cast<Block*>(google::protobuf::internal::NoBarrier_Load(&blocks_)); in FreeBlocks()
284 blocks_ = 0; in FreeBlocks()
313 Block* b = reinterpret_cast<Block*>(google::protobuf::internal::Acquire_Load(&blocks_)); in FindBlock()
Darena.h881 google::protobuf::internal::AtomicWord blocks_; // Head of linked list of all allocated blocks variable
/external/deqp-deps/SPIRV-Tools/source/val/
Dfunction.cpp45 blocks_(), in Function()
73 BasicBlock& merge_block = blocks_.at(merge_id); in RegisterLoopMerge()
74 BasicBlock& continue_target_block = blocks_.at(continue_id); in RegisterLoopMerge()
95 BasicBlock& merge_block = blocks_.at(merge_id); in RegisterSelectionMerge()
119 blocks_.insert({block_id, BasicBlock(block_id)}); in RegisterBlock()
148 blocks_.insert({successor_id, BasicBlock(successor_id)}); in RegisterBlockEnd()
186 size_t Function::block_count() const { return blocks_.size(); } in block_count()
225 const auto b = blocks_.find(block_id); in GetBlock()
226 if (b != end(blocks_)) { in GetBlock()
Dfunction.h268 std::unordered_map<uint32_t, BasicBlock> blocks_; variable
/external/swiftshader/third_party/SPIRV-Tools/source/val/
Dfunction.cpp45 blocks_(), in Function()
73 BasicBlock& merge_block = blocks_.at(merge_id); in RegisterLoopMerge()
74 BasicBlock& continue_target_block = blocks_.at(continue_id); in RegisterLoopMerge()
95 BasicBlock& merge_block = blocks_.at(merge_id); in RegisterSelectionMerge()
119 blocks_.insert({block_id, BasicBlock(block_id)}); in RegisterBlock()
148 blocks_.insert({successor_id, BasicBlock(successor_id)}); in RegisterBlockEnd()
186 size_t Function::block_count() const { return blocks_.size(); } in block_count()
225 const auto b = blocks_.find(block_id); in GetBlock()
226 if (b != end(blocks_)) { in GetBlock()
Dfunction.h268 std::unordered_map<uint32_t, BasicBlock> blocks_; variable
/external/v8/src/
Dapi.h307 std::vector<Object**> blocks_; variable
412 inline DetachableVector<Object**>* blocks() { return &blocks_; } in blocks()
423 blocks_.detach(); in ResetAfterArchive()
434 DCHECK(blocks_.empty()); in Free()
439 blocks_.free(); in Free()
453 DetachableVector<Object**> blocks_; variable
566 while (!blocks_.empty()) { in DeleteExtensions()
567 internal::Object** block_start = blocks_.back(); in DeleteExtensions()
578 blocks_.pop_back(); in DeleteExtensions()
587 DCHECK((blocks_.empty() && prev_limit == nullptr) || in DeleteExtensions()
[all …]
Dglobal-handles.h312 return &blocks_[index >> kShift][index & kMask]; in GetLocation()
316 std::vector<Object**> blocks_; variable
Dglobal-handles.cc1101 for (Object** block : blocks_) delete[] block; in ~EternalHandles()
1106 for (Object** block : blocks_) { in IterateAllRoots()
1144 blocks_.push_back(next_block); in Create()
1146 DCHECK_EQ(the_hole, blocks_[block][offset]); in Create()
1147 blocks_[block][offset] = object; in Create()
Dapi.cc10701 while (!blocks_.empty()) { in Detach()
10702 Object** block_start = blocks_.back(); in Detach()
10708 deferred->blocks_.push_back(blocks_.back()); in Detach()
10709 blocks_.pop_back(); in Detach()
10716 DCHECK(prev_limit == nullptr || !blocks_.empty()); in Detach()
10718 DCHECK(!blocks_.empty() && prev_limit != nullptr); in Detach()
10734 for (size_t i = 0; i < blocks_.size(); i++) { in ~DeferredHandles()
10736 HandleScope::ZapRange(blocks_[i], &blocks_[i][kHandleBlockSize]); in ~DeferredHandles()
10738 isolate_->handle_scope_implementer()->ReturnBlock(blocks_[i]); in ~DeferredHandles()
10743 DCHECK(!blocks_.empty()); in Iterate()
[all …]
Disolate.cc298 std::vector<Object**>* blocks = &deferred->blocks_; in IsDeferredHandle()
/external/protobuf/js/binary/
Dwriter.js83 this.blocks_ = []; property in jspb.BinaryWriter
119 this.blocks_.push(temp);
120 this.blocks_.push(arr);
135 this.blocks_.push(bookmark);
196 this.blocks_ = []; property
212 var blocks = this.blocks_;
231 this.blocks_ = [flat]; property