lib/sqlite/sqlite3.c

12834   Vdbe *pPrev,*pNext;     /* Linked list of VDBEs with the same Vdbe.db */
15026   struct MemBlockHdr *pNext, *pPrev;  /* Linked list of all unfreed memory */
15230     pHdr->pPrev = mem.pLast;
15280   if( pHdr->pPrev ){
15281     assert( pHdr->pPrev->pNext==pHdr );
15282     pHdr->pPrev->pNext = pHdr->pNext;
15288     assert( pHdr->pNext->pPrev==pHdr );
15289     pHdr->pNext->pPrev = pHdr->pPrev;
15292     mem.pLast = pHdr->pPrev;
25547   unixInodeInfo *pPrev;           /*    .... doubly linked */
25681       if( pInode->pPrev ){
25682         assert( pInode->pPrev->pNext==pInode );
25683         pInode->pPrev->pNext = pInode->pNext;
25689         assert( pInode->pNext->pPrev==pInode );
25690         pInode->pNext->pPrev = pInode->pPrev;
25777     pInode->pPrev = 0;
25778     if( inodeList ) inodeList->pPrev = pInode;
35883   PGroupBlock *pPrev;            /* Previous PGroupBlock in list */
36135   pBlock->pPrev = 0;
36139     pBlock->pNext->pPrev = pBlock;
36248     assert( pBlock->pPrev==0 );
36251     pList->pFirst->pPrev = 0;
36252     pBlock->pPrev = pList->pLast;
36307       if( pList->pFirst ) pList->pFirst->pPrev = 0;
36309       pBlock->pPrev->pNext = pBlock->pNext;
36312       pList->pLast = pBlock->pPrev;
36315       pBlock->pNext->pPrev = pBlock->pPrev;
47693   Btree *pPrev;      /* Back pointer of the same list */
47829   BtCursor *pNext, *pPrev;  /* Forms a linked list of all cursors */
48042   ** connected by pNext and pPrev should be in sorted order by
48046   assert( p->pPrev==0 || p->pPrev->pBt<p->pBt );
48048   assert( p->pPrev==0 || p->pPrev->db==p->db );
48049   assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
50173         while( pSib->pPrev ){ pSib = pSib->pPrev; }
50176           p->pPrev = 0;
50177           pSib->pPrev = p;
50183           p->pPrev = pSib;
50185             p->pNext->pPrev = p;
50328   if( p->pPrev ) p->pPrev->pNext = p->pNext;
50329   if( p->pNext ) p->pNext->pPrev = p->pPrev;
51748     pCur->pNext->pPrev = pCur;
51834     if( pCur->pPrev ){
51835       pCur->pPrev->pNext = pCur->pNext;
51840       pCur->pNext->pPrev = pCur->pPrev;
58346     db->pVdbe->pPrev = p;
58349   p->pPrev = 0;
58389   pTmp = pA->pPrev;
58390   pA->pPrev = pB->pPrev;
58391   pB->pPrev = pTmp;
60767   if( p->pPrev ){
60768     p->pPrev->pNext = p->pNext;
60774     p->pNext->pPrev = p->pPrev;
120067 ** expression tree being parsed. pPrev is the expression node most recently
120075   Fts3Expr *pPrev,         /* Node most recently inserted into the tree */
120078   Fts3Expr *pSplit = pPrev;
120111   Fts3Expr *pPrev = 0;
120141         p = pPrev;
120160           assert( pRet && pPrev );
120168           insertBinaryOperator(&pRet, pPrev, pAnd);
120169           pPrev = pAnd;
120181         if( pPrev && (
120182             (eType==FTSQUERY_NEAR && !isPhrase && pPrev->eType!=FTSQUERY_PHRASE)
120183          || (eType!=FTSQUERY_PHRASE && isPhrase && pPrev->eType==FTSQUERY_NEAR)
120192             assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
120193             pPrev->pRight = p;
120194             p->pParent = pPrev;
120199           insertBinaryOperator(&pRet, pPrev, p);
120208     pPrev = p;