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=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,8550a669e508dc5c
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Dependency Graph of with statements
Date: 1997/04/02
Message-ID: <dewar.860006667@merv>#1/1
X-Deja-AN: 230221313
References: <33427AFD.1AFD@gdls.com>
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1997-04-02T00:00:00+00:00
List-Id: <comp.lang.ada>


Art says

<<I have a tool in development which takes the adamakegen log file and
develops a dependency graph from it. If no other tool is available,
this tool will be extended to allow identification of package subsets
such that there are no dependency cycles between subsets ("mutual
dependencies" in Rational terminology).>>

The ali files in GNAT contain complete dependency information, and provide
an easy starting point for computing dependencies.

Note that you cannot easily deal with inline dependencies for systems
with conventional libraries, since such systems do not permit general
inlining. So it is probably better to generate the ali files with the
-gnatn switch left off if you are following this suggestion.