Lines Matching defs:width_
76 width_(0),
92 int index = ni.node->id() * width_ + INDEX(i);
129 int width_;
141 uint32_t* fp = &backward_[from->id() * width_];
142 uint32_t* tp = &backward_[to->id() * width_];
144 for (int i = 0; i < width_; i++) {
156 uint32_t* tp = &backward_[to->id() * width_ + INDEX(loop_num)];
165 uint32_t* tp = &forward_[to->id() * width_ + INDEX(loop_num)];
176 int findex = from->id() * width_;
177 int tindex = to->id() * width_;
178 for (int i = 0; i < width_; i++) {
189 int offset = node->id() * width_ + INDEX(loop_num);
258 if (INDEX(loop_num) >= width_) ResizeBackwardMarks();
297 int new_width = width_ + 1;
301 if (width_ > 0) { // copy old matrix data.
304 uint32_t* op = &backward_[i * width_];
305 for (int j = 0; j < width_; j++) np[j] = op[j];
308 width_ = new_width;
314 forward_ = zone_->NewArray<uint32_t>(width_ * max);
315 memset(forward_, 0, width_ * max * sizeof(uint32_t));
410 int pos = ni.node->id() * width_;
412 for (int i = 0; i < width_; i++) {