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-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,a011e82e0079f0ea X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-08-11 10:05:31 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!newsfeed.stueberl.de!eusc.inter.net!cs.tu-berlin.de!not-for-mail From: Stephan Heinemann Newsgroups: comp.lang.ada Subject: Re: Ravenscar - Multiple Protected Entries Date: 11 Aug 2003 17:05:31 GMT Organization: Technische Universitaet Berlin, Deutschland Message-ID: References: <3F35AFA7.1030905@spam.com> <3F369A4E.1050406@spam.com> NNTP-Posting-Host: fiesta.cs.tu-berlin.de Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit X-Trace: news.cs.tu-berlin.de 1060621531 22157 130.149.17.156 (11 Aug 2003 17:05:31 GMT) X-Complaints-To: news@cs.tu-berlin.de NNTP-Posting-Date: 11 Aug 2003 17:05:31 GMT User-Agent: tin/1.4.6-20020816 ("Aerials") (UNIX) (SunOS/5.9 (sun4u)) Xref: archiver1.google.com comp.lang.ada:41320 Date: 2003-08-11T17:05:31+00:00 List-Id: > FIFO_Within_Priorities has nothing to do with it. There are 2 queues, > and each has only 1 task in it, so each task is at the head of its > queue. Each task is next to execute when its respective barrier becomes > True. And the language rules do not specify which task executes first. > So it is non-deterministic which task will execute next. I am a littlebit confused... In 9.5.3 you can find the following statement: "If calls from two or more queues are simultaneously eligible for selection, the default entry queuing policy does not specify which queue is serviced first.". The default queuing policy is FIFO_Queuing. In section D.4 you can find the following: "When more than one condition of an entry_barrier of a protected object becomes True, and more than one of the respective queues is nonempty, the call with the highest priority is selected. If more than one such call has the same priority, the call that is queued on the entry whose declaration is first in textual order in the protected_definition is selected. For members of the same entry family, the one with the lower family index is selected." Well, what shall I believe now? Stephan