HomeSort by relevance Sort by last modified time
    Searched refs:roots_ (Results 1 - 10 of 10) sorted by null

  /external/libchrome/base/trace_event/
heap_profiler_stack_frame_deduplicator.h 70 std::map<StackFrame, int> roots_; member in class:base::trace_event::StackFrameDeduplicator
heap_profiler_stack_frame_deduplicator.cc 30 std::map<StackFrame, int>* nodes = &roots_;
102 size_t maps_size = roots_.size() * sizeof(std::pair<StackFrame, int>);
  /system/core/libmemunreachable/
HeapWalker.cpp 89 roots_.push_back(Range{begin, end});
106 for (auto it = roots_.begin(); it != roots_.end(); it++) {
HeapWalker.h 53 roots_(allocator), root_vals_(allocator),
99 allocator::vector<Range> roots_; member in class:HeapWalker
  /art/runtime/
gc_root.h 250 roots_[buffer_pos_++] = root;
254 visitor_->VisitRoots(roots_, buffer_pos_, root_info_);
261 mirror::CompressedReference<mirror::Object>* roots_[kBufferSize]; member in class:art::BufferedRootVisitor
  /external/v8/src/heap/
heap-inl.h 51 type* Heap::name() { return type::cast(roots_[k##camel_name##RootIndex]); }
56 Map* Heap::name##_map() { return Map::cast(roots_[k##Name##MapRootIndex]); }
61 String* Heap::name() { return String::cast(roots_[k##name##RootIndex]); }
66 Symbol* Heap::name() { return Symbol::cast(roots_[k##name##RootIndex]); }
71 Symbol* Heap::name() { return Symbol::cast(roots_[k##name##RootIndex]); }
83 roots_[k##camel_name##RootIndex] = value; \
heap.h 2170 Object* roots_[kRootListLength]; member in class:v8::internal::Heap
    [all...]
heap.cc 180 memset(roots_, 0, sizeof(roots_[0]) * kRootListLength);
    [all...]
  /external/v8/src/
factory.h 590 &isolate()->heap()->roots_[Heap::k##camel_name##RootIndex])); \
598 &isolate()->heap()->roots_[Heap::k##Name##MapRootIndex])); \
606 &isolate()->heap()->roots_[Heap::k##name##RootIndex])); \
614 &isolate()->heap()->roots_[Heap::k##name##RootIndex])); \
622 &isolate()->heap()->roots_[Heap::k##name##RootIndex])); \
isolate.cc     [all...]

Completed in 595 milliseconds