Cross Reference: /art/compiler/optimizing/nodes.h

Lines Matching defs:index_
1353   size_t GetIndex() const { return index_; }
1354   void SetIndex(size_t index) { index_ = index; }
1362       : user_(user), index_(index) {}
1365   size_t index_;
2179   explicit HInputIterator(HInstruction* instruction) : instruction_(instruction), index_(0) {}
2181   bool Done() const { return index_ == instruction_->InputCount(); }
2182   HInstruction* Current() const { return instruction_->InputAt(index_); }
2183   void Advance() { index_++; }
2187   size_t index_;
2838         index_(index) {
2845     return other->AsClassTableGet()->GetIndex() == index_ &&
2850   size_t GetIndex() const { return index_; }
2864   const size_t index_;
4783         index_(index) {
4790   uint8_t GetIndex() const { return index_; }
4810   const uint8_t index_;
4967         index_(index),
4974   uint32_t GetFieldIndex() const { return index_; }
4984   const uint32_t index_;
6402   explicit HInsertionOrderIterator(const HGraph& graph) : graph_(graph), index_(0) {}
6404   bool Done() const { return index_ == graph_.GetBlocks().size(); }
6405   HBasicBlock* Current() const { return graph_.GetBlocks()[index_]; }
6406   void Advance() { ++index_; }
6410   size_t index_;
6417   explicit HReversePostOrderIterator(const HGraph& graph) : graph_(graph), index_(0) {
6422   bool Done() const { return index_ == graph_.GetReversePostOrder().size(); }
6423   HBasicBlock* Current() const { return graph_.GetReversePostOrder()[index_]; }
6424   void Advance() { ++index_; }
6428   size_t index_;
6436       : graph_(graph), index_(graph_.GetReversePostOrder().size()) {
6441   bool Done() const { return index_ == 0; }
6442   HBasicBlock* Current() const { return graph_.GetReversePostOrder()[index_ - 1u]; }
6443   void Advance() { --index_; }
6447   size_t index_;
6455       : order_(graph.GetLinearOrder()), index_(graph.GetLinearOrder().size()) {}
6457   bool Done() const { return index_ == 0; }
6459   HBasicBlock* Current() const { return order_[index_ - 1u]; }
6462     --index_;
6463     DCHECK_GE(index_, 0U);
6468   size_t index_;
6476       : order_(graph.GetLinearOrder()), index_(0) {}
6478   bool Done() const { return index_ == order_.size(); }
6479   HBasicBlock* Current() const { return order_[index_]; }
6480   void Advance() { ++index_; }
6484   size_t index_;
6497         index_(0) {
6498     if (!blocks_in_loop_.IsBitSet(index_)) {
6503   bool Done() const { return index_ == blocks_.size(); }
6504   HBasicBlock* Current() const { return blocks_[index_]; }
6506     ++index_;
6507     for (size_t e = blocks_.size(); index_ < e; ++index_) {
6508       if (blocks_in_loop_.IsBitSet(index_)) {
6517   size_t index_;
6530         index_(0) {
6531     if (!blocks_in_loop_.IsBitSet(blocks_[index_]->GetBlockId())) {
6536   bool Done() const { return index_ == blocks_.size(); }
6537   HBasicBlock* Current() const { return blocks_[index_]; }
6539     ++index_;
6540     for (size_t e = blocks_.size(); index_ < e; ++index_) {
6541       if (blocks_in_loop_.IsBitSet(blocks_[index_]->GetBlockId())) {
6550   size_t index_;