HomeSort by relevance Sort by last modified time
    Searched refs:dominator (Results 1 - 25 of 51) sorted by null

1 2 3

  /external/v8/src/crankshaft/
hydrogen-sce.cc 11 // For each loop block walk the dominator tree from the backwards branch to
19 HBasicBlock* dominator = back_edge; local
21 for (HInstructionIterator it(dominator); !it.Done(); it.Advance()) {
29 if (dominator == block) break;
31 // Move up the dominator tree.
32 dominator = dominator->dominator();
hydrogen-gvn.h 121 HBasicBlock* dominator,
144 // Used when collecting side effects on paths from dominator to
hydrogen-gvn.cc 656 HBasicBlock* dominator, HBasicBlock* dominated) {
660 if (dominator->block_id() < block->block_id() &&
669 dominator, block));
677 // traversal of the dominator tree done during GVN (the stack is handled
680 // of the dominator tree but this forces us to initialize each frame calling
697 HBasicBlock** dominator) {
700 *dominator = block();
707 *dominator = dominator_state->block();
711 *dominator = NULL;
745 // No need to copy the map for the last child in the dominator tree
    [all...]
hydrogen-bce.cc 12 // dominator tree.
14 // If in the dominator tree we check "exp + v1" and later (dominated)
86 // We scan the code with a dominator tree traversal.
87 // Traversing the dominator tree we keep a stack (implemented as a singly
91 // use it to "clean up" the dictionary when backtracking in the dominator tree
245 cursor = cursor->block()->dominator()->end();
275 cursor = cursor->block()->dominator()->end();
430 // Even better would be: distinguish between read-only dominator-imposed
hydrogen-bch.cc 161 current = current->dominator();
hydrogen-instructions.cc     [all...]
hydrogen-instructions.h 728 HValue* dominator) {
6812 HValue* dominator() const { return dominator_; } function in class:final::final
7072 HValue* dominator() const { return dominator_; } function in class:final::final
    [all...]
hydrogen.cc 281 HBasicBlock* current = other->dominator();
284 current = current->dominator();
375 } else if (other->dominator() != NULL) {
381 first = first->dominator();
383 second = second->dominator();
428 // dominator information about the current loop that's being processed,
624 // Check that entry block dominator is NULL.
625 DCHECK(entry_block_->dominator() == NULL);
630 if (block->dominator() == NULL) {
631 // Only start block may have no dominator assigned to
    [all...]
  /system/core/libmemunreachable/
LeakFolding.cpp 57 void LeakFolding::AccumulateLeaks(SCCInfo* dominator) {
60 if (scc->accumulator != dominator) {
61 scc->accumulator = dominator;
62 dominator->cuumulative_size += scc->size;
63 dominator->cuumulative_count += scc->count;
69 walk(dominator);
105 scc->dominator = true;
125 if (leak.scc->dominator) {
LeakFolding.h 54 bool dominator; member in struct:LeakFolding::SCCInfo
59 dominator(false), accumulator(nullptr) {}
82 void AccumulateLeaks(SCCInfo* dominator);
  /art/tools/ahat/src/
AhatSnapshot.java 53 // Collection of objects whose immediate dominator is the SENTINEL_ROOT.
90 Instance dominator = inst.getImmediateDominator(); local
91 if (dominator != null) {
94 if (dominator == Snapshot.SENTINEL_ROOT) {
104 List<Instance> instances = mDominated.get(dominator);
107 mDominated.put(dominator, instances);
163 * Returns a collection of instances whose immediate dominator is the
  /external/v8/src/compiler/
schedule.h 119 BasicBlock* dominator() const { return dominator_; } function in class:v8::internal::compiler::final
120 void set_dominator(BasicBlock* dominator) { dominator_ = dominator; }
144 // Computes the immediate common dominator of {b1} and {b2}. The worst time
145 // complexity is O(N) where N is the height of the dominator tree.
152 int32_t dominator_depth_; // Depth within the dominator tree.
153 BasicBlock* dominator_; // Immediate dominator of the block.
scheduler.cc 586 // Phase 2: Compute special RPO and dominator tree.
1106 BasicBlock* dominator = *pred; local
1286 BasicBlock* dominator = BasicBlock::GetCommonDominator(b1, b2); local
    [all...]
verifier.cc     [all...]
schedule.cc 88 b2 = b2->dominator();
90 b1 = b1->dominator();
graph-visualizer.cc 400 if (current->dominator() != nullptr) {
401 PrintBlockProperty("dominator", current->dominator()->rpo_number());
  /art/compiler/optimizing/
gvn.cc 397 // are allocated and populated by the dominator, and updated by all blocks
398 // in the path from the dominator to the block.
429 HBasicBlock* dominator = block->GetDominator(); local
430 ValueSet* dominator_set = FindSetFor(dominator);
432 if (dominator->GetSuccessors().size() == 1) {
433 // `block` is a direct successor of its dominator. No need to clone the
434 // dominator's set, `block` can take over its ownership including its buckets.
435 DCHECK_EQ(dominator->GetSingleSuccessor(), block);
436 AbandonSetFor(dominator);
  /external/v8/test/unittests/compiler/
schedule-unittest.cc 24 EXPECT_EQ(nullptr, b.dominator());
  /system/core/libmemunreachable/tests/
LeakFolding_test.cpp 95 TEST_F(LeakFoldingTest, dominator) {
  /prebuilts/tools/common/m2/repository/com/squareup/haha/haha/1.3/
haha-1.3.jar 
  /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/24.4.0-beta3/
perflib-24.4.0-beta3.jar 
  /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/24.4.0-beta6/
perflib-24.4.0-beta6.jar 
  /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/24.5.0/
perflib-24.5.0.jar 
  /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.0.0/
perflib-25.0.0.jar 
  /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.0.0-alpha1/
perflib-25.0.0-alpha1.jar 

Completed in 287 milliseconds

1 2 3