Fibonacci component for hal, houston we have a problem

component fibonacci"Fibonacci";

description 
"""

Fibonacci Component
https://en.wikipedia.org/wiki/Fibonacci_number

Improvements :
This component can be related to time and space.

Practical usage :
The output can be adapted to external offset branche to visualise the Fibonacci effect.
The output can be inversed when expanding the code.

""";

author "Grotius CNC Machines, Oktober 2018";

license "GPL";

option singleton yes;
//option userspace yes;


option extra_link_args "-L/usr/local/lib -lEMC_Access";

//option extra_link_args "…"
 
//Input hal connection :

//Output hal connection :
pin in bit Enable;             //Trigger this rapid function..
variable float A;                //u32 is only positive to 4294967295
variable float B;                //s32 values = integer numbers -2147483648 to 2147483647

pin out u32 C_old;             //
pin out u32 C_new;             //
pin out u32 C_sum;             //
pin out u32 Fibonacci_value    "Same pin as C_sum";

variable double Time;          //timer 
variable int Counter;

function _;

;;

#include "rtapi.h"		/* RTAPI realtime OS API */
#include "rtapi_app.h"		/* RTAPI realtime module decls */
#include "rtapi_string.h"
#include "hal.h"		/* HAL public API decls */
#include "stdio.h"
#include "rtapi_math.h"

typedef enum { INIT, POSITIVE_LOOP, STOP} state_T;  // To be expand with negative loop.
state_T state = INIT;


FUNCTION(_) {  

    switch(state){

         case INIT:
         
         //Visual Fibonacci calculation setup :
         //Line_-6.    -8 - 5 = -13
         //Line_-5.    -5 - 3 = -8
         //Line_-4.    -3 - 2 = -5
         //Line_-3.    -2 - 1 = -3
         //Line_-2.    -1 - 1 = -2
         //Line_-1.     0 - 1 = -1 
         //Line_0.      0 = 0
         //Line_1.      0(A)     + 1(B) = 1(C_old)  --> Begin startup loop   
         //Line_2.      1(C_old) + 1(B) = 2(C_new)                         --> (C_old)        
         //Line_3.                        3(C_sum)  --> End startup loop   --> (C_new)   --> (C_old)           
         //Line_4.                        5(C)                             --> (C_sum)   --> (C_new)  --> (C_old)    
         //Line_5.                        8(C)                                           --> (C_sum)  --> (C_new)
         //Line_6.                       13(C)                                                        --> (C_sum)
         
         C_old = 0;
         C_new = 0;
         C_sum = 0;
         Counter = 0;
         
         //INIT     
         A = 0;
         B = 1;
         Time = 0; //Not used today.
   
         //Begin Startup loop.
         C_old = A + B;          // = 0 + 1 = 1
         C_new = C_old + B;      // = 1 + 1 = 2 
         C_sum = C_old + C_new;  // = 3
         //End startup loop, C_sum has the first calculated output value. 1 + 2 = 3
         
         //Start positive loop.
           state = POSITIVE_LOOP;           
         break;

    case POSITIVE_LOOP:

         if(Enable){
         //Begin Fibonacci loop.
         C_old = C_new;                   //Step up 2
         C_new = C_sum;                   //Step up 3
         C_sum = C_old + C_new;           //New output value, 2+3=5 next, next 5+3=8, ..
         printf("%d\n", C_sum); 
         Fibonacci_value = C_sum;   
         if(C_sum = 2147483647){state = STOP;}      
	     } 
               
         //if(Fibonacci_value > 9000000000000000000){printf("We are in singulatiry mode");}    
	
	     if(!Enable){
			 state = INIT;   
			 // Start from zero again ...            
	     }	
	     
	     break;
	     
	 case STOP: 
	     
	     if(Enable){
	          printf("C_sum found at = 2147483647"); 
		      } 
		       
		 if(!Enable){
			  state = INIT;
		      }     
		       
	     //https://en.wikipedia.org/wiki/2,147,483,647#Barlow's_prediction
	 
	     break;
                     
    }     

}