Lines Matching defs:pOld
26726 static void memsys3FreeUnsafe(void *pOld){
26727 Mem3Block *p = (Mem3Block*)pOld;
27270 static void memsys5FreeUnsafe(void *pOld){
27274 /* Set iBlock to the index of the block pointed to by pOld in
27277 iBlock = (int)(((u8 *)pOld-mem5.zPool)/mem5.szAtom);
27279 /* Check that the pointer pOld points to a valid, non-free block. */
27281 assert( ((u8 *)pOld-mem5.zPool)%mem5.szAtom==0 );
29546 SQLITE_PRIVATE void *sqlite3Realloc(void *pOld, u64 nBytes){
29549 assert( sqlite3MemdebugHasType(pOld, MEMTYPE_HEAP) );
29550 assert( sqlite3MemdebugNoType(pOld, (u8)~MEMTYPE_HEAP) );
29551 if( pOld==0 ){
29555 sqlite3_free(pOld); /* IMP: R-26507-47431 */
29562 nOld = sqlite3MallocSize(pOld);
29568 pNew = pOld;
29582 pNew = sqlite3GlobalConfig.m.xRealloc(pOld, nNew);
29586 pNew = sqlite3GlobalConfig.m.xRealloc(pOld, nNew);
29595 pNew = sqlite3GlobalConfig.m.xRealloc(pOld, nNew);
29605 SQLITE_API void *sqlite3_realloc(void *pOld, int n){
29610 return sqlite3Realloc(pOld, n);
29612 SQLITE_API void *sqlite3_realloc64(void *pOld, sqlite3_uint64 n){
29616 return sqlite3Realloc(pOld, n);
76681 MemPage *pOld = apOld[i];
76682 int limit = pOld->nCell;
76683 u8 *aData = pOld->aData;
76684 u16 maskPage = pOld->maskPage;
76685 u8 *piCell = aData + pOld->cellOffset;
76692 if( pOld->aData[0]!=apOld[0]->aData[0] ){
76697 /* Load b.apCell[] with pointers to all cells in pOld. If pOld
76714 memset(&b.szCell[b.nCell], 0, sizeof(b.szCell[0])*(limit+pOld->nOverflow));
76715 if( pOld->nOverflow>0 ){
76716 if( NEVER(limit<pOld->aiOvfl[0]) ){
76720 limit = pOld->aiOvfl[0];
76726 for(k=0; k<pOld->nOverflow; k++){
76727 assert( k==0 || pOld->aiOvfl[k-1]+1==pOld->aiOvfl[k] );/* NOTE 1 */
76728 b.apCell[b.nCell] = pOld->apOvfl[k];
76732 piEnd = aData + pOld->cellOffset + 2*pOld->nCell;
76739 assert( (b.nCell-nCellAtStart)==(pOld->nCell+pOld->nOverflow) );
76755 if( !pOld->leaf ){
76757 assert( pOld->hdrOffset==0 || CORRUPT_DB );
76758 /* The right pointer of the child page pOld becomes the left
76760 memcpy(b.apCell[b.nCell], &pOld->aData[8], 4);
77012 MemPage *pOld = (nNew>nOld ? apNew : apOld)[nOld-1];
77013 memcpy(&apNew[nNew-1]->aData[8], &pOld->aData[8], 4);
77033 MemPage *pOld;
77034 MemPage *pNew = pOld = apNew[0];
77045 pOld = iOld<nNew ? apNew[iOld] : apOld[iOld];
77046 cntOldNext += pOld->nCell + pOld->nOverflow + !leafData;
77061 || !SQLITE_WITHIN(pCell,pOld->aData,pOld->aDataEnd)
77067 ptrmapPutOvflPtr(pNew, pOld, pCell, &rc);
88225 SQLITE_API void sqlite3_value_free(sqlite3_value *pOld){
88226 sqlite3ValueFree(pOld);
112915 ** cmd ::= ALTER TABLE pSrc RENAME COLUMN pOld TO pNew
112920 Token *pOld, /* Name of column being changed */
112954 zOld = sqlite3NameFromToken(db, pOld);
112960 sqlite3ErrorMsg(pParse, "no such column: \"%T\"", pOld);
114971 static void statAccumDestructor(void *pOld){
114972 StatAccum *p = (StatAccum*)pOld;
115106 ** pNew and pOld are both candidate non-periodic samples selected for
115107 ** the same column (pNew->iCol==pOld->iCol). Ignoring this column and
115109 ** function returns true if sample pNew is to be preferred over pOld.
115111 ** column for pNew and pOld are equal, is pNew to be preferred over pOld.
115119 StatSample *pOld
115123 assert( pNew->iCol==pOld->iCol );
115125 if( pNew->anEq[i]>pOld->anEq[i] ) return 1;
115126 if( pNew->anEq[i]<pOld->anEq[i] ) return 0;
115128 if( pNew->iHash>pOld->iHash ) return 1;
115135 ** Return true if pNew is to be preferred over pOld.
115143 StatSample *pOld
115146 tRowcnt nEqOld = pOld->anEq[pOld->iCol];
115148 assert( pOld->isPSample==0 && pNew->isPSample==0 );
115149 assert( IsStat4 || (pNew->iCol==0 && pOld->iCol==0) );
115153 if( pNew->iCol<pOld->iCol ) return 1;
115154 return (pNew->iCol==pOld->iCol && sampleIsBetterPost(pAccum, pNew, pOld));
115186 StatSample *pOld = &p->a[i];
115187 if( pOld->anEq[pNew->iCol]==0 ){
115188 if( pOld->isPSample ) return;
115189 assert( pOld->iCol>pNew->iCol );
115190 assert( sampleIsBetter(p, pNew, pOld) );
115191 if( pUpgrade==0 || sampleIsBetter(p, pOld, pUpgrade) ){
115192 pUpgrade = pOld;
118295 TESTONLY ( Index *pOld = ) sqlite3HashInsert(
118299 assert( pOld==pIndex || pOld==0 );
120390 Table *pOld;
120394 pOld = sqlite3HashInsert(&pSchema->tblHash, p->zName, p);
120395 if( pOld ){
120396 assert( p==pOld ); /* Malloc must have failed inside HashInsert() */
137970 Vdbe *pOld, /* VM being reprepared */
137990 rc = sqlite3Prepare(db, zSql, nBytes, prepFlags, pOld, ppStmt, pzTail);
150448 Table *pOld;
150453 pOld = sqlite3HashInsert(&pSchema->tblHash, zName, pTab);
150454 if( pOld ){
150456 assert( pTab==pOld ); /* Malloc must have failed inside HashInsert() */
151822 SQLITE_PRIVATE void *sqlite3WhereRealloc(WhereInfo *pWInfo, void *pOld, u64 nByte);
154762 WhereTerm *pOld = pWC->a;
154769 pWC->a = pOld;
154772 memcpy(pWC->a, pOld, sizeof(pWC->a[0])*pWC->nTerm);
156819 SQLITE_PRIVATE void *sqlite3WhereRealloc(WhereInfo *pWInfo, void *pOld, u64 nByte){
156821 if( pNew && pOld ){
156822 WhereMemBlock *pOldBlk = (WhereMemBlock*)pOld;
156825 memcpy(pNew, pOld, pOldBlk->sz);
170288 SrcItem *pOld = yymsp[-3].minor.yy131->a;
170289 pNew->zName = pOld->zName;
170290 pNew->zDatabase = pOld->zDatabase;
170291 pNew->pSelect = pOld->pSelect;
170295 if( pOld->fg.isTabFunc ){
170296 pNew->u1.pFuncArg = pOld->u1.pFuncArg;
170297 pOld->u1.pFuncArg = 0;
170298 pOld->fg.isTabFunc = 0;
170301 pOld->zName = pOld->zDatabase = 0;
170302 pOld->pSelect = 0;
175568 void *pOld;
175577 pOld = db->pTraceArg;
175582 return pOld;
175623 void *pOld;
175632 pOld = db->pProfileArg;
175638 return pOld;
175653 void *pOld;
175662 pOld = db->pCommitArg;
175666 return pOld;
188749 void *pOld;
188756 pOld = sqlite3Fts3HashInsert(pHash, (void *)zName, nName, pPtr);
188757 if( pOld==pPtr ){
217353 sqlite3_session *pOld; /* Session object already attached to db */
217373 pOld = (sqlite3_session*)sqlite3_preupdate_hook(db, xPreUpdate, (void*)pNew);
217374 pNew->pNext = pOld;
219977 sqlite3_value *pOld = sessionChangesetOld(pIter, i);
219979 if( p->abPK[i] || (bPatchset==0 && pOld) ){
219980 rc = sessionBindValue(pUp, i*2+2, pOld);
233719 ** (pNew/<length-unknown>) shares with buffer (pOld/nOld).
233722 ** than buffer (pOld/nOld).
233724 static int fts5PrefixCompress(int nOld, const u8 *pOld, const u8 *pNew){
233727 if( pOld[i]!=pNew[i] ) break;