Programming Forums - Converting 16bit Code To 32bit Code

I have to create a assembly program that does the Fibonacci series using recursion. I wrote the program in 16bit code using a subproc for the fibonacci recursion and debugged it until it works. Then I converted the code to 32bit code by adding the E's to the registers and adding a few lines to the top. I also doubled the pointer addresses that I use. This program also has to be complied with C++ code.

Like I said when the program runs in 16-bit mode, everything work fine. But when it's converted and complied w/ C++ code, when I input 1, it works fine. However when I put in 2 I get 4551668. However when I put in 3, i get 4551669. If i substract 4551668 from whatever number I get, it works. So here's my question - where does the 4551668 come from? Is there something i'm not taking into consideration when i'm debugging it?

any suggestion would be extremely helpful...

thanks
Matt

here's my code...

.386p

.model flat

.code



_fib proc near



        push ebp

        mov ebp,esp

        mov eax,[ebp+8]

  

        cmp eax,1

        je L2A

        cmp eax,0

        je L2B

        

        L1:



;fib(n-2)

        

                sub eax,2

 push eax

 CALL _fib 



 add esp,4



        ;fib(n-1)



 mov eax,[ebp+8];reset N value

        

                sub eax,1

 push eax

 CALL _fib 



 add esp,4

 mov eax,edx



 jmp L2B

        

        L2A:

                add edx,1

 pop ebp

 jmp L2D

 

        L2B:

 pop ebp

 

        L2D:

 ret



_fib endp

END

my C++ code

#include <iostream>

using namespace std;



extern "C" unsigned int fib(int);



int main ()

        {

        int N;

        unsigned int result;



        cout<<"Enter a Postitive Integer: ";

        cin>>N;



        result=fib(N);

        cout<<N<<" fib number -> "<<result<<endl;



        cout<<"Enter a Postitive Integer: ";

        cin>>N;

        }

  

        return 0;

        }