| /third_party/spirv-tools/source/opt/ |
| D | function.h | 102 const std::unique_ptr<BasicBlock>& entry() const { return blocks_.front(); } in entry()
105 BasicBlock* tail() { return blocks_.back().get(); } in tail()
106 const BasicBlock* tail() const { return blocks_.back().get(); } in tail()
108 iterator begin() { return iterator(&blocks_, blocks_.begin()); } in begin()
109 iterator end() { return iterator(&blocks_, blocks_.end()); } in end()
113 return const_iterator(&blocks_, blocks_.cbegin()); in cbegin()
116 return const_iterator(&blocks_, blocks_.cend()); in cend()
204 std::vector<std::unique_ptr<BasicBlock>> blocks_; variable
238 blocks_.insert(ip.Get(), std::make_move_iterator(src_begin), in AddBasicBlocks()
244 blocks_.erase(std::find(std::begin(blocks_), std::end(blocks_), nullptr)); in MoveBasicBlockToAfter()
[all …]
|
| D | function.cpp | 42 clone->blocks_.reserve(blocks_.size()); in Clone()
43 for (const auto& b : blocks_) { in Clone()
104 for (auto& bb : blocks_) { in WhileEachInst()
150 for (const auto& bb : blocks_) { in WhileEachInst()
231 blocks_.front()->GetLabel()->context()->GetPostDominatorAnalysis(this); in HasEarlyReturn()
232 for (auto& block : blocks_) { in HasEarlyReturn()
242 IRContext* ctx = blocks_.front()->GetLabel()->context(); in IsRecursive()
277 context->cfg()->ComputeStructuredOrder(this, blocks_[0].get(), &order); in ReorderBasicBlocksInStructuredOrder()
|
| D | propagator.cpp | 36 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()
|
| /third_party/node/deps/v8/src/maglev/ |
| D | maglev-graph.h | 28 explicit Graph(Zone* zone) : blocks_(zone) {} in Graph()
30 BasicBlock* operator[](int i) { return blocks_[i]; }
31 const BasicBlock* operator[](int i) const { return blocks_[i]; }
33 int num_blocks() const { return static_cast<int>(blocks_.size()); } in num_blocks()
35 BlockConstIterator begin() const { return blocks_.begin(); } in begin()
36 BlockConstIterator end() const { return blocks_.end(); } in end()
37 BlockConstReverseIterator rbegin() const { return blocks_.rbegin(); } in rbegin()
38 BlockConstReverseIterator rend() const { return blocks_.rend(); } in rend()
40 BasicBlock* last_block() const { return blocks_.back(); } in last_block()
42 void Add(BasicBlock* block) { blocks_.push_back(block); } in Add()
[all …]
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| D | function.h | 101 const std::unique_ptr<BasicBlock>& entry() const { return blocks_.front(); } in entry()
104 BasicBlock* tail() { return blocks_.back().get(); } in tail()
105 const BasicBlock* tail() const { return blocks_.back().get(); } in tail()
107 iterator begin() { return iterator(&blocks_, blocks_.begin()); } in begin()
108 iterator end() { return iterator(&blocks_, blocks_.end()); } in end()
112 return const_iterator(&blocks_, blocks_.cbegin()); in cbegin()
115 return const_iterator(&blocks_, blocks_.cend()); in cend()
191 std::vector<std::unique_ptr<BasicBlock>> blocks_; variable
225 blocks_.insert(ip.Get(), std::make_move_iterator(src_begin), in AddBasicBlocks()
231 blocks_.erase(std::find(std::begin(blocks_), std::end(blocks_), nullptr)); in MoveBasicBlockToAfter()
[all …]
|
| D | function.cpp | 42 clone->blocks_.reserve(blocks_.size()); in Clone()
43 for (const auto& b : blocks_) { in Clone()
104 for (auto& bb : blocks_) { in WhileEachInst()
150 for (const auto& bb : blocks_) { in WhileEachInst()
231 blocks_.front()->GetLabel()->context()->GetPostDominatorAnalysis(this); in HasEarlyReturn()
232 for (auto& block : blocks_) { in HasEarlyReturn()
242 IRContext* ctx = blocks_.front()->GetLabel()->context(); in IsRecursive()
|
| D | propagator.cpp | 36 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()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | function.h | 101 const std::unique_ptr<BasicBlock>& entry() const { return blocks_.front(); } in entry()
104 BasicBlock* tail() { return blocks_.back().get(); } in tail()
105 const BasicBlock* tail() const { return blocks_.back().get(); } in tail()
107 iterator begin() { return iterator(&blocks_, blocks_.begin()); } in begin()
108 iterator end() { return iterator(&blocks_, blocks_.end()); } in end()
112 return const_iterator(&blocks_, blocks_.cbegin()); in cbegin()
115 return const_iterator(&blocks_, blocks_.cend()); in cend()
191 std::vector<std::unique_ptr<BasicBlock>> blocks_; variable
225 blocks_.insert(ip.Get(), std::make_move_iterator(src_begin), in AddBasicBlocks()
231 blocks_.erase(std::find(std::begin(blocks_), std::end(blocks_), nullptr)); in MoveBasicBlockToAfter()
[all …]
|
| D | function.cpp | 42 clone->blocks_.reserve(blocks_.size()); in Clone()
43 for (const auto& b : blocks_) { in Clone()
104 for (auto& bb : blocks_) { in WhileEachInst()
150 for (const auto& bb : blocks_) { in WhileEachInst()
231 blocks_.front()->GetLabel()->context()->GetPostDominatorAnalysis(this); in HasEarlyReturn()
232 for (auto& block : blocks_) { in HasEarlyReturn()
242 IRContext* ctx = blocks_.front()->GetLabel()->context(); in IsRecursive()
|
| D | propagator.cpp | 36 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()
|
| /third_party/node/deps/v8/src/handles/ |
| D | local-handles.cc | 42 DCHECK(blocks_.empty()); in ~LocalHandles()
46 for (int i = 0; i < static_cast<int>(blocks_.size()) - 1; i++) { in Iterate()
47 Address* block = blocks_[i]; in Iterate()
53 if (!blocks_.empty()) { in Iterate()
54 Address* block = blocks_.back(); in Iterate()
64 for (auto it = blocks_.begin(); it != blocks_.end(); ++it) { in Contains()
68 Address* upper_bound = lower_bound != blocks_.back() in Contains()
82 blocks_.push_back(block); in AddBlock()
89 while (!blocks_.empty()) { in RemoveUnusedBlocks()
90 Address* block_start = blocks_.back(); in RemoveUnusedBlocks()
[all …]
|
| D | persistent-handles.cc | 27 for (Address* block_start : blocks_) { in ~PersistentHandles()
55 if (*it == blocks_.back()) { in Contains()
68 blocks_.push_back(block_start); in AddBlock()
89 for (int i = 0; i < static_cast<int>(blocks_.size()) - 1; i++) { in Iterate()
90 Address* block_start = blocks_[i]; in Iterate()
97 if (!blocks_.empty()) { in Iterate()
98 Address* block_start = blocks_.back(); in Iterate()
|
| D | local-handles.h | 32 std::vector<Address*> blocks_; variable
|
| D | global-handles.h | 320 return &blocks_[index >> kShift][index & kMask]; in GetLocation()
324 std::vector<Address*> blocks_; variable
|
| D | global-handles.cc | 227 size_t TotalSize() const { return blocks_ * sizeof(NodeType) * kBlockSize; } in TotalSize()
238 size_t blocks_ = 0; member in v8::internal::GlobalHandles::NodeSpace
256 blocks_++; in Acquire()
1729 for (Address* block : blocks_) delete[] block; in ~EternalHandles()
1734 for (Address* block : blocks_) { in IterateAllRoots()
1772 blocks_.push_back(next_block); in Create()
1774 DCHECK_EQ(the_hole.ptr(), blocks_[block][offset]); in Create()
1775 blocks_[block][offset] = object.ptr(); in Create()
|
| D | persistent-handles.h | 69 std::vector<Address*> blocks_; variable
|
| /third_party/node/deps/v8/src/compiler/ |
| D | branch-elimination.cc | 433 if (in_new_block || prev_conditions.blocks_.Size() == 0) { in UpdateConditions()
449 FunctionalList<BranchCondition> prev_front = blocks_.Front(); in AddCondition()
450 if (hint.blocks_.Size() > 0) { in AddCondition()
451 prev_front.PushFront(branch_condition, zone, hint.blocks_.Front()); in AddCondition()
455 blocks_.DropFront(); in AddCondition()
456 blocks_.PushFront(prev_front, zone); in AddCondition()
470 blocks_.PushFront(new_block, zone); in AddConditionInNewBlock()
492 while (other.blocks_.Size() > blocks_.Size()) other.blocks_.DropFront(); in ResetToCommonAncestor()
493 while (blocks_.Size() > other.blocks_.Size()) { in ResetToCommonAncestor()
494 for (BranchCondition branch_condition : blocks_.Front()) { in ResetToCommonAncestor()
[all …]
|
| D | branch-elimination.h | 83 return blocks_ == other.blocks_; in NON_EXPORTED_BASE()
86 return blocks_ != other.blocks_; in NON_EXPORTED_BASE()
92 FunctionalList<FunctionalList<BranchCondition>> blocks_; in NON_EXPORTED_BASE()
|
| /third_party/spirv-tools/source/val/ |
| D | function.cpp | 44 blocks_(), in Function()
72 BasicBlock& merge_block = blocks_.at(merge_id); in RegisterLoopMerge()
73 BasicBlock& continue_target_block = blocks_.at(continue_id); in RegisterLoopMerge()
102 BasicBlock& merge_block = blocks_.at(merge_id); in RegisterSelectionMerge()
127 blocks_.insert({block_id, BasicBlock(block_id)}); in RegisterBlock()
154 blocks_.insert({successor_id, BasicBlock(successor_id)}); in RegisterBlockEnd()
191 size_t Function::block_count() const { return blocks_.size(); } in block_count()
230 const auto b = blocks_.find(block_id); in GetBlock()
231 if (b != end(blocks_)) { in GetBlock()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/val/ |
| D | function.cpp | 44 blocks_(), in Function()
72 BasicBlock& merge_block = blocks_.at(merge_id); in RegisterLoopMerge()
73 BasicBlock& continue_target_block = blocks_.at(continue_id); in RegisterLoopMerge()
100 BasicBlock& merge_block = blocks_.at(merge_id); in RegisterSelectionMerge()
124 blocks_.insert({block_id, BasicBlock(block_id)}); in RegisterBlock()
151 blocks_.insert({successor_id, BasicBlock(successor_id)}); in RegisterBlockEnd()
188 size_t Function::block_count() const { return blocks_.size(); } in block_count()
227 const auto b = blocks_.find(block_id); in GetBlock()
228 if (b != end(blocks_)) { in GetBlock()
|
| /third_party/skia/third_party/externals/spirv-tools/source/val/ |
| D | function.cpp | 44 blocks_(), in Function()
72 BasicBlock& merge_block = blocks_.at(merge_id); in RegisterLoopMerge()
73 BasicBlock& continue_target_block = blocks_.at(continue_id); in RegisterLoopMerge()
100 BasicBlock& merge_block = blocks_.at(merge_id); in RegisterSelectionMerge()
124 blocks_.insert({block_id, BasicBlock(block_id)}); in RegisterBlock()
151 blocks_.insert({successor_id, BasicBlock(successor_id)}); in RegisterBlockEnd()
188 size_t Function::block_count() const { return blocks_.size(); } in block_count()
227 const auto b = blocks_.find(block_id); in GetBlock()
228 if (b != end(blocks_)) { in GetBlock()
|
| /third_party/protobuf/js/experimental/runtime/kernel/ |
| D | writer.js | 55 this.blocks_ = []; property
83 const result = concatenateByteArrays(this.blocks_);
84 this.blocks_ = []; property
105 this.blocks_.push(new Uint8Array(this.currentBuffer_));
432 this.blocks_.push(array);
442 this.blocks_.push(new Uint8Array(arrayBuffer));
457 this.blocks_.push(
|
| /third_party/node/deps/v8/src/api/ |
| D | api.h | 388 inline DetachableVector<Address*>* blocks() { return &blocks_; } in blocks()
402 blocks_.detach(); in ResetAfterArchive()
411 DCHECK(blocks_.empty()); in Free()
416 blocks_.free(); in Free()
431 DetachableVector<Address*> blocks_; variable
494 while (!blocks_.empty()) { in DeleteExtensions()
495 internal::Address* block_start = blocks_.back(); in DeleteExtensions()
511 blocks_.pop_back(); in DeleteExtensions()
520 DCHECK((blocks_.empty() && prev_limit == nullptr) || in DeleteExtensions()
521 (!blocks_.empty() && prev_limit != nullptr)); in DeleteExtensions()
|
| /third_party/node/deps/v8/src/torque/ |
| D | cfg.h | 105 blocks_.emplace_back(this, next_block_id_++, std::move(input_types), in NewBlock()
107 return &blocks_.back(); in NewBlock()
140 std::list<Block> blocks_;
|
| /third_party/protobuf/js/binary/ |
| D | writer.js | 83 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
|