|Sep9-11, 08:42 AM||#1|
Guarded entries and deadlocks in Ada [Solved]
This is a pretty general question that I haven't found an answer to, so I'd really appreciate the help.
Let's say we have 3 tasks - Alpha, Bravo and Charlie, all within the one and same procedure.
Alpha takes calls from Bravo, which in turn takes calls from Charlie.
Alpha's entry is guarded by some condition, which prevents accepting a call from Bravo.
Meanwhile, Bravo has the following loop:
... and all Charlie does is call Bravo.Call_from_Charlie.
Now, my question is: will Bravo ever get stuck waiting for Alpha to accept its call, ignoring Call_from_Charlie until Alpha accepts the Do_stuff call, causing a deadlock with Charlie waiting for Bravo, which is in turn waiting for Alpha?
In other words, when Bravo reaches the line of code reading "Alpha.Do_stuff;", and Alpha won't accept the call because the entry is guarded, what does Bravo do?
I haven't been able to produce a deadlock this way, but I'd like to know whether it's at all possible.
EDIT: I have now been able to produce a deadlock this way. Don't know why it didn't happen the first time, but it does now.
|Similar Threads for: Guarded entries and deadlocks in Ada [Solved]|
|How to post blog entries?||Forum Feedback & Announcements||4|
|Matrix entries||Linear & Abstract Algebra||5|
|Deleting blog entries||Forum Feedback & Announcements||2|