Lines Matching defs:nNew
28057 int nOld, nNew, nDiff;
28076 nNew = sqlite3GlobalConfig.m.xRoundup((int)nBytes);
28077 if( nOld==nNew ){
28083 nDiff = nNew - nOld;
28092 pNew = sqlite3GlobalConfig.m.xRealloc(pOld, nNew);
28096 pNew = sqlite3GlobalConfig.m.xRealloc(pOld, nNew);
28100 nNew = sqlite3MallocSize(pNew);
28101 sqlite3StatusUp(SQLITE_STATUS_MEMORY_USED, nNew-nOld);
28105 pNew = sqlite3GlobalConfig.m.xRealloc(pOld, nNew);
38941 ** descriptor pFd to nNew bytes. Any existing mapping is discarded.
38956 i64 nNew /* Required mapping size */
38966 assert( nNew>pFd->mmapSize );
38967 assert( nNew<=pFd->mmapSizeMax );
38968 assert( nNew>0 );
38991 pNew = osMremap(pOrig, nReuse, nNew, MREMAP_MAYMOVE);
38994 pNew = osMmap(pReq, nNew-nReuse, flags, MAP_SHARED, h, nReuse);
38997 osMunmap(pNew, nNew - nReuse);
39013 pNew = osMmap(0, nNew, flags, MAP_SHARED, h, 0);
39018 nNew = 0;
39027 pFd->mmapSize = pFd->mmapSizeActual = nNew;
50745 unsigned int nNew;
50750 nNew = p->nHash*2;
50751 if( nNew<256 ){
50752 nNew = 256;
50757 apNew = (PgHdr1 **)sqlite3MallocZero(sizeof(PgHdr1 *)*nNew);
50765 unsigned int h = pPage->iKey % nNew;
50773 p->nHash = nNew;
58715 Pgno nNew = pPager->dbSize - (pPager->dbSize==PAGER_MJ_PGNO(pPager));
58717 rc = pager_truncate(pPager, nNew);
59069 int nNew; /* Number of remaining savepoints after this op. */
59072 ** operation. Store this value in nNew. Then free resources associated
59075 nNew = iSavepoint + (( op==SAVEPOINT_RELEASE ) ? 0 : 1);
59076 for(ii=nNew; ii<pPager->nSavepoint; ii++){
59079 pPager->nSavepoint = nNew;
59084 PagerSavepoint *pRel = &pPager->aSavepoint[nNew];
59101 PagerSavepoint *pSavepoint = (nNew==0)?0:&pPager->aSavepoint[nNew-1];
72144 ** pCArray->apCell[iOld]. After balancing, this page should hold nNew cells
72157 int nNew, /* Final number of cells on page */
72162 u8 *pBegin = &pPg->aCellIdx[nNew * 2];
72168 int iNewEnd = iNew + nNew;
72194 int nAdd = MIN(nNew,iOld-iNew);
72195 assert( (iOld-iNew)<nNew || nCell==0 || CORRUPT_DB );
72209 if( iCell>=0 && iCell<nNew ){
72228 iNew+nCell, nNew-nCell, pCArray
72231 pPg->nCell = nNew;
72238 for(i=0; i<nNew && !CORRUPT_DB; i++){
72252 populateCellCache(pCArray, iNew, nNew);
72253 return rebuildPage(pCArray, iNew, nNew, pPg);
72527 int nNew = 0; /* Number of pages in apNew[] */
72944 nNew++;
72955 nNew++;
72980 for(i=0; i<nNew; i++){
72997 for(i=0; i<nNew; i++){
72999 for(j=1; j<nNew; j++){
73016 nNew>=2 ? apNew[1]->pgno : 0, nNew>=2 ? szNew[1] : 0,
73017 nNew>=2 ? cntNew[1] - cntNew[0] - !leafData : 0,
73018 nNew>=3 ? apNew[2]->pgno : 0, nNew>=3 ? szNew[2] : 0,
73019 nNew>=3 ? cntNew[2] - cntNew[1] - !leafData : 0,
73020 nNew>=4 ? apNew[3]->pgno : 0, nNew>=4 ? szNew[3] : 0,
73021 nNew>=4 ? cntNew[3] - cntNew[2] - !leafData : 0,
73022 nNew>=5 ? apNew[4]->pgno : 0, nNew>=5 ? szNew[4] : 0,
73023 nNew>=5 ? cntNew[4] - cntNew[3] - !leafData : 0
73027 assert( nNew>=1 && nNew<=ArraySize(apNew) );
73028 assert( apNew[nNew-1]!=0 );
73029 put4byte(pRight, apNew[nNew-1]->pgno);
73034 if( (pageFlags & PTF_LEAF)==0 && nOld!=nNew ){
73035 MemPage *pOld = (nNew>nOld ? apNew : apOld)[nOld-1];
73036 memcpy(&apNew[nNew-1]->aData[8], &pOld->aData[8], 4);
73066 assert( iOld<nNew || iOld<nOld );
73068 pOld = iOld<nNew ? apNew[iOld] : apOld[iOld];
73082 if( iOld>=nNew
73098 for(i=0; i<nNew-1; i++){
73164 ** The iPg value in the following loop starts at nNew-1 goes down
73165 ** to 0, then back up to nNew-1 again, thus making two passes over
73172 for(i=1-nNew; i<nNew; i++){
73174 assert( iPg>=0 && iPg<nNew );
73210 assert( memcmp(abDone, "\01\01\01\01\01", nNew)==0 );
73213 assert( nNew>0 );
73231 assert( nNew==1 || CORRUPT_DB );
73245 for(i=0; i<nNew; i++){
73253 nOld, nNew, b.nCell));
73257 for(i=nNew; i<nOld; i++){
73267 ptrmapCheckPages(apNew, nNew);
73280 for(i=0; i<nNew; i++){
78546 sqlite3_int64 nNew = (v->nOpAlloc>=512 ? 2*(sqlite3_int64)v->nOpAlloc
78549 sqlite3_int64 nNew = (v->nOpAlloc ? 2*(sqlite3_int64)v->nOpAlloc
78555 if( nNew > p->db->aLimit[SQLITE_LIMIT_VDBE_OP] ){
78561 assert( nNew>=(v->nOpAlloc+nOp) );
78562 pNew = sqlite3DbRealloc(p->db, v->aOp, nNew*sizeof(Op));
95287 sqlite3_int64 nNew = MAX(128, 2*(sqlite3_int64)p->nAlloc);
95288 while( nByte>nNew ) nNew = nNew*2;
95289 aNew = sqlite3Realloc(p->aAlloc, nNew);
95291 p->nAlloc = nNew;
96582 sqlite3_int64 nNew = 2 * (sqlite3_int64)pSorter->nMemory;
96587 while( nNew < nMin ) nNew = nNew*2;
96588 if( nNew > pSorter->mxPmaSize ) nNew = pSorter->mxPmaSize;
96589 if( nNew < nMin ) nNew = nMin;
96590 aNew = sqlite3Realloc(pSorter->list.aMemory, nNew);
96596 pSorter->nMemory = nNew;
107885 int nNew = sqlite3Strlen30(zNew);
107906 nNew = nQuot;
107913 assert( nQuot>=nNew );
107925 nReplace = nNew;
149619 ** that the scan will visit nNew rows. This function returns the number
149627 static LogEst whereRangeAdjust(WhereTerm *pTerm, LogEst nNew){
149628 LogEst nRet = nNew;
149812 LogEst nNew;
149913 nNew = sqlite3LogEst(iUpper - iLower);
149918 if( iLwrIdx==iUprIdx ) nNew -= 20; assert( 20==sqlite3LogEst(4) );
149920 nNew = 10; assert( 10==sqlite3LogEst(2) );
149922 if( nNew<nOut ){
149923 nOut = nNew;
149940 nNew = whereRangeAdjust(pLower, nOut);
149941 nNew = whereRangeAdjust(pUpper, nNew);
149950 nNew -= 20;
149954 if( nNew<10 ) nNew = 10;
149955 if( nNew<nOut ) nOut = nNew;
172832 int nNew;
172836 pTS->aaOutput[i], pTS->anOutput[i], aOut, nOut, &aNew, &nNew
172847 nOut = nNew;
172915 int nNew;
172918 pTS->aaOutput[iOut], pTS->anOutput[iOut], &aNew, &nNew
172930 nMerge = nNew;
175206 int nNew;
175218 nNew = (int)(pOut - pPhrase->doclist.pList) - 1;
175219 assert_fts3_nc( nNew<=pPhrase->doclist.nList && nNew>0 );
175220 if( nNew>=0 && nNew<=pPhrase->doclist.nList ){
175221 assert( pPhrase->doclist.pList[nNew]=='\0' );
175222 memset(&pPhrase->doclist.pList[nNew], 0, pPhrase->doclist.nList - nNew);
175223 pPhrase->doclist.nList = nNew;
176914 static void *fts3ReallocOrFree(void *pOrig, sqlite3_int64 nNew){
176915 void *pRet = sqlite3_realloc64(pOrig, nNew);
179205 sqlite3_int64 nNew = sizeof(char *)*(iArg+1);
179206 char const **aNew = (const char **)sqlite3_realloc64((void *)aArg, nNew);
180886 int nNew = p->nSpace * 2;
180887 p = sqlite3_realloc(p, sizeof(*p) + nNew);
180893 p->nSpace = nNew;
181620 i64 nNew = ((i64)nPrefix+nSuffix)*2;
181621 char *zNew = sqlite3_realloc64(pReader->zTerm, nNew);
181626 pReader->nTermAlloc = nNew;
187932 int nNew; /* Number of valid entries in array aNew[] */
187936 nNew = p->nException;
187945 for(i=0; i<nNew && aNew[i]<(int)iCode; i++);
187946 for(j=nNew; j>i; j--) aNew[j] = aNew[j-1];
187948 nNew++;
187952 p->nException = nNew;
189296 u32 nNew;
189300 nNew = pParse->nAlloc*2 + 10;
189301 pNew = sqlite3_realloc64(pParse->aNode, sizeof(JsonNode)*nNew);
189306 pParse->nAlloc = nNew;
192647 int nNew = pCur->nPointAlloc*2 + 8;
192648 pNew = sqlite3_realloc64(pCur->aPoint, nNew*sizeof(pCur->aPoint[0]));
192651 pCur->nPointAlloc = nNew;
202069 int nNew = (pRbu->nFrameAlloc ? pRbu->nFrameAlloc : 64) * 2;
202071 aNew = (RbuFrame*)sqlite3_realloc64(pRbu->aFrame, nNew * sizeof(RbuFrame));
202074 pRbu->nFrameAlloc = nNew;
203409 static int rbuUpdateTempSize(rbu_file *pFd, sqlite3_int64 nNew){
203411 i64 nDiff = nNew - pFd->sz;
203413 pFd->sz = nNew;
206366 int nNew;
206370 aNew = sessionMergeValue(&aNew1, &aNew2, &nNew);
206371 if( pTab->abPK[i] || nOld!=nNew || memcmp(aOld, aNew, nNew) ){
206391 int nNew;
206395 aNew = sessionMergeValue(&aNew1, &aNew2, &nNew);
206397 && (pTab->abPK[i] || (nOld==nNew && 0==memcmp(aOld, aNew, nNew)))
206401 memcpy(aOut, aNew, nNew);
206402 aOut += nNew;
206504 sqlite3_int64 nNew = 2*(sqlite3_int64)(pTab->nChange ? pTab->nChange : 128);
206507 pSession, sizeof(SessionChange*) * nNew
206515 memset(apNew, 0, sizeof(SessionChange *) * nNew);
206522 int iHash = sessionChangeHash(pTab, bPkOnly, p->aRecord, nNew);
206530 pTab->nChange = nNew;
207442 i64 nNew = p->nAlloc ? p->nAlloc : 128;
207444 nNew = nNew*2;
207445 }while( (size_t)(nNew-p->nBuf)<nByte );
207447 aNew = (u8 *)sqlite3_realloc64(p->aBuf, nNew);
207452 p->nAlloc = nNew;
208294 int nNew = sessions_strm_chunk_size;
208297 if( SQLITE_OK==sessionBufferGrow(&pIn->buf, nNew, &rc) ){
208298 rc = pIn->xInput(pIn->pIn, &pIn->buf.aBuf[pIn->buf.nBuf], &nNew);
208299 if( nNew==0 ){
208302 pIn->buf.nBuf += nNew;
210536 int nNew = (int)strlen(zNew);
210541 if( 0==sqlite3_strnicmp(pTab->zName, zNew, nNew+1) ) break;
210546 pTab = sqlite3_malloc64(sizeof(SessionTable) + nCol + nNew+1);
210556 memcpy(pTab->zName, zNew, nNew+1);
214380 int nNew = p->nFirstAlloc ? p->nFirstAlloc*2 : 64;
214383 aNew = (int*)sqlite3_realloc64(p->aFirst, nNew*sizeof(int));
214386 p->nFirstAlloc = nNew;
214847 u64 nNew = pBuf->nSpace ? pBuf->nSpace : 64;
214849 while( nNew<nByte ){
214850 nNew = nNew * 2;
214852 pNew = sqlite3_realloc64(pBuf->p, nNew);
214857 pBuf->nSpace = (int)nNew;
217800 int nNew = pNear->nPhrase + SZALLOC;
217803 nByte = sizeof(Fts5ExprNearset) + nNew * sizeof(Fts5ExprPhrase*);
217883 int nNew = SZALLOC + (pPhrase ? pPhrase->nTerm : 0);
217886 sizeof(Fts5ExprPhrase) + sizeof(Fts5ExprTerm) * nNew
217893 pNew->nTerm = nNew - SZALLOC;
219410 int nNew = pHash->nSlot*2;
219415 apNew = (Fts5HashEntry**)sqlite3_malloc64(nNew*sizeof(Fts5HashEntry*));
219417 memset(apNew, 0, nNew*sizeof(Fts5HashEntry*));
219424 iHash = fts5HashKey(nNew, (u8*)fts5EntryKey(p),
219432 pHash->nSlot = nNew;
219569 sqlite3_int64 nNew = p->nAlloc * 2;
219572 pNew = (Fts5HashEntry*)sqlite3_realloc64(p, nNew);
219574 pNew->nAlloc = (int)nNew;
219921 ** varint: number of bytes of new term data (nNew)
219922 ** blob: nNew bytes of new term data
221456 int nNew; /* Bytes of new data */
221458 iOff += fts5GetVarint32(&a[iOff], nNew);
221459 if( iOff+nNew>pIter->pLeaf->szLeaf || nKeep>pIter->term.n || nNew==0 ){
221464 fts5BufferAppendBlob(&p->rc, &pIter->term, nNew, &a[iOff]);
221466 iOff += nNew;
221585 int nNew = pIter->nRowidOffset + 8;
221586 int *aNew = (int*)sqlite3_realloc64(pIter->aRowidOffset,nNew*sizeof(int));
221592 pIter->nRowidOffset = nNew;
222038 u32 nNew = 0;
222056 fts5FastGetVarint32(a, iOff, nNew);
222065 nCmp = (u32)MIN(nNew, nTerm-nMatch);
222072 if( i==nNew ){
222077 }else if( i<nNew && a[iOff+i]>pTerm[nMatch] ){
222120 iOff += fts5GetVarint32(&a[iOff], nNew);
222128 if( (i64)iOff+nNew>n || nNew<1 ){
222132 pIter->iLeafOffset = iOff + nNew;
222137 fts5BufferAppendBlob(&p->rc, &pIter->term, nNew, &a[iOff]);
230864 int nNew = p->nException;
230879 for(i=0; i<nNew; i++){
230882 memmove(&aNew[i+1], &aNew[i], (nNew-i)*sizeof(int));
230884 nNew++;
230889 p->nException = nNew;