HomeSort by relevance Sort by last modified time
    Searched defs:heap_ (Results 1 - 8 of 8) sorted by null

  /external/v8/src/
mark-compact.h 190 inline Heap* heap() const { return heap_; }
495 Heap* heap_; member in class:v8::internal::MarkCompactCollector
runtime.cc 2301 Heap* heap_; member in class:v8::internal::ReplacementStringBuilder
    [all...]
heap.h 321 Heap* heap_; member in class:v8::internal::ExternalStringTable
    [all...]
isolate.h 564 thread_local_top_.pending_exception_ = heap_.the_hole_value();
574 thread_local_top_.pending_message_obj_ = heap_.the_hole_value();
604 thread_local_top_.scheduled_exception_ = heap_.the_hole_value();
821 Heap* heap() { return &heap_; }
1149 Heap heap_; member in class:v8::internal::Isolate
    [all...]
mark-compact.cc 66 heap_(NULL),
861 explicit MarkingVisitor(Heap* heap) : heap_(heap) { }
864 StaticMarkingVisitor::VisitPointer(heap_, p);
868 StaticMarkingVisitor::VisitPointers(heap_, start, end);
884 Heap* heap_; member in class:v8::internal::MarkingVisitor
1036 Heap* heap_; member in class:v8::internal::SymbolTableCleaner
1926 Heap* heap_; member in class:v8::internal::PointersToNewGenUpdatingVisitor
2368 Heap* heap_; member in class:v8::internal::MapCompact
2698 Heap* heap_; member in class:v8::UpdatingVisitor
    [all...]
spaces.h 354 Heap* heap_; member in class:v8::internal::Page
363 : heap_(heap), id_(id), executable_(executable) {}
367 Heap* heap() const { return heap_; }
401 Heap* heap_; member in class:v8::internal::Space
1766 Heap* heap_; member in class:v8::internal::BASE_EMBEDDED
1864 Heap* heap_; member in class:v8::internal::BASE_EMBEDDED
    [all...]
heap.cc 157 mark_compact_collector_.heap_ = this;
158 external_string_table_.heap_ = this;
874 explicit ScavengeVisitor(Heap* heap) : heap_(heap) {}
886 if (!heap_->InNewSpace(object)) return;
891 Heap* heap_; member in class:v8::internal::ScavengeVisitor
4804 Heap* heap_; member in class:v8::internal::HeapDebugUtils
    [all...]
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
queue.h 198 : QueueBase<S>(SHORTEST_FIRST_QUEUE), heap_(comp) {}
200 StateId Head() const { return heap_.Top(); }
205 key_[s] = heap_.Insert(s);
209 key_[heap_.Pop()] = kNoKey;
216 heap_.Update(key_[s], s);
220 bool Empty() const { return heap_.Empty(); }
223 heap_.Clear();
228 Heap<S, C> heap_; member in class:fst::ShortestFirstQueue

Completed in 116 milliseconds