105     for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {  in Lookup()  local
106       if (node->GetHashCode() == hash_code) {  in Lookup()
107         HInstruction* existing = node->GetInstruction();  in Lookup()
121     for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {  in Contains()  local
122       if (node->GetInstruction() == instruction) {  in Contains()
131     DeleteAllImpureWhich([side_effects](Node* node) {  in Kill()  argument
132       return node->GetInstruction()->GetSideEffects().MayDependOn(side_effects);  in Kill()
153       DeleteAllImpureWhich([predecessor](Node* node) {  in IntersectWith()  argument
154         return !predecessor->Contains(node->GetInstruction());  in IntersectWith()
178         for (Node* node = other.buckets_[i]; node != nullptr; node = node->GetNext()) {  in PopulateFromInternal()  local
179           size_t new_index = BucketIndex(node->GetHashCode());  in PopulateFromInternal()
180           buckets_[new_index] = node->Dup(allocator_, buckets_[new_index]);  in PopulateFromInternal()
197     void SetNext(Node* node) { next_ = node; }  in SetNext()  argument
220     for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {  in CloneBucket()  local
221       clone_current = node->Dup(allocator_, nullptr);  in CloneBucket()
222       if (node == iterator) {  in CloneBucket()
241       Node* node = buckets_[i];  in DeleteAllImpureWhich()  local
244       if (node == nullptr) {  in DeleteAllImpureWhich()
251         while (node != nullptr) {  in DeleteAllImpureWhich()
252           if (cond(node)) {  in DeleteAllImpureWhich()
257             node = (previous == nullptr) ? buckets_[i] : previous->GetNext();  in DeleteAllImpureWhich()
260           previous = node;  in DeleteAllImpureWhich()
261           node = node->GetNext();  in DeleteAllImpureWhich()
267       DCHECK(buckets_owned_.IsBitSet(i) || node == nullptr);  in DeleteAllImpureWhich()
271       while (node != nullptr) {  in DeleteAllImpureWhich()
272         Node* next = node->GetNext();  in DeleteAllImpureWhich()
273         if (cond(node)) {  in DeleteAllImpureWhich()
280           previous = node;  in DeleteAllImpureWhich()
282         node = next;  in DeleteAllImpureWhich()