Lines Matching defs:nData
11952 ** nData bytes) to the changegroup.
12023 SQLITE_API int sqlite3changegroup_add(sqlite3_changegroup*, int nData, void *pData);
12600 ** int (*xOutput)(void *pOut, const void *pData, int nData),
12607 ** points to a buffer nData bytes in size containing the chunk of output
12655 int (*xOutput)(void *pOut, const void *pData, int nData),
12661 int (*xOutput)(void *pOut, const void *pData, int nData),
12677 int (*xOutput)(void *pOut, const void *pData, int nData),
12682 int (*xOutput)(void *pOut, const void *pData, int nData),
12690 int (*xOutput)(void *pOut, const void *pData, int nData),
12697 int (*xOutput)(void *pOut, const void *pData, int nData),
15391 ** key and the pData,nData,nZero fields are uninitialized. The aMem,nMem
15397 ** pData,nData hold the content of the new entry. nZero extra zero bytes
15410 ** nData length of pData not used
15425 int nData; /* Size of pData. 0 if none. */
15426 int nZero; /* Extra zero data appended after pData,nData */
68200 ** 4-byte nData value
71489 nPayload = pX->nData + pX->nZero;
71491 nSrc = pX->nData;
73521 int nData = pX->nData - iOffset;
73522 if( nData<=0 ){
73532 if( nData<iAmt ){
73535 int rc = btreeOverwriteContent(pPage, pDest+nData, pX, iOffset+nData,
73536 iAmt-nData);
73538 iAmt = nData;
73559 int nTotal = pX->nData + pX->nZero; /* Total bytes of to write */
73614 ** rowid or INTEGER PRIMARY KEY of the row. The pX.nData,pData,nZero fields
73619 ** pX.pData,nData,nZero fields must be zero.
73713 assert( pX->nData>=0 && pX->nZero>=0 );
73715 && pCur->info.nPayload==(u32)pX->nData+pX->nZero
73769 x2.nData = pX->nKey;
73793 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno,
85004 int nData, /* Number of bytes of data to be bound */
85016 rc = sqlite3VdbeMemSetStr(pVar, zData, nData, encoding, xDel);
85040 int nData,
85044 if( nData<0 ) return SQLITE_MISUSE_BKPT;
85046 return bindText(pStmt, i, zData, nData, xDel, 0);
85052 sqlite3_uint64 nData,
85056 if( nData>0x7fffffff ){
85059 return bindText(pStmt, i, zData, (int)nData, xDel, 0);
85116 int nData,
85119 return bindText(pStmt, i, zData, nData, xDel, SQLITE_UTF8);
85125 sqlite3_uint64 nData,
85130 if( nData>0x7fffffff ){
85134 return bindText(pStmt, i, zData, (int)nData, xDel, enc);
85142 int nData,
85145 return bindText(pStmt, i, zData, nData, xDel, SQLITE_UTF16NATIVE);
88895 u64 nData; /* Number of bytes of data space */
88925 nData = 0; /* Number of bytes of data space */
88996 ** nData Number of bytes of data space needed for the record
89039 nData++;
89043 nData += 2;
89046 nData += 3;
89049 nData += 4;
89052 nData += 6;
89055 nData += 8;
89070 nData += 8;
89079 if( nData ){
89086 nData += len;
89109 nByte = nHdr+nData;
91084 x.nData = pData->n;
96217 ** Write nData bytes of data to the PMA. Return SQLITE_OK
96220 static void vdbePmaWriteBlob(PmaWriter *p, u8 *pData, int nData){
96221 int nRem = nData;
96228 memcpy(&p->aBuffer[p->iBufEnd], &pData[nData-nRem], nCopy);
131746 ** through regData+nData-1 onto the sorter.
131754 int nData, /* Number of elements in the regData data array */
131760 int nBase = nExpr + bSeq + nData; /* Fields in sorter record */
131772 ** by a prior OP_MakeRecord. In this case nData==1 and regData
131783 assert( nData==1 || regData==regOrigData || regOrigData==0 );
131800 if( nPrefixReg==0 && nData>0 ){
131801 sqlite3ExprCodeMove(pParse, regData, regBase+nExpr+bSeq, nData);
131824 pOp->p2 = nKey + nData;
138354 u32 nData; /* Slots used in azResult[]. (nRow+1)*nColumn */
138377 if( p->nData + need > p->nAlloc ){
138393 p->azResult[p->nData++] = z;
138416 p->azResult[p->nData++] = z;
138458 res.nData = 1;
138468 assert( sizeof(res.azResult[0])>= sizeof(res.nData) );
138469 res.azResult[0] = SQLITE_INT_TO_PTR(res.nData);
138487 if( res.nAlloc>res.nData ){
138489 azNew = sqlite3Realloc( res.azResult, sizeof(char*)*res.nData );
180326 int nData;
180419 int nData; /* Bytes of data in aData */
180451 int nData; /* Bytes of valid data so far */
180883 p->nData = 0;
180885 else if( p->nData+FTS3_VARINT_MAX+1>p->nSpace ){
180898 p->nData += sqlite3Fts3PutVarint(&p->aData[p->nData], i);
180899 p->aData[p->nData] = '\0';
180928 assert( p->nData<p->nSpace );
180929 assert( p->aData[p->nData]==0 );
180930 p->nData++;
180988 p->nPendingData -= (pList->nData + nToken + sizeof(Fts3HashElem));
181001 p->nPendingData += (pList->nData + nToken + sizeof(Fts3HashElem));
181562 int nCopy = pList->nData+1;
182255 int nData = pTree->nData; /* Current size of node in bytes */
182256 int nReq = nData; /* Required space after adding zTerm */
182288 nData += sqlite3Fts3PutVarint(&pTree->aData[nData], nPrefix);
182291 nData += sqlite3Fts3PutVarint(&pTree->aData[nData], nSuffix);
182292 memcpy(&pTree->aData[nData], &zTerm[nPrefix], nSuffix);
182293 pTree->nData = nData + nSuffix;
182329 pNew->nData = 1 + FTS3_VARINT_MAX;
182398 *pnRoot = pTree->nData - nStart;
182406 int nWrite = pIter->nData - nStart;
182463 int nData;
182491 nData = pWriter->nData;
182508 if( nData>0 && nData+nReq>p->nNodeSize ){
182513 rc = fts3WriteSegment(p, pWriter->iFree++, pWriter->aData, nData);
182533 nData = 0;
182557 assert( nData+nReq<=pWriter->nSize );
182560 nData += sqlite3Fts3PutVarint(&pWriter->aData[nData], nPrefix);
182561 nData += sqlite3Fts3PutVarint(&pWriter->aData[nData], nSuffix);
182563 memcpy(&pWriter->aData[nData], &zTerm[nPrefix], nSuffix);
182564 nData += nSuffix;
182565 nData += sqlite3Fts3PutVarint(&pWriter->aData[nData], nDoclist);
182567 memcpy(&pWriter->aData[nData], aDoclist, nDoclist);
182568 pWriter->nData = nData + nDoclist;
182616 rc = fts3WriteSegment(p, pWriter->iFree++, pWriter->aData, pWriter->nData);
182628 0, 0, 0, pWriter->nLeafData, pWriter->aData, pWriter->nData);
185770 pRet = (char *)sqlite3_malloc(p->pList->nData);
185774 *pnData = p->pList->nData - nSkip;
194383 int nData,
194389 RtreeCell cell; /* New cell to insert if nData>1 */
194399 assert(nData>=1);
194414 if( nData>1 ){
194416 int nn = nData - 4;
194421 ** NB: nData can only be less than nDim*2+3 if the rtree is mis-declared
194487 if( rc==SQLITE_OK && nData>1 ){
195038 int nData;
195050 nData = sqlite3_value_bytes(apArg[1]);
195051 if( nData<4 ) return;
195052 if( nData<NCELL(&node)*tree.nBytesPerCell ) return;
197145 int nData,
197151 RtreeCell cell; /* New cell to insert if nData>1 */
197165 assert(nData>=1);
197169 newRowidValid = nData>1 && sqlite3_value_type(aData[1])!=SQLITE_NULL;
197173 if( nData>1 /* not a DELETE */
197209 if( rc==SQLITE_OK && (nData==1 || (coordChange && oldRowidValid)) ){
197217 if( rc==SQLITE_OK && nData>1 && coordChange ){
197239 if( rc==SQLITE_OK && nData>1 ){
205651 int nData; /* Number of bytes in aData */
207968 int (*xOutput)(void *pOut, const void *pData, int nData),
208104 int (*xOutput)(void *pOut, const void *pData, int nData),
208115 int (*xOutput)(void *pOut, const void *pData, int nData),
208214 pRet->in.nData = nChangeset;
208279 pIn->nData = pIn->buf.nBuf;
208293 while( !pIn->bEof && (pIn->iNext+nByte)>=pIn->nData && rc==SQLITE_OK ){
208307 pIn->nData = pIn->buf.nBuf;
208347 int nData, /* Size of buffer aData[] in bytes */
208354 u8 *aCopy = sqlite3_malloc64((sqlite3_int64)nData+1);
208356 memcpy(aCopy, aData, nData);
208357 sqlite3ValueSetStr(pVal, nData, (char*)aCopy, enc, sqlite3_free);
208402 if( pIn->iNext>=pIn->nData ){
208422 if( nByte<0 || nByte>pIn->nData-pIn->iNext ){
208485 while( (pIn->iNext + nRead)<pIn->nData && pIn->aData[pIn->iNext + nRead] ){
208488 if( (pIn->iNext + nRead)<pIn->nData ) break;
208629 if( p->in.iNext>=p->in.nData ){
208643 if( p->in.iNext>=p->in.nData ) return SQLITE_DONE;
208925 int (*xOutput)(void *pOut, const void *pData, int nData),
208951 if( pInput->iNext>=pInput->nData ) break;
209092 sInput.nData = nChangeset;
209104 int (*xOutput)(void *pOut, const void *pData, int nData),
210631 int (*xOutput)(void *pOut, const void *pData, int nData),
210694 ** Add the changeset currently stored in buffer pData, size nData bytes,
210697 SQLITE_API int sqlite3changegroup_add(sqlite3_changegroup *pGrp, int nData, void *pData){
210698 sqlite3_changeset_iter *pIter; /* Iterator opened on pData/nData */
210701 rc = sqlite3changeset_start(&pIter, nData, pData);
210729 sqlite3_changeset_iter *pIter; /* Iterator opened on pData/nData */
210745 int (*xOutput)(void *pOut, const void *pData, int nData),
210798 int (*xOutput)(void *pOut, const void *pData, int nData),
210952 int (*xOutput)(void *pOut, const void *pData, int nData),
211102 sqlite3_changeset_iter *pIter = 0; /* Iterator opened on pData/nData */
211138 int (*xOutput)(void *pOut, const void *pData, int nData),
212128 int nData;
214886 ** Append buffer nData/pData to buffer pBuf. If an OOM error occurs, set
214893 u32 nData,
214896 assert_nc( *pRc || nData>=0 );
214897 if( nData ){
214898 if( fts5BufferGrow(pRc, pBuf, nData) ) return;
214899 memcpy(&pBuf->p[pBuf->n], pData, nData);
214900 pBuf->n += nData;
214980 ** Set the buffer to contain nData/pData. If an OOM error occurs, leave an
214987 int nData,
214991 sqlite3Fts5BufferAppendBlob(pRc, pBuf, nData, pData);
216664 if( pIter->nData==0 ) continue;
216677 sqlite3Fts5PoslistReaderInit(pIter->pData, pIter->nData, &aIter[nIter]);
216769 n = pTerm->pIter->nData;
217038 if( pIter->iRowid==pNode->iRowid && pIter->nData>0 ){
217060 fts5BufferSet(&rc, &pPhrase->poslist, pIter->nData, pIter->pData);
217370 pPhrase->poslist.n = pIter->nData;
219238 *pnCollist = pPhrase->aTerm[0].pIter->nData;
219303 ** nData:
219312 int nData; /* Total bytes of data (incl. structure) */
219445 int nData = p->nData;
219447 assert( nData==p->iSzPoslist );
219449 pPtr[nData++] = 0x00;
219451 pPtr[nData++] = 0x00;
219455 int nSz = (nData - p->iSzPoslist - 1); /* Size in bytes */
219465 nData += (nByte-1);
219469 nRet = nData - p->nData;
219474 p->nData = nData;
219541 p->nData = nToken+1 + 1 + sizeof(Fts5HashEntry);
219547 p->nData += sqlite3Fts5PutVarint(&((u8*)p)[p->nData], iRowid);
219550 p->iSzPoslist = p->nData;
219552 p->nData += 1;
219568 if( (p->nAlloc - p->nData) < (9 + 4 + 1 + 3 + 5) ){
219579 nIncr -= p->nData;
219581 assert( (p->nAlloc - p->nData) >= (9 + 4 + 1 + 3 + 5) );
219590 p->nData += sqlite3Fts5PutVarint(&pPtr[p->nData], iDiff);
219593 p->iSzPoslist = p->nData;
219595 p->nData += 1;
219609 pPtr[p->nData++] = 0x01;
219610 p->nData += sqlite3Fts5PutVarint(&pPtr[p->nData], iCol);
219621 p->nData += sqlite3Fts5PutVarint(&pPtr[p->nData], iPos - p->iPos + 2);
219630 nIncr += p->nData;
219753 int nList = p->nData - nHashPre;
219801 *pnDoclist = p->nData - (sizeof(Fts5HashEntry) + nTerm + 1);
220550 static void fts5DataWrite(Fts5Index *p, i64 iRowid, const u8 *pData, int nData){
220563 sqlite3_bind_blob(p->pWriter, 2, pData, nData, SQLITE_STATIC);
220634 ** form within buffer pData/nData.
220646 int nData, /* Size of buffer pData in bytes */
220688 if( i>=nData ){
220704 if( i>=nData ){
222945 ** and sets pIter->base.pData/nData to point to the new position list.
222948 ** pIter->base.pData/nData to point directly to it.
222976 pIter->base.nData = pIter->poslist.n;
222990 pIter->base.nData = p-aCopy;
222997 pIter->base.nData = pIter->poslist.n;
223017 pIter->base.nData = pSeg->nPos;
223026 pIter->base.nData = pSeg->nPos;
223051 pIter->base.nData = 0;
223064 pIter->base.nData = pIter->poslist.n;
223110 pIter->base.nData = aOut - pIter->poslist.p;
223138 pIter->base.nData = pIter->poslist.n;
223833 int nData
223837 int n = nData;
224598 int nData = pMulti->base.nData;
224599 int nByte = nData + 9 + 9 + FTS5_DATA_ZERO_PADDING;
224600 assert( nData>0 );
224603 fts5BufferSafeAppendVarint(pBuf, nData*2);
224604 fts5BufferSafeAppendBlob(pBuf, pMulti->base.pData, nData);
224980 if( p1->base.nData ){
225005 if( p1->base.nData==0 ) continue;
225457 static int sqlite3Fts5IndexSetAverages(Fts5Index *p, const u8 *pData, int nData){
225459 fts5DataWrite(p, FTS5_AVERAGES_ROWID, pData, nData);
225597 for(sqlite3Fts5PoslistReaderInit(pIter->pData, pIter->nData, &sReader);
226202 ** Buffer (pData/nData) contains a doclist in the format used by detail=none
226214 const u8 *pData, int nData /* Data to decode list-of-rowids from */
226219 while( i<nData ){
226225 if( i<nData && pData[i]==0x00 ){
226227 if( i<nData && pData[i]==0x00 ){
233590 || sqlite3Fts5PoslistNext64(pIter->pData, pIter->nData, po, pp)
233661 nPos = pCsr->pIter->nData;