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,FREEMAIL_FROM
	autolearn=unavailable autolearn_force=no version=3.4.4
X-Received: by 10.50.111.194 with SMTP id ik2mr38948949igb.4.1432755482666;
 Wed, 27 May 2015 12:38:02 -0700 (PDT)
X-Received: by 10.140.80.168 with SMTP id c37mr409817qgd.39.1432755482497;
 Wed, 27 May 2015 12:38:02 -0700 (PDT)
Path: 
 buffer2.nntp.dca1.giganews.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!m20no366680iga.0!news-out.google.com!4ni71qgh.1!nntp.google.com!z60no4163164qgd.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Wed, 27 May 2015 12:38:02 -0700 (PDT)
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com;
 posting-host=105.237.62.132;
 posting-account=orbgeAkAAADzWCTlruxuX_Ts4lIq8C5J
NNTP-Posting-Host: 105.237.62.132
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <9ad1fcdc-cdf9-4ff0-aa7e-051d53b6736a@googlegroups.com>
Subject: longest path through a task
From: jan.de.kruyf@gmail.com
Injection-Date: Wed, 27 May 2015 19:38:02 +0000
Content-Type: text/plain; charset=ISO-8859-1
Xref: number.nntp.giganews.com comp.lang.ada:193330
Date: 2015-05-27T12:38:02-07:00
List-Id: <comp.lang.ada>

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?

At the moment I still rely on 'suck it and see' which is still quite accurate since it is small. But that is not going to carry the can in the end.

Thanks

j.