Lines Matching refs:idx
7894 int idx, /* Index of loop to report on */
9461 SQLITE_PRIVATE void sqlite3BtreeGetMeta(Btree *pBtree, int idx, u32 *pValue);
9462 SQLITE_PRIVATE int sqlite3BtreeUpdateMeta(Btree*, int idx, u32 value);
12099 int idx; /* Index in some Table.aCol[] of a column named zName */ member
18668 #define MEM5LINK(idx) ((Mem5Link *)(&mem5.zPool[(idx)*mem5.szAtom])) argument
21527 int idx; /* A general purpose loop counter */
21660 for(idx=0; idx<ArraySize(fmtinfo); idx++){
21661 if( c==fmtinfo[idx].fmttype ){
21662 infop = &fmtinfo[idx];
21770 for(idx=precision-length; idx>0; idx--){
21804 for(idx=precision&0xfff, rounder=0.5; idx>0; idx--, rounder*=0.1){}
49887 int idx; /* Value to write to hash-table slot */
49890 idx = iFrame - iZero;
49891 assert( idx <= HASHTABLE_NSLOT/2 + 1 );
49896 if( idx==1 ){
49907 if( aPgno[idx] ){
49909 assert( !aPgno[idx] );
49913 nCollide = idx;
49917 aPgno[idx] = iPage;
49918 aHash[iKey] = (ht_slot)idx;
49928 assert( nEntry==idx );
49936 if( (idx&0x3ff)==0 ){
49938 for(i=1; i<=idx; i++){
57917 int lwr, upr, idx, c;
57933 idx = upr>>(1-biasRight); /* idx = biasRight ? upr : (lwr+upr)/2; */
57934 pCur->aiIdx[pCur->iPage] = (u16)idx;
57938 pCell = findCell(pPage, idx) + pPage->childPtrSize;
57946 lwr = idx+1;
57949 upr = idx-1;
57955 pCur->aiIdx[pCur->iPage] = (u16)idx;
57957 lwr = idx;
57966 idx = (lwr+upr)>>1; /* idx = (lwr+upr)/2; */
57971 pCell = findCell(pPage, idx) + pPage->childPtrSize;
58009 pCur->aiIdx[pCur->iPage] = (u16)idx;
58023 lwr = idx+1;
58025 upr = idx-1;
58030 pCur->aiIdx[pCur->iPage] = (u16)idx;
58036 idx = (lwr+upr)>>1; /* idx = (lwr+upr)/2 */
58043 pCur->aiIdx[pCur->iPage] = (u16)idx;
58103 int idx;
58131 idx = ++pCur->aiIdx[pCur->iPage];
58139 testcase( idx>pPage->nCell );
58141 if( idx>=pPage->nCell ){
58244 int idx = pCur->aiIdx[pCur->iPage];
58245 rc = moveToChild(pCur, get4byte(findCell(pPage, idx)));
59047 static void dropCell(MemPage *pPage, int idx, int sz, int *pRC){
59056 assert( idx>=0 && idx<pPage->nCell );
59057 assert( sz==cellSize(pPage, idx) );
59061 ptr = &pPage->aCellIdx[2*idx];
59083 memmove(ptr, ptr+2, 2*(pPage->nCell - idx));
59110 int idx = 0; /* Where to write new cell content in data[] */
59154 rc = allocateSpace(pPage, sz, &idx);
59158 assert( idx >= end+2 );
59159 assert( idx+sz <= (int)pPage->pBt->usableSize );
59162 memcpy(&data[idx], pCell, sz);
59164 put4byte(&data[idx], iChild);
59167 put2byte(&data[ins], idx);
60610 int idx;
60683 idx = pCur->aiIdx[pCur->iPage];
60686 assert( idx<pPage->nCell );
60691 oldCell = findCell(pPage, idx);
60696 dropCell(pPage, idx, szOld, &rc);
60700 idx = ++pCur->aiIdx[pCur->iPage];
60704 insertCell(pPage, idx, newCell, szNew, 0, 0, &rc);
61272 SQLITE_PRIVATE void sqlite3BtreeGetMeta(Btree *p, int idx, u32 *pMeta){
61279 assert( idx>=0 && idx<=15 );
61281 if( idx==BTREE_DATA_VERSION ){
61284 *pMeta = get4byte(&pBt->pPage1->aData[36 + idx*4]);
61290 if( idx==BTREE_LARGEST_ROOT_PAGE && *pMeta>0 ){
61302 SQLITE_PRIVATE int sqlite3BtreeUpdateMeta(Btree *p, int idx, u32 iMeta){
61306 assert( idx>=1 && idx<=15 );
61313 put4byte(&pP1[36 + idx*4], iMeta);
61315 if( idx==BTREE_INCR_VACUUM ){
66704 int idx, /* Index of column zName applies to */
66711 assert( idx<p->nResColumn );
66718 pColName = &(p->aColName[idx+var*p->nResColumn]);
68011 u32 idx; /* Offset in aKey[] to read from */
68018 idx = getVarint32(aKey, szHdr);
68021 while( idx<szHdr && d<=nKey ){
68024 idx += getVarint32(&aKey[idx], serial_type);
68159 u32 idx;
68164 idx = getVarint32(aKey, szHdr);
68167 while( idx<szHdr ){
68168 idx += getVarint32(aKey+idx, notUsed);
70492 int idx, /* Index of loop to report on */
70498 if( idx<0 || idx>=p->nScan ) return 1;
70499 pScan = &p->aScan[idx];
70631 int idx = 0; /* Index of a host parameter */
70664 sqlite3GetInt32(&zRawSql[1], &idx);
70666 idx = nextIndex;
70675 idx = sqlite3VdbeParameterIndex(p, zRawSql, nToken);
70676 assert( idx>0 );
70679 nextIndex = idx + 1;
70680 assert( idx>0 && idx<=p->nVar );
70681 pVar = &p->aVar[idx-1];
72873 int idx;
72896 idx = aPermute ? aPermute[i] : i;
72897 assert( memIsValid(&aMem[p1+idx]) );
72898 assert( memIsValid(&aMem[p2+idx]) );
72899 REGISTER_TRACE(p1+idx, &aMem[p1+idx]);
72900 REGISTER_TRACE(p2+idx, &aMem[p2+idx]);
72904 iCompare = sqlite3MemCompare(&aMem[p1+idx], &aMem[p2+idx], pColl);
83880 pNewItem->idx = pOldItem->idx;
93000 static void sqliteViewResetAll(sqlite3 *db, int idx){
93002 assert( sqlite3SchemaMutexHeld(db, idx, 0) );
93003 if( !DbHasProperty(db, idx, DB_UnresetViews) ) return;
93004 for(i=sqliteHashFirst(&db->aDb[idx].pSchema->tblHash); i;i=sqliteHashNext(i)){
93012 DbClearProperty(db, idx, DB_UnresetViews);
100080 int i, j, idx; /* Loop counters */
100235 pColumn->a[i].idx = -1;
100240 pColumn->a[i].idx = j;
100461 if( pColumn->a[j].idx==i ) break;
100563 if( pColumn->a[j].idx==i ) break;
100630 for(idx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, idx++){
100631 sqlite3VdbeAddOp1(v, OP_Close, idx+iIdxCur);
116381 int idx;
116401 pTerm = &pWC->a[idx = pWC->nTerm++];
116411 return idx;
152207 static void tracePoint(RtreeSearchPoint *p, int idx, RtreeCursor *pCur){
152208 if( idx<0 ){ printf(" s"); }else{ printf("%2d", idx); }
152212 idx++;
152213 if( idx<RTREE_CACHE_SZ ){
152214 printf(" %p\n", pCur->aNode[idx]);
