next 204 MMgc/BasicList.h T next()
next 276 MMgc/FixedAlloc.cpp b = b->next;
next 318 MMgc/FixedAlloc.cpp b->next = 0;
next 320 MMgc/FixedAlloc.cpp m_lastBlock->next = b;
next 347 MMgc/FixedAlloc.cpp m_firstBlock = b->next;
next 349 MMgc/FixedAlloc.cpp b->prev->next = b->next;
next 355 MMgc/FixedAlloc.cpp b->next->prev = b->prev;
next 380 MMgc/FixedAlloc.cpp for ( FixedBlock* fb=m_firstBlock ; fb != NULL ; fb=fb->next )
next 455 MMgc/FixedAlloc.cpp char *next = mem + b->alloc->m_itemSize;
next 456 MMgc/FixedAlloc.cpp if(addr >= mem && addr < next)
next 458 MMgc/FixedAlloc.cpp mem = next;
next 153 MMgc/FixedAlloc.h FixedBlock* next;
next 311 MMgc/FixedMalloc.cpp for ( LargeObject* lo=largeObjects; lo != NULL ; lo=lo->next)
next 322 MMgc/FixedMalloc.cpp lo->next = largeObjects;
next 329 MMgc/FixedMalloc.cpp for ( prev=NULL, lo=largeObjects ; lo != NULL ; prev=lo, lo=lo->next ) {
next 332 MMgc/FixedMalloc.cpp prev->next = lo->next;
next 334 MMgc/FixedMalloc.cpp largeObjects = lo->next;
next 174 MMgc/FixedMalloc.h LargeObject* next; // Next object
next 258 MMgc/GC-inlines.h segment->next = rcRootSegments;
next 266 MMgc/GC-inlines.h if (segment->next != NULL)
next 267 MMgc/GC-inlines.h segment->next->prev = segment->prev;
next 269 MMgc/GC-inlines.h segment->prev->next = segment->next;
next 271 MMgc/GC-inlines.h rcRootSegments = segment->next;
next 541 MMgc/GC-inlines.h b->next = smallEmptyPageList;
next 547 MMgc/GC-inlines.h lb->next = largeEmptyPageList;
next 956 MMgc/GC.cpp GCAssert(offsetof(GCLargeAlloc::LargeBlock, next) == offsetof(GCAlloc::GCBlock, next));
next 1010 MMgc/GC.cpp uint32_t *next = *(uint32_t**)bitsFreelist;
next 1015 MMgc/GC.cpp bitsFreelist = next;
next 1021 MMgc/GC.cpp void **next = (void**) *pageList;
next 1023 MMgc/GC.cpp pageList = next;
next 1579 MMgc/GC.cpp GCAlloc::GCBlock *next = GCAlloc::Next(b);
next 1586 MMgc/GC.cpp b = next;
next 1594 MMgc/GC.cpp GCLargeAlloc::LargeBlock *next = GCLargeAlloc::Next(lb);
next 1602 MMgc/GC.cpp lb = next;
next 1934 MMgc/GC.cpp _b = _b->next;
next 2543 MMgc/GC.cpp r = r->next;
next 3330 MMgc/GC.cpp root->next = m_roots;
next 3340 MMgc/GC.cpp m_roots = root->next;
next 3342 MMgc/GC.cpp root->prev->next = root->next;
next 3344 MMgc/GC.cpp if(root->next)
next 3345 MMgc/GC.cpp root->next->prev = root->prev;
next 3796 MMgc/GC.cpp r = r->next;
next 149 MMgc/GC.h GCRoot *next;
next 926 MMgc/GC.h RCRootSegment* next;
next 60 MMgc/GCAlloc-inlines.h return (GCBlock*)b->next;
next 152 MMgc/GCAlloc.cpp b->next = 0;
next 155 MMgc/GCAlloc.cpp m_lastBlock->next = b;
next 195 MMgc/GCAlloc.cpp b->prev->next = Next(b);
next 208 MMgc/GCAlloc.cpp b->next = b->prev = NULL;
next 411 MMgc/GCAlloc.cpp GCBlock *next = NULL;
next 412 MMgc/GCAlloc.cpp for (GCBlock* b = m_firstBlock; b != NULL; b = next)
next 415 MMgc/GCAlloc.cpp next = Next(b);
next 581 MMgc/GCAlloc.cpp GCBlock* next;
next 582 MMgc/GCAlloc.cpp for (GCBlock* b = m_needsSweeping; b != NULL; b = next)
next 584 MMgc/GCAlloc.cpp next = b->nextFree;
next 611 MMgc/GCAlloc.cpp for ( GCBlock *block=m_firstBlock, *next ; block ; block=next ) {
next 612 MMgc/GCAlloc.cpp next = Next(block);
next 627 MMgc/GCAlloc.cpp GCBlock *next = Next(b);
next 650 MMgc/GCAlloc.cpp b = next;
next 54 MMgc/GCAlloc.h GCBlockHeader* next; // The next block in the list of blocks for the allocator
next 489 MMgc/GCHeap.cpp HeapBlock *next = block + block->size;
next 490 MMgc/GCHeap.cpp if(next->size != 0 && !next->committed && !next->inUse()) {
next 491 MMgc/GCHeap.cpp RemoveFromList(next);
next 493 MMgc/GCHeap.cpp block->size += next->size;
next 495 MMgc/GCHeap.cpp next->size = 0;
next 496 MMgc/GCHeap.cpp next->sizePrevious = 0;
next 497 MMgc/GCHeap.cpp next->baseAddr = 0;
next 500 MMgc/GCHeap.cpp next = block + block->size;
next 501 MMgc/GCHeap.cpp next->sizePrevious = block->size;
next 507 MMgc/GCHeap.cpp while ((pointToInsert = pointToInsert->next) != backOfTheBus) {
next 621 MMgc/GCHeap.cpp char *next = Split(block, numBlocks)->baseAddr;
next 624 MMgc/GCHeap.cpp block = AddrToBlock(next);
next 744 MMgc/GCHeap.cpp sentinel->next = NULL;
next 772 MMgc/GCHeap.cpp if (temp->next != fl) {
next 773 MMgc/GCHeap.cpp if(temp->next > block) {
next 774 MMgc/GCHeap.cpp temp->next = newBlocks + (temp->next-blocks-blockSize) + sen_offset;
next 777 MMgc/GCHeap.cpp } while ((temp = temp->next) != fl);
next 809 MMgc/GCHeap.cpp HeapBlock *next = NULL;
next 811 MMgc/GCHeap.cpp next = block + block->size;
next 812 MMgc/GCHeap.cpp GCAssert(next->sizePrevious == block->size);
next 828 MMgc/GCHeap.cpp block = next;
next 830 MMgc/GCHeap.cpp GCAssert(next - blocks < (int)blocksLen);
next 886 MMgc/GCHeap.cpp while ((block = block->next) != freelist)
next 1102 MMgc/GCHeap.cpp while((block = block->next) != freelist)
next 1104 MMgc/GCHeap.cpp GCAssert(block != block->next);
next 1105 MMgc/GCHeap.cpp GCAssert(block != block->next->next || block->next == freelist);
next 1206 MMgc/GCHeap.cpp while ((pointToInsert = pointToInsert->next) != freelist) {
next 1220 MMgc/GCHeap.cpp block->next = pointToInsert;
next 1222 MMgc/GCHeap.cpp block->prev->next = block;
next 1578 MMgc/GCHeap.cpp if (temp->next != freelist) {
next 1579 MMgc/GCHeap.cpp temp->next = newBlocks + (temp->next-blocks);
next 1581 MMgc/GCHeap.cpp } while ((temp = temp->next) != freelist);
next 1608 MMgc/GCHeap.cpp block->next = NULL;
next 1621 MMgc/GCHeap.cpp HeapBlock *next = Split(block, numBlocksNeededForHeapBlocks);
next 1624 MMgc/GCHeap.cpp block = next;
next 1630 MMgc/GCHeap.cpp HeapBlock *next = Split(block, 1);
next 1634 MMgc/GCHeap.cpp block = next;
next 1648 MMgc/GCHeap.cpp block->next = NULL;
next 1663 MMgc/GCHeap.cpp block->next = NULL;
next 1726 MMgc/GCHeap.cpp Region **next = &lastRegion;
next 1727 MMgc/GCHeap.cpp while(*next != region)
next 1728 MMgc/GCHeap.cpp next = &((*next)->prev);
next 1729 MMgc/GCHeap.cpp *next = region->prev;
next 2027 MMgc/GCHeap.cpp while((gc = iter.next()) != NULL)
next 2249 MMgc/GCHeap.cpp while((otherGC = iter.next()) != NULL)
next 2257 MMgc/GCHeap.cpp while((otherGC = iter.next()) != NULL)
next 2284 MMgc/GCHeap.cpp cb = iter.next();
next 675 MMgc/GCHeap.h HeapBlock *next; // next entry on free list
next 690 MMgc/GCHeap.h next = this;
next 749 MMgc/GCHeap.h block->prev->next = block->next;
next 750 MMgc/GCHeap.h block->next->prev = block->prev;
next 751 MMgc/GCHeap.h block->next = block->prev = 0;
next 53 MMgc/GCLargeAlloc-inlines.h return (LargeBlock*)b->next;
next 82 MMgc/GCLargeAlloc.cpp block->next = m_blocks;
next 153 MMgc/GCLargeAlloc.cpp prev = (LargeBlock**)(&(*prev)->next);
next 184 MMgc/GCLargeAlloc.cpp b->next = NULL;
next 219 MMgc/GCLargeAlloc.cpp prev = (LargeBlock**)(&b->next);
next 592 MMgc/ZCT.cpp segment = segment->next;
next 60 VMPI/MMgcPortSymbian.cpp next = 0;
next 106 VMPI/MMgcPortSymbian.cpp SymbianHeap* next;
next 123 VMPI/MMgcPortSymbian.cpp heap = heap->next;
next 166 VMPI/MMgcPortSymbian.cpp newHeap->next = heapListRoot;
next 193 VMPI/MMgcPortSymbian.cpp prev->next = heap->next;
next 196 VMPI/MMgcPortSymbian.cpp heapListRoot = heap->next;
next 202 VMPI/MMgcPortSymbian.cpp list = list->next;
next 1545 core/AbcParser.cpp Namespacep nsi = iter.next();
next 1582 core/AbcParser.cpp Namespacep nsi = iter.next();
next 647 core/AvmCore-inlines.h this->next = core->currentMethodFrame;
next 660 core/AvmCore-inlines.h this->next = core->currentMethodFrame;
next 671 core/AvmCore-inlines.h core->currentMethodFrame = this->next;
next 364 core/AvmCore.cpp LivePoolNode* next = node->next;
next 366 core/AvmCore.cpp node = next;
next 627 core/AvmCore.cpp while (iter.next())
next 1060 core/AvmCore.cpp for (callStackNode = callStack; callStackNode; callStackNode = callStackNode->next())
next 2880 core/AvmCore.cpp node->next = livePools;
next 2899 core/AvmCore.cpp *prev = node->next;
next 2910 core/AvmCore.cpp prev = &node->next;
next 2911 core/AvmCore.cpp node = node->next;
next 2957 core/AvmCore.cpp for (LivePoolNode* node = livePools; node != NULL; node = node->next)
next 3866 core/AvmCore.cpp curr = curr->next();
next 4196 core/AvmCore.cpp for (MethodFrame* f = currentMethodFrame; f != NULL; f = f->next)
next 4236 core/AvmCore.cpp for (const MethodFrame* f = start; f != NULL; f = f->next) {
next 4383 core/AvmCore.cpp for (MethodFrame* f = currentMethodFrame; f != NULL; f = f->next)
next 228 core/AvmCore.h LivePoolNode* next;
next 1520 core/AvmCore.h MethodFrame* next;
next 1384 core/CodegenLIR.cpp stp(currentMethodFrame, methodFrame, offsetof(MethodFrame,next));
next 3393 core/CodegenLIR.cpp LIns* nextMethodFrame = loadIns(LIR_ldp, offsetof(MethodFrame,next), methodFrame);
next 5269 core/CodegenLIR.cpp for (BindingCache* b = bindingCaches; b != NULL; b = b->next)
next 242 core/CodegenLIR.h BindingCache(const Multiname*, BindingCache* next);
next 252 core/CodegenLIR.h BindingCache* const next; // singly-linked list
next 259 core/CodegenLIR.h CallCache(const Multiname*, BindingCache* next);
next 267 core/CodegenLIR.h GetCache(const Multiname*, BindingCache* next);
next 277 core/CodegenLIR.h SetCache(const Multiname*, BindingCache* next);
next 151 core/Domain.cpp refs->next = m_globalMemoryBaseRefs;
next 177 core/Domain.cpp refs->next = m_globalMemorySizeRefs;
next 211 core/Domain.cpp baseRefs = baseRefs->next;
next 235 core/Domain.cpp sizeRefs = sizeRefs->next;
next 129 core/Domain.h DWB(BaseRefChunk *) next;
next 136 core/Domain.h DWB(SizeRefChunk *) next;
next 76 core/DomainEnv.cpp int v = m_namedScripts->next(index);
next 333 core/MathUtils.cpp int32_t end,next;
next 340 core/MathUtils.cpp for (next=0; next*powOf2 <= 52; next++) { // read first 52 non-zero digits. Once charPosition*log2(radix) is > 53, we can have rounding issues
next 350 core/MathUtils.cpp if (next*powOf2 > 52) { // If number contains more than 53 bits of precision, may need to roundUp last digit processed.
next 628 core/MethodEnv.cpp core->callStack = callstack->next();
next 90 core/MultinameHashtable-inlines.h REALLY_INLINE bool StMNHTIterator::next()
next 363 core/MultinameHashtable.cpp int FASTCALL MultinameHashtable::next(int index) const
next 145 core/MultinameHashtable.h int FASTCALL next(int index) const;
next 190 core/MultinameHashtable.h bool next();
next 54 core/NamespaceSet-inlines.h REALLY_INLINE Namespacep NamespaceSetIterator::next()
next 70 core/NamespaceSet.cpp Namespacep ns = iter.next();
next 52 core/NamespaceSet.h Namespacep next();
next 64 core/QCache.cpp QCachedItem* n = next(gen);
next 65 core/QCache.cpp gen->next = NULL;
next 81 core/QCache.cpp AvmAssert(gen && !next(gen));
next 91 core/QCache.cpp for (QCachedItem* td = first(); td; td = next(td))
next 102 core/QCache.cpp evicted = evicted_prev->next;
next 104 core/QCache.cpp WB(m_gc, evicted_prev, &evicted_prev->next, evicted->next);
next 110 core/QCache.cpp WB(m_gc, this, &m_head, evicted->next);
next 112 core/QCache.cpp evicted->next = NULL; // never need a WB to write NULL
next 120 core/QCache.cpp WB(m_gc, gen, &gen->next, m_head);
next 128 core/QCache.cpp AvmAssert(evicted ? evicted->next == NULL : true);
next 142 core/QCache.cpp for (QCachedItem* td = first(); td; td = next(td))
next 144 core/QCache.cpp AvmAssert(prev ? prev->next == td : true);
next 75 core/QCache.h inline QCachedItem() : next(NULL) { }
next 77 core/QCache.h QCachedItem* next; // written with explicit WB
next 90 core/QCache.h inline QCachedItem* next(QCachedItem* gen) const { return gen->next; }
next 282 core/Sampler.cpp csn = csn->next();
next 158 core/StackTrace.h inline void setNext(CallStackNode* next) { m_next = next; }
next 159 core/StackTrace.h inline CallStackNode* next() const { return m_next; }
next 97 core/Traits-inlines.h REALLY_INLINE int32_t TraitsBindings::next(int32_t index) const
next 99 core/Traits-inlines.h return m_bindings->next(index);
next 385 core/Traits-inlines.h REALLY_INLINE Traits* InterfaceIterator::next()
next 296 core/Traits.cpp Traits* ifc = ifc_iter.next();
next 304 core/Traits.cpp while (iter.next())
next 383 core/Traits.cpp while (iter.next())
next 411 core/Traits.cpp Namespacep ns = iter.next();
next 1210 core/Traits.cpp while (iter.next())
next 1236 core/Traits.cpp Traits* t = it.next();
next 1261 core/Traits.cpp while (iter.next())
next 155 core/Traits.h int32_t next(int32_t index) const;
next 553 core/Traits.h Traits* next(); // get the next one (moves iterator forward)
next 59 core/TraitsIterator.h while ((index = traits->next(index)) == 0)
next 175 core/TypeDescriber.cpp while (iter.next())
next 231 core/TypeDescriber.cpp Traits* ti = iter.next();
next 264 core/TypeDescriber.cpp Traitsp ti = ifc_iter.next();
next 267 core/TypeDescriber.cpp while (iter.next())
next 281 core/TypeDescriber.cpp while (iter.next())
next 294 core/TypeDescriber.cpp while (iter.next())
next 107 core/VTable.cpp ImtEntry* const next;
next 131 core/VTable.cpp Traits* ifc = ifc_iter.next();
next 135 core/VTable.cpp while (iter.next())
next 290 core/VTable.cpp e = e->next;
next 122 core/WordcodeEmitter.cpp tmp1 = tmp1->next; \
next 154 core/WordcodeEmitter.cpp b->next = buffers;
next 167 core/WordcodeEmitter.cpp l = l->next;
next 194 core/WordcodeEmitter.cpp q = q->next;
next 197 core/WordcodeEmitter.cpp b->next = backpatches;
next 201 core/WordcodeEmitter.cpp b->next = q;
next 202 core/WordcodeEmitter.cpp qq->next = b;
next 267 core/WordcodeEmitter.cpp ee->next = p[j];
next 268 core/WordcodeEmitter.cpp p[j]->next = e;
next 274 core/WordcodeEmitter.cpp e = e->next;
next 281 core/WordcodeEmitter.cpp ee->next = p[j];
next 282 core/WordcodeEmitter.cpp p[j]->next = e;
next 293 core/WordcodeEmitter.cpp catch_info* e = ee->next;
next 296 core/WordcodeEmitter.cpp e = e->next;
next 314 core/WordcodeEmitter.cpp exception_fixes = exception_fixes->next;
next 323 core/WordcodeEmitter.cpp backpatches = backpatches->next;
next 859 core/WordcodeEmitter.cpp l->next = labels;
next 1049 core/WordcodeEmitter.cpp buffer_info* next = first->next;
next 1050 core/WordcodeEmitter.cpp first->next = NULL;
next 1051 core/WordcodeEmitter.cpp while (next != NULL) {
next 1052 core/WordcodeEmitter.cpp buffer_info* tmp = next->next;
next 1053 core/WordcodeEmitter.cpp next->next = first;
next 1054 core/WordcodeEmitter.cpp first = next;
next 1055 core/WordcodeEmitter.cpp next = tmp;
next 1064 core/WordcodeEmitter.cpp first = first->next;
next 1238 core/WordcodeEmitter.cpp buffers = buffers->next;
next 1239 core/WordcodeEmitter.cpp spare_buffer->next = NULL;
next 1336 core/WordcodeEmitter.cpp b2 = b, b = b->next;
next 1339 core/WordcodeEmitter.cpp backpatches = b->next;
next 1341 core/WordcodeEmitter.cpp b2->next = b->next;
next 138 core/WordcodeEmitter.h backpatch_info* next;
next 145 core/WordcodeEmitter.h label_info* next;
next 152 core/WordcodeEmitter.h catch_info* next;
next 159 core/WordcodeEmitter.h buffer_info* next;
next 534 core/avmplusDebugger.cpp while( (trace = trace->next()) != 0 && count < MAX_FRAMES )
next 565 core/avmplusDebugger.cpp trace = trace->next();
next 283 core/avmplusHashtable.cpp int InlineHashtable::next(int index)
next 266 core/avmplusHashtable.h int next(int index);
next 341 core/avmplusHashtable.h inline int next(int index) { return ht.next(index); }
next 368 core/avmplusHashtable.h inline int next(int index) { return ht.next(index); }
next 74 eval/eval-cogen-stmt.cpp Ctx * const next;
next 236 eval/eval-cogen-stmt.cpp ctx = ctx->next;
next 254 eval/eval-cogen-stmt.cpp restoreScopes(cogen, ctx->next);
next 321 eval/eval-cogen-stmt.cpp for ( c = ctx ; c->tag != CTX_Program && c->tag != CTX_Function && c->tag != CTX_ClassMethod ; c = c->next )
next 233 eval/eval-compile.cpp for ( Str* p = strTable[h] ; p != NULL ; p = p->next ) {
next 247 eval/eval-compile.cpp str->next = strTable[h];
next 146 eval/eval-parse-expr.cpp next();
next 208 eval/eval-parse-expr.cpp next();
next 214 eval/eval-parse-expr.cpp next();
next 220 eval/eval-parse-expr.cpp next();
next 226 eval/eval-parse-expr.cpp next();
next 232 eval/eval-parse-expr.cpp next();
next 238 eval/eval-parse-expr.cpp next();
next 244 eval/eval-parse-expr.cpp next();
next 249 eval/eval-parse-expr.cpp next();
next 352 eval/eval-parse-expr.cpp next();
next 461 eval/eval-parse-expr.cpp next();
next 466 eval/eval-parse-expr.cpp next();
next 475 eval/eval-parse-expr.cpp next();
next 494 eval/eval-parse-expr.cpp next();
next 506 eval/eval-parse-expr.cpp next();
next 523 eval/eval-parse-expr.cpp next();
next 546 eval/eval-parse-expr.cpp next();
next 559 eval/eval-parse-expr.cpp next();
next 54 eval/eval-parse-stmt.cpp next();
next 74 eval/eval-parse-stmt.cpp next();
next 180 eval/eval-parse-stmt.cpp next();
next 151 eval/eval-parse-xml.cpp next(); // Re-synchronize the lexer for normal lexing
next 280 eval/eval-parse-xml.cpp next(); // re-enter normal lexing
next 330 eval/eval-parse.cpp next();
next 337 eval/eval-parse.cpp next();
next 487 eval/eval-parse.cpp next();
next 497 eval/eval-parse.cpp s->next = lexerStack;
next 519 eval/eval-parse.cpp lexerStack = lexerStack->next;
next 529 eval/eval-parse.cpp topRib = topRib->next;
next 641 eval/eval-parse.cpp AvmAssert(topRib->next->tag == RIB_Class);
next 642 eval/eval-parse.cpp addMethodBinding(fn, topRib->next);
next 831 eval/eval-parse.cpp next();
next 839 eval/eval-parse.cpp next();
next 848 eval/eval-parse.cpp next();
next 983 eval/eval-parse.h BindingRib(Allocator* allocator, BindingRib* next, RibType tag);
next 994 eval/eval-parse.h BindingRib* next;
next 1025 eval/eval-parse.h LexerState* next;
next 1051 eval/eval-parse.h void next();
next 154 eval/eval-util.cpp while (chunk->next != NULL)
next 160 eval/eval-util.cpp append(other->chunk->next);
next 207 eval/eval-util.cpp if (chunk->next == NULL)
next 211 eval/eval-util.cpp wchar* p = copyInto(buf, chunk->next);
next 221 eval/eval-util.cpp char *p = copyInto(buf, chunk->next);
next 232 eval/eval-util.cpp append(other->next);
next 243 eval/eval-util.cpp if (c->next != NULL)
next 244 eval/eval-util.cpp p = copyInto(buf, c->next);
next 255 eval/eval-util.cpp if (c->next != NULL)
next 256 eval/eval-util.cpp p = copyInto(buf, c->next);
next 267 eval/eval-util.cpp allocator->free_sbchunks = allocator->free_sbchunks->next;
next 271 eval/eval-util.cpp c->next = chunk;
next 278 eval/eval-util.cpp chunk = chunk->next;
next 279 eval/eval-util.cpp c->next = allocator->free_sbchunks;
next 429 eval/eval-util.cpp c->next = NULL;
next 434 eval/eval-util.cpp last->next = c;
next 444 eval/eval-util.cpp for ( Chunk* c = first ; c != NULL ; c = c->next ) {
next 53 eval/eval-util.h Str* next; // next in hashtable bucket
next 87 eval/eval-util.h SBChunk* next;
next 193 eval/eval-util.h Chunk* next;
next 196 extensions/SamplerScript.cpp while ((index = currTraits->next(index)) != 0)
next 74 extensions/Selftest.cpp tests = tests->next;
next 81 extensions/Selftest.cpp test->next = NULL;
next 83 extensions/Selftest.cpp last->next = test;
next 96 extensions/Selftest.cpp for ( Selftest* volatile ts = tests ; ts != NULL ; ts = ts->next )
next 139 extensions/Selftest.h Selftest* next; // next test in a list owned by the SelftestRunner
next 581 nanojit/Assembler.cpp rec = rec->next;
next 588 nanojit/Assembler.cpp for (GuardRecord* lr = exit->guards; lr; lr = lr->next) {
next 734 nanojit/Assembler.cpp while (iter.next()) {
next 75 nanojit/CodeAlloc.cpp CodeList* next = b->next;
next 80 nanojit/CodeAlloc.cpp b = next;
next 100 nanojit/CodeAlloc.cpp for (CodeList* hb = heapblocks; hb != 0; hb = hb->next) {
next 176 nanojit/CodeAlloc.cpp while ( free_block && free_block->next != coalescedBlock) {
next 179 nanojit/CodeAlloc.cpp NanoAssert(free_block->next);
next 180 nanojit/CodeAlloc.cpp free_block = free_block->next;
next 182 nanojit/CodeAlloc.cpp NanoAssert(free_block && free_block->next == coalescedBlock);
next 183 nanojit/CodeAlloc.cpp free_block->next = coalescedBlock->next;
next 211 nanojit/CodeAlloc.cpp *prev = ab->next;
next 212 nanojit/CodeAlloc.cpp debug_only(ab->next = 0;)
next 214 nanojit/CodeAlloc.cpp prev = &ab->next;
next 223 nanojit/CodeAlloc.cpp NanoAssert(!hb->lower->next);
next 226 nanojit/CodeAlloc.cpp *prev = hb->next;
next 232 nanojit/CodeAlloc.cpp prev = &hb->next;
next 252 nanojit/CodeAlloc.cpp for (CodeList *b = blocks; b != 0; b = b->next)
next 336 nanojit/CodeAlloc.cpp b->next = blocks;
next 344 nanojit/CodeAlloc.cpp b->next = 0;
next 362 nanojit/CodeAlloc.cpp NanoAssert(b->end == end && b->next == 0); (void) end;
next 369 nanojit/CodeAlloc.cpp blocks = b->next;
next 370 nanojit/CodeAlloc.cpp b->next = 0;
next 403 nanojit/CodeAlloc.cpp b2->next = 0;
next 428 nanojit/CodeAlloc.cpp b2->next = 0;
next 429 nanojit/CodeAlloc.cpp b3->next = 0;
next 439 nanojit/CodeAlloc.cpp for (const CodeList* b = blocks; b != 0; b = b->next)
next 449 nanojit/CodeAlloc.cpp for (const CodeList *b = blocks; b != 0; b = b->next) {
next 460 nanojit/CodeAlloc.cpp while (last->next)
next 461 nanojit/CodeAlloc.cpp last = last->next;
next 462 nanojit/CodeAlloc.cpp last->next = blocks;
next 471 nanojit/CodeAlloc.cpp for (CodeList* hb = heapblocks; hb != 0; hb = hb->next) {
next 486 nanojit/CodeAlloc.cpp for (CodeList* hb = heapblocks; hb != 0; hb = hb->next) {
next 492 nanojit/CodeAlloc.cpp for (CodeList* avail = this->availblocks; avail; avail = avail->next) {
next 497 nanojit/CodeAlloc.cpp for(CodeList* term = heapblocks; term; term = term->next) {
next 501 nanojit/CodeAlloc.cpp for (CodeList* avail = this->availblocks; !found_on_avail && avail; avail = avail->next) {
next 509 nanojit/CodeAlloc.cpp for (CodeList* avail = this->availblocks; avail; avail = avail->next) {
next 511 nanojit/CodeAlloc.cpp for(CodeList* term = heapblocks; !found_in_heapblocks && term; term = term->next) {
next 60 nanojit/CodeAlloc.h CodeList* next;
next 353 nanojit/Containers.h bool next() {
next 377 nanojit/Containers.h return !iter.next();
next 1436 nanojit/LIR.cpp while (iter.next()) {
next 144 nanojit/Native.h GuardRecord* next;
next 161 nanojit/Native.h NanoAssert(gr->next == NULL);
next 163 nanojit/Native.h gr->next = guards;
next 1724 nanojit/NativeX64.cpp NIns *next = 0;
next 1727 nanojit/NativeX64.cpp next = patch+5;
next 1730 nanojit/NativeX64.cpp next = patch+6;
next 1732 nanojit/NativeX64.cpp next = 0;
next 1737 nanojit/NativeX64.cpp NanoAssert(isS32(target - next));
next 1738 nanojit/NativeX64.cpp ((int32_t*)next)[-1] = int32_t(target - next);
next 1739 nanojit/NativeX64.cpp if (next[0] == 0x0F && next[1] == 0x8A) {
next 1742 nanojit/NativeX64.cpp next += 6;
next 1743 nanojit/NativeX64.cpp NanoAssert(((int32_t*)next)[-1] == 0);
next 1744 nanojit/NativeX64.cpp NanoAssert(isS32(target - next));
next 1745 nanojit/NativeX64.cpp ((int32_t*)next)[-1] = int32_t(target - next);
next 611 nanojit/Nativei386.h verbose_only( NIns* next = _nIns; (void)next; ) \
next 615 nanojit/Nativei386.h asm_output("%-5s %p",(n),(next+tt)); \
next 617 nanojit/Nativei386.h verbose_only( NIns* next = _nIns; ) \
next 622 nanojit/Nativei386.h asm_output("%-5s %p",(n),(next+tt)); \
next 638 nanojit/Nativei386.h verbose_only( NIns* next = _nIns; (void)next; ) \
next 642 nanojit/Nativei386.h asm_output("jmp %p",(next+tt)); \
next 649 nanojit/Nativei386.h verbose_only( NIns* next = _nIns; (void)next; ) \
next 652 nanojit/Nativei386.h asm_output("jmp %p",(next+(o))); } while(0)
next 84 other-licenses/zlib/infback.c static code *next;
next 92 other-licenses/zlib/infback.c next = fixed;
next 93 other-licenses/zlib/infback.c lenfix = next;
next 95 other-licenses/zlib/infback.c inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
next 100 other-licenses/zlib/infback.c distfix = next;
next 102 other-licenses/zlib/infback.c inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
next 123 other-licenses/zlib/infback.c next = strm->next_in; \
next 134 other-licenses/zlib/infback.c strm->next_in = next; \
next 152 other-licenses/zlib/infback.c have = in(in_desc, &next); \
next 154 other-licenses/zlib/infback.c next = Z_NULL; \
next 167 other-licenses/zlib/infback.c hold += (unsigned long)(*next++) << bits; \
next 249 other-licenses/zlib/infback.c unsigned char FAR *next; /* next input */
next 273 other-licenses/zlib/infback.c next = strm->next_in;
next 274 other-licenses/zlib/infback.c have = next != Z_NULL ? strm->avail_in : 0;
next 338 other-licenses/zlib/infback.c zmemcpy(put, next, copy);
next 340 other-licenses/zlib/infback.c next += copy;
next 376 other-licenses/zlib/infback.c state->next = state->codes;
next 377 other-licenses/zlib/infback.c state->lencode = (code const FAR *)(state->next);
next 379 other-licenses/zlib/infback.c ret = inflate_table(CODES, state->lens, 19, &(state->next),
next 442 other-licenses/zlib/infback.c state->next = state->codes;
next 443 other-licenses/zlib/infback.c state->lencode = (code const FAR *)(state->next);
next 445 other-licenses/zlib/infback.c ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
next 452 other-licenses/zlib/infback.c state->distcode = (code const FAR *)(state->next);
next 455 other-licenses/zlib/infback.c &(state->next), &(state->distbits), state->work);
next 609 other-licenses/zlib/infback.c strm->next_in = next;
next 123 other-licenses/zlib/inflate.c state->lencode = state->distcode = state->next = state->codes;
next 216 other-licenses/zlib/inflate.c static code *next;
next 224 other-licenses/zlib/inflate.c next = fixed;
next 225 other-licenses/zlib/inflate.c lenfix = next;
next 227 other-licenses/zlib/inflate.c inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
next 232 other-licenses/zlib/inflate.c distfix = next;
next 234 other-licenses/zlib/inflate.c inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
next 407 other-licenses/zlib/inflate.c next = strm->next_in; \
next 418 other-licenses/zlib/inflate.c strm->next_in = next; \
next 437 other-licenses/zlib/inflate.c hold += (unsigned long)(*next++) << bits; \
next 559 other-licenses/zlib/inflate.c unsigned char FAR *next; /* next input */
next 688 other-licenses/zlib/inflate.c zmemcpy(state->head->extra + len, next,
next 693 other-licenses/zlib/inflate.c state->check = crc32(state->check, next, copy);
next 695 other-licenses/zlib/inflate.c next += copy;
next 707 other-licenses/zlib/inflate.c len = (unsigned)(next[copy++]);
next 714 other-licenses/zlib/inflate.c state->check = crc32(state->check, next, copy);
next 716 other-licenses/zlib/inflate.c next += copy;
next 728 other-licenses/zlib/inflate.c len = (unsigned)(next[copy++]);
next 735 other-licenses/zlib/inflate.c state->check = crc32(state->check, next, copy);
next 737 other-licenses/zlib/inflate.c next += copy;
next 826 other-licenses/zlib/inflate.c zmemcpy(put, next, copy);
next 828 other-licenses/zlib/inflate.c next += copy;
next 863 other-licenses/zlib/inflate.c state->next = state->codes;
next 864 other-licenses/zlib/inflate.c state->lencode = (code const FAR *)(state->next);
next 866 other-licenses/zlib/inflate.c ret = inflate_table(CODES, state->lens, 19, &(state->next),
next 929 other-licenses/zlib/inflate.c state->next = state->codes;
next 930 other-licenses/zlib/inflate.c state->lencode = (code const FAR *)(state->next);
next 932 other-licenses/zlib/inflate.c ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
next 939 other-licenses/zlib/inflate.c state->distcode = (code const FAR *)(state->next);
next 942 other-licenses/zlib/inflate.c &(state->next), &(state->distbits), state->work);
next 1245 other-licenses/zlib/inflate.c unsigned next;
next 1248 other-licenses/zlib/inflate.c next = 0;
next 1249 other-licenses/zlib/inflate.c while (next < len && got < 4) {
next 1250 other-licenses/zlib/inflate.c if ((int)(buf[next]) == (got < 2 ? 0 : 0xff))
next 1252 other-licenses/zlib/inflate.c else if (buf[next])
next 1256 other-licenses/zlib/inflate.c next++;
next 1259 other-licenses/zlib/inflate.c return next;
next 1360 other-licenses/zlib/inflate.c copy->next = copy->codes + (state->next - state->codes);
next 111 other-licenses/zlib/inflate.h code FAR *next; /* next available space in codes[] */
next 54 other-licenses/zlib/inftrees.c code FAR *next; /* next available space in table */
next 204 other-licenses/zlib/inftrees.c next = *table; /* current table to fill in */
next 238 other-licenses/zlib/inftrees.c next[(huff >> drop) + fill] = this;
next 266 other-licenses/zlib/inftrees.c next += min; /* here min is 1 << curr */
next 287 other-licenses/zlib/inftrees.c (*table)[low].val = (unsigned short)(next - *table);
next 306 other-licenses/zlib/inftrees.c next = *table;
next 311 other-licenses/zlib/inftrees.c next[huff >> drop] = this;
next 1183 pcre/pcre_compile.cpp TypedSegment *next; // next segment on the stack
next 1283 pcre/pcre_compile.cpp s->next = topSegment;
next 1293 pcre/pcre_compile.cpp topSegment = topSegment->next;
next 2191 pcre/pcre_compile.cpp unsigned int c, othercase, next;
next 2199 pcre/pcre_compile.cpp next = othercase + 1;
next 2203 pcre/pcre_compile.cpp if (_pcre_ucp_othercase(c) != next) break;
next 2204 pcre/pcre_compile.cpp next++;
next 2207 pcre/pcre_compile.cpp *odptr = next - 1;
next 2240 pcre/pcre_compile.cpp int next;
next 2272 pcre/pcre_compile.cpp next = check_escape(&ptr, &temperrorcode, cd->bracount, options, FALSE);
next 2280 pcre/pcre_compile.cpp if (utf8) { GETCHARINC(next, ptr); } else
next 2282 pcre/pcre_compile.cpp next = *ptr++;
next 2324 pcre/pcre_compile.cpp if (next >= 0) switch(op_code)
next 2330 pcre/pcre_compile.cpp return item != next;
next 2340 pcre/pcre_compile.cpp if (item == next) return FALSE;
next 2345 pcre/pcre_compile.cpp if (next < 128) othercase = cd->fcc[next]; else
next 2347 pcre/pcre_compile.cpp othercase = _pcre_ucp_othercase((unsigned int)next);
next 2355 pcre/pcre_compile.cpp return (item != cd->fcc[next]); /* Non-UTF-8 mode */
next 2360 pcre/pcre_compile.cpp if (next < 0) return FALSE; /* Not a character */
next 2361 pcre/pcre_compile.cpp if (item == next) return TRUE;
next 2367 pcre/pcre_compile.cpp if (next < 128) othercase = cd->fcc[next]; else
next 2369 pcre/pcre_compile.cpp othercase = _pcre_ucp_othercase(next);
next 2377 pcre/pcre_compile.cpp return (item == cd->fcc[next]); /* Non-UTF-8 mode */
next 2380 pcre/pcre_compile.cpp return next > 127 || (cd->ctypes[next] & ctype_digit) == 0;
next 2383 pcre/pcre_compile.cpp return next <= 127 && (cd->ctypes[next] & ctype_digit) != 0;
next 2386 pcre/pcre_compile.cpp return next > 127 || (cd->ctypes[next] & ctype_space) == 0;
next 2389 pcre/pcre_compile.cpp return next <= 127 && (cd->ctypes[next] & ctype_space) != 0;
next 2392 pcre/pcre_compile.cpp return next > 127 || (cd->ctypes[next] & ctype_word) == 0;
next 2395 pcre/pcre_compile.cpp return next <= 127 && (cd->ctypes[next] & ctype_word) != 0;
next 2399 pcre/pcre_compile.cpp switch(next)
next 2427 pcre/pcre_compile.cpp switch(next)
next 2455 pcre/pcre_compile.cpp switch(-next)
next 2498 pcre/pcre_compile.cpp return -next != ESC_h;
next 2500 pcre/pcre_compile.cpp return -next == ESC_h;
next 2514 pcre/pcre_compile.cpp return -next != ESC_v;
next 2516 pcre/pcre_compile.cpp return -next == ESC_v;
next 2524 pcre/pcre_compile.cpp return next == -ESC_D || next == -ESC_s || next == -ESC_W ||
next 2525 pcre/pcre_compile.cpp next == -ESC_h || next == -ESC_v;
next 2528 pcre/pcre_compile.cpp return next == -ESC_d;
next 2531 pcre/pcre_compile.cpp return next == -ESC_S || next == -ESC_d || next == -ESC_w;
next 2534 pcre/pcre_compile.cpp return next == -ESC_s || next == -ESC_h || next == -ESC_v;
next 2537 pcre/pcre_compile.cpp return next == -ESC_S || next == -ESC_H || next == -ESC_d || next == -ESC_w;
next 2540 pcre/pcre_compile.cpp return next == -ESC_h;
next 2544 pcre/pcre_compile.cpp return next == -ESC_V || next == -ESC_d || next == -ESC_w;
next 2547 pcre/pcre_compile.cpp return next == -ESC_v;
next 2550 pcre/pcre_compile.cpp return next == -ESC_W || next == -ESC_s || next == -ESC_h || next == -ESC_v;
next 2553 pcre/pcre_compile.cpp return next == -ESC_w || next == -ESC_d;
next 529 pcre/pcre_exec.cpp const uschar *next; /* version of this code that uses an */
next 1198 pcre/pcre_exec.cpp next = ecode+1;
next 1199 pcre/pcre_exec.cpp RMATCH(eptr, next, offset_top, md, ims, eptrb, 0, RM10);
next 1201 pcre/pcre_exec.cpp do next += GET(next,1); while (*next == OP_ALT);
next 1202 pcre/pcre_exec.cpp ecode = next + 1 + LINK_SIZE;
next 1208 pcre/pcre_exec.cpp next = ecode+1;
next 1209 pcre/pcre_exec.cpp do next += GET(next, 1); while (*next == OP_ALT);
next 1210 pcre/pcre_exec.cpp RMATCH(eptr, next + 1+LINK_SIZE, offset_top, md, ims, eptrb, 0, RM11);
next 193 shell/ByteArrayGlue.cpp prevNext = &curLink->next;
next 198 shell/ByteArrayGlue.cpp MMgc::GC::WriteBarrier(prevNext, curLink->next);
next 200 shell/ByteArrayGlue.cpp curLink = curLink->next;
next 211 shell/ByteArrayGlue.cpp MMgc::GC::WriteBarrier(&newLink->next, m_subscriberRoot);
next 229 shell/ByteArrayGlue.cpp MMgc::GC::WriteBarrier(prevNext, curLink->next);
next 232 shell/ByteArrayGlue.cpp prevNext = &curLink->next;
next 233 shell/ByteArrayGlue.cpp curLink = curLink->next;
next 81 shell/ByteArrayGlue.h SubscriberLink* next;
next 406 shell/DebugCLI.cpp lastBreakAction->next = breakAction;
next 421 shell/DebugCLI.cpp breakAction = breakAction->next;
next 434 shell/DebugCLI.cpp breakAction = breakAction->next;
next 439 shell/DebugCLI.cpp breakAction->prev->next = breakAction->next;
next 441 shell/DebugCLI.cpp firstBreakAction = breakAction->next;
next 443 shell/DebugCLI.cpp if (breakAction->next) {
next 444 shell/DebugCLI.cpp breakAction->next->prev = breakAction->prev;
next 51 shell/DebugCLI.h BreakAction *next;
next 230 shell/avmshell.cpp , next(NULL)
next 244 shell/avmshell.cpp CoreNode * next; // For the LRU list of available cores
next 254 shell/avmshell.cpp , next(NULL)
next 284 shell/avmshell.cpp ThreadNode * next; // For the LRU list of available threads
next 315 shell/avmshell.cpp free_threads_last->next = t;
next 322 shell/avmshell.cpp free_cores_last->next = t->corenode;
next 341 shell/avmshell.cpp free_threads = free_threads->next;
next 344 shell/avmshell.cpp (*t)->next = NULL;
next 347 shell/avmshell.cpp free_cores = free_cores->next;
next 350 shell/avmshell.cpp (*c)->next = NULL;
next 405 shell/avmshell.cpp cores[i]->next = state.free_cores;
next 122 utils/superwordprof.c codestruct_t *next;
next 116 vprof/vprof.cpp n = e->next;
next 117 vprof/vprof.cpp e->next = p;
next 145 vprof/vprof.cpp for (e = entries; e; e = e->next) {
next 201 vprof/vprof.cpp for (entry_t e = entries; e; e = e->next) {
next 249 vprof/vprof.cpp e->next = entries;
next 357 vprof/vprof.cpp e->next = entries;
next 236 vprof/vprof.h entry* next;