From mboxrd@z Thu Jan 1 00:00:00 1970 From: Peter Zijlstra Subject: Re: [ANNOUNCE] 3.2.9-rt17 Date: Thu, 08 Mar 2012 19:28:07 +0100 Message-ID: <1331231287.11248.396.camel@twins> References: <1331230991.25686.452.camel@gandalf.stny.rr.com> Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7BIT Cc: Thomas Gleixner , LKML , linux-rt-users To: Steven Rostedt Return-path: Received: from merlin.infradead.org ([205.233.59.134]:51088 "EHLO merlin.infradead.org" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1754006Ab2CHS2S convert rfc822-to-8bit (ORCPT ); Thu, 8 Mar 2012 13:28:18 -0500 In-Reply-To: <1331230991.25686.452.camel@gandalf.stny.rr.com> Sender: linux-rt-users-owner@vger.kernel.org List-ID: On Thu, 2012-03-08 at 13:23 -0500, Steven Rostedt wrote: > So basically what you tried to do was just set the owner of the lock to > have the priority of the task that wants the lock, until it releases it? > But by doing it without having this task sleep? No, by having it sleep ;-) So you do the full PI sleeping lock thing, except you return fail if you loose the acquisition race on wakeup and you mark this waiter as 'special'. Then on every rt_mutex block you have to do a deadlock analysis on the PI blocking chain (preferably shared with PI boost traversal of said chain), during that scan you collect all special tagged waiters. If you find a deadlock, wake all these special waiters and have them return -EDEADLK. I guess you could also do the full spin_deadlock() and do away with the try part and purely rely on the deadlock detection.