classes.io.netty.util.Recycler$WeakOrderQueue.class Maven / Gradle / Ivy
???? 2 ? %io/netty/util/Recycler$WeakOrderQueue java/lang/Object
Recycler.java io/netty/util/Recycler WeakOrderQueue *io/netty/util/Recycler$WeakOrderQueue$Link Link io/netty/util/Recycler$Stack Stack $io/netty/util/Recycler$DefaultHandle
DefaultHandle io/netty/util/Recycler$1 DUMMY 'Lio/netty/util/Recycler$WeakOrderQueue; head ,Lio/netty/util/Recycler$WeakOrderQueue$Link; tail next owner Ljava/lang/ref/WeakReference; 1Ljava/lang/ref/WeakReference; id I availableSharedCapacity +Ljava/util/concurrent/atomic/AtomicInteger; $assertionsDisabled Z ()V # $
%
access$900 -()Ljava/util/concurrent/atomic/AtomicInteger; ' (
) )java/util/concurrent/atomic/AtomicInteger + getAndIncrement ()I - .
, / 1 3 5 this 3(Lio/netty/util/Recycler$Stack;Ljava/lang/Thread;)V (Lio/netty/util/Recycler$1;)V # 9
: < > java/lang/ref/WeakReference @ (Ljava/lang/Object;)V # B
A C access$1100 G(Lio/netty/util/Recycler$Stack;)Lio/netty/util/Recycler$WeakOrderQueue; E F
G I access$1102 n(Lio/netty/util/Recycler$Stack;Lio/netty/util/Recycler$WeakOrderQueue;)Lio/netty/util/Recycler$WeakOrderQueue; K L
M java/lang/Thread O java/lang/Throwable Q
5 stack !Lio/netty/util/Recycler$Stack<*>; Lio/netty/util/Recycler$Stack; thread Ljava/lang/Thread; allocate Y(Lio/netty/util/Recycler$Stack;Ljava/lang/Thread;)Lio/netty/util/Recycler$WeakOrderQueue;
access$800 [ .
\ reserveSpace /(Ljava/util/concurrent/atomic/AtomicInteger;I)Z ^ _
` # 8
b ! " d java/lang/AssertionError f
g % get i .
, j
compareAndSet (II)Z l m
, n available space reclaimSpace (I)V addAndGet (I)I t u
, v add )(Lio/netty/util/Recycler$DefaultHandle;)V access$1202 *(Lio/netty/util/Recycler$DefaultHandle;I)I z {
|
j access$1302 ?(Lio/netty/util/Recycler$WeakOrderQueue$Link;Lio/netty/util/Recycler$WeakOrderQueue$Link;)Lio/netty/util/Recycler$WeakOrderQueue$Link; ?
? access$1400 U(Lio/netty/util/Recycler$WeakOrderQueue$Link;)[Lio/netty/util/Recycler$DefaultHandle; ? ?
?
access$502 d(Lio/netty/util/Recycler$DefaultHandle;Lio/netty/util/Recycler$Stack;)Lio/netty/util/Recycler$Stack; ? ?
? lazySet ? s
? handle )Lio/netty/util/Recycler$DefaultHandle<*>; &Lio/netty/util/Recycler$DefaultHandle;
writeIndex hasFinalData ()Z access$1500 /(Lio/netty/util/Recycler$WeakOrderQueue$Link;)I ? ?
? transfer !(Lio/netty/util/Recycler$Stack;)Z access$1300 Z(Lio/netty/util/Recycler$WeakOrderQueue$Link;)Lio/netty/util/Recycler$WeakOrderQueue$Link; ? ?
?
access$700 !(Lio/netty/util/Recycler$Stack;)I ? ?
?
access$600 G(Lio/netty/util/Recycler$Stack;)[Lio/netty/util/Recycler$DefaultHandle; ? ?
? increaseCapacity ? u
? java/lang/Math ? min (II)I ? ?
? ? '[Lio/netty/util/Recycler$DefaultHandle; ? access$1600 )(Lio/netty/util/Recycler$DefaultHandle;)I ? ?
? access$1200 ? ?
? access$1602 ? {
? java/lang/IllegalStateException ? recycled already ? (Ljava/lang/String;)V # ?
? ?
dropHandle )(Lio/netty/util/Recycler$DefaultHandle;)Z ? ?
? r s
? access$1502 0(Lio/netty/util/Recycler$WeakOrderQueue$Link;I)I ? ?
?
access$702 "(Lio/netty/util/Recycler$Stack;I)I ? ?
? actualCapacity element i srcElems dstElems
newDstSize dst srcStart srcEnd srcSize dstSize expectedCapacity finalize ? $
? link access$1800 P(Lio/netty/util/Recycler$WeakOrderQueue;)Lio/netty/util/Recycler$WeakOrderQueue; x0 access$1900 F(Lio/netty/util/Recycler$WeakOrderQueue;)Ljava/lang/ref/WeakReference; access$1802 w(Lio/netty/util/Recycler$WeakOrderQueue;Lio/netty/util/Recycler$WeakOrderQueue;)Lio/netty/util/Recycler$WeakOrderQueue; x1 java/lang/Class ? desiredAssertionStatus ? ?
? ?
% ? Signature Code LocalVariableTable LineNumberTable LocalVariableTypeTable
StackMapTable 6(Lio/netty/util/Recycler$Stack<*>;Ljava/lang/Thread;)V \(Lio/netty/util/Recycler$Stack<*>;Ljava/lang/Thread;)Lio/netty/util/Recycler$WeakOrderQueue; ,(Lio/netty/util/Recycler$DefaultHandle<*>;)V $(Lio/netty/util/Recycler$Stack<*>;)Z
Exceptions
SourceFile InnerClasses 0 ? ! "
# $ ? S *? &*? *? 0? 2*? 4*? 6? ? 7 ? ? ? ? ? ? # 8 ? ? R*? &*? *? 0? 2**?
Y? ;Z? =? ?*? AY,? D? 4+YN?*+? H? J+*? NW-ç
:-??*+? S? 6? / ? B B F B ? R 7 R T V R W X ? R T U ? *
? ? ? ? + ? / ? 7 ? = ? I Q ? ? B
P R? ? ? Y Z ? n *? S? ]? a? ? Y*+? c? ? ? T V W X ? T U ? ? @ ? ?
^ _ ? ? .? e? ? ? gY? h?*? k=? ?*d? o? ???? ? p . . q ? ) + ?
? ? r s ? a ? e? ? ? gY? h?*? 6? wW? ? 7 q ? ? x y ? ? T+*? 2? }W*? =M,? ~Y>? ]? (*? 6? ]? a? ?*,?
Y? ;? ?YM? =,? ~>,? ?+S+? ?W,`? ?? ? * T 7 T ? ? F @ ? ? T ? ? ? . # % ' ( '* (- :/ ?1 F2 L5 S6 ?
? (
? ? ? ? ? L *? =? ?*? =? ~? ? ? ? 7 ? 9 ? @ ? ? ? ?
%*? ?M,? ?,? ?? ]? ,? ?? ?*,? ?YM? ?,? ?>,? ~6d6? ?+? ?6`6+? ??? +? ?6`d? ?6? ?,? ?:+? ?: 6
6? `2:? ?? ? ?? ?W? ? ?? ??
? ?Y?? ??S+? ř ? +? ?W
?
S????? ]? ,? ?? *? ]? ?*,? ?? ?,? ?W+? ?
? ?+
? ?W?? ? ? _ ? ? P ? ? ? d ? y ? ? ? ? ? ? ? ? ?
% 7 % ? V - ? ? 3 ? ? 9 ? ? F ? ? M ? ? ? % ? U ? ? * ? @ A D E F H (K -L 3M 9N >O @R FS MU WV _W mZ s[ y\ ] ?^ ?_ ?` ?a ?b ?c ?e ?g ?i ?k ?l ?^ ?o ?q svwxz!{#~ ? E ?
? ? ,?
? ? ? # ? ? ? ? ? ? $ ? ? ;*? ?*? ?L+? *? ]? ?+? ?L??? M*? ?N-? *? ]? ?-? ?N???,?? ? ? % ? ; 7 ? 2 ? ? ?
? ? ? ? %? )? 0? 8? :? ? ?
? B R? R
? ? ? R ? ? ? / *? J? ? ? ? ? ? ? ? / *? 4? ? ? ? ? ? ? ? ; *+Z? J? ? ? ? ? ? ? $ ? B ? ? ? ? e? Y? ? ? ?
? ? ? @ ? ? *
© 2015 - 2025 Weber Informatics LLC | Privacy Policy