Lines Matching defs:iNode
1104 ** sync operation only needs to flush data to mass storage. Inode
1162 ** and not its inode needs to be synced.
25025 unixInodeInfo *pInode; /* Info about locks on this inode */
25787 ** the device number and the inode number. But this does not work on VxWorks.
25950 ** specific inode of the database file (the inode is determined by the
25952 ** and check for locks already existing on that inode. When locks are
25955 ** inode.
25957 ** (Aside: The use of inode numbers as unique IDs does not work on VxWorks.
25964 ** locks on the corresponding inode. There is one locking structure
25965 ** per inode, so if the same inode is opened twice, both unixFile structures
25982 ** maintains a count of the number of pending locks on tha inode.
25984 ** other unixFile open on the same inode that are holding locks, the call
26020 ino_t ino; /* Inode number */
26026 ** inode. Or, on LinuxThreads, there is one of these structures for
26027 ** each inode opened by each thread.
26029 ** A single inode can have multiple file descriptors, so each unixFile
26039 unixShmNode *pShmNode; /* Shared memory associated with this inode */
26229 /* On OS X on an msdos filesystem, the inode number is reported
26233 ** prior to accessing the inode number. The one byte written is
28259 ** to disk, not the inode. We only set dataOnly if the file size is
28260 ** unchanged since the file size is part of the inode. However,
28261 ** Ted Ts'o tells us that fdatasync() will also write the inode if the
28264 ** inode if the mtime or owner or other inode attributes have changed.
28905 unixInodeInfo *pInode; /* The inode of fd */
29178 unixShmNode *pShmNode = p->pShmNode; /* The underlying file iNode */
130318 ** RtreeNode.pNext. RtreeNode.iNode stores the depth of the sub-tree
130319 ** headed by the node (leaf nodes have RtreeNode.iNode==0).
130420 i64 iNode;
130557 ** Given a node number iNode, return the corresponding key to use
130560 static int nodeHash(i64 iNode){
130562 (iNode>>56) ^ (iNode>>48) ^ (iNode>>40) ^ (iNode>>32) ^
130563 (iNode>>24) ^ (iNode>>16) ^ (iNode>> 8) ^ (iNode>> 0)
130568 ** Search the node hash table for node iNode. If found, return a pointer
130571 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
130573 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
130583 iHash = nodeHash(pNode->iNode);
130593 if( pNode->iNode!=0 ){
130594 pp = &pRtree->aHash[nodeHash(pNode->iNode)];
130602 ** Allocate and return new r-tree node. Initially, (RtreeNode.iNode==0),
130627 i64 iNode, /* Node number to load */
130638 if( (pNode = nodeHashLookup(pRtree, iNode)) ){
130649 sqlite3_bind_int64(pRtree->pReadNode, 1, iNode);
130661 pNode->iNode = iNode;
130678 if( pNode && iNode==1 ){
130776 if( pNode->iNode ){
130777 sqlite3_bind_int64(p, 1, pNode->iNode);
130785 if( pNode->iNode==0 && rc==SQLITE_OK ){
130786 pNode->iNode = sqlite3_last_insert_rowid(pRtree->db);
130804 if( pNode->iNode==1 ){
131236 return nodeRowidIndex(pRtree, pParent, pNode->iNode, piIndex);
131336 i64 iNode = sqlite3_column_int64(pRtree->pReadRowid, 0);
131337 rc = nodeAcquire(pRtree, iNode, 0, ppLeaf);
131841 ** Write mapping (iRowid->iNode) to the <rtree>_rowid table.
131843 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
131845 sqlite3_bind_int64(pRtree->pWriteRowid, 2, iNode);
131851 ** Write mapping (iNode->iPar) to the <rtree>_parent table.
131853 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){
131854 sqlite3_bind_int64(pRtree->pWriteParent, 1, iNode);
132325 return xSetMapping(pRtree, iRowid, pNode->iNode);
132365 if( pNode->iNode==1 ){
132396 || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
132401 rightbbox.iRowid = pRight->iNode;
132402 leftbbox.iRowid = pLeft->iNode;
132404 if( pNode->iNode==1 ){
132435 if( pNode->iNode==1 ){
132477 while( rc==SQLITE_OK && pChild->iNode!=1 && pChild->pParent==0 ){
132479 sqlite3_bind_int64(pRtree->pReadParent, 1, pChild->iNode);
132483 i64 iNode; /* Node number of parent node */
132490 iNode = sqlite3_column_int64(pRtree->pReadParent, 0);
132491 for(pTest=pLeaf; pTest && pTest->iNode!=iNode; pTest=pTest->pParent);
132493 rc2 = nodeAcquire(pRtree, iNode, 0, &pChild->pParent);
132530 sqlite3_bind_int64(pRtree->pDeleteNode, 1, pNode->iNode);
132537 sqlite3_bind_int64(pRtree->pDeleteParent, 1, pNode->iNode);
132547 pNode->iNode = iHeight;
132568 box.iRowid = pNode->iNode;
132601 assert( pParent || pNode->iNode==1 );
132682 rc = rowidWrite(pRtree, p->iRowid, pNode->iNode);
132684 rc = parentWrite(pRtree, p->iRowid, pNode->iNode);
132692 /* Find a node to store this cell in. pNode->iNode currently contains
132733 if( iHeight<=pRtree->iReinsertHeight || pNode->iNode==1){
132746 rc = rowidWrite(pRtree, pCell->iRowid, pNode->iNode);
132748 rc = parentWrite(pRtree, pCell->iRowid, pNode->iNode);
132765 /* Find a node to store this cell in. pNode->iNode currently contains
132768 rc = ChooseLeaf(pRtree, &cell, (int)pNode->iNode, &pInsert);
132771 rc = rtreeInsertCell(pRtree, pInsert, &cell, (int)pNode->iNode);
