Is there any way to know the stack address of stack allocated local variable created using alloca instruction in LLVM









up vote
1
down vote

favorite












I have a simple add program.



int main() 

int x=10,y=10,result=0;
result=x+y;
return 0;



I created a LLVM frontend module pass which can traverse through the entire module.



So my pass iterates through the basic block and fetches me instructions.



FORE(iter, (*bb)) 
if(isa<AllocaInst>(iter))
errs()<<"The address of allocated variable is "<<&(*iter);




The output of this would be the address of alloca instruction but not the real stack address of the local variable.



Is there any way I can get the stack address of local variable using pass?










share|improve this question

























    up vote
    1
    down vote

    favorite












    I have a simple add program.



    int main() 

    int x=10,y=10,result=0;
    result=x+y;
    return 0;



    I created a LLVM frontend module pass which can traverse through the entire module.



    So my pass iterates through the basic block and fetches me instructions.



    FORE(iter, (*bb)) 
    if(isa<AllocaInst>(iter))
    errs()<<"The address of allocated variable is "<<&(*iter);




    The output of this would be the address of alloca instruction but not the real stack address of the local variable.



    Is there any way I can get the stack address of local variable using pass?










    share|improve this question























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      I have a simple add program.



      int main() 

      int x=10,y=10,result=0;
      result=x+y;
      return 0;



      I created a LLVM frontend module pass which can traverse through the entire module.



      So my pass iterates through the basic block and fetches me instructions.



      FORE(iter, (*bb)) 
      if(isa<AllocaInst>(iter))
      errs()<<"The address of allocated variable is "<<&(*iter);




      The output of this would be the address of alloca instruction but not the real stack address of the local variable.



      Is there any way I can get the stack address of local variable using pass?










      share|improve this question













      I have a simple add program.



      int main() 

      int x=10,y=10,result=0;
      result=x+y;
      return 0;



      I created a LLVM frontend module pass which can traverse through the entire module.



      So my pass iterates through the basic block and fetches me instructions.



      FORE(iter, (*bb)) 
      if(isa<AllocaInst>(iter))
      errs()<<"The address of allocated variable is "<<&(*iter);




      The output of this would be the address of alloca instruction but not the real stack address of the local variable.



      Is there any way I can get the stack address of local variable using pass?







      llvm llvm-ir






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked Nov 11 at 14:59









      Arjun

      184




      184






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          2
          down vote



          accepted










          You can't.



          It is not even guaranteed the address of the variables will be the same when you run the program multiple times (see Address Space Layout Randomization), so there's no way one could predict the address statically.



          Even if we did know that the stack always started at a fixed address, it is perfectly normal for the same variable to have a different address during different calls of the function. Take this for example:



          #include <stdio.h>

          void f()
          int x;
          printf("The address of x is: %pn", &x);


          void g()
          int y;
          f();


          int main()
          f();
          g();
          return 0;



          Assuming you compile this without optimizations (which would remove the definition of y), this will print two different addresses for x. So when looking at the definition of f, we couldn't possibly predict the address of its variables because it isn't even going to be the same within the same run of the program.



          Furthermore your phase isn't going to know which optimizations are going to run after it, which variables are going to be stored in registers or which register are going to be spilled to stack memory - all of which would affect the addresses.






          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',
            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
            );



            );













            draft saved

            draft discarded


















            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53249973%2fis-there-any-way-to-know-the-stack-address-of-stack-allocated-local-variable-cre%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








            up vote
            2
            down vote



            accepted










            You can't.



            It is not even guaranteed the address of the variables will be the same when you run the program multiple times (see Address Space Layout Randomization), so there's no way one could predict the address statically.



            Even if we did know that the stack always started at a fixed address, it is perfectly normal for the same variable to have a different address during different calls of the function. Take this for example:



            #include <stdio.h>

            void f()
            int x;
            printf("The address of x is: %pn", &x);


            void g()
            int y;
            f();


            int main()
            f();
            g();
            return 0;



            Assuming you compile this without optimizations (which would remove the definition of y), this will print two different addresses for x. So when looking at the definition of f, we couldn't possibly predict the address of its variables because it isn't even going to be the same within the same run of the program.



            Furthermore your phase isn't going to know which optimizations are going to run after it, which variables are going to be stored in registers or which register are going to be spilled to stack memory - all of which would affect the addresses.






            share|improve this answer
























              up vote
              2
              down vote



              accepted










              You can't.



              It is not even guaranteed the address of the variables will be the same when you run the program multiple times (see Address Space Layout Randomization), so there's no way one could predict the address statically.



              Even if we did know that the stack always started at a fixed address, it is perfectly normal for the same variable to have a different address during different calls of the function. Take this for example:



              #include <stdio.h>

              void f()
              int x;
              printf("The address of x is: %pn", &x);


              void g()
              int y;
              f();


              int main()
              f();
              g();
              return 0;



              Assuming you compile this without optimizations (which would remove the definition of y), this will print two different addresses for x. So when looking at the definition of f, we couldn't possibly predict the address of its variables because it isn't even going to be the same within the same run of the program.



              Furthermore your phase isn't going to know which optimizations are going to run after it, which variables are going to be stored in registers or which register are going to be spilled to stack memory - all of which would affect the addresses.






              share|improve this answer






















                up vote
                2
                down vote



                accepted







                up vote
                2
                down vote



                accepted






                You can't.



                It is not even guaranteed the address of the variables will be the same when you run the program multiple times (see Address Space Layout Randomization), so there's no way one could predict the address statically.



                Even if we did know that the stack always started at a fixed address, it is perfectly normal for the same variable to have a different address during different calls of the function. Take this for example:



                #include <stdio.h>

                void f()
                int x;
                printf("The address of x is: %pn", &x);


                void g()
                int y;
                f();


                int main()
                f();
                g();
                return 0;



                Assuming you compile this without optimizations (which would remove the definition of y), this will print two different addresses for x. So when looking at the definition of f, we couldn't possibly predict the address of its variables because it isn't even going to be the same within the same run of the program.



                Furthermore your phase isn't going to know which optimizations are going to run after it, which variables are going to be stored in registers or which register are going to be spilled to stack memory - all of which would affect the addresses.






                share|improve this answer












                You can't.



                It is not even guaranteed the address of the variables will be the same when you run the program multiple times (see Address Space Layout Randomization), so there's no way one could predict the address statically.



                Even if we did know that the stack always started at a fixed address, it is perfectly normal for the same variable to have a different address during different calls of the function. Take this for example:



                #include <stdio.h>

                void f()
                int x;
                printf("The address of x is: %pn", &x);


                void g()
                int y;
                f();


                int main()
                f();
                g();
                return 0;



                Assuming you compile this without optimizations (which would remove the definition of y), this will print two different addresses for x. So when looking at the definition of f, we couldn't possibly predict the address of its variables because it isn't even going to be the same within the same run of the program.



                Furthermore your phase isn't going to know which optimizations are going to run after it, which variables are going to be stored in registers or which register are going to be spilled to stack memory - all of which would affect the addresses.







                share|improve this answer












                share|improve this answer



                share|improve this answer










                answered Nov 11 at 15:28









                sepp2k

                291k37593605




                291k37593605



























                    draft saved

                    draft discarded
















































                    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.





                    Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                    Please pay close attention to the following guidance:


                    • 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%2f53249973%2fis-there-any-way-to-know-the-stack-address-of-stack-allocated-local-variable-cre%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







                    這個網誌中的熱門文章

                    Barbados

                    How to read a connectionString WITH PROVIDER in .NET Core?

                    Node.js Script on GitHub Pages or Amazon S3