Date: Sun, 17 Dec 2000 21:17:08 -0700 From: Chuck Paterson <cp@bsdi.com> To: Julian Elischer <julian@elischer.org> Cc: smp@FreeBSD.ORG Subject: Re: Netgraph locking primatives. take 1. Message-ID: <200012180417.eBI4H8P17331@berserker.bsdi.com> In-Reply-To: Your message of "Sun, 17 Dec 2000 13:11:42 PST." <3A3D2C0E.B339AB94@elischer.org>
next in thread | previous in thread | raw e-mail | index | archive | help
Julian, I am not sure if the dead lock applies, it would apply in the example code you showed. If two processes hold a reader lock and they both request a write lock neither can ever be met because the other process is never going to let go read lock because it is also waiting on a write lock. This isn't even a tight timing race, as long as they both hold the reader lock at the same time and are eventually going to ask for the write lock before they release the reader lock there is a dead lock. Chuck To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-smp" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?200012180417.eBI4H8P17331>