Lines Matching defs:iNode
41804 unixShmNode *pShmNode; /* The underlying file iNode */
201118 ** RtreeNode.pNext. RtreeNode.iNode stores the depth of the sub-tree
201119 ** headed by the node (leaf nodes have RtreeNode.iNode==0).
201307 i64 iNode; /* The node number */
201566 ** Given a node number iNode, return the corresponding key to use
201569 static unsigned int nodeHash(i64 iNode){
201570 return ((unsigned)iNode) % HASHSIZE;
201574 ** Search the node hash table for node iNode. If found, return a pointer
201577 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
201579 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
201589 iHash = nodeHash(pNode->iNode);
201599 if( pNode->iNode!=0 ){
201600 pp = &pRtree->aHash[nodeHash(pNode->iNode)];
201608 ** Allocate and return new r-tree node. Initially, (RtreeNode.iNode==0),
201644 i64 iNode, /* Node number to load */
201654 if( (pNode = nodeHashLookup(pRtree, iNode))!=0 ){
201667 rc = sqlite3_blob_reopen(pBlob, iNode);
201677 rc = sqlite3_blob_open(pRtree->db, pRtree->zDb, zTab, "data", iNode, 0,
201699 pNode->iNode = iNode;
201713 if( rc==SQLITE_OK && pNode && iNode==1 ){
201816 if( pNode->iNode ){
201817 sqlite3_bind_int64(p, 1, pNode->iNode);
201826 if( pNode->iNode==0 && rc==SQLITE_OK ){
201827 pNode->iNode = sqlite3_last_insert_rowid(pRtree->db);
201846 if( pNode->iNode==1 ){
202329 return nodeRowidIndex(pRtree, pParent, pNode->iNode, piIndex);
202732 i64 iNode = sqlite3_column_int64(pRtree->pReadRowid, 0);
202733 if( piNode ) *piNode = iNode;
202734 rc = nodeAcquire(pRtree, iNode, 0, ppLeaf);
202801 i64 iNode = 0;
202806 rc = findLeafNode(pRtree, iRowid, &pLeaf, &iNode);
202815 p->id = iNode;
203239 ** Write mapping (iRowid->iNode) to the <rtree>_rowid table.
203241 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
203243 sqlite3_bind_int64(pRtree->pWriteRowid, 2, iNode);
203249 ** Write mapping (iNode->iPar) to the <rtree>_parent table.
203251 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){
203252 sqlite3_bind_int64(pRtree->pWriteParent, 1, iNode);
203522 return xSetMapping(pRtree, iRowid, pNode->iNode);
203562 if( pNode->iNode==1 ){
203594 || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
203599 rightbbox.iRowid = pRight->iNode;
203600 leftbbox.iRowid = pLeft->iNode;
203602 if( pNode->iNode==1 ){
203634 if( pNode->iNode==1 ){
203676 while( rc==SQLITE_OK && pChild->iNode!=1 && pChild->pParent==0 ){
203678 sqlite3_bind_int64(pRtree->pReadParent, 1, pChild->iNode);
203682 i64 iNode; /* Node number of parent node */
203689 iNode = sqlite3_column_int64(pRtree->pReadParent, 0);
203690 for(pTest=pLeaf; pTest && pTest->iNode!=iNode; pTest=pTest->pParent);
203692 rc2 = nodeAcquire(pRtree, iNode, 0, &pChild->pParent);
203733 sqlite3_bind_int64(pRtree->pDeleteNode, 1, pNode->iNode);
203740 sqlite3_bind_int64(pRtree->pDeleteParent, 1, pNode->iNode);
203750 pNode->iNode = iHeight;
203771 box.iRowid = pNode->iNode;
203804 assert( pParent || pNode->iNode==1 );
203887 rc = rowidWrite(pRtree, p->iRowid, pNode->iNode);
203889 rc = parentWrite(pRtree, p->iRowid, pNode->iNode);
203897 /* Find a node to store this cell in. pNode->iNode currently contains
203937 if( iHeight<=pRtree->iReinsertHeight || pNode->iNode==1){
203947 rc = rowidWrite(pRtree, pCell->iRowid, pNode->iNode);
203949 rc = parentWrite(pRtree, pCell->iRowid, pNode->iNode);
203966 /* Find a node to store this cell in. pNode->iNode currently contains
203969 rc = ChooseLeaf(pRtree, &cell, (int)pNode->iNode, &pInsert);
203972 rc = rtreeInsertCell(pRtree, pInsert, &cell, (int)pNode->iNode);
204972 ** Otherwise, the contents of rtree table node iNode are loaded from
204981 static u8 *rtreeCheckGetNode(RtreeCheck *pCheck, i64 iNode, int *pnNode){
204992 sqlite3_bind_int64(pCheck->pGetNode, 1, iNode);
205006 rtreeCheckAppendMsg(pCheck, "Node %lld missing from database", iNode);
205079 i64 iNode, /* Node id to use in error messages */
205095 "Dimension %d of cell %d on node %lld is corrupt", i, iCell, iNode
205108 , i, iCell, iNode
205116 ** Run rtreecheck() checks on node iNode, which is at depth iDepth within
205118 ** that bound node iNode on the parent node.
205125 int iDepth, /* Depth of iNode (0==leaf) */
205127 i64 iNode /* Node to check */
205132 assert( iNode==1 || aParent!=0 );
205135 aNode = rtreeCheckGetNode(pCheck, iNode, &nNode);
205139 "Node %lld is too small (%d bytes)", iNode, nNode
205156 iNode, nCell, nNode
205162 rtreeCheckCellCoord(pCheck, iNode, i, &pCell[8], aParent);
205165 rtreeCheckMapping(pCheck, 0, iVal, iNode);
205169 rtreeCheckMapping(pCheck, 1, iVal, iNode);
206714 i64 iNode = 0;
206715 rc = findLeafNode(pRtree, iRowid, &pLeaf, &iNode);
206720 p->id = iNode;