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.9 required=5.0 tests=BAYES_00 autolearn=unavailable autolearn_force=no version=3.4.4 X-Received: by 2002:a24:2f0e:: with SMTP id j14mr13187319itj.14.1544023972607; Wed, 05 Dec 2018 07:32:52 -0800 (PST) X-Received: by 2002:a9d:bd5:: with SMTP id 79mr439001oth.7.1544023972502; Wed, 05 Dec 2018 07:32:52 -0800 (PST) Path: eternal-september.org!reader01.eternal-september.org!feeder.eternal-september.org!feeder3.usenet.farm!feed.usenet.farm!feeder.usenetexpress.com!feeder-in1.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!k10no99779itk.0!news-out.google.com!v141ni113ita.0!nntp.google.com!q69no99162itb.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Wed, 5 Dec 2018 07:32:52 -0800 (PST) In-Reply-To: <5846093f-ace9-4c8b-b4d7-d714b787d477@googlegroups.com> Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=136.163.203.3; posting-account=HFCrOQoAAABZD_f-UUbYHm3lJDIrh-UX NNTP-Posting-Host: 136.163.203.3 References: <8441254e-f634-4077-b8d9-d988dab3406c@googlegroups.com> <5846093f-ace9-4c8b-b4d7-d714b787d477@googlegroups.com> User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: Subject: Re: Profiling Ada applications using gprof From: joakimds@kth.se Injection-Date: Wed, 05 Dec 2018 15:32:52 +0000 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Xref: reader01.eternal-september.org comp.lang.ada:54959 Date: 2018-12-05T07:32:52-08:00 List-Id: > Isn't a or missing before delay 10.0? The rendoz-vous will always take 10= sec. > And then you can skip the do thing: That's correct but consider the following thought experiment: Imagine being= new in an Ada project with a mature code base which has been worked on for= 20+ years and is around 2 million lines of Ada code. Imagine it takes a lo= ng time to shut down the application and the question is how to quickly fin= d out why. Maybe somebody has put a long running calculation by mistake ins= ide an entry call like in the example above where a delay statement has bee= n used instead to simulate work being done. How is there any hope to find o= ut quickly in the huge code base if it isn't possible in the tiny example c= ode I have provided in the original post? How can one avoid manual inspecti= on/review?