final class java.util.concurrent.ConcurrentHashMap$TreeBin<K, V> extends java.util.concurrent.ConcurrentHashMap$Node<K, V>
minor version: 0
major version: 59
flags: flags: (0x0030) ACC_FINAL, ACC_SUPER
this_class: java.util.concurrent.ConcurrentHashMap$TreeBin
super_class: java.util.concurrent.ConcurrentHashMap$Node
{
java.util.concurrent.ConcurrentHashMap$TreeNode<K, V> root;
descriptor: Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
flags: (0x0000)
Signature: Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
volatile java.util.concurrent.ConcurrentHashMap$TreeNode<K, V> first;
descriptor: Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
flags: (0x0040) ACC_VOLATILE
Signature: Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
volatile java.lang.Thread waiter;
descriptor: Ljava/lang/Thread;
flags: (0x0040) ACC_VOLATILE
volatile int lockState;
descriptor: I
flags: (0x0040) ACC_VOLATILE
static final int WRITER;
descriptor: I
flags: (0x0018) ACC_STATIC, ACC_FINAL
ConstantValue: 1
static final int WAITER;
descriptor: I
flags: (0x0018) ACC_STATIC, ACC_FINAL
ConstantValue: 2
static final int READER;
descriptor: I
flags: (0x0018) ACC_STATIC, ACC_FINAL
ConstantValue: 4
private static final long LOCKSTATE;
descriptor: J
flags: (0x001a) ACC_PRIVATE, ACC_STATIC, ACC_FINAL
static final boolean $assertionsDisabled;
descriptor: Z
flags: (0x1018) ACC_STATIC, ACC_FINAL, ACC_SYNTHETIC
static void <clinit>();
descriptor: ()V
flags: (0x0008) ACC_STATIC
Code:
stack=3, locals=0, args_size=0
0: ldc Ljava/util/concurrent/ConcurrentHashMap;
invokevirtual java.lang.Class.desiredAssertionStatus:()Z
ifne 1
iconst_1
goto 2
StackMap locals:
StackMap stack:
1: iconst_0
StackMap locals:
StackMap stack: int
2: putstatic java.util.concurrent.ConcurrentHashMap$TreeBin.$assertionsDisabled:Z
3: getstatic java.util.concurrent.ConcurrentHashMap.U:Ljdk/internal/misc/Unsafe;
ldc Ljava/util/concurrent/ConcurrentHashMap$TreeBin;
ldc "lockState"
invokevirtual jdk.internal.misc.Unsafe.objectFieldOffset:(Ljava/lang/Class;Ljava/lang/String;)J
4: putstatic java.util.concurrent.ConcurrentHashMap$TreeBin.LOCKSTATE:J
5: return
LocalVariableTable:
Start End Slot Name Signature
static int tieBreakOrder(java.lang.Object, java.lang.Object);
descriptor: (Ljava/lang/Object;Ljava/lang/Object;)I
flags: (0x0008) ACC_STATIC
Code:
stack=2, locals=3, args_size=2
start local 0 start local 1 0: aload 0
ifnull 5
aload 1
ifnull 5
1: aload 0
invokevirtual java.lang.Object.getClass:()Ljava/lang/Class;
invokevirtual java.lang.Class.getName:()Ljava/lang/String;
2: aload 1
invokevirtual java.lang.Object.getClass:()Ljava/lang/Class;
invokevirtual java.lang.Class.getName:()Ljava/lang/String;
invokevirtual java.lang.String.compareTo:(Ljava/lang/String;)I
3: dup
istore 2
start local 2 4: ifne 9
end local 2 5: StackMap locals:
StackMap stack:
aload 0
invokestatic java.lang.System.identityHashCode:(Ljava/lang/Object;)I
aload 1
invokestatic java.lang.System.identityHashCode:(Ljava/lang/Object;)I
if_icmpgt 7
6: iconst_m1
goto 8
StackMap locals:
StackMap stack:
7: iconst_1
8: StackMap locals:
StackMap stack: int
istore 2
start local 2 9: StackMap locals: int
StackMap stack:
iload 2
ireturn
end local 2 end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 10 0 a Ljava/lang/Object;
0 10 1 b Ljava/lang/Object;
4 5 2 d I
9 10 2 d I
MethodParameters:
Name Flags
a
b
void <init>(java.util.concurrent.ConcurrentHashMap$TreeNode<K, V>);
descriptor: (Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)V
flags: (0x0000)
Code:
stack=4, locals=13, args_size=2
start local 0 start local 1 0: aload 0
bipush -2
aconst_null
aconst_null
invokespecial java.util.concurrent.ConcurrentHashMap$Node.<init>:(ILjava/lang/Object;Ljava/lang/Object;)V
1: aload 0
aload 1
putfield java.util.concurrent.ConcurrentHashMap$TreeBin.first:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
2: aconst_null
astore 2
start local 2 3: aload 1
astore 3
start local 3 4: goto 39
5: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.next:Ljava/util/concurrent/ConcurrentHashMap$Node;
checkcast java.util.concurrent.ConcurrentHashMap$TreeNode
astore 4
start local 4 6: aload 3
aload 3
aconst_null
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
7: aload 2
ifnonnull 12
8: aload 3
aconst_null
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
9: aload 3
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
10: aload 3
astore 2
11: goto 38
12: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.key:Ljava/lang/Object;
astore 5
start local 5 13: aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.hash:I
istore 6
start local 6 14: aconst_null
astore 7
start local 7 15: aload 2
astore 8
start local 8 16: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.lang.Object int java.lang.Class java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 8
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.key:Ljava/lang/Object;
astore 11
start local 11 17: aload 8
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.hash:I
dup
istore 10
start local 10 18: iload 6
if_icmple 21
19: iconst_m1
istore 9
start local 9 20: goto 29
end local 9 21: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.lang.Object int java.lang.Class java.util.concurrent.ConcurrentHashMap$TreeNode top int java.lang.Object
StackMap stack:
iload 10
iload 6
if_icmpge 24
22: iconst_1
istore 9
start local 9 23: goto 29
end local 9 24: StackMap locals:
StackMap stack:
aload 7
ifnonnull 26
25: aload 5
invokestatic java.util.concurrent.ConcurrentHashMap.comparableClassFor:(Ljava/lang/Object;)Ljava/lang/Class;
dup
astore 7
ifnull 28
26: StackMap locals:
StackMap stack:
aload 7
aload 5
aload 11
invokestatic java.util.concurrent.ConcurrentHashMap.compareComparables:(Ljava/lang/Class;Ljava/lang/Object;Ljava/lang/Object;)I
dup
istore 9
start local 9 27: ifne 29
end local 9 28: StackMap locals:
StackMap stack:
aload 5
aload 11
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.tieBreakOrder:(Ljava/lang/Object;Ljava/lang/Object;)I
istore 9
start local 9 29: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.lang.Object int java.lang.Class java.util.concurrent.ConcurrentHashMap$TreeNode int int java.lang.Object
StackMap stack:
aload 8
astore 12
start local 12 30: iload 9
ifgt 31
aload 8
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
goto 32
StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
31: aload 8
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
StackMap locals:
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeNode
32: dup
astore 8
ifnonnull 16
33: aload 3
aload 12
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
34: iload 9
ifgt 36
35: aload 12
aload 3
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
goto 37
36: StackMap locals:
StackMap stack:
aload 12
aload 3
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
37: StackMap locals:
StackMap stack:
aload 2
aload 3
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.balanceInsertion:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 2
end local 12 end local 11 end local 10 end local 9 end local 8 end local 7 end local 6 end local 5 38: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 4
astore 3
end local 4 StackMap locals:
StackMap stack:
39: aload 3
ifnonnull 5
end local 3 40: aload 0
aload 2
putfield java.util.concurrent.ConcurrentHashMap$TreeBin.root:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
41: getstatic java.util.concurrent.ConcurrentHashMap$TreeBin.$assertionsDisabled:Z
ifne 42
aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.root:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.checkInvariants:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Z
ifne 42
new java.lang.AssertionError
dup
invokespecial java.lang.AssertionError.<init>:()V
athrow
42: StackMap locals:
StackMap stack:
return
end local 2 end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 43 0 this Ljava/util/concurrent/ConcurrentHashMap$TreeBin<TK;TV;>;
0 43 1 b Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
3 43 2 r Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
4 40 3 x Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
6 39 4 next Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
13 38 5 k TK;
14 38 6 h I
15 38 7 kc Ljava/lang/Class<*>;
16 38 8 p Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
20 21 9 dir I
23 24 9 dir I
27 28 9 dir I
29 38 9 dir I
18 38 10 ph I
17 38 11 pk TK;
30 38 12 xp Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
Signature: (Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;)V
MethodParameters:
Name Flags
b
private final void lockRoot();
descriptor: ()V
flags: (0x0012) ACC_PRIVATE, ACC_FINAL
Code:
stack=6, locals=1, args_size=1
start local 0 0: getstatic java.util.concurrent.ConcurrentHashMap.U:Ljdk/internal/misc/Unsafe;
aload 0
getstatic java.util.concurrent.ConcurrentHashMap$TreeBin.LOCKSTATE:J
iconst_0
iconst_1
invokevirtual jdk.internal.misc.Unsafe.compareAndSetInt:(Ljava/lang/Object;JII)Z
ifne 2
1: aload 0
invokevirtual java.util.concurrent.ConcurrentHashMap$TreeBin.contendedLock:()V
2: StackMap locals:
StackMap stack:
return
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 3 0 this Ljava/util/concurrent/ConcurrentHashMap$TreeBin<TK;TV;>;
private final void unlockRoot();
descriptor: ()V
flags: (0x0012) ACC_PRIVATE, ACC_FINAL
Code:
stack=2, locals=1, args_size=1
start local 0 0: aload 0
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeBin.lockState:I
1: return
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 2 0 this Ljava/util/concurrent/ConcurrentHashMap$TreeBin<TK;TV;>;
private final void contendedLock();
descriptor: ()V
flags: (0x0012) ACC_PRIVATE, ACC_FINAL
Code:
stack=7, locals=3, args_size=1
start local 0 0: iconst_0
istore 1
start local 1 1: StackMap locals: int
StackMap stack:
aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.lockState:I
dup
istore 2
start local 2 2: bipush -3
iand
ifne 7
3: getstatic java.util.concurrent.ConcurrentHashMap.U:Ljdk/internal/misc/Unsafe;
aload 0
getstatic java.util.concurrent.ConcurrentHashMap$TreeBin.LOCKSTATE:J
iload 2
iconst_1
invokevirtual jdk.internal.misc.Unsafe.compareAndSetInt:(Ljava/lang/Object;JII)Z
ifeq 1
4: iload 1
ifeq 6
5: aload 0
aconst_null
putfield java.util.concurrent.ConcurrentHashMap$TreeBin.waiter:Ljava/lang/Thread;
6: StackMap locals: int
StackMap stack:
return
7: StackMap locals:
StackMap stack:
iload 2
iconst_2
iand
ifne 12
8: getstatic java.util.concurrent.ConcurrentHashMap.U:Ljdk/internal/misc/Unsafe;
aload 0
getstatic java.util.concurrent.ConcurrentHashMap$TreeBin.LOCKSTATE:J
iload 2
iload 2
iconst_2
ior
invokevirtual jdk.internal.misc.Unsafe.compareAndSetInt:(Ljava/lang/Object;JII)Z
ifeq 1
9: iconst_1
istore 1
10: aload 0
invokestatic java.lang.Thread.currentThread:()Ljava/lang/Thread;
putfield java.util.concurrent.ConcurrentHashMap$TreeBin.waiter:Ljava/lang/Thread;
11: goto 1
12: StackMap locals:
StackMap stack:
iload 1
ifeq 1
13: aload 0
invokestatic java.util.concurrent.locks.LockSupport.park:(Ljava/lang/Object;)V
end local 2 14: goto 1
end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 15 0 this Ljava/util/concurrent/ConcurrentHashMap$TreeBin<TK;TV;>;
1 15 1 waiting Z
2 14 2 s I
final java.util.concurrent.ConcurrentHashMap$Node<K, V> find(int, );
descriptor: (ILjava/lang/Object;)Ljava/util/concurrent/ConcurrentHashMap$Node;
flags: (0x0010) ACC_FINAL
Code:
stack=7, locals=10, args_size=3
start local 0 start local 1 start local 2 0: aload 2
ifnull 36
1: aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.first:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 3
start local 3 2: goto 35
3: StackMap locals: java.util.concurrent.ConcurrentHashMap$Node
StackMap stack:
aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.lockState:I
dup
istore 4
start local 4 4: iconst_3
iand
ifeq 11
5: aload 3
getfield java.util.concurrent.ConcurrentHashMap$Node.hash:I
iload 1
if_icmpne 9
6: aload 3
getfield java.util.concurrent.ConcurrentHashMap$Node.key:Ljava/lang/Object;
dup
astore 5
start local 5 7: aload 2
if_acmpeq 8
aload 5
ifnull 9
aload 2
aload 5
invokevirtual java.lang.Object.equals:(Ljava/lang/Object;)Z
ifeq 9
8: StackMap locals: int java.lang.Object
StackMap stack:
aload 3
areturn
end local 5 9: StackMap locals:
StackMap stack:
aload 3
getfield java.util.concurrent.ConcurrentHashMap$Node.next:Ljava/util/concurrent/ConcurrentHashMap$Node;
astore 3
10: goto 35
11: StackMap locals:
StackMap stack:
getstatic java.util.concurrent.ConcurrentHashMap.U:Ljdk/internal/misc/Unsafe;
aload 0
getstatic java.util.concurrent.ConcurrentHashMap$TreeBin.LOCKSTATE:J
iload 4
12: iload 4
iconst_4
iadd
13: invokevirtual jdk.internal.misc.Unsafe.compareAndSetInt:(Ljava/lang/Object;JII)Z
14: ifeq 35
15: aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.root:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 6
start local 6 16: ifnonnull 17
aconst_null
goto 18
17: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin int java.lang.Object java.util.concurrent.ConcurrentHashMap$Node int top java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 6
iload 1
aload 2
aconst_null
invokevirtual java.util.concurrent.ConcurrentHashMap$TreeNode.findTreeNode:(ILjava/lang/Object;Ljava/lang/Class;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
18: StackMap locals:
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeNode
astore 7
start local 7 19: goto 28
end local 7 end local 6 StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin int java.lang.Object java.util.concurrent.ConcurrentHashMap$Node int
StackMap stack: java.lang.Throwable
20: astore 8
21: getstatic java.util.concurrent.ConcurrentHashMap.U:Ljdk/internal/misc/Unsafe;
aload 0
getstatic java.util.concurrent.ConcurrentHashMap$TreeBin.LOCKSTATE:J
bipush -4
invokevirtual jdk.internal.misc.Unsafe.getAndAddInt:(Ljava/lang/Object;JI)I
22: bipush 6
23: if_icmpne 27
24: aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.waiter:Ljava/lang/Thread;
dup
astore 9
start local 9 25: ifnull 27
26: aload 9
invokestatic java.util.concurrent.locks.LockSupport.unpark:(Ljava/lang/Thread;)V
end local 9 27: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin int java.lang.Object java.util.concurrent.ConcurrentHashMap$Node int top top top java.lang.Throwable
StackMap stack:
aload 8
athrow
start local 6 start local 7 28: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin int java.lang.Object java.util.concurrent.ConcurrentHashMap$Node int top java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
getstatic java.util.concurrent.ConcurrentHashMap.U:Ljdk/internal/misc/Unsafe;
aload 0
getstatic java.util.concurrent.ConcurrentHashMap$TreeBin.LOCKSTATE:J
bipush -4
invokevirtual jdk.internal.misc.Unsafe.getAndAddInt:(Ljava/lang/Object;JI)I
29: bipush 6
30: if_icmpne 34
31: aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.waiter:Ljava/lang/Thread;
dup
astore 9
start local 9 32: ifnull 34
33: aload 9
invokestatic java.util.concurrent.locks.LockSupport.unpark:(Ljava/lang/Thread;)V
end local 9 34: StackMap locals:
StackMap stack:
aload 7
areturn
end local 7 end local 6 end local 4 35: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin int java.lang.Object java.util.concurrent.ConcurrentHashMap$Node
StackMap stack:
aload 3
ifnonnull 3
end local 3 36: StackMap locals:
StackMap stack:
aconst_null
areturn
end local 2 end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 37 0 this Ljava/util/concurrent/ConcurrentHashMap$TreeBin<TK;TV;>;
0 37 1 h I
0 37 2 k Ljava/lang/Object;
2 36 3 e Ljava/util/concurrent/ConcurrentHashMap$Node<TK;TV;>;
4 35 4 s I
7 9 5 ek TK;
16 20 6 r Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
28 35 6 r Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
19 20 7 p Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
28 35 7 p Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
25 27 9 w Ljava/lang/Thread;
32 34 9 w Ljava/lang/Thread;
Exception table:
from to target type
15 20 20 any
Signature: (ILjava/lang/Object;)Ljava/util/concurrent/ConcurrentHashMap$Node<TK;TV;>;
MethodParameters:
Name Flags
h
k
final java.util.concurrent.ConcurrentHashMap$TreeNode<K, V> putTreeVal(int, K, V);
descriptor: (ILjava/lang/Object;Ljava/lang/Object;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
flags: (0x0010) ACC_FINAL
Code:
stack=9, locals=14, args_size=4
start local 0 start local 1 start local 2 start local 3 0: aconst_null
astore 4
start local 4 1: iconst_0
istore 5
start local 5 2: aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.root:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 6
start local 6 3: StackMap locals: java.lang.Class int java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 6
ifnonnull 6
4: aload 0
aload 0
new java.util.concurrent.ConcurrentHashMap$TreeNode
dup
iload 1
aload 2
aload 3
aconst_null
aconst_null
invokespecial java.util.concurrent.ConcurrentHashMap$TreeNode.<init>:(ILjava/lang/Object;Ljava/lang/Object;Ljava/util/concurrent/ConcurrentHashMap$Node;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)V
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeBin.root:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
putfield java.util.concurrent.ConcurrentHashMap$TreeBin.first:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
5: goto 52
6: StackMap locals:
StackMap stack:
aload 6
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.hash:I
dup
istore 8
start local 8 7: iload 1
if_icmple 10
8: iconst_m1
istore 7
start local 7 9: goto 31
end local 7 10: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin int java.lang.Object java.lang.Object java.lang.Class int java.util.concurrent.ConcurrentHashMap$TreeNode top int
StackMap stack:
iload 8
iload 1
if_icmpge 13
11: iconst_1
istore 7
start local 7 12: goto 31
end local 7 13: StackMap locals:
StackMap stack:
aload 6
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.key:Ljava/lang/Object;
dup
astore 9
start local 9 14: aload 2
if_acmpeq 15
aload 9
ifnull 16
aload 2
aload 9
invokevirtual java.lang.Object.equals:(Ljava/lang/Object;)Z
ifeq 16
15: StackMap locals: java.lang.Object
StackMap stack:
aload 6
areturn
16: StackMap locals:
StackMap stack:
aload 4
ifnonnull 18
17: aload 2
invokestatic java.util.concurrent.ConcurrentHashMap.comparableClassFor:(Ljava/lang/Object;)Ljava/lang/Class;
dup
astore 4
ifnull 20
18: StackMap locals:
StackMap stack:
aload 4
aload 2
aload 9
invokestatic java.util.concurrent.ConcurrentHashMap.compareComparables:(Ljava/lang/Class;Ljava/lang/Object;Ljava/lang/Object;)I
dup
istore 7
start local 7 19: ifne 31
end local 7 20: StackMap locals:
StackMap stack:
iload 5
ifne 30
21: iconst_1
istore 5
22: aload 6
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 11
start local 11 23: ifnull 26
24: aload 11
iload 1
aload 2
aload 4
invokevirtual java.util.concurrent.ConcurrentHashMap$TreeNode.findTreeNode:(ILjava/lang/Object;Ljava/lang/Class;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 10
start local 10 25: ifnonnull 29
end local 10 26: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin int java.lang.Object java.lang.Object java.lang.Class int java.util.concurrent.ConcurrentHashMap$TreeNode top int java.lang.Object top java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 6
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 11
ifnull 30
27: aload 11
iload 1
aload 2
aload 4
invokevirtual java.util.concurrent.ConcurrentHashMap$TreeNode.findTreeNode:(ILjava/lang/Object;Ljava/lang/Class;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 10
start local 10 28: ifnull 30
29: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin int java.lang.Object java.lang.Object java.lang.Class int java.util.concurrent.ConcurrentHashMap$TreeNode top int java.lang.Object java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 10
areturn
end local 11 end local 10 30: StackMap locals:
StackMap stack:
aload 2
aload 9
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.tieBreakOrder:(Ljava/lang/Object;Ljava/lang/Object;)I
istore 7
end local 9 start local 7 31: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin int java.lang.Object java.lang.Object java.lang.Class int java.util.concurrent.ConcurrentHashMap$TreeNode int int
StackMap stack:
aload 6
astore 10
start local 10 32: iload 7
ifgt 33
aload 6
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
goto 34
StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin int java.lang.Object java.lang.Object java.lang.Class int java.util.concurrent.ConcurrentHashMap$TreeNode int int top java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
33: aload 6
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
StackMap locals:
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeNode
34: dup
astore 6
ifnonnull 3
35: aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.first:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 12
start local 12 36: aload 0
new java.util.concurrent.ConcurrentHashMap$TreeNode
dup
iload 1
aload 2
aload 3
aload 12
aload 10
invokespecial java.util.concurrent.ConcurrentHashMap$TreeNode.<init>:(ILjava/lang/Object;Ljava/lang/Object;Ljava/util/concurrent/ConcurrentHashMap$Node;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)V
dup
astore 11
start local 11 37: putfield java.util.concurrent.ConcurrentHashMap$TreeBin.first:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
38: aload 12
ifnull 40
39: aload 12
aload 11
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.prev:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
40: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
iload 7
ifgt 42
41: aload 10
aload 11
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
goto 43
42: StackMap locals:
StackMap stack:
aload 10
aload 11
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
43: StackMap locals:
StackMap stack:
aload 10
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifne 45
44: aload 11
iconst_1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
goto 52
45: StackMap locals:
StackMap stack:
aload 0
invokevirtual java.util.concurrent.ConcurrentHashMap$TreeBin.lockRoot:()V
46: aload 0
aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.root:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
aload 11
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.balanceInsertion:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
putfield java.util.concurrent.ConcurrentHashMap$TreeBin.root:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
47: goto 51
StackMap locals:
StackMap stack: java.lang.Throwable
48: astore 13
49: aload 0
invokevirtual java.util.concurrent.ConcurrentHashMap$TreeBin.unlockRoot:()V
50: aload 13
athrow
51: StackMap locals:
StackMap stack:
aload 0
invokevirtual java.util.concurrent.ConcurrentHashMap$TreeBin.unlockRoot:()V
end local 12 end local 11 end local 10 end local 8 end local 7 end local 6 52: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin int java.lang.Object java.lang.Object java.lang.Class int
StackMap stack:
getstatic java.util.concurrent.ConcurrentHashMap$TreeBin.$assertionsDisabled:Z
ifne 54
53: aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.root:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.checkInvariants:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Z
ifne 54
new java.lang.AssertionError
dup
invokespecial java.lang.AssertionError.<init>:()V
athrow
54: StackMap locals:
StackMap stack:
aconst_null
areturn
end local 5 end local 4 end local 3 end local 2 end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 55 0 this Ljava/util/concurrent/ConcurrentHashMap$TreeBin<TK;TV;>;
0 55 1 h I
0 55 2 k TK;
0 55 3 v TV;
1 55 4 kc Ljava/lang/Class<*>;
2 55 5 searched Z
3 52 6 p Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
9 10 7 dir I
12 13 7 dir I
19 20 7 dir I
31 52 7 dir I
7 52 8 ph I
14 31 9 pk TK;
25 26 10 q Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
28 30 10 q Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
23 30 11 ch Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
32 52 10 xp Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
37 52 11 x Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
36 52 12 f Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
Exception table:
from to target type
46 48 48 any
Signature: (ITK;TV;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
MethodParameters:
Name Flags
h
k
v
final boolean removeTreeNode(java.util.concurrent.ConcurrentHashMap$TreeNode<K, V>);
descriptor: (Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Z
flags: (0x0010) ACC_FINAL
Code:
stack=5, locals=16, args_size=2
start local 0 start local 1 0: aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.next:Ljava/util/concurrent/ConcurrentHashMap$Node;
checkcast java.util.concurrent.ConcurrentHashMap$TreeNode
astore 2
start local 2 1: aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.prev:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 3
start local 3 2: aload 3
ifnonnull 4
3: aload 0
aload 2
putfield java.util.concurrent.ConcurrentHashMap$TreeBin.first:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
goto 5
4: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 3
aload 2
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.next:Ljava/util/concurrent/ConcurrentHashMap$Node;
5: StackMap locals:
StackMap stack:
aload 2
ifnull 7
6: aload 2
aload 3
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.prev:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
7: StackMap locals:
StackMap stack:
aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.first:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
ifnonnull 10
8: aload 0
aconst_null
putfield java.util.concurrent.ConcurrentHashMap$TreeBin.root:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
9: iconst_1
ireturn
10: StackMap locals:
StackMap stack:
aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.root:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 4
start local 4 11: ifnull 14
aload 4
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
ifnull 14
12: aload 4
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 5
start local 5 13: ifnull 14
aload 5
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
ifnonnull 15
end local 5 14: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
iconst_1
ireturn
start local 5 15: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 0
invokevirtual java.util.concurrent.ConcurrentHashMap$TreeBin.lockRoot:()V
16: aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 7
start local 7 17: aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 8
start local 8 18: aload 7
ifnull 54
aload 8
ifnull 54
19: aload 8
astore 9
start local 9 20: goto 22
start local 10 21: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode top java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 10
astore 9
end local 10 22: StackMap locals:
StackMap stack:
aload 9
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 10
start local 10 23: ifnonnull 21
24: aload 9
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
istore 11
start local 11 25: aload 9
aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
aload 1
iload 11
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
26: aload 9
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 12
start local 12 27: aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 13
start local 13 28: aload 9
aload 8
if_acmpne 32
29: aload 1
aload 9
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
30: aload 9
aload 1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
31: goto 39
32: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode top java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode int java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 9
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 14
start local 14 33: aload 1
aload 14
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
ifnull 37
34: aload 9
aload 14
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
if_acmpne 36
35: aload 14
aload 1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
goto 37
36: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 14
aload 1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
37: StackMap locals:
StackMap stack:
aload 9
aload 8
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
ifnull 39
38: aload 8
aload 9
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
end local 14 39: StackMap locals:
StackMap stack:
aload 1
aconst_null
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
40: aload 1
aload 12
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
ifnull 42
41: aload 12
aload 1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
42: StackMap locals:
StackMap stack:
aload 9
aload 7
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
ifnull 44
43: aload 7
aload 9
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
44: StackMap locals:
StackMap stack:
aload 9
aload 13
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
ifnonnull 46
45: aload 9
astore 4
goto 49
46: StackMap locals:
StackMap stack:
aload 1
aload 13
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
if_acmpne 48
47: aload 13
aload 9
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
goto 49
48: StackMap locals:
StackMap stack:
aload 13
aload 9
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
49: StackMap locals:
StackMap stack:
aload 12
ifnull 52
50: aload 12
astore 6
start local 6 51: goto 61
end local 6 52: StackMap locals:
StackMap stack:
aload 1
astore 6
end local 13 end local 12 end local 11 end local 10 end local 9 start local 6 53: goto 61
end local 6 54: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode top java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 7
ifnull 57
55: aload 7
astore 6
start local 6 56: goto 61
end local 6 57: StackMap locals:
StackMap stack:
aload 8
ifnull 60
58: aload 8
astore 6
start local 6 59: goto 61
end local 6 60: StackMap locals:
StackMap stack:
aload 1
astore 6
start local 6 61: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 6
aload 1
if_acmpeq 69
62: aload 6
aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 9
start local 9 63: aload 9
ifnonnull 65
64: aload 6
astore 4
goto 68
65: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 1
aload 9
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
if_acmpne 67
66: aload 9
aload 6
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
goto 68
67: StackMap locals:
StackMap stack:
aload 9
aload 6
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
68: StackMap locals:
StackMap stack:
aload 1
aload 1
aload 1
aconst_null
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
end local 9 69: StackMap locals:
StackMap stack:
aload 0
aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifeq 70
aload 4
goto 71
StackMap locals:
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeBin
70: aload 4
aload 6
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.balanceDeletion:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeBin java.util.concurrent.ConcurrentHashMap$TreeNode
71: putfield java.util.concurrent.ConcurrentHashMap$TreeBin.root:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
72: aload 1
aload 6
if_acmpne 84
73: aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 9
start local 9 74: ifnull 84
75: aload 1
aload 9
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
if_acmpne 77
76: aload 9
aconst_null
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
goto 79
77: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 1
aload 9
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
if_acmpne 79
78: aload 9
aconst_null
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
79: StackMap locals:
StackMap stack:
aload 1
aconst_null
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
end local 9 end local 8 end local 7 end local 6 80: goto 84
StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeBin java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack: java.lang.Throwable
81: astore 15
82: aload 0
invokevirtual java.util.concurrent.ConcurrentHashMap$TreeBin.unlockRoot:()V
83: aload 15
athrow
84: StackMap locals:
StackMap stack:
aload 0
invokevirtual java.util.concurrent.ConcurrentHashMap$TreeBin.unlockRoot:()V
85: getstatic java.util.concurrent.ConcurrentHashMap$TreeBin.$assertionsDisabled:Z
ifne 86
aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeBin.root:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.checkInvariants:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Z
ifne 86
new java.lang.AssertionError
dup
invokespecial java.lang.AssertionError.<init>:()V
athrow
86: StackMap locals:
StackMap stack:
iconst_0
ireturn
end local 5 end local 4 end local 3 end local 2 end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 87 0 this Ljava/util/concurrent/ConcurrentHashMap$TreeBin<TK;TV;>;
0 87 1 p Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
1 87 2 next Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
2 87 3 pred Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
11 87 4 r Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
13 14 5 rl Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
15 87 5 rl Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
51 52 6 replacement Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
53 54 6 replacement Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
56 57 6 replacement Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
59 60 6 replacement Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
61 80 6 replacement Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
17 80 7 pl Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
18 80 8 pr Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
20 53 9 s Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
21 22 10 sl Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
23 53 10 sl Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
25 53 11 c Z
27 53 12 sr Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
28 53 13 pp Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
33 39 14 sp Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
63 69 9 pp Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
74 80 9 pp Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
Exception table:
from to target type
16 81 81 any
Signature: (Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;)Z
MethodParameters:
Name Flags
p
static <K, V> java.util.concurrent.ConcurrentHashMap$TreeNode<K, V> rotateLeft(java.util.concurrent.ConcurrentHashMap$TreeNode<K, V>, java.util.concurrent.ConcurrentHashMap$TreeNode<K, V>);
descriptor: (Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
flags: (0x0008) ACC_STATIC
Code:
stack=3, locals=5, args_size=2
start local 0 start local 1 0: aload 1
ifnull 13
aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 2
start local 2 1: ifnull 13
2: aload 1
aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 4
start local 4 3: ifnull 5
4: aload 4
aload 1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
5: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode top java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 2
aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 3
start local 3 6: ifnonnull 8
7: aload 2
dup
astore 0
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
goto 11
8: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
aload 1
if_acmpne 10
9: aload 3
aload 2
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
goto 11
10: StackMap locals:
StackMap stack:
aload 3
aload 2
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
11: StackMap locals:
StackMap stack:
aload 2
aload 1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
12: aload 1
aload 2
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
end local 4 end local 3 end local 2 13: StackMap locals:
StackMap stack:
aload 0
areturn
end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 14 0 root Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
0 14 1 p Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
1 13 2 r Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
6 13 3 pp Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
3 13 4 rl Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>(Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
MethodParameters:
Name Flags
root
p
static <K, V> java.util.concurrent.ConcurrentHashMap$TreeNode<K, V> rotateRight(java.util.concurrent.ConcurrentHashMap$TreeNode<K, V>, java.util.concurrent.ConcurrentHashMap$TreeNode<K, V>);
descriptor: (Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
flags: (0x0008) ACC_STATIC
Code:
stack=3, locals=5, args_size=2
start local 0 start local 1 0: aload 1
ifnull 13
aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 2
start local 2 1: ifnull 13
2: aload 1
aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 4
start local 4 3: ifnull 5
4: aload 4
aload 1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
5: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode top java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 2
aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup_x1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 3
start local 3 6: ifnonnull 8
7: aload 2
dup
astore 0
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
goto 11
8: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
aload 1
if_acmpne 10
9: aload 3
aload 2
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
goto 11
10: StackMap locals:
StackMap stack:
aload 3
aload 2
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
11: StackMap locals:
StackMap stack:
aload 2
aload 1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
12: aload 1
aload 2
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
end local 4 end local 3 end local 2 13: StackMap locals:
StackMap stack:
aload 0
areturn
end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 14 0 root Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
0 14 1 p Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
1 13 2 l Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
6 13 3 pp Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
3 13 4 lr Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>(Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
MethodParameters:
Name Flags
root
p
static <K, V> java.util.concurrent.ConcurrentHashMap$TreeNode<K, V> balanceInsertion(java.util.concurrent.ConcurrentHashMap$TreeNode<K, V>, java.util.concurrent.ConcurrentHashMap$TreeNode<K, V>);
descriptor: (Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
flags: (0x0008) ACC_STATIC
Code:
stack=3, locals=6, args_size=2
start local 0 start local 1 0: aload 1
iconst_1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
1: StackMap locals:
StackMap stack:
aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 2
start local 2 2: ifnonnull 5
3: aload 1
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
4: aload 1
areturn
5: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifeq 7
aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 3
start local 3 6: ifnonnull 8
end local 3 7: StackMap locals:
StackMap stack:
aload 0
areturn
start local 3 8: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 2
aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 4
start local 4 9: if_acmpne 28
10: aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 5
start local 5 11: ifnull 17
aload 5
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifeq 17
12: aload 5
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
13: aload 2
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
14: aload 3
iconst_1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
15: aload 3
astore 1
16: goto 1
17: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 1
aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
if_acmpne 22
18: aload 0
aload 2
dup
astore 1
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.rotateLeft:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 0
19: aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 2
ifnonnull 20
aconst_null
goto 21
StackMap locals:
StackMap stack:
20: aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
StackMap locals:
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeNode
21: astore 3
22: StackMap locals:
StackMap stack:
aload 2
ifnull 1
23: aload 2
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
24: aload 3
ifnull 1
25: aload 3
iconst_1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
26: aload 0
aload 3
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.rotateRight:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 0
27: goto 1
end local 5 28: StackMap locals:
StackMap stack:
aload 4
ifnull 34
aload 4
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifeq 34
29: aload 4
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
30: aload 2
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
31: aload 3
iconst_1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
32: aload 3
astore 1
33: goto 1
34: StackMap locals:
StackMap stack:
aload 1
aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
if_acmpne 39
35: aload 0
aload 2
dup
astore 1
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.rotateRight:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 0
36: aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 2
ifnonnull 37
aconst_null
goto 38
StackMap locals:
StackMap stack:
37: aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
StackMap locals:
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeNode
38: astore 3
39: StackMap locals:
StackMap stack:
aload 2
ifnull 1
40: aload 2
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
41: aload 3
ifnull 1
42: aload 3
iconst_1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
43: aload 0
aload 3
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.rotateLeft:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 0
end local 4 end local 3 end local 2 44: goto 1
end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 45 0 root Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
0 45 1 x Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
2 44 2 xp Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
6 7 3 xpp Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
8 44 3 xpp Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
9 44 4 xppl Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
11 28 5 xppr Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>(Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
MethodParameters:
Name Flags
root
x
static <K, V> java.util.concurrent.ConcurrentHashMap$TreeNode<K, V> balanceDeletion(java.util.concurrent.ConcurrentHashMap$TreeNode<K, V>, java.util.concurrent.ConcurrentHashMap$TreeNode<K, V>);
descriptor: (Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
flags: (0x0008) ACC_STATIC
Code:
stack=2, locals=7, args_size=2
start local 0 start local 1 0: StackMap locals:
StackMap stack:
aload 1
ifnull 1
aload 1
aload 0
if_acmpne 2
1: StackMap locals:
StackMap stack:
aload 0
areturn
2: StackMap locals:
StackMap stack:
aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 2
start local 2 3: ifnonnull 6
4: aload 1
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
5: aload 1
areturn
6: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifeq 9
7: aload 1
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
8: aload 0
areturn
9: StackMap locals:
StackMap stack:
aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 3
start local 3 10: aload 1
if_acmpne 48
11: aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 4
start local 4 12: ifnull 19
aload 4
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifeq 19
13: aload 4
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
14: aload 2
iconst_1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
15: aload 0
aload 2
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.rotateLeft:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 0
16: aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 2
ifnonnull 17
aconst_null
goto 18
StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
17: aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
StackMap locals:
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeNode
18: astore 4
19: StackMap locals:
StackMap stack:
aload 4
ifnonnull 21
20: aload 2
astore 1
goto 0
21: StackMap locals:
StackMap stack:
aload 4
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 5
start local 5 22: aload 4
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 6
start local 6 23: aload 6
ifnull 24
aload 6
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifne 28
24: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 5
ifnull 25
aload 5
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifne 28
25: StackMap locals:
StackMap stack:
aload 4
iconst_1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
26: aload 2
astore 1
27: goto 0
28: StackMap locals:
StackMap stack:
aload 6
ifnull 29
aload 6
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifne 37
29: StackMap locals:
StackMap stack:
aload 5
ifnull 31
30: aload 5
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
31: StackMap locals:
StackMap stack:
aload 4
iconst_1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
32: aload 0
aload 4
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.rotateRight:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 0
33: aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 2
ifnonnull 35
34: aconst_null
goto 36
StackMap locals:
StackMap stack:
35: aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
36: StackMap locals:
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeNode
astore 4
37: StackMap locals:
StackMap stack:
aload 4
ifnull 43
38: aload 4
aload 2
ifnonnull 39
iconst_0
goto 40
StackMap locals:
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeNode
39: aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeNode int
40: putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
41: aload 4
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 6
ifnull 43
42: aload 6
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
43: StackMap locals:
StackMap stack:
aload 2
ifnull 46
44: aload 2
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
45: aload 0
aload 2
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.rotateLeft:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 0
46: StackMap locals:
StackMap stack:
aload 0
astore 1
end local 6 end local 5 47: goto 0
end local 4 48: StackMap locals:
StackMap stack:
aload 3
ifnull 55
aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifeq 55
49: aload 3
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
50: aload 2
iconst_1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
51: aload 0
aload 2
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.rotateRight:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 0
52: aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 2
ifnonnull 53
aconst_null
goto 54
StackMap locals:
StackMap stack:
53: aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
StackMap locals:
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeNode
54: astore 3
55: StackMap locals:
StackMap stack:
aload 3
ifnonnull 57
56: aload 2
astore 1
goto 0
57: StackMap locals:
StackMap stack:
aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 5
start local 5 58: aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 6
start local 6 59: aload 5
ifnull 60
aload 5
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifne 64
60: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode top java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 6
ifnull 61
aload 6
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifne 64
61: StackMap locals:
StackMap stack:
aload 3
iconst_1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
62: aload 2
astore 1
63: goto 0
64: StackMap locals:
StackMap stack:
aload 5
ifnull 65
aload 5
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifne 73
65: StackMap locals:
StackMap stack:
aload 6
ifnull 67
66: aload 6
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
67: StackMap locals:
StackMap stack:
aload 3
iconst_1
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
68: aload 0
aload 3
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.rotateLeft:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 0
69: aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 2
ifnonnull 71
70: aconst_null
goto 72
StackMap locals:
StackMap stack:
71: aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
72: StackMap locals:
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeNode
astore 3
73: StackMap locals:
StackMap stack:
aload 3
ifnull 79
74: aload 3
aload 2
ifnonnull 75
iconst_0
goto 76
StackMap locals:
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeNode
75: aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode top java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack: java.util.concurrent.ConcurrentHashMap$TreeNode int
76: putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
77: aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
dup
astore 5
ifnull 79
78: aload 5
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
79: StackMap locals:
StackMap stack:
aload 2
ifnull 82
80: aload 2
iconst_0
putfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
81: aload 0
aload 2
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.rotateRight:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 0
82: StackMap locals:
StackMap stack:
aload 0
astore 1
end local 6 end local 5 end local 3 end local 2 83: goto 0
end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 84 0 root Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
0 84 1 x Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
3 83 2 xp Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
10 83 3 xpl Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
12 48 4 xpr Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
22 47 5 sl Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
23 47 6 sr Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
58 83 5 sl Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
59 83 6 sr Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>(Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;)Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
MethodParameters:
Name Flags
root
x
static <K, V> boolean checkInvariants(java.util.concurrent.ConcurrentHashMap$TreeNode<K, V>);
descriptor: (Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Z
flags: (0x0008) ACC_STATIC
Code:
stack=2, locals=6, args_size=1
start local 0 0: aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 1
start local 1 1: aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 2
start local 2 2: aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 3
start local 3 3: aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.prev:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
astore 4
start local 4 4: aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.next:Ljava/util/concurrent/ConcurrentHashMap$Node;
checkcast java.util.concurrent.ConcurrentHashMap$TreeNode
astore 5
start local 5 5: aload 4
ifnull 7
aload 4
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.next:Ljava/util/concurrent/ConcurrentHashMap$Node;
aload 0
if_acmpeq 7
6: iconst_0
ireturn
7: StackMap locals: java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode java.util.concurrent.ConcurrentHashMap$TreeNode
StackMap stack:
aload 5
ifnull 9
aload 5
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.prev:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
aload 0
if_acmpeq 9
8: iconst_0
ireturn
9: StackMap locals:
StackMap stack:
aload 1
ifnull 11
aload 0
aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.left:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
if_acmpeq 11
aload 0
aload 1
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.right:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
if_acmpeq 11
10: iconst_0
ireturn
11: StackMap locals:
StackMap stack:
aload 2
ifnull 13
aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
aload 0
if_acmpne 12
aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.hash:I
aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.hash:I
if_icmple 13
12: StackMap locals:
StackMap stack:
iconst_0
ireturn
13: StackMap locals:
StackMap stack:
aload 3
ifnull 15
aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.parent:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
aload 0
if_acmpne 14
aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.hash:I
aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.hash:I
if_icmpge 15
14: StackMap locals:
StackMap stack:
iconst_0
ireturn
15: StackMap locals:
StackMap stack:
aload 0
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifeq 17
aload 2
ifnull 17
aload 2
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifeq 17
aload 3
ifnull 17
aload 3
getfield java.util.concurrent.ConcurrentHashMap$TreeNode.red:Z
ifeq 17
16: iconst_0
ireturn
17: StackMap locals:
StackMap stack:
aload 2
ifnull 19
aload 2
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.checkInvariants:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Z
ifne 19
18: iconst_0
ireturn
19: StackMap locals:
StackMap stack:
aload 3
ifnull 21
aload 3
invokestatic java.util.concurrent.ConcurrentHashMap$TreeBin.checkInvariants:(Ljava/util/concurrent/ConcurrentHashMap$TreeNode;)Z
ifne 21
20: iconst_0
ireturn
21: StackMap locals:
StackMap stack:
iconst_1
ireturn
end local 5 end local 4 end local 3 end local 2 end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 22 0 t Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
1 22 1 tp Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
2 22 2 tl Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
3 22 3 tr Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
4 22 4 tb Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
5 22 5 tn Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;
Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>(Ljava/util/concurrent/ConcurrentHashMap$TreeNode<TK;TV;>;)Z
MethodParameters:
Name Flags
t
}
Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>Ljava/util/concurrent/ConcurrentHashMap$Node<TK;TV;>;
SourceFile: "ConcurrentHashMap.java"
NestHost: java.util.concurrent.ConcurrentHashMap
InnerClasses:
Node = java.util.concurrent.ConcurrentHashMap$Node of java.util.concurrent.ConcurrentHashMap
final TreeBin = java.util.concurrent.ConcurrentHashMap$TreeBin of java.util.concurrent.ConcurrentHashMap
final TreeNode = java.util.concurrent.ConcurrentHashMap$TreeNode of java.util.concurrent.ConcurrentHashMap