www.delorie.com/archives/browse.cgi   search  
Mail Archives: pgcc/1998/03/13/18:23:32

X-pop3-spooler: POP3MAIL 2.1.0 b 3 961213 -bs-
Delivered-To: pcg AT goof DOT com
Message-Id: <3.0.32.19980313192225.00699d50@uniserv.uniplan.it>
X-Sender: us0082 AT uniserv DOT uniplan DOT it (Unverified)
X-Mailer: Windows Eudora Pro Version 3.0 (32)
Date: Fri, 13 Mar 1998 19:22:46 +0100
To: beastium-list AT desk DOT nl
From: Angelo Pesce <us0082 AT uniserv DOT uniplan DOT it>
Subject: Pgcc optimization methods / ideas
Cc: pcg AT goof DOT com
Mime-Version: 1.0
Sender: Marc Lehmann <pcg AT goof DOT com>
Status: RO
X-Status: A
Lines: 10

How does pgcc optimize the output???
Which optimization methods are implemented???
Does it optimize fixed multiplications with the lea method???
Does it perform any other "famous" instruction trick???
When are you going to implement MMX instructions???
Does it perform floating point/integer instructions pipelining???
Is it faster than Watcom C/C++ 11???
Is the djgcc libc well optimized???

Thanks, Angelo Pesce.

- Raw text -


  webmaster     delorie software   privacy  
  Copyright © 2019   by DJ Delorie     Updated Jul 2019