Message-ID:	<19990818214617.A28538@tabor.ta.jcu.cz>
Date:	Wed, 18 Aug 1999 21:46:17 +0200
From:	Jan Hubicka <hubicka AT tabor DOT ta DOT jcu DOT cz>
To:	djgpp AT delorie DOT com
Subject:	Re: New gcc 2.95
References:	<7oqfvr$qpu$1 AT reader1 DOT wxs DOT nl> <Pine DOT SUN DOT 3 DOT 91 DOT 990812105820 DOT 9373R-100000 AT is> <19990815170554 DOT A17468 AT tabor DOT ta DOT jcu DOT cz> <0E16861EE7BCD111BE9400805FE6841F0AF6D76B AT c1s5x001 DOT cor DOT srvfarm DOT origin-it DOT com>
Mime-Version:	1.0
X-Mailer:	Mutt 0.93i
In-Reply-To:	<0E16861EE7BCD111BE9400805FE6841F0AF6D76B@c1s5x001.cor.srvfarm.origin-it.com>; from Bas Hamstra on Tue, Aug 17, 1999 at 02:43:06PM +0200
Reply-To:	djgpp AT delorie DOT com
X-Mailing-List:	djgpp AT delorie DOT com
X-Unsubscribes-To:	listserv AT delorie DOT com

> 
> optimation options used: 
> -o6 -fomit_frame_pointer
Anyway I would recommend you to experiment with -mpreferred-stack-boundary=2
because most of chess program does some kind of recursive game tree searching
that can be importantly slowed down by stack alignment issues.
Other options you might try are -funroll-loops (that usually helps to such
programs) and enable tunning for your cpu (-mcpu=<cpu>) supports
x86, pentium, pentiumpro and k6.

Honza

- Raw text -