>From: Daniel Walker [mailto:[email protected]]
>On Wed, 2005-06-01 at 17:10 -0700, Perez-Gonzalez, Inaky wrote:
>
>> Maybe he is referring to the case?
>>
>> A owns M
>> B owns N and is waiting for M
>> A is trying to wait for N
>>
>> These deadlocking cases can be tricky during PI.
>
>The bulk of the code is from the current RT mutex, so I'm assuming it
>handles this case correctly. However, the rt mutex isn't in userspace ,
>so task A or B was a user space task , then the problem would need to
be
>explored.. How does PI change if A or B are user space tasks?
It doesn't matter in which space the tasks are, a deadlock
condition can happen anywhere and that can easily lead to
infinite recursion/iteration (as bad). I seem to remember Ingo
mentioning he had taken care of full transitivity (or maybe it
was somebody else saying it).
-- Inaky
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
[Index of Archives]
[Kernel Newbies]
[Netfilter]
[Bugtraq]
[Photo]
[Stuff]
[Gimp]
[Yosemite News]
[MIPS Linux]
[ARM Linux]
[Linux Security]
[Linux RAID]
[Video 4 Linux]
[Linux for the blind]
[Linux Resources]
