Home | History | Annotate | Download | only in orig

Lines Matching defs:iRowid

38260 ** Check to see if element iRowid was inserted into the the rowset as
38263 SQLITE_PRIVATE int sqlite3RowSetTest(RowSet *pRowSet, u8 iBatch, sqlite3_int64 iRowid){
38276 if( p->v<iRowid ){
38278 }else if( p->v>iRowid ){
52911 ** set to iRowid.
52920 SQLITE_PRIVATE void sqlite3BtreeSetCachedRowid(BtCursor *pCur, sqlite3_int64 iRowid){
52923 if( p->pgnoRoot==pCur->pgnoRoot ) p->cachedRowid = iRowid;
52925 assert( pCur->cachedRowid==iRowid );
79485 i64 iRowid; /* Rowid in main table of the key */
79592 pSample->iRowid = rowid;
79660 case 2: sqlite3_result_int64(context, p->a[n].iRowid); break;
85838 int iRowid = ++pParse->nMem; /* Used for storing rowid values. */
85848 regRowid = sqlite3ExprCodeGetColumn(pParse, pTab, -1, iCur, iRowid);
85868 addr = sqlite3VdbeAddOp3(v, OP_RowSetRead, iRowSet, end, iRowid);
85875 sqlite3VdbeAddOp4(v, OP_VUpdate, 0, 1, iRowid, pVTab, P4_VTAB);
85882 sqlite3GenerateRowDelete(pParse, pTab, iCur, iRowid, count, pTrigger, OE_Default);
85946 ** memory cell iRowid.
85955 int iRowid, /* Memory cell that contains the rowid to delete */
85971 sqlite3VdbeAddOp3(v, OP_NotExists, iCur, iLabel, iRowid);
85990 sqlite3VdbeAddOp2(v, OP_Copy, iRowid, iOld);
86006 sqlite3VdbeAddOp3(v, OP_NotExists, iCur, iLabel, iRowid);
121845 sqlite3_int64 iRowid; /* Current rowid */
122054 pCsr->iRowid++;
122244 *pRowid = pCsr->iRowid;
130384 i64 iRowid;
130673 p += writeInt64(p, pCell->iRowid);
130810 pCell->iRowid
131114 sqlite3_int64 iRowid;
131130 iRowid = nodeGetRowid(pRtree, pCursor->pNode, pCursor->iCell);
131131 rc = nodeAcquire(pRtree, iRowid, pCursor->pNode, &pChild);
131162 ** integer value equal to iRowid. Return the index of this cell.
131167 i64 iRowid,
131173 if( nodeGetRowid(pRtree, pNode, ii)==iRowid ){
131260 i64 iRowid = nodeGetRowid(pRtree, pCsr->pNode, pCsr->iCell);
131261 sqlite3_result_int64(ctx, iRowid);
131278 ** rowid iRowid. If successful, set *ppLeaf to point to the node and
131283 static int findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf){
131286 sqlite3_bind_int64(pRtree->pReadRowid, 1, iRowid);
131366 i64 iRowid = sqlite3_value_int64(argv[0]);
131367 rc = findLeafNode(pRtree, iRowid, &pLeaf);
131371 rc = nodeRowidIndex(pRtree, pLeaf, iRowid, &pCsr->iCell);
131747 iBest = cell.iRowid;
131793 ** Write mapping (iRowid->iNode) to the <rtree>_rowid table.
131795 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
131796 sqlite3_bind_int64(pRtree->pWriteRowid, 1, iRowid);
132263 i64 iRowid,
132270 RtreeNode *pChild = nodeHashLookup(pRtree, iRowid);
132277 return xSetMapping(pRtree, iRowid, pNode->iNode);
132353 rightbbox.iRowid = pRight->iNode;
132354 leftbbox.iRowid = pLeft->iNode;
132378 i64 iRowid = nodeGetRowid(pRtree, pRight, i);
132379 rc = updateMapping(pRtree, iRowid, pRight, iHeight);
132380 if( iRowid==pCell->iRowid ){
132389 i64 iRowid = nodeGetRowid(pRtree, pLeft, i);
132390 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
132396 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
132520 box.iRowid = pNode->iNode;
132632 if( p->iRowid==pCell->iRowid ){
132634 rc = rowidWrite(pRtree, p->iRowid, pNode->iNode);
132636 rc = parentWrite(pRtree, p->iRowid, pNode->iNode);
132676 RtreeNode *pChild = nodeHashLookup(pRtree, pCell->iRowid);
132698 rc = rowidWrite(pRtree, pCell->iRowid, pNode->iNode);
132700 rc = parentWrite(pRtree, pCell->iRowid, pNode->iNode);
132886 cell.iRowid = sqlite3_value_int64(azData[2]);
132888 || sqlite3_value_int64(azData[0])!=cell.iRowid
132891 sqlite3_bind_int64(pRtree->pReadRowid, 1, cell.iRowid);
132896 rc = rtreeDeleteRowid(pRtree, cell.iRowid);
132925 rc = newRowid(pRtree, &cell.iRowid);
132927 *pRowid = cell.iRowid;
133267 sqlite3_snprintf(512-nCell,&zCell[nCell],"%lld", cell.iRowid);