Lines Matching defs:pFree
10413 LookasideSlot *pFree; /* List of available buffers */
14218 void *pFree; /* Free this when deleting the vdbe */
20243 pBuf->pNext = db->lookaside.pFree;
20244 db->lookaside.pFree = pBuf;
20373 }else if( (pBuf = db->lookaside.pFree)==0 ){
20376 db->lookaside.pFree = pBuf->pNext;
38686 ** The nFreeSlot and pFree values do require mutex protection.
38695 PgFreeslot *pFree; /* Free page blocks */
38737 pcache1.pFree = 0;
38741 p->pNext = pcache1.pFree;
38742 pcache1.pFree = p;
38764 p = (PgHdr1 *)pcache1.pFree;
38766 pcache1.pFree = pcache1.pFree->pNext;
38803 pSlot->pNext = pcache1.pFree;
38804 pcache1.pFree = pSlot;
52221 char *pFree = 0;
52226 pCur->pKeyInfo, aSpace, sizeof(aSpace), &pFree
52231 sqlite3DbFree(pCur->pKeyInfo->db, pFree);
52238 if( pFree ){
52239 sqlite3DbFree(pCur->pKeyInfo->db, pFree);
58364 u8 *pFree = 0;
58443 if( pFree ){
58444 /* If pFree is not NULL, it points to the pSpace buffer used
58448 sqlite3PageFree(pFree);
58454 pFree = pSpace;
58466 if( pFree ){
58467 sqlite3PageFree(pFree);
63914 p->pFree = sqlite3DbMallocZero(db, nByte);
63916 zCsr = p->pFree;
64899 sqlite3DbFree(db, p->pFree);
71802 char *pFree;
71821 pFree = 0; /* Not needed. Only used to suppress a compiler warning. */
71836 pC->pKeyInfo, aTempRec, sizeof(aTempRec), &pFree
71857 sqlite3DbFree(db, pFree);
76023 SorterRecord *pFree = pSorter->pRecord;
76024 pSorter->pRecord = pFree->pNext;
76025 pFree->pNext = 0;
76026 vdbeSorterRecordFree(db, pFree);
122730 db->lookaside.pFree = 0;
122738 p->pNext = db->lookaside.pFree;
122739 db->lookaside.pFree = p;
125456 /* sqlite3_test_control(SQLITE_TESTCTRL_SCRATCHMALLOC, sz, &pNew, pFree);
125458 ** Pass pFree into sqlite3ScratchFree().
125462 void *pFree, **ppNew;
125466 pFree = va_arg(ap, void*);
125468 sqlite3ScratchFree(pFree);
133975 Fts3Expr *pFree = 0; /* List of free nodes. Linked by pParent. */
134021 assert( pFree );
134022 pFree->pLeft = apLeaf[iLvl];
134023 pFree->pRight = p;
134024 pFree->pLeft->pParent = pFree;
134025 pFree->pRight->pParent = pFree;
134027 p = pFree;
134028 pFree = pFree->pParent;
134057 pParent->pParent = pFree;
134058 pFree = pParent;
134069 assert( pFree!=0 );
134070 pFree->pRight = p;
134071 pFree->pLeft = apLeaf[i];
134072 pFree->pLeft->pParent = pFree;
134073 pFree->pRight->pParent = pFree;
134075 p = pFree;
134076 pFree = pFree->pParent;
134084 ** and pFree list. Everything else is cleaned up by the call to
134090 while( (pDel=pFree)!=0 ){
134091 pFree = pDel->pParent;
134096 assert( pFree==0 );
