Lines Matching refs:nReq
46166 ** nReq is the number of bytes of memory required. Once this much has
46170 SQLITE_PRIVATE int sqlite3PcacheReleaseMemory(int nReq){
46177 while( (nReq<0 || nFree<nReq)
56209 i64 nReq = ((i64)mxPage * szPage);
56211 if( rc==SQLITE_OK && nSize<nReq ){
56212 sqlite3OsFileControlHint(pWal->pDbFd, SQLITE_FCNTL_SIZE_HINT, &nReq);
87625 int nReq; /* Bytes of memory required */
87658 nReq = pVal->n + sizeof(SorterRecord);
87662 bFlush = pSorter->iMemory && (pSorter->iMemory+nReq) > pSorter->mxPmaSize;
87683 int nMin = pSorter->iMemory + nReq;
87701 pSorter->iMemory += ROUND8(nReq);
87706 pNew = (SorterRecord *)sqlite3Malloc(nReq);
157337 int nReq = nData; /* Required space after adding zTerm */
157344 nReq += sqlite3Fts3VarintLen(nPrefix)+sqlite3Fts3VarintLen(nSuffix)+nSuffix;
157345 if( nReq<=p->nNodeSize || !pTree->zTerm ){
157347 if( nReq>p->nNodeSize ){
157356 pTree->aData = (char *)sqlite3_malloc(nReq);
157538 int nReq; /* Number of bytes required on leaf page */
157573 nReq = sqlite3Fts3VarintLen(nPrefix) + /* varint containing prefix size */
157579 if( nData>0 && nData+nReq>p->nNodeSize ){
157608 nReq = 1 + /* varint containing prefix size */
157616 pWriter->nLeafData += nReq;
157621 if( nReq>pWriter->nSize ){
157622 char *aNew = sqlite3_realloc(pWriter->aData, nReq);
157625 pWriter->nSize = nReq;
157627 assert( nData+nReq<=pWriter->nSize );
193171 int nReq = p->pConfig->pgsz - pPage->buf.n - pPage->pgidx.n;
193173 while( nCopy<nReq ){
