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 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!news.swapon.de!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail From: Niklas Holsti Newsgroups: comp.lang.ada Subject: Re: longest path through a task Date: Wed, 27 May 2015 23:09:19 +0300 Organization: Tidorum Ltd Message-ID: References: <9ad1fcdc-cdf9-4ff0-aa7e-051d53b6736a@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain; charset=windows-1252; format=flowed Content-Transfer-Encoding: 7bit X-Trace: individual.net gvJFelHBv94oorLLb8ghUQB1nb6XmHK2Hwqt7ZoAlhkCmBChNp Cancel-Lock: sha1:MZC32kKuUawIl3W8+L7xXMiTR8Y= User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.8; rv:31.0) Gecko/20100101 Thunderbird/31.7.0 In-Reply-To: <9ad1fcdc-cdf9-4ff0-aa7e-051d53b6736a@googlegroups.com> Xref: news.eternal-september.org comp.lang.ada:26024 Date: 2015-05-27T23:09:19+03:00 List-Id: On 15-05-27 22:38 , jan.de.kruyf@gmail.com wrote: > Good day, > > I was trying to find a semi-automatic way to find the longest runtime > path through a task (on an ARM cpu) programmed in ada. Does the gnat > compiler offer such a thing perhaps? There are tools calls "WCET analyzers" that compute, or try to compute, an upper bound on the execution time of a program, or a subprogram. There are two main groups: static analyzers, exemplified by aiT (www.absint.com) or Bound-T (www.bound-t.com), and hybrid ones that combine measurement with control-flow analysis, exemplified by RapiTime (www.rapitasystems.com). What kind of ARM are you using? A classic ARM7, or a Cortex? "M" series? -- Niklas Holsti Tidorum Ltd niklas holsti tidorum fi . @ .