contrib/sqlite3/sqlite3.c

21368   Vdbe *pPrev,*pNext;     /* Linked list of VDBEs with the same Vdbe.db */
24189   struct MemBlockHdr *pNext, *pPrev;  /* Linked list of all unfreed memory */
24393     pHdr->pPrev = mem.pLast;
24443   if( pHdr->pPrev ){
24444     assert( pHdr->pPrev->pNext==pHdr );
24445     pHdr->pPrev->pNext = pHdr->pNext;
24451     assert( pHdr->pNext->pPrev==pHdr );
24452     pHdr->pNext->pPrev = pHdr->pPrev;
24455     mem.pLast = pHdr->pPrev;
35033   unixInodeInfo *pPrev;           /*    .... doubly linked */
35196       if( pInode->pPrev ){
35197         assert( pInode->pPrev->pNext==pInode );
35198         pInode->pPrev->pNext = pInode->pNext;
35204         assert( pInode->pNext->pPrev==pInode );
35205         pInode->pNext->pPrev = pInode->pPrev;
35301     pInode->pPrev = 0;
35302     if( inodeList ) inodeList->pPrev = pInode;
64285   Btree *pPrev;      /* Back pointer of the same list */
64718   ** connected by pNext and pPrev should be in sorted order by
64722   assert( p->pPrev==0 || p->pPrev->pBt<p->pBt );
64724   assert( p->pPrev==0 || p->pPrev->db==p->db );
64725   assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
67554         while( pSib->pPrev ){ pSib = pSib->pPrev; }
67557           p->pPrev = 0;
67558           pSib->pPrev = p;
67564           p->pPrev = pSib;
67566             p->pNext->pPrev = p;
67745   if( p->pPrev ) p->pPrev->pNext = p->pNext;
67746   if( p->pNext ) p->pNext->pPrev = p->pPrev;
69491       BtCursor *pPrev = pBt->pCursor;
69493         if( pPrev->pNext==pCur ){
69494           pPrev->pNext = pCur->pNext;
69497         pPrev = pPrev->pNext;
69498       }while( ALWAYS(pPrev) );
78410     db->pVdbe->pPrev = p;
78413   p->pPrev = 0;
78507   pTmp = pA->pPrev;
78508   pA->pPrev = pB->pPrev;
78509   pB->pPrev = pTmp;
81858   if( p->pPrev ){
81859     p->pPrev->pNext = p->pNext;
81865     p->pNext->pPrev = p->pPrev;
177234 ** expression tree being parsed. pPrev is the expression node most recently
177242   Fts3Expr *pPrev,         /* Node most recently inserted into the tree */
177245   Fts3Expr *pSplit = pPrev;
177278   Fts3Expr *pPrev = 0;
177313           p = pPrev;
177332             assert( pRet && pPrev );
177340             insertBinaryOperator(&pRet, pPrev, pAnd);
177341             pPrev = pAnd;
177353           if( pPrev && (
177354             (eType==FTSQUERY_NEAR && !isPhrase && pPrev->eType!=FTSQUERY_PHRASE)
177355          || (eType!=FTSQUERY_PHRASE && isPhrase && pPrev->eType==FTSQUERY_NEAR)
177364               assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
177365               pPrev->pRight = p;
177366               p->pParent = pPrev;
177371             insertBinaryOperator(&pRet, pPrev, p);
177375         pPrev = p;
184160 ** If the size of the value in blob pPrev is zero, then this is the first
184161 ** term written to the node. Otherwise, pPrev contains a copy of the
184166 ** enough to accommodate the new entry. The buffer associated with pPrev
184174   Blob *pPrev,                    /* Buffer containing previous term written */
184181   int bFirst = (pPrev->n==0);     /* True if this is the first term written */
184190   blobGrowBuffer(pPrev, nTerm, &rc);
184193   nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm);
184196   memcpy(pPrev->a, zTerm, nTerm);
184197   pPrev->n = nTerm;
196648       GeoSegment *pPrev = 0;
196658         if( pPrev ){
196659           if( pPrev->y!=pSeg->y ){
196665         pPrev = pSeg;
196667       pPrev = 0;
196672         if( pPrev ){
196673           if( pPrev->y>pSeg->y && pPrev->side!=pSeg->side ){
196676                     pPrev->side, pPrev->idx,
196679           }else if( pPrev->y!=pSeg->y ){
196685         pPrev = pSeg;
218549   Fts5ExprNode *pPrev;
218567       pPrev = pLeft->apChild[pLeft->nChild-1];
218569       pPrev = pLeft;
218571     assert( pPrev->eType==FTS5_STRING
218572         || pPrev->eType==FTS5_TERM
218573         || pPrev->eType==FTS5_EOF
218582     else if( pPrev->eType==FTS5_EOF ){
218585       if( pPrev==pLeft ){
218593       assert( ap[0]==pPrev->pNear->apPhrase[0] );
218597       sqlite3Fts5ParseNodeFree(pPrev);
225654   Fts5Buffer *pPrev,              /* Previous term */
225660   if( pPrev->n==0 ){
225661     fts5BufferSet(&rc, pPrev, n, (const u8*)z);
225663   if( rc==SQLITE_OK && (pPrev->n!=n || memcmp(pPrev->p, z, n)) ){
225665     const char *zTerm = (const char*)&pPrev->p[1];  /* term sans prefix-byte */
225666     int nTerm = pPrev->n-1;            /* Size of zTerm in bytes */
225667     int iIdx = (pPrev->p[0] - FTS5_MAIN_PREFIX);
225710     fts5BufferSet(&rc, pPrev, n, (const u8*)z);