From: Hartmut Schirmer <hsc AT techfak DOT uni-kiel DOT de>
Newsgroups: comp.os.msdos.djgpp
Subject: Re: DJGPP V2.01 Released
Date: Thu, 24 Oct 1996 09:17:50 +0200
Organization: Technische Fakultaet, University of Kiel, Germany
Lines: 34
Message-ID: <326F181E.6635@techfak.uni-kiel.de>
References: <846008741 DOT 16600 DOT 0 AT abwillms DOT demon DOT co DOT uk>
NNTP-Posting-Host: zora.techfak.uni-kiel.de
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
To: "Alaric B. Williams" <alaric AT abwillms DOT demon DOT co DOT uk>
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp

Alaric B. Williams wrote:
> 
> On  2 Jan 94 at 10:14, Mark Habersack wrote:
> 
> > You're right, it takes time and effort to recompile the compiler. So I think
> > that it might be possible that someone would apply all the patches, compile
> > all the stuff, create diffs to the retail 2.01 and post them or make them
> > available. What do you, guys, think?
> 
> I've got V2.00 patched on my web server anyway, so I could do that
> when I D/L V2.01 at last!
> 
> It'll be in "http://www.abwillms.demon.co.uk/prog/"

Did anybody thougt about including the 

  'Bounds Checking for C' 
  (see http://www-ala.doc.ic.ac.uk/~phjk/BoundsChecking.html)

option in a DJGPP build compiler? Most time I just turn around and
around
to find those little stupid errors accessing arrays, dynamic chains, ...

Development would be much easier and the final program would benefit a
lot
from this option. A stable program with fast (and may be complicated)
algorithms will beat any optimizer, IMHO.

Hartmut 
-- 
Hartmut Schirmer                   | Phone: +49-431-77572-709  FAX:-703
Automatisierungs- & Regelungstech. | hsc AT techfak DOT uni-kiel DOT de
Technische Fakult"at,              | http://www.techfak.uni-kiel.de/~hsc
Kaiserstr. 2, 24143 Kiel, Germany  | PGP key via WWW, Key ID:6D84AEC1