Searched refs:node (Results 1 – 3 of 3) sorted by relevance
68 for (Node* node = to_copy.buckets_[i]; node != nullptr; node = node->GetNext()) { in ValueSet() local69 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() local97 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() local113 if (node->GetInstruction() == instruction) { in Contains()122 DeleteAllImpureWhich([side_effects](Node* node) { in Kill() argument123 return node->GetInstruction()->GetSideEffects().DependsOn(side_effects); in Kill()[all …]
947 void Remove(HUseListNode<T>* node) { in Remove() argument948 DCHECK(node != nullptr); in Remove()949 DCHECK(Contains(node)); in Remove()951 if (node->prev_ != nullptr) { in Remove()952 node->prev_->next_ = node->next_; in Remove()954 if (node->next_ != nullptr) { in Remove()955 node->next_->prev_ = node->prev_; in Remove()957 if (node == first_) { in Remove()958 first_ = node->next_; in Remove()962 bool Contains(const HUseListNode<T>* node) const { in Contains() argument[all …]
612 StackTrieNode* node = trie_node_i; in Write() local613 method_size = node->GetMethodSize(); in Write()614 uint32_t count = node->GetCount(); in Write()615 uint32_t dexpc = node->GetDexPC(); in Write()618 StackTrieNode* current = node->GetParent(); in Write()896 StackTrieNode* node = new StackTrieNode(method, dex_pc, 0, nullptr); in FindChild() local897 std::set<StackTrieNode*, StackTrieNodeComparator>::iterator i = children_.find(node); in FindChild()898 delete node; in FindChild()