218470   i64 iNode;                  /* The node number */  member
218742 static unsigned int nodeHash(i64 iNode){  argument
218743   return ((unsigned)iNode) % HASHSIZE;
218750 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){  argument
218752   for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
218762   iHash = nodeHash(pNode->iNode);
218772   if( pNode->iNode!=0 ){
218773     pp = &pRtree->aHash[nodeHash(pNode->iNode)];
218815   i64 iNode,                 /* Node number to load */  argument
218825   if( (pNode = nodeHashLookup(pRtree, iNode))!=0 ){
218838     rc = sqlite3_blob_reopen(pBlob, iNode);
218847                            "data", iNode, 0,
218867       pNode->iNode = iNode;
218881   if( rc==SQLITE_OK && pNode && iNode==1 ){
218985     if( pNode->iNode ){
218986       sqlite3_bind_int64(p, 1, pNode->iNode);
218995     if( pNode->iNode==0 && rc==SQLITE_OK ){
218996       pNode->iNode = sqlite3_last_insert_rowid(pRtree->db);
219015       if( pNode->iNode==1 ){
219517     return nodeRowidIndex(pRtree, pParent, pNode->iNode, piIndex);
219925     i64 iNode = sqlite3_column_int64(pRtree->pReadRowid, 0);  local
219926     if( piNode ) *piNode = iNode;
219927     rc = nodeAcquire(pRtree, iNode, 0, ppLeaf);
219996     i64 iNode = 0;  local
220002       rc = findLeafNode(pRtree, iRowid, &pLeaf, &iNode);
220011       p->id = iNode;
220460 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){  argument
220462   sqlite3_bind_int64(pRtree->pWriteRowid, 2, iNode);
220470 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){  argument
220471   sqlite3_bind_int64(pRtree->pWriteParent, 1, iNode);
220670   return xSetMapping(pRtree, iRowid, pNode->iNode);
220710   if( pNode->iNode==1 ){
220742    || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
220747   rightbbox.iRowid = pRight->iNode;
220748   leftbbox.iRowid = pLeft->iNode;
220750   if( pNode->iNode==1 ){
220782   if( pNode->iNode==1 ){
220815   while( rc==SQLITE_OK && pChild->iNode!=1 && pChild->pParent==0 ){
220817     sqlite3_bind_int64(pRtree->pReadParent, 1, pChild->iNode);
220821       i64 iNode;                  /* Node number of parent node */  local
220828       iNode = sqlite3_column_int64(pRtree->pReadParent, 0);
220829       for(pTest=pLeaf; pTest && pTest->iNode!=iNode; pTest=pTest->pParent);
220831         rc2 = nodeAcquire(pRtree, iNode, 0, &pChild->pParent);
220872   sqlite3_bind_int64(pRtree->pDeleteNode, 1, pNode->iNode);
220879   sqlite3_bind_int64(pRtree->pDeleteParent, 1, pNode->iNode);
220889   pNode->iNode = iHeight;
220910     box.iRowid = pNode->iNode;
220943   assert( pParent || pNode->iNode==1 );
220980         rc = rowidWrite(pRtree, pCell->iRowid, pNode->iNode);
220982         rc = parentWrite(pRtree, pCell->iRowid, pNode->iNode);
221002     rc = ChooseLeaf(pRtree, &cell, (int)pNode->iNode, &pInsert);
221005       rc = rtreeInsertCell(pRtree, pInsert, &cell, (int)pNode->iNode);
222025 static u8 *rtreeCheckGetNode(RtreeCheck *pCheck, i64 iNode, int *pnNode){  argument
222036     sqlite3_bind_int64(pCheck->pGetNode, 1, iNode);
222050       rtreeCheckAppendMsg(pCheck, "Node %lld missing from database", iNode);
222123   i64 iNode,                      /* Node id to use in error messages */  argument
222139           "Dimension %d of cell %d on node %lld is corrupt", i, iCell, iNode
222152             , i, iCell, iNode
222171   i64 iNode                       /* Node to check */  argument
222176   assert( iNode==1 || aParent!=0 );
222179   aNode = rtreeCheckGetNode(pCheck, iNode, &nNode);
222183           "Node %lld is too small (%d bytes)", iNode, nNode
222200             iNode, nCell, nNode
222206           rtreeCheckCellCoord(pCheck, iNode, i, &pCell[8], aParent);
222209             rtreeCheckMapping(pCheck, 0, iVal, iNode);
222213             rtreeCheckMapping(pCheck, 1, iVal, iNode);
223789     i64 iNode = 0;  local
223790     rc = findLeafNode(pRtree, iRowid, &pLeaf, &iNode);
223795       p->id = iNode;