Searched refs:node (Results 1 – 3 of 3) sorted by relevance
103 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Lookup() local104 if (node->GetHashCode() == hash_code) { in Lookup()105 HInstruction* existing = node->GetInstruction(); in Lookup()119 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Contains() local120 if (node->GetInstruction() == instruction) { in Contains()129 DeleteAllImpureWhich([side_effects](Node* node) { in Kill() argument130 return node->GetInstruction()->GetSideEffects().MayDependOn(side_effects); in Kill()151 DeleteAllImpureWhich([predecessor](Node* node) { in IntersectWith() argument152 return !predecessor->Contains(node->GetInstruction()); in IntersectWith()190 for (Node* node = other.buckets_[i]; node != nullptr; node = node->GetNext()) { in PopulateFromInternal() local[all …]
621 StackTrieNode* node = trie_node_i; in Write() local622 method_size = node->GetMethodSize(); in Write()623 uint32_t count = node->GetCount(); in Write()624 uint32_t dexpc = node->GetDexPC(); in Write()627 StackTrieNode* current = node->GetParent(); in Write()905 StackTrieNode* node = new StackTrieNode(method, dex_pc, 0, nullptr); in FindChild() local906 std::set<StackTrieNode*, StackTrieNodeComparator>::iterator i = children_.find(node); in FindChild()907 delete node; in FindChild()
372 bool ContainsNode(const_reference node) const { in ContainsNode() argument374 if (std::addressof(n) == std::addressof(node)) { in ContainsNode()