Run-time execution for recursive functions.
I actually dont know how CPU (or the compiled run-time code) handles recursive functions. Is the code of the function copied “a-la memcpy” to make a new instance? Or only the local vars are copied for the new instance?
Does the size of the function influence on the speed of the recursive function? If so, are long-inline macros be counter-productive, and better to have as normal function calls?
I ask all this because I don’t know exactly how run-time execution handles subroutines (above all in recursive funcs.).