From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on ip-172-31-74-118.ec2.internal X-Spam-Level: X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.5-pre1 Path: eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!gandalf.srv.welterde.de!news.jacob-sparre.dk!franka.jacob-sparre.dk!pnx.dk!.POSTED.rrsoftware.com!not-for-mail From: "Randy Brukardt" Newsgroups: comp.lang.ada Subject: Re: is there a version of unix written in Ada Date: Thu, 1 Oct 2020 17:10:10 -0500 Organization: JSA Research & Innovation Message-ID: References: <00cd3aaa-d518-43a2-b321-58d6fae70aebo@googlegroups.com> <57eb7a65-51ea-4624-b9dc-9c4dda0fee59n@googlegroups.com> <5f70fd3b$0$13541$426a74cc@news.free.fr> <87wo0d3iac.fsf@nightsong.com> <87sgb02l7b.fsf@nightsong.com> <875z7vyy1u.fsf@nightsong.com> <87wo0bkns3.fsf@nightsong.com> Injection-Date: Thu, 1 Oct 2020 22:10:11 -0000 (UTC) Injection-Info: franka.jacob-sparre.dk; posting-host="rrsoftware.com:24.196.82.226"; logging-data="10876"; mail-complaints-to="news@jacob-sparre.dk" X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2900.5931 X-RFC2646: Format=Flowed; Response X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2900.7246 Xref: reader02.eternal-september.org comp.lang.ada:60373 List-Id: "Dmitry A. Kazakov" wrote in message news:rl4thi$hdq$1@gioia.aioe.org... ... >>> If so, then let there be protected procedure P1 of the object O1 and P2 >>> of O2. If P1 and P2 call to P3 of O3 that would be a problem. Ergo ether >>> wandering or concurrent protected protected calls must be illegal. >> But it's not the case... > > The scenario is: Task1 calls P1 on O1. Task2 calls P2 on O2. Both P1 and > P2 call Protected_Trace on the protected Tracer object. If tasks occupy > two different cores, would/should one suspend (in order not use the > reserved word "block") another? A task has to wait to get access to a PO. This is *not* blocking, it is not allowed to do anything else during such a period. (This is why protected operations are supposed to be fast!). It's canonically implemented with a spin-lock, but in some cases one can use lock-free algorithms instead. For a single core, one can use ceiling locking instead (and have no waiting), but that model seems almost irrelevant on modern machines. Randy.