Lines Matching refs:node

68         for (Node* node = to_copy.buckets_[i]; node != nullptr; node = node->GetNext()) {  in ValueSet()  local
69 size_t new_index = BucketIndex(node->GetHashCode()); in ValueSet()
70 buckets_[new_index] = node->Dup(allocator_, buckets_[new_index]); in ValueSet()
96 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Lookup() local
97 if (node->GetHashCode() == hash_code) { in Lookup()
98 HInstruction* existing = node->GetInstruction(); in Lookup()
112 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Contains() local
113 if (node->GetInstruction() == instruction) { in Contains()
122 DeleteAllImpureWhich([side_effects](Node* node) { in Kill() argument
123 return node->GetInstruction()->GetSideEffects().DependsOn(side_effects); in Kill()
136 DeleteAllImpureWhich([predecessor](Node* node) { in IntersectWith() argument
137 return !predecessor->Contains(node->GetInstruction()); in IntersectWith()
154 void SetNext(Node* node) { next_ = node; } in SetNext() argument
177 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in CloneBucket() local
178 clone_current = node->Dup(allocator_, nullptr); in CloneBucket()
179 if (node == iterator) { in CloneBucket()
206 Node* node = buckets_[i]; in DeleteAllImpureWhich() local
209 if (node == nullptr) { in DeleteAllImpureWhich()
216 while (node != nullptr) { in DeleteAllImpureWhich()
217 if (cond(node)) { in DeleteAllImpureWhich()
222 node = (previous == nullptr) ? buckets_[i] : previous->GetNext(); in DeleteAllImpureWhich()
225 previous = node; in DeleteAllImpureWhich()
226 node = node->GetNext(); in DeleteAllImpureWhich()
232 DCHECK(buckets_owned_.IsBitSet(i) || node == nullptr); in DeleteAllImpureWhich()
236 while (node != nullptr) { in DeleteAllImpureWhich()
237 Node* next = node->GetNext(); in DeleteAllImpureWhich()
238 if (cond(node)) { in DeleteAllImpureWhich()
245 previous = node; in DeleteAllImpureWhich()
247 node = next; in DeleteAllImpureWhich()