Home
last modified time | relevance | path

Searched refs:nn (Results 1 – 11 of 11) sorted by relevance

/sqlite-3.40.0/src/
H A Dupsert.c152 int ii, jj, nn; in sqlite3UpsertAnalyzeTarget() local
162 nn = pIdx->nKeyCol; in sqlite3UpsertAnalyzeTarget()
163 for(ii=0; ii<nn; ii++){ in sqlite3UpsertAnalyzeTarget()
180 for(jj=0; jj<nn; jj++){ in sqlite3UpsertAnalyzeTarget()
185 if( jj>=nn ){ in sqlite3UpsertAnalyzeTarget()
190 if( ii<nn ){ in sqlite3UpsertAnalyzeTarget()
H A Djson.c2285 int jj, nn; in jsonAppendObjectPathElement() local
2291 nn = pNode->n; in jsonAppendObjectPathElement()
2292 assert( nn>=2 ); in jsonAppendObjectPathElement()
2294 assert( z[nn-1]=='"' ); in jsonAppendObjectPathElement()
2295 if( nn>2 && sqlite3Isalpha(z[1]) ){ in jsonAppendObjectPathElement()
2296 for(jj=2; jj<nn-1 && sqlite3Isalnum(z[jj]); jj++){} in jsonAppendObjectPathElement()
2297 if( jj==nn-1 ){ in jsonAppendObjectPathElement()
2299 nn -= 2; in jsonAppendObjectPathElement()
2302 jsonPrintf(nn+2, pStr, ".%.*s", nn, z); in jsonAppendObjectPathElement()
H A Dprintf.c498 int nn = (length - 1)/3; /* Number of "," to insert */ in sqlite3_str_vappendf() local
500 bufpt -= nn; in sqlite3_str_vappendf()
501 for(idx=0; nn>0; idx++){ in sqlite3_str_vappendf()
502 bufpt[idx] = bufpt[idx+nn]; in sqlite3_str_vappendf()
506 nn--; in sqlite3_str_vappendf()
H A Dshell.c.in9376 int nn = 0; local
9411 nn = (int)integerValue(z);
9415 sqlite3_progress_handler(p->db, nn, progress_handler, p);
/sqlite-3.40.0/test/
H A Dwithout_rowid5.test169 CREATE TABLE nn(a, b, c, d, e, PRIMARY KEY(c,a,e));
171 INSERT INTO nn VALUES(1,2,3,4,5);
175 INSERT INTO nn VALUES(NULL, 3,4,5,6);
176 INSERT INTO nn VALUES(3,4,NULL,7,8);
177 INSERT INTO nn VALUES(4,5,6,7,NULL);
178 SELECT count(*) FROM nn;
H A Dfts3corrupt.test149 db func nn nn
H A Dwhere.test1018 # Ticket #2116: Make sure sorting by index works well with nn INTEGER PRIMARY
/sqlite-3.40.0/ext/fts5/
H A Dfts5_index.c676 pRet->nn = nByte; in fts5DataRead()
715 if( pRet->nn<4 || pRet->szLeaf>pRet->nn ){ in fts5LeafRead()
1348 if( iOff<pData->nn ){ in fts5DlidxLvlNext()
1780 assert_nc( pIter->pLeaf->nn>4 ); in fts5SegIterInit()
2000 pIter->pLeaf->nn = nList; in fts5SegIterNext_None()
2080 pIter->pLeaf->nn = nList; in fts5SegIterNext()
2290 u32 n = (u32)pIter->pLeaf->nn; in fts5LeafSeek()
2375 n = (u32)pIter->pLeaf->nn; in fts5LeafSeek()
2553 pIter->iEndofDoclist = pLeaf->nn; in fts5SegIterHashInit()
6120 if( pLeaf->nn<=pLeaf->szLeaf ){ in fts5IndexIntegrityCheckSegment()
[all …]
H A Dfts5Int.h294 #define fts5BufferGrow(pRc,pBuf,nn) ( \ argument
295 (u32)((pBuf)->n) + (u32)(nn) <= (u32)((pBuf)->nSpace) ? 0 : \
296 sqlite3Fts5BufferSize((pRc),(pBuf),(nn)+(pBuf)->n) \
/sqlite-3.40.0/ext/rtree/
H A Drtree.c3253 int nn = nData - 4; in rtreeUpdate() local
3255 if( nn > pRtree->nDim2 ) nn = pRtree->nDim2; in rtreeUpdate()
3267 for(ii=0; ii<nn; ii+=2){ in rtreeUpdate()
3278 for(ii=0; ii<nn; ii+=2){ in rtreeUpdate()
/sqlite-3.40.0/tool/
H A Dlemon.c4562 { int jj, nn; in ReportTable()
4563 for(jj=nn=0; jj<pActtab->nAction; jj++){ in ReportTable()
4564 if( pActtab->aAction[jj].action<0 ) nn++; in ReportTable()
4568 ax[i].nAction, pActtab->nAction, nn); in ReportTable()