Xref: utzoo comp.lang.fortran:851 comp.software-eng:651
Path: utzoo!attcan!uunet!nuchat!sugar!ssd
From: ssd@sugar.UUCP (Scott Denham)
Newsgroups: comp.lang.fortran,comp.software-eng
Subject: Re: Fortran follies
Summary: Dependency analysis
Message-ID: <2229@sugar.UUCP>
Date: 1 Jul 88 00:36:23 GMT
References: <5377@cup.portal.com> <2852@mmintl.UUCP> <1005@cresswell.quintus.UUCP> <801@garth.UUCP>
Organization: Sugar Land UNIX - Houston, TX
Lines: 15

In article <801@garth.UUCP>, smryan@garth.UUCP writes:
  
> Actually, you want the compiler to know if you want really snazzy dependency
> analysis. (Ah, yes, see this diophantine equation has a solution for n=xxx.
> But my vectors ar only yyy long. Oh, no problem.) Of course nobody has
> dependency analysis quite that snazzy.


YOW - perhaps it's a good thing that nobody does, too!! I've used those 
sorts of tricks when writing AP microcode and have found that though
they may yield impressive performance when done right, may also lead
to strange and not-so-wonderful things happening when someone get in
there and tweaks a bit. 
 Still, I wouldn't turn down a compiler with that kind of snazzy 
analysis if it were offered!! :}