Lines Matching refs:k
19442 int i, j, k, n, isnull; in sqlite3VXPrintf() local
19449 k = precision; in sqlite3VXPrintf()
19450 for(i=n=0; k!=0 && (ch=escarg[i])!=0; i++, k--){ in sqlite3VXPrintf()
19466 k = i; in sqlite3VXPrintf()
19467 for(i=0; i<k; i++){ in sqlite3VXPrintf()
19489 int k = va_arg(ap, int); in sqlite3VXPrintf() local
19490 struct SrcList_item *pItem = &pSrc->a[k]; in sqlite3VXPrintf()
19491 assert( k>=0 && k<pSrc->nSrc ); in sqlite3VXPrintf()
19894 char k[256]; in randomByte() local
19897 sqlite3OsRandomness(sqlite3_vfs_find(0), 256, k); in randomByte()
19902 wsdPrng.j += wsdPrng.s[i] + k[i]; in randomByte()
48386 int k;
48389 k = pOvfl->idx;
48390 if( k<=iCell ){
48391 if( k==iCell ){
52280 u32 k; /* Number of leaves on the trunk of the freelist */
52345 k = get4byte(&pTrunk->aData[4]); /* # of leaves on this trunk page */
52346 if( k==0 && !searchList ){
52360 }else if( k>(u32)(pBt->usableSize/4 - 2) ){
52376 if( k==0 ){
52408 put4byte(&pNewTrunk->aData[4], k-1);
52409 memcpy(&pNewTrunk->aData[8], &pTrunk->aData[12], (k-1)*4);
52425 }else if( k>0 ){
52435 for(i=1; i<k; i++){
52458 *pPgno, closest+1, k, pTrunk->pgno, n-1));
52461 if( closest<k-1 ){
52462 memcpy(&aData[8+closest*4], &aData[4+k*4], 4);
52464 put4byte(&aData[4], k-1);
53367 int i, j, k; /* Loop counters */
53495 k = pBt->pageSize + ROUND8(sizeof(MemPage));
53500 + k*nOld; /* Page copies (apCopy) */
53535 MemPage *pOld = apCopy[i] = (MemPage*)&aSpace1[pBt->pageSize + k*i];
53606 for(subtotal=k=i=0; i<nCell; i++){
53610 szNew[k] = subtotal - szCell[i];
53611 cntNew[k] = i;
53614 k++;
53615 if( k>NB+1 ){ rc = SQLITE_CORRUPT_BKPT; goto balance_cleanup; }
53618 szNew[k] = subtotal;
53619 cntNew[k] = nCell;
53620 k++;
53632 for(i=k-1; i>0; i--){
53673 for(i=0; i<k; i++){
53722 for(i=0; i<k-1; i++){
53725 for(j=i+1; j<k; j++){
53887 k = 0; /* Current 'new' sibling page */
53913 if( i==cntNew[k] ){
53917 pNew = apNew[++k];
53921 assert( k<nNew );
62641 int j, k;
62655 k = 2;
62656 sqlite3_snprintf(100, &zBuf[k], "%d", pMem->n);
62657 k += sqlite3Strlen30(&zBuf[k]);
62658 zBuf[k++] = '[';
62662 zBuf[k++] = c;
62664 zBuf[k++] = '.';
62667 zBuf[k++] = ']';
62668 sqlite3_snprintf(100,&zBuf[k], encnames[pMem->enc]);
62669 k += sqlite3Strlen30(&zBuf[k]);
62670 zBuf[k++] = 0;
64654 int k, mx = 0;
64655 for(k=0; k<u.aj.n; k++) if( aPermute[k]>mx ) mx = aPermute[k];
70226 int k;
70227 for(k=0; k<pUsing->nId; k++){
70228 if( sqlite3StrICmp(pUsing->a[k].zName, zCol)==0 ){
74782 int k;
74784 for(k=0; k<pAggInfo->nColumn; k++, pCol++){
74790 if( (k>=pAggInfo->nColumn)
74791 && (k = addAggInfoColumn(pParse->db, pAggInfo))>=0
74793 pCol = &pAggInfo->aCol[k];
74826 pExpr->iAgg = (i16)k;
76194 HashElem *k;
76204 for(k=sqliteHashFirst(&pSchema->tblHash); k; k=sqliteHashNext(k)){
76205 Table *pTab = (Table*)sqliteHashData(k);
78712 int i, k, n;
78737 k = sqlite3Strlen30(zStmt);
78738 identPut(zStmt, &k, p->zName);
78739 zStmt[k++] = '(';
78751 sqlite3_snprintf(n-k, &zStmt[k], zSep);
78752 k += sqlite3Strlen30(&zStmt[k]);
78754 identPut(zStmt, &k, pCol->zName);
78767 memcpy(&zStmt[k], zType, len);
78768 k += len;
78769 assert( k<=n );
78771 sqlite3_snprintf(n-k, &zStmt[k], "%s", zEnd);
80041 int k;
80047 for(k=0; k<pIdx->nColumn; k++){
80050 if( pIdx->aiColumn[k]!=pIndex->aiColumn[k] ) break;
80051 z1 = pIdx->azColl[k];
80052 z2 = pIndex->azColl[k];
80055 if( k==pIdx->nColumn ){
80977 HashElem *k; /* For looping over tables in pDb */
80983 for(k=sqliteHashFirst(&pDb->pSchema->tblHash); k; k=sqliteHashNext(k)){
80984 pTab = (Table*)sqliteHashData(k);
93631 int i, j, k;
93721 for(k=0; k<pEList->nExpr; k++){
93722 Expr *pE = pEList->a[k].pExpr;
93728 if( k<pEList->nExpr ){
93740 for(k=0; k<pEList->nExpr; k++){
93741 Expr *pE = a[k].pExpr;
93746 pNew = sqlite3ExprListAppend(pParse, pNew, a[k].pExpr);
93748 pNew->a[pNew->nExpr-1].zName = a[k].zName;
93749 pNew->a[pNew->nExpr-1].zSpan = a[k].zSpan;
93750 a[k].zName = 0;
93751 a[k].zSpan = 0;
93753 a[k].pExpr = 0;
94430 int k; /* Loop counter */
94433 for(k=p->pEList->nExpr, pItem=p->pEList->a; k>0; k--, pItem++){
94436 for(k=pGroupBy->nExpr, pItem=pGroupBy->a; k>0; k--, pItem++){
98907 int k;
98910 for(pTerm=pWC->a, k=pWC->nTerm; k; k--, pTerm++){
101375 int k; /* Loop counter */
101381 for(pTerm=pWC->a, k=pWC->nTerm; nRow>2 && k; k--, pTerm++){
101727 int k = pIdx->aiColumn[j];
101728 pTerm = findTerm(pWC, iCur, k, notReady, pLevel->plan.wsFlags, pIdx);
101927 int j, k; /* Loop counters */
101992 for(k=0; k<nConstraint; k++){
101993 if( aUsage[k].argvIndex==j ){
101994 int iTerm = aConstraint[k].iTermOffset;
101999 if( k==nConstraint ) break;
102183 k = pIdx->aiColumn[nEq]; /* Column for inequality constraints */
102207 pRangeEnd = findTerm(pWC, iCur, k, notReady, (WO_LT|WO_LE), pIdx);
102211 pRangeStart = findTerm(pWC, iCur, k, notReady, (WO_GT|WO_GE), pIdx);
102432 for(k=1; k<=nNotReady; k++){
102433 memcpy(&pOrTab->a[k], &origSrc[pLevel[k].iFrom], sizeof(pOrTab->a[k]));
103285 int k, j, last;
103292 for(k=pWInfo->iTop; k<last; k++, pOp++){
