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;
38706 ** The nFreeSlot and pFree values do require mutex protection.
38715 PgFreeslot *pFree; /* Free page blocks */
38757 pcache1.pFree = 0;
38761 p->pNext = pcache1.pFree;
38762 pcache1.pFree = p;
38784 p = (PgHdr1 *)pcache1.pFree;
38786 pcache1.pFree = pcache1.pFree->pNext;
38823 pSlot->pNext = pcache1.pFree;
38824 pcache1.pFree = pSlot;
52241 char *pFree = 0;
52246 pCur->pKeyInfo, aSpace, sizeof(aSpace), &pFree
52251 sqlite3DbFree(pCur->pKeyInfo->db, pFree);
52258 if( pFree ){
52259 sqlite3DbFree(pCur->pKeyInfo->db, pFree);
58384 u8 *pFree = 0;
58463 if( pFree ){
58464 /* If pFree is not NULL, it points to the pSpace buffer used
58468 sqlite3PageFree(pFree);
58474 pFree = pSpace;
58486 if( pFree ){
58487 sqlite3PageFree(pFree);
63934 p->pFree = sqlite3DbMallocZero(db, nByte);
63936 zCsr = p->pFree;
64919 sqlite3DbFree(db, p->pFree);
71822 char *pFree;
71841 pFree = 0; /* Not needed. Only used to suppress a compiler warning. */
71856 pC->pKeyInfo, aTempRec, sizeof(aTempRec), &pFree
71877 sqlite3DbFree(db, pFree);
76043 SorterRecord *pFree = pSorter->pRecord;
76044 pSorter->pRecord = pFree->pNext;
76045 pFree->pNext = 0;
76046 vdbeSorterRecordFree(db, pFree);
122750 db->lookaside.pFree = 0;
122758 p->pNext = db->lookaside.pFree;
122759 db->lookaside.pFree = p;
125476 /* sqlite3_test_control(SQLITE_TESTCTRL_SCRATCHMALLOC, sz, &pNew, pFree);
125478 ** Pass pFree into sqlite3ScratchFree().
125482 void *pFree, **ppNew;
125486 pFree = va_arg(ap, void*);
125488 sqlite3ScratchFree(pFree);
134007 Fts3Expr *pFree = 0; /* List of free nodes. Linked by pParent. */
134053 assert( pFree );
134054 pFree->pLeft = apLeaf[iLvl];
134055 pFree->pRight = p;
134056 pFree->pLeft->pParent = pFree;
134057 pFree->pRight->pParent = pFree;
134059 p = pFree;
134060 pFree = pFree->pParent;
134089 pParent->pParent = pFree;
134090 pFree = pParent;
134101 assert( pFree!=0 );
134102 pFree->pRight = p;
134103 pFree->pLeft = apLeaf[i];
134104 pFree->pLeft->pParent = pFree;
134105 pFree->pRight->pParent = pFree;
134107 p = pFree;
134108 pFree = pFree->pParent;
134116 ** and pFree list. Everything else is cleaned up by the call to
134122 while( (pDel=pFree)!=0 ){
134123 pFree = pDel->pParent;
134128 assert( pFree==0 );
