Recursive Function Calling Example with Stack Addresses, C++ (clang)

Recursive Function Calling Example with Stack Addresses

Language: Layout:

// clang 3.8.0
// Example from Lecture 6 in class on recursive functions
// Showing addresses of arguments and data on stack
// and values on the heap

#include <iostream>
using namespace std;

int recursiveAdd(int n) 
{
    int returnValue;
    cout << "Calling recursiveAdd: n = " << n << " Address of n = " << &n << " Address of return = " << &returnValue << endl;
    if (n==1) {
        returnValue = 1;
    } else {
        returnValue = n + recursiveAdd(n-1);
    }
    return returnValue;
}

int main()
{
    const int constValue = 3;
    int *iPtr = new int;
    (*iPtr) = 5;
    int *jPtr = new int;
    (*jPtr) = 5;
    int answer;
    cout << "Test Program" << endl;
    cout << "Pointer size is " << sizeof(iPtr) << " bytes, int size is " << sizeof(answer) << " bytes" << endl;
    cout << "Address of const value is " << &constValue << endl;
    cout << "Calling recursiveAdd: i = " << (*iPtr) << " Address of iPtr = " << iPtr << endl;
    answer = recursiveAdd((*iPtr));   
    cout << "Triangle sum of " << (*iPtr) << " = " << answer << endl;
    cout << "Calling recursiveAdd: j = " << (*jPtr) << " Address of jPtr = " << jPtr << endl;
    answer = recursiveAdd((*jPtr));   
    cout << "Triangle sum of " << (*jPtr) << " = " << answer << endl;
    
    return 0;
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.62 sec, absolute running time: 0.14 sec, cpu time: 0 sec, memory peak: 3 Mb, absolute service time: 0,77 sec

Test Program Pointer size is 8 bytes, int size is 4 bytes Address of const value is 0x7ffd3074776c Calling recursiveAdd: i = 5 Address of iPtr = 0x1e48010 Calling recursiveAdd: n = 5 Address of n = 0x7ffd3074773c Address of return = 0x7ffd30747738 Calling recursiveAdd: n = 4 Address of n = 0x7ffd3074770c Address of return = 0x7ffd30747708 Calling recursiveAdd: n = 3 Address of n = 0x7ffd307476dc Address of return = 0x7ffd307476d8 Calling recursiveAdd: n = 2 Address of n = 0x7ffd307476ac Address of return = 0x7ffd307476a8 Calling recursiveAdd: n = 1 Address of n = 0x7ffd3074767c Address of return = 0x7ffd30747678 Triangle sum of 5 = 15 Calling recursiveAdd: j = 5 Address of jPtr = 0x1e48030 Calling recursiveAdd: n = 5 Address of n = 0x7ffd3074773c Address of return = 0x7ffd30747738 Calling recursiveAdd: n = 4 Address of n = 0x7ffd3074770c Address of return = 0x7ffd30747708 Calling recursiveAdd: n = 3 Address of n = 0x7ffd307476dc Address of return = 0x7ffd307476d8 Calling recursiveAdd: n = 2 Address of n = 0x7ffd307476ac Address of return = 0x7ffd307476a8 Calling recursiveAdd: n = 1 Address of n = 0x7ffd3074767c Address of return = 0x7ffd30747678 Triangle sum of 5 = 15