From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by yquem.inria.fr (Postfix) with ESMTP id 775F3BB81 for ; Mon, 10 Oct 2005 04:15:09 +0200 (CEST) Received: from xproxy.gmail.com (xproxy.gmail.com [66.249.82.206]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id j9A2F8Na012415 for ; Mon, 10 Oct 2005 04:15:08 +0200 Received: by xproxy.gmail.com with SMTP id i27so712964wxd for ; Sun, 09 Oct 2005 19:15:08 -0700 (PDT) DomainKey-Signature: a=rsa-sha1; q=dns; c=nofws; s=beta; d=gmail.com; h=received:message-id:date:from:to:subject:mime-version:content-type:content-transfer-encoding:content-disposition; b=O5hpzk2PMv7v8T2PSN2Ov/vxDq4eFFXhruRpdr/4wm+U6Tt756tpr6nX88/UI6TrXSHFlYL6AGDE88+oMdkGAKTDsbw982fPV3Qr3KhinSdxMMwiQI/1odpzy3WA2BaNV0F6OJncWNPcHbBa/yxhTR3DR7RSD/C1bHIB844CvQA= Received: by 10.70.131.14 with SMTP id e14mr3301759wxd; Sun, 09 Oct 2005 19:15:08 -0700 (PDT) Received: by 10.70.132.17 with HTTP; Sun, 9 Oct 2005 19:15:08 -0700 (PDT) Message-ID: <4816a32d0510091915s75644e8drcd7f551401f102f2@mail.gmail.com> Date: Mon, 10 Oct 2005 07:45:08 +0530 From: Ganesh Narayan To: caml-list@yquem.inria.fr Subject: Caml Call Graphs MIME-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Content-Disposition: inline X-Miltered: at nez-perce with ID 4349CEAC.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; binary:01 cfa:98 graph:01 graph:01 functions:01 caml:02 caml:02 functional:02 gprof:03 languages:03 research:11 graphs:11 difficult:12 but:12 dept:13 X-Spam-Checker-Version: SpamAssassin 3.0.3 (2005-04-27) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=RCVD_BY_IP autolearn=disabled version=3.0.3 Hi, Is there a way to generate call graph for a Caml project? Tools like gprof are not all accurate as higher order functions get "flattened" in the binary. I understand that CFA for functional languages is _difficult_; but i believe even a less encompassing call graph generator would help us comprehend the code lot better. Thanks --ganesh =3D---------------------------------------------------------------=3D Ganesh Narayan, Research Asssitant, Dept. of CSA, IISc. =3D---------------------------------------------------------------=3D