Home
last modified time | relevance | path

Searched refs:bb_ (Results 1 – 25 of 42) sorted by relevance

12

/third_party/protobuf/csharp/src/Google.Protobuf.Test/
DLegacyGeneratedCodeTest.cs159 private ParseContextEnabledMessageB bb_; field in Google.Protobuf.LegacyGeneratedCodeTest.LegacyGeneratedCodeMessageA
161 get { return bb_; }
163 bb_ = value;
168 if (bb_ != null) { in WriteTo()
179 if (bb_ != null) { in CalculateSize()
196 if (bb_ == null) { in MergeFrom()
/third_party/spirv-tools/source/opt/
Ddominator_tree.cpp262 return node->parent_->bb_; in ImmediateDominator()
367 if (node->bb_) { in DumpTreeAsDot()
368 out_stream << node->bb_->id() << "[label=\"" << node->bb_->id() in DumpTreeAsDot()
375 out_stream << node->parent_->bb_->id() << " -> " << node->bb_->id() in DumpTreeAsDot()
Dssa_rewrite_pass.h58 bb_(block), in PhiCandidate()
66 BasicBlock* bb() const { return bb_; } in bb()
102 BasicBlock* bb_; variable
Ddominator_tree.h34 : bb_(bb), in DominatorTreeNode()
77 inline uint32_t id() const { return bb_->id(); } in id()
79 BasicBlock* bb_; member
Dloop_descriptor.cpp235 if (loop_pred && node->bb_ != loop_pred) { in FindLoopPreheader()
240 loop_pred = node->bb_; in FindLoopPreheader()
530 Instruction* merge_inst = node.bb_->GetLoopMergeInst(); in PopulateList()
533 for (uint32_t pid : context->cfg()->preds(node.bb_->id())) { in PopulateList()
535 dom_analysis->Dominates(node.bb_->id(), pid)) { in PopulateList()
588 current_loop->AddBasicBlock(loop_node.bb_); in PopulateList()
590 std::make_pair(loop_node.bb_->id(), current_loop)); in PopulateList()
Dcontrol_dependence.cpp98 assert(!cfg.IsPseudoExitBlock(pdom.GetDomTree().post_begin()->bb_)); in ComputePostDominanceFrontiers()
99 Function* function = pdom.GetDomTree().post_begin()->bb_->GetParent(); in ComputePostDominanceFrontiers()
Dlicm_pass.cpp107 if (loop->IsInsideLoop(child_dom_tree_node->bb_)) { in AnalyseAndHoistFromBB()
108 loop_bbs->push_back(child_dom_tree_node->bb_); in AnalyseAndHoistFromBB()
Dredundancy_elimination.cpp51 bool modified = EliminateRedundanciesInBB(bb->bb_, vnTable, &value_to_ids); in EliminateRedundanciesFrom()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
Ddominator_tree.cpp274 return node->parent_->bb_; in ImmediateDominator()
379 if (node->bb_) { in DumpTreeAsDot()
380 out_stream << node->bb_->id() << "[label=\"" << node->bb_->id() in DumpTreeAsDot()
387 out_stream << node->parent_->bb_->id() << " -> " << node->bb_->id() in DumpTreeAsDot()
Dssa_rewrite_pass.h58 bb_(block), in PhiCandidate()
66 BasicBlock* bb() const { return bb_; } in bb()
102 BasicBlock* bb_; variable
Ddominator_tree.h34 : bb_(bb), in DominatorTreeNode()
77 inline uint32_t id() const { return bb_->id(); } in id()
79 BasicBlock* bb_; member
Dloop_descriptor.cpp235 if (loop_pred && node->bb_ != loop_pred) { in FindLoopPreheader()
240 loop_pred = node->bb_; in FindLoopPreheader()
529 Instruction* merge_inst = node.bb_->GetLoopMergeInst(); in PopulateList()
532 for (uint32_t pid : context->cfg()->preds(node.bb_->id())) { in PopulateList()
534 dom_analysis->Dominates(node.bb_->id(), pid)) { in PopulateList()
587 current_loop->AddBasicBlock(loop_node.bb_); in PopulateList()
589 std::make_pair(loop_node.bb_->id(), current_loop)); in PopulateList()
Dcontrol_dependence.cpp98 assert(!cfg.IsPseudoExitBlock(pdom.GetDomTree().post_begin()->bb_)); in ComputePostDominanceFrontiers()
99 Function* function = pdom.GetDomTree().post_begin()->bb_->GetParent(); in ComputePostDominanceFrontiers()
Dlicm_pass.cpp107 if (loop->IsInsideLoop(child_dom_tree_node->bb_)) { in AnalyseAndHoistFromBB()
108 loop_bbs->push_back(child_dom_tree_node->bb_); in AnalyseAndHoistFromBB()
Dredundancy_elimination.cpp51 bool modified = EliminateRedundanciesInBB(bb->bb_, vnTable, &value_to_ids); in EliminateRedundanciesFrom()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
Ddominator_tree.cpp274 return node->parent_->bb_; in ImmediateDominator()
379 if (node->bb_) { in DumpTreeAsDot()
380 out_stream << node->bb_->id() << "[label=\"" << node->bb_->id() in DumpTreeAsDot()
387 out_stream << node->parent_->bb_->id() << " -> " << node->bb_->id() in DumpTreeAsDot()
Dssa_rewrite_pass.h58 bb_(block), in PhiCandidate()
66 BasicBlock* bb() const { return bb_; } in bb()
102 BasicBlock* bb_; variable
Ddominator_tree.h34 : bb_(bb), in DominatorTreeNode()
77 inline uint32_t id() const { return bb_->id(); } in id()
79 BasicBlock* bb_; member
Dloop_descriptor.cpp235 if (loop_pred && node->bb_ != loop_pred) { in FindLoopPreheader()
240 loop_pred = node->bb_; in FindLoopPreheader()
529 Instruction* merge_inst = node.bb_->GetLoopMergeInst(); in PopulateList()
532 for (uint32_t pid : context->cfg()->preds(node.bb_->id())) { in PopulateList()
534 dom_analysis->Dominates(node.bb_->id(), pid)) { in PopulateList()
587 current_loop->AddBasicBlock(loop_node.bb_); in PopulateList()
589 std::make_pair(loop_node.bb_->id(), current_loop)); in PopulateList()
Dcontrol_dependence.cpp98 assert(!cfg.IsPseudoExitBlock(pdom.GetDomTree().post_begin()->bb_)); in ComputePostDominanceFrontiers()
99 Function* function = pdom.GetDomTree().post_begin()->bb_->GetParent(); in ComputePostDominanceFrontiers()
Dlicm_pass.cpp107 if (loop->IsInsideLoop(child_dom_tree_node->bb_)) { in AnalyseAndHoistFromBB()
108 loop_bbs->push_back(child_dom_tree_node->bb_); in AnalyseAndHoistFromBB()
Dredundancy_elimination.cpp51 bool modified = EliminateRedundanciesInBB(bb->bb_, vnTable, &value_to_ids); in EliminateRedundanciesFrom()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/opt/dominator_tree/
Dgenerated.cpp129 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
194 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_exit_block()); in TEST_F()
296 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
338 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_exit_block()); in TEST_F()
417 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
493 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_exit_block()); in TEST_F()
614 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
744 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
779 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_exit_block()); in TEST_F()
849 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
[all …]
/third_party/skia/third_party/externals/spirv-tools/test/opt/dominator_tree/
Dgenerated.cpp129 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
194 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_exit_block()); in TEST_F()
296 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
338 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_exit_block()); in TEST_F()
417 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
493 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_exit_block()); in TEST_F()
614 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
744 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
779 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_exit_block()); in TEST_F()
849 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
[all …]
/third_party/spirv-tools/test/opt/dominator_tree/
Dgenerated.cpp129 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
194 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_exit_block()); in TEST_F()
296 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
338 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_exit_block()); in TEST_F()
417 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
493 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_exit_block()); in TEST_F()
614 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
744 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
779 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_exit_block()); in TEST_F()
849 EXPECT_EQ(tree.GetRoot()->bb_, cfg.pseudo_entry_block()); in TEST_F()
[all …]

12