I wanted to take a look at the assembly output for a tiny Rust function:
pub fn double(n: u8) -> u8 {
n + n
}
I used the Godbolt Compiler Explorer to generate and view the assembly (with the -O
flag, of course). It shows this output:
example::double:
push rbp
mov rbp, rsp
add dil, dil
mov eax, edi
pop rbp
ret
Now I'm a bit confused, as there are a few instructions that doesn't seem to do anything useful: push rbp
, mov rbp, rsp
and pop rbp
. From what I understand, I would think that executing these three instructions alone doesn't have any side effects. So why doesn't the Rust optimizer remove those useless instructions?
For comparisons, I also tested a C++ version:
unsigned char doubleN(unsigned char n) {
return n + n;
}
Assembly output (with -O
flag):
doubleN(unsigned char): # @doubleN(unsigned char)
add dil, dil
mov eax, edi
ret
And in fact, here those "useless" instructions from above are missing, as I would expect from an optimized output.
The short answer: Godbolt adds a -C debuginfo=1
flag which forces the optimizer to keep all instructions managing the frame pointer. Rust removes those instructions too when compiling with optimization and without debug information.
These three instructions are part of the function prologue and epilogue. In particular, here they manage the so called frame pointer or base pointer (rbp
on x86_64). Note: don't confuse the base pointer with the stack pointer (rsp
on x86_64)! The base pointer always points inside the current stack frame:
┌──────────────────────┐
│ function arguments │
│ ... │
├──────────────────────┤
│ return address │
├──────────────────────┤
[rbp] ──> │ last rbp │
├──────────────────────┤
│ local variables │
│ ... │
└──────────────────────┘
The interesting thing about the base pointer is that it points to a piece of memory in the stack which stores the last value of the rbp
. This means that we can easily find out the base pointer of the previous stack frame (the one from the function that called "us").
Even better: all base pointers form something similar to a linked list! We can easily follow all last rbp
s to walk up the stack. This means that at each point during program execution, we know exactly what functions called what other functions such that we end up "here".
Let's review the instructions again:
; We store the "old" rbp on the stack
push rbp
; We update rbp to hold the new value
mov rbp, rsp
; We undo what we've done: we remove the old rbp
; from the stack and store it in the rbp register
pop rbp
The base pointer and its "linked list" property are hugely important for debugging and analyzing program behavior in general (e.g. profiling). Without the base pointer, it's way more difficult to generate a stack trace and to locate the function that is currently executed.
Additionally, managing the frame pointer usually doesn't slow things down by a lot.
They usually would be, if Godbolt didn't pass -C debuginfo=1
to the compiler. This instructs the compiler to keep all things related to frame pointer handling, because we need it for debugging. Note that frame pointers are not inherently required for debugging -- other kinds of debug info usually suffice. Frame pointers are kept when storing any kind of debug info because there are still a few minor issues related to removing frame pointers in Rust programs. This is being discussed in this GitHub tracking issue.
You can "undo" it by just adding the flag -C debuginfo=0
yourself. This results in exactly the same output as the C++ version:
example::double:
add dil, dil
mov eax, edi
ret
You can also test it locally by executing:
$ rustc -O --crate-type=lib --emit asm -C "llvm-args=-x86-asm-syntax=intel" example.rs
Compiling with optimizations (-O
) automatically removes the rbp
handling if you don't explicitly turn on debug information.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With