------- Comment #8 from sergstesh at yahoo dot com 2008-12-30 00:08 -------
(In reply to comment #7)
> (In reply to comment #6)
> > My primary concern is segmentation fault, not the cases when 'gcc' can't
> > allocate enough memory and reports the problem clearly.
>
> The seg fault is most likely some recursive function gone wrong.
>
I guess the recursive function is in 'gcc'.
Anyway, if you look at the code (probably you've already looked), you'll find
that though it's long, it's simple. I mean, there is a whole lot of similar
relatively simple expressions like this one:
____accumulator[sample_number] += 5.37523999999999973e-09 *
exp(-5.40939200000000003e-06 * d_sample_number) * cos(1.95404999999999995e-01 *
two_pi_times_sample_number - (1.32515999999999989e+00));
.
So, simplistically, because the expressions are simple and the optimization
level is low, I do not see too much place for deep recursion, but I'm
unfamiliar with 'gcc' internals.
--
sergstesh at yahoo dot com changed:
What |Removed |Added
----------------------------------------------------------------------------
Severity|normal |major
Component|middle-end |c
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=38666
