Home
last modified time | relevance | path

Searched refs:rpo_number_ (Results 1 – 9 of 9) sorted by relevance

/external/v8/src/compiler/
Dscheduler.cc367 max_rpo = block->rpo_number_; in Pre()
521 while (hoist_block != NULL && hoist_block->rpo_number_ >= min_rpo) { in Pre()
751 l->block->rpo_number_ = static_cast<int>(final_order->size()); in Serialize()
774 if (child->rpo_number_ == unvisited) { in Push()
777 child->rpo_number_ = kBlockOnStack; in Push()
856 PrintF(" range: [%d, %d)", block->rpo_number_, block->loop_end_); in PrintRPO()
873 DCHECK(header->rpo_number_ >= 0); in VerifySpecialRPO()
874 DCHECK(header->rpo_number_ < static_cast<int>(order->size())); in VerifySpecialRPO()
877 DCHECK(header->loop_end_ > header->rpo_number_); in VerifySpecialRPO()
890 DCHECK(l->block->rpo_number_ == links + loop->header->rpo_number_); in VerifySpecialRPO()
[all …]
Dscheduler.h69 DCHECK(block->rpo_number_ >= 0 && in GetRPONumber()
70 block->rpo_number_ < static_cast<int>(schedule_->rpo_order_.size())); in GetRPONumber()
71 DCHECK(schedule_->rpo_order_[block->rpo_number_] == block); in GetRPONumber()
72 return block->rpo_number_; in GetRPONumber()
Dschedule.h40 int32_t rpo_number_; // special RPO number of the block. variable
56 : rpo_number_(-1), in BasicBlockData()
71 DCHECK(rpo_number_ >= 0); in LoopContains()
72 DCHECK(block->rpo_number_ >= 0); in LoopContains()
74 return block->rpo_number_ >= rpo_number_ && block->rpo_number_ < loop_end_; in LoopContains()
Dcode-generator.h44 return block->rpo_number_ == (current_block_->rpo_number_ + 1) && in IsNextInAssemblyOrder()
Dverifier.cc313 CHECK_EQ(static_cast<int>(b), block->rpo_number_); in Run()
321 CHECK_LT(dom->rpo_number_, block->rpo_number_); in Run()
347 CHECK_GE(block->rpo_number_, 0); in Run()
348 CHECK_EQ(block, rpo_order->at(block->rpo_number_)); in Run()
Dinstruction.cc429 os << "RPO#" << block->rpo_number_ << ": B" << bid; in operator <<()
430 CHECK(block->rpo_number_ == i); in operator <<()
432 os << " loop blocks: [" << block->rpo_number_ << ", " << block->loop_end_ in operator <<()
Dregister-allocator.cc539 BitVector* live_in = live_in_sets_[successor->rpo_number_]; in ComputeLiveOut()
1255 return block->PredecessorAt(0)->rpo_number_ == block->rpo_number_ - 1; in CanEagerlyResolveControlFlow()
1264 BitVector* live = live_in_sets_[block->rpo_number_]; in ResolveControlFlow()
1351 for (int i = block->rpo_number_ + 1; i < block->loop_end_; ++i) { in BuildLiveRanges()
2100 code()->GetContainingLoop(block)->rpo_number_ > in FindOptimalSplitPos()
2101 start_block->rpo_number_) { in FindOptimalSplitPos()
Dinstruction-selector.cc144 return block->rpo_number_ == (current_block_->rpo_number_ + 1) && in IsNextInAssemblyOrder()
/external/v8/test/cctest/compiler/
Dtest-scheduler.cc51 CHECK(order->at(i)->rpo_number_ == i); in CheckRPONumbers()
60 CHECK_EQ(body_size, (header->loop_end_ - header->rpo_number_)); in CheckLoopContains()
62 int num = blocks[i]->rpo_number_; in CheckLoopContains()
63 CHECK(num >= header->rpo_number_ && num < header->loop_end_); in CheckLoopContains()
147 if (block->rpo_number_ >= 0 && block->SuccessorCount() == 1) { in TEST()
148 CHECK(block->rpo_number_ + 1 == block->SuccessorAt(0)->rpo_number_); in TEST()
218 CHECK_EQ(0, A->rpo_number_); in TEST()
219 CHECK((B->rpo_number_ == 1 && C->rpo_number_ == 2) || in TEST()
220 (B->rpo_number_ == 2 && C->rpo_number_ == 1)); in TEST()
221 CHECK_EQ(3, D->rpo_number_); in TEST()