| /sqlite-3.40.0/ext/fts3/ |
| H A D | fts3_expr.c | 586 Fts3Expr *pSplit = pPrev; in insertBinaryOperator()
619 Fts3Expr *pPrev = 0; in fts3ExprParse() local
654 p = pPrev; in fts3ExprParse()
673 assert( pRet && pPrev ); in fts3ExprParse()
682 pPrev = pAnd; in fts3ExprParse()
694 if( pPrev && ( in fts3ExprParse()
705 assert( pPrev && pPrev->pLeft && pPrev->pRight==0 ); in fts3ExprParse()
706 pPrev->pRight = p; in fts3ExprParse()
707 p->pParent = pPrev; in fts3ExprParse()
712 insertBinaryOperator(&pRet, pPrev, p); in fts3ExprParse()
[all …]
|
| H A D | fts3_test.c | 94 NearPhrase *pPrev; in nm_near_chain() local
105 pPrev = &aPhrase[iPhrase]; in nm_near_chain()
110 iStop = iPos + nNear + pPrev->nToken; in nm_near_chain()
|
| H A D | fts3_write.c | 3961 Blob *pPrev, /* Buffer containing previous term written */ in fts3AppendToNode() argument
3968 int bFirst = (pPrev->n==0); /* True if this is the first term written */ in fts3AppendToNode()
3977 blobGrowBuffer(pPrev, nTerm, &rc); in fts3AppendToNode()
3980 nPrefix = fts3PrefixCompress(pPrev->a, pPrev->n, zTerm, nTerm); in fts3AppendToNode()
3983 memcpy(pPrev->a, zTerm, nTerm); in fts3AppendToNode()
3984 pPrev->n = nTerm; in fts3AppendToNode()
|
| /sqlite-3.40.0/src/ |
| H A D | mem2.c | 57 struct MemBlockHdr *pNext, *pPrev; /* Linked list of all unfreed memory */ member
261 pHdr->pPrev = mem.pLast; in sqlite3MemMalloc()
311 if( pHdr->pPrev ){ in sqlite3MemFree()
312 assert( pHdr->pPrev->pNext==pHdr ); in sqlite3MemFree()
313 pHdr->pPrev->pNext = pHdr->pNext; in sqlite3MemFree()
319 assert( pHdr->pNext->pPrev==pHdr ); in sqlite3MemFree()
320 pHdr->pNext->pPrev = pHdr->pPrev; in sqlite3MemFree()
323 mem.pLast = pHdr->pPrev; in sqlite3MemFree()
|
| H A D | test_server.c | 231 SqlMessage *pPrev; /* Previous message in the queue */ member
285 g.pQueueHead->pPrev = pMsg; in sendToServer()
287 pMsg->pPrev = 0; in sendToServer()
409 if( pMsg->pPrev ){ in sqlite3_server()
410 pMsg->pPrev->pNext = 0; in sqlite3_server()
414 g.pQueueTail = pMsg->pPrev; in sqlite3_server()
|
| H A D | btmutex.c | 77 assert( p->pPrev==0 || p->pPrev->pBt<p->pBt ); in sqlite3BtreeEnter()
79 assert( p->pPrev==0 || p->pPrev->db==p->db ); in sqlite3BtreeEnter()
80 assert( p->sharable || (p->pNext==0 && p->pPrev==0) ); in sqlite3BtreeEnter()
|
| H A D | tclsqlite.c | 243 p->pNext->pPrev = p->pPrev; in incrblobClose()
245 if( p->pPrev ){ in incrblobClose()
246 p->pPrev->pNext = p->pNext; in incrblobClose()
426 p->pPrev = 0; in createIncrblobChannel()
428 p->pNext->pPrev = p; in createIncrblobChannel()
1353 if( pPreStmt->pPrev ){ in dbPrepareAndBind()
1359 pPreStmt->pNext->pPrev = pPreStmt->pPrev; in dbPrepareAndBind()
1361 pDb->stmtLast = pPreStmt->pPrev; in dbPrepareAndBind()
1511 pPreStmt->pPrev = 0; in dbReleaseStmt()
1513 pDb->stmtList->pPrev = pPreStmt; in dbReleaseStmt()
[all …]
|
| H A D | insert.c | 183 VdbeOp *pPrev; in sqlite3TableAffinity() local
185 pPrev = sqlite3VdbeGetLastOp(v); in sqlite3TableAffinity()
186 assert( pPrev!=0 ); in sqlite3TableAffinity()
187 assert( pPrev->opcode==OP_MakeRecord || sqlite3VdbeDb(v)->mallocFailed ); in sqlite3TableAffinity()
188 pPrev->opcode = OP_TypeCheck; in sqlite3TableAffinity()
189 sqlite3VdbeAddOp3(v, OP_MakeRecord, pPrev->p1, pPrev->p2, pPrev->p3); in sqlite3TableAffinity()
|
| H A D | btreeInt.h | 356 Btree *pPrev; /* Back pointer of the same list */ member
|
| H A D | os_unix.c | 1172 unixInodeInfo *pPrev; /* .... doubly linked */ member
1335 if( pInode->pPrev ){ in releaseInodeInfo()
1336 assert( pInode->pPrev->pNext==pInode ); in releaseInodeInfo()
1337 pInode->pPrev->pNext = pInode->pNext; in releaseInodeInfo()
1343 assert( pInode->pNext->pPrev==pInode ); in releaseInodeInfo()
1344 pInode->pNext->pPrev = pInode->pPrev; in releaseInodeInfo()
1440 pInode->pPrev = 0; in findInodeInfo()
1441 if( inodeList ) inodeList->pPrev = pInode; in findInodeInfo()
|
| H A D | btree.c | 2667 while( pSib->pPrev ){ pSib = pSib->pPrev; } in sqlite3BtreeOpen()
2670 p->pPrev = 0; in sqlite3BtreeOpen()
2671 pSib->pPrev = p; in sqlite3BtreeOpen()
2677 p->pPrev = pSib; in sqlite3BtreeOpen()
2679 p->pNext->pPrev = p; in sqlite3BtreeOpen()
2866 if( p->pPrev ) p->pPrev->pNext = p->pNext; in sqlite3BtreeClose()
2867 if( p->pNext ) p->pNext->pPrev = p->pPrev; in sqlite3BtreeClose()
4652 BtCursor *pPrev = pBt->pCursor; in sqlite3BtreeCloseCursor() local
4654 if( pPrev->pNext==pCur ){ in sqlite3BtreeCloseCursor()
4658 pPrev = pPrev->pNext; in sqlite3BtreeCloseCursor()
[all …]
|
| /sqlite-3.40.0/ext/lsm1/lsm-test/ |
| H A D | lsmtest_mem.c | 67 TmBlockHdr *pPrev; member
135 pTm->pFirst->pPrev = pNew; in tmMalloc()
190 if( pHdr->pPrev ){ in tmFree()
191 assert( pHdr->pPrev->pNext==pHdr ); in tmFree()
192 pHdr->pPrev->pNext = pHdr->pNext; in tmFree()
198 assert( pHdr->pNext->pPrev==pHdr ); in tmFree()
199 pHdr->pNext->pPrev = pHdr->pPrev; in tmFree()
|
| /sqlite-3.40.0/ext/rtree/ |
| H A D | geopoly.c | 1084 GeoSegment *pPrev = 0; in geopolyOverlap() local
1094 if( pPrev ){ in geopolyOverlap()
1095 if( pPrev->y!=pSeg->y ){ in geopolyOverlap()
1101 pPrev = pSeg; in geopolyOverlap()
1103 pPrev = 0; in geopolyOverlap()
1108 if( pPrev ){ in geopolyOverlap()
1109 if( pPrev->y>pSeg->y && pPrev->side!=pSeg->side ){ in geopolyOverlap()
1112 pPrev->side, pPrev->idx, in geopolyOverlap()
1115 }else if( pPrev->y!=pSeg->y ){ in geopolyOverlap()
1121 pPrev = pSeg; in geopolyOverlap()
|
| /sqlite-3.40.0/ext/misc/ |
| H A D | closure.c | 288 closure_avl *pPrev = 0; in closureAvlNext() local
289 while( p && p->pAfter==pPrev ){ in closureAvlNext()
290 pPrev = p; in closureAvlNext()
293 if( p && pPrev==0 ){ in closureAvlNext()
|
| H A D | amatch.c | 307 amatch_avl *pPrev = 0;
308 while( p && p->pAfter==pPrev ){
309 pPrev = p;
312 if( p && pPrev==0 ){
|
| /sqlite-3.40.0/ext/fts5/ |
| H A D | fts5_expr.c | 2358 Fts5ExprNode *pPrev; in sqlite3Fts5ParseImplicitAnd() local
2376 pPrev = pLeft->apChild[pLeft->nChild-1]; in sqlite3Fts5ParseImplicitAnd()
2378 pPrev = pLeft; in sqlite3Fts5ParseImplicitAnd()
2380 assert( pPrev->eType==FTS5_STRING in sqlite3Fts5ParseImplicitAnd()
2381 || pPrev->eType==FTS5_TERM in sqlite3Fts5ParseImplicitAnd()
2382 || pPrev->eType==FTS5_EOF in sqlite3Fts5ParseImplicitAnd()
2391 else if( pPrev->eType==FTS5_EOF ){ in sqlite3Fts5ParseImplicitAnd()
2394 if( pPrev==pLeft ){ in sqlite3Fts5ParseImplicitAnd()
2402 assert( ap[0]==pPrev->pNear->apPhrase[0] ); in sqlite3Fts5ParseImplicitAnd()
2406 sqlite3Fts5ParseNodeFree(pPrev); in sqlite3Fts5ParseImplicitAnd()
|
| H A D | fts5_index.c | 5931 Fts5Buffer *pPrev, /* Previous term */ in fts5TestTerm() argument
5937 if( pPrev->n==0 ){ in fts5TestTerm()
5938 fts5BufferSet(&rc, pPrev, n, (const u8*)z); in fts5TestTerm()
5940 if( rc==SQLITE_OK && (pPrev->n!=n || memcmp(pPrev->p, z, n)) ){ in fts5TestTerm()
5942 const char *zTerm = (const char*)&pPrev->p[1]; /* term sans prefix-byte */ in fts5TestTerm()
5943 int nTerm = pPrev->n-1; /* Size of zTerm in bytes */ in fts5TestTerm()
5944 int iIdx = (pPrev->p[0] - FTS5_MAIN_PREFIX); in fts5TestTerm()
5987 fts5BufferSet(&rc, pPrev, n, (const u8*)z); in fts5TestTerm()
|