public class edu.umd.cs.findbugs.util.TopologicalSort
minor version: 0
major version: 59
flags: flags: (0x0021) ACC_PUBLIC, ACC_SUPER
this_class: edu.umd.cs.findbugs.util.TopologicalSort
super_class: java.lang.Object
{
static final boolean DEBUG;
descriptor: Z
flags: (0x0018) ACC_STATIC, ACC_FINAL
static void <clinit>();
descriptor: ()V
flags: (0x0008) ACC_STATIC
Code:
stack=1, locals=0, args_size=0
0: ldc "tsort.debug"
invokestatic edu.umd.cs.findbugs.SystemProperties.getBoolean:(Ljava/lang/String;)Z
putstatic edu.umd.cs.findbugs.util.TopologicalSort.DEBUG:Z
return
LocalVariableTable:
Start End Slot Name Signature
public void <init>();
descriptor: ()V
flags: (0x0001) ACC_PUBLIC
Code:
stack=1, locals=1, args_size=1
start local 0 0: aload 0
invokespecial java.lang.Object.<init>:()V
return
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 1 0 this Ledu/umd/cs/findbugs/util/TopologicalSort;
public static <E> java.util.List<E> sortByCallGraph(java.util.Collection<E>, edu.umd.cs.findbugs.util.TopologicalSort$OutEdges<E>);
descriptor: (Ljava/util/Collection;Ledu/umd/cs/findbugs/util/TopologicalSort$OutEdges;)Ljava/util/List;
flags: (0x0009) ACC_PUBLIC, ACC_STATIC
Code:
stack=4, locals=6, args_size=2
start local 0 start local 1 0: invokestatic edu.umd.cs.findbugs.classfile.Global.getAnalysisCache:()Ledu/umd/cs/findbugs/classfile/IAnalysisCache;
invokeinterface edu.umd.cs.findbugs.classfile.IAnalysisCache.getProfiler:()Ledu/umd/cs/findbugs/log/Profiler;
astore 2
start local 2 1: aload 2
ldc Ledu/umd/cs/findbugs/util/TopologicalSort;
invokevirtual edu.umd.cs.findbugs.log.Profiler.start:(Ljava/lang/Class;)V
2: new edu.umd.cs.findbugs.util.TopologicalSort$Worker2
dup
aload 0
aload 1
invokespecial edu.umd.cs.findbugs.util.TopologicalSort$Worker2.<init>:(Ljava/util/Collection;Ledu/umd/cs/findbugs/util/TopologicalSort$OutEdges;)V
astore 3
start local 3 3: aload 3
invokeinterface edu.umd.cs.findbugs.util.TopologicalSort$SortAlgorithm.compute:()Ljava/util/List;
astore 5
4: aload 2
ldc Ledu/umd/cs/findbugs/util/TopologicalSort;
invokevirtual edu.umd.cs.findbugs.log.Profiler.end:(Ljava/lang/Class;)V
5: aload 5
areturn
end local 3 6: StackMap locals: java.util.Collection edu.umd.cs.findbugs.util.TopologicalSort$OutEdges edu.umd.cs.findbugs.log.Profiler
StackMap stack: java.lang.Throwable
astore 4
7: aload 2
ldc Ledu/umd/cs/findbugs/util/TopologicalSort;
invokevirtual edu.umd.cs.findbugs.log.Profiler.end:(Ljava/lang/Class;)V
8: aload 4
athrow
end local 2 end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 9 0 elements Ljava/util/Collection<TE;>;
0 9 1 outEdges Ledu/umd/cs/findbugs/util/TopologicalSort$OutEdges<TE;>;
1 9 2 profile Ledu/umd/cs/findbugs/log/Profiler;
3 6 3 instance Ledu/umd/cs/findbugs/util/TopologicalSort$SortAlgorithm<TE;>;
Exception table:
from to target type
2 4 6 any
Signature: <E:Ljava/lang/Object;>(Ljava/util/Collection<TE;>;Ledu/umd/cs/findbugs/util/TopologicalSort$OutEdges<TE;>;)Ljava/util/List<TE;>;
MethodParameters:
Name Flags
elements
outEdges
public static <E> void countBadEdges(java.util.List<E>, edu.umd.cs.findbugs.util.TopologicalSort$OutEdges<E>);
descriptor: (Ljava/util/List;Ledu/umd/cs/findbugs/util/TopologicalSort$OutEdges;)V
flags: (0x0009) ACC_PUBLIC, ACC_STATIC
Code:
stack=4, locals=10, args_size=2
start local 0 start local 1 0: getstatic edu.umd.cs.findbugs.util.TopologicalSort.DEBUG:Z
ifne 2
1: return
2: StackMap locals:
StackMap stack:
new java.util.HashSet
dup
invokespecial java.util.HashSet.<init>:()V
astore 2
start local 2 3: new java.util.HashSet
dup
aload 0
invokespecial java.util.HashSet.<init>:(Ljava/util/Collection;)V
astore 3
start local 3 4: iconst_0
istore 4
start local 4 5: iconst_0
istore 5
start local 5 6: aload 0
invokeinterface java.util.List.iterator:()Ljava/util/Iterator;
astore 7
goto 16
StackMap locals: java.util.List edu.umd.cs.findbugs.util.TopologicalSort$OutEdges java.util.HashSet java.util.HashSet int int top java.util.Iterator
StackMap stack:
7: aload 7
invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
checkcast java.lang.Object
astore 6
start local 6 8: aload 1
aload 6
invokeinterface edu.umd.cs.findbugs.util.TopologicalSort$OutEdges.getOutEdges:(Ljava/lang/Object;)Ljava/util/Collection;
invokeinterface java.util.Collection.iterator:()Ljava/util/Iterator;
astore 9
goto 14
StackMap locals: java.util.List edu.umd.cs.findbugs.util.TopologicalSort$OutEdges java.util.HashSet java.util.HashSet int int java.lang.Object java.util.Iterator top java.util.Iterator
StackMap stack:
9: aload 9
invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
checkcast java.lang.Object
astore 8
start local 8 10: aload 6
aload 8
if_acmpeq 14
aload 3
aload 8
invokevirtual java.util.HashSet.contains:(Ljava/lang/Object;)Z
ifeq 14
aload 1
aload 8
invokeinterface edu.umd.cs.findbugs.util.TopologicalSort$OutEdges.getOutEdges:(Ljava/lang/Object;)Ljava/util/Collection;
aload 6
invokeinterface java.util.Collection.contains:(Ljava/lang/Object;)Z
ifne 14
11: iinc 5 1
12: aload 2
aload 8
invokevirtual java.util.HashSet.contains:(Ljava/lang/Object;)Z
ifne 14
13: iinc 4 1
end local 8 14: StackMap locals:
StackMap stack:
aload 9
invokeinterface java.util.Iterator.hasNext:()Z
ifne 9
15: aload 2
aload 6
invokevirtual java.util.HashSet.add:(Ljava/lang/Object;)Z
pop
end local 6 16: StackMap locals: java.util.List edu.umd.cs.findbugs.util.TopologicalSort$OutEdges java.util.HashSet java.util.HashSet int int top java.util.Iterator
StackMap stack:
aload 7
invokeinterface java.util.Iterator.hasNext:()Z
ifne 7
17: getstatic java.lang.System.out:Ljava/io/PrintStream;
new java.lang.StringBuilder
dup
ldc " bad edges are "
invokespecial java.lang.StringBuilder.<init>:(Ljava/lang/String;)V
iload 4
invokevirtual java.lang.StringBuilder.append:(I)Ljava/lang/StringBuilder;
ldc "/"
invokevirtual java.lang.StringBuilder.append:(Ljava/lang/String;)Ljava/lang/StringBuilder;
iload 5
invokevirtual java.lang.StringBuilder.append:(I)Ljava/lang/StringBuilder;
invokevirtual java.lang.StringBuilder.toString:()Ljava/lang/String;
invokevirtual java.io.PrintStream.println:(Ljava/lang/String;)V
18: return
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 19 0 elements Ljava/util/List<TE;>;
0 19 1 outEdges Ledu/umd/cs/findbugs/util/TopologicalSort$OutEdges<TE;>;
3 19 2 seen Ljava/util/HashSet<TE;>;
4 19 3 all Ljava/util/HashSet<TE;>;
5 19 4 result I
6 19 5 total I
8 16 6 e TE;
10 14 8 e2 TE;
Signature: <E:Ljava/lang/Object;>(Ljava/util/List<TE;>;Ledu/umd/cs/findbugs/util/TopologicalSort$OutEdges<TE;>;)V
MethodParameters:
Name Flags
elements
outEdges
}
SourceFile: "TopologicalSort.java"
NestMembers:
edu.umd.cs.findbugs.util.TopologicalSort$OutEdges edu.umd.cs.findbugs.util.TopologicalSort$OutEdges2 edu.umd.cs.findbugs.util.TopologicalSort$OutEdgesCache edu.umd.cs.findbugs.util.TopologicalSort$SortAlgorithm edu.umd.cs.findbugs.util.TopologicalSort$Worker edu.umd.cs.findbugs.util.TopologicalSort$Worker2
InnerClasses:
public abstract OutEdges = edu.umd.cs.findbugs.util.TopologicalSort$OutEdges of edu.umd.cs.findbugs.util.TopologicalSort
public abstract OutEdges2 = edu.umd.cs.findbugs.util.TopologicalSort$OutEdges2 of edu.umd.cs.findbugs.util.TopologicalSort
public OutEdgesCache = edu.umd.cs.findbugs.util.TopologicalSort$OutEdgesCache of edu.umd.cs.findbugs.util.TopologicalSort
abstract SortAlgorithm = edu.umd.cs.findbugs.util.TopologicalSort$SortAlgorithm of edu.umd.cs.findbugs.util.TopologicalSort
Worker = edu.umd.cs.findbugs.util.TopologicalSort$Worker of edu.umd.cs.findbugs.util.TopologicalSort
Worker2 = edu.umd.cs.findbugs.util.TopologicalSort$Worker2 of edu.umd.cs.findbugs.util.TopologicalSort