[m-dev.] for review: higher-order write_graph

[Fergus Henderson]

That looks good now, thanks.

On 27-Feb-2001, Peter Ross <peter.ross at miscrit.be> wrote:
> 
> Move changes from reuse branch onto the main branch.
> These changes were introduced on the reuse branch so that we could
> produce dot files which showed which predicates were calling reuse
> versions, and hence easily determine where reuse was being lost.
> 
> compiler/dependency_graph.m:
>     Add two new predicates write_graph and write_graph_nodes, which take
>     higher order arguments which determine what to write for a node and
>     edge in the graph.
>     Change build_dependency_graph so that it optionally also includes
>     arcs to imported procedures.
>     Change write_dependency_graph and write_prof_dependency_graph to use
>     the new higher order predicates.
> 
> compiler/hlds_module.m:
>     Document the constraints on the dependency_info stored in the
>     module_info.

-- 
Fergus Henderson <fjh at cs.mu.oz.au>  |  "I have always known that the pursuit
                                    |  of excellence is a lethal habit"
WWW: <http://www.cs.mu.oz.au/~fjh>  |     -- the last words of T. S. Garp.
--------------------------------------------------------------------------
mercury-developers mailing list
Post messages to:       mercury-developers at cs.mu.oz.au
Administrative Queries: owner-mercury-developers at cs.mu.oz.au
Subscriptions:          mercury-developers-request at cs.mu.oz.au
--------------------------------------------------------------------------