Cross Reference: /external/sqlite/dist/orig/sqlite3.c

Lines Matching refs:pPrev
14183   Vdbe *pPrev,*pNext;     /* Linked list of VDBEs with the same Vdbe.db */
16629   struct MemBlockHdr *pNext, *pPrev;  /* Linked list of all unfreed memory */
16833     pHdr->pPrev = mem.pLast;
16883   if( pHdr->pPrev ){
16884     assert( pHdr->pPrev->pNext==pHdr );
16885     pHdr->pPrev->pNext = pHdr->pNext;
16891     assert( pHdr->pNext->pPrev==pHdr );
16892     pHdr->pNext->pPrev = pHdr->pPrev;
16895     mem.pLast = pHdr->pPrev;
25327   unixInodeInfo *pPrev;           /*    .... doubly linked */
25460       if( pInode->pPrev ){
25461         assert( pInode->pPrev->pNext==pInode );
25462         pInode->pPrev->pNext = pInode->pNext;
25468         assert( pInode->pNext->pPrev==pInode );
25469         pInode->pNext->pPrev = pInode->pPrev;
25556     pInode->pPrev = 0;
25557     if( inodeList ) inodeList->pPrev = pInode;
50949   Btree *pPrev;      /* Back pointer of the same list */
51092   BtCursor *pNext, *pPrev;  /* Forms a linked list of all cursors */
51322   ** connected by pNext and pPrev should be in sorted order by
51326   assert( p->pPrev==0 || p->pPrev->pBt<p->pBt );
51328   assert( p->pPrev==0 || p->pPrev->db==p->db );
51329   assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
53510         while( pSib->pPrev ){ pSib = pSib->pPrev; }
53513           p->pPrev = 0;
53514           pSib->pPrev = p;
53520           p->pPrev = pSib;
53522             p->pNext->pPrev = p;
53677   if( p->pPrev ) p->pPrev->pNext = p->pNext;
53678   if( p->pNext ) p->pNext->pPrev = p->pPrev;
55179     pCur->pNext->pPrev = pCur;
55234     if( pCur->pPrev ){
55235       pCur->pPrev->pNext = pCur->pNext;
55240       pCur->pNext->pPrev = pCur->pPrev;
62244     db->pVdbe->pPrev = p;
62247   p->pPrev = 0;
62291   pTmp = pA->pPrev;
62292   pA->pPrev = pB->pPrev;
62293   pB->pPrev = pTmp;
64916   if( p->pPrev ){
64917     p->pPrev->pNext = p->pNext;
64923     p->pNext->pPrev = p->pPrev;
133760 ** expression tree being parsed. pPrev is the expression node most recently
133768   Fts3Expr *pPrev,         /* Node most recently inserted into the tree */
133771   Fts3Expr *pSplit = pPrev;
133804   Fts3Expr *pPrev = 0;
133839           p = pPrev;
133858             assert( pRet && pPrev );
133866             insertBinaryOperator(&pRet, pPrev, pAnd);
133867             pPrev = pAnd;
133879           if( pPrev && (
133880             (eType==FTSQUERY_NEAR && !isPhrase && pPrev->eType!=FTSQUERY_PHRASE)
133881          || (eType!=FTSQUERY_PHRASE && isPhrase && pPrev->eType==FTSQUERY_NEAR)
133890               assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
133891               pPrev->pRight = p;
133892               p->pParent = pPrev;
133897             insertBinaryOperator(&pRet, pPrev, p);
133901         pPrev = p;
140558 ** If the size of the value in blob pPrev is zero, then this is the first
140559 ** term written to the node. Otherwise, pPrev contains a copy of the 
140564 ** enough to accommodate the new entry. The buffer associated with pPrev
140572   Blob *pPrev,                    /* Buffer containing previous term written */
140579   int bFirst = (pPrev->n==0);     /* True if this is the first term written */
140588   blobGrowBuffer(pPrev, nTerm, &rc);
140591   nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm);
140593   memcpy(pPrev->a, zTerm, nTerm);
140594   pPrev->n = nTerm;