/external/v8/src/ |
profile-generator-inl.h | 75 : tree_(tree), 85 tree_.Insert(addr, &locator); 91 tree_.Move(from, to); 95 tree_.Remove(addr);
|
profile-generator.h | 163 ProfileTree* tree_; member in class:v8::internal::ProfileNode 277 CodeTree tree_; member in class:v8::internal::CodeMap [all...] |
profile-generator.cc | 222 ProfileNode* new_node = new ProfileNode(tree_, entry); 231 return tree_->TicksToMillis(self_ticks_); 236 return tree_->TicksToMillis(total_ticks_); 498 if (tree_.FindGreatestLessThan(addr, &locator)) { 511 if (tree_.Find(addr, &locator)) { 516 tree_.Insert(addr, &locator); 532 tree_.ForEach(&printer); [all...] |
jsregexp.h | 412 ZoneSplayTree<Config>* tree() { return &tree_; } 413 ZoneSplayTree<Config> tree_; member in class:v8::internal::DispatchTable [all...] |
/external/webkit/Source/JavaScriptCore/wtf/ |
AVLTree.h | 176 tree_ = &tree; 179 handle h = tree_->abs.root; 223 tree_ = &tree; 225 handle h = tree_->abs.root; 241 tree_ = &tree; 243 handle h = tree_->abs.root; 262 return depth == 0 ? tree_->abs.root : path_h[depth - 1]; 323 AVLTree *tree_; 337 int cmp_k_n(key k, handle h) { return tree_->abs.compare_key_node(k, h); } 338 int cmp_n_n(handle h1, handle h2) { return tree_->abs.compare_node_node(h1, h2); [all...] |
/external/libvpx/vpx_mem/memory_manager/include/ |
cavl_impl.h | 1033 iter->tree_ = l_tree; 1093 iter->tree_ = l_tree; 1118 iter->tree_ = l_tree; 1145 iter->tree_->root : iter->path_h[iter->depth - 1]); 1154 #define l_tree (iter->tree_) 1160 iter->tree_->root : iter->path_h[iter->depth - 1]), 1); 1203 #define l_tree (iter->tree_) 1209 iter->tree_->root : iter->path_h[iter->depth - 1]), 1);
|
cavl_if.h | 170 L_(avl) *tree_; member in struct:__anon7770
|
/external/v8/test/cctest/ |
test-profile-generator.cc | 117 : tree_(tree) { } 122 ProfileNode* node = tree_->root(); 136 const ProfileTree* tree_; member in class:__anon11832::ProfileTreeTestHelper
|