Selon Pablo Rogina <[EMAIL PROTECTED]>: > > I have a CPU > > intensive program (chess) that works *very* well. I reach a number of > > positions calculated per second that is fantastic. > > > > So, the code generated by cegcc is very efficient for me, without any > > special -march, -mcpu, etc. options ! > > Very good news, congratulations for the developers of cegcc directly > involved with this. > > Pascal, do you have any numbers/comparisons that you may want to share with > the > project to be included in the FAQ/Documentation pages?
Sorry I don't have comparative benchmarks that are easily understandable, but the chess engines I ported calculates the same number of nodes per second than others that are built with MS tools. Pascal ------------------------------------------------------------------------- SF.Net email is sponsored by: The Future of Linux Business White Paper from Novell. From the desktop to the data center, Linux is going mainstream. Let it simplify your IT future. http://altfarm.mediaplex.com/ad/ck/8857-50307-18918-4 _______________________________________________ Cegcc-devel mailing list Cegcc-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/cegcc-devel
