2011-03-11 14:51:24 +01:00
|
|
|
package akka.dispatch
|
|
|
|
|
import org.scalatest.WordSpec
|
|
|
|
|
import org.scalatest.matchers.MustMatchers
|
|
|
|
|
import org.scalatest.{BeforeAndAfterAll, BeforeAndAfterEach}
|
|
|
|
|
import org.scalatest.junit.JUnitRunner
|
|
|
|
|
import org.junit.runner.RunWith
|
|
|
|
|
import akka.actor. {Actor, ActorRegistry}
|
|
|
|
|
import akka.actor.Actor.{actorOf}
|
|
|
|
|
import java.util.concurrent. {TimeUnit, CountDownLatch, BlockingQueue}
|
|
|
|
|
import java.util.{Queue}
|
|
|
|
|
import akka.util._
|
|
|
|
|
import akka.util.Duration._
|
2010-09-09 15:49:59 +02:00
|
|
|
|
2010-09-21 18:52:41 +02:00
|
|
|
|
2011-03-11 14:51:24 +01:00
|
|
|
@RunWith(classOf[JUnitRunner])
|
|
|
|
|
abstract class MailboxSpec extends
|
|
|
|
|
WordSpec with
|
|
|
|
|
MustMatchers with
|
|
|
|
|
BeforeAndAfterAll with
|
|
|
|
|
BeforeAndAfterEach {
|
|
|
|
|
def name: String
|
2010-09-21 18:52:41 +02:00
|
|
|
|
2011-03-11 14:51:24 +01:00
|
|
|
def factory: MailboxType => MessageQueue
|
2010-09-09 15:49:59 +02:00
|
|
|
|
2011-03-11 14:51:24 +01:00
|
|
|
name should {
|
2011-04-27 16:46:06 +02:00
|
|
|
"create an unbounded mailbox" in {
|
2011-04-27 12:21:19 +02:00
|
|
|
val config = UnboundedMailbox()
|
2011-03-11 14:51:24 +01:00
|
|
|
val q = factory(config)
|
|
|
|
|
ensureInitialMailboxState(config, q)
|
2010-09-09 15:49:59 +02:00
|
|
|
|
2011-03-11 14:51:24 +01:00
|
|
|
implicit val within = Duration(1,TimeUnit.SECONDS)
|
2010-09-09 15:49:59 +02:00
|
|
|
|
2011-03-11 14:51:24 +01:00
|
|
|
val f = spawn {
|
|
|
|
|
q.dequeue
|
|
|
|
|
}
|
2010-09-09 15:49:59 +02:00
|
|
|
|
2011-03-11 14:51:24 +01:00
|
|
|
f.await.resultOrException must be === Some(null)
|
|
|
|
|
}
|
2010-09-09 15:49:59 +02:00
|
|
|
|
2011-04-27 12:21:19 +02:00
|
|
|
"create a bounded mailbox with 10 capacity and with push timeout" in {
|
|
|
|
|
val config = BoundedMailbox(10, Duration(10,TimeUnit.MILLISECONDS))
|
2011-03-11 14:51:24 +01:00
|
|
|
val q = factory(config)
|
|
|
|
|
ensureInitialMailboxState(config, q)
|
2010-09-09 15:49:59 +02:00
|
|
|
|
2011-03-11 14:51:24 +01:00
|
|
|
val exampleMessage = createMessageInvocation("test")
|
|
|
|
|
|
|
|
|
|
for(i <- 1 to config.capacity) q.enqueue(exampleMessage)
|
|
|
|
|
|
|
|
|
|
q.size must be === config.capacity
|
|
|
|
|
q.isEmpty must be === false
|
|
|
|
|
|
|
|
|
|
intercept[MessageQueueAppendFailedException] {
|
|
|
|
|
q.enqueue(exampleMessage)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
q.dequeue must be === exampleMessage
|
|
|
|
|
q.size must be (config.capacity - 1)
|
|
|
|
|
q.isEmpty must be === false
|
|
|
|
|
}
|
|
|
|
|
|
2011-03-11 16:48:44 +01:00
|
|
|
"dequeue what was enqueued properly for unbounded mailboxes" in {
|
2011-04-27 12:21:19 +02:00
|
|
|
testEnqueueDequeue(UnboundedMailbox())
|
2011-03-11 16:48:44 +01:00
|
|
|
}
|
2011-03-11 14:51:24 +01:00
|
|
|
|
2011-03-11 16:48:44 +01:00
|
|
|
"dequeue what was enqueued properly for bounded mailboxes" in {
|
2011-04-27 12:21:19 +02:00
|
|
|
testEnqueueDequeue(BoundedMailbox(10000, Duration(-1, TimeUnit.MILLISECONDS)))
|
2011-03-11 16:48:44 +01:00
|
|
|
}
|
2010-09-09 15:49:59 +02:00
|
|
|
|
2011-03-11 16:48:44 +01:00
|
|
|
"dequeue what was enqueued properly for bounded mailboxes with pushTimeout" in {
|
2011-04-27 12:21:19 +02:00
|
|
|
testEnqueueDequeue(BoundedMailbox(10000, Duration(100, TimeUnit.MILLISECONDS)))
|
2011-03-11 16:48:44 +01:00
|
|
|
}
|
2011-03-11 14:51:24 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
//CANDIDATE FOR TESTKIT
|
|
|
|
|
def spawn[T <: AnyRef](fun: => T)(implicit within: Duration): Future[T] = {
|
|
|
|
|
val result = new DefaultCompletableFuture[T](within.length, within.unit)
|
|
|
|
|
val t = new Thread(new Runnable {
|
|
|
|
|
def run = try {
|
|
|
|
|
result.completeWithResult(fun)
|
|
|
|
|
} catch {
|
|
|
|
|
case e: Throwable => result.completeWithException(e)
|
|
|
|
|
}
|
|
|
|
|
})
|
2011-04-12 09:55:32 +02:00
|
|
|
t.start()
|
2011-03-11 14:51:24 +01:00
|
|
|
result
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
def createMessageInvocation(msg: Any): MessageInvocation = {
|
|
|
|
|
new MessageInvocation(
|
|
|
|
|
actorOf(new Actor { //Dummy actor
|
|
|
|
|
def receive = { case _ => }
|
|
|
|
|
}), msg, None, None)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
def ensureInitialMailboxState(config: MailboxType, q: MessageQueue) {
|
|
|
|
|
q must not be null
|
|
|
|
|
q match {
|
|
|
|
|
case aQueue: BlockingQueue[_] =>
|
|
|
|
|
config match {
|
2011-04-27 12:21:19 +02:00
|
|
|
case BoundedMailbox(capacity,_) => aQueue.remainingCapacity must be === capacity
|
|
|
|
|
case UnboundedMailbox() => aQueue.remainingCapacity must be === Int.MaxValue
|
2011-03-11 14:51:24 +01:00
|
|
|
}
|
|
|
|
|
case _ =>
|
|
|
|
|
}
|
|
|
|
|
q.size must be === 0
|
|
|
|
|
q.isEmpty must be === true
|
|
|
|
|
}
|
2011-03-11 16:48:44 +01:00
|
|
|
|
|
|
|
|
def testEnqueueDequeue(config: MailboxType) {
|
|
|
|
|
implicit val within = Duration(10,TimeUnit.SECONDS)
|
|
|
|
|
val q = factory(config)
|
|
|
|
|
ensureInitialMailboxState(config, q)
|
|
|
|
|
|
|
|
|
|
def createProducer(fromNum: Int, toNum: Int): Future[Vector[MessageInvocation]] = spawn {
|
|
|
|
|
val messages = Vector() ++ (for(i <- fromNum to toNum) yield createMessageInvocation(i))
|
|
|
|
|
for(i <- messages) q.enqueue(i)
|
|
|
|
|
messages
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
val totalMessages = 10000
|
|
|
|
|
val step = 500
|
|
|
|
|
|
|
|
|
|
val producers = for(i <- (1 to totalMessages by step).toList) yield createProducer(i,i+step-1)
|
|
|
|
|
|
|
|
|
|
def createConsumer: Future[Vector[MessageInvocation]] = spawn {
|
|
|
|
|
var r = Vector[MessageInvocation]()
|
|
|
|
|
while(producers.exists(_.isCompleted == false) || !q.isEmpty) {
|
|
|
|
|
q.dequeue match {
|
|
|
|
|
case null =>
|
|
|
|
|
case message => r = r :+ message
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
r
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
val consumers = for(i <- (1 to 4).toList) yield createConsumer
|
|
|
|
|
|
|
|
|
|
val ps = producers.map(_.await.resultOrException.get)
|
|
|
|
|
val cs = consumers.map(_.await.resultOrException.get)
|
|
|
|
|
|
|
|
|
|
ps.map(_.size).sum must be === totalMessages //Must have produced 1000 messages
|
|
|
|
|
cs.map(_.size).sum must be === totalMessages //Must have consumed all produced messages
|
|
|
|
|
//No message is allowed to be consumed by more than one consumer
|
|
|
|
|
cs.flatten.distinct.size must be === totalMessages
|
|
|
|
|
//All produced messages should have been consumed
|
|
|
|
|
(cs.flatten diff ps.flatten).size must be === 0
|
|
|
|
|
(ps.flatten diff cs.flatten).size must be === 0
|
|
|
|
|
}
|
2011-03-11 14:51:24 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
class DefaultMailboxSpec extends MailboxSpec {
|
|
|
|
|
lazy val name = "The default mailbox implementation"
|
|
|
|
|
def factory = {
|
2011-04-27 12:21:19 +02:00
|
|
|
case UnboundedMailbox() => new DefaultUnboundedMessageQueue()
|
|
|
|
|
case BoundedMailbox(capacity, pushTimeOut) => new DefaultBoundedMessageQueue(capacity, pushTimeOut)
|
2010-09-09 15:49:59 +02:00
|
|
|
}
|
|
|
|
|
}
|
2011-03-11 14:51:24 +01:00
|
|
|
|
|
|
|
|
class PriorityMailboxSpec extends MailboxSpec {
|
2011-04-11 17:08:10 +02:00
|
|
|
val comparator = PriorityGenerator(_.##)
|
2011-03-11 14:51:24 +01:00
|
|
|
lazy val name = "The priority mailbox implementation"
|
|
|
|
|
def factory = {
|
2011-04-27 12:21:19 +02:00
|
|
|
case UnboundedMailbox() => new UnboundedPriorityMessageQueue(comparator)
|
|
|
|
|
case BoundedMailbox(capacity, pushTimeOut) => new BoundedPriorityMessageQueue(capacity, pushTimeOut, comparator)
|
2011-03-11 14:51:24 +01:00
|
|
|
}
|
|
|
|
|
}
|