Lines Matching full:inode
1083 ** sync operation only needs to flush data to mass storage. Inode
1140 ** and not its inode needs to be synced.
22988 unixInodeInfo *pInode; /* Info about locks on this inode */
23472 ** the device number and the inode number. But this does not work on VxWorks.
23635 ** specific inode of the database file (the inode is determined by the
23637 ** and check for locks already existing on that inode. When locks are
23640 ** inode.
23642 ** (Aside: The use of inode numbers as unique IDs does not work on VxWorks.
23649 ** locks on the corresponding inode. There is one locking structure
23650 ** per inode, so if the same inode is opened twice, both unixFile structures
23667 ** maintains a count of the number of pending locks on tha inode.
23669 ** other unixFile open on the same inode that are holding locks, the call
23705 ino_t ino; /* Inode number */
23711 ** inode. Or, on LinuxThreads, there is one of these structures for
23712 ** each inode opened by each thread.
23714 ** A single inode can have multiple file descriptors, so each unixFile
23723 unixShmNode *pShmNode; /* Shared memory associated with this inode */
23907 /* On OS X on an msdos filesystem, the inode number is reported
23911 ** prior to accessing the inode number. The one byte written is
25911 ** to disk, not the inode. We only set dataOnly if the file size is
25912 ** unchanged since the file size is part of the inode. However,
25913 ** Ted Ts'o tells us that fdatasync() will also write the inode if the
25916 ** inode if the mtime or owner or other inode attributes have changed.
26459 unixInodeInfo *pInode; /* The inode of fd */
26688 unixShmNode *pShmNode = p->pShmNode; /* The underlying file iNode */
119242 ** RtreeNode.pNext. RtreeNode.iNode stores the depth of the sub-tree
119243 ** headed by the node (leaf nodes have RtreeNode.iNode==0).
119344 i64 iNode;
119481 ** Given a node number iNode, return the corresponding key to use
119484 static int nodeHash(i64 iNode){
119486 (iNode>>56) ^ (iNode>>48) ^ (iNode>>40) ^ (iNode>>32) ^
119487 (iNode>>24) ^ (iNode>>16) ^ (iNode>> 8) ^ (iNode>> 0)
119492 ** Search the node hash table for node iNode. If found, return a pointer
119495 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
119497 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
119507 iHash = nodeHash(pNode->iNode);
119517 if( pNode->iNode!=0 ){
119518 pp = &pRtree->aHash[nodeHash(pNode->iNode)];
119526 ** Allocate and return new r-tree node. Initially, (RtreeNode.iNode==0),
119551 i64 iNode, /* Node number to load */
119562 if( (pNode = nodeHashLookup(pRtree, iNode)) ){
119573 sqlite3_bind_int64(pRtree->pReadNode, 1, iNode);
119585 pNode->iNode = iNode;
119602 if( pNode && iNode==1 ){
119700 if( pNode->iNode ){
119701 sqlite3_bind_int64(p, 1, pNode->iNode);
119709 if( pNode->iNode==0 && rc==SQLITE_OK ){
119710 pNode->iNode = sqlite3_last_insert_rowid(pRtree->db);
119728 if( pNode->iNode==1 ){
120160 return nodeRowidIndex(pRtree, pParent, pNode->iNode, piIndex);
120260 i64 iNode = sqlite3_column_int64(pRtree->pReadRowid, 0);
120261 rc = nodeAcquire(pRtree, iNode, 0, ppLeaf);
120789 ** Write mapping (iRowid->iNode) to the <rtree>_rowid table.
120791 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
120793 sqlite3_bind_int64(pRtree->pWriteRowid, 2, iNode);
120799 ** Write mapping (iNode->iPar) to the <rtree>_parent table.
120801 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){
120802 sqlite3_bind_int64(pRtree->pWriteParent, 1, iNode);
121273 return xSetMapping(pRtree, iRowid, pNode->iNode);
121313 if( pNode->iNode==1 ){
121344 || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
121349 rightbbox.iRowid = pRight->iNode;
121350 leftbbox.iRowid = pLeft->iNode;
121352 if( pNode->iNode==1 ){
121383 if( pNode->iNode==1 ){
121425 while( rc==SQLITE_OK && pChild->iNode!=1 && pChild->pParent==0 ){
121427 sqlite3_bind_int64(pRtree->pReadParent, 1, pChild->iNode);
121431 i64 iNode; /* Node number of parent node */
121438 iNode = sqlite3_column_int64(pRtree->pReadParent, 0);
121439 for(pTest=pLeaf; pTest && pTest->iNode!=iNode; pTest=pTest->pParent);
121441 rc2 = nodeAcquire(pRtree, iNode, 0, &pChild->pParent);
121478 sqlite3_bind_int64(pRtree->pDeleteNode, 1, pNode->iNode);
121485 sqlite3_bind_int64(pRtree->pDeleteParent, 1, pNode->iNode);
121495 pNode->iNode = iHeight;
121516 box.iRowid = pNode->iNode;
121549 assert( pParent || pNode->iNode==1 );
121630 rc = rowidWrite(pRtree, p->iRowid, pNode->iNode);
121632 rc = parentWrite(pRtree, p->iRowid, pNode->iNode);
121640 /* Find a node to store this cell in. pNode->iNode currently contains
121681 if( iHeight<=pRtree->iReinsertHeight || pNode->iNode==1){
121694 rc = rowidWrite(pRtree, pCell->iRowid, pNode->iNode);
121696 rc = parentWrite(pRtree, pCell->iRowid, pNode->iNode);
121713 /* Find a node to store this cell in. pNode->iNode currently contains
121716 rc = ChooseLeaf(pRtree, &cell, pNode->iNode, &pInsert);
121719 rc = rtreeInsertCell(pRtree, pInsert, &cell, pNode->iNode);
