From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 917 invoked by alias); 10 Nov 2003 07:55:46 -0000 Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Archive: List-Post: List-Help: Sender: gcc-bugs-owner@gcc.gnu.org Received: (qmail 899 invoked by uid 48); 10 Nov 2003 07:55:45 -0000 Date: Mon, 10 Nov 2003 07:55:00 -0000 Message-ID: <20031110075545.898.qmail@sources.redhat.com> From: "pinskia at gcc dot gnu dot org" To: gcc-bugs@gcc.gnu.org In-Reply-To: <20001212025602.1046.bouchard@onera.fr> References: <20001212025602.1046.bouchard@onera.fr> Reply-To: gcc-bugzilla@gcc.gnu.org Subject: [Bug optimization/1046] gcc less efficient than jdk for recursion! X-Bugzilla-Reason: CC X-SW-Source: 2003-11/txt/msg00801.txt.bz2 List-Id: ------- Additional Comments From pinskia at gcc dot gnu dot org 2003-11-10 07:55 ------- Note the code at least on powerp-apple-darwin produced by the Java's JIT is the same as GCC produces, so what that means is that the initial execution is faster than any code done by GCC. -- What |Removed |Added ---------------------------------------------------------------------------- Last reconfirmed|0000-00-00 00:00:00 |2003-11-10 07:55:45 date| | http://gcc.gnu.org/bugzilla/show_bug.cgi?id=1046