Home
last modified time | relevance | path

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

12

/third_party/spirv-tools/source/opt/
Dfunction.h102 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 …]
Dfunction.cpp42 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()
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
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
Dfunction.h101 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 …]
Dfunction.cpp42 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()
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
/third_party/skia/third_party/externals/spirv-tools/source/opt/
Dfunction.h101 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 …]
Dfunction.cpp42 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()
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
/third_party/flutter/skia/third_party/externals/spirv-tools/source/opt/
Dfunction.h60 iterator begin() { return iterator(&blocks_, blocks_.begin()); } in begin()
61 iterator end() { return iterator(&blocks_, blocks_.end()); } in end()
63 return const_iterator(&blocks_, blocks_.cbegin()); in cbegin()
66 return const_iterator(&blocks_, blocks_.cend()); in cend()
89 std::vector<std::unique_ptr<BasicBlock>> blocks_; variable
102 blocks_.emplace_back(std::move(b)); in AddBasicBlock()
Dfunction.cpp24 for (auto& bb : blocks_) bb->ForEachInst(f, run_on_debug_line_insts); in ForEachInst()
38 for (const auto& bb : blocks_) in ForEachInst()
/third_party/flutter/skia/third_party/externals/spirv-tools/source/val/
Dfunction.cpp50 blocks_(), in Function()
78 BasicBlock& merge_block = blocks_.at(merge_id); in RegisterLoopMerge()
79 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()
153 blocks_.insert({successor_id, BasicBlock(successor_id)}); in RegisterBlockEnd()
191 size_t Function::block_count() const { return blocks_.size(); } in block_count()
228 const auto b = blocks_.find(block_id); in GetBlock()
229 if (b != end(blocks_)) { in GetBlock()
Dfunction.h232 std::unordered_map<uint32_t, BasicBlock> blocks_; variable
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/val/
Dfunction.cpp44 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()
Dfunction.h298 std::unordered_map<uint32_t, BasicBlock> blocks_; variable
/third_party/skia/third_party/externals/spirv-tools/source/val/
Dfunction.cpp44 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()
Dfunction.h298 std::unordered_map<uint32_t, BasicBlock> blocks_; variable
/third_party/spirv-tools/source/val/
Dfunction.cpp44 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()
Dfunction.h298 std::unordered_map<uint32_t, BasicBlock> blocks_; variable
/third_party/protobuf/js/experimental/runtime/kernel/
Dwriter.js55 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/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
/third_party/vk-gl-cts/external/vulkan-docs/src/style/
Dmarkup.txt195 blocks_ used to group markup together, blocks should be delimited by exactly

12