Searched refs:StackTrieNode (Results 1 – 2 of 2) sorted by relevance
| /art/runtime/ |
| D | profiler.h | 49 class StackTrieNode {
51 StackTrieNode(MethodReference method, uint32_t dex_pc, uint32_t method_size, in StackTrieNode() function
52 StackTrieNode* parent) : in StackTrieNode()
56 StackTrieNode() : parent_(nullptr), method_(nullptr, 0), in StackTrieNode() function
59 StackTrieNode* GetParent() { return parent_; } in GetParent()
64 void AppendChild(StackTrieNode* child) { children_.insert(child); } in AppendChild()
65 StackTrieNode* FindChild(MethodReference method, uint32_t dex_pc);
72 bool operator()(StackTrieNode* node1, StackTrieNode* node2) const { in operator()
87 std::set<StackTrieNode*, StackTrieNodeComparator> children_;
88 StackTrieNode* parent_;
[all …]
|
| D | profiler.cc | 517 stack_trie_root_ = new StackTrieNode(); in PutStack()
520 StackTrieNode* current = stack_trie_root_; in PutStack()
538 StackTrieNode* child = current->FindChild(method_ref, dex_pc); in PutStack()
547 StackTrieNode* new_node = new StackTrieNode(method_ref, dex_pc, method_size, current); in PutStack()
621 StackTrieNode* node = trie_node_i; in Write()
627 StackTrieNode* current = node->GetParent(); in Write()
900 StackTrieNode* StackTrieNode::FindChild(MethodReference method, uint32_t dex_pc) { in FindChild()
905 StackTrieNode* node = new StackTrieNode(method, dex_pc, 0, nullptr); in FindChild()
906 std::set<StackTrieNode*, StackTrieNodeComparator>::iterator i = children_.find(node); in FindChild()
911 void StackTrieNode::DeleteChildren() { in DeleteChildren()
|