From: "Bruce G. Stewart" <bruce.g.stewart@worldnet.att.net>
To: 9fans@cse.psu.edu
Subject: Re: [9fans] Installing the updates
Date: Wed, 2 Aug 2000 08:32:55 +0000 [thread overview]
Message-ID: <39878BDB.BFD4CEEC@worldnet.att.net> (raw)
In-Reply-To: <200008011707.NAA25570@cse.psu.edu>
Russ Cox wrote:
>
> Where's the horror here? Computers are fast. Pushing extra work on
> programmers and creating an unnecessary portability issue is a high
> cost. Reading a header file five or more times during compilation is
> a low cost (and one which can be optimized away for ifdef-protected
> headers; I'm told gcc does so).
>
> While it may be simpler when it works, when
> it fails it does so in mysterious ways. I don't know
> how many times I've tried to figure out why
> some header file I wanted wasn't getting included,
> only to find that it had _already_ been included,
> by someone else, with different things #defined,
> so the definition or prototype_I_ wanted wasn't
> there.
>
> I'd much rather have the compiler barf on a
> #define or something like that, than hop over
> the whole file as though it weren't there.
>
> Russ
I think nested includes also lead to excessive factoring - there is a
folklore that says small include files are better because fewer things
need to be recompiled when a header is changed.
More includes makes for more interdependencies, so one resorts to
nesting to reduce the amount of typing. Then one needs a tool to find
all the dependencies to create the mkfile. One wants to run it whenever
a header changes in case some new nested dependency has been introduced.
Perhaps a mkfile to mk your mkfile is the answer.. and on it goes.
I also find the one library / one h principal attractive. I'd rather
have the compiler wasting its time scanning one behemoth text than
scanning a lot of little files looking for #endif.
next prev parent reply other threads:[~2000-08-02 8:32 UTC|newest]
Thread overview: 33+ messages / expand[flat|nested] mbox.gz Atom feed top
2000-08-01 17:06 Russ Cox
2000-08-02 8:32 ` Bruce G. Stewart [this message]
-- strict thread matches above, loose matches on Subject: below --
2000-08-02 9:47 forsyth
2000-08-02 9:52 ` Boyd Roberts
2000-08-01 16:27 rob pike
2000-08-02 10:53 ` Ralph Corderoy
2000-08-01 16:26 rob pike
2000-08-02 21:49 ` Steve Simon
2000-08-01 13:35 rob pike
2000-08-01 18:34 ` Greg Hudson
2000-08-02 9:53 ` Douglas A. Gwyn
2000-08-01 13:06 rob pike
2000-08-01 13:10 ` Lucio De Re
2000-08-01 12:55 rob pike
2000-08-02 9:39 ` Douglas A. Gwyn
2000-08-01 6:04 Russ Cox
2000-08-01 5:42 Russ Cox
2000-07-31 17:09 Russ Cox
2000-07-31 15:57 jmk
2000-07-31 15:15 rob pike
2000-08-01 8:53 ` Douglas A. Gwyn
2000-08-01 12:12 ` Howard Trickey
2000-08-02 9:11 ` Douglas A. Gwyn
2000-08-01 14:31 ` Ralph Corderoy
2000-08-01 16:03 ` Greg Hudson
2000-08-01 16:32 ` James A. Robinson
2000-08-01 17:05 ` James A. Robinson
2000-08-02 9:39 ` Douglas A. Gwyn
2000-08-02 9:11 ` Douglas A. Gwyn
2000-08-03 14:51 ` ozan s. yigit
[not found] <djhender@telusplanet.net>
2000-07-31 14:53 ` Doug Henderson
2000-07-31 17:38 ` Scott Schwartz
2000-07-31 20:10 ` Steve Simon
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=39878BDB.BFD4CEEC@worldnet.att.net \
--to=bruce.g.stewart@worldnet.att.net \
--cc=9fans@cse.psu.edu \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).