I mean math functions (sin ,cos, sqrt, etc) basic FP comes with gcc and implementation is heavy -- just check the code. libfp which comes with libc is faster, but no inf, nans, etc. treatment implemented. I actually wrote it to handle numbers which come from adc12. They are defenetely less that 2^12, non-negative. All I wanted to do is just to have some recursive second order filter. However, libfp will work for other _numbers_ until singularity occures.
~d On Wednesday 04 June 2003 15:51, Steve Underwood wrote: > Dmitry wrote: > >Concerning FP benchmarking. All FP code is originally written by DEC and > > not optimized for small cpus. I just took that code (from newlib) and > > made it 'runnable'. If you want to improve it -- be my guest. > > I think you mean the library functions are from DEC. The actual floating > point arithmetic routines are the software FP support built into GCC, > aren't they? I don't think that code came from DEC. > > Regards, > Steve > > > > > > ------------------------------------------------------- > This SF.net email is sponsored by: Etnus, makers of TotalView, The best > thread debugger on the planet. Designed with thread debugging features > you've never dreamed of, try TotalView 6 free at www.etnus.com. > _______________________________________________ > Mspgcc-users mailing list > [email protected] > https://lists.sourceforge.net/lists/listinfo/mspgcc-users -- /******************************************************************** ("`-''-/").___..--''"`-._ (\ Dimmy the Wild UA1ACZ `6_ 6 ) `-. ( ).`-.__.`) Enterprise Information Sys (_Y_.)' ._ ) `._ `. ``-..-' Nevsky prospekt, 20 / 44 _..`--'_..-_/ /--'_.' ,' Saint Petersburg, Russia (il),-'' (li),' ((!.-' +7 (812) 3468202, 5585314 ********************************************************************/
