102     for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {  in Lookup()  local
103       if (node->GetHashCode() == hash_code) {  in Lookup()
104         HInstruction* existing = node->GetInstruction();  in Lookup()
118     for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {  in Contains()  local
119       if (node->GetInstruction() == instruction) {  in Contains()
128     DeleteAllImpureWhich([side_effects](Node* node) {  in Kill()  argument
129       return node->GetSideEffects().MayDependOn(side_effects);  in Kill()
150       DeleteAllImpureWhich([predecessor](Node* node) {  in IntersectWith()  argument
151         return !predecessor->Contains(node->GetInstruction());  in IntersectWith()
175         for (Node* node = other.buckets_[i]; node != nullptr; node = node->GetNext()) {  in PopulateFromInternal()  local
176           size_t new_index = BucketIndex(node->GetHashCode());  in PopulateFromInternal()
177           buckets_[new_index] = node->Dup(allocator_, buckets_[new_index]);  in PopulateFromInternal()
194     void SetNext(Node* node) { next_ = node; }  in SetNext()  argument
232     for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {  in CloneBucket()  local
233       clone_current = node->Dup(allocator_, nullptr);  in CloneBucket()
234       if (node == iterator) {  in CloneBucket()
253       Node* node = buckets_[i];  in DeleteAllImpureWhich()  local
256       if (node == nullptr) {  in DeleteAllImpureWhich()
263         while (node != nullptr) {  in DeleteAllImpureWhich()
264           if (cond(node)) {  in DeleteAllImpureWhich()
269             node = (previous == nullptr) ? buckets_[i] : previous->GetNext();  in DeleteAllImpureWhich()
272           previous = node;  in DeleteAllImpureWhich()
273           node = node->GetNext();  in DeleteAllImpureWhich()
279       DCHECK(buckets_owned_.IsBitSet(i) || node == nullptr);  in DeleteAllImpureWhich()
283       while (node != nullptr) {  in DeleteAllImpureWhich()
284         Node* next = node->GetNext();  in DeleteAllImpureWhich()
285         if (cond(node)) {  in DeleteAllImpureWhich()
292           previous = node;  in DeleteAllImpureWhich()
294         node = next;  in DeleteAllImpureWhich()