lkml.org 
[lkml]   [1998]   [Apr]   [13]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
Subjectsymlinks.
Regarding the hullaballo about stack usage on follow_symlink depth limits:
From my reading of the code, it does not seem as if do_follow_symlink is
recursive at all. It is called in an for(ever) loop in lookup_dentry()
in fs/namei.c; it only goes down one link per invocation, and pushes
nothing onto the stack.

It does not seem as if there is any justification to the opposition to
making the limit in do_follow_symlink() variable.

I'd like to go one better and use Tarjan's algorithm to find loops 'for
real' instead of simply assuming that every symlink nested more than 5
deep is a loop. This will let us build bind natively, at least.

Comments? Errors in my analysis?
--Scott
@ @
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-oOO-(_)-OOo-=-=-=-=-=
C. Scott Ananian: cananian@lcs.mit.edu / Declare the Truth boldly and
Laboratory for Computer Science/Crypto / without hindrance.
Massachusetts Institute of Technology /META-PARRESIAS AKOLUTOS:Acts 28:31
-.-. .-.. .. ..-. ..-. --- .-. -.. ... -.-. --- - - .- -. .- -. .. .- -.
PGP key available via finger and from http://www.pdos.lcs.mit.edu/~cananian


-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu

\
 
 \ /
  Last update: 2005-03-22 13:42    [from the cache]
©2003-2011 Jasper Spaans