<HTML><HEAD>
<META http-equiv=Content-Type content="text/html; charset=iso-8859-15">
<META content="MSHTML 6.00.6000.16705" name=GENERATOR></HEAD>
<BODY style="MARGIN: 4px 4px 1px">
<DIV>Jay:</DIV>
<DIV> </DIV>
<DIV>There is the abstraction of multiple concurrent "readers" but only one "writer". I actually have such a module that I use sometimes in my programs. The idea is one of acquiring/releasing read locks and write locks. The difficulty here is in preventing starvation and usually requires adherence to some rules (again rigor). By starvation I mean that writers must wait for all readers to finish before they get access, so if there is always at least one reader, the writer will "starve" and never gain access.</DIV>
<DIV> </DIV>
<DIV>As for recursive locks, again that is usually indicative of a design flaw. I did once implement a system that permitted the same thread to acquire a lock multiple times, provided that it eventually released the lock the same number of times that it acquired it. In other words, after the first lock, subsequent locks by the same thread just increment a counter. Then, unlocks decrement the counter until it is zero with the final unlock actually releasing the mutex.</DIV>
<DIV> </DIV>
<DIV>In the code you modified, you could implement such a scheme to handle the recursive locks, provided that at some point the thread releases for each lock. The Thread interface has the ability to note the current thread (i.e., Thread.Self()). So you could make a stack of locks by same thread. Other threads would have to block until the first thread's lock stack was empty.</DIV>
<DIV> </DIV>
<DIV>For example:</DIV>
<DIV> </DIV>
<DIV>ACQUIRE: If resource available, lock resource mutex and put current thread on granted stack. Otherwise, if current thread already on granted stack, push it on stack again and let it proceed. Otherwise (this is a new thread wanting access), so push this thread onto a waiting stack and wait.</DIV>
<DIV> </DIV>
<DIV>RELEASE: Pop granted stack and check to ensure the popped stack entry represents the current thread. If not, must crash due to a programming error. If granted stack is now empty, check to see if the waiting stack is empty. If the waiting stack is empty, release the resource mutex. Otherwise (there is at least one thread waiting), pop waiting stack and push onto granted stack. Repeat pop/push for each occurrence of current thread at top of waiting stack. Allow waiting thread to proceed.</DIV>
<DIV> </DIV>
<DIV>I can check into providing my read-write locks modules if needed.</DIV>
<DIV> </DIV>
<DIV>Regards,</DIV>
<DIV>Randy<BR><BR>>>> Jay <jay.krell@cornell.edu> 8/14/2008 6:08 PM >>><BR><BR>Maybe we should have another lock type that allows recursive acquires?<BR>To be used sparingly, but used here?<BR>I know that is often frowned upon -- the need for it implies a design flaw -- but<BR>maybe it is ok sometimes?<BR>I don't understand when/why recursive locks are ok or not.<BR><BR>- Jay<BR><BR><BR>________________________________<BR><BR>From: jay.krell@cornell.edu<BR>To: rcoleburn@scires.com; jkrell@elego.de; m3commit@elegosoft.com<BR>Date: Thu, 14 Aug 2008 22:05:13 +0000<BR>Subject: Re: [M3commit] CVS Update: cm3<BR><BR><BR><BR><BR>How about this comment in the code:<BR><BR>(*-------------------------------------------------- raw seething windows ---*)<BR>(* NOTE: The helper procedures called by WindowProc lock VBT.mu when calling<BR> various Trestle procedures. They do not hold locks while calling Win32<BR> because it knows nothing about Modula-3 locks and it can, on a whim, call<BR> WindowProc to do something. The only reason this scheme might work is<BR> because we have a single Modula-3 thread that's pulling on the Win32<BR> message queue and calling WindowProc.<BR><BR> Similarly, we don't bother locking around updates to Child records.<BR> They are updated by the single Modula-3/WindowProc thread.<BR>*)<BR><BR>?<BR>I also need to check if any state has been modified, or cached in locals, with<BR>the locks held that are being released.<BR><BR>-Jay<BR><BR><BR><BR>________________________________<BR><BR><BR>Date: Thu, 14 Aug 2008 11:13:25 -0400<BR>From: rcoleburn@scires.com<BR>To: jkrell@elego.de; m3commit@elegosoft.com<BR>Subject: Re: [M3commit] CVS Update: cm3<BR><BR><BR><BR>Jay:<BR><BR><BR><BR>I haven't studied this code in depth, but on the surface I doubt your change is "correct".<BR><BR><BR><BR>I think the more telling problem is that if you look at the body of WinTrestle.Release, it is empty, save for a comment that it is not yet implemented. So, it would seem that if WinTrestle.Acquire is called more than once, you will crash because the locks have not been released.<BR><BR><BR><BR>Further, I don't think it would make sense to release the locks before calling out to Windows, and then reacquire them upon return. The locks are known to Modula-3 and not Windows. Releasing them will allow other competing threads to acquire them while you are in the Windows subsystem and would seem to violate whatever protections were in place per holding the locks. Upon return from Windows, the thread will be back in competition with others to reacquire the locks it gave up and upon success, there is no guarantee that the other threads didn't disturb the state the original thread depended upon.<BR><BR><BR><BR>I would suggest reverting these changes and looking to implement the Release procedure.<BR><BR><BR><BR>Regards,<BR><BR>Randy<BR><BR><BR>>>> Jay Krell 8/14/2008 4:26 PM>>><BR>CVSROOT:/usr/cvs<BR>Changes by:jkrell@birch.08/08/14 16:26:59<BR><BR>Modified files:<BR>cm3/m3-ui/ui/src/winvbt/: WinTrestle.m3<BR><BR>Log message:<BR>release locks when calling out to Win32 to prevent recursive lock acquisition. correct?<BR><BR><BR><BR></DIV></BODY></HTML>