| /external/v8/src/ |
| profile-generator-inl.h | 43 : tree_(tree),
|
| profile-generator.cc | 197 ProfileNode* new_node = new ProfileNode(tree_, entry);
357 tree_.Insert(addr, &locator);
367 if (!tree_.FindGreatestLessThan(addr, &locator)) break;
372 for (int i = 0; i < to_delete.length(); ++i) tree_.Remove(to_delete[i]);
378 if (tree_.FindGreatestLessThan(addr, &locator)) {
395 if (tree_.Find(addr, &locator)) {
400 tree_.Insert(addr, &locator);
411 if (!tree_.Find(from, &locator)) return;
413 tree_.Remove(from);
431 tree_.ForEach(&printer)
[all...] |
| allocation-tracker.h | 35 AllocationTraceTree* tree_; member in class:v8::internal::AllocationTraceNode
|
| allocation-tracker.cc | 16 : tree_(tree),
43 child = new AllocationTraceNode(tree_, function_info_index);
|
| profile-generator.h | 135 ProfileTree* tree_; member in class:v8::internal::ProfileNode
249 CodeTree tree_; member in class:v8::internal::CodeMap
|
| jsregexp.h | 327 explicit DispatchTable(Zone* zone) : tree_(zone) { }
377 ZoneSplayTree<Config>* tree() { return &tree_; }
378 ZoneSplayTree<Config> tree_; member in class:v8::internal::DispatchTable
426 RegExpTree* tree() const { return tree_; }
440 : cp_offset_(-1), text_type_(text_type), tree_(tree) {}
444 RegExpTree* tree_; member in class:v8::internal::BASE_EMBEDDED
[all...] |
| /external/libvpx/libvpx/vpx_mem/memory_manager/include/ |
| cavl_impl.h | 939 iter->tree_ = l_tree;
994 iter->tree_ = l_tree;
1017 iter->tree_ = l_tree;
1042 iter->tree_->root : iter->path_h[iter->depth - 1]);
1050 #define l_tree (iter->tree_)
1055 iter->tree_->root : iter->path_h[iter->depth - 1]), 1);
1092 #define l_tree (iter->tree_)
1097 iter->tree_->root : iter->path_h[iter->depth - 1]), 1);
|
| cavl_if.h | 169 L_(avl) *tree_; member in struct:__anon13941
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vpx_mem/memory_manager/include/ |
| cavl_impl.h | 939 iter->tree_ = l_tree;
994 iter->tree_ = l_tree;
1017 iter->tree_ = l_tree;
1042 iter->tree_->root : iter->path_h[iter->depth - 1]);
1050 #define l_tree (iter->tree_)
1055 iter->tree_->root : iter->path_h[iter->depth - 1]), 1);
1092 #define l_tree (iter->tree_)
1097 iter->tree_->root : iter->path_h[iter->depth - 1]), 1);
|
| cavl_if.h | 169 L_(avl) *tree_; member in struct:__anon24283
|
| /external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
| LeftRecursiveRuleWalker.g | 251 | tree_
268 tree_
|
| ANTLRTreePrinter.g | 385 | tree_
425 tree_
|
| AssignTokenTypesWalker.g | 368 | tree_
386 tree_
|
| DefineGrammarItemsWalker.g | 434 | tree_
493 tree_
|
| TreeToNFAConverter.g | 365 | tree_ {$g = $tree_.g;}
460 tree_ returns [StateCluster g=null]
|
| CodeGenTreeWalker.g | 755 | tree_
756 { $code = $tree_.code; }
881 tree_ returns [ST code]
[all...] |
| ANTLR.g | 736 | t3=tree_
773 tree_
|
| /external/jemalloc/test/unit/ |
| rb.c | 43 rb_gen(static, tree_, tree_t, node_t, link, node_cmp);
|
| /external/v8/test/cctest/ |
| test-profile-generator.cc | 96 : tree_(tree) { }
101 ProfileNode* node = tree_->root();
115 const ProfileTree* tree_; member in class:__anon19266::ProfileTreeTestHelper
|
| /external/protobuf/src/google/protobuf/compiler/ |
| command_line_interface.cc | 189 : format_(format), tree_(tree) {}
199 tree_ != NULL &&
200 tree_->VirtualFileToDiskFile(filename, &dfile)) {
230 DiskSourceTree *tree_; member in class:google::protobuf::compiler::CommandLineInterface::ErrorPrinter
[all...] |
| /external/antlr/antlr-3.4/lib/ |
| antlr-3.4-complete.jar | |
| /external/chromium-trace/trace-viewer/tracing/third_party/vinn/third_party/parse5/test/data/serialization/wiki_42/ |
| expected.html | 184 <li>It is a <a href="/wiki/Catalan_number" title="Catalan number">Catalan number</a>. Consequently; 42 is the number of <a href="/wiki/Noncrossing_partition" title="Noncrossing partition">noncrossing partitions</a> of a set of five elements, the number of triangulations of a <a href="/wiki/Heptagon" title="Heptagon">heptagon</a>, the number of rooted ordered binary <a href="/wiki/Tree_(graph_theory)" title="Tree (graph theory)">trees</a> with six leaves, the number of ways in which five pairs of nested parentheses can be arranged, etc.</li>
[all...] |
| src.html | 185 <li>It is a <a href="/wiki/Catalan_number" title="Catalan number">Catalan number</a>. Consequently; 42 is the number of <a href="/wiki/Noncrossing_partition" title="Noncrossing partition">noncrossing partitions</a> of a set of five elements, the number of triangulations of a <a href="/wiki/Heptagon" title="Heptagon">heptagon</a>, the number of rooted ordered binary <a href="/wiki/Tree_(graph_theory)" title="Tree (graph theory)">trees</a> with six leaves, the number of ways in which five pairs of nested parentheses can be arranged, etc.</li>
[all...] |
| /prebuilts/misc/common/antlr/ |
| antlr-3.4-complete.jar | |
