When run the code below:[code]void F(){

[AllenHe]

When run the code below:

void F()

{

  F();

}

EStackOverFlow will appear.
The book says that there is a loop going on. Can anyone explain to me?
Because I think in the Void F function, it will only use itself once.

 

[atomthick]

Yes, F will call again F and it will never stop. It will do this forever.

 

[Mark44]

The first time F is called, right away there is a call to F. In the executable, the compiler has generated the code that is necessary to call a function. This code includes placing the return value on the stack and any parameters, and so on.

As soon as F is entered, there's a call to F again, with more stuff being pushed on the stack.

This process keeps repeating until you eventually run out of stack space, at which time the exception is thrown.

 

[camel-man]

When ever you are using recursion make sure you have a base case to avoid stack overflows.

 

[Xitami]

void f(int a){
	printf("%d\n", a-(int)&a);
	f(a);
}

int main() {
	int z;
	f((int)&z); 
}

 

[TylerH]

The first time F is called, right away there is a call to F. In the executable, the compiler has generated the code that is necessary to call a function. This code includes placing the return value on the stack and any parameters, and so on.

The return value is returned in eax (in cdecl and stdcall). But I'm just nit picking. I'm sure you knew that, but were being general. :)
[/quote]Right. I meant return address, but wrote return value instead.

In this case, it's the return address that's causing the overflow. The x86 assembly instruction "call" is used to call functions. When call is used, it pushes the return address onto the stack. In your program, the return address is pushed repeatedly by call until you get a stack overflow.

 

[Mark44]

The return value is returned in eax (in cdecl and stdcall). But I'm just nit picking. I'm sure you knew that, but were being general. :)

Right. I meant return address, but wrote return value instead.

In this case, it's the return address that's causing the overflow. The x86 assembly instruction "call" is used to call functions. When call is used, it pushes the return address onto the stack. In your program, the return address is pushed repeatedly by call until you get a stack overflow.

And if there are parameters to the function, they get pushed onto the stack as well, for some of the calling conventions, and that tends to eat up stack memory. I didn't bring this up, since the OP's function didn't take parameters.