Lines Matching refs:prev

11221   HashElem *next, *prev;       /* Next and previous elements in the table */  member
21179 u32 prev; /* Index in mem3.aPool[] of previous free chunk */ member
21239 u32 prev = mem3.aPool[i].u.list.prev; in memsys3UnlinkFromList() local
21241 if( prev==0 ){ in memsys3UnlinkFromList()
21244 mem3.aPool[prev].u.list.next = next; in memsys3UnlinkFromList()
21247 mem3.aPool[next].u.list.prev = prev; in memsys3UnlinkFromList()
21250 mem3.aPool[i].u.list.prev = 0; in memsys3UnlinkFromList()
21280 mem3.aPool[i].u.list.prev = 0; in memsys3LinkIntoList()
21282 mem3.aPool[*pRoot].u.list.prev = i; in memsys3LinkIntoList()
21406 u32 iNext, prev, size, i, x; in memsys3Merge() local
21416 prev = i - mem3.aPool[i-1].u.hdr.prevSize; in memsys3Merge()
21417 if( prev==iNext ){ in memsys3Merge()
21418 iNext = mem3.aPool[prev].u.list.next; in memsys3Merge()
21420 memsys3Unlink(prev); in memsys3Merge()
21421 size = i + size/4 - prev; in memsys3Merge()
21422 x = mem3.aPool[prev-1].u.hdr.size4x & 2; in memsys3Merge()
21423 mem3.aPool[prev-1].u.hdr.size4x = size*4 | x; in memsys3Merge()
21424 mem3.aPool[prev+size-1].u.hdr.prevSize = size; in memsys3Merge()
21425 memsys3Link(prev); in memsys3Merge()
21426 i = prev; in memsys3Merge()
21850 int prev; /* Index of previous free chunk */ member
21930 int next, prev; in memsys5Unlink() local
21936 prev = MEM5LINK(i)->prev; in memsys5Unlink()
21937 if( prev<0 ){ in memsys5Unlink()
21940 MEM5LINK(prev)->next = next; in memsys5Unlink()
21943 MEM5LINK(next)->prev = prev; in memsys5Unlink()
21959 MEM5LINK(i)->prev = -1; in memsys5Link()
21962 MEM5LINK(x)->prev = i; in memsys5Link()
28759 pNew->prev = pHead->prev;
28760 if( pHead->prev ){ pHead->prev->next = pNew; }
28762 pHead->prev = pNew;
28765 if( pH->first ){ pH->first->prev = pNew; }
28766 pNew->prev = 0;
28858 if( elem->prev ){
28859 elem->prev->next = elem->next;
28864 elem->next->prev = elem->prev;
67215 u32 x, prev = 0; /* Next and previous entry on the min-heap */
67405 prev = contentOffset - 1; /* Implied first min-heap entry */
67407 if( (prev&0xffff)>=(x>>16) ){
67412 nFrag += (x>>16) - (prev&0xffff) - 1;
67413 prev = x;
67416 nFrag += usableSize - (prev&0xffff) - 1;
141431 Fts3HashElem *next, *prev; /* Next and previous elements in the table */
149745 pNew->prev = pHead->prev;
149746 if( pHead->prev ){ pHead->prev->next = pNew; }
149748 pHead->prev = pNew;
149751 if( pH->first ){ pH->first->prev = pNew; }
149752 pNew->prev = 0;
149824 if( elem->prev ){
149825 elem->prev->next = elem->next;
149830 elem->next->prev = elem->prev;
156354 Blob prev = {0, 0, 0}; /* Previous term written to new node */
156375 pNew, &prev, reader.term.a, reader.term.n,
156387 sqlite3_free(prev.a);