Lines Matching defs: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;
25345 unixInodeInfo *pPrev; /* .... doubly linked */
25478 if( pInode->pPrev ){
25479 assert( pInode->pPrev->pNext==pInode );
25480 pInode->pPrev->pNext = pInode->pNext;
25486 assert( pInode->pNext->pPrev==pInode );
25487 pInode->pNext->pPrev = pInode->pPrev;
25574 pInode->pPrev = 0;
25575 if( inodeList ) inodeList->pPrev = pInode;
50969 Btree *pPrev; /* Back pointer of the same list */
51112 BtCursor *pNext, *pPrev; /* Forms a linked list of all cursors */
51342 ** connected by pNext and pPrev should be in sorted order by
51346 assert( p->pPrev==0 || p->pPrev->pBt<p->pBt );
51348 assert( p->pPrev==0 || p->pPrev->db==p->db );
51349 assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
53530 while( pSib->pPrev ){ pSib = pSib->pPrev; }
53533 p->pPrev = 0;
53534 pSib->pPrev = p;
53540 p->pPrev = pSib;
53542 p->pNext->pPrev = p;
53697 if( p->pPrev ) p->pPrev->pNext = p->pNext;
53698 if( p->pNext ) p->pNext->pPrev = p->pPrev;
55199 pCur->pNext->pPrev = pCur;
55254 if( pCur->pPrev ){
55255 pCur->pPrev->pNext = pCur->pNext;
55260 pCur->pNext->pPrev = pCur->pPrev;
62264 db->pVdbe->pPrev = p;
62267 p->pPrev = 0;
62311 pTmp = pA->pPrev;
62312 pA->pPrev = pB->pPrev;
62313 pB->pPrev = pTmp;
64936 if( p->pPrev ){
64937 p->pPrev->pNext = p->pNext;
64943 p->pNext->pPrev = p->pPrev;
133792 ** expression tree being parsed. pPrev is the expression node most recently
133800 Fts3Expr *pPrev, /* Node most recently inserted into the tree */
133803 Fts3Expr *pSplit = pPrev;
133836 Fts3Expr *pPrev = 0;
133871 p = pPrev;
133890 assert( pRet && pPrev );
133898 insertBinaryOperator(&pRet, pPrev, pAnd);
133899 pPrev = pAnd;
133911 if( pPrev && (
133912 (eType==FTSQUERY_NEAR && !isPhrase && pPrev->eType!=FTSQUERY_PHRASE)
133913 || (eType!=FTSQUERY_PHRASE && isPhrase && pPrev->eType==FTSQUERY_NEAR)
133922 assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
133923 pPrev->pRight = p;
133924 p->pParent = pPrev;
133929 insertBinaryOperator(&pRet, pPrev, p);
133933 pPrev = p;
140590 ** If the size of the value in blob pPrev is zero, then this is the first
140591 ** term written to the node. Otherwise, pPrev contains a copy of the
140596 ** enough to accommodate the new entry. The buffer associated with pPrev
140604 Blob *pPrev, /* Buffer containing previous term written */
140611 int bFirst = (pPrev->n==0); /* True if this is the first term written */
140620 blobGrowBuffer(pPrev, nTerm, &rc);
140623 nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm);
140625 memcpy(pPrev->a, zTerm, nTerm);
140626 pPrev->n = nTerm;
