Recursive calls to a function - why is the address of the parameter passed to it lowering with each call?





.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box;
}







8















Consider following code:



#include <iostream>
using namespace std;
void test_func(int address) {
cout<<&address<<" ";
if(address < 0x7FFBEE26) {
test_func(address);
}
}
int main()
{
test_func(512);
cout<<"Hello";
return 0;
}


Hello from main() is certainly not reached, since the recursive calls to test_func never end.



However, from what I can see in the cout present in test_func - the addresses being printed are lower and lower with each iteration. Why is that happening?










share|improve this question









New contributor




tears allo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
















  • 2





    You are passing a copy - that has to have an address

    – UnholySheep
    5 hours ago






  • 1





    Remember that the default stack size on linux is 10MB and its 1 MB on windows. Also the stack need not be in the same location each time you run your program.

    – drescherjm
    4 hours ago













  • I can't understand why this isn't eligible for tail-call optimization. The invocation of test_func is the last line in the function...

    – cyberbisson
    4 hours ago








  • 5





    @cyberbisson The parameters of the nested invocations of test_func must appear to have different addresses per language rules, and because the address of address was passed to operator<< the compiler can't prove that this is unobservable.

    – T.C.
    3 hours ago











  • @T.C. So, the problem is that the callee might remember and use it still?

    – Deduplicator
    2 hours ago


















8















Consider following code:



#include <iostream>
using namespace std;
void test_func(int address) {
cout<<&address<<" ";
if(address < 0x7FFBEE26) {
test_func(address);
}
}
int main()
{
test_func(512);
cout<<"Hello";
return 0;
}


Hello from main() is certainly not reached, since the recursive calls to test_func never end.



However, from what I can see in the cout present in test_func - the addresses being printed are lower and lower with each iteration. Why is that happening?










share|improve this question









New contributor




tears allo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
















  • 2





    You are passing a copy - that has to have an address

    – UnholySheep
    5 hours ago






  • 1





    Remember that the default stack size on linux is 10MB and its 1 MB on windows. Also the stack need not be in the same location each time you run your program.

    – drescherjm
    4 hours ago













  • I can't understand why this isn't eligible for tail-call optimization. The invocation of test_func is the last line in the function...

    – cyberbisson
    4 hours ago








  • 5





    @cyberbisson The parameters of the nested invocations of test_func must appear to have different addresses per language rules, and because the address of address was passed to operator<< the compiler can't prove that this is unobservable.

    – T.C.
    3 hours ago











  • @T.C. So, the problem is that the callee might remember and use it still?

    – Deduplicator
    2 hours ago














8












8








8








Consider following code:



#include <iostream>
using namespace std;
void test_func(int address) {
cout<<&address<<" ";
if(address < 0x7FFBEE26) {
test_func(address);
}
}
int main()
{
test_func(512);
cout<<"Hello";
return 0;
}


Hello from main() is certainly not reached, since the recursive calls to test_func never end.



However, from what I can see in the cout present in test_func - the addresses being printed are lower and lower with each iteration. Why is that happening?










share|improve this question









New contributor




tears allo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












Consider following code:



#include <iostream>
using namespace std;
void test_func(int address) {
cout<<&address<<" ";
if(address < 0x7FFBEE26) {
test_func(address);
}
}
int main()
{
test_func(512);
cout<<"Hello";
return 0;
}


Hello from main() is certainly not reached, since the recursive calls to test_func never end.



However, from what I can see in the cout present in test_func - the addresses being printed are lower and lower with each iteration. Why is that happening?







c++






share|improve this question









New contributor




tears allo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question









New contributor




tears allo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question








edited 4 hours ago









drescherjm

6,59923553




6,59923553






New contributor




tears allo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 5 hours ago









tears allotears allo

441




441




New contributor




tears allo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





tears allo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






tears allo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








  • 2





    You are passing a copy - that has to have an address

    – UnholySheep
    5 hours ago






  • 1





    Remember that the default stack size on linux is 10MB and its 1 MB on windows. Also the stack need not be in the same location each time you run your program.

    – drescherjm
    4 hours ago













  • I can't understand why this isn't eligible for tail-call optimization. The invocation of test_func is the last line in the function...

    – cyberbisson
    4 hours ago








  • 5





    @cyberbisson The parameters of the nested invocations of test_func must appear to have different addresses per language rules, and because the address of address was passed to operator<< the compiler can't prove that this is unobservable.

    – T.C.
    3 hours ago











  • @T.C. So, the problem is that the callee might remember and use it still?

    – Deduplicator
    2 hours ago














  • 2





    You are passing a copy - that has to have an address

    – UnholySheep
    5 hours ago






  • 1





    Remember that the default stack size on linux is 10MB and its 1 MB on windows. Also the stack need not be in the same location each time you run your program.

    – drescherjm
    4 hours ago













  • I can't understand why this isn't eligible for tail-call optimization. The invocation of test_func is the last line in the function...

    – cyberbisson
    4 hours ago








  • 5





    @cyberbisson The parameters of the nested invocations of test_func must appear to have different addresses per language rules, and because the address of address was passed to operator<< the compiler can't prove that this is unobservable.

    – T.C.
    3 hours ago











  • @T.C. So, the problem is that the callee might remember and use it still?

    – Deduplicator
    2 hours ago








2




2





You are passing a copy - that has to have an address

– UnholySheep
5 hours ago





You are passing a copy - that has to have an address

– UnholySheep
5 hours ago




1




1





Remember that the default stack size on linux is 10MB and its 1 MB on windows. Also the stack need not be in the same location each time you run your program.

– drescherjm
4 hours ago







Remember that the default stack size on linux is 10MB and its 1 MB on windows. Also the stack need not be in the same location each time you run your program.

– drescherjm
4 hours ago















I can't understand why this isn't eligible for tail-call optimization. The invocation of test_func is the last line in the function...

– cyberbisson
4 hours ago







I can't understand why this isn't eligible for tail-call optimization. The invocation of test_func is the last line in the function...

– cyberbisson
4 hours ago






5




5





@cyberbisson The parameters of the nested invocations of test_func must appear to have different addresses per language rules, and because the address of address was passed to operator<< the compiler can't prove that this is unobservable.

– T.C.
3 hours ago





@cyberbisson The parameters of the nested invocations of test_func must appear to have different addresses per language rules, and because the address of address was passed to operator<< the compiler can't prove that this is unobservable.

– T.C.
3 hours ago













@T.C. So, the problem is that the callee might remember and use it still?

– Deduplicator
2 hours ago





@T.C. So, the problem is that the callee might remember and use it still?

– Deduplicator
2 hours ago












1 Answer
1






active

oldest

votes


















15














Likely address is being placed on the stack and, on your platform, the stack grows downward in memory. See this question about stack growth direction for more.






share|improve this answer
























    Your Answer






    StackExchange.ifUsing("editor", function () {
    StackExchange.using("externalEditor", function () {
    StackExchange.using("snippets", function () {
    StackExchange.snippets.init();
    });
    });
    }, "code-snippets");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "1"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });






    tears allo is a new contributor. Be nice, and check out our Code of Conduct.










    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f55800947%2frecursive-calls-to-a-function-why-is-the-address-of-the-parameter-passed-to-it%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    15














    Likely address is being placed on the stack and, on your platform, the stack grows downward in memory. See this question about stack growth direction for more.






    share|improve this answer




























      15














      Likely address is being placed on the stack and, on your platform, the stack grows downward in memory. See this question about stack growth direction for more.






      share|improve this answer


























        15












        15








        15







        Likely address is being placed on the stack and, on your platform, the stack grows downward in memory. See this question about stack growth direction for more.






        share|improve this answer













        Likely address is being placed on the stack and, on your platform, the stack grows downward in memory. See this question about stack growth direction for more.







        share|improve this answer












        share|improve this answer



        share|improve this answer










        answered 5 hours ago









        David SchwartzDavid Schwartz

        140k14146232




        140k14146232
























            tears allo is a new contributor. Be nice, and check out our Code of Conduct.










            draft saved

            draft discarded


















            tears allo is a new contributor. Be nice, and check out our Code of Conduct.













            tears allo is a new contributor. Be nice, and check out our Code of Conduct.












            tears allo is a new contributor. Be nice, and check out our Code of Conduct.
















            Thanks for contributing an answer to Stack Overflow!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f55800947%2frecursive-calls-to-a-function-why-is-the-address-of-the-parameter-passed-to-it%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            Bundesstraße 106

            Verónica Boquete

            Ida-Boy-Ed-Garten