Lines Matching refs:iNode

167385   i64 iNode;                  /* The node number */
167624 static int nodeHash(i64 iNode){
167625   return iNode % HASHSIZE;
167632 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
167634   for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
167644   iHash = nodeHash(pNode->iNode);
167654   if( pNode->iNode!=0 ){
167655     pp = &pRtree->aHash[nodeHash(pNode->iNode)];
167698   i64 iNode,                 /* Node number to load */
167708   if( (pNode = nodeHashLookup(pRtree, iNode)) ){
167722     rc = sqlite3_blob_reopen(pBlob, iNode);
167732     rc = sqlite3_blob_open(pRtree->db, pRtree->zDb, zTab, "data", iNode, 0,
167750       pNode->iNode = iNode;
167765   if( pNode && iNode==1 ){
167861     if( pNode->iNode ){
167862       sqlite3_bind_int64(p, 1, pNode->iNode);
167870     if( pNode->iNode==0 && rc==SQLITE_OK ){
167871       pNode->iNode = sqlite3_last_insert_rowid(pRtree->db);
167888       if( pNode->iNode==1 ){
168344     return nodeRowidIndex(pRtree, pParent, pNode->iNode, piIndex);
168710     i64 iNode = sqlite3_column_int64(pRtree->pReadRowid, 0);
168711     if( piNode ) *piNode = iNode;
168712     rc = nodeAcquire(pRtree, iNode, 0, ppLeaf);
168782     i64 iNode = 0;
168783     rc = findLeafNode(pRtree, iRowid, &pLeaf, &iNode);
168788       p->id = iNode;
169188 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
169190   sqlite3_bind_int64(pRtree->pWriteRowid, 2, iNode);
169198 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){
169199   sqlite3_bind_int64(pRtree->pWriteParent, 1, iNode);
169464   return xSetMapping(pRtree, iRowid, pNode->iNode);
169504   if( pNode->iNode==1 ){
169536    || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
169541   rightbbox.iRowid = pRight->iNode;
169542   leftbbox.iRowid = pLeft->iNode;
169544   if( pNode->iNode==1 ){
169575   if( pNode->iNode==1 ){
169617   while( rc==SQLITE_OK && pChild->iNode!=1 && pChild->pParent==0 ){
169619     sqlite3_bind_int64(pRtree->pReadParent, 1, pChild->iNode);
169623       i64 iNode;                  /* Node number of parent node */
169630       iNode = sqlite3_column_int64(pRtree->pReadParent, 0);
169631       for(pTest=pLeaf; pTest && pTest->iNode!=iNode; pTest=pTest->pParent);
169633         rc2 = nodeAcquire(pRtree, iNode, 0, &pChild->pParent);
169670   sqlite3_bind_int64(pRtree->pDeleteNode, 1, pNode->iNode);
169677   sqlite3_bind_int64(pRtree->pDeleteParent, 1, pNode->iNode);
169687   pNode->iNode = iHeight;
169708     box.iRowid = pNode->iNode;
169741   assert( pParent || pNode->iNode==1 );
169824         rc = rowidWrite(pRtree, p->iRowid, pNode->iNode);
169826         rc = parentWrite(pRtree, p->iRowid, pNode->iNode);
169874     if( iHeight<=pRtree->iReinsertHeight || pNode->iNode==1){
169884         rc = rowidWrite(pRtree, pCell->iRowid, pNode->iNode);
169886         rc = parentWrite(pRtree, pCell->iRowid, pNode->iNode);
169906     rc = ChooseLeaf(pRtree, &cell, (int)pNode->iNode, &pInsert);
169909       rc = rtreeInsertCell(pRtree, pInsert, &cell, (int)pNode->iNode);
170796 static u8 *rtreeCheckGetNode(RtreeCheck *pCheck, i64 iNode, int *pnNode){
170808     sqlite3_bind_int64(pCheck->pGetNode, 1, iNode);
170822       rtreeCheckAppendMsg(pCheck, "Node %lld missing from database", iNode);
170895   i64 iNode,                      /* Node id to use in error messages */
170911           "Dimension %d of cell %d on node %lld is corrupt", i, iCell, iNode
170924             , i, iCell, iNode
170943   i64 iNode                       /* Node to check */
170948   assert( iNode==1 || aParent!=0 );
170951   aNode = rtreeCheckGetNode(pCheck, iNode, &nNode);
170955           "Node %lld is too small (%d bytes)", iNode, nNode
170972             iNode, nCell, nNode
170978           rtreeCheckCellCoord(pCheck, iNode, i, &pCell[8], aParent);
170981             rtreeCheckMapping(pCheck, 0, iVal, iNode);
170985             rtreeCheckMapping(pCheck, 1, iVal, iNode);