Home
last modified time | relevance | path

Searched refs:dominator (Results 1 – 25 of 28) sorted by relevance

12

/external/v8/src/crankshaft/
Dhydrogen-sce.cc19 HBasicBlock* dominator = back_edge; in Run() local
21 for (HInstructionIterator it(dominator); !it.Done(); it.Advance()) { in Run()
29 if (dominator == block) break; in Run()
32 dominator = dominator->dominator(); in Run()
Dhydrogen-gvn.cc656 HBasicBlock* dominator, HBasicBlock* dominated) { in CollectSideEffectsOnPathsToDominatedBlock() argument
660 if (dominator->block_id() < block->block_id() && in CollectSideEffectsOnPathsToDominatedBlock()
669 dominator, block)); in CollectSideEffectsOnPathsToDominatedBlock()
697 HBasicBlock** dominator) { in next_in_dominator_tree_traversal() argument
700 *dominator = block(); in next_in_dominator_tree_traversal()
707 *dominator = dominator_state->block(); in next_in_dominator_tree_traversal()
711 *dominator = NULL; in next_in_dominator_tree_traversal()
Dhydrogen-gvn.h121 HBasicBlock* dominator,
Dhydrogen-bce.cc245 cursor = cursor->block()->dominator()->end(); in MoveIndexIfNecessary()
275 cursor = cursor->block()->dominator()->end(); in MoveIndexIfNecessary()
Dhydrogen-instructions.cc3679 HValue* dominator) { in HandleSideEffectDominator() argument
3686 if (!dominator->IsAllocate()) { in HandleSideEffectDominator()
3689 id(), Mnemonic(), dominator->id(), dominator->Mnemonic()); in HandleSideEffectDominator()
3695 if (FLAG_use_local_allocation_folding && dominator->block() != block()) { in HandleSideEffectDominator()
3698 id(), Mnemonic(), dominator->id(), dominator->Mnemonic()); in HandleSideEffectDominator()
3703 HAllocate* dominator_allocate = HAllocate::cast(dominator); in HandleSideEffectDominator()
3712 id(), Mnemonic(), dominator->id(), dominator->Mnemonic()); in HandleSideEffectDominator()
3721 Mnemonic(), dominator->id(), dominator->Mnemonic()); in HandleSideEffectDominator()
3730 id(), Mnemonic(), dominator->id(), dominator->Mnemonic()); in HandleSideEffectDominator()
Dhydrogen-instructions.h728 HValue* dominator) { in HandleSideEffectDominator() argument
5495 HValue* dominator) override;
5575 HAllocate* GetFoldableDominator(HAllocate* dominator);
5663 HValue* dominator) { in ReceiverObjectNeedsWriteBarrier() argument
5674 if (object == dominator && object->IsAllocate()) { in ReceiverObjectNeedsWriteBarrier()
5690 HValue* dominator) { in PointersToHereCheckForObject() argument
5694 if (object == dominator && in PointersToHereCheckForObject()
6799 HValue* dominator) override { in HandleSideEffectDominator() argument
6802 dominator_ = dominator; in HandleSideEffectDominator()
6812 HValue* dominator() const { return dominator_; } in dominator() function
[all …]
Dhydrogen-bch.cc161 current = current->dominator(); in CheckHoistability()
/external/v8/src/compiler/
Dschedule.h119 BasicBlock* dominator() const { return dominator_; } in dominator() function
120 void set_dominator(BasicBlock* dominator) { dominator_ = dominator; } in set_dominator() argument
Dscheduler.cc1106 BasicBlock* dominator = *pred; in PropagateImmediateDominators() local
1107 bool deferred = dominator->deferred(); in PropagateImmediateDominators()
1114 dominator = BasicBlock::GetCommonDominator(dominator, *pred); in PropagateImmediateDominators()
1117 block->set_dominator(dominator); in PropagateImmediateDominators()
1118 block->set_dominator_depth(dominator->dominator_depth() + 1); in PropagateImmediateDominators()
1121 dominator->id().ToInt(), block->dominator_depth()); in PropagateImmediateDominators()
1286 BasicBlock* dominator = BasicBlock::GetCommonDominator(b1, b2); in InsideSameDominatorChain() local
1287 return dominator == b1 || dominator == b2; in InsideSameDominatorChain()
1480 while (marked_[use_block->dominator()->id().ToSize()]) { in SplitNode()
1481 use_block = use_block->dominator(); in SplitNode()
[all …]
Dverifier.cc981 block = block->dominator(); in HasDominatingDef()
990 static bool Dominates(Schedule* schedule, Node* dominator, Node* dominatee) { in Dominates() argument
991 BasicBlock* dom = schedule->block(dominator); in Dominates()
997 sub = sub->dominator(); in Dominates()
1064 BasicBlock* dom = block->dominator(); in Run()
1121 BasicBlock* idom = block->dominator(); in Run()
1151 BasicBlock* idom = block->dominator(); in Run()
Dschedule.cc88 b2 = b2->dominator(); in GetCommonDominator()
90 b1 = b1->dominator(); in GetCommonDominator()
Dgraph-visualizer.cc400 if (current->dominator() != nullptr) { in PrintSchedule()
401 PrintBlockProperty("dominator", current->dominator()->rpo_number()); in PrintSchedule()
/external/llvm/docs/HistoricalNotes/
D2000-12-06-MeetingSummary.txt38 1. Including dominator information in the LLVM bytecode
41 idea, we could include an immediate dominator number for each basic block
/external/llvm/docs/
DPasses.rst105 This pass is a simple dominator construction algorithm for finding forward
106 dominator frontiers.
111 This pass is a simple dominator construction algorithm for finding forward
140 This pass, only available in ``opt``, prints the dominator tree into a ``.dot``
147 This pass, only available in ``opt``, prints the dominator tree into a ``.dot``
154 This pass, only available in ``opt``, prints the post dominator tree into a
161 This pass, only available in ``opt``, prints the post dominator tree into a
267 This pass is a simple post-dominator construction algorithm for finding
268 post-dominator frontiers.
273 This pass is a simple post-dominator construction algorithm for finding
[all …]
DWritingAnLLVMPass.rst176 an analysis pass, for example dominator tree pass, then ``true`` is supplied as
827 affect the results of dominator analysis. By default, all passes are assumed
841 dominator related analyses if they exist, so it can preserve them, despite the
1111 dominator and immediate dominator information to do its job. The LICM pass
1112 uses natural loop information, which uses dominator sets, but not immediate
1114 pass, it is immediately destroyed. The dominator sets are then reused to
1118 the :program:`opt` tool), which uses the dominator set to check that the
1119 resultant LLVM code is well formed. After it finishes, the dominator set
1193 Which shows that we don't accidentally invalidate dominator information
DCompileCudaWithLLVM.rst156 effective on code along dominator paths.
/external/llvm/test/Analysis/ValueTracking/
Dpr24866.ll3 ; asking for a dominator tree Node. This reproducer is really fragile,
/external/llvm/test/Transforms/Sink/
Dbasic.ll40 ; Sink to the nearest post-dominator
/external/v8/test/unittests/compiler/
Dschedule-unittest.cc24 EXPECT_EQ(nullptr, b.dominator()); in TEST_F()
/external/llvm/test/CodeGen/AArch64/
Darm64-shrink-wrapping.ll545 ; immediate (post) dominator for the (restore) save blocks. When either the Save
547 ; dominator is itself. In this case, we cannot perform shrink wrapping, but we
/external/llvm/test/CodeGen/ARM/
Darm-shrink-wrapping.ll540 ; immediate (post) dominator for the (restore) save blocks. When either the Save
542 ; dominator is itself. In this case, we cannot perform shrink wrapping, but we
/external/llvm/test/CodeGen/PowerPC/
Dppc-shrink-wrapping.ll531 ; immediate (post) dominator for the (restore) save blocks. When either the Save
533 ; dominator is itself. In this case, we cannot perform shrink wrapping, but we
/external/llvm/test/Transforms/RewriteStatepointsForGC/
Drelocation.ll270 ; This is a phi outside the dominator region of the new defs inserted by
/external/llvm/test/Transforms/LICM/
Dsinking.ll169 ; some exits out of the loop, and that we can do so without breaking dominator
/external/llvm/test/CodeGen/X86/
Dx86-shrink-wrapping.ll644 ; immediate (post) dominator for the (restore) save blocks. When either the Save
646 ; dominator is itself. In this case, we cannot perform shrink wrapping, but we

12