top 340 src/api.h Address top = isolate_->heap()->NewSpaceTop();
top 341 src/api.h if (IsFreshString(address, top)) {
top 342 src/api.h IncrementUseCount(top);
top 351 src/api.h Address top = isolate_->heap()->NewSpaceTop();
top 352 src/api.h return IsFreshString(address, top) && IsUseCountLow(top);
top 358 src/api.h static inline bool IsFreshString(Address string, Address top) {
top 359 src/api.h return top - kFreshnessLimit <= string && string <= top;
top 362 src/api.h inline bool IsUseCountLow(Address top) {
top 363 src/api.h if (last_top_ != top) return true;
top 367 src/api.h inline void IncrementUseCount(Address top) {
top 368 src/api.h if (last_top_ != top) {
top 370 src/api.h last_top_ = top;
top 1545 src/arm/macro-assembler-arm.cc intptr_t top =
top 1549 src/arm/macro-assembler-arm.cc ASSERT((limit - top) == kPointerSize);
top 1573 src/arm/macro-assembler-arm.cc ldr(ip, MemOperand(topaddr, limit - top));
top 1626 src/arm/macro-assembler-arm.cc intptr_t top =
top 1630 src/arm/macro-assembler-arm.cc ASSERT((limit - top) == kPointerSize);
top 1652 src/arm/macro-assembler-arm.cc ldr(ip, MemOperand(topaddr, limit - top));
top 572 src/builtins.cc MaybeObject* top = elms->get(len - 1);
top 577 src/builtins.cc if (!top->IsTheHole()) {
top 580 src/builtins.cc return top;
top 583 src/builtins.cc top = array->GetPrototype()->GetElement(len - 1);
top 585 src/builtins.cc return top;
top 1839 src/debug.cc for (JavaScriptFrameIterator it(isolate, top); !it.done(); it.Advance()) {
top 1862 src/debug.cc for (JavaScriptFrameIterator it(isolate, top); !it.done(); it.Advance()) {
top 1957 src/debug.cc top,
top 1971 src/debug.cc RedirectActivationsToRecompiledCodeOnThread(isolate, top);
top 424 src/deoptimizer.h void SetTop(intptr_t top) { top_ = top; }
top 268 src/frames-inl.h Isolate* isolate, ThreadLocalTop* top)
top 269 src/frames-inl.h : iterator_(isolate, top) {
top 290 src/frames.cc ThreadLocalTop* top = isolate->thread_local_top();
top 291 src/frames.cc Address fp = Isolate::c_entry_fp(top);
top 294 src/frames.cc return Isolate::handler(top) != NULL;
top 1338 src/frames.cc Address top = heap->code_space()->top();
top 1342 src/frames.cc if (addr == top && addr != limit) {
top 731 src/frames.h inline JavaScriptFrameIteratorTemp(Isolate* isolate, ThreadLocalTop* top);
top 72 src/heap-inl.h SemiSpace::AssertValidRange(HEAP->new_space()->top(),
top 1302 src/heap.cc ASSERT(new_space_front == new_space_.top());
top 1305 src/heap.cc new_space_.set_age_mark(new_space_.top());
top 1552 src/heap.cc SemiSpace::AssertValidRange(new_space_front, new_space_.top());
top 1556 src/heap.cc while (new_space_front != new_space_.top()) {
top 1590 src/heap.cc } while (new_space_front != new_space_.top());
top 1803 src/heap.cc heap->promotion_queue()->SetNewLimit(heap->new_space()->top());
top 5597 src/heap.cc space->top(),
top 5625 src/heap.cc space->top(),
top 497 src/heap.h Address NewSpaceTop() { return new_space_.top(); }
top 1214 src/heap.h void public_set_store_buffer_top(Address* top) {
top 1215 src/heap.h roots_[kStoreBufferTopRootIndex] = reinterpret_cast<Smi*>(top);
top 582 src/incremental-marking.cc int limit = marking_deque_.top();
top 1032 src/isolate.h void SetTopLookupResult(LookupResult* top) {
top 1033 src/isolate.h thread_local_top_.top_lookup_result_ = top;
top 5182 src/jsregexp.cc uc16 top = to();
top 5185 src/jsregexp.cc if (top > String::kMaxAsciiCharCode) top = String::kMaxAsciiCharCode;
top 5188 src/jsregexp.cc if (top == bottom) {
top 5218 src/jsregexp.cc while (pos <= top) {
top 5227 src/jsregexp.cc int end = (block_end > top) ? top : block_end;
top 5233 src/jsregexp.cc if (!(bottom <= range_from && range_to <= top)) {
top 1742 src/liveedit.cc for (StackFrameIterator it(isolate, top); !it.done(); it.Advance()) {
top 96 src/mark-compact.cc current < top;
top 109 src/mark-compact.cc Address end = space->top();
top 174 src/mark-compact.cc current < top;
top 187 src/mark-compact.cc NewSpacePageIterator it(space->bottom(), space->top());
top 193 src/mark-compact.cc Address limit = it.has_next() ? page->area_end() : space->top();
top 194 src/mark-compact.cc ASSERT(limit == space->top() || !page->Contains(space->top()));
top 317 src/mark-compact.cc NewSpacePageIterator it(space->bottom(), space->top());
top 1637 src/mark-compact.cc collector_->PrepareThreadForCodeFlushing(isolate, top);
top 1692 src/mark-compact.cc for (StackFrameIterator it(isolate, top); !it.done(); it.Advance()) {
top 2897 src/mark-compact.cc Address from_top = new_space->top();
top 2955 src/mark-compact.cc new_space->set_age_mark(new_space->top());
top 3331 src/mark-compact.cc heap()->new_space()->top());
top 239 src/mark-compact.h int top() { return top_; }
top 241 src/mark-compact.h void set_top(int top) { top_ = top; }
top 652 src/mark-compact.h void PrepareThreadForCodeFlushing(Isolate* isolate, ThreadLocalTop* top);
top 2928 src/mips/macro-assembler-mips.cc intptr_t top =
top 2932 src/mips/macro-assembler-mips.cc ASSERT((limit - top) == kPointerSize);
top 2954 src/mips/macro-assembler-mips.cc lw(t9, MemOperand(topaddr, limit - top));
top 3000 src/mips/macro-assembler-mips.cc intptr_t top =
top 3004 src/mips/macro-assembler-mips.cc ASSERT((limit - top) == kPointerSize);
top 3024 src/mips/macro-assembler-mips.cc lw(t9, MemOperand(topaddr, limit - top));
top 6357 src/objects.cc Relocatable* top = *reinterpret_cast<Relocatable**>(thread_storage);
top 6358 src/objects.cc Iterate(v, top);
top 6370 src/objects.cc Relocatable* current = top;
top 7772 src/objects.h static void Iterate(ObjectVisitor* v, Relocatable* top);
top 60 src/parser.cc previous_ = stack->top();
top 8303 src/runtime.cc for (JavaScriptFrameIterator it(isolate, top); !it.done(); it.Advance()) {
top 8941 src/runtime.cc Context* top = isolate->context();
top 8944 src/runtime.cc top->global_context()->context_extension_function();
top 12278 src/runtime.cc SaveContext* top = &save;
top 12279 src/runtime.cc while (top != NULL && *top->context() == *isolate->debug()->debug_context()) {
top 12280 src/runtime.cc top = top->prev();
top 12282 src/runtime.cc if (top != NULL) {
top 12283 src/runtime.cc isolate->set_context(*top->context());
top 273 src/scopes.cc Scope* top = scope;
top 277 src/scopes.cc while (!top->is_global_scope() &&
top 278 src/scopes.cc !top->outer_scope()->already_resolved()) {
top 279 src/scopes.cc top = top->outer_scope();
top 286 src/scopes.cc if (!top->AllocateVariables(info, &ast_node_factory)) return false;
top 296 src/scopes.cc if (FLAG_harmony_modules && FLAG_print_interfaces && top->is_global_scope()) {
top 298 src/scopes.cc top->interface()->Print();
top 111 src/spaces-inl.h if (cur_addr_ == space_->top() && cur_addr_ != space_->limit()) {
top 253 src/spaces-inl.h Address current_top = allocation_info_.top;
top 257 src/spaces-inl.h allocation_info_.top = new_top;
top 297 src/spaces-inl.h Address old_top = allocation_info_.top;
top 309 src/spaces-inl.h allocation_info_.top += filler_size;
top 319 src/spaces-inl.h allocation_info_.top += size_in_bytes;
top 342 src/spaces-inl.h allocation_info_.top);
top 343 src/spaces-inl.h Address old_top = allocation_info_.top;
top 344 src/spaces-inl.h allocation_info_.top =
top 348 src/spaces-inl.h int delta = static_cast<int>(old_top - allocation_info_.top);
top 794 src/spaces.cc allocation_info_.top = NULL;
top 937 src/spaces.cc if (Page::FromAllocationTop(allocation_info_.top) == page) {
top 938 src/spaces.cc allocation_info_.top = allocation_info_.limit = NULL;
top 994 src/spaces.cc (allocation_info_.top == allocation_info_.limit);
top 999 src/spaces.cc if (page == Page::FromAllocationTop(allocation_info_.top)) {
top 1005 src/spaces.cc Address top = page->area_end();
top 1029 src/spaces.cc ASSERT(object->address() + size <= top);
top 1111 src/spaces.cc allocation_info_.top = NULL;
top 1175 src/spaces.cc allocation_info_.top = to_space_.page_low();
top 1182 src/spaces.cc allocation_info_.top + inline_allocation_limit_step();
top 1202 src/spaces.cc Address top = allocation_info_.top;
top 1203 src/spaces.cc if (NewSpacePage::IsAtStart(top)) {
top 1218 src/spaces.cc Address limit = NewSpacePage::FromLimit(top)->area_end();
top 1224 src/spaces.cc int remaining_in_page = static_cast<int>(limit - top);
top 1225 src/spaces.cc heap()->CreateFillerObjectAt(top, remaining_in_page);
top 1234 src/spaces.cc Address old_top = allocation_info_.top;
top 1273 src/spaces.cc while (current != top()) {
top 1276 src/spaces.cc CHECK(!NewSpacePage::FromLimit(current)->ContainsLimit(top()) ||
top 1277 src/spaces.cc current < top());
top 1584 src/spaces.cc Initialize(space->bottom(), space->top(), NULL);
top 1590 src/spaces.cc Initialize(space->bottom(), space->top(), size_func);
top 1595 src/spaces.cc Initialize(start, space->top(), NULL);
top 2012 src/spaces.cc ASSERT(owner_->limit() - owner_->top() < size_in_bytes);
top 2024 src/spaces.cc int old_linear_size = static_cast<int>(owner_->limit() - owner_->top());
top 2028 src/spaces.cc owner_->Free(owner_->top(), old_linear_size);
top 2197 src/spaces.cc Address top = allocation_info_.top;
top 2198 src/spaces.cc if ((top - bytes) == allocation->address()) {
top 2199 src/spaces.cc allocation_info_.top = allocation->address();
top 2213 src/spaces.cc int old_linear_size = static_cast<int>(limit() - top());
top 2214 src/spaces.cc Free(top(), old_linear_size);
top 2245 src/spaces.cc Address current_top = allocation_info_.top;
top 2253 src/spaces.cc int old_linear_size = static_cast<int>(limit() - top());
top 2257 src/spaces.cc Free(top(), old_linear_size);
top 2305 src/spaces.cc if (allocation_info_.top >= allocation_info_.limit) return;
top 2307 src/spaces.cc if (Page::FromAllocationTop(allocation_info_.top)->IsEvacuationCandidate()) {
top 2310 src/spaces.cc static_cast<int>(allocation_info_.limit - allocation_info_.top);
top 2311 src/spaces.cc heap()->CreateFillerObjectAt(allocation_info_.top, remaining);
top 2313 src/spaces.cc allocation_info_.top = NULL;
top 664 src/spaces.h INLINE(static Page* FromAllocationTop(Address top)) {
top 665 src/spaces.h Page* p = FromAddress(top - kPointerSize);
top 1189 src/spaces.h AllocationInfo() : top(NULL), limit(NULL) {
top 1192 src/spaces.h Address top; // Current allocation top.
top 1197 src/spaces.h return (Page::FromAllocationTop(top) == Page::FromAllocationTop(limit))
top 1198 src/spaces.h && (top <= limit);
top 1497 src/spaces.h return Size() - unswept_free_bytes_ - (limit() - top());
top 1506 src/spaces.h Address top() { return allocation_info_.top; }
top 1530 src/spaces.h void SetTop(Address top, Address limit) {
top 1531 src/spaces.h ASSERT(top == limit ||
top 1532 src/spaces.h Page::FromAddress(top) == Page::FromAddress(limit - 1));
top 1533 src/spaces.h allocation_info_.top = top;
top 2110 src/spaces.h static_cast<int>(top() - to_space_.page_low());
top 2154 src/spaces.h Address top() {
top 2155 src/spaces.h ASSERT(to_space_.current_page()->ContainsLimit(allocation_info_.top));
top 2156 src/spaces.h return allocation_info_.top;
top 2183 src/spaces.h Address* allocation_top_address() { return &allocation_info_.top; }
top 2197 src/spaces.h allocation_info_.top + inline_allocation_limit_step_,
top 2200 src/spaces.h top_on_previous_step_ = allocation_info_.top;
top 2349 src/spaces.h SLOW_ASSERT((space).page_low() <= (info).top \
top 2350 src/spaces.h && (info).top <= (space).page_high() \
top 44 src/store-buffer-inl.h Address* top = reinterpret_cast<Address*>(heap_->store_buffer_top());
top 45 src/store-buffer-inl.h *top++ = addr;
top 46 src/store-buffer-inl.h heap_->public_set_store_buffer_top(top);
top 47 src/store-buffer-inl.h if ((reinterpret_cast<uintptr_t>(top) & kStoreBufferOverflowBit) != 0) {
top 48 src/store-buffer-inl.h ASSERT(top == limit_);
top 51 src/store-buffer-inl.h ASSERT(top < limit_);
top 62 src/store-buffer-inl.h Address* top = old_top_;
top 63 src/store-buffer-inl.h *top++ = addr;
top 64 src/store-buffer-inl.h old_top_ = top;
top 67 src/store-buffer-inl.h if (top >= old_limit_) {
top 338 src/store-buffer.cc Address* top = reinterpret_cast<Address*>(heap_->store_buffer_top());
top 339 src/store-buffer.cc for (Address* current = top - 1; current >= start_; current--) {
top 540 src/store-buffer.cc (visitable_end == space->top() && visitable_end != space->limit())) {
top 546 src/store-buffer.cc if (visitable_end >= space->top() && visitable_end < space->limit()) {
top 552 src/store-buffer.cc if (visitable_end == space->top() && visitable_end != space->limit()) {
top 568 src/store-buffer.cc ASSERT(visitable_end < space->top() || visitable_end >= space->limit());
top 666 src/store-buffer.cc Address* top = reinterpret_cast<Address*>(heap_->store_buffer_top());
top 668 src/store-buffer.cc if (top == start_) return;
top 672 src/store-buffer.cc ASSERT(top <= limit_);
top 674 src/store-buffer.cc EnsureSpace(top - start_);
top 681 src/store-buffer.cc for (Address* current = start_; current < top; current++) {
top 99 src/store-buffer.h void SetTop(Object*** top) {
top 100 src/store-buffer.h ASSERT(top >= Start());
top 101 src/store-buffer.h ASSERT(top <= Limit());
top 102 src/store-buffer.h old_top_ = reinterpret_cast<Address*>(top);
top 83 src/v8threads.h virtual void VisitThread(Isolate* isolate, ThreadLocalTop* top) = 0;
top 39 test/cctest/test-alloc.cc int old_linear_size = static_cast<int>(space->limit() - space->top());
top 40 test/cctest/test-alloc.cc space->Free(space->top(), old_linear_size);
top 1734 test/cctest/test-api.cc Local<v8::Object> top = templ->GetFunction()->NewInstance();
top 1738 test/cctest/test-api.cc middle->Set(v8_str("__proto__"), top);
top 925 test/cctest/test-heap.cc Address old_pointer_space_top = HEAP->old_pointer_space()->top();
top 181 tools/gcmole/gcmole.cc if (!scopes_.empty()) scopes_.top()->insert(name);