What does "sibling calls" mean?

Question

On GCC manual,

-foptimize-sibling-calls

Optimize sibling and tail recursive calls.

I know tail recursive calls, for example

int sum(int n) { return n == 1 ? 1 : n + sum(n-1); }

However, what does sibling calls mean?

Answer 1

Tail Calls

If a function call is a last action performed in another function, it is said to be a tail call.

The name stems from the fact that the function call appears at the tail position of other function.

int foo(int a, int b) {     // some code ...     return bar(b);    // Tail call which is neither sibling call nor tail recursive call. } 

bar appears at the tail position of foo. Call to bar is a tail call.

---

Tail Recursive Calls

Tail recursive call is a special case of tail call where callee function is same as caller function.

int foo(int a, int b) {     if (a > 0) {         return foo(a - 1, b + 1);    // Tail recursive call     } else {         return b;     } } 

---

Sibling Calls

Sibling call is another special case of tail call where caller function and callee function do not need to be same, but they have compatible stack footprint.

That means the return types of both functions must be same, and the arguments being passed must take same stack space.

int foo(int a, int b) {     // some code ...     return bar(a - 1, b);    // Sibling call, also a tail call, but not a tail recursive call. } 

Every tail recursive call is a sibling call, Since the definition implies every function is a sibling of itself.

---

Why Distinction?

Because of identical stack footprint, replacing stack frame becomes relatively easier. Compiler writers don't have to resize stack frame, and in place mutation becomes straightforward.