From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=0.2 required=5.0 tests=BAYES_00,INVALID_MSGID, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,364dfbdf0a113a56 X-Google-Attributes: gid103376,public From: Gautier.DeMontmollin@maths.unine.ch (Gautier) Subject: Re: Looking for a smart linker for GNAT/DOS Date: 1997/04/16 Message-ID: <1997Apr16.162852.5886@news>#1/1 X-Deja-AN: 235209027 References: <1997Apr15.202909.5879@news> Organization: University of Neuchatel, Switzerland Reply-To: Gautier.deMontmollin@Maths.UniNe.CH Newsgroups: comp.lang.ada Date: 1997-04-16T00:00:00+00:00 List-Id: Samuel Tardieu : > Gautier> It could avoid the explosion of executables' sizes (47k for a > Gautier> ``null'' programme, 97k for a ``hello world'',...) > > Well, this has nothing to do with an "explosion", this is a rather > fixed overhead (depending on the packages you need). Sure, if you only > write "null" or "hello world" programs, this overhead is significant, > but as soon as you start working on real projects, then this becomes > insignificant. The skip from 47k to 97k with the usage of Text_IO is insignificant for a real project because you will use the greatest part of Text_IO. But, in a real project, you will (maybe) also use much bigger and specialized packages whom you use only 10% - e.g., a graphics package with tons of gadgets, curves, bars (I'm making an improved clone of Turbo Pascal's Graph, there the problem appears well...). So, the difference between the full packages sizes and the used part of them will *increase* with greater projects - this is why the <> term is appropriated. I'm thinking about the LAPACK library in FORTRAN, too: in many real projects, only a few from the thousends LAPACK routines are used. A GNAT/DOS implementation of it would produce executables of >20 megas (and certainly just wouldn't run on most machines), although they should be of a few hundreds of K if linked by a good linker! G.