pre-processed output for https://gist.github.com/jammy-dodgers/c9ffce1de8efeff767a84027bb34e5f1

IEnumermerable.preprocessed.c

struct Fibonacci
{
	int pos;
	int current;
	int n1;
	int n2;
};
struct Fibonacci new_Fibonacci()
{
	struct Fibonacci gener_temp_init_var;
	gener_temp_init_var.pos = 0;
	return gener_temp_init_var;
}
int Fibonacci_has_next(struct Fibonacci *vars)
{
	switch (vars->pos)
	{
	case 0:
	{
		vars->n1 = 0;
		vars->n2 = 1;
		while (vars->n1 < 10000)
		{
			int tmp = vars->n1;
			vars->n1 = vars->n2;
			vars->n2 = tmp + vars->n2;
			vars->current = (tmp);
			vars->pos = 1;
			return 1;
		case 1:;
		}
	};
		return 0;
	}
	return 0;
}
int main()
{
	struct Fibonacci f;
	f = new_Fibonacci();
	{
		struct Fibonacci foreach_loop_var;
		foreach_loop_var = f;
		while (Fibonacci_has_next(&foreach_loop_var))
		{
			int i = foreach_loop_var.current;
			{
				printf("%d\n", i);
			}
		}
	}
}