[lkml]   [2002]   [Sep]   [9]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [BK-PATCH 1/3] Introduce fs/inode.c::ilookup().
At 18:04 08/09/02, Daniel Phillips wrote:
>On Saturday 07 September 2002 16:27, Anton Altaparmakov wrote:
> > The second and third patch have the small disadvantage to the previous
> > code in that in the case that ilookup() fails in iget_locked() and
> > get_new_inode_fast() is called the inode hash is calculated twice.
> > But that is the slow path so I don't think it is a problem.
>It doesn't make sense to introduce even this small inefficiency when
>all you need to do is wrap an __ilookup inline that takes the hash
>list, and is called both from ilookup and iget. The inline costs
>nothing, the hidden inefficiency costs cycles, however few.

True. It is not in fast path though. The fast path is ilookup() succeeding.
If the inode is not in cache, then the fs will have to read it from disk at
which point the additional hash calculation goes down in the noise on the
cpu cycles front. But if you think it is so important, then yeah, I can
make an inline wrapper. No problem.

>Thanks for actually documenting what the functions do in the inline
>documentation, it's nice to see such a break from tradition.

You are welcome. (-:

>One nano point: it would read better with the functional description
>before the ancilliary notes, i.e.:
>+ * The inode specified by @ino is looked up in the inode cache and if present
>+ * it is returned with an increased reference count.
>+ *
>+ * This is a fast version of iget5_locked() for file systems where the inode
>+ * number is sufficient for unique identification of an inode.


>While I'm picking nits, it's more accurate to say that iget5_locked is
>a generalized version of iget_locked than that the latter is a fast
>version of the former.

Hrm. True. Althought it didn't evolve that way. iget5_locked came first and
iget_locked was done later on as a speed optimization for simple file
systems. Al wanted to keep the _fast paths separate...

>And I still like ifind* more than ilookup*. It's shorter and is a
>better match with the existing page cache terminology. Why add
>entropy when you don't have to?

radix_tree_lookup(), d_lookup(), path_lookup(), ... Fits in nicely. (-:

find_inode{_fast} exist already, why add confusion when you don't have to? (-;

Best regards,


"I haven't lost my mind... it's backed up on tape." - Peter da Silva
Anton Altaparmakov <aia21 at> (replace at with @)
Linux NTFS Maintainer / IRC: #ntfs on
WWW: &

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2005-03-22 13:22    [W:0.081 / U:0.256 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site