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;
46327 int idx; /* Value to write to hash-table slot */
46330 idx = iFrame - iZero;
46331 assert( idx <= HASHTABLE_NSLOT/2 + 1 );
46336 if( idx==1 ){
46347 if( aPgno[idx] ){
46349 assert( !aPgno[idx] );
46353 nCollide = idx;
46357 aPgno[idx] = iPage;
46358 aHash[iKey] = (ht_slot)idx;
46368 assert( nEntry==idx );
46376 if( (idx&0x3ff)==0 ){
46378 for(i=1; i<=idx; i++){
53583 ** pCur->idx is set to the cell index that contains the pointer
53585 ** right-most child page then pCur->idx is set to one more than
53893 int lwr, upr, idx;
53909 pCur->aiIdx[pCur->iPage] = (u16)(idx = upr);
53911 pCur->aiIdx[pCur->iPage] = (u16)(idx = (upr+lwr)/2);
53916 assert( idx==pCur->aiIdx[pCur->iPage] );
53918 pCell = findCell(pPage, idx) + pPage->childPtrSize;
53987 lwr = idx;
53996 lwr = idx+1;
53998 upr = idx-1;
54003 pCur->aiIdx[pCur->iPage] = (u16)(idx = (lwr+upr)/2);
54054 int idx;
54075 idx = ++pCur->aiIdx[pCur->iPage];
54078 /* If the database file is corrupt, it is possible for the value of idx
54083 testcase( idx>pPage->nCell );
54087 if( idx>=pPage->nCell ){
54151 int idx = pCur->aiIdx[pCur->iPage];
54152 rc = moveToChild(pCur, get4byte(findCell(pPage, idx)));
54846 static void dropCell(MemPage *pPage, int idx, int sz, int *pRC){
54856 assert( idx>=0 && idx<pPage->nCell );
54857 assert( sz==cellSize(pPage, idx) );
54861 ptr = &pPage->aCellIdx[2*idx];
54912 int idx = 0; /* Where to write new cell content in data[] */
54959 rc = allocateSpace(pPage, sz, &idx);
54963 assert( idx >= end+2 );
54964 assert( idx+sz <= (int)pPage->pBt->usableSize );
54967 memcpy(&data[idx+nSkip], pCell+nSkip, sz-nSkip);
54969 put4byte(&data[idx], iChild);
54978 put2byte(&data[ins], idx);
56143 int idx;
56208 idx = pCur->aiIdx[pCur->iPage];
56211 assert( idx<pPage->nCell );
56216 oldCell = findCell(pPage, idx);
56222 dropCell(pPage, idx, szOld, &rc);
56226 idx = ++pCur->aiIdx[pCur->iPage];
56230 insertCell(pPage, idx, newCell, szNew, 0, 0, &rc);
56767 SQLITE_PRIVATE void sqlite3BtreeGetMeta(Btree *p, int idx, u32 *pMeta){
56774 assert( idx>=0 && idx<=15 );
56776 idx*4]);
56781 if( idx==BTREE_LARGEST_ROOT_PAGE && *pMeta>0 ){
56793 SQLITE_PRIVATE int sqlite3BtreeUpdateMeta(Btree *p, int idx, u32 iMeta){
56797 assert( idx>=1 && idx<=15 );
56804 put4byte(&pP1[36 + idx*4], iMeta);
56806 if( idx==BTREE_INCR_VACUUM ){
61225 ** Set the name of the idx'th column to be returned by the SQL statement.
61236 int idx, /* Index of column zName applies to */
61243 assert( idx<p->nResColumn );
61250 pColName = &(p->aColName[idx+var*p->nResColumn]);
62419 u32 idx; /* Offset in aKey[] to read from */
62426 idx = getVarint32(aKey, szHdr);
62429 while( idx<szHdr && u<p->nField && d<=nKey ){
62432 idx += getVarint32(&aKey[idx], serial_type);
64145 int idx = 0; /* Index of a host parameter */
64176 sqlite3GetInt32(&zRawSql[1], &idx);
64178 idx = nextIndex;
64185 idx = sqlite3VdbeParameterIndex(p, zRawSql, nToken);
64186 assert( idx>0 );
64189 nextIndex = idx + 1;
64190 assert( idx>0 && idx<=p->nVar );
64191 pVar = &p->aVar[idx-1];
65070 int idx;
66773 int idx;
66796 u.ak.idx = aPermute ? aPermute[u.ak.i] : u.ak.i;
66797 assert( memIsValid(&aMem[u.ak.p1+u.ak.idx]) );
66798 assert( memIsValid(&aMem[u.ak.p2+u.ak.idx]) );
66799 REGISTER_TRACE(u.ak.p1+u.ak.idx, &aMem[u.ak.p1+u.ak.idx]);
66800 REGISTER_TRACE(u.ak.p2+u.ak.idx, &aMem[u.ak.p2+u.ak.idx]);
66804 iCompare = sqlite3MemCompare(&aMem[u.ak.p1+u.ak.idx], &aMem[u.ak.p2+u.ak.idx], u.ak.pColl);
75344 pNewItem->idx = pOldItem->idx;
75865 int iDb; /* Database idx for pTab */
79291 ** CREATE TABLE sqlite_stat1(tbl, idx, stat);
79292 ** CREATE TABLE sqlite_stat2(tbl, idx, sampleno, sample);
79293 ** CREATE TABLE sqlite_stat3(tbl, idx, nEq, nLt, nDLt, sample);
79307 ** name in the idx column. The tbl column is the name of the table to
79325 ** If the sqlite_stat1.idx column is NULL, then the sqlite_stat1.stat
79335 ** the "idx" column and the "tbl" column is the name of the table to which
79362 ** The idx column names the index and the tbl column is the table of the
79363 ** index. If the idx and tbl columns are the same, then the sample is
79410 const char *zWhereType /* Either "tbl" or "idx" */
79416 { "sqlite_stat1", "tbl,idx,stat" },
79418 { "sqlite_stat3", "tbl,idx,neq,nlt,ndlt,sample" },
80024 openStatTable(pParse, iDb, iStatCur, pOnlyIdx->zName, "idx");
80201 int idx = 0; /* slot in pIdx->aSample[] for next sample */
80211 "SELECT idx,count(*) FROM %Q.sqlite_stat3"
80212 " GROUP BY idx", zDb);
80244 "SELECT idx,neq,nlt,ndlt,sample FROM %Q.sqlite_stat3", zDb);
80263 idx++;
80266 idx = 0;
80268 assert( idx<pIdx->nSample );
80269 pSample = &pIdx->aSample[idx];
80273 if( idx==pIdx->nSample-1 ){
80275 for(i=0, sumEq=0; i<=idx-1; i++) sumEq += pIdx->aSample[i].nEq;
80369 "SELECT tbl,idx,stat FROM %Q.sqlite_stat1", sInfo.zDatabase);
83040 ** Clear the column names from every VIEW in database idx.
83042 static void sqliteViewResetAll(sqlite3 *db, int idx){
83044 assert( sqlite3SchemaMutexHeld(db, idx, 0) );
83045 if( !DbHasProperty(db, idx, DB_UnresetViews) ) return;
83046 for(i=sqliteHashFirst(&db->aDb[idx].pSchema->tblHash); i;i=sqliteHashNext(i)){
83054 DbClearProperty(db, idx, DB_UnresetViews);
83196 const char *zType, /* "idx" or "tbl" */
84239 sqlite3ClearStatTables(pParse, iDb, "idx", pIndex->zName);
86113 int idx = pIdx->aiColumn[j];
86114 if( idx==pTab->iPKey ){
86117 sqlite3VdbeAddOp3(v, OP_Column, iCur, idx, regBase+j);
86118 sqlite3ColumnDefault(v, pTab, idx, -1);
88756 int iFromCol; /* Idx of column in child table */
89419 int i, j, idx; /* Loop counters */
89687 pColumn->a[i].idx = -1;
89692 pColumn->a[i].idx = j;
89820 if( pColumn->a[j].idx==i ) break;
89924 if( pColumn->a[j].idx==i ) break;
89990 for(idx=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, idx++){
89991 sqlite3VdbeAddOp1(v, OP_Close, idx+baseCur);
90297 int idx = pIdx->aiColumn[i];
90298 if( idx==pTab->iPKey ){
90301 sqlite3VdbeAddOp2(v, OP_SCopy, regData+idx, regIdx+i);
90406 int useSeekResult /* True to set the USESEEKRESULT flag on OP_[Idx]Insert */
102594 ** WhereTerm.pWC->a[WhereTerm.idx] == WhereTerm
102893 int idx;
102912 pTerm = &pWC->a[idx = pWC->nTerm++];
102917 return idx;
116070 ** idx - index within level
116071 ** - (level,idx uniquely identify a segment)
116088 ** incrementing idx. When idx reaches MERGE_COUNT (default 16), all
117279 "idx INTEGER,"
117284 "PRIMARY KEY(level, idx)"
125349 /* 8 */ "SELECT (SELECT max(idx) FROM %Q.'%q_segdir' WHERE level = ?) + 1",
125355 /* 12 */ "SELECT idx, start_block, leaves_end_block, end_block, root "
125356 "FROM %Q.'%q_segdir' WHERE level = ? ORDER BY idx ASC",
125357 /* 13 */ "SELECT idx, start_block, leaves_end_block, end_block, root "
125359 "ORDER BY level DESC, idx ASC",
125573 ** 0: idx
126085 ** SELECT max(idx) FROM %_segdir WHERE level = :iLevel
126102 sqlite3_stmt *pNextIdx; /* Query for next idx at level iLevel */
126879 int iIdx, /* Value for "idx" field */
127273 int iIdx /* Value for 'idx' column of %_segdir */
127929 ** index. The idx of the new segment is always 0. */
