diff options
author | Kees Cook <keescook@chromium.org> | 2012-12-17 19:03:20 -0500 |
---|---|---|
committer | Linus Torvalds <torvalds@linux-foundation.org> | 2012-12-17 20:15:23 -0500 |
commit | d740269867021faf4ce38a449353d2b986c34a67 (patch) | |
tree | e0476e1be1dfb6e852adbaa8fb72ecea87bdb088 /fs/binfmt_script.c | |
parent | 8d238027b87e654be552eabdf492042a34c5c300 (diff) |
exec: use -ELOOP for max recursion depth
To avoid an explosion of request_module calls on a chain of abusive
scripts, fail maximum recursion with -ELOOP instead of -ENOEXEC. As soon
as maximum recursion depth is hit, the error will fail all the way back
up the chain, aborting immediately.
This also has the side-effect of stopping the user's shell from attempting
to reexecute the top-level file as a shell script. As seen in the
dash source:
if (cmd != path_bshell && errno == ENOEXEC) {
*argv-- = cmd;
*argv = cmd = path_bshell;
goto repeat;
}
The above logic was designed for running scripts automatically that lacked
the "#!" header, not to re-try failed recursion. On a legitimate -ENOEXEC,
things continue to behave as the shell expects.
Additionally, when tracking recursion, the binfmt handlers should not be
involved. The recursion being tracked is the depth of calls through
search_binary_handler(), so that function should be exclusively responsible
for tracking the depth.
Signed-off-by: Kees Cook <keescook@chromium.org>
Cc: halfdog <me@halfdog.net>
Cc: P J P <ppandit@redhat.com>
Cc: Alexander Viro <viro@zeniv.linux.org.uk>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'fs/binfmt_script.c')
-rw-r--r-- | fs/binfmt_script.c | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/fs/binfmt_script.c b/fs/binfmt_script.c index 8c954997e7f7..1610a91637e5 100644 --- a/fs/binfmt_script.c +++ b/fs/binfmt_script.c | |||
@@ -22,15 +22,13 @@ static int load_script(struct linux_binprm *bprm) | |||
22 | char interp[BINPRM_BUF_SIZE]; | 22 | char interp[BINPRM_BUF_SIZE]; |
23 | int retval; | 23 | int retval; |
24 | 24 | ||
25 | if ((bprm->buf[0] != '#') || (bprm->buf[1] != '!') || | 25 | if ((bprm->buf[0] != '#') || (bprm->buf[1] != '!')) |
26 | (bprm->recursion_depth > BINPRM_MAX_RECURSION)) | ||
27 | return -ENOEXEC; | 26 | return -ENOEXEC; |
28 | /* | 27 | /* |
29 | * This section does the #! interpretation. | 28 | * This section does the #! interpretation. |
30 | * Sorta complicated, but hopefully it will work. -TYT | 29 | * Sorta complicated, but hopefully it will work. -TYT |
31 | */ | 30 | */ |
32 | 31 | ||
33 | bprm->recursion_depth++; | ||
34 | allow_write_access(bprm->file); | 32 | allow_write_access(bprm->file); |
35 | fput(bprm->file); | 33 | fput(bprm->file); |
36 | bprm->file = NULL; | 34 | bprm->file = NULL; |