next 476 include/v8.h internal::Object** next;
next 480 include/v8.h next = limit = NULL;
next 704 src/accessors.cc next_function = next();
next 747 src/accessors.cc caller = it.next();
next 756 src/accessors.cc potential_caller = it.next();
next 519 src/api.cc RegisteredExtension* next = re->next();
next 521 src/api.cc re = next;
next 681 src/api.cc prev_next_ = current->next;
next 701 src/api.cc current->next = prev_next_;
next 6418 src/api.cc v->VisitPointers(blocks()->last(), handle_scope_data_.next);
next 6452 src/api.cc deferred_handles_head_, isolate()->handle_scope_data()->next, this);
next 6510 src/api.cc last_handle_before_deferred_block_ = isolate()->handle_scope_data()->next;
next 151 src/api.h RegisteredExtension* next() { return next_; }
next 400 src/api.h DeferredHandles(DeferredHandles* next, Object** first_block_limit,
next 402 src/api.h : next_(next),
next 406 src/api.h if (next != NULL) next->previous_ = this;
next 645 src/arm/assembler-arm.cc next(&l);
next 657 src/arm/assembler-arm.cc next(L); // call next before overwriting link with target at fixup_pos
next 1436 src/arm/assembler-arm.h void next(Label* L);
next 1293 src/arm/full-codegen-arm.cc Register next = r1;
next 1306 src/arm/full-codegen-arm.cc __ ldr(next, ContextOperand(current, Context::PREVIOUS_INDEX));
next 1308 src/arm/full-codegen-arm.cc current = next;
next 1318 src/arm/full-codegen-arm.cc if (!current.is(next)) {
next 1319 src/arm/full-codegen-arm.cc __ Move(next, current);
next 1323 src/arm/full-codegen-arm.cc __ ldr(temp, FieldMemOperand(next, HeapObject::kMapOffset));
next 1328 src/arm/full-codegen-arm.cc __ ldr(temp, ContextOperand(next, Context::EXTENSION_INDEX));
next 1332 src/arm/full-codegen-arm.cc __ ldr(next, ContextOperand(next, Context::PREVIOUS_INDEX));
next 1351 src/arm/full-codegen-arm.cc Register next = r3;
next 1362 src/arm/full-codegen-arm.cc __ ldr(next, ContextOperand(context, Context::PREVIOUS_INDEX));
next 1364 src/arm/full-codegen-arm.cc context = next;
next 434 src/arm/lithium-arm.cc HBasicBlock* next = NULL;
next 435 src/arm/lithium-arm.cc if (i < blocks->length() - 1) next = blocks->at(i + 1);
next 436 src/arm/lithium-arm.cc DoBasicBlock(blocks->at(i), next);
next 620 src/arm/lithium-arm.cc ASSERT(hinstr->next()->IsSimulate());
next 621 src/arm/lithium-arm.cc HSimulate* sim = HSimulate::cast(hinstr->next());
next 817 src/arm/lithium-arm.cc current = current->next();
next 2646 src/arm/lithium-codegen-arm.cc Label next;
next 2647 src/arm/lithium-codegen-arm.cc __ b(ne, &next);
next 2652 src/arm/lithium-codegen-arm.cc __ bind(&next);
next 3695 src/arm/macro-assembler-arm.cc Label next;
next 3703 src/arm/macro-assembler-arm.cc bind(&next);
next 3741 src/arm/macro-assembler-arm.cc b(ne, &next);
next 3413 src/arm/stub-cache-arm.cc Label not_passed, next;
next 3421 src/arm/stub-cache-arm.cc __ b(&next);
next 3425 src/arm/stub-cache-arm.cc __ bind(&next);
next 589 src/assembler.cc next();
next 604 src/assembler.cc next();
next 459 src/assembler.h void next();
next 800 src/ast.h Statement* next,
next 805 src/ast.h next_ = next;
next 810 src/ast.h Statement* next() const { return next_; }
next 1993 src/bootstrapper.cc current = current->next();
next 2022 src/bootstrapper.cc current = current->next();
next 266 src/d8-debug.cc head_ = head_->next();
next 144 src/d8-debug.h RemoteDebuggerEvent* next() { return next_; }
next 1402 src/d8.cc char* next = i::OS::StrChr(data, token);
next 1403 src/d8.cc if (next != NULL) {
next 1404 src/d8.cc *next = '\0';
next 1405 src/d8.cc return (next + 1);
next 517 src/debug.cc reloc_iterator_->next();
next 518 src/debug.cc reloc_iterator_original_->next();
next 709 src/debug.cc node = node->next();
next 1243 src/debug.cc node = node->next();
next 1254 src/debug.cc node = node->next();
next 1761 src/debug.cc node = node->next();
next 1885 src/debug.cc for (RelocIterator it(*frame_code, constpool_mask); !it.done(); it.next()) {
next 1899 src/debug.cc for (RelocIterator it(*new_code, mask); !it.done(); it.next()) {
next 2018 src/debug.cc while (((obj = iterator.next()) != NULL)) {
next 2132 src/debug.cc debug_info_list_ = current->next();
next 2134 src/debug.cc prev->set_next(current->next());
next 2148 src/debug.cc current = current->next();
next 2195 src/debug.cc it.next();
next 2276 src/debug.cc it.next();
next 2344 src/debug.cc for (HeapObject* obj = iterator.next(); obj != NULL; obj = iterator.next()) {
next 206 src/debug.h DebugInfoListNode* next() { return next_; }
next 207 src/debug.h void set_next(DebugInfoListNode* next) { next_ = next; }
next 342 src/deoptimizer.cc node = node->next();
next 401 src/deoptimizer.cc for (RelocIterator it(optimized_code_, mask); !it.done(); it.next()) {
next 527 src/deoptimizer.cc node = node->next();
next 1193 src/deoptimizer.cc node = node->next();
next 1209 src/deoptimizer.cc data->deoptimizing_code_list_ = current->next();
next 1211 src/deoptimizer.cc prev->set_next(current->next());
next 1218 src/deoptimizer.cc current = current->next();
next 1314 src/deoptimizer.cc uint32_t next = bits >> 7;
next 1315 src/deoptimizer.cc contents_.Add(((bits << 1) & 0xFF) | (next != 0), zone);
next 1316 src/deoptimizer.cc bits = next;
next 1327 src/deoptimizer.cc uint8_t next = buffer_->get(index_++);
next 1328 src/deoptimizer.cc bits |= (next >> 1) << i;
next 1329 src/deoptimizer.cc if ((next & 1) == 0) break;
next 628 src/deoptimizer.h DeoptimizingCodeListNode* next() const { return next_; }
next 629 src/deoptimizer.h void set_next(DeoptimizingCodeListNode* next) { next_ = next; }
next 184 src/disassembler.cc it->next();
next 303 src/disassembler.cc for ( ; !it->done(); it->next()) {
next 56 src/frames-inl.h inline StackHandler* StackHandler::next() const {
next 78 src/frames.cc handler_ = handler_->next();
next 106 src/frames.h inline StackHandler* next() const;
next 1165 src/full-codegen.cc if (stmt->next() != NULL) {
next 1166 src/full-codegen.cc Visit(stmt->next());
next 397 src/global-handles.cc NodeBlock* tmp = block->next();
next 75 src/handles-inl.h prev_next_ = current->next;
next 86 src/handles-inl.h prev_next_ = current->next;
next 100 src/handles-inl.h current->next = prev_next_;
next 124 src/handles-inl.h prev_next_ = current->next;
next 137 src/handles-inl.h internal::Object** cur = current->next;
next 142 src/handles-inl.h current->next = cur + 1;
next 157 src/handles-inl.h current->limit = current->next;
next 54 src/handles.cc (isolate->handle_scope_data()->next - impl->blocks()->last()));
next 63 src/handles.cc Object** result = current->next;
next 80 src/handles.cc ASSERT(limit - current->next < kHandleBlockSize);
next 123 src/handles.cc &Isolate::Current()->handle_scope_data()->next);
next 978 src/handles.cc prev_next_ = data->next;
next 979 src/handles.cc data->next = new_next;
next 995 src/handles.cc data->next = prev_next_;
next 419 src/heap.cc for (Space* space = spaces.next(); space != NULL; space = spaces.next()) {
next 5219 src/heap.cc for (Space* space = spaces.next(); space != NULL; space = spaces.next())
next 5443 src/heap.cc NewSpacePage* page = it.next();
next 5582 src/heap.cc Page* page = pages.next();
next 5610 src/heap.cc Page* page = pages.next();
next 5851 src/heap.cc for (HeapObject* obj = iterator.next();
next 5853 src/heap.cc obj = iterator.next()) {
next 6258 src/heap.cc for (PagedSpace* space = spaces.next();
next 6260 src/heap.cc space = spaces.next()) {
next 6548 src/heap.cc object_iterator_ = space_iterator_->next();
next 6588 src/heap.cc object_iterator_ = space_iterator_->next();
next 6801 src/heap.cc for (OldSpace* space = spaces.next();
next 6803 src/heap.cc space = spaces.next()) {
next 7124 src/heap.cc MemoryChunk* next;
next 7126 src/heap.cc for (chunk = chunks_queued_for_free_; chunk != NULL; chunk = next) {
next 7127 src/heap.cc next = chunk->next_chunk();
next 7162 src/heap.cc for (chunk = chunks_queued_for_free_; chunk != NULL; chunk = next) {
next 7163 src/heap.cc next = chunk->next_chunk();
next 2154 src/heap.h Space* next();
next 2166 src/heap.h OldSpace* next();
next 2178 src/heap.h PagedSpace* next();
next 2195 src/heap.h ObjectIterator* next();
next 2228 src/heap.h HeapObject* next();
next 520 src/hydrogen-instructions.cc ASSERT(range_->next() != NULL);
next 521 src/hydrogen-instructions.cc range_ = range_->next();
next 564 src/hydrogen-instructions.cc ASSERT(!next->IsBlockEntry());
next 566 src/hydrogen-instructions.cc ASSERT(!next->block()->IsStartBlock());
next 567 src/hydrogen-instructions.cc ASSERT(next->previous_ != NULL);
next 568 src/hydrogen-instructions.cc HInstruction* prev = next->previous();
next 570 src/hydrogen-instructions.cc next->previous_ = this;
next 571 src/hydrogen-instructions.cc next_ = next;
next 573 src/hydrogen-instructions.cc SetBlock(next->block());
next 593 src/hydrogen-instructions.cc HInstruction* next = previous->next_;
next 594 src/hydrogen-instructions.cc if (previous->HasObservableSideEffects() && next != NULL) {
next 595 src/hydrogen-instructions.cc ASSERT(next->IsSimulate());
next 596 src/hydrogen-instructions.cc previous = next;
next 597 src/hydrogen-instructions.cc next = previous->next_;
next 601 src/hydrogen-instructions.cc next_ = next;
next 604 src/hydrogen-instructions.cc if (next != NULL) next->previous_ = this;
next 639 src/hydrogen-instructions.cc ASSERT(next()->IsSimulate());
next 243 src/hydrogen-instructions.h Range* next() const { return next_; }
next 849 src/hydrogen-instructions.h HInstruction* next() const { return next_; }
next 857 src/hydrogen-instructions.h void InsertBefore(HInstruction* next);
next 502 src/hydrogen.cc ASSERT((current->next() == NULL) == current->IsControlInstruction());
next 505 src/hydrogen.cc current = current->next();
next 721 src/hydrogen.cc instr = instr->next();
next 791 src/hydrogen.cc PostorderProcessor* next =
next 793 src/hydrogen.cc if (next != NULL) {
next 794 src/hydrogen.cc return next;
next 922 src/hydrogen.cc PostorderProcessor* next =
next 924 src/hydrogen.cc if (next != NULL) {
next 925 src/hydrogen.cc return next;
next 1276 src/hydrogen.cc instr = instr->next();
next 1437 src/hydrogen.cc int next;
next 1438 src/hydrogen.cc for (int current = array_[i].next; current != kNil; current = next) {
next 1439 src/hydrogen.cc next = lists_[current].next;
next 1444 src/hydrogen.cc lists_[current].next = free_list_head_;
next 1448 src/hydrogen.cc lists_[current].next = kept;
next 1453 src/hydrogen.cc array_[i].next = kept;
next 1459 src/hydrogen.cc int head = array_[i].next;
next 1464 src/hydrogen.cc array_[i].next = lists_[head].next;
next 1465 src/hydrogen.cc lists_[head].next = free_list_head_;
next 1481 src/hydrogen.cc int next = array_[pos].next;
next 1482 src/hydrogen.cc while (next != kNil) {
next 1483 src/hydrogen.cc if (lists_[next].value->Equals(value)) return lists_[next].value;
next 1484 src/hydrogen.cc next = lists_[next].next;
next 1518 src/hydrogen.cc int current = old_array[i].next;
next 1521 src/hydrogen.cc int next = lists_[current].next;
next 1522 src/hydrogen.cc lists_[current].next = free_list_head_;
next 1524 src/hydrogen.cc current = next;
next 1553 src/hydrogen.cc lists_[i].next = free_list_head_;
next 1568 src/hydrogen.cc array_[pos].next = kNil;
next 1575 src/hydrogen.cc free_list_head_ = lists_[free_list_head_].next;
next 1577 src/hydrogen.cc lists_[new_element_pos].next = array_[pos].next;
next 1578 src/hydrogen.cc ASSERT(array_[pos].next == kNil || lists_[array_[pos].next].value != NULL);
next 1579 src/hydrogen.cc array_[pos].next = new_element_pos;
next 1651 src/hydrogen.cc instr = instr->next();
next 1790 src/hydrogen.cc instr = instr->next();
next 1931 src/hydrogen.cc HInstruction* next = instr->next();
next 2021 src/hydrogen.cc instr = next;
next 2202 src/hydrogen.cc HInstruction* next = instr->next();
next 2245 src/hydrogen.cc instr = next;
next 2249 src/hydrogen.cc GvnBasicBlockState* next =
next 2252 src/hydrogen.cc if (next != NULL) {
next 2253 src/hydrogen.cc HBasicBlock* dominated = next->block();
next 2254 src/hydrogen.cc HValueMap* successor_map = next->map();
next 2255 src/hydrogen.cc HSideEffectMap* successor_dominators = next->dominators();
next 2272 src/hydrogen.cc current = next;
next 2487 src/hydrogen.cc current = current->next();
next 2519 src/hydrogen.cc current = current->next();
next 2580 src/hydrogen.cc HInstruction* next = NULL;
next 2582 src/hydrogen.cc next = use_value->block()->predecessors()->at(use_index)->end();
next 2584 src/hydrogen.cc next = HInstruction::cast(use_value);
next 2608 src/hydrogen.cc new_value->InsertBefore(next);
next 2676 src/hydrogen.cc current = current->next();
next 2721 src/hydrogen.cc current = current->next()) {
next 3417 src/hydrogen.cc for (HInstruction* i = bb->first(); i != NULL; i = i->next()) {
next 3541 src/hydrogen.cc instr = instr->next()) {
next 3762 src/hydrogen.cc current = current->next();
next 4276 src/hydrogen.cc if (stmt->next() != NULL && body_exit != NULL) {
next 4278 src/hydrogen.cc CHECK_BAILOUT(Visit(stmt->next()));
next 4438 src/hydrogen.cc for (;!it.done(); it.next()) {
next 9367 src/hydrogen.cc instruction = instruction->next();
next 9456 src/hydrogen.cc cur_interval = cur_interval->next();
next 9464 src/hydrogen.cc current_pos = current_pos->next();
next 826 src/hydrogen.h BreakAndContinueScope* next() { return next_; }
next 1256 src/hydrogen.h int next; // Index in the array of the next list element.
next 154 src/ia32/assembler-ia32.cc int next = 0;
next 156 src/ia32/assembler-ia32.cc next = L->pos();
next 157 src/ia32/assembler-ia32.cc ASSERT(next > 0); // Displacements must be at positions > 0
next 161 src/ia32/assembler-ia32.cc data_ = NextField::encode(next) | TypeField::encode(type);
next 1342 src/ia32/assembler-ia32.cc disp.next(&l);
next 1367 src/ia32/assembler-ia32.cc disp.next(L);
next 2496 src/ia32/assembler-ia32.cc for (RelocIterator it(desc); !it.done(); it.next()) {
next 418 src/ia32/assembler-ia32.h void next(Label* L) const {
next 1267 src/ia32/full-codegen-ia32.cc Label next, fast;
next 1271 src/ia32/full-codegen-ia32.cc __ bind(&next);
next 1281 src/ia32/full-codegen-ia32.cc __ jmp(&next);
next 2514 src/ia32/lithium-codegen-ia32.cc Label next;
next 2517 src/ia32/lithium-codegen-ia32.cc __ j(not_equal, &next, compact ? Label::kNear : Label::kFar);
next 2522 src/ia32/lithium-codegen-ia32.cc __ bind(&next);
next 454 src/ia32/lithium-ia32.cc HBasicBlock* next = NULL;
next 455 src/ia32/lithium-ia32.cc if (i < blocks->length() - 1) next = blocks->at(i + 1);
next 456 src/ia32/lithium-ia32.cc DoBasicBlock(blocks->at(i), next);
next 642 src/ia32/lithium-ia32.cc ASSERT(hinstr->next()->IsSimulate());
next 643 src/ia32/lithium-ia32.cc HSimulate* sim = HSimulate::cast(hinstr->next());
next 843 src/ia32/lithium-ia32.cc current = current->next();
next 2881 src/ia32/macro-assembler-ia32.cc Label next;
next 2883 src/ia32/macro-assembler-ia32.cc bind(&next);
next 2919 src/ia32/macro-assembler-ia32.cc j(not_equal, &next);
next 271 src/ic.cc !it.done(); it.next()) {
next 1584 src/ic.cc for (RelocIterator it(*stub, mask); !it.done(); it.next()) {
next 333 src/incremental-marking.cc Page* p = it.next();
next 343 src/incremental-marking.cc NewSpacePage* p = it.next();
next 368 src/incremental-marking.cc Page* p = it.next();
next 377 src/incremental-marking.cc NewSpacePage* p = it.next();
next 572 src/incremental-marking.cc Bitmap::Clear(it.next());
next 326 src/interpreter-irregexp.cc Char next = subject[pos + 1];
next 328 src/interpreter-irregexp.cc (subject[pos] | (next << (kBitsPerByte * sizeof(Char))));
next 335 src/interpreter-irregexp.cc Char next = subject[pos + 1];
next 336 src/interpreter-irregexp.cc current_char = (subject[pos] | (next << (kBitsPerByte * sizeof(Char))));
next 1014 src/isolate.cc handler = handler->next();
next 1196 src/isolate.cc handler = handler->next();
next 1422 src/isolate.cc PerIsolateThreadData* next = data->next_;
next 1424 src/isolate.cc data = next;
next 1083 src/jsregexp.cc action = action->next()) {
next 1095 src/jsregexp.cc action = action->next()) {
next 1114 src/jsregexp.cc action = action->next()) {
next 1177 src/jsregexp.cc action = action->next()) {
next 2691 src/jsregexp.cc RegExpNode* next = on_success_->FilterASCII(depth - 1);
next 2692 src/jsregexp.cc if (next == NULL) return set_replacement(NULL);
next 2693 src/jsregexp.cc on_success_ = next;
next 1345 src/jsregexp.h DeferredAction* next() { return next_; }
next 107 src/lithium-allocator.cc cur = cur->next();
next 120 src/lithium-allocator.cc current_interval = current_interval->next();
next 182 src/lithium-allocator.cc use_pos = use_pos->next();
next 193 src/lithium-allocator.cc pos = pos->next();
next 202 src/lithium-allocator.cc pos = pos->next();
next 223 src/lithium-allocator.cc while (pos != NULL && !pos->HasHint()) pos = pos->next();
next 298 src/lithium-allocator.cc UseInterval* next = current->next();
next 299 src/lithium-allocator.cc if (next->start().Value() >= position.Value()) {
next 300 src/lithium-allocator.cc split_at_start = (next->start().Value() == position.Value());
next 303 src/lithium-allocator.cc current = next;
next 308 src/lithium-allocator.cc UseInterval* after = before->next();
next 325 src/lithium-allocator.cc use_after = use_after->next();
next 330 src/lithium-allocator.cc use_after = use_after->next();
next 401 src/lithium-allocator.cc first_interval_ = first_interval_->next();
next 407 src/lithium-allocator.cc if (new_interval->next() == NULL) {
next 454 src/lithium-allocator.cc current = current->next();
next 481 src/lithium-allocator.cc use_pos = use_pos->next();
next 498 src/lithium-allocator.cc interval = interval->next()) {
next 499 src/lithium-allocator.cc ASSERT(interval->next() == NULL ||
next 500 src/lithium-allocator.cc interval->next()->start().Value() >= interval->start().Value());
next 522 src/lithium-allocator.cc a = a->next();
next 526 src/lithium-allocator.cc b = b->next();
next 1127 src/lithium-allocator.cc cur_range = cur_range->next();
next 1193 src/lithium-allocator.cc LiveRange* second_range = first_range->next();
next 1215 src/lithium-allocator.cc second_range = second_range->next();
next 1376 src/lithium-allocator.cc for (LiveRange* cur = range; cur != NULL; cur = cur->next()) {
next 1415 src/lithium-allocator.cc cur = cur->next();
next 1703 src/lithium-allocator.cc if (range->next() != NULL) return;
next 215 src/lithium-allocator.h UseInterval* next() const { return next_; }
next 235 src/lithium-allocator.h void set_next(UseInterval* next) { next_ = next; }
next 259 src/lithium-allocator.h UsePosition* next() const { return next_; }
next 262 src/lithium-allocator.h void set_next(UsePosition* next) { next_ = next; }
next 286 src/lithium-allocator.h LiveRange* next() const { return next_; }
next 992 src/liveedit.cc for (HeapObject* obj = iterator.next(); obj != NULL; obj = iterator.next()) {
next 1255 src/liveedit.cc for (RelocIterator it(*code); !it.done(); it.next()) {
next 1385 src/liveedit.cc for (RelocIterator it(parent_shared->code()); !it.done(); it.next()) {
next 1090 src/liveobjectlist.cc while ((heap_obj = iterator.next()) != NULL) {
next 1128 src/liveobjectlist.cc while (!failed && (heap_obj = iterator.next()) != NULL) {
next 1203 src/liveobjectlist.cc LiveObjectList* next = lol->next_;
next 1206 src/liveobjectlist.cc if (next != NULL) {
next 1207 src/liveobjectlist.cc next->prev_ = lol->prev_;
next 1560 src/liveobjectlist.cc lol = lol->next();
next 1591 src/liveobjectlist.cc lol = lol->next();
next 2334 src/liveobjectlist.cc Element* next = &elements[j];
next 2335 src/liveobjectlist.cc HeapObject* next_obj = next->obj_;
next 2393 src/liveobjectlist.cc LiveObjectList* next = NULL;
next 2428 src/liveobjectlist.cc if (next) {
next 2429 src/liveobjectlist.cc next->prev_ = lol->prev_;
next 2462 src/liveobjectlist.cc next = lol;
next 2518 src/liveobjectlist.cc while ((heap_obj = iterator.next()) != NULL) {
next 167 src/liveobjectlist.h LiveObjectList* next() { return next_; }
next 1368 src/log.cc for (HeapObject* obj = iterator.next(); obj != NULL; obj = iterator.next()) {
next 1531 src/log.cc for (HeapObject* obj = iterator.next(); obj != NULL; obj = iterator.next()) {
next 1607 src/log.cc for (HeapObject* obj = iterator.next(); obj != NULL; obj = iterator.next()) {
next 116 src/mark-compact.cc NewSpacePage* page = it.next();
next 128 src/mark-compact.cc Page* p = it.next();
next 191 src/mark-compact.cc NewSpacePage* page = it.next();
next 208 src/mark-compact.cc Page* p = it.next();
next 310 src/mark-compact.cc Page* p = it.next();
next 320 src/mark-compact.cc NewSpacePage* p = it.next();
next 348 src/mark-compact.cc Bitmap::Clear(it.next());
next 357 src/mark-compact.cc Bitmap::Clear(it.next());
next 573 src/mark-compact.cc if (it.has_next()) it.next(); // Never compact the first page.
next 576 src/mark-compact.cc Page* p = it.next();
next 711 src/mark-compact.cc for (PagedSpace* space = spaces.next();
next 713 src/mark-compact.cc space = spaces.next()) {
next 1096 src/mark-compact.cc if (weak_map->next() == Smi::FromInt(0)) {
next 2111 src/mark-compact.cc Page* p = it.next();
next 2653 src/mark-compact.cc weak_map_obj = weak_map->next();
next 2669 src/mark-compact.cc weak_map_obj = weak_map->next();
next 3887 src/mark-compact.cc Page* p = it.next();
next 4185 src/mark-compact.cc SlotsBuffer* next_buffer = buffer->next();
next 311 src/mark-compact.h SlotsBuffer* next() { return next_; }
next 336 src/mark-compact.h buffer = buffer->next();
next 774 src/mips/assembler-mips.cc next(&l);
next 793 src/mips/assembler-mips.cc next(L); // Call next before overwriting link with target at fixup_pos.
next 1998 src/mips/assembler-mips.cc for (RelocIterator it(desc); !it.done(); it.next()) {
next 1199 src/mips/assembler-mips.h void next(Label* L);
next 1299 src/mips/full-codegen-mips.cc Register next = a1;
next 1311 src/mips/full-codegen-mips.cc __ lw(next, ContextOperand(current, Context::PREVIOUS_INDEX));
next 1313 src/mips/full-codegen-mips.cc current = next;
next 1323 src/mips/full-codegen-mips.cc if (!current.is(next)) {
next 1324 src/mips/full-codegen-mips.cc __ Move(next, current);
next 1328 src/mips/full-codegen-mips.cc __ lw(temp, FieldMemOperand(next, HeapObject::kMapOffset));
next 1332 src/mips/full-codegen-mips.cc __ lw(temp, ContextOperand(next, Context::EXTENSION_INDEX));
next 1335 src/mips/full-codegen-mips.cc __ lw(next, ContextOperand(next, Context::PREVIOUS_INDEX));
next 1354 src/mips/full-codegen-mips.cc Register next = a3;
next 1364 src/mips/full-codegen-mips.cc __ lw(next, ContextOperand(context, Context::PREVIOUS_INDEX));
next 1366 src/mips/full-codegen-mips.cc context = next;
next 2388 src/mips/lithium-codegen-mips.cc Label next;
next 2389 src/mips/lithium-codegen-mips.cc __ Branch(&next);
next 2394 src/mips/lithium-codegen-mips.cc __ bind(&next);
next 434 src/mips/lithium-mips.cc HBasicBlock* next = NULL;
next 435 src/mips/lithium-mips.cc if (i < blocks->length() - 1) next = blocks->at(i + 1);
next 436 src/mips/lithium-mips.cc DoBasicBlock(blocks->at(i), next);
next 620 src/mips/lithium-mips.cc ASSERT(hinstr->next()->IsSimulate());
next 621 src/mips/lithium-mips.cc HSimulate* sim = HSimulate::cast(hinstr->next());
next 817 src/mips/lithium-mips.cc current = current->next();
next 5312 src/mips/macro-assembler-mips.cc Label next;
next 5320 src/mips/macro-assembler-mips.cc bind(&next);
next 5354 src/mips/macro-assembler-mips.cc Branch(&next, ne, a1, Operand(null_value));
next 3410 src/mips/stub-cache-mips.cc Label not_passed, next;
next 3418 src/mips/stub-cache-mips.cc __ jmp(&next);
next 3423 src/mips/stub-cache-mips.cc __ bind(&next);
next 576 src/objects-debug.cc for (RelocIterator it(this); !it.done(); it.next()) {
next 4438 src/objects-inl.h ACCESSORS(JSWeakMap, next, Object, kNextOffset)
next 113 src/objects-visiting-inl.h for (; !it.done(); it.next()) {
next 145 src/objects-visiting-inl.h for (; !it.done(); it.next()) {
next 5066 src/objects.cc Map* next = proto_iterator.Next();
next 5067 src/objects.cc if (next != NULL) return static_cast<TraversableMap*>(next);
next 5073 src/objects.cc Map* next = transition_iterator.Next();
next 5074 src/objects.cc if (next != NULL) return static_cast<TraversableMap*>(next);
next 8011 src/objects.cc for (RelocIterator it(this, RelocInfo::kApplyMask); !it.done(); it.next()) {
next 8036 src/objects.cc for (RelocIterator it(this, mode_mask); !it.done(); it.next()) {
next 8087 src/objects.cc it.next();
next 8109 src/objects.cc it.next();
next 8132 src/objects.cc for (RelocIterator it(this, mask); !it.done(); it.next()) {
next 8146 src/objects.cc for (RelocIterator it(this, mask); !it.done(); it.next()) {
next 8478 src/objects.cc for (RelocIterator it(this); !it.done(); it.next()) it.rinfo()->Print(out);
next 8132 src/objects.h DECL_ACCESSORS(next, Object)
next 3021 src/parser.cc Statement* next = NULL;
next 3024 src/parser.cc next = factory()->NewExpressionStatement(exp);
next 3048 src/parser.cc if (loop) loop->Initialize(NULL, cond, next, body);
next 3051 src/parser.cc if (loop) loop->Initialize(init, cond, next, body);
next 3381 src/parser.cc Token::Value next = Next();
next 3384 src/parser.cc factory()->NewCountOperation(next,
next 4120 src/parser.cc Token::Value next = Next();
next 4121 src/parser.cc bool is_keyword = Token::IsKeyword(next);
next 4122 src/parser.cc if (next == Token::IDENTIFIER || next == Token::NUMBER ||
next 4123 src/parser.cc next == Token::FUTURE_RESERVED_WORD ||
next 4124 src/parser.cc next == Token::FUTURE_STRICT_RESERVED_WORD ||
next 4125 src/parser.cc next == Token::STRING || is_keyword) {
next 4128 src/parser.cc name = isolate_->factory()->LookupAsciiSymbol(Token::String(next));
next 4142 src/parser.cc ReportUnexpectedToken(next);
next 4169 src/parser.cc Token::Value next = peek();
next 4174 src/parser.cc switch (next) {
next 4230 src/parser.cc if (Token::IsKeyword(next)) {
next 4231 src/parser.cc Consume(next);
next 4236 src/parser.cc Token::Value next = Next();
next 4237 src/parser.cc ReportUnexpectedToken(next);
next 4783 src/parser.cc Token::Value next = peek();
next 4784 src/parser.cc return next == Token::IDENTIFIER ||
next 4785 src/parser.cc next == Token::FUTURE_RESERVED_WORD ||
next 4786 src/parser.cc next == Token::FUTURE_STRICT_RESERVED_WORD;
next 4791 src/parser.cc Token::Value next = Next();
next 4792 src/parser.cc USE(next);
next 4794 src/parser.cc ASSERT(next == token);
next 4799 src/parser.cc Token::Value next = Next();
next 4800 src/parser.cc if (next == token) return;
next 4801 src/parser.cc ReportUnexpectedToken(next);
next 4807 src/parser.cc Token::Value next = peek();
next 4808 src/parser.cc if (next == token) {
next 4809 src/parser.cc Consume(next);
next 4883 src/parser.cc Token::Value next = Next();
next 4884 src/parser.cc if (next != Token::IDENTIFIER &&
next 4885 src/parser.cc next != Token::FUTURE_RESERVED_WORD &&
next 4886 src/parser.cc next != Token::FUTURE_STRICT_RESERVED_WORD &&
next 4887 src/parser.cc !Token::IsKeyword(next)) {
next 4888 src/parser.cc ReportUnexpectedToken(next);
next 5614 src/parser.cc int next = current() - '0';
next 5615 src/parser.cc if (min > (RegExpTree::kInfinity - next) / 10) {
next 5623 src/parser.cc min = 10 * min + next;
next 5637 src/parser.cc int next = current() - '0';
next 5638 src/parser.cc if (max > (RegExpTree::kInfinity - next) / 10) {
next 5645 src/parser.cc max = 10 * max + next;
next 5853 src/parser.cc CharacterRange next = ParseClassAtom(&char_class_2 CHECK_FAILED);
next 5858 src/parser.cc AddRangeOrEscape(ranges, char_class_2, next, zone());
next 5861 src/parser.cc if (first.from() > next.to()) {
next 5864 src/parser.cc ranges->Add(CharacterRange::Range(first.from(), next.to()), zone());
next 1251 src/preparser.cc i::Token::Value next = peek();
next 1252 src/preparser.cc switch (next) {
next 1282 src/preparser.cc CheckDuplicate(&duplicate_finder, next, kValueProperty, CHECK_OK);
next 1286 src/preparser.cc Consume(next);
next 1287 src/preparser.cc CheckDuplicate(&duplicate_finder, next, kValueProperty, CHECK_OK);
next 1291 src/preparser.cc Consume(next);
next 1292 src/preparser.cc CheckDuplicate(&duplicate_finder, next, kValueProperty, CHECK_OK);
next 1295 src/preparser.cc if (i::Token::IsKeyword(next)) {
next 1296 src/preparser.cc Consume(next);
next 1297 src/preparser.cc CheckDuplicate(&duplicate_finder, next, kValueProperty, CHECK_OK);
next 1533 src/preparser.cc i::Token::Value next = Next();
next 1534 src/preparser.cc switch (next) {
next 1613 src/preparser.cc i::Token::Value next = Next();
next 1614 src/preparser.cc if (i::Token::IsKeyword(next)) {
next 1616 src/preparser.cc const char* keyword = i::Token::String(next);
next 1621 src/preparser.cc if (next == i::Token::IDENTIFIER ||
next 1622 src/preparser.cc next == i::Token::FUTURE_RESERVED_WORD ||
next 1623 src/preparser.cc next == i::Token::FUTURE_STRICT_RESERVED_WORD) {
next 1650 src/preparser.cc i::Token::Value next = peek();
next 1651 src/preparser.cc return next == i::Token::IDENTIFIER ||
next 1652 src/preparser.cc next == i::Token::FUTURE_RESERVED_WORD ||
next 1653 src/preparser.cc next == i::Token::FUTURE_STRICT_RESERVED_WORD;
next 635 src/preparser.h i::Token::Value next = peek();
next 636 src/preparser.h if (next == token) {
next 637 src/preparser.h Consume(next);
next 229 src/prettyprinter.cc if (node->next() != NULL) {
next 230 src/prettyprinter.cc Visit(node->next()); // prints extra ';', unfortunately
next 898 src/prettyprinter.cc if (node->next()) PrintIndentedVisit("NEXT", node->next());
next 1367 src/profile-generator.cc for (HeapObject* obj = iterator.next();
next 1369 src/profile-generator.cc obj = iterator.next()) {
next 1540 src/profile-generator.cc for (HeapObject* obj = iterator.next();
next 1542 src/profile-generator.cc obj = iterator.next()) {
next 1792 src/profile-generator.cc for (HeapObject* obj = iterator->next();
next 1794 src/profile-generator.cc obj = iterator->next()) {
next 2397 src/profile-generator.cc for (HeapObject* obj = iterator.next();
next 2399 src/profile-generator.cc obj = iterator.next(), progress_->ProgressStep()) {
next 3226 src/runtime.cc int next = end;
next 3228 src/runtime.cc next = end + 1;
next 3229 src/runtime.cc if (next > length) break;
next 3234 src/runtime.cc next,
next 3343 src/runtime.cc int next = 0; // Start of next search (prev unless last match was empty).
next 3356 src/runtime.cc next = end;
next 3359 src/runtime.cc next++;
next 3360 src/runtime.cc if (next > length) break;
next 3364 src/runtime.cc next,
next 6193 src/runtime.cc uc32 next = has_next ? buffer->GetNext() : 0;
next 6194 src/runtime.cc int char_length = mapping->get(current, next, chars);
next 6219 src/runtime.cc next_length = mapping->get(next, 0, chars);
next 6246 src/runtime.cc current = next;
next 11759 src/runtime.cc for (HeapObject* obj = iterator.next();
next 11760 src/runtime.cc obj != NULL; obj = iterator.next()) {
next 12370 src/runtime.cc while (((heap_obj = iterator->next()) != NULL) &&
next 12499 src/runtime.cc while (((heap_obj = iterator->next()) != NULL) &&
next 12653 src/runtime.cc for (HeapObject* obj = iterator->next();
next 12655 src/runtime.cc obj = iterator->next()) {
next 12934 src/runtime.cc it.next();
next 13229 src/runtime.cc while (script.is_null() && ((obj = iterator.next()) != NULL)) {
next 497 src/scanner.h inline Token::Value Select(uc32 next, Token::Value then, Token::Value else_) {
next 499 src/scanner.h if (c0_ == next) {
next 64 src/spaces-inl.h Page* PageIterator::next() {
next 99 src/spaces-inl.h NewSpacePage* NewSpacePageIterator::next() {
next 814 src/spaces.cc heap()->isolate()->memory_allocator()->Free(iterator.next());
next 832 src/spaces.cc Address next = cur + obj->Size();
next 833 src/spaces.cc if ((cur <= addr) && (addr < next)) return obj;
next 910 src/spaces.cc it.next();
next 956 src/spaces.cc Page* page = it.next();
next 997 src/spaces.cc Page* page = page_iterator.next();
next 1196 src/spaces.cc Bitmap::Clear(it.next());
next 1520 src/spaces.cc it.next()->SetFlag(MemoryChunk::NEW_SPACE_BELOW_AGE_MARK);
next 1882 src/spaces.cc reinterpret_cast<Address>(next);
next 1885 src/spaces.cc reinterpret_cast<Address>(next);
next 1942 src/spaces.cc node = node->next();
next 1947 src/spaces.cc *list = node->next();
next 1981 src/spaces.cc cur_node = cur_node->next();
next 1994 src/spaces.cc *cur = node->next();
next 2083 src/spaces.cc n = n->next();
next 2109 src/spaces.cc *n = (*n)->next();
next 2140 src/spaces.cc cur = cur->next();
next 2153 src/spaces.cc cur = cur->next();
next 2435 src/spaces.cc it->next();
next 2450 src/spaces.cc it->next();
next 2475 src/spaces.cc it.next();
next 318 src/spaces.h void set_next_chunk(MemoryChunk* next) { next_chunk_ = next; }
next 1170 src/spaces.h inline Page* next();
next 1315 src/spaces.h inline FreeListNode* next();
next 1317 src/spaces.h inline void set_next(FreeListNode* next);
next 2045 src/spaces.h inline NewSpacePage* next();
next 2582 src/spaces.h MemoryChunk* next() {
next 2586 src/spaces.h return old_pointer_iterator_.next();
next 2593 src/spaces.h return map_iterator_.next();
next 191 src/store-buffer.cc while ((chunk = it.next()) != NULL) {
next 231 src/store-buffer.cc while ((chunk = it.next()) != NULL) {
next 305 src/store-buffer.cc while ((chunk = it.next()) != NULL) {
next 386 src/store-buffer.cc Page* page = it.next();
next 632 src/store-buffer.cc while ((chunk = it.next()) != NULL) {
next 274 src/string-stream.cc for (unsigned next; (next = position + 2048) < length_; position = next) {
next 275 src/string-stream.cc char save = buffer_[next];
next 276 src/string-stream.cc buffer_[next] = '\0';
next 278 src/string-stream.cc buffer_[next] = save;
next 574 src/type-info.cc for (RelocIterator it(*code, mask); !it.done(); it.next()) {
next 614 src/type-info.cc for (RelocIterator it(*code, mask); !it.done(); it.next()) {
next 39 src/unbound-queue-inl.h : value(value), next(NULL) {
next 43 src/unbound-queue-inl.h Node* next;
next 63 src/unbound-queue-inl.h first_ = tmp->next;
next 71 src/unbound-queue-inl.h Node* next = reinterpret_cast<Node*>(divider_)->next;
next 72 src/unbound-queue-inl.h *rec = next->value;
next 73 src/unbound-queue-inl.h OS::ReleaseStore(÷r_, reinterpret_cast<AtomicWord>(next));
next 79 src/unbound-queue-inl.h Node*& next = reinterpret_cast<Node*>(last_)->next;
next 80 src/unbound-queue-inl.h next = new Node(rec);
next 81 src/unbound-queue-inl.h OS::ReleaseStore(&last_, reinterpret_cast<AtomicWord>(next));
next 89 src/unbound-queue-inl.h Node* next = reinterpret_cast<Node*>(divider_)->next;
next 90 src/unbound-queue-inl.h return &next->value;
next 194 src/unicode.cc if (next != 0 && Letter::Is(next)) {
next 323 src/v8threads.cc ThreadState* next = current->next_;
next 325 src/v8threads.cc current = next;
next 452 src/x64/assembler-x64.cc int next = long_at(current);
next 453 src/x64/assembler-x64.cc while (next != current) {
next 457 src/x64/assembler-x64.cc current = next;
next 458 src/x64/assembler-x64.cc next = long_at(next);
next 540 src/x64/assembler-x64.cc for (RelocIterator it(desc); !it.done(); it.next()) {
next 1287 src/x64/full-codegen-x64.cc Label next, fast;
next 1293 src/x64/full-codegen-x64.cc __ bind(&next);
next 1302 src/x64/full-codegen-x64.cc __ jmp(&next);
next 2371 src/x64/lithium-codegen-x64.cc Label next;
next 2374 src/x64/lithium-codegen-x64.cc __ j(not_equal, &next, compact ? Label::kNear : Label::kFar);
next 2379 src/x64/lithium-codegen-x64.cc __ bind(&next);
next 437 src/x64/lithium-x64.cc HBasicBlock* next = NULL;
next 438 src/x64/lithium-x64.cc if (i < blocks->length() - 1) next = blocks->at(i + 1);
next 439 src/x64/lithium-x64.cc DoBasicBlock(blocks->at(i), next);
next 625 src/x64/lithium-x64.cc ASSERT(hinstr->next()->IsSimulate());
next 626 src/x64/lithium-x64.cc HSimulate* sim = HSimulate::cast(hinstr->next());
next 822 src/x64/lithium-x64.cc current = current->next();
next 4447 src/x64/macro-assembler-x64.cc Label next;
next 4454 src/x64/macro-assembler-x64.cc bind(&next);
next 4491 src/x64/macro-assembler-x64.cc j(not_equal, &next);
next 46 src/zone.cc next_ = next;
next 116 src/zone.cc keep = keep->next();
next 123 src/zone.cc Segment* next = current->next();
next 135 src/zone.cc current = next;
next 10696 test/cctest/test-api.cc for (i::HeapObject* object = it.next(); object != NULL; object = it.next())
next 392 test/cctest/test-debug.cc node = node->next();
next 403 test/cctest/test-debug.cc node = node->next();
next 429 test/cctest/test-debug.cc for (HeapObject* obj = iterator.next(); obj != NULL; obj = iterator.next()) {
next 438 test/cctest/test-debug.cc for (RelocIterator it(fun->shared()->code()); !it.done(); it.next()) {
next 2574 test/cctest/test-debug.cc void next() {
next 2596 test/cctest/test-debug.cc process_debug_messages_data.next();
next 792 test/cctest/test-heap.cc for (HeapObject* obj = iterator.next(); obj != NULL; obj = iterator.next()) {
next 1239 test/cctest/test-heap.cc for (HeapObject* obj = iterator.next();
next 1241 test/cctest/test-heap.cc obj = iterator.next()) {
next 1355 test/cctest/test-heap.cc for (HeapObject* obj = iterator.next(); obj != NULL; obj = iterator.next()) {
next 73 test/cctest/test-liveedit.cc DiffChunkStruct* next;
next 87 test/cctest/test-liveedit.cc next_chunk_pointer_ = ¤t_chunk_->next;
next 116 test/cctest/test-liveedit.cc chunk = chunk->next) {
next 585 test/cctest/test-regexp.cc unsigned next = PseudoRandom(i, j) % kLimit;
next 586 test/cctest/test-regexp.cc if (seen[next]) {
next 590 test/cctest/test-regexp.cc CHECK(tree.Find(next, &loc));
next 591 test/cctest/test-regexp.cc CHECK_EQ(next, loc.key());
next 592 test/cctest/test-regexp.cc CHECK_EQ(3 * next, loc.value());
next 593 test/cctest/test-regexp.cc tree.Remove(next);
next 594 test/cctest/test-regexp.cc seen[next] = false;
next 599 test/cctest/test-regexp.cc CHECK(!tree.Find(next, &loc));
next 600 test/cctest/test-regexp.cc CHECK(tree.Insert(next, &loc));
next 601 test/cctest/test-regexp.cc CHECK_EQ(next, loc.key());
next 602 test/cctest/test-regexp.cc loc.set_value(3 * next);
next 603 test/cctest/test-regexp.cc seen[next] = true;
next 77 test/cctest/test-reloc-info.cc it.next();
next 94 test/cctest/test-reloc-info.cc it.next();
next 110 test/cctest/test-reloc-info.cc it.next();