| /external/v8/src/ |
| roots-inl.h | 21 return type::cast(heap_->roots_[Heap::k##camel_name##RootIndex]); \
25 bit_cast<type**>(&heap_->roots_[Heap::k##camel_name##RootIndex])); \
32 return String::cast(heap_->roots_[Heap::k##name##RootIndex]); \
36 bit_cast<String**>(&heap_->roots_[Heap::k##name##RootIndex])); \
43 return Symbol::cast(heap_->roots_[Heap::k##name##RootIndex]); \
47 bit_cast<Symbol**>(&heap_->roots_[Heap::k##name##RootIndex])); \
54 return Symbol::cast(heap_->roots_[Heap::k##name##RootIndex]); \
58 bit_cast<Symbol**>(&heap_->roots_[Heap::k##name##RootIndex])); \
66 return Map::cast(heap_->roots_[Heap::k##Name##MapRootIndex]); \
70 bit_cast<Map**>(&heap_->roots_[Heap::k##Name##MapRootIndex]));
[all...] |
| isolate.cc | [all...] |
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| dominator_tree.h | 133 roots_iterator roots_begin() { return roots_.begin(); }
134 roots_iterator roots_end() { return roots_.end(); }
137 roots_const_iterator roots_cbegin() const { return roots_.begin(); }
138 roots_const_iterator roots_cend() const { return roots_.end(); }
144 assert(roots_.size() == 1);
145 return *roots_.begin();
149 assert(roots_.size() == 1);
150 return *roots_.begin();
153 const DominatorTreeNodeList& Roots() const { return roots_; }
208 roots_.clear()
293 std::vector<DominatorTreeNode*> roots_; member in class:spvtools::opt::DominatorTree
[all...] |
| dominator_tree.cpp | 343 if (std::find(roots_.begin(), roots_.end(), first) == roots_.end())
344 roots_.push_back(first);
368 for (auto root : roots_) DepthFirstSearch(root, getSucc, preFunc, postFunc);
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| dominator_tree.h | 133 roots_iterator roots_begin() { return roots_.begin(); }
134 roots_iterator roots_end() { return roots_.end(); }
137 roots_const_iterator roots_cbegin() const { return roots_.begin(); }
138 roots_const_iterator roots_cend() const { return roots_.end(); }
144 assert(roots_.size() == 1);
145 return *roots_.begin();
149 assert(roots_.size() == 1);
150 return *roots_.begin();
153 const DominatorTreeNodeList& Roots() const { return roots_; }
208 roots_.clear()
293 std::vector<DominatorTreeNode*> roots_; member in class:spvtools::opt::DominatorTree
[all...] |
| dominator_tree.cpp | 343 if (std::find(roots_.begin(), roots_.end(), first) == roots_.end())
344 roots_.push_back(first);
368 for (auto root : roots_) DepthFirstSearch(root, getSucc, preFunc, postFunc);
|
| /art/runtime/ |
| class_table_test.cc | 62 roots_.insert(root->AsMirrorPtr());
65 mutable std::set<mirror::Object*> roots_; member in class:art::mirror::CollectRootVisitor
122 EXPECT_TRUE(roots.roots_.find(h_X.Get()) != roots.roots_.end());
123 EXPECT_TRUE(roots.roots_.find(h_Y.Get()) != roots.roots_.end());
124 EXPECT_TRUE(roots.roots_.find(obj_X.Get()) != roots.roots_.end());
|
| gc_root.h | 272 roots_[buffer_pos_++] = root;
276 visitor_->VisitRoots(roots_, buffer_pos_, root_info_);
283 mirror::CompressedReference<mirror::Object>* roots_[kBufferSize]; member in class:art::BufferedRootVisitor
|
| /external/v8/src/heap/ |
| factory-inl.h | 22 &isolate()->heap()->roots_[Heap::k##camel_name##RootIndex])); \
30 &isolate()->heap()->roots_[Heap::k##Name##MapRootIndex])); \
38 &isolate()->heap()->roots_[Heap::k##Name##Size##MapRootIndex])); \
46 &isolate()->heap()->roots_[Heap::k##Name##Size##MapRootIndex])); \
54 &isolate()->heap()->roots_[Heap::k##name##RootIndex])); \
62 &isolate()->heap()->roots_[Heap::k##name##RootIndex])); \
70 &isolate()->heap()->roots_[Heap::k##name##RootIndex])); \
81 ->roots_[Heap::k##AccessorName##AccessorRootIndex])); \
|
| setup-heap-internal.cc | 291 roots_[entry.index] = map;
333 FinalizePartialMap(Map::cast(roots_[entry.index]));
388 roots_[entry.index] = map;
633 roots_[constant_string_table[i].index] = *str;
703 roots_[k##name##RootIndex] = *symbol; \
716 roots_[k##name##RootIndex] = *name;
726 roots_[k##name##RootIndex] = *name;
[all...] |
| heap.h | 829 Object* root(RootListIndex index) { return roots_[index]; }
831 return Handle<Object>(&roots_[index]);
836 if (handle_location >= &roots_[kRootListLength]) return false;
837 if (handle_location < &roots_[0]) return false;
838 *index = static_cast<RootListIndex>(handle_location - &roots_[0]);
843 Object** roots_array_start() { return roots_; }
871 roots_[kMaterializedObjectsRootIndex] = objects;
875 roots_[kScriptListRootIndex] = value;
879 roots_[kStringTableRootIndex] = value;
883 roots_[kNoScriptSharedFunctionInfosRootIndex] = value
1980 Object* roots_[kRootListLength]; member in class:v8::internal::GarbageCollectionReason::Heap
[all...] |
| heap-inl.h | 56 type* Heap::name() { return type::cast(roots_[k##camel_name##RootIndex]); }
62 return Map::cast(roots_[k##Name##Size##MapRootIndex]); \
69 return AccessorInfo::cast(roots_[k##AccessorName##AccessorRootIndex]); \
81 roots_[k##camel_name##RootIndex] = value; \
|
| heap.cc | 243 memset(roots_, 0, sizeof(roots_[0]) * kRootListLength);
708 roots_[kCodeStubsRootIndex] = value;
[all...] |
| factory.cc | 776 isolate()->heap()->roots_[Heap::kempty_stringRootIndex] == nullptr);
[all...] |
| /art/runtime/hprof/ |
| hprof.cc | 1109 mutable std::set<mirror::Object*> roots_; member in class:art::hprof::RootCollector
[all...] |
| /art/dex2oat/linker/ |
| image_writer.cc | 2266 std::vector<mirror::Object*>* const roots_; member in class:art::linker::ImageWriter::GetRootsVisitor::std
[all...] |
