Lines Matching refs:idx
8288 SQLITE_PRIVATE void sqlite3BtreeGetMeta(Btree *pBtree, int idx, u32 *pValue);
8289 SQLITE_PRIVATE int sqlite3BtreeUpdateMeta(Btree*, int idx, u32 value);
8297 ** offset = 36 + (idx * 4)
10689 ** CREATE INDEX idx ON t(a,b,c);
10692 ** The IdList.a.idx field is used when the IdList represents the list of
10697 ** If "a" is the k-th column of table "t", then IdList.a[0].idx==k.
10702 int idx; /* Index in some Table.aCol[] of a column named zName */
16815 ** structures, return a pointer to the idx-th such lik.
16817 #define MEM5LINK(idx) ((Mem5Link *)(&mem5.zPool[(idx)*mem5.szAtom]))
19537 int idx; /* A general purpose loop counter */
19642 for(idx=0; idx<ArraySize(fmtinfo); idx++){
19643 if( c==fmtinfo[idx].fmttype ){
19644 infop = &fmtinfo[idx];
19751 for(idx=precision-length; idx>0; idx--){
19782 for(idx=precision, rounder=0.4999; idx>0; idx--, rounder*=0.1);
19785 for(idx=precision, rounder=0.5; idx>0; idx--, rounder*=0.1){}
19936 for(idx=1; idx<precision; idx++) buf[idx] = (char)c;
46316 int idx; /* Value to write to hash-table slot */
46319 idx = iFrame - iZero;
46320 assert( idx <= HASHTABLE_NSLOT/2 + 1 );
46325 if( idx==1 ){
46336 if( aPgno[idx] ){
46338 assert( !aPgno[idx] );
46342 nCollide = idx;
46346 aPgno[idx] = iPage;
46347 aHash[iKey] = (ht_slot)idx;
46357 assert( nEntry==idx );
46365 if( (idx&0x3ff)==0 ){
46367 for(i=1; i<=idx; i++){
53572 ** pCur->idx is set to the cell index that contains the pointer
53574 ** right-most child page then pCur->idx is set to one more than
53882 int lwr, upr, idx;
53898 pCur->aiIdx[pCur->iPage] = (u16)(idx = upr);
53900 pCur->aiIdx[pCur->iPage] = (u16)(idx = (upr+lwr)/2);
53905 assert( idx==pCur->aiIdx[pCur->iPage] );
53907 pCell = findCell(pPage, idx) + pPage->childPtrSize;
53976 lwr = idx;
53985 lwr = idx+1;
53987 upr = idx-1;
53992 pCur->aiIdx[pCur->iPage] = (u16)(idx = (lwr+upr)/2);
54043 int idx;
54064 idx = ++pCur->aiIdx[pCur->iPage];
54067 /* If the database file is corrupt, it is possible for the value of idx
54072 testcase( idx>pPage->nCell );
54076 if( idx>=pPage->nCell ){
54140 int idx = pCur->aiIdx[pCur->iPage];
54141 rc = moveToChild(pCur, get4byte(findCell(pPage, idx)));
54835 static void dropCell(MemPage *pPage, int idx, int sz, int *pRC){
54845 assert( idx>=0 && idx<pPage->nCell );
54846 assert( sz==cellSize(pPage, idx) );
54850 ptr = &pPage->aCellIdx[2*idx];
54901 int idx = 0; /* Where to write new cell content in data[] */
54948 rc = allocateSpace(pPage, sz, &idx);
54952 assert( idx >= end+2 );
54953 assert( idx+sz <= (int)pPage->pBt->usableSize );
54956 memcpy(&data[idx+nSkip], pCell+nSkip, sz-nSkip);
54958 put4byte(&data[idx], iChild);
54967 put2byte(&data[ins], idx);
56132 int idx;
56197 idx = pCur->aiIdx[pCur->iPage];
56200 assert( idx<pPage->nCell );
56205 oldCell = findCell(pPage, idx);
56211 dropCell(pPage, idx, szOld, &rc);
56215 idx = ++pCur->aiIdx[pCur->iPage];
56219 insertCell(pPage, idx, newCell, szNew, 0, 0, &rc);
56756 SQLITE_PRIVATE void sqlite3BtreeGetMeta(Btree *p, int idx, u32 *pMeta){
56763 assert( idx>=0 && idx<=15 );
56765 *pMeta = get4byte(&pBt->pPage1->aData[36 + idx*4]);
56770 if( idx==BTREE_LARGEST_ROOT_PAGE && *pMeta>0 ){
56782 SQLITE_PRIVATE int sqlite3BtreeUpdateMeta(Btree *p, int idx, u32 iMeta){
56786 assert( idx>=1 && idx<=15 );
56793 put4byte(&pP1[36 + idx*4], iMeta);
56795 if( idx==BTREE_INCR_VACUUM ){
61214 ** Set the name of the idx'th column to be returned by the SQL statement.
61225 int idx, /* Index of column zName applies to */
61232 assert( idx<p->nResColumn );
61239 pColName = &(p->aColName[idx+var*p->nResColumn]);
62408 u32 idx; /* Offset in aKey[] to read from */
62415 idx = getVarint32(aKey, szHdr);
62418 while( idx<szHdr && u<p->nField && d<=nKey ){
62421 idx += getVarint32(&aKey[idx], serial_type);
64134 int idx = 0; /* Index of a host parameter */
64165 sqlite3GetInt32(&zRawSql[1], &idx);
64167 idx = nextIndex;
64174 idx = sqlite3VdbeParameterIndex(p, zRawSql, nToken);
64175 assert( idx>0 );
64178 nextIndex = idx + 1;
64179 assert( idx>0 && idx<=p->nVar );
64180 pVar = &p->aVar[idx-1];
65059 int idx;
66762 int idx;
66785 u.ak.idx = aPermute ? aPermute[u.ak.i] : u.ak.i;
66786 assert( memIsValid(&aMem[u.ak.p1+u.ak.idx]) );
66787 assert( memIsValid(&aMem[u.ak.p2+u.ak.idx]) );
66788 REGISTER_TRACE(u.ak.p1+u.ak.idx, &aMem[u.ak.p1+u.ak.idx]);
66789 REGISTER_TRACE(u.ak.p2+u.ak.idx, &aMem[u.ak.p2+u.ak.idx]);
66793 iCompare = sqlite3MemCompare(&aMem[u.ak.p1+u.ak.idx], &aMem[u.ak.p2+u.ak.idx], u.ak.pColl);
75333 pNewItem->idx = pOldItem->idx;
75854 int iDb; /* Database idx for pTab */
79280 ** CREATE TABLE sqlite_stat1(tbl, idx, stat);
79281 ** CREATE TABLE sqlite_stat2(tbl, idx, sampleno, sample);
79282 ** CREATE TABLE sqlite_stat3(tbl, idx, nEq, nLt, nDLt, sample);
79296 ** name in the idx column. The tbl column is the name of the table to
79314 ** If the sqlite_stat1.idx column is NULL, then the sqlite_stat1.stat
79324 ** the "idx" column and the "tbl" column is the name of the table to which
79351 ** The idx column names the index and the tbl column is the table of the
79352 ** index. If the idx and tbl columns are the same, then the sample is
79399 const char *zWhereType /* Either "tbl" or "idx" */
79405 idx,stat" },
79407 { "sqlite_stat3", "tbl,idx,neq,nlt,ndlt,sample" },
80013 openStatTable(pParse, iDb, iStatCur, pOnlyIdx->zName, "idx");
80190 int idx = 0; /* slot in pIdx->aSample[] for next sample */
80200 "SELECT idx,count(*) FROM %Q.sqlite_stat3"
80201 " GROUP BY idx", zDb);
80233 "SELECT idx,neq,nlt,ndlt,sample FROM %Q.sqlite_stat3", zDb);
80252 idx++;
80255 idx = 0;
80257 assert( idx<pIdx->nSample );
80258 pSample = &pIdx->aSample[idx];
80262 if( idx==pIdx->nSample-1 ){
80264 for(i=0, sumEq=0; i<=idx-1; i++) sumEq += pIdx->aSample[i].nEq;
80358 "SELECT tbl,idx,stat FROM %Q.sqlite_stat1", sInfo.zDatabase);
83029 ** Clear the column names from every VIEW in database idx.
83031 static void sqliteViewResetAll(sqlite3 *db, int idx){
83033 assert( sqlite3SchemaMutexHeld(db, idx, 0) );
83034 if( !DbHasProperty(db, idx, DB_UnresetViews) ) return;
83035 for(i=sqliteHashFirst(&db->aDb[idx].pSchema->tblHash); i;i=sqliteHashNext(i)){
83043 DbClearProperty(db, idx, DB_UnresetViews);
83185 const char *zType, /* "idx" or "tbl" */
84228 sqlite3ClearStatTables(pParse, iDb, "idx", pIndex->zName);
86102 int idx = pIdx->aiColumn[j];
86103 if( idx==pTab->iPKey ){
86106 sqlite3VdbeAddOp3(v, OP_Column, iCur, idx, regBase+j);
86107 sqlite3ColumnDefault(v, pTab, idx, -1);
88745 int iFromCol; /* Idx of column in child table */
89408 int i, j, idx; /* Loop counters */
89676 pColumn->a[i].idx = -1;
89681 pColumn->a[i].idx = j;
89809 if( pColumn->a[j].idx==i ) break;
89913 if( pColumn->a[j].idx==i ) break;
89979 for(idx=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, idx++){
89980 sqlite3VdbeAddOp1(v, OP_Close, idx+baseCur);
90286 int idx = pIdx->aiColumn[i];
90287 if( idx==pTab->iPKey ){
90290 sqlite3VdbeAddOp2(v, OP_SCopy, regData+idx, regIdx+i);
90395 int useSeekResult /* True to set the USESEEKRESULT flag on OP_[Idx]Insert */
102583 ** WhereTerm.pWC->a[WhereTerm.idx] == WhereTerm
102882 int idx;
102901 pTerm = &pWC->a[idx = pWC->nTerm++];
102906 return idx;
116044 ** idx - index within level
116045 ** - (level,idx uniquely identify a segment)
116062 ** incrementing idx. When idx reaches MERGE_COUNT (default 16), all
117253 "idx INTEGER,"
117258 "PRIMARY KEY(level, idx)"
125320 /* 8 */ "SELECT (SELECT max(idx) FROM %Q.'%q_segdir' WHERE level = ?) + 1",
125326 /* 12 */ "SELECT idx, start_block, leaves_end_block, end_block, root "
125327 "FROM %Q.'%q_segdir' WHERE level = ? ORDER BY idx ASC",
125328 /* 13 */ "SELECT idx, start_block, leaves_end_block, end_block, root "
125330 "ORDER BY level DESC, idx ASC",
125544 ** 0: idx
126056 ** SELECT max(idx) FROM %_segdir WHERE level = :iLevel
126073 sqlite3_stmt *pNextIdx; /* Query for next idx at level iLevel */
126850 int iIdx, /* Value for "idx" field */
127244 int iIdx /* Value for 'idx' column of %_segdir */
127900 ** index. The idx of the new segment is always 0. */
