Lines Matching refs:pPrev
25816 struct MemBlockHdr *pNext, *pPrev; /* Linked list of all unfreed memory */
26020 pHdr->pPrev = mem.pLast;
26070 if( pHdr->pPrev ){
26071 assert( pHdr->pPrev->pNext==pHdr );
26072 pHdr->pPrev->pNext = pHdr->pNext;
26078 assert( pHdr->pNext->pPrev==pHdr );
26079 pHdr->pNext->pPrev = pHdr->pPrev;
26082 mem.pLast = pHdr->pPrev;
37990 unixInodeInfo *pPrev; /* .... doubly linked */
38153 if( pInode->pPrev ){
38154 assert( pInode->pPrev->pNext==pInode );
38155 pInode->pPrev->pNext = pInode->pNext;
38161 assert( pInode->pNext->pPrev==pInode );
38162 pInode->pNext->pPrev = pInode->pPrev;
38267 pInode->pPrev = 0;
38268 if( inodeList ) inodeList->pPrev = pInode;
67922 Btree *pPrev; /* Back pointer of the same list */
68355 ** connected by pNext and pPrev should be in sorted order by
68359 assert( p->pPrev==0 || p->pPrev->pBt<p->pBt );
68361 assert( p->pPrev==0 || p->pPrev->db==p->db );
68362 assert( p->sharable || (p->pNext==0 && p->pPrev==0) );
71307 while( pSib->pPrev ){ pSib = pSib->pPrev; }
71310 p->pPrev = 0;
71311 pSib->pPrev = p;
71317 p->pPrev = pSib;
71319 p->pNext->pPrev = p;
71506 if( p->pPrev ) p->pPrev->pNext = p->pNext;
71507 if( p->pNext ) p->pNext->pPrev = p->pPrev;
73292 BtCursor *pPrev = pBt->pCursor;
73294 if( pPrev->pNext==pCur ){
73295 pPrev->pNext = pCur->pNext;
73298 pPrev = pPrev->pNext;
73299 }while( ALWAYS(pPrev) );
128785 VdbeOp *pPrev;
128787 pPrev = sqlite3VdbeGetLastOp(v);
128788 assert( pPrev!=0 );
128789 assert( pPrev->opcode==OP_MakeRecord || sqlite3VdbeDb(v)->mallocFailed );
128790 pPrev->opcode = OP_TypeCheck;
128791 sqlite3VdbeAddOp3(v, OP_MakeRecord, pPrev->p1, pPrev->p2, pPrev->p3);
186894 ** expression tree being parsed. pPrev is the expression node most recently
186902 Fts3Expr *pPrev, /* Node most recently inserted into the tree */
186905 Fts3Expr *pSplit = pPrev;
186938 Fts3Expr *pPrev = 0;
186973 p = pPrev;
186992 assert( pRet && pPrev );
187000 insertBinaryOperator(&pRet, pPrev, pAnd);
187001 pPrev = pAnd;
187013 if( pPrev && (
187014 (eType==FTSQUERY_NEAR && !isPhrase && pPrev->eType!=FTSQUERY_PHRASE)
187015 || (eType!=FTSQUERY_PHRASE && isPhrase && pPrev->eType==FTSQUERY_NEAR)
187024 assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
187025 pPrev->pRight = p;
187026 p->pParent = pPrev;
187031 insertBinaryOperator(&pRet, pPrev, p);
187035 pPrev = p;
193834 ** If the size of the value in blob pPrev is zero, then this is the first
193835 ** term written to the node. Otherwise, pPrev contains a copy of the
193840 ** enough to accommodate the new entry. The buffer associated with pPrev
193848 Blob *pPrev, /* Buffer containing previous term written */
193855 int bFirst = (pPrev->n==0); /* True if this is the first term written */
193864 blobGrowBuffer(pPrev, nTerm, &rc);
193867 nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm);
193870 memcpy(pPrev->a, zTerm, nTerm);
193871 pPrev->n = nTerm;
206434 GeoSegment *pPrev = 0;
206444 if( pPrev ){
206445 if( pPrev->y!=pSeg->y ){
206451 pPrev = pSeg;
206453 pPrev = 0;
206458 if( pPrev ){
206459 if( pPrev->y>pSeg->y && pPrev->side!=pSeg->side ){
206462 pPrev->side, pPrev->idx,
206465 }else if( pPrev->y!=pSeg->y ){
206471 pPrev = pSeg;
228730 Fts5ExprNode *pPrev;
228748 pPrev = pLeft->apChild[pLeft->nChild-1];
228750 pPrev = pLeft;
228752 assert( pPrev->eType==FTS5_STRING
228753 || pPrev->eType==FTS5_TERM
228754 || pPrev->eType==FTS5_EOF
228763 else if( pPrev->eType==FTS5_EOF ){
228766 if( pPrev==pLeft ){
228774 assert( ap[0]==pPrev->pNear->apPhrase[0] );
228778 sqlite3Fts5ParseNodeFree(pPrev);
235936 Fts5Buffer *pPrev, /* Previous term */
235942 if( pPrev->n==0 ){
235943 fts5BufferSet(&rc, pPrev, n, (const u8*)z);
235945 if( rc==SQLITE_OK && (pPrev->n!=n || memcmp(pPrev->p, z, n)) ){
235947 const char *zTerm = (const char*)&pPrev->p[1]; /* term sans prefix-byte */
235948 int nTerm = pPrev->n-1; /* Size of zTerm in bytes */
235949 int iIdx = (pPrev->p[0] - FTS5_MAIN_PREFIX);
235992 fts5BufferSet(&rc, pPrev, n, (const u8*)z);