Home | History | Annotate | Download | only in dist

Lines Matching refs:iRowid

38288 ** Check to see if element iRowid was inserted into the the rowset as
38291 SQLITE_PRIVATE int sqlite3RowSetTest(RowSet *pRowSet, u8 iBatch, sqlite3_int64 iRowid){
38304 if( p->v<iRowid ){
38306 }else if( p->v>iRowid ){
52939 ** set to iRowid.
52948 SQLITE_PRIVATE void sqlite3BtreeSetCachedRowid(BtCursor *pCur, sqlite3_int64 iRowid){
52951 if( p->pgnoRoot==pCur->pgnoRoot ) p->cachedRowid = iRowid;
52953 assert( pCur->cachedRowid==iRowid );
79521 i64 iRowid; /* Rowid in main table of the key */
79628 pSample->iRowid = rowid;
79696 case 2: sqlite3_result_int64(context, p->a[n].iRowid); break;
85874 int iRowid = ++pParse->nMem; /* Used for storing rowid values. */
85884 regRowid = sqlite3ExprCodeGetColumn(pParse, pTab, -1, iCur, iRowid);
85904 addr = sqlite3VdbeAddOp3(v, OP_RowSetRead, iRowSet, end, iRowid);
85911 sqlite3VdbeAddOp4(v, OP_VUpdate, 0, 1, iRowid, pVTab, P4_VTAB);
85918 sqlite3GenerateRowDelete(pParse, pTab, iCur, iRowid, count, pTrigger, OE_Default);
85982 ** memory cell iRowid.
85991 int iRowid, /* Memory cell that contains the rowid to delete */
86007 sqlite3VdbeAddOp3(v, OP_NotExists, iCur, iLabel, iRowid);
86026 sqlite3VdbeAddOp2(v, OP_Copy, iRowid, iOld);
86042 sqlite3VdbeAddOp3(v, OP_NotExists, iCur, iLabel, iRowid);
121893 sqlite3_int64 iRowid; /* Current rowid */
122102 pCsr->iRowid++;
122292 *pRowid = pCsr->iRowid;
130432 i64 iRowid;
130721 p += writeInt64(p, pCell->iRowid);
130858 pCell->iRowid = nodeGetRowid(pRtree, pNode, iCell);
131162 sqlite3_int64 iRowid;
131178 iRowid = nodeGetRowid(pRtree, pCursor->pNode, pCursor->iCell);
131179 rc = nodeAcquire(pRtree, iRowid, pCursor->pNode, &pChild);
131210 ** integer value equal to iRowid. Return the index of this cell.
131215 i64 iRowid,
131221 if( nodeGetRowid(pRtree, pNode, ii)==iRowid ){
131308 i64 iRowid = nodeGetRowid(pRtree, pCsr->pNode, pCsr->iCell);
131309 sqlite3_result_int64(ctx, iRowid);
131326 ** rowid iRowid. If successful, set *ppLeaf to point to the node and
131331 static int findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf){
131334 sqlite3_bind_int64(pRtree->pReadRowid, 1, iRowid);
131414 i64 iRowid = sqlite3_value_int64(argv[0]);
131415 rc = findLeafNode(pRtree, iRowid, &pLeaf);
131419 rc = nodeRowidIndex(pRtree, pLeaf, iRowid, &pCsr->iCell);
131795 iBest = cell.iRowid;
131841 ** Write mapping (iRowid->iNode) to the <rtree>_rowid table.
131843 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
131844 sqlite3_bind_int64(pRtree->pWriteRowid, 1, iRowid);
132311 i64 iRowid,
132318 RtreeNode *pChild = nodeHashLookup(pRtree, iRowid);
132325 return xSetMapping(pRtree, iRowid, pNode->iNode);
132401 rightbbox.iRowid = pRight->iNode;
132402 leftbbox.iRowid = pLeft->iNode;
132426 i64 iRowid = nodeGetRowid(pRtree, pRight, i);
132427 rc = updateMapping(pRtree, iRowid, pRight, iHeight);
132428 if( iRowid==pCell->iRowid ){
132437 i64 iRowid = nodeGetRowid(pRtree, pLeft, i);
132438 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
132444 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
132568 box.iRowid = pNode->iNode;
132680 if( p->iRowid==pCell->iRowid ){
132682 rc = rowidWrite(pRtree, p->iRowid, pNode->iNode);
132684 rc = parentWrite(pRtree, p->iRowid, pNode->iNode);
132724 RtreeNode *pChild = nodeHashLookup(pRtree, pCell->iRowid);
132746 rc = rowidWrite(pRtree, pCell->iRowid, pNode->iNode);
132748 rc = parentWrite(pRtree, pCell->iRowid, pNode->iNode);
132934 cell.iRowid = sqlite3_value_int64(azData[2]);
132936 || sqlite3_value_int64(azData[0])!=cell.iRowid
132939 sqlite3_bind_int64(pRtree->pReadRowid, 1, cell.iRowid);
132944 rc = rtreeDeleteRowid(pRtree, cell.iRowid);
132973 rc = newRowid(pRtree, &cell.iRowid);
132975 *pRowid = cell.iRowid;
133315 sqlite3_snprintf(512-nCell,&zCell[nCell],"%lld", cell.iRowid);