From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from majordomo@localhost) by pauillac.inria.fr (8.7.6/8.7.3) id EAA25469; Tue, 27 May 2003 04:39:34 +0200 (MET DST) X-Authentication-Warning: pauillac.inria.fr: majordomo set sender to owner-caml-list@pauillac.inria.fr using -f Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id EAA25722 for ; Tue, 27 May 2003 04:39:33 +0200 (MET DST) Received: from hosting.commandprompt.com ([207.173.200.199]) by concorde.inria.fr (8.11.1/8.11.1) with ESMTP id h4R2dWH05470 for ; Tue, 27 May 2003 04:39:32 +0200 (MET DST) Received: from respighi.local. (pool-151-199-48-185.bos.east.verizon.net [151.199.48.185]) (authenticated) by hosting.commandprompt.com (8.11.6/8.11.6) with ESMTP id h4R2QQt02229; Mon, 26 May 2003 19:26:26 -0700 Date: Mon, 26 May 2003 22:40:48 -0400 Subject: Re: [Caml-list] generating a call-graph Content-Type: text/plain; charset=US-ASCII; format=flowed Mime-Version: 1.0 (Apple Message framework v543) Cc: caml-list@inria.fr To: "Yaron M. Minsky" From: Jeff Henrikson In-Reply-To: <52762.141.155.88.179.1053707680.squirrel@minsky-primus.homeip.net> Message-Id: <9FBF4890-8FEC-11D7-A6F1-00039375801A@yahoo.com> Content-Transfer-Encoding: 7bit X-Mailer: Apple Mail (2.543) X-Spam: no; 0.00; henrikson:01 jehenrik:01 caml-list:01 invocation:01 ocamldep:01 lexically:01 yaron:01 minsky:01 cornell:01 yminsky:01 keyid:01 bug:01 faq:01 beginner's:01 beginners:01 Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk > Does anyone know a way of generating a call-graph from a set of ocaml > sources? What I want to do is, at a minimum, get a list of all the > functions that could be called as a result of a given function > invocation. > Essentially, I'm looking for dependency information on the > function-call > level, similar to what ocamldep provides on the module level. Xavier Leroy points out something more complicated than I was thinking. What I was going to do was, for each function f with a definition in the top environment, generate the list of all other such functions lexically bound inside f. Maybe add a hack for non-functor modules or something. So that throws out all anonymous functions and lots more. It's not really about call path. I was presuming it was for assisting visual code inspection. What is it for in reality? Jeff On Friday, May 23, 2003, at 12:34 PM, Yaron M. Minsky wrote: > Does anyone know a way of generating a call-graph from a set of ocaml > sources? What I want to do is, at a minimum, get a list of all the > functions that could be called as a result of a given function > invocation. > Essentially, I'm looking for dependency information on the > function-call > level, similar to what ocamldep provides on the module level. > > y > > -- > |--------/ Yaron M. Minsky \--------| > |--------\ http://www.cs.cornell.edu/home/yminsky/ /--------| > > Open PGP --- KeyID B1FFD916 (new key as of Dec 4th) > Fingerprint: 5BF6 83E1 0CE3 1043 95D8 F8D5 9F12 B3A9 B1FF D916 > > > > ------------------- > To unsubscribe, mail caml-list-request@inria.fr Archives: > http://caml.inria.fr > Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: > http://caml.inria.fr/FAQ/ > Beginner's list: http://groups.yahoo.com/group/ocaml_beginners > ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners