Lines Matching defs:cnt
15912 u32 cnt; /* Number of times this instruction was executed */
23279 u32 cnt = 0;
23282 cnt++;
23284 return cnt;
23618 int cnt = 0;
23643 cnt++;
23648 return cnt;
24254 int cnt = 0; /* Safety to prevent infinite loop */
24270 }while( iErr && cnt++<3 );
28014 int cnt; /* Number of entries without a matching leave */
28023 return p==0 || p->cnt>0;
28027 return p==0 || p->cnt==0;
28050 pNew->cnt = 0;
28074 assert( p->cnt==0 );
28098 p->cnt++;
28103 p->cnt++;
28116 p->cnt--;
30067 ** The counter *cnt is incremented each time. After counter exceeds
30071 static char et_getdigit(LONGDOUBLE_TYPE *val, int *cnt){
30074 if( (*cnt)<=0 ) return '0';
30075 (*cnt)--;
31581 int cnt = 0;
31589 cnt = 1;
31604 if( cnt++ ) sqlite3TreeViewPop(&pView);
32547 int cnt = 0;
32552 if( cnt++ && pStep->pNext==0 ){
32570 int cnt = 0;
32575 if( cnt++ && pTrigger->pNext==0 ){
37890 ** a reference count (so we will know when to delete it) and a "cnt"
37891 ** field that tells us its internal lock status. cnt==0 means the
37892 ** file is unlocked. cnt==-1 means the file has an exclusive lock.
37893 ** cnt>0 means there are cnt shared locks on the file.
40105 ** Seek to the offset passed as the second argument, then read cnt
40117 static int seekAndRead(unixFile *id, sqlite3_int64 offset, void *pBuf, int cnt){
40124 assert( cnt==(cnt&0x1ffff) );
40128 got = osPread(id->h, pBuf, cnt, offset);
40131 got = osPread64(id->h, pBuf, cnt, offset);
40140 got = osRead(id->h, pBuf, cnt);
40142 if( got==cnt ) break;
40149 cnt -= got;
40288 ** Seek to the offset in id->offset then read cnt bytes into pBuf.
40294 static int seekAndWrite(unixFile *id, i64 offset, const void *pBuf, int cnt){
40295 return seekAndWriteFd(id->h, offset, pBuf, cnt, &id->lastErrno);
47738 int rc, cnt = 0;
47755 /* SimulateIOError( rc=0; cnt=MX_CLOSE_ATTEMPT; ); */
47756 }while( rc==0 && ++cnt < MX_CLOSE_ATTEMPT && (sqlite3_win32_sleep(100), 1) );
47766 int cnt = 0;
47770 && cnt++ < WINCE_DELETION_ATTEMPTS
48357 int cnt = 3;
48358 while( cnt-->0 && (res = winLockFile(&pFile->h, SQLITE_LOCKFILE_FLAGS,
48368 pFile->h, cnt, res));
48373 pFile->h, cnt, sqlite3ErrName(rc)));
48376 if( cnt ) sqlite3_win32_sleep(1);
50057 int cnt = 0;
50062 &sAttrData)) && winRetryIoerr(&cnt, &lastErrno) ){}
50106 int cnt = 0;
50277 }while( winRetryIoerr(&cnt, &lastErrno) );
50294 }while( winRetryIoerr(&cnt, &lastErrno) );
50314 }while( winRetryIoerr(&cnt, &lastErrno) );
50317 winLogIoerr(cnt, __LINE__);
50414 int cnt = 0;
50469 if ( !winRetryIoerr(&cnt, &lastErrno) ){
50497 if ( !winRetryIoerr(&cnt, &lastErrno) ){
50507 winLogIoerr(cnt, __LINE__);
50539 int cnt = 0;
50544 &sAttrData)) && winRetryIoerr(&cnt, &lastErrno) ){}
50557 winLogIoerr(cnt, __LINE__);
50967 ULONGLONG cnt = osGetTickCount64();
50968 xorMemory(&e, (unsigned char*)&cnt, sizeof(ULONGLONG));
50972 DWORD cnt = osGetTickCount();
50973 xorMemory(&e, (unsigned char*)&cnt, sizeof(DWORD));
64314 WALTRACE(("WAL%p: acquire EXCLUSIVE-%s cnt=%d %s\n", pWal,
64323 WALTRACE(("WAL%p: release EXCLUSIVE-%s cnt=%d\n", pWal,
66043 ** The caller must set the cnt parameter to the number of prior calls to
66076 static int walTryBeginRead(Wal *pWal, int *pChanged, int useWal, int cnt){
66106 if( cnt>5 ){
66108 if( cnt>100 ){
66112 if( cnt>=10 ) nDelay = (cnt-9)*(cnt-9)*39;
66114 if( cnt>=15 ) printLockInfoUsingWal(pWal);
66382 int cnt = 0; /* Number of TryBeginRead attempts */
66416 rc = walTryBeginRead(pWal, pChanged, 0, ++cnt);
66812 int cnt;
66839 cnt = 0;
66842 rc = walTryBeginRead(pWal, ¬Used, 1, ++cnt);
67008 { int cnt; for(cnt=0, p=pList; p; p=p->pDirty, cnt++){}
67010 pWal, cnt, pWal->hdr.mxFrame, isCommit ? "Commit" : "Spill"));
82807 pOp->cnt = 0;
84990 p->aOp[i].cnt = 0;
85561 int cnt = 0;
85567 cnt++;
85573 assert( cnt==db->nVdbeActive );
86023 p->aOp[i].cnt,
86025 p->aOp[i].cnt>0 ? p->aOp[i].cycles/p->aOp[i].cnt : 0
88662 int cnt = 0; /* Counter to prevent infinite loop of reprepares */
88671 && cnt++ < SQLITE_MAX_SCHEMA_RETRY ){
91685 int cnt;
91688 cnt = pOp->p3-pOp->p2;
91695 while( cnt>0 ){
91701 cnt--;
95742 int cnt; /* Counter to limit the number of searches */
95838 cnt = 0;
95845 && (++cnt<100));
99136 pOrigOp->cnt++;
103916 int cnt = 0; /* Number of matching column names */
103969 assert( pNC && cnt==0 );
103997 if( cnt>0 ){
104003 ** by clearing pFJMatch and letting cnt go above 1. */
104013 cnt = 0;
104021 cnt++;
104053 if( cnt>0 ){
104059 ** by clearing pFJMatch and letting cnt go above 1. */
104069 cnt = 0;
104077 cnt++;
104087 if( 0==cnt && VisibleRowid(pTab) ){
104109 if( cnt==0 && zDb==0 ){
104161 cnt++;
104212 if( cnt==0
104219 cnt = 1;
104242 if( cnt==0
104273 cnt = 1;
104285 ** we have a match (cnt>0) or when we run out of name contexts.
104287 if( cnt ) break;
104303 if( cnt==0 && zTab==0 ){
104337 ** cnt==0 means there was not match.
104338 ** cnt>1 means there were two or more matches.
104340 ** cnt==0 is always an error. cnt>1 is often an error, but might
104343 assert( pFJMatch==0 || cnt>0 );
104345 if( cnt!=1 ){
104348 if( pFJMatch->nExpr==cnt-1 ){
104361 cnt = 1;
104368 zErr = cnt==0 ? "no such column" : "ambiguous column name";
104411 if( cnt==1 ){
109282 int j, cnt;
109283 for(cnt=j=0; j<nVector; j++) if( aiMap[j]==i ) cnt++;
109284 assert( cnt==1 );
126262 i64 cnt; /* Number of elements summed */
126285 p->cnt++;
126309 assert( p->cnt>0 );
126310 p->cnt--;
126327 if( p && p->cnt>0 ){
126340 if( p && p->cnt>0 ){
126341 sqlite3_result_double(context, p->rSum/(double)p->cnt);
130713 sqlite3VdbeAddOp2(v, OP_AddImm, regTrigCnt, 1); /* incr trigger cnt */
130994 sqlite3VdbeAddOp2(v, OP_AddImm, regTrigCnt, 1); /* incr trigger cnt */
135943 int cnt = 0; /* Number of entries in aRoot[] */
135958 for(cnt=0, x=sqliteHashFirst(pTbls); x; x=sqliteHashNext(x)){
135963 if( HasRowid(pTab) ) cnt++;
135964 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){ cnt++; }
135967 if( cnt==0 ) continue;
135968 if( pObjTab ) cnt++;
135969 aRoot = sqlite3DbMallocRawNN(db, sizeof(int)*(cnt+1));
135971 cnt = 0;
135972 if( pObjTab ) aRoot[++cnt] = 0;
135977 if( HasRowid(pTab) ) aRoot[++cnt] = pTab->tnum;
135979 aRoot[++cnt] = pIdx->tnum;
135982 aRoot[0] = cnt;
135989 sqlite3VdbeAddOp4(v, OP_IntegrityCk, 2, cnt, 1, (char*)aRoot,P4_INTARRAY);
137975 int cnt = 0;
137993 }while( (rc==SQLITE_ERROR_RETRY && (cnt++)<SQLITE_MAX_PREPARE_RETRY)
137994 || (rc==SQLITE_SCHEMA && (sqlite3ResetOneSchema(db,-1), cnt++)==0) );
140422 u32 cnt; /* Index added to make the name unique */
140483 cnt = 0;
140493 zName = sqlite3MPrintf(db, "%.*z:%u", nName, zName, ++cnt);
140494 if( cnt>3 ) sqlite3_randomness(sizeof(cnt), &cnt);
154880 int cnt; /* Number of non-wildcard prefix characters */
154915 cnt = 0;
154916 while( (c=z[cnt])!=0 && c!=wc[0] && c!=wc[1] && c!=wc[2] ){
154917 cnt++;
154918 if( c==wc[3] && z[cnt]!=0 ) cnt++;
154929 if( cnt!=0 && 255!=(u8)z[cnt-1] && (cnt>1 || z[0]!=wc[3]) ){
154933 *pisComplete = c==wc[0] && z[cnt+1]==0;
154942 zNew[cnt] = 0;
154943 for(iFrom=iTo=0; iFrom<cnt; iFrom++){
166348 int mxSelect, cnt = 1;
166355 cnt++;
166365 cnt>mxSelect
174149 ** The cnt parameter is the number of slots. If pStart is NULL the
174151 ** If pStart is not NULL then it is sz*cnt bytes of memory to use for
174154 static int setupLookaside(sqlite3 *db, void *pBuf, int sz, int cnt){
174157 sqlite3_int64 szAlloc = sz*(sqlite3_int64)cnt;
174176 if( cnt<0 ) cnt = 0;
174177 if( sz==0 || cnt==0 ){
174338 int cnt = va_arg(ap, int); /* IMP: R-04460-53386 */
174339 rc = setupLookaside(db, pBuf, sz, cnt);
190223 /* 28 */ "SELECT level, count(*) AS cnt FROM %Q.'%q_segdir' "
190224 " GROUP BY level HAVING cnt>=?"
203209 int cnt = 0;
203216 cnt++;
203217 if( NEVER(cnt>100) ){
206166 int cnt = 0;
206173 cnt += v;
206181 }else if( ((v+cnt)&1)==0 ){
207715 int cnt;
207736 for(cnt=0; cnt<2; cnt++){
207754 assert( cnt==0 );
208756 ** CREATE TABLE rbu_count(tbl TEXT PRIMARY KEY, cnt INTEGER) WITHOUT ROWID;
208760 ** table. The 'cnt' column should contain the number of rows within the
209397 unsigned int cnt, ofst;
209398 cnt = rbuDeltaGetInt(&zDelta, &lenDelta);
209408 total += cnt;
209413 if( (int)(ofst+cnt) > lenSrc ){
209417 memcpy(zOut, &zSrc[ofst], cnt);
209418 zOut += cnt;
209423 total += cnt;
209428 if( (int)cnt>lenDelta ){
209432 memcpy(zOut, zDelta, cnt);
209433 zOut += cnt;
209434 zDelta += cnt;
209435 lenDelta -= cnt;
209442 if( cnt!=rbuDeltaChecksum(zOrigOut, total) ){
212727 ** CREATE TABLE rbu_count(tbl TEXT PRIMARY KEY, cnt INTEGER) WITHOUT ROWID;
212731 ** and the cnt column the number of rows it contains.
212733 ** sqlite3rbu.nPhaseOneStep is initialized to the sum of (1 + nIndex) * cnt
212764 "SELECT sum(cnt * (1 + rbu_index_cnt(rbu_target_name(tbl))))"
243482 ** CREATE TABLE vocab(term, col, doc, cnt, PRIMARY KEY(term, col));
243486 ** $term within column $col. Field $cnt is set to the total number of
243490 ** CREATE TABLE vocab(term, doc, cnt, PRIMARY KEY(term));
243494 ** $term. Field $cnt is set to the total number of instances of term
243550 #define FTS5_VOCAB_COL_SCHEMA "term, col, doc, cnt"
243551 #define FTS5_VOCAB_ROW_SCHEMA "term, doc, cnt"