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.1 required=5.0 tests=BAYES_20,INVALID_DATE autolearn=no autolearn_force=no version=3.4.4 Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!utgpu!water!watmath!clyde!rutgers!labrea!jade!ucbvax!sei.cmu.EDU!Alfred.Peterson From: Alfred.Peterson@sei.cmu.EDU.UUCP Newsgroups: comp.lang.ada Subject: Answer to 'a question' Message-ID: <1987.8.27.15.36.30.Alfred.Peterson@sei.cmu.edu> Date: Thu, 27-Aug-87 11:58:37 EDT Article-I.D.: sei.1987.8.27.15.36.30.Alfred.Peterson Posted: Thu Aug 27 11:58:37 1987 Date-Received: Sat, 29-Aug-87 17:07:04 EDT Sender: usenet@ucbvax.BERKELEY.EDU Distribution: world Organization: The ARPA Internet List-Id: Text of question:: VAx Ada(tm) LRM 9.5.13 (?) says: If several tasks call the same entry before a corresponding accept statement is reached, the calls are queued. .. The calls are processed in the order of arrival. My question is: Are those entry calls queued in the order of calls? In other words, is the order of call the same as that of arrival? -- Haerim Lee (IE53@NTSUVAX) Answer:: YES. The rules for several tasks calling an entry are the same as for one caller as described in LRM 9.5.12. The key is that the execution of the calling task is suspended AFTER the queuing of the call takes place. Only then can the scheduler allow another task (possibly making a second call to the same entry) to execute. Thus 'order of call' = 'order of arrival'. -- Spencer Peterson (asp@sei.cmu.edu)