֛h$ S r SSKJr SSKJr SSKJrJr SSKJr " S S5 r " S S \5 r
\" \
5 " S
S 5 5 r " S S
\ 5 r " S S\ 5 r
" S S\R 5 r " S S\5 r " S S5 rg)a
Hierarchical Token Bucket traffic shaping.
Patterned after U{Martin Devera's Hierarchical Token Bucket traffic
shaper for the Linux kernel}.
@seealso: U{HTB Linux queuing discipline manual - user guide
}
@seealso: U{Token Bucket Filter in Linux Advanced Routing & Traffic Control
HOWTO}
)time)Optional) Interface implementer)pcpc \ \ rS rSr% SrSr\\ \S' Sr \\ \S' Sr
S S jr S r S r
S
rg) Bucket a
Implementation of a Token bucket.
A bucket can hold a certain number of tokens and it drains over time.
@cvar maxburst: The maximum number of tokens that the bucket can
hold at any given time. If this is L{None}, the bucket has
an infinite size.
@type maxburst: C{int}
@cvar rate: The rate at which the bucket drains, in number
of tokens per second. If the rate is L{None}, the bucket
drains instantaneously.
@type rate: C{int}
Nmaxburstrater c < SU l Xl [ 5 U l g)z
Create a L{Bucket} that may have a parent L{Bucket}.
@param parentBucket: If a parent Bucket is specified,
all L{add} and L{drip} operations on this L{Bucket}
will be applied on the parent L{Bucket} as well.
@type parentBucket: L{Bucket}
r N)content parentBucketr lastDrip)selfr s YC:\Users\psant\Downloads\Noiseback\school\venv\Lib\site-packages\twisted/protocols/htb.py__init__Bucket.__init__3 s (
c U R 5 U R c UnO"[ XR U R -
5 nU R b U R R U5 nU =R U-
sl U$ )a4
Adds tokens to the L{Bucket} and its C{parentBucket}.
This will add as many of the C{amount} tokens as will fit into both
this L{Bucket} and its C{parentBucket}.
@param amount: The number of tokens to try to add.
@type amount: C{int}
@returns: The number of tokens that actually fit.
@returntype: C{int}
)dripr minr r add)r amount allowables r r
Bucket.add@ si
== IFMMDLL$@AI ( ))--i8I ! r c , U R b U R R 5 U R c SU l OJ[ 5 nXR
-
nX R - n[
SU R U-
5 U l Xl U R S:H $ )z
Let some of the bucket drain.
The L{Bucket} drains at the rate specified by the class
variable C{rate}.
@returns: C{True} if the bucket is empty after this drip.
@returntype: C{bool}
r )r r r r r r max)r now deltaTime deltaTokenss r r Bucket.dripX s} ( " " $ 99 DL&Cmm+I#ii/K q$,,"<=DL M||q r )r r r N)__name__
__module__ __qualname____firstlineno____doc__r r int__annotations__r _refcountr r r __static_attributes__ r r r r s9
#Hhsm" D(3- I 0!r r c \ rS rSrS rSrg)
IBucketFilterp c g)zV
Return a L{Bucket} corresponding to the provided parameters.
@returntype: L{Bucket}
Nr- )
somethingssome_kws r getBucketForIBucketFilter.getBucketForq s r r- N)r$ r% r& r' r4 r, r- r r r/ r/ p s r r/ c N \ rS rSr% Sr\rSr\\ \
S' S
S jr S r S r
S rS rg) HierarchicalBucketFiltery z
Filter things into buckets that can be nested.
@cvar bucketFactory: Class of buckets to make.
@type bucketFactory: L{Bucket}
@cvar sweepInterval: Seconds between sweeping out the bucket cache.
@type sweepInterval: C{int}
N
sweepIntervalc < 0 U l Xl [ 5 U l g r# )buckets parentFilterr lastSweep)r r< s r r !HierarchicalBucketFilter.__init__ s ( r c U R b5 [ 5 U R -
U R : a U R 5 U R ( a! U R R
" U /UQ70 UD6nOSnU R " U0 UD6nU R R U5 nUc U R U5 nXPR U' U$ )z
Find or create a L{Bucket} corresponding to the provided parameters.
Any parameters are passed on to L{getBucketKey}, from them it
decides which bucket you get.
@returntype: L{Bucket}
N)
r9 r r= sweepr< r4 getBucketKeyr; get
bucketFactory)r akwr keybuckets r r4 %HierarchicalBucketFilter.getBucketFor s
*
Vdnn
$(:(: : JJL ,,99$IIbIL L )b) !!#& >'' 5F &LL
r c g)z
Construct a key based on the input parameters to choose a L{Bucket}.
The default implementation returns the same key for all
arguments. Override this method to provide L{Bucket} selection.
@returns: Something to be used as a key in the bucket cache.
Nr- )r rD rE s r rA %HierarchicalBucketFilter.getBucketKey s r c U R R 5 H= u pUR 5 nUR S:X d M' U( d M0 U R U M? [ 5 U l g)z
Remove empty buckets.
r N)r; itemsr r+ r r= )r rF rG bucket_is_emptys r r@ HierarchicalBucketFilter.sweep sQ <<--/KC $kkmO A%??LL% 0
r )r; r= r< r# )r$ r% r& r' r( r rC r9 r r) r* r r4 rA r@ r, r- r r r7 r7 y s0 M#'M8C='
4 r r7 c " \ rS rSrSrSrS rSrg) FilterByHost z>
A Hierarchical Bucket filter with a L{Bucket} for each host.
i c ( UR 5 S $ N )getPeerr transports r rA FilterByHost.getBucketKey "1%%r r- Nr$ r% r& r' r( r9 rA r, r- r r rP rP s M&r rP c " \ rS rSrSrSrS rSrg)FilterByServer zA
A Hierarchical Bucket filter with a L{Bucket} for each service.
Nc ( UR 5 S $ )N )getHostrV s r rA FilterByServer.getBucketKey rY r r- rZ r- r r r\ r\ s M&r r\ c . \ rS rSrSrSrS rS rS rSr g) ShapedConsumer zD
Wraps a C{Consumer} and shapes the rate at which it receives data.
Fc [ R R X5 X l U R =R S-
sl g rS )r ProducerConsumerProxyr rG r+ )r consumerrG s r r ShapedConsumer.__init__ s0 !!**4: " r c U R R [ U5 5 n[ R R XS U 5 $ r# )rG r lenr rf _writeSomeData)r datar s r rk ShapedConsumer._writeSomeData s7
T+((777FmLLr c [ R R U 5 U R =R S- sl g rS )r rf
stopProducingrG r+ )r s r ro ShapedConsumer.stopProducing s+ !!//5 " r )rG N)
r$ r% r& r' r( iAmStreamingr rk ro r, r- r r rc rc s L#
M#r rc c " \ rS rSrSrSrS rSrg)ShapedTransport a:
Wraps a C{Transport} and shapes the rate at which it receives data.
This is a L{ShapedConsumer} with a little bit of magic to provide for
the case where the consumer it wraps is also a C{Transport} and people
will be attempting to access attributes this does not proxy as a
C{Consumer} (e.g. C{loseConnection}).
Fc . [ U R U5 $ r# )getattrrg )r names r __getattr__ShapedTransport.__getattr__ s t}}d++r r- N)r$ r% r& r' r( rq rx r, r- r r rs rs s L,r rs c $ \ rS rSrSrS rS rSrg)ShapedProtocolFactoryi ao
Dispense C{Protocols} with traffic shaping on their transports.
Usage::
myserver = SomeFactory()
myserver.protocol = ShapedProtocolFactory(myserver.protocol,
bucketFilter)
Where C{SomeServerFactory} is a L{twisted.internet.protocol.Factory}, and
C{bucketFilter} is an instance of L{HierarchicalBucketFilter}.
c Xl X l g)aT
Tell me what to wrap and where to get buckets.
@param protoClass: The class of C{Protocol} this will generate
wrapped instances of.
@type protoClass: L{Protocol}
class
@param bucketFilter: The filter which will determine how
traffic is shaped.
@type bucketFilter: L{HierarchicalBucketFilter}.
N)protocol bucketFilter)r
protoClassr~ s r r ShapedProtocolFactory.__init__ s #
(r c ` ^ ^ T R " U0 UD6nUR mUU 4S jnXCl U$ )z
Make a C{Protocol} instance with a shaped transport.
Any parameters will be passed on to the protocol's initializer.
@returns: A C{Protocol} instance with a L{ShapedTransport}.
c ` > TR R U 5 n[ X5 nT" U5 $ r# )r~ r4 rs )rW rG shapedTransportorigMakeConnectionr s r makeConnection6ShapedProtocolFactory.__call__..makeConnection, s. &&33I>F -i @O%o6 6r )r} r )r rD rE protor r s ` @r __call__ ShapedProtocolFactory.__call__! s6
q'B' " 1 1 7
. r )r~ r} N)r$ r% r& r' r( r r r, r- r r r{ r{ s )"r r{ N)r( r typingr zope.interfacer r twisted.protocolsr r r/ r7 rP r\ rf rc rs r{ r- r r r s
1 !O! O!d I
]@ @ @ F&+ &&- &#S.. #6,n ,(0 0r