contrib/sqlite3/sqlite3.c

16215   Vdbe *pPrev,*pNext;     /* Linked list of VDBEs with the same Vdbe.db */
18810   struct MemBlockHdr *pNext, *pPrev;  /* Linked list of all unfreed memory */
19014     pHdr->pPrev = mem.pLast;
19064   if( pHdr->pPrev ){
19065     assert( pHdr->pPrev->pNext==pHdr );
19066     pHdr->pPrev->pNext = pHdr->pNext;
19072     assert( pHdr->pNext->pPrev==pHdr );
19073     pHdr->pNext->pPrev = pHdr->pPrev;
19076     mem.pLast = pHdr->pPrev;
28596   unixInodeInfo *pPrev;           /*    .... doubly linked */
28737       if( pInode->pPrev ){
28738         assert( pInode->pPrev->pNext==pInode );
28739         pInode->pPrev->pNext = pInode->pNext;
28745         assert( pInode->pNext->pPrev==pInode );
28746         pInode->pNext->pPrev = pInode->pPrev;
28833     pInode->pPrev = 0;
28834     if( inodeList ) inodeList->pPrev = pInode;
55168   Btree *pPrev;      /* Back pointer of the same list */
55574   ** connected by pNext and pPrev should be in sorted order by
55578   assert( p->pPrev==0 || p->pPrev->pBt<p->pBt );
55580   assert( p->pPrev==0 || p->pPrev->db==p->db );
55581   assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
58163         while( pSib->pPrev ){ pSib = pSib->pPrev; }
58166           p->pPrev = 0;
58167           pSib->pPrev = p;
58173           p->pPrev = pSib;
58175             p->pNext->pPrev = p;
58342   if( p->pPrev ) p->pPrev->pNext = p->pNext;
58343   if( p->pNext ) p->pNext->pPrev = p->pPrev;
60005       BtCursor *pPrev = pBt->pCursor;
60007         if( pPrev->pNext==pCur ){
60008           pPrev->pNext = pCur->pNext;
60011         pPrev = pPrev->pNext;
60012       }while( ALWAYS(pPrev) );
68054     db->pVdbe->pPrev = p;
68057   p->pPrev = 0;
68113   pTmp = pA->pPrev;
68114   pA->pPrev = pB->pPrev;
68115   pB->pPrev = pTmp;
70987   if( p->pPrev ){
70988     p->pPrev->pNext = p->pNext;
70994     p->pNext->pPrev = p->pPrev;
145488 ** expression tree being parsed. pPrev is the expression node most recently
145496   Fts3Expr *pPrev,         /* Node most recently inserted into the tree */
145499   Fts3Expr *pSplit = pPrev;
145532   Fts3Expr *pPrev = 0;
145567           p = pPrev;
145586             assert( pRet && pPrev );
145594             insertBinaryOperator(&pRet, pPrev, pAnd);
145595             pPrev = pAnd;
145607           if( pPrev && (
145608             (eType==FTSQUERY_NEAR && !isPhrase && pPrev->eType!=FTSQUERY_PHRASE)
145609          || (eType!=FTSQUERY_PHRASE && isPhrase && pPrev->eType==FTSQUERY_NEAR)
145618               assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
145619               pPrev->pRight = p;
145620               p->pParent = pPrev;
145625             insertBinaryOperator(&pRet, pPrev, p);
145629         pPrev = p;
152362 ** If the size of the value in blob pPrev is zero, then this is the first
152363 ** term written to the node. Otherwise, pPrev contains a copy of the
152368 ** enough to accommodate the new entry. The buffer associated with pPrev
152376   Blob *pPrev,                    /* Buffer containing previous term written */
152383   int bFirst = (pPrev->n==0);     /* True if this is the first term written */
152392   blobGrowBuffer(pPrev, nTerm, &rc);
152395   nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm);
152397   memcpy(pPrev->a, zTerm, nTerm);
152398   pPrev->n = nTerm;
175161   Fts5ExprNode *pPrev;
175179       pPrev = pLeft->apChild[pLeft->nChild-1];
175181       pPrev = pLeft;
175183     assert( pPrev->eType==FTS5_STRING
175184         || pPrev->eType==FTS5_TERM
175185         || pPrev->eType==FTS5_EOF
175194     else if( pPrev->eType==FTS5_EOF ){
175197       if( pPrev==pLeft ){
175205       assert( ap[0]==pPrev->pNear->apPhrase[0] );
175209       sqlite3Fts5ParseNodeFree(pPrev);
182009   Fts5Buffer *pPrev,              /* Previous term */
182015   if( pPrev->n==0 ){
182016     fts5BufferSet(&rc, pPrev, n, (const u8*)z);
182018   if( rc==SQLITE_OK && (pPrev->n!=n || memcmp(pPrev->p, z, n)) ){
182020     const char *zTerm = (const char*)&pPrev->p[1];  /* term sans prefix-byte */
182021     int nTerm = pPrev->n-1;            /* Size of zTerm in bytes */
182022     int iIdx = (pPrev->p[0] - FTS5_MAIN_PREFIX);
182059     fts5BufferSet(&rc, pPrev, n, (const u8*)z);