# Greg Foletta - Bits and Blobs

A melange of networking, data science and programming.

# What the #!

Working with computers you take a lot for granted. You assume your press of the keyboard will bubble up through the kernel to your terminal, your HTTP request will remain intact after travelling halfway across the globe, and that your stream of a cat video will be decoded and rendered on your screen. Taking these things for granted isn’t a negative, in fact quite the opposite. The countless abstractions and indirections that hide the internal details of a computer are the reason that people - computer science degree or not - can use them in some shape or form.

But at times it’s an unsatisfying feeling not knowing how something is working under the hood, and there’s a want to “pay some attention to the person behind the curtain”. This happened recently to me when writing a script and adding the obligatory hashbang (#!) to the first line. I’ve done this hundreds of times before and know that this specifies the interpreter (and optional arguments) that run the rest of the file, but I wanted to understand how this worked: where is the line parsed, and how is the interpreter run?

So in this article, join me for a dive through user and kernel space in order to answer the question:

How is an interpreter called when specified using a hashbang in the first line of a script?

# Two Notes

When discussing kernel components, we’ll be using the following version of Linux:

uname -sor

Linux 4.15.0-142-generic GNU/Linux


In places I’ll be pasting snippets of C from the kernel source code. The code snippets won’t include things such as error checking, locking, and other items I deem only tangentially related the core question of this article. I will include a link to the full source of each function, and elipses (…) will be added to show you that code has been removed.

# Execution and Userspace

Let’s dive in - here’s an example Perl script that we’ll run, and the modification of its permission to allow it to be executed.

cat data/foo.pl

chmod u+x data/foo.pl

#!/usr/bin/perl

use strict;
use warnings;
use 5.010;
use Data::Dumper;

print Dumper [@ARGV];


The first investigative tool we’ll use is strace, which attaches itself to a process and intercepts system calls. In the below code snippet, we run strace with the -e argument to filter out all but the system calls we’re interested in. I’ve done this for brevity within the article, but you’d likely want to look through the whole trace to get a firm idea about what the process is doing.

A bash process is run, which then executes our script:

strace -e trace=vfork,fork,clone,execve bash -c './data/foo.pl argument_1'

execve("/bin/bash", ["bash", "-c", "./data/foo.pl argument_1"], 0x7ffffdf84020 /* 100 vars */) = 0
execve("./data/foo.pl", ["./data/foo.pl", "argument_1"], 0x563c6922a890 /* 100 vars */) = 0
$VAR1 = [ 'argument_1' ]; +++ exited with 0 +++  The strace utility shows us two processes executions: the initial bash shell (which will have followed the clone() call from the original shell and not captured), then the path of our script being passed directly to the execve() system call. This is the system call that executes processes. It’s prototype is: int execve( const char *filename, char *const argv[], char *const envp[] );  with *filename containing the path to the program to run, *argv[] containing the command line arguments, and *envp[] containing the environment variables. What does this tell us? It tells us that the scripts are passed directly this system call, and it’s not the bash process that parses or acts on the hash-bang line. # A Quick Look in glibc We’ll stay in userspace a little longer, as the bash process doesn’t call the system call directly. The execve() function is part of the standard C library (on my machine it’s glibc), to which bash is dynamically linked. While it’s unlikely that anything of significance is occurring in the library, let’s be rigorous and take a look. We can use the ldd utility to print out the dynamic libraries linked at runtime by the dynamic linker: ldd$(which bash)

	linux-vdso.so.1 (0x00007ffea7d8c000)
libtinfo.so.5 => /lib/x86_64-linux-gnu/libtinfo.so.5 (0x00007f289d576000)
libdl.so.2 => /lib/x86_64-linux-gnu/libdl.so.2 (0x00007f289d372000)
libc.so.6 => /lib/x86_64-linux-gnu/libc.so.6 (0x00007f289cf81000)
/lib64/ld-linux-x86-64.so.2 (0x00007f289daba000)


We can see that libc on my machine is located at /lib/x86_64-linux-gnu/libc.so.6. Using objdump we can disassemble the shared library, and we extract out the section that’s related to execve().

objdump -d /lib/x86_64-linux-gnu/libc.so.6 | sed -n '/^[[:xdigit:]]\+ <execve/,/^$/p'  00000000000e4c00 <execve@@GLIBC_2.2.5>: e4c00: b8 3b 00 00 00 mov$0x3b,%eax
e4c05:	0f 05                	syscall
e4c07:	48 3d 01 f0 ff ff    	cmp    $0xfffffffffffff001,%rax e4c0d: 73 01 jae e4c10 <execve@@GLIBC_2.2.5+0x10> e4c0f: c3 retq e4c10: 48 8b 0d 51 62 30 00 mov 0x306251(%rip),%rcx # 3eae68 <h_errlist@@GLIBC_2.2.5+0xdc8> e4c17: f7 d8 neg %eax e4c19: 64 89 01 mov %eax,%fs:(%rcx) e4c1c: 48 83 c8 ff or$0xffffffffffffffff,%rax
e4c20:	c3                   	retq
e4c21:	66 2e 0f 1f 84 00 00 	nopw   %cs:0x0(%rax,%rax,1)
e4c28:	00 00 00
e4c2b:	0f 1f 44 00 00       	nopl   0x0(%rax,%rax,1)


As expected, the standard library doesn’t deal with the hashbang line either. It places 0x3b (decimal 59) - the execve system call number- into the eax reigster and calls the fast system call x86 instruction. The instructions following the syscall instruction deal with error handling on the return from the kernel.

It would take another whole article to dive into the process of jumping from user space into the kernel through a system call. I’ve provided a brief overview in an appendix at the bottom of this article. Instead, we’ll jump straight to the execve() system call definition in the kernel.

# Delving Into the Kernel

We skip over the first few function calls which only tangentially relate to our question we’re trying to answer: SYSCALL_DEFINE3(execve) calls do_execve() which callsdo_execveat_common().

It’s at this point where we start to see some items of interest:

• The allocation of the linux_binprm structure, which is the primary structure we’ll be concerned with in this article. The members we’re focused on are:
• char buf[BINPRM_BUF_SIZE] - holds first 128 bytes of the file being executed.
• int argc, envc - our command line argument and environment counts
• const char * filename - the name of the binary that’s seen by the ‘ps’ utility.
• const char * interp - name of the binary that was really executed.
• The opening of file based on the path passed to the system call.
• Initialisation of some temporary stack space to hold the command line arguments and environment variables.
• Copying of the first 128 bytes of the executed file to a buffer.
• Counting of the number of argument and environment variables.
• Copying of the argument and environment variables on to the stack.

Here’s the code with my comments inline:

static int do_execveat_common(int fd, struct filename *filename,
struct user_arg_ptr argv,
struct user_arg_ptr envp,
int flags)
{
//The most pertinent structure
struct linux_binprm *bprm;
...
//Allocate space for the structure
bprm = kzalloc(sizeof(*bprm), GFP_KERNEL);
...
//Open our file that's being executed, and add it
//to the bprm structure
file = do_open_execat(fd, filename, flags);
bprm->file = file;

//Copy the name of the file to the structure
//The 'else' deals with situations where a
//file descriptor (/dev/fd/*) has been passed
//to the execve call.
if (fd == AT_FDCWD || filename->name[0] == '/') {
bprm->filename = filename->name;
} else {
...
}
//At this stage, our interpreter is the same
//as the file being executed.
bprm->interp = bprm->filename;

//Create some temporary stack space
//to copy the command and environment
//variables to
retval = bprm_mm_init(bprm);

//Count the argument variables.
bprm->argc = count(argv, MAX_ARG_STRINGS);

//Count the environment variables.
bprm->envc = count(envp, MAX_ARG_STRINGS);

//In this function, the bprm->buf character
//array is zeroed out, and the first 128 bytes
//of the file are copied into it.
retval = prepare_binprm(bprm);

//Copy the filename on to the stack, which becomes
retval = copy_strings_kernel(1, &bprm->filename, bprm);
//Copy the environment variables on to the temporary
//stack
retval = copy_strings(bprm->envc, envp, bprm);
//Copy the command line arguments on to the
//temporary stack
retval = copy_strings(bprm->argc, argv, bprm);
...
retval = exec_binprm(bprm);
...
}


The next function called, exec_binprm(), has as its main responsibility the calling of search_binary_handler(). Let’s look at how that’s dealt with.

# Binary Handler Search

The binary handler is responsible for iterating through the list of supported binary formats, and dispatching the load_binary() function of each one.

int search_binary_handler(struct linux_binprm *bprm)
{
struct linux_binfmt *fmt;
int retval;
...
/* This allows 4 levels of binfmt rewrites before failing hard. */
if (bprm->recursion_depth > 5)
return -ELOOP;
...

list_for_each_entry(fmt, &formats, lh) {
...
bprm->recursion_depth++;
bprm->recursion_depth--;
...
}
...
return retval;
}


The formats global variable is a linked list of linux_binfmt structures. Some of these are defined in the kernel, but they can also be loaded via loadable kernel modules. These are registered using the register_binfmt() function. The built-in These include the common ELF format, the older a.out format, but the one we are most interested in is the ‘script’ format.

Here’s the structure and the code code that registers the script format:

static struct linux_binfmt script_format = {
.module		= THIS_MODULE,
};

static int __init init_script_binfmt(void)
{
register_binfmt(&script_format);
return 0;
}


We can see that for a script, the load_binary function pointer that the search_binary_handler() function will dispatch points to the load_script() function. Let’s now turn our attention to this.

# Script Binary Format

The load_script() function must first determine whether it is the appropriate handler for the file that’s being executed. The binprm structure has the first 128 bytes of the file to be executed in the buf member. It looks at the first two bytes and checks whether they are the hash-bang. If not then it returns -ENOEXEC.

static int load_script(struct linux_binprm *bprm)
{
const char *i_arg, *i_name;
char *cp;
struct file *file;
int retval;

if ((bprm->buf[0] != '#') || (bprm->buf[1] != '!'))
return -ENOEXEC;


The rest of the function can be broken down into three parts:

1. Parsing the interpreter and arguments
2. Splitting the interpreter and arguments
3. Updating the command line arguments
4. Recalling binary handler

## Parsing the Interpreter & Arguments

At this point the function knows it’s a script, so now it has to extract the interpreter and any arguments out of the 128 byte buffer. I’ve commented each line of this processes below:

//Add a NUL to the end so the string is NUL terminated.
bprm->buf[BINPRM_BUF_SIZE - 1] = '\0';

//The end of the string is either:
// a) A newline character, or
// b) The end of the buffer
if ((cp = strchr(bprm->buf, '\n')) == NULL)
cp = bprm->buf+BINPRM_BUF_SIZE-1;

//For a) above, replaces the newline with a NUL.
//If it was b) above, it redundantly replaces a NUL
//with another NUL
*cp = '\0';

//Work our way backwards through the buffer
while (cp > bprm->buf) {
cp--;
//If the character is whitespace, replace it with
//a NUL
if ((*cp == ' ') || (*cp == '\t'))
*cp = '\0';
//Otherwise, we've found the end of the interpreter
//string
else
break;
}

//After the hashbang (the buf + 2), remove any whitespace
for (cp = bprm->buf+2; (*cp == ' ') || (*cp == '\t'); cp++);
//If we hit a NUL, the line only contains a hashbang
//with no interpreter
if (*cp == '\0')
return -ENOEXEC; /* No interpreter name found */
//i_name (and cp) points to the start of the interpreter string
i_name = cp;


At the end of this process, i_name points to the first character of a NUL terminated string containing the path to the interpreter and arguments, with whitespace before and after being removed.

+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+----+
| / | u | s | r | / | b | i | n | / | e | n | v |   | p | e | r | l | \0 |
+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+----+
^
|
+------+
|i_name|
+------+


## Splitting the Interpreter and Arguments

The string now needs to be split into its components: the path to the interpreter, and any arguments to that interpreter:

i_arg = NULL;
//cp still points to the start of the interpreter string,
//exlcluding any whitespace.
//
//Move along the string until we either hit
// a) A NUL character, or
// b) A space or a tab
for ( ; *cp && (*cp != ' ') && (*cp != '\t'); cp++)
/* nothing */ ;
//If there is whitespace, replace it with a NUL character
while ((*cp == ' ') || (*cp == '\t'))
*cp++ = '\0';
//If there are bytes after the whitespace, these become
//the arguments to the interpreter.
if (*cp)
i_arg = cp;


Again, taking our example script, the pointers now point to the following pieces of memory:

+---+---+---+---+---+---+---+---+---+---+---+---+----+---+---+---+---+----+
| / | u | s | r | / | b | i | n | / | e | n | v | \0 | p | e | r | l | \0 |
+---+---+---+---+---+---+---+---+---+---+---+---+----+---+---+---+---+----+
^                                                    ^
|                                                    |
+------+                                             +-----+
|i_name|                                             |i_arg|
+------+                                             +-----+


One of the main implications of this code is that you cannot have whitespace in the interpreter path, as anything after the whitespace is considered arguments to the interpreter.

## Updating the Arguments

The arguments and argument counts now need to be updated. If we ran our script as ./foo.pl foo_arg, and the hashbang line was #!/usr/bin/perl perl_arg, the new command line arguments need to be ./usr/bin/perl perl_arg ./foo.pl foo_arg. Because of the way the stack is laid out, this is done in reverse order.

//The current argv[0] (the filename of our script) is removed
//from the temporary stack
retval = remove_arg_zero(bprm);
...
//Add in the filename of the script being executed.
retval = copy_strings_kernel(1, &bprm->interp, bprm);
...
bprm->argc++;
if (i_arg) {
//If the interpreter line has arguments, add these in to the stack.
retval = copy_strings_kernel(1, &i_arg, bprm);
...
bprm->argc++;
}
//Finallly, add the interpreter, which becomes arg[0].
retval = copy_strings_kernel(1, &i_name, bprm);
...
bprm->argc++;
//Update the 'interp bprm member, which will now
//be difference to the 'filename' member.
retval = bprm_change_interp(i_name, bprm);


Now that the the interpreter has been parsed and the bprm structure updated, the interpreter is opened as a file, and the search_binary_hander() is called again. Except this time it will be searching for a binary handler for our interpreter.

file = open_exec(i_name);
if (IS_ERR(file))
return PTR_ERR(file);

bprm->file = file;
retval = prepare_binprm(bprm);
if (retval < 0)
return retval;
return search_binary_handler(bprm);


The interpreter is of this type:

file /usr/bin/perl

/usr/bin/perl: ELF 64-bit LSB shared object, x86-64, version 1 (SYSV), dynamically linked, interpreter /lib64/ld-linux-x86-64.so.2, for GNU/Linux 3.2.0, BuildID[sha1]=e865d791bb4b89f4ab5e7ec1217e38ff6c31f3ed, stripped


Thus the ELF binary handler will be called, doing what it needs to do to load the binary and add it to the kernel scheduler, eventually running the process.

# Summary

We started this article out with a question: how is an interpreter called when used in a hashbang line of script. We used some tools to determine whether it was performed in userspace, but found that it was the kernel that performed this task.

We went through the kernel, starting at the execve() system call, working our way down to the binary handlers. We then went through the ‘script’ binary handler, which matches files that have ‘#!’ as their first two bytes. We could see how this handler parsed the interpreter line, extracting the interpreter path and optional arguments, and updating the binary to be called by the kernel.

This is an example of an elegant and generalised solution by the Linux kernel.

# Appendix - System Calls

When we started delving into the kernel, we skipped over the syscall instruction and the system call handler in the kernel; this appendix summarises what happens between. There’s a number of different variables that change the code path (page table isolation, slow and fast paths), so it’s a simplification.

As with the rest of this article, we only consider an x86_64 processor architecture, and I’m also going to ignore the page table isolation feature introduced to mitigate against the Meltdown vulnerability.

• The syscall instruction:
• Saves the address of the following instruction to the rcx register
• Loads a new instruction pointer from the IA32_LSTAR model specific register.
• Jumps to the new instruction at a ring 0 privilege level.
• The IA32_LSTAR register holds the address if entry_SYSCALL_64, which is our system call handler.
• The entry_SYSCALL_64 handler performs re-organisation required to transition from userspace to kernel space.
• Main task is to push all the current registers on to some new stack space.
• There’s loads of other things, but let’s consider them out of scope for this summarisation.
• The system call is then called using its number (in the rax register) as an index into the sys_call_table array.
• This is an array of function pointers to each of the system calls.
• The file in the #include <asm/syscalls_64.h>` line is generated dynamically.
• It’s generated from the syscall table file.
• This is converted into a header via a simple shell script.