Cross Reference: /external/sqlite/dist/sqlite3.c

Lines Matching defs:iNode
31200   unixShmNode *pShmNode = p->pShmNode;  /* The underlying file iNode */
154211   ** RtreeNode.pNext. RtreeNode.iNode stores the depth of the sub-tree 
154212   ** headed by the node (leaf nodes have RtreeNode.iNode==0).
154378   i64 iNode;                  /* The node number */
154526 ** Given a node number iNode, return the corresponding key to use
154529 static int nodeHash(i64 iNode){
154530   return iNode % HASHSIZE;
154534 ** Search the node hash table for node iNode. If found, return a pointer
154537 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
154539   for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
154549   iHash = nodeHash(pNode->iNode);
154559   if( pNode->iNode!=0 ){
154560     pp = &pRtree->aHash[nodeHash(pNode->iNode)];
154568 ** Allocate and return new r-tree node. Initially, (RtreeNode.iNode==0),
154592   i64 iNode,                 /* Node number to load */
154603   if( (pNode = nodeHashLookup(pRtree, iNode)) ){
154614   sqlite3_bind_int64(pRtree->pReadNode, 1, iNode);
154626         pNode->iNode = iNode;
154643   if( pNode && iNode==1 ){
154739     if( pNode->iNode ){
154740       sqlite3_bind_int64(p, 1, pNode->iNode);
154748     if( pNode->iNode==0 && rc==SQLITE_OK ){
154749       pNode->iNode = sqlite3_last_insert_rowid(pRtree->db);
154766       if( pNode->iNode==1 ){
155174     return nodeRowidIndex(pRtree, pParent, pNode->iNode, piIndex);
155541     i64 iNode = sqlite3_column_int64(pRtree->pReadRowid, 0);
155542     if( piNode ) *piNode = iNode;
155543     rc = nodeAcquire(pRtree, iNode, 0, ppLeaf);
155629     i64 iNode = 0;
155630     rc = findLeafNode(pRtree, iRowid, &pLeaf, &iNode);
155635       p->id = iNode;
156026 ** Write mapping (iRowid->iNode) to the <rtree>_rowid table.
156028 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
156030   sqlite3_bind_int64(pRtree->pWriteRowid, 2, iNode);
156036 ** Write mapping (iNode->iPar) to the <rtree>_parent table.
156038 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){
156039   sqlite3_bind_int64(pRtree->pWriteParent, 1, iNode);
156304   return xSetMapping(pRtree, iRowid, pNode->iNode);
156344   if( pNode->iNode==1 ){
156376    || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
156381   rightbbox.iRowid = pRight->iNode;
156382   leftbbox.iRowid = pLeft->iNode;
156384   if( pNode->iNode==1 ){
156415   if( pNode->iNode==1 ){
156457   while( rc==SQLITE_OK && pChild->iNode!=1 && pChild->pParent==0 ){
156459     sqlite3_bind_int64(pRtree->pReadParent, 1, pChild->iNode);
156463       i64 iNode;                  /* Node number of parent node */
156470       iNode = sqlite3_column_int64(pRtree->pReadParent, 0);
156471       for(pTest=pLeaf; pTest && pTest->iNode!=iNode; pTest=pTest->pParent);
156473         rc2 = nodeAcquire(pRtree, iNode, 0, &pChild->pParent);
156510   sqlite3_bind_int64(pRtree->pDeleteNode, 1, pNode->iNode);
156517   sqlite3_bind_int64(pRtree->pDeleteParent, 1, pNode->iNode);
156527   pNode->iNode = iHeight;
156548     box.iRowid = pNode->iNode;
156581   assert( pParent || pNode->iNode==1 );
156664         rc = rowidWrite(pRtree, p->iRowid, pNode->iNode);
156666         rc = parentWrite(pRtree, p->iRowid, pNode->iNode);
156674     /* Find a node to store this cell in. pNode->iNode currently contains
156714     if( iHeight<=pRtree->iReinsertHeight || pNode->iNode==1){
156724         rc = rowidWrite(pRtree, pCell->iRowid, pNode->iNode);
156726         rc = parentWrite(pRtree, pCell->iRowid, pNode->iNode);
156743     /* Find a node to store this cell in. pNode->iNode currently contains
156746     rc = ChooseLeaf(pRtree, &cell, (int)pNode->iNode, &pInsert);
156749       rc = rtreeInsertCell(pRtree, pInsert, &cell, (int)pNode->iNode);