"

 COPYRIGHT (c) 1993 by Claus Gittinger

	      All Rights Reserved

 This software is furnished under a license and may be used

 only in accordance with the terms of that license and with the

 inclusion of the above copyright notice.   This software may not

 be provided or otherwise made available to, or used by, any

 other person.  No title to or ownership of the software is

 hereby transferred.

"

LinkedList subclass:#Semaphore

	 instanceVariableNames:'count waitingProcesses'

"/         instanceVariableNames:'count'

	 classVariableNames:''

	 poolDictionaries:''

	 category:'Kernel-Processes'!

Semaphore comment:'

COPYRIGHT (c) 1993 by Claus Gittinger

	      All Rights Reserved

$Header: /cvs/stx/stx/libbasic/Semaphore.st,v 1.17 1995-05-01 21:38:51 claus Exp $

'!

!Semaphore class methodsFor:'documentation'!

copyright

"

 COPYRIGHT (c) 1993 by Claus Gittinger

	      All Rights Reserved

 This software is furnished under a license and may be used

 only in accordance with the terms of that license and with the

 inclusion of the above copyright notice.   This software may not

 be provided or otherwise made available to, or used by, any

 other person.  No title to or ownership of the software is

 hereby transferred.

"

!

version

"

$Header: /cvs/stx/stx/libbasic/Semaphore.st,v 1.17 1995-05-01 21:38:51 claus Exp $

"

!

documentation

"

    Semaphores are used to synchronize processes providing a nonBusy wait

    mechanism. A process can wait for the availability of some resource by

    performing a Semaphore>>wait, which will suspend the process until the

    resource becomes available. Signalling is done by (another process performing) 

    Semaphore>>signal.

    If the resource has been already available before the wait, no suspending is

    done, but the resource immediately allocated.

    There are also semaphores for mutual access to a critical region

    (Semaphore>>forMutualExclusion and Semaphore>>critical:).

    You can also attach semaphores to external events (such as I/O arrival or

    timer events. This is done by telling the Processor to signal the semaphore

    under some condition.

    See 'Processor>>signal:afterSeconds:', 'Processor>>signal:onInput:' etc.

    See examples in doc/coding.

"

! !

!Semaphore class methodsFor:'instance creation'!

new

    "create & return a new semaphore which blocks until a signal is sent"

    ^ super new setCount:0

!

new:n

    "create & return a new semaphore which allows n waits before

     blocking"

    ^ super new setCount:n

!

forMutualExclusion

    "create & return a new semaphore which allows exactly one process to

     wait on it without blocking"

    ^ super new setCount:1

! !

!Semaphore methodsFor:'private accessing'!

setCount:n

    count := n

! !

!Semaphore methodsFor:'queries '!

wouldBlock

    "return true, if the receiver would block the activeProcess

     if a wait was performed. False otherwise."

    ^ count == 0

! !

!Semaphore methodsFor:'wait & signal'!

wait

    "wait for the semaphore"

    |current wasBlocked|

    "

     this works only since interrupts are only serviced at 

     message send and method-return time ....

     If you add a message send into the ifTrue:-block, things will

     go mad ... (especially be careful when adding a debugPrint-here)

    "

    count ~~ 0 ifTrue:[

	count := count - 1.

	^ self

    ].

    current := Processor activeProcess.

    wasBlocked := OperatingSystem blockInterrupts.

    "

     need a while-loop here, since more than one process may

     wait for it and another one may also wake up.

     Thus, the count is not always non-zero after returning from

     suspend.

    "

    [count == 0] whileTrue:[

	waitingProcesses isNil ifTrue:[

	    waitingProcesses := OrderedCollection with:current

	] ifFalse:[

	    waitingProcesses add:current

	].

"/        self add:current.

	"

	 for some more descriptive info in processMonitor ...

	 (notice that state could already be #ioWait, #timeWait or anything else)

	"

	current setStateTo:#wait if:#active.

	Processor suspend:current

    ].

    count := count - 1.

    wasBlocked ifFalse:[OperatingSystem unblockInterrupts].

!

waitUncounted

    "wait for the semaphore; do not consume the resource

     (i.e. do not count down)"

    |current wasBlocked|

    "

     this works only since interrupts are only serviced at 

     message send and method-return time ....

     If you add a message send into the ifTrue:-block, things will

     go mad ... (especially be careful when adding a debugPrint-here)

    "

    count ~~ 0 ifTrue:[

	^ self

    ].

    current := Processor activeProcess.

    wasBlocked := OperatingSystem blockInterrupts.

    "

     need a while-loop here, since more than one process may

     wait for it and another one may also wake up.

     Thus, the count is not always non-zero after returning from

     suspend.

    "

    [count == 0] whileTrue:[

	waitingProcesses isNil ifTrue:[

	    waitingProcesses := OrderedCollection with:current

	] ifFalse:[

	    waitingProcesses add:current

	].

"/        self add:current.

	"

	 for some more descriptive info in processMonitor ...

	 (notice that state could already be #ioWait, #timeWait or anything else)

	"

	current setStateTo:#wait if:#active.

	Processor suspend:current

    ].

    wasBlocked ifFalse:[OperatingSystem unblockInterrupts].

!

waitWithTimeout:seconds

    "wait for the semaphore, but abort the wait after some time.

     return true if semaphore triggered normal, false if we return

     due to a timeout. With zero timeout, this can be used to poll

     a semaphore (which is not the intend of semaphores, though)."

    |current timeoutOccured wasBlocked unblock now endTime|

    "

     this works only since interrupts are only serviced at 

     message send and method-return time ....

     If you add a message send into the ifTrue:-block, things will

     go mad ... (especially be careful when adding a debugPrint-here)

    "

    count ~~ 0 ifTrue:[

	count := count - 1.

	^ true

    ].

    "

     with zero-timeout, this is a poll

    "

    seconds = 0 ifTrue:[

	^ false

    ].

    current := Processor activeProcess.

    wasBlocked := OperatingSystem blockInterrupts.

    "

     calculate the end-time

    "

    now := OperatingSystem getMillisecondTime.

    endTime := OperatingSystem millisecondTimeAdd:now and:(seconds * 1000).

    unblock := [timeoutOccured := true. Processor resume:current].

    Processor addTimedBlock:unblock for:current atMilliseconds:endTime.

    "

     need a while-loop here, since more than one process may

     wait for it and another one may also wake up.

     Thus, the count is not always non-zero after returning from

     suspend.

    "

    [count == 0] whileTrue:[

	waitingProcesses isNil ifTrue:[

	    waitingProcesses := OrderedCollection with:current

	] ifFalse:[

	    waitingProcesses add:current

	].

"/        self add:current.

	"

	 for some more descriptive info in processMonitor ...

	 (notice that state could already be #ioWait or #timeWait)

	"

	current setStateTo:#wait if:#active.

	timeoutOccured := false.

	Processor suspend:current.

	timeoutOccured ifTrue:[

	    waitingProcesses remove:current ifAbsent:[].

	    wasBlocked ifFalse:[OperatingSystem unblockInterrupts].

	    ^ false

	].

    ].

    Processor removeTimedBlock:unblock.

    count := count - 1.

    wasBlocked ifFalse:[OperatingSystem unblockInterrupts].

    ^ true

!

signalOnce

    "wakeup waiters - but only once.

     I.e. if the semaphore has already been signalled, this

     is ignored."

    |wasBlocked|

    count == 0 ifTrue:[

	wasBlocked := OperatingSystem blockInterrupts.

	count == 0 ifTrue:[

	    self signal

	].

	wasBlocked ifFalse:[OperatingSystem unblockInterrupts].

    ]

!

signal

    "waking up (first) waiter"

    |p wasBlocked|

    wasBlocked := OperatingSystem blockInterrupts.

    count := count + 1.

    (waitingProcesses notNil and:[waitingProcesses notEmpty]) ifTrue:[

	p := waitingProcesses removeFirst.

"/    self isEmpty ifFalse:[

"/        p := self removeFirst.

	wasBlocked ifFalse:[OperatingSystem unblockInterrupts].

	p resume.

	^ self

    ].

    wasBlocked ifFalse:[OperatingSystem unblockInterrupts].

!

signalIf

    "signal the semaphore, but only if being waited upon.

     This can be used for one-shot semaphores (i.e. not remembering

     previous signals)"

    |wasBlocked|

    (waitingProcesses notNil and:[waitingProcesses notEmpty]) ifTrue:[

	wasBlocked := OperatingSystem blockInterrupts.

	(waitingProcesses notNil and:[waitingProcesses notEmpty]) ifTrue:[

	    self signal

	].

	wasBlocked ifFalse:[OperatingSystem unblockInterrupts].

    ]

!

signalForAll

    "signal the semaphore for all waiters.

     This can be used for process synchronization, if multiple processes are

     waiting for a common event."

    |wasBlocked|

    [waitingProcesses notNil and:[waitingProcesses notEmpty]] whileTrue:[

	wasBlocked := OperatingSystem blockInterrupts.

	(waitingProcesses notNil and:[waitingProcesses notEmpty]) ifTrue:[

	    self signal

	].

	wasBlocked ifFalse:[OperatingSystem unblockInterrupts].

    ]

!

critical:aBlock

    "evaluate aBlock as a critical region; the receiver must be

     created using Semaphore>>forMutualExclusion"

    self wait.

    ^ aBlock valueNowOrOnUnwindDo:[self signal].

    "

      the example below is stupid (it should use a SharedQueue,

      or at least a Queue with critical regions).

      Anyhow, it demonstrates how two processes lock each other

      from accessing coll at the same time

     |sema coll|

     sema := Semaphore forMutualExclusion.

     coll := OrderedCollection new:10.

     [

	1 to:1000 do:[:i |

	    sema critical:[

		coll addLast:i.

		(Delay forSeconds:0.1) wait.

	    ]

	]

     ] forkAt:4.

     [

	1 to:1000 do:[:i |

	    sema critical:[

		coll removeFirst.

		(Delay forSeconds:0.1) wait.

	    ]

	]

     ] forkAt:4.

    "

! !