Home
last modified time | relevance | path

Searched refs:loop_num (Results 1 – 2 of 2) sorted by relevance

/external/v8/src/compiler/
Dloop-analysis.cc140 bool SetBackwardMark(Node* to, int loop_num) { in SetBackwardMark() argument
141 uint32_t* tp = &backward_[to->id() * width_ + INDEX(loop_num)]; in SetBackwardMark()
143 uint32_t next = prev | BIT(loop_num); in SetBackwardMark()
149 bool SetForwardMark(Node* to, int loop_num) { in SetForwardMark() argument
150 uint32_t* tp = &forward_[to->id() * width_ + INDEX(loop_num)]; in SetForwardMark()
152 uint32_t next = prev | BIT(loop_num); in SetForwardMark()
173 bool IsInLoop(Node* node, int loop_num) { in IsInLoop() argument
174 int offset = node->id() * width_ + INDEX(loop_num); in IsInLoop()
175 return backward_[offset] & forward_[offset] & BIT(loop_num); in IsInLoop()
190 int loop_num = -1; in PropagateBackward() local
[all …]
Dscheduler.cc936 size_t loop_num = GetLoopNumber(header); in ComputeLoopInfo() local
937 if (loops_[loop_num].header == nullptr) { in ComputeLoopInfo()
938 loops_[loop_num].header = header; in ComputeLoopInfo()
939 loops_[loop_num].members = new (zone_) in ComputeLoopInfo()
947 if (!loops_[loop_num].members->Contains(member->id().ToInt())) { in ComputeLoopInfo()
948 loops_[loop_num].members->Add(member->id().ToInt()); in ComputeLoopInfo()
960 if (!loops_[loop_num].members->Contains(pred->id().ToInt())) { in ComputeLoopInfo()
961 loops_[loop_num].members->Add(pred->id().ToInt()); in ComputeLoopInfo()