2015-11-08 19:27:03 -05:00
|
|
|
/**
|
2016-02-23 12:58:39 +01:00
|
|
|
* Copyright (C) 2015-2016 Lightbend Inc. <http://www.lightbend.com>
|
2015-11-08 19:27:03 -05:00
|
|
|
*/
|
|
|
|
|
package akka.stream.impl
|
|
|
|
|
|
|
|
|
|
import akka.stream.ThrottleMode.{ Enforcing, Shaping }
|
|
|
|
|
import akka.stream.impl.fusing.GraphStages.SimpleLinearGraphStage
|
|
|
|
|
import akka.stream.stage._
|
|
|
|
|
import akka.stream._
|
|
|
|
|
|
|
|
|
|
import scala.concurrent.duration.{ FiniteDuration, _ }
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* INTERNAL API
|
|
|
|
|
*/
|
2016-02-24 13:19:10 +01:00
|
|
|
private[stream] object Throttle {
|
|
|
|
|
|
|
|
|
|
val miniTokenBits = 30
|
|
|
|
|
|
|
|
|
|
private def tokenToMiniToken(e: Int): Long = e.toLong << Throttle.miniTokenBits
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* INTERNAL API
|
|
|
|
|
*/
|
|
|
|
|
/*
|
|
|
|
|
* This class tracks a token bucket in an efficient way.
|
|
|
|
|
*
|
|
|
|
|
* For accuracy, instead of tracking integer tokens the implementation tracks "miniTokens" which are 1/2^30 fraction
|
|
|
|
|
* of a token. This allows us to track token replenish rate as miniTokens/nanosecond which allows us to use simple
|
|
|
|
|
* arithmetic without division and also less inaccuracy due to rounding on token count caculation.
|
|
|
|
|
*
|
|
|
|
|
* The replenish amount, and hence the current time is only queried if the bucket does not hold enough miniTokens, in
|
|
|
|
|
* other words, replenishing the bucket is *on-need*. In addition, to compensate scheduler inaccuracy, the implementation
|
|
|
|
|
* calculates the ideal "previous time" explicitly, not relying on the scheduler to tick at that time. This means that
|
|
|
|
|
* when the scheduler actually ticks, some time has been elapsed since the calculated ideal tick time, and those tokens
|
|
|
|
|
* are added to the bucket as any calculation is always relative to the ideal tick time.
|
|
|
|
|
*
|
|
|
|
|
*/
|
2015-11-08 19:27:03 -05:00
|
|
|
private[stream] class Throttle[T](cost: Int,
|
|
|
|
|
per: FiniteDuration,
|
|
|
|
|
maximumBurst: Int,
|
|
|
|
|
costCalculation: (T) ⇒ Int,
|
|
|
|
|
mode: ThrottleMode)
|
|
|
|
|
extends SimpleLinearGraphStage[T] {
|
2016-01-18 17:49:32 +01:00
|
|
|
require(cost > 0, "cost must be > 0")
|
|
|
|
|
require(per.toMillis > 0, "per time must be > 0")
|
|
|
|
|
require(!(mode == ThrottleMode.Enforcing && maximumBurst < 0), "maximumBurst must be > 0 in Enforcing mode")
|
2015-11-08 19:27:03 -05:00
|
|
|
|
2016-02-24 13:19:10 +01:00
|
|
|
private val maximumBurstMiniTokens = Throttle.tokenToMiniToken(maximumBurst)
|
|
|
|
|
private val miniTokensPerNanos = (Throttle.tokenToMiniToken(cost).toDouble / per.toNanos).toLong
|
|
|
|
|
private val timerName: String = "ThrottleTimer"
|
|
|
|
|
|
2015-11-08 19:27:03 -05:00
|
|
|
override def createLogic(inheritedAttributes: Attributes): GraphStageLogic = new TimerGraphStageLogic(shape) {
|
|
|
|
|
var willStop = false
|
2016-02-24 13:19:10 +01:00
|
|
|
var previousMiniTokens: Long = maximumBurstMiniTokens
|
|
|
|
|
var previousNanos: Long = System.nanoTime()
|
2015-11-08 19:27:03 -05:00
|
|
|
|
|
|
|
|
var currentElement: Option[T] = None
|
|
|
|
|
|
|
|
|
|
setHandler(in, new InHandler {
|
|
|
|
|
|
|
|
|
|
override def onUpstreamFinish(): Unit =
|
|
|
|
|
if (isAvailable(out) && isTimerActive(timerName)) willStop = true
|
|
|
|
|
else completeStage()
|
|
|
|
|
|
|
|
|
|
override def onPush(): Unit = {
|
|
|
|
|
val elem = grab(in)
|
2016-02-24 13:19:10 +01:00
|
|
|
val elementCostMiniTokens = Throttle.tokenToMiniToken(costCalculation(elem))
|
2016-01-23 17:55:03 -05:00
|
|
|
|
2016-02-24 13:19:10 +01:00
|
|
|
if (previousMiniTokens >= elementCostMiniTokens) {
|
|
|
|
|
previousMiniTokens -= elementCostMiniTokens
|
2015-11-08 19:27:03 -05:00
|
|
|
push(out, elem)
|
2016-01-23 17:55:03 -05:00
|
|
|
} else {
|
2016-02-24 13:19:10 +01:00
|
|
|
val currentNanos = System.nanoTime()
|
|
|
|
|
val currentMiniTokens = Math.min(
|
|
|
|
|
(currentNanos - previousNanos) * miniTokensPerNanos + previousMiniTokens,
|
|
|
|
|
maximumBurstMiniTokens)
|
|
|
|
|
|
|
|
|
|
if (currentMiniTokens < elementCostMiniTokens)
|
2016-01-23 17:55:03 -05:00
|
|
|
mode match {
|
|
|
|
|
case Shaping ⇒
|
|
|
|
|
currentElement = Some(elem)
|
2016-02-24 13:19:10 +01:00
|
|
|
val waitNanos = (elementCostMiniTokens - currentMiniTokens) / miniTokensPerNanos
|
|
|
|
|
previousNanos = currentNanos + waitNanos
|
|
|
|
|
scheduleOnce(timerName, waitNanos.nanos)
|
2016-01-23 17:55:03 -05:00
|
|
|
case Enforcing ⇒ failStage(new RateExceededException("Maximum throttle throughput exceeded"))
|
|
|
|
|
}
|
|
|
|
|
else {
|
2016-02-24 13:19:10 +01:00
|
|
|
previousMiniTokens = currentMiniTokens - elementCostMiniTokens
|
|
|
|
|
previousNanos = currentNanos
|
2016-01-23 17:55:03 -05:00
|
|
|
push(out, elem)
|
|
|
|
|
}
|
2015-11-08 19:27:03 -05:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
})
|
|
|
|
|
|
|
|
|
|
override protected def onTimer(key: Any): Unit = {
|
|
|
|
|
push(out, currentElement.get)
|
|
|
|
|
currentElement = None
|
2016-02-24 13:19:10 +01:00
|
|
|
previousMiniTokens = 0
|
2015-11-08 19:27:03 -05:00
|
|
|
if (willStop) completeStage()
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
setHandler(out, new OutHandler {
|
|
|
|
|
override def onPull(): Unit = pull(in)
|
|
|
|
|
})
|
|
|
|
|
|
2016-02-24 13:19:10 +01:00
|
|
|
override def preStart(): Unit = previousNanos = System.nanoTime()
|
2015-11-08 19:27:03 -05:00
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
override def toString = "Throttle"
|
|
|
|
|
}
|