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=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: a07f3367d7,385c146dd3112519
X-Google-Attributes: gida07f3367d7,public,usenet
X-Google-NewGroupId: yes
X-Google-Language: ENGLISH,ASCII
Path: 
 g2news1.google.com!news4.google.com!proxad.net!feeder1-2.proxad.net!news.in2p3.fr!in2p3.fr!oleane.net!oleane!hunter.axlog.fr!nobody
From: Jean-Pierre Rosen <rosen@adalog.fr>
Newsgroups: comp.lang.ada
Subject: Re: Private or public task ?
Date: Wed, 10 Feb 2010 12:38:56 +0100
Organization: Adalog
Message-ID: <hs5ukh.9t7.ln@hunter.axlog.fr>
References: 
 <a35584dd-8693-484d-918d-758940dccfe8@d37g2000yqa.googlegroups.com>
  <hki3p7$bas$1@tornado.tornevall.net>
 <38a0a3f9-b4a0-48f3-98c9-63b03fe03aca@q4g2000yqm.googlegroups.com>
  <e714f043-9fed-4e2b-b3d2-180b0364f0cf@d27g2000yqn.googlegroups.com>
  <f7048897-bce0-4e1d-8f49-85fe274d7292@v25g2000yqk.googlegroups.com>
  <narrkh.9g.ln@hunter.axlog.fr>
 <ca04a621-bdf9-4958-b395-6e59126e7511@x22g2000yqx.googlegroups.com>
NNTP-Posting-Host: mailhost.axlog.fr
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 8bit
X-Trace: s1.news.oleane.net 1265802873 26183 195.25.228.57 (10 Feb 2010
 11:54:33 GMT)
X-Complaints-To: abuse@oleane.net
NNTP-Posting-Date: Wed, 10 Feb 2010 11:54:33 +0000 (UTC)
User-Agent: Thunderbird 2.0.0.23 (Windows/20090812)
In-Reply-To: 
 <ca04a621-bdf9-4958-b395-6e59126e7511@x22g2000yqx.googlegroups.com>
Xref: g2news1.google.com comp.lang.ada:9075
Date: 2010-02-10T12:38:56+01:00
List-Id: <comp.lang.ada>

Maciej Sobczak a �crit :
> On 9 Lut, 15:26, Jean-Pierre Rosen <ro...@adalog.fr> wrote:
> 
>> There are two kinds of blockings: bounded and unbounded. The idea is
>> that when computing a time budget, you can account for bounded
>> blockings, but not unbounded ones.
> 
>> The "potentially blocking" phrase should be understood as really meaning
>> unbounded.
> 
> Well, I know what you try to convey, but there are traps:
> 
>    delay Some_Static_Constant;
> 
> Is it bounded or unbounded?
> 
For the rules of potentially blocking operations, delay is potentially
blocking because it /can/ be unbounded. Many unbounded things can be
proved bounded with sufficient analysis and provided some elements are
static; that's not the point here.

-- 
---------------------------------------------------------
           J-P. Rosen (rosen@adalog.fr)
Visit Adalog's web site at http://www.adalog.fr