prev 317 MMgc/FixedAlloc.cpp b->prev = m_lastBlock;
prev 349 MMgc/FixedAlloc.cpp b->prev->next = b->next;
prev 353 MMgc/FixedAlloc.cpp m_lastBlock = b->prev;
prev 355 MMgc/FixedAlloc.cpp b->next->prev = b->prev;
prev 154 MMgc/FixedAlloc.h FixedBlock* prev;
prev 328 MMgc/FixedMalloc.cpp LargeObject *lo, *prev;
prev 329 MMgc/FixedMalloc.cpp for ( prev=NULL, lo=largeObjects ; lo != NULL ; prev=lo, lo=lo->next ) {
prev 331 MMgc/FixedMalloc.cpp if (prev != NULL)
prev 332 MMgc/FixedMalloc.cpp prev->next = lo->next;
prev 260 MMgc/GC-inlines.h rcRootSegments->prev = segment;
prev 267 MMgc/GC-inlines.h segment->next->prev = segment->prev;
prev 268 MMgc/GC-inlines.h if (segment->prev != NULL)
prev 269 MMgc/GC-inlines.h segment->prev->next = segment->next;
prev 1144 MMgc/GC.cpp , prev(NULL)
prev 1923 MMgc/GC.cpp void *prev = 0;
prev 1931 MMgc/GC.cpp prev = fitem;
prev 3329 MMgc/GC.cpp root->prev = NULL;
prev 3332 MMgc/GC.cpp m_roots->prev = root;
prev 3342 MMgc/GC.cpp root->prev->next = root->next;
prev 3345 MMgc/GC.cpp root->next->prev = root->prev;
prev 3600 MMgc/GC.cpp seg->prev = top_segment;
prev 3614 MMgc/GC.cpp top_segment = top_segment->prev;
prev 3734 MMgc/GC.cpp GCAssert(top_segment != NULL && top_segment->prev == NULL && top_segment->start == stacktop);
prev 150 MMgc/GC.h GCRoot *prev;
prev 925 MMgc/GC.h RCRootSegment* prev;
prev 1686 MMgc/GC.h AllocaStackSegment* prev; // segments further from the top
prev 151 MMgc/GCAlloc.cpp b->prev = m_lastBlock;
prev 195 MMgc/GCAlloc.cpp b->prev->next = Next(b);
prev 199 MMgc/GCAlloc.cpp m_lastBlock = b->prev;
prev 201 MMgc/GCAlloc.cpp Next(b)->prev = b->prev;
prev 208 MMgc/GCAlloc.cpp b->next = b->prev = NULL;
prev 181 MMgc/GCAlloc.h GCBlock* prev;
prev 411 MMgc/GCHeap.cpp while ((block = block->prev) != freelist && decommitSize > 0)
prev 476 MMgc/GCHeap.cpp HeapBlock *prev = block - block->sizePrevious;
prev 477 MMgc/GCHeap.cpp if(block->sizePrevious != 0 && !prev->committed && !prev->inUse()) {
prev 478 MMgc/GCHeap.cpp RemoveFromList(prev);
prev 480 MMgc/GCHeap.cpp prev->size += block->size;
prev 486 MMgc/GCHeap.cpp block = prev;
prev 743 MMgc/GCHeap.cpp sentinel->prev = NULL;
prev 767 MMgc/GCHeap.cpp if (temp->prev != fl) {
prev 768 MMgc/GCHeap.cpp if(temp->prev > block) {
prev 769 MMgc/GCHeap.cpp temp->prev = newBlocks + (temp->prev-blocks-blockSize) + sen_offset;
prev 787 MMgc/GCHeap.cpp r = r->prev;
prev 814 MMgc/GCHeap.cpp HeapBlock *prev = NULL;
prev 816 MMgc/GCHeap.cpp prev = block - block->sizePrevious;
prev 817 MMgc/GCHeap.cpp GCAssert(prev->size == block->sizePrevious);
prev 826 MMgc/GCHeap.cpp if(prev)
prev 827 MMgc/GCHeap.cpp GCAssert(block->baseAddr == prev->baseAddr + (kBlockSize * prev->size));
prev 836 MMgc/GCHeap.cpp Region *prevRegion = AddrToRegion(prev->baseAddr + (prev->size*kBlockSize) - 1);
prev 837 MMgc/GCHeap.cpp GCAssert(prev->baseAddr + (prev->size*kBlockSize) == prevRegion->commitTop);
prev 853 MMgc/GCHeap.cpp region = region->prev)
prev 1108 MMgc/GCHeap.cpp HeapBlock *prev = block - block->sizePrevious;
prev 1109 MMgc/GCHeap.cpp GCAssert(block->sizePrevious == prev->size);
prev 1143 MMgc/GCHeap.cpp else if( r->prev && r->prev->reserveTop==r->baseAddr){
prev 1150 MMgc/GCHeap.cpp r = r->prev;
prev 1169 MMgc/GCHeap.cpp r = r->prev;
prev 1175 MMgc/GCHeap.cpp r = r->prev;
prev 1221 MMgc/GCHeap.cpp block->prev = pointToInsert->prev;
prev 1222 MMgc/GCHeap.cpp block->prev->next = block;
prev 1223 MMgc/GCHeap.cpp pointToInsert->prev = block;
prev 1575 MMgc/GCHeap.cpp if (temp->prev != freelist) {
prev 1576 MMgc/GCHeap.cpp temp->prev = newBlocks + (temp->prev-blocks);
prev 1607 MMgc/GCHeap.cpp block->prev = NULL;
prev 1647 MMgc/GCHeap.cpp block->prev = NULL;
prev 1662 MMgc/GCHeap.cpp block->prev = NULL;
prev 1728 MMgc/GCHeap.cpp next = &((*next)->prev);
prev 1729 MMgc/GCHeap.cpp *next = region->prev;
prev 1744 MMgc/GCHeap.cpp lastRegion = lastRegion->prev;
prev 2118 MMgc/GCHeap.cpp r = r->prev;
prev 2124 MMgc/GCHeap.cpp for(int i=0; i < numRegions; i++, r = r->prev) {
prev 2372 MMgc/GCHeap.cpp lastRegion = r->prev;
prev 583 MMgc/GCHeap.h Region *prev;
prev 674 MMgc/GCHeap.h HeapBlock *prev; // prev entry on free list
prev 682 MMgc/GCHeap.h bool inUse() const { return prev == NULL; }
prev 689 MMgc/GCHeap.h prev = this;
prev 749 MMgc/GCHeap.h block->prev->next = block->next;
prev 750 MMgc/GCHeap.h block->next->prev = block->prev;
prev 751 MMgc/GCHeap.h block->next = block->prev = 0;
prev 144 MMgc/GCLargeAlloc.cpp LargeBlock **prev = &m_blocks;
prev 145 MMgc/GCLargeAlloc.cpp while(*prev)
prev 147 MMgc/GCLargeAlloc.cpp if(b == *prev)
prev 149 MMgc/GCLargeAlloc.cpp *prev = Next(b);
prev 153 MMgc/GCLargeAlloc.cpp prev = (LargeBlock**)(&(*prev)->next);
prev 170 MMgc/GCLargeAlloc.cpp LargeBlock **prev = &m_blocks;
prev 171 MMgc/GCLargeAlloc.cpp while (*prev) {
prev 172 MMgc/GCLargeAlloc.cpp LargeBlock *b = *prev;
prev 183 MMgc/GCLargeAlloc.cpp *prev = Next(b);
prev 219 MMgc/GCLargeAlloc.cpp prev = (LargeBlock**)(&b->next);
prev 186 VMPI/MMgcPortSymbian.cpp SymbianHeap* prev = NULL;
prev 191 VMPI/MMgcPortSymbian.cpp if(prev)
prev 193 VMPI/MMgcPortSymbian.cpp prev->next = heap->next;
prev 201 VMPI/MMgcPortSymbian.cpp prev = list;
prev 229 VMPI/MMgcPortWin.cpp curRegion = curRegion->prev;
prev 252 VMPI/MMgcPortWin.cpp curRegion = curRegion->prev;
prev 2887 core/AvmCore.cpp LivePoolNode** prev = &livePools;
prev 2899 core/AvmCore.cpp *prev = node->next;
prev 2901 core/AvmCore.cpp node = *prev;
prev 2910 core/AvmCore.cpp prev = &node->next;
prev 141 core/QCache.cpp QCachedItem* prev = NULL;
prev 144 core/QCache.cpp AvmAssert(prev ? prev->next == td : true);
prev 146 core/QCache.cpp prev = td;
prev 122 core/avmplusDebugger.cpp int prev = core->callStack->linenum();
prev 128 core/avmplusDebugger.cpp bool changed = (prev == line) ? false : true;
prev 129 core/avmplusDebugger.cpp bool exited = (prev == -1) ? true : false; // are we being called as a result of function exit?
prev 211 core/avmplusDebugger.cpp Stringp prev = core->callStack->filename();
prev 215 core/avmplusDebugger.cpp if (prev != filename)
prev 67 eval/eval-util.cpp current_chunk = current_chunk->prev;
prev 79 eval/eval-util.cpp c->prev = current_chunk;
prev 148 eval/eval-util.h Chunk* prev;
prev 1556 extensions/JavaGlue.cpp UINT prev = SetErrorMode(SEM_NOOPENFILEERRORBOX);
prev 1572 extensions/JavaGlue.cpp SetErrorMode(prev);
prev 61 nanojit/Allocator.cpp Chunk *prev = c->prev;
prev 63 nanojit/Allocator.cpp c = prev;
prev 89 nanojit/Allocator.cpp chunk->prev = current_chunk;
prev 76 nanojit/Allocator.h Chunk* prev;
prev 206 nanojit/CodeAlloc.cpp CodeList** prev = &availblocks;
prev 207 nanojit/CodeAlloc.cpp for (CodeList* ab = availblocks; ab != 0; ab = *prev) {
prev 211 nanojit/CodeAlloc.cpp *prev = ab->next;
prev 214 nanojit/CodeAlloc.cpp prev = &ab->next;
prev 219 nanojit/CodeAlloc.cpp prev = &heapblocks;
prev 220 nanojit/CodeAlloc.cpp for (CodeList* hb = heapblocks; hb != 0; hb = *prev) {
prev 226 nanojit/CodeAlloc.cpp *prev = hb->next;
prev 232 nanojit/CodeAlloc.cpp prev = &hb->next;
prev 320 nanojit/Containers.h Seq<Node>** prev = &buckets[i];
prev 323 nanojit/Containers.h (*prev) = p->tail;
prev 326 nanojit/Containers.h prev = &p->tail;
prev 2159 nanojit/LIR.cpp LirFilter* prev = &bufreader;
prev 2166 nanojit/LIR.cpp pp_init = new (alloc) ReverseLister(prev, alloc, frag->lirbuf->names, assm->_logc,
prev 2168 nanojit/LIR.cpp prev = pp_init;
prev 2172 nanojit/LIR.cpp StackFilter stackfilter(prev, alloc, frag->lirbuf, frag->lirbuf->sp, frag->lirbuf->rp);
prev 2173 nanojit/LIR.cpp prev = &stackfilter;
prev 2176 nanojit/LIR.cpp pp_after_sf = new (alloc) ReverseLister(prev, alloc, frag->lirbuf->names, assm->_logc,
prev 2178 nanojit/LIR.cpp prev = pp_after_sf;
prev 2181 nanojit/LIR.cpp assm->assemble(frag, prev);
prev 191 other-licenses/zlib/deflate.c match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \
prev 288 other-licenses/zlib/deflate.c s->prev = (Posf *) ZALLOC(strm, s->w_size, sizeof(Pos));
prev 297 other-licenses/zlib/deflate.c if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||
prev 880 other-licenses/zlib/deflate.c TRY_FREE(strm, strm->state->prev);
prev 921 other-licenses/zlib/deflate.c ds->prev = (Posf *) ZALLOC(dest, ds->w_size, sizeof(Pos));
prev 926 other-licenses/zlib/deflate.c if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||
prev 933 other-licenses/zlib/deflate.c zmemcpy(ds->prev, ss->prev, ds->w_size * sizeof(Pos));
prev 1042 other-licenses/zlib/deflate.c Posf *prev = s->prev;
prev 1163 other-licenses/zlib/deflate.c } while ((cur_match = prev[cur_match & wmask]) > limit
prev 1316 other-licenses/zlib/deflate.c p = &s->prev[n];
prev 1690 other-licenses/zlib/deflate.c uInt prev; /* byte at distance one to match */
prev 1711 other-licenses/zlib/deflate.c prev = *scan++;
prev 1713 other-licenses/zlib/deflate.c if (*scan++ != prev)
prev 128 other-licenses/zlib/deflate.h Posf *prev;
prev 531 pcre/pcre_exec.cpp const uschar *prev; /* heap, it is easier to declare them all */
prev 1117 pcre/pcre_exec.cpp prev = ecode;
prev 1169 pcre/pcre_exec.cpp ecode = prev;
prev 1175 pcre/pcre_exec.cpp RMATCH(eptr, prev, offset_top, md, ims, eptrb, match_cbegroup, RM9);
prev 1221 pcre/pcre_exec.cpp prev = ecode - GET(ecode, 1);
prev 1227 pcre/pcre_exec.cpp if (*prev >= OP_SBRA)
prev 1238 pcre/pcre_exec.cpp if (*prev == OP_ASSERT || *prev == OP_ASSERT_NOT ||
prev 1239 pcre/pcre_exec.cpp *prev == OP_ASSERTBACK || *prev == OP_ASSERTBACK_NOT ||
prev 1240 pcre/pcre_exec.cpp *prev == OP_ONCE)
prev 1245 pcre/pcre_exec.cpp else if(*prev != OP_ONCE)
prev 1248 pcre/pcre_exec.cpp bool prev_op_was_negative = (*prev == OP_ASSERT_NOT || *prev == OP_ASSERTBACK_NOT);
prev 1249 pcre/pcre_exec.cpp while(prev < ecode) {
prev 1250 pcre/pcre_exec.cpp if(*prev == OP_CBRA || *prev == OP_SCBRA) {
prev 1251 pcre/pcre_exec.cpp offset = GET2(prev, 1+LINK_SIZE)<<1;
prev 1257 pcre/pcre_exec.cpp prev += _pcre_OP_lengths[*prev];
prev 1259 pcre/pcre_exec.cpp int c = *prev;
prev 1260 pcre/pcre_exec.cpp prev += _pcre_OP_lengths[*prev];
prev 1279 pcre/pcre_exec.cpp if (prev[-1] >= 0xc0)
prev 1280 pcre/pcre_exec.cpp prev += _pcre_utf8_table4[prev[-1] & 0x3f];
prev 1283 pcre/pcre_exec.cpp prev += GET(prev, 1); // length of xclass stored in the code, 0 in OP_lengths table
prev 1290 pcre/pcre_exec.cpp prev = ecode - GET(ecode, 1);
prev 1302 pcre/pcre_exec.cpp if (*prev == OP_CBRA || *prev == OP_SCBRA)
prev 1304 pcre/pcre_exec.cpp number = GET2(prev, 1+LINK_SIZE);
prev 1365 pcre/pcre_exec.cpp flags = (*prev >= OP_SBRA)? match_cbegroup : 0;
prev 1373 pcre/pcre_exec.cpp RMATCH(eptr, prev, offset_top, md, ims, eptrb, flags, RM50);
prev 1376 pcre/pcre_exec.cpp ecode = prev;
prev 1381 pcre/pcre_exec.cpp RMATCH(eptr, prev, offset_top, md, ims, eptrb, flags, RM13);
prev 404 shell/DebugCLI.cpp breakAction->prev = lastBreakAction;
prev 438 shell/DebugCLI.cpp if (breakAction->prev) {
prev 439 shell/DebugCLI.cpp breakAction->prev->next = breakAction->next;
prev 444 shell/DebugCLI.cpp breakAction->next->prev = breakAction->prev;
prev 446 shell/DebugCLI.cpp lastBreakAction = breakAction->prev;
prev 50 shell/DebugCLI.h BreakAction *prev;