Home
last modified time | relevance | path

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

/external/chromium_org/v8/src/
Dhydrogen-sce.cc20 HBasicBlock* dominator = back_edge; in Run() local
22 for (HInstructionIterator it(dominator); !it.Done(); it.Advance()) { in Run()
30 if (dominator == block) break; in Run()
33 dominator = dominator->dominator(); in Run()
Dhydrogen-gvn.cc648 HBasicBlock* dominator, HBasicBlock* dominated) { in CollectSideEffectsOnPathsToDominatedBlock() argument
652 if (dominator->block_id() < block->block_id() && in CollectSideEffectsOnPathsToDominatedBlock()
661 dominator, block)); in CollectSideEffectsOnPathsToDominatedBlock()
689 HBasicBlock** dominator) { in next_in_dominator_tree_traversal() argument
692 *dominator = block(); in next_in_dominator_tree_traversal()
699 *dominator = dominator_state->block(); in next_in_dominator_tree_traversal()
703 *dominator = NULL; in next_in_dominator_tree_traversal()
Dhydrogen-instructions.cc3685 HValue* dominator) { in HandleSideEffectDominator() argument
3691 if (!dominator->IsAllocate()) { in HandleSideEffectDominator()
3694 id(), Mnemonic(), dominator->id(), dominator->Mnemonic()); in HandleSideEffectDominator()
3700 if (FLAG_use_local_allocation_folding && dominator->block() != block()) { in HandleSideEffectDominator()
3703 id(), Mnemonic(), dominator->id(), dominator->Mnemonic()); in HandleSideEffectDominator()
3708 HAllocate* dominator_allocate = HAllocate::cast(dominator); in HandleSideEffectDominator()
3717 id(), Mnemonic(), dominator->id(), dominator->Mnemonic()); in HandleSideEffectDominator()
3731 id(), Mnemonic(), dominator->id(), dominator->Mnemonic()); in HandleSideEffectDominator()
3862 HAllocate* HAllocate::GetFoldableDominator(HAllocate* dominator) { in GetFoldableDominator() argument
3863 if (!IsFoldable(dominator)) { in GetFoldableDominator()
[all …]
Dhydrogen-gvn.h122 HBasicBlock* dominator,
Dhydrogen-bce.cc241 cursor = cursor->block()->dominator()->end(); in MoveIndexIfNecessary()
266 cursor = cursor->block()->dominator()->end(); in MoveIndexIfNecessary()
Dhydrogen-instructions.h796 HValue* dominator) { in HandleSideEffectDominator() argument
5596 HValue* dominator) OVERRIDE;
5679 HAllocate* GetFoldableDominator(HAllocate* dominator);
5773 HValue* dominator) { in ReceiverObjectNeedsWriteBarrier() argument
5787 if (object == dominator && object->IsAllocate()) { in ReceiverObjectNeedsWriteBarrier()
5812 HValue* dominator) { in PointersToHereCheckForObject() argument
5816 if (object == dominator && in PointersToHereCheckForObject()
6845 HValue* dominator) OVERRIDE { in HandleSideEffectDominator() argument
6848 dominator_ = dominator; in HandleSideEffectDominator()
6858 HValue* dominator() const { return dominator_; } in dominator() function
[all …]
Dhydrogen-bch.cc161 current = current->dominator(); in CheckHoistability()
Dhydrogen.cc285 HBasicBlock* current = other->dominator(); in Dominates()
288 current = current->dominator(); in Dominates()
379 } else if (other->dominator() != NULL) { in AssignCommonDominator()
385 first = first->dominator(); in AssignCommonDominator()
387 second = second->dominator(); in AssignCommonDominator()
629 DCHECK(entry_block_->dominator() == NULL); in Verify()
634 if (block->dominator() == NULL) { in Verify()
641 block->dominator()); in Verify()
12279 if (current->dominator() != NULL) { in Trace()
12280 PrintBlockProperty("dominator", current->dominator()->block_id()); in Trace()
Dhydrogen.h67 HBasicBlock* dominator() const { return dominator_; } in dominator() function
/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.rst179 an analysis pass, for example dominator tree pass, then ``true`` is supplied as
832 affect the results of dominator analysis. By default, all passes are assumed
846 dominator related analyses if they exist, so it can preserve them, despite the
1116 dominator and immediate dominator information to do its job. The LICM pass
1117 uses natural loop information, which uses dominator sets, but not immediate
1119 pass, it is immediately destroyed. The dominator sets are then reused to
1123 the :program:`opt` tool), which uses the dominator set to check that the
1124 resultant LLVM code is well formed. After it finishes, the dominator set
1198 Which shows that we don't accidentally invalidate dominator information
DProgrammersManual.rst33 describing how to use extension libraries, such as dominator information, CFG
/external/chromium_org/v8/src/compiler/
Dscheduler.cc334 BasicBlock* dominator = *current_pred; in GenerateImmediateDominatorTree() local
343 dominator = GetCommonDominator(dominator, *current_pred); in GenerateImmediateDominatorTree()
347 current_rpo->dominator_ = dominator; in GenerateImmediateDominatorTree()
348 Trace("Block %d's idom is %d\n", current_rpo->id(), dominator->id()); in GenerateImmediateDominatorTree()
/external/llvm/test/Transforms/Sink/
Dbasic.ll40 ; Sink to the nearest post-dominator
/external/llvm/test/Transforms/LICM/
Dsinking.ll169 ; some exits out of the loop, and that we can do so without breaking dominator
/external/chromium_org/third_party/sqlite/src/test/
Dfts1porter.test6258 dominator domin