18984   Vdbe *pPrev,*pNext;     /* Linked list of VDBEs with the same Vdbe.db */  member
21733   struct MemBlockHdr *pNext, *pPrev;  /* Linked list of all unfreed memory */  member
21937     pHdr->pPrev = mem.pLast;  in sqlite3MemMalloc()
21987   if( pHdr->pPrev ){  in sqlite3MemFree()
21988     assert( pHdr->pPrev->pNext==pHdr );  in sqlite3MemFree()
21989     pHdr->pPrev->pNext = pHdr->pNext;  in sqlite3MemFree()
21995     assert( pHdr->pNext->pPrev==pHdr );  in sqlite3MemFree()
21996     pHdr->pNext->pPrev = pHdr->pPrev;  in sqlite3MemFree()
21999     mem.pLast = pHdr->pPrev;  in sqlite3MemFree()
31858   unixInodeInfo *pPrev;           /*    .... doubly linked */
32001       if( pInode->pPrev ){
32002         assert( pInode->pPrev->pNext==pInode );
32003         pInode->pPrev->pNext = pInode->pNext;
32009         assert( pInode->pNext->pPrev==pInode );
32010         pInode->pNext->pPrev = pInode->pPrev;
32099     pInode->pPrev = 0;
32100     if( inodeList ) inodeList->pPrev = pInode;
59758   Btree *pPrev;      /* Back pointer of the same list */
60169   assert( p->pPrev==0 || p->pPrev->pBt<p->pBt );
60171   assert( p->pPrev==0 || p->pPrev->db==p->db );
60172   assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
62894         while( pSib->pPrev ){ pSib = pSib->pPrev; }
62897           p->pPrev = 0;
62898           pSib->pPrev = p;
62904           p->pPrev = pSib;
62906             p->pNext->pPrev = p;
63081   if( p->pPrev ) p->pPrev->pNext = p->pNext;
63082   if( p->pNext ) p->pNext->pPrev = p->pPrev;
64767       BtCursor *pPrev = pBt->pCursor;
64769         if( pPrev->pNext==pCur ){
64770           pPrev->pNext = pCur->pNext;
64773         pPrev = pPrev->pNext;
64774       }while( ALWAYS(pPrev) );
72989     db->pVdbe->pPrev = p;
72992   p->pPrev = 0;
73042   pTmp = pA->pPrev;
73043   pA->pPrev = pB->pPrev;
73044   pB->pPrev = pTmp;
76025   if( p->pPrev ){
76026     p->pPrev->pNext = p->pNext;
76032     p->pNext->pPrev = p->pPrev;
155895   Fts3Expr *pPrev,         /* Node most recently inserted into the tree */
155898   Fts3Expr *pSplit = pPrev;
155931   Fts3Expr *pPrev = 0;
155966           p = pPrev;
155985             assert( pRet && pPrev );
155993             insertBinaryOperator(&pRet, pPrev, pAnd);
155994             pPrev = pAnd;
156006           if( pPrev && (
156007             (eType==FTSQUERY_NEAR && !isPhrase && pPrev->eType!=FTSQUERY_PHRASE)
156008          || (eType!=FTSQUERY_PHRASE && isPhrase && pPrev->eType==FTSQUERY_NEAR)
156017               assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
156018               pPrev->pRight = p;
156019               p->pParent = pPrev;
156024             insertBinaryOperator(&pRet, pPrev, p);
156028         pPrev = p;
162789   Blob *pPrev,                    /* Buffer containing previous term written */
162796   int bFirst = (pPrev->n==0);     /* True if this is the first term written */
162805   blobGrowBuffer(pPrev, nTerm, &rc);
162808   nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm);
162810   memcpy(pPrev->a, zTerm, nTerm);
162811   pPrev->n = nTerm;
193045   Fts5ExprNode *pPrev;
193063       pPrev = pLeft->apChild[pLeft->nChild-1];
193065       pPrev = pLeft;
193067     assert( pPrev->eType==FTS5_STRING 
193068         || pPrev->eType==FTS5_TERM 
193069         || pPrev->eType==FTS5_EOF 
193078     else if( pPrev->eType==FTS5_EOF ){
193081       if( pPrev==pLeft ){
193089       assert( ap[0]==pPrev->pNear->apPhrase[0] );
193093       sqlite3Fts5ParseNodeFree(pPrev);
199934   Fts5Buffer *pPrev,              /* Previous term */
199940   if( pPrev->n==0 ){
199941     fts5BufferSet(&rc, pPrev, n, (const u8*)z);
199943   if( rc==SQLITE_OK && (pPrev->n!=n || memcmp(pPrev->p, z, n)) ){
199945     const char *zTerm = (const char*)&pPrev->p[1];  /* term sans prefix-byte */
199946     int nTerm = pPrev->n-1;            /* Size of zTerm in bytes */
199947     int iIdx = (pPrev->p[0] - FTS5_MAIN_PREFIX);
199984     fts5BufferSet(&rc, pPrev, n, (const u8*)z);