2009-05-25 14:48:43 +02:00
|
|
|
/**
|
|
|
|
|
* Copyright (C) 2009 Scalable Solutions.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/**
|
2009-05-25 15:18:18 +02:00
|
|
|
* Implements the Reactor pattern as defined in: [http://www.cs.wustl.edu/~schmidt/PDF/reactor-siemens.pdf].
|
|
|
|
|
* See also this article: [http://today.java.net/cs/user/print/a/350].
|
|
|
|
|
*
|
2009-05-25 14:48:43 +02:00
|
|
|
* Based on code from the actorom actor framework by Sergio Bossa [http://code.google.com/p/actorom/].
|
|
|
|
|
*/
|
|
|
|
|
package se.scalablesolutions.akka.kernel.reactor
|
|
|
|
|
|
|
|
|
|
import java.util.{LinkedList, Queue}
|
|
|
|
|
|
|
|
|
|
trait MessageDispatcher {
|
|
|
|
|
def registerHandler(key: AnyRef, handler: MessageHandler)
|
|
|
|
|
def unregisterHandler(key: AnyRef)
|
|
|
|
|
def dispatch(messageQueue: MessageQueue)
|
|
|
|
|
def shutdown
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
trait MessageDemultiplexer {
|
|
|
|
|
def select
|
|
|
|
|
def acquireSelectedQueue: Queue[MessageHandle]
|
|
|
|
|
def releaseSelectedQueue
|
|
|
|
|
def wakeUp
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
class MessageHandle(val key: AnyRef, val message: AnyRef, val future: CompletableFutureResult) {
|
|
|
|
|
|
2009-05-25 15:18:18 +02:00
|
|
|
override def hashCode(): Int = {
|
|
|
|
|
var result = HashCode.SEED
|
|
|
|
|
result = HashCode.hash(result, key)
|
|
|
|
|
result = HashCode.hash(result, message)
|
|
|
|
|
result = HashCode.hash(result, future)
|
|
|
|
|
result
|
2009-05-25 14:48:43 +02:00
|
|
|
}
|
2009-05-25 15:18:18 +02:00
|
|
|
|
|
|
|
|
override def equals(that: Any): Boolean =
|
|
|
|
|
that != null &&
|
|
|
|
|
that.isInstanceOf[MessageHandle] &&
|
|
|
|
|
that.asInstanceOf[MessageHandle].key == key &&
|
|
|
|
|
that.asInstanceOf[MessageHandle].message == message &&
|
|
|
|
|
that.asInstanceOf[MessageHandle].future == future
|
2009-05-25 14:48:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
trait MessageHandler {
|
|
|
|
|
def handle(message: MessageHandle)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class MessageQueue {
|
|
|
|
|
private val handles: Queue[MessageHandle] = new LinkedList[MessageHandle]
|
|
|
|
|
@volatile private var interrupted = false
|
|
|
|
|
|
|
|
|
|
def put(handle: MessageHandle) = handles.synchronized {
|
|
|
|
|
handles.offer(handle)
|
|
|
|
|
handles.notifyAll
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
def read(destination: Queue[MessageHandle]) = handles.synchronized {
|
|
|
|
|
while (handles.isEmpty && !interrupted) {
|
|
|
|
|
handles.wait
|
|
|
|
|
}
|
|
|
|
|
if (!interrupted) {
|
|
|
|
|
while (!handles.isEmpty) {
|
|
|
|
|
destination.offer(handles.remove)
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
interrupted = false
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
def interrupt = handles.synchronized {
|
|
|
|
|
interrupted = true
|
|
|
|
|
handles.notifyAll
|
|
|
|
|
}
|
|
|
|
|
}
|