Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
L
linux
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
nexedi
linux
Commits
eef57ec4
Commit
eef57ec4
authored
Oct 11, 2002
by
Linus Torvalds
Browse files
Options
Browse Files
Download
Plain Diff
Merge
http://linux-ntfs.bkbits.net/linux-2.5-ilookup
into home.transmeta.com:/home/torvalds/v2.5/linux
parents
589409a9
c7ab9103
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
160 additions
and
26 deletions
+160
-26
fs/inode.c
fs/inode.c
+156
-26
include/linux/fs.h
include/linux/fs.h
+4
-0
No files found.
fs/inode.c
View file @
eef57ec4
...
@@ -526,7 +526,7 @@ void unlock_new_inode(struct inode *inode)
...
@@ -526,7 +526,7 @@ void unlock_new_inode(struct inode *inode)
inode
->
i_state
&=
~
(
I_LOCK
|
I_NEW
);
inode
->
i_state
&=
~
(
I_LOCK
|
I_NEW
);
wake_up_inode
(
inode
);
wake_up_inode
(
inode
);
}
}
EXPORT_SYMBOL
(
unlock_new_inode
);
/*
/*
* This is called without the inode lock held.. Be careful.
* This is called without the inode lock held.. Be careful.
...
@@ -686,15 +686,29 @@ struct inode *igrab(struct inode *inode)
...
@@ -686,15 +686,29 @@ struct inode *igrab(struct inode *inode)
return
inode
;
return
inode
;
}
}
/*
/**
* This is iget without the read_inode portion of get_new_inode
* ifind - internal function, you want ilookup5() or iget5().
* the filesystem gets back a new locked and hashed inode and gets
* @sb: super block of file system to search
* to fill it in before unlocking it via unlock_new_inode().
* @hashval: hash value (usually inode number) to search for
* @test: callback used for comparisons between inodes
* @data: opaque data pointer to pass to @test
*
* ifind() searches for the inode specified by @hashval and @data in the inode
* cache. This is a generalized version of ifind_fast() for file systems where
* the inode number is not sufficient for unique identification of an inode.
*
* If the inode is in the cache, the inode is returned with an incremented
* reference count.
*
* Otherwise NULL is returned.
*
* Note, @test is called with the inode_lock held, so can't sleep.
*/
*/
struct
inode
*
iget5_locked
(
struct
super_block
*
sb
,
unsigned
long
hashval
,
int
(
*
test
)(
struct
inode
*
,
void
*
),
int
(
*
set
)(
struct
inode
*
,
void
*
),
void
*
data
)
static
inline
struct
inode
*
ifind
(
struct
super_block
*
sb
,
struct
list_head
*
head
,
int
(
*
test
)(
struct
inode
*
,
void
*
),
void
*
data
)
{
{
struct
list_head
*
head
=
inode_hashtable
+
hash
(
sb
,
hashval
);
struct
inode
*
inode
;
struct
inode
*
inode
;
spin_lock
(
&
inode_lock
);
spin_lock
(
&
inode_lock
);
inode
=
find_inode
(
sb
,
head
,
test
,
data
);
inode
=
find_inode
(
sb
,
head
,
test
,
data
);
...
@@ -705,25 +719,27 @@ struct inode *iget5_locked(struct super_block *sb, unsigned long hashval, int (*
...
@@ -705,25 +719,27 @@ struct inode *iget5_locked(struct super_block *sb, unsigned long hashval, int (*
return
inode
;
return
inode
;
}
}
spin_unlock
(
&
inode_lock
);
spin_unlock
(
&
inode_lock
);
return
NULL
;
/*
* get_new_inode() will do the right thing, re-trying the search
* in case it had to block at any point.
*/
return
get_new_inode
(
sb
,
head
,
test
,
set
,
data
);
}
}
/*
/**
* Because most filesystems are based on 32-bit unique inode numbers some
* ifind_fast - internal function, you want ilookup() or iget().
* functions are duplicated to keep iget_locked as a fast path. We can avoid
* @sb: super block of file system to search
* unnecessary pointer dereferences and function calls for this specific
* @ino: inode number to search for
* case. The duplicated functions (find_inode_fast and get_new_inode_fast)
*
* have the same pre- and post-conditions as their original counterparts.
* ifind_fast() searches for the inode @ino in the inode cache. This is for
* file systems where the inode number is sufficient for unique identification
* of an inode.
*
* If the inode is in the cache, the inode is returned with an incremented
* reference count.
*
* Otherwise NULL is returned.
*/
*/
struct
inode
*
iget_locked
(
struct
super_block
*
sb
,
unsigned
long
ino
)
static
inline
struct
inode
*
ifind_fast
(
struct
super_block
*
sb
,
struct
list_head
*
head
,
unsigned
long
ino
)
{
{
struct
list_head
*
head
=
inode_hashtable
+
hash
(
sb
,
ino
);
struct
inode
*
inode
;
struct
inode
*
inode
;
spin_lock
(
&
inode_lock
);
spin_lock
(
&
inode_lock
);
inode
=
find_inode_fast
(
sb
,
head
,
ino
);
inode
=
find_inode_fast
(
sb
,
head
,
ino
);
...
@@ -734,17 +750,131 @@ struct inode *iget_locked(struct super_block *sb, unsigned long ino)
...
@@ -734,17 +750,131 @@ struct inode *iget_locked(struct super_block *sb, unsigned long ino)
return
inode
;
return
inode
;
}
}
spin_unlock
(
&
inode_lock
);
spin_unlock
(
&
inode_lock
);
return
NULL
;
}
/**
* ilookup5 - search for an inode in the inode cache
* @sb: super block of file system to search
* @hashval: hash value (usually inode number) to search for
* @test: callback used for comparisons between inodes
* @data: opaque data pointer to pass to @test
*
* ilookup5() uses ifind() to search for the inode specified by @hashval and
* @data in the inode cache. This is a generalized version of ilookup() for
* file systems where the inode number is not sufficient for unique
* identification of an inode.
*
* If the inode is in the cache, the inode is returned with an incremented
* reference count.
*
* Otherwise NULL is returned.
*
* Note, @test is called with the inode_lock held, so can't sleep.
*/
struct
inode
*
ilookup5
(
struct
super_block
*
sb
,
unsigned
long
hashval
,
int
(
*
test
)(
struct
inode
*
,
void
*
),
void
*
data
)
{
struct
list_head
*
head
=
inode_hashtable
+
hash
(
sb
,
hashval
);
return
ifind
(
sb
,
head
,
test
,
data
);
}
EXPORT_SYMBOL
(
ilookup5
);
/**
* ilookup - search for an inode in the inode cache
* @sb: super block of file system to search
* @ino: inode number to search for
*
* ilookup() uses ifind_fast() to search for the inode @ino in the inode cache.
* This is for file systems where the inode number is sufficient for unique
* identification of an inode.
*
* If the inode is in the cache, the inode is returned with an incremented
* reference count.
*
* Otherwise NULL is returned.
*/
struct
inode
*
ilookup
(
struct
super_block
*
sb
,
unsigned
long
ino
)
{
struct
list_head
*
head
=
inode_hashtable
+
hash
(
sb
,
ino
);
return
ifind_fast
(
sb
,
head
,
ino
);
}
EXPORT_SYMBOL
(
ilookup
);
/**
* iget5_locked - obtain an inode from a mounted file system
* @sb: super block of file system
* @hashval: hash value (usually inode number) to get
* @test: callback used for comparisons between inodes
* @set: callback used to initialize a new struct inode
* @data: opaque data pointer to pass to @test and @set
*
* This is iget() without the read_inode() portion of get_new_inode().
*
* iget5_locked() uses ifind() to search for the inode specified by @hashval
* and @data in the inode cache and if present it is returned with an increased
* reference count. This is a generalized version of iget_locked() for file
* systems where the inode number is not sufficient for unique identification
* of an inode.
*
* If the inode is not in cache, get_new_inode() is called to allocate a new
* inode and this is returned locked, hashed, and with the I_NEW flag set. The
* file system gets to fill it in before unlocking it via unlock_new_inode().
*
* Note both @test and @set are called with the inode_lock held, so can't sleep.
*/
struct
inode
*
iget5_locked
(
struct
super_block
*
sb
,
unsigned
long
hashval
,
int
(
*
test
)(
struct
inode
*
,
void
*
),
int
(
*
set
)(
struct
inode
*
,
void
*
),
void
*
data
)
{
struct
list_head
*
head
=
inode_hashtable
+
hash
(
sb
,
hashval
);
struct
inode
*
inode
;
inode
=
ifind
(
sb
,
head
,
test
,
data
);
if
(
inode
)
return
inode
;
/*
* get_new_inode() will do the right thing, re-trying the search
* in case it had to block at any point.
*/
return
get_new_inode
(
sb
,
head
,
test
,
set
,
data
);
}
EXPORT_SYMBOL
(
iget5_locked
);
/**
* iget_locked - obtain an inode from a mounted file system
* @sb: super block of file system
* @ino: inode number to get
*
* This is iget() without the read_inode() portion of get_new_inode_fast().
*
* iget_locked() uses ifind_fast() to search for the inode specified by @ino in
* the inode cache and if present it is returned with an increased reference
* count. This is for file systems where the inode number is sufficient for
* unique identification of an inode.
*
* If the inode is not in cache, get_new_inode_fast() is called to allocate a
* new inode and this is returned locked, hashed, and with the I_NEW flag set.
* The file system gets to fill it in before unlocking it via
* unlock_new_inode().
*/
struct
inode
*
iget_locked
(
struct
super_block
*
sb
,
unsigned
long
ino
)
{
struct
list_head
*
head
=
inode_hashtable
+
hash
(
sb
,
ino
);
struct
inode
*
inode
;
inode
=
ifind_fast
(
sb
,
head
,
ino
);
if
(
inode
)
return
inode
;
/*
/*
* get_new_inode_fast() will do the right thing, re-trying the search
* get_new_inode_fast() will do the right thing, re-trying the search
* in case it had to block at any point.
* in case it had to block at any point.
*/
*/
return
get_new_inode_fast
(
sb
,
head
,
ino
);
return
get_new_inode_fast
(
sb
,
head
,
ino
);
}
}
EXPORT_SYMBOL
(
iget5_locked
);
EXPORT_SYMBOL
(
iget_locked
);
EXPORT_SYMBOL
(
iget_locked
);
EXPORT_SYMBOL
(
unlock_new_inode
);
/**
/**
* __insert_inode_hash - hash an inode
* __insert_inode_hash - hash an inode
...
...
include/linux/fs.h
View file @
eef57ec4
...
@@ -1198,6 +1198,10 @@ extern ino_t iunique(struct super_block *, ino_t);
...
@@ -1198,6 +1198,10 @@ extern ino_t iunique(struct super_block *, ino_t);
extern
int
inode_needs_sync
(
struct
inode
*
inode
);
extern
int
inode_needs_sync
(
struct
inode
*
inode
);
extern
void
generic_delete_inode
(
struct
inode
*
inode
);
extern
void
generic_delete_inode
(
struct
inode
*
inode
);
extern
struct
inode
*
ilookup5
(
struct
super_block
*
sb
,
unsigned
long
hashval
,
int
(
*
test
)(
struct
inode
*
,
void
*
),
void
*
data
);
extern
struct
inode
*
ilookup
(
struct
super_block
*
sb
,
unsigned
long
ino
);
extern
struct
inode
*
iget5_locked
(
struct
super_block
*
,
unsigned
long
,
int
(
*
test
)(
struct
inode
*
,
void
*
),
int
(
*
set
)(
struct
inode
*
,
void
*
),
void
*
);
extern
struct
inode
*
iget5_locked
(
struct
super_block
*
,
unsigned
long
,
int
(
*
test
)(
struct
inode
*
,
void
*
),
int
(
*
set
)(
struct
inode
*
,
void
*
),
void
*
);
extern
struct
inode
*
iget_locked
(
struct
super_block
*
,
unsigned
long
);
extern
struct
inode
*
iget_locked
(
struct
super_block
*
,
unsigned
long
);
extern
void
unlock_new_inode
(
struct
inode
*
);
extern
void
unlock_new_inode
(
struct
inode
*
);
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment