64         width_(0),
79         int index = ni.node->id() * width_ + INDEX(i);  in Print()
116   int width_;  member in v8::internal::compiler::LoopFinderImpl
127     uint32_t* fp = &backward_[from->id() * width_];  in PropagateBackwardMarks()
128     uint32_t* tp = &backward_[to->id() * width_];  in PropagateBackwardMarks()
130     for (int i = 0; i < width_; i++) {  in PropagateBackwardMarks()
142     uint32_t* tp = &backward_[to->id() * width_ + INDEX(loop_num)];  in SetBackwardMark()
151     uint32_t* tp = &forward_[to->id() * width_ + INDEX(loop_num)];  in SetForwardMark()
162     int findex = from->id() * width_;  in PropagateForwardMarks()
163     int tindex = to->id() * width_;  in PropagateForwardMarks()
164     for (int i = 0; i < width_; i++) {  in PropagateForwardMarks()
175     int offset = node->id() * width_ + INDEX(loop_num);  in IsInLoop()
235     if (INDEX(loop_num) >= width_) ResizeBackwardMarks();  in CreateLoopInfo()
274     int new_width = width_ + 1;  in ResizeBackwardMarks()
278     if (width_ > 0) {  // copy old matrix data.  in ResizeBackwardMarks()
281         uint32_t* op = &backward_[i * width_];  in ResizeBackwardMarks()
282         for (int j = 0; j < width_; j++) np[j] = op[j];  in ResizeBackwardMarks()
285     width_ = new_width;  in ResizeBackwardMarks()
291     forward_ = zone_->NewArray<uint32_t>(width_ * max);  in ResizeForwardMarks()
292     memset(forward_, 0, width_ * max * sizeof(uint32_t));  in ResizeForwardMarks()
386       int pos = ni.node->id() * width_;  in FinishLoopTree()
388       for (int i = 0; i < width_; i++) {  in FinishLoopTree()