From: Robert A Duff <bobduff@shell01.TheWorld.com>
Subject: Re: Example question
Date: Sun, 26 Oct 2014 11:48:15 -0400
Date: 2014-10-26T11:48:15-04:00 [thread overview]
Message-ID: <wcc38aaq1c0.fsf@shell01.TheWorld.com> (raw)
In-Reply-To: Ar73w.335365$Hb3.325531@fx03.iad
Shark8 <OneWingedShark@gmail.com> writes:
> It means that if it enters the SELECT and there are already tasks
> waiting at the rendezvous for both entry-points then one will be chosen
> "at random".
It is not required to be random, and it is unlikely that any Ada
implementation would make it random. By default, which one is
chosen is arbitrary. The implementation will likely do something
simple, like always choosing the first one. It won't roll dice. ;-)
If you specify the Priority_Queuing policy, then the highest priority
call is chosen. If there are multiple calls at that priority, it
chooses the first one. See D.4(14).
>...(Though I heard that some compilers /did/ have a
> deterministic behavior here.)
Yes. All compilers, I'd guess.
- Bob
next prev parent reply other threads:[~2014-10-26 15:48 UTC|newest]
Thread overview: 8+ messages / expand[flat|nested] mbox.gz Atom feed top
2014-10-26 13:27 Example question compguy45
2014-10-26 14:18 ` Martyn Pike
2014-10-26 15:46 ` J-P. Rosen
2014-10-26 16:53 ` Martyn Pike
2014-10-26 14:21 ` Shark8
2014-10-26 15:42 ` Simon Wright
2014-10-26 15:48 ` Robert A Duff [this message]
2014-10-26 14:33 ` Niklas Holsti
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox