Home | History | Annotate | Download | only in orig

Lines Matching defs:iRowid

7589   sqlite3_int64 iRowid;             /* Rowid for current entry */
40039 ** Check to see if element iRowid was inserted into the rowset as
40046 SQLITE_PRIVATE int sqlite3RowSetTest(RowSet *pRowSet, int iBatch, sqlite3_int64 iRowid){
40088 /* Test to see if the iRowid value appears anywhere in the forest.
40094 if( p->v<iRowid ){
40096 }else if( p->v>iRowid ){
83683 i64 iRowid; /* Rowid in main table of the key */
83739 static void sampleSetRowidInt64(sqlite3 *db, Stat4Sample *p, i64 iRowid){
83743 p->u.iRowid = iRowid;
83762 sampleSetRowidInt64(p->db, pTo, pFrom->u.iRowid);
84286 sqlite3_result_int64(context, pS->u.iRowid);
132670 sqlite3_int64 iRowid; /* Current rowid */
132907 pCsr->iRowid++;
133144 *pRowid = pCsr->iRowid;
136309 int iRowid; /* Current 'rowid' value */
136536 pCsr->iRowid = 0;
136558 pCsr->iRowid++;
136657 *pRowid = (sqlite3_int64)pCsr->iRowid;
144955 i64 iRowid; /* Node or entry ID */
145249 p += writeInt64(p, pCell->iRowid);
145385 pCell->iRowid = nodeGetRowid(pRtree, pNode, iCell);
145613 pInfo->iRowid = readInt64(pCellData);
145711 ** integer value equal to iRowid. Return the index of this cell.
145716 i64 iRowid,
145723 if( nodeGetRowid(pRtree, pNode, ii)==iRowid ){
146090 ** rowid iRowid. If successful, set *ppLeaf to point to the node and
146097 i64 iRowid, /* The rowid searching for */
146103 sqlite3_bind_int64(pRtree->pReadRowid, 1, iRowid);
146192 i64 iRowid = sqlite3_value_int64(argv[0]);
146194 rc = findLeafNode(pRtree, iRowid, &pLeaf, &iNode);
146201 rc = nodeRowidIndex(pRtree, pLeaf, iRowid, &iCell);
146531 iBest = cell.iRowid;
146577 ** Write mapping (iRowid->iNode) to the <rtree>_rowid table.
146579 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
146580 sqlite3_bind_int64(pRtree->pWriteRowid, 1, iRowid);
146841 i64 iRowid,
146848 RtreeNode *pChild = nodeHashLookup(pRtree, iRowid);
146855 return xSetMapping(pRtree, iRowid, pNode->iNode);
146932 rightbbox.iRowid = pRight->iNode;
146933 leftbbox.iRowid = pLeft->iNode;
146957 i64 iRowid = nodeGetRowid(pRtree, pRight, i);
146958 rc = updateMapping(pRtree, iRowid, pRight, iHeight);
146959 if( iRowid==pCell->iRowid ){
146968 i64 iRowid = nodeGetRowid(pRtree, pLeft, i);
146969 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
146975 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
147099 box.iRowid = pNode->iNode;
147213 if( p->iRowid==pCell->iRowid ){
147215 rc = rowidWrite(pRtree, p->iRowid, pNode->iNode);
147217 rc = parentWrite(pRtree, p->iRowid, pNode->iNode);
147257 RtreeNode *pChild = nodeHashLookup(pRtree, pCell->iRowid);
147275 rc = rowidWrite(pRtree, pCell->iRowid, pNode->iNode);
147277 rc = parentWrite(pRtree, pCell->iRowid, pNode->iNode);
147496 cell.iRowid = sqlite3_value_int64(azData[2]);
147498 || sqlite3_value_int64(azData[0])!=cell.iRowid
147501 sqlite3_bind_int64(pRtree->pReadRowid, 1, cell.iRowid);
147506 rc = rtreeDeleteRowid(pRtree, cell.iRowid);
147535 rc = newRowid(pRtree, &cell.iRowid);
147537 *pRowid = cell.iRowid;
147924 sqlite3_snprintf(512-nCell,&zCell[nCell],"%lld", cell.iRowid);