Lines Matching refs:idx
6941 SQLITE_PRIVATE void sqlite3BtreeGetMeta(Btree *pBtree, int idx, u32 *pValue);
6942 SQLITE_PRIVATE int sqlite3BtreeUpdateMeta(Btree*, int idx, u32 value);
6950 ** offset = 36 + (idx * 4)
9257 ** CREATE INDEX idx ON t(a,b,c);
9260 ** The IdList.a.idx field is used when the IdList represents the list of
9265 ** If "a" is the k-th column of table "t", then IdList.a[0].idx==k.
9270 int idx; /* Index in some Table.aCol[] of a column named zName */
13944 ** structures, return a pointer to the idx-th such lik.
13946 #define MEM5LINK(idx) ((Mem5Link *)(&mem5.zPool[(idx)*mem5.szAtom]))
16560 int idx; /* A general purpose loop counter */
16668 for(idx=0; idx<ArraySize(fmtinfo); idx++){
16669 if( c==fmtinfo[idx].fmttype ){
16670 infop = &fmtinfo[idx];
16769 for(idx=precision-length; idx>0; idx--){
16799 for(idx=precision, rounder=0.4999; idx>0; idx--, rounder*=0.1);
16802 for(idx=precision, rounder=0.5; idx>0; idx--, rounder*=0.1){}
16946 for(idx=1; idx<precision; idx++) buf[idx] = (char)c;
37083 u16 idx; /* Insert this cell before idx-th non-overflow cell */
38633 k = pOvfl->idx;
41784 ** pCur->idx is set to the cell index that contains the pointer
41786 ** right-most child page then pCur->idx is set to one more than
42103 int idx = pCur->aiIdx[pCur->iPage]; /* Index of current cell in pPage */
42107 pCell = findCell(pPage, idx) + pPage->childPtrSize;
42171 lwr = idx;
42181 lwr = idx+1;
42183 upr = idx-1;
42239 int idx;
42260 idx = ++pCur->aiIdx[pCur->iPage];
42262 assert( idx<=pPage->nCell );
42266 if( idx>=pPage->nCell ){
42330 int idx = pCur->aiIdx[pCur->iPage];
42331 rc = moveToChild(pCur, get4byte(findCell(pPage, idx)));
43004 static void dropCell(MemPage *pPage, int idx, int sz, int *pRC){
43014 assert( idx>=0 && idx<pPage->nCell );
43015 assert( sz==cellSize(pPage, idx) );
43019 ptr = &data[pPage->cellOffset + 2*idx];
43033 for(i=idx+1; i<pPage->nCell; i++, ptr+=2){
43068 int idx; /* Where to write new cell content in data[] */
43101 pPage->aOvfl[j].idx = (u16)i;
43113 rc = allocateSpace(pPage, sz, &idx);
43117 assert( idx >= end+2 );
43118 assert( idx+sz <= pPage->pBt->usableSize );
43121 memcpy(&data[idx+nSkip], pCell+nSkip, sz-nSkip);
43123 put4byte(&data[idx], iChild);
43129 put2byte(&data[ins], idx);
43490 assert( pParent->nOverflow==0 || pParent->aOvfl[0].idx==iParentIdx );
43537 if( i+nxDiv==pParent->aOvfl[0].idx && pParent->nOverflow ){
43954 int iOverflow = (nOverflow ? pOld->aOvfl[0].idx : -1);
43967 iOverflow = i + !leafData + pOld->aOvfl[0].idx;
43973 assert(nOverflow<2 || pOld->aOvfl[0].idx==pOld->aOvfl[1].idx-1);
43974 assert(nOverflow<3 || pOld->aOvfl[1].idx==pOld->aOvfl[2].idx-1);
44158 && pPage->aOvfl[0].idx==pPage->nCell
44262 int idx;
44326 idx = pCur->aiIdx[pCur->iPage];
44329 assert( idx<pPage->nCell );
44334 oldCell = findCell(pPage, idx);
44340 dropCell(pPage, idx, szOld, &rc);
44344 idx = ++pCur->aiIdx[pCur->iPage];
44348 insertCell(pPage, idx, newCell, szNew, 0, 0, &rc);
44872 SQLITE_PRIVATE void sqlite3BtreeGetMeta(Btree *p, int idx, u32 *pMeta){
44879 assert( idx>=0 && idx<=15 );
44881 *pMeta = get4byte(&pBt->pPage1->aData[36 + idx*4]);
44886 if( idx==BTREE_LARGEST_ROOT_PAGE && *pMeta>0 ) pBt->readOnly = 1;
44896 SQLITE_PRIVATE int sqlite3BtreeUpdateMeta(Btree *p, int idx, u32 iMeta){
44900 assert( idx>=1 && idx<=15 );
44907 put4byte(&pP1[36 + idx*4], iMeta);
44909 if( idx==BTREE_INCR_VACUUM ){
48999 ** Set the name of the idx'th column to be returned by the SQL statement.
49010 int idx, /* Index of column zName applies to */
49017 assert( idx<p->nResColumn );
49024 pColName = &(p->aColName[idx+var*p->nResColumn]);
50131 u32 idx;
50158 idx = getVarint32(aKey, szHdr);
50161 while( idx<szHdr && u<p->nField && d<=nKey ){
50164 idx += getVarint32(&aKey[idx], serial_type);
51848 int idx = 0; /* Index of a host parameter */
51871 sqlite3GetInt32(&zRawSql[1], &idx);
51873 idx = nextIndex;
51880 idx = sqlite3VdbeParameterIndex(p, zRawSql, nToken);
51881 assert( idx>0 );
51884 nextIndex = idx + 1;
51885 assert( idx>0 && idx<=p->nVar );
51886 pVar = &p->aVar[idx-1];
52635 int idx;
54251 int idx;
54274 u.aj.idx = aPermute ? aPermute[u.aj.i] : u.aj.i;
54275 REGISTER_TRACE(u.aj.p1+u.aj.idx, &aMem[u.aj.p1+u.aj.idx]);
54276 REGISTER_TRACE(u.aj.p2+u.aj.idx, &aMem[u.aj.p2+u.aj.idx]);
54280 iCompare = sqlite3MemCompare(&aMem[u.aj.p1+u.aj.idx], &aMem[u.aj.p2+u.aj.idx], u.aj.pColl);
61427 pNewItem->idx = pOldItem->idx;
61945 int iDb; /* Database idx for pTab */
65078 { "sqlite_stat1", "tbl,idx,stat" },
65080 { "sqlite_stat2", "tbl,idx,sampleno,sample" },
65593 "SELECT idx, stat FROM %Q.sqlite_stat1", sInfo.zDatabase);
65611 "SELECT idx,sampleno,sample FROM %Q.sqlite_stat2", sInfo.zDatabase);
68291 ** Clear the column names from every VIEW in database idx.
68293 static void sqliteViewResetAll(sqlite3 *db, int idx){
68295 if( !DbHasProperty(db, idx, DB_UnresetViews) ) return;
68296 for(i=sqliteHashFirst(&db->aDb[idx].pSchema->tblHash); i;i=sqliteHashNext(i)){
68302 DbClearProperty(db, idx, DB_UnresetViews);
69398 "DELETE FROM %Q.sqlite_stat1 WHERE idx=%Q",
71251 int idx = pIdx->aiColumn[j];
71252 if( idx==pTab->iPKey ){
71255 sqlite3VdbeAddOp3(v, OP_Column, iCur, idx, regBase+j);
71256 sqlite3ColumnDefault(v, pTab, idx, -1);
73768 int iFromCol; /* Idx of column in child table */
74428 int i, j, idx; /* Loop counters */
74697 pColumn->a[i].idx = -1;
74702 pColumn->a[i].idx = j;
74831 if( pColumn->a[j].idx==i ) break;
74935 if( pColumn->a[j].idx==i ) break;
75000 for(idx=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, idx++){
75001 sqlite3VdbeAddOp1(v, OP_Close, idx+baseCur);
75292 int idx = pIdx->aiColumn[i];
75293 if( idx==pTab->iPKey ){
75296 sqlite3VdbeAddOp2(v, OP_SCopy, regData+idx, regIdx+i);
75401 int useSeekResult /* True to set the USESEEKRESULT flag on OP_[Idx]Insert */
86793 ** WhereTerm.pWC->a[WhereTerm.idx] == WhereTerm
87070 int idx;
87088 pTerm = &pWC->a[idx = pWC->nTerm++];
87093 return idx;
89216 "tbl=%s idx=%s nEq=%d nInMul=%d nBound=%d bSort=%d bLookup=%d"
98325 ** idx - index within level
98326 ** - (level,idx uniquely identify a segment)
98343 ** incrementing idx. When idx reaches MERGE_COUNT (default 16), all
99223 "idx INTEGER,"
99228 "PRIMARY KEY(level, idx)"
104008 /* 6 */ "SELECT coalesce(max(idx)+1, 0) FROM %Q.'%q_segdir' WHERE level=?",
104014 /* 10 */ "SELECT idx, start_block, leaves_end_block, end_block, root "
104015 "FROM %Q.'%q_segdir' WHERE level = ? ORDER BY idx ASC",
104016 idx, start_block, leaves_end_block, end_block, root "
104017 "FROM %Q.'%q_segdir' ORDER BY level DESC, idx ASC",
104143 ** 0: idx
104509 ** SELECT max(idx) FROM %_segdir WHERE level = :iLevel
104520 sqlite3_stmt *pNextIdx; /* Query for next idx at level iLevel */
104894 ** idx, -- col 0
105072 int iIdx, /* Value for "idx" field */
105466 int iIdx /* Value for 'idx' column of %_segdir */
105992 int idx; /* Index of new segment created */
106009 rc = fts3AllocateSegdirIdx(p, 0, &idx);
106031 rc = fts3SegWriterFlush(p, pWriter, 0, idx);
