/external/testng/src/test/java/test/ |
D | GraphTest.java | 36 g.topologicalSort(); in sort() 55 g.topologicalSort(); in cycleShouldFail() 63 g.topologicalSort(); in cycleShouldBeCorrect() 104 g.topologicalSort(); in findPredecessors()
|
/external/testng/src/main/java/org/testng/internal/ |
D | MethodHelper.java | 191 private static Graph<ITestNGMethod> topologicalSort(ITestNGMethod[] methods, in topologicalSort() method in MethodHelper 231 result.topologicalSort(); in topologicalSort() 287 topologicalSort(allMethodsArray, sl, pl); in sortMethods() 303 g = topologicalSort(methods, sequentialList, parallelList); in getMethodsDependedUpon()
|
D | Graph.java | 100 public void topologicalSort() { in topologicalSort() method in Graph
|
/external/llvm-project/clang/lib/Analysis/ |
D | ThreadSafetyTIL.cpp | 165 unsigned BasicBlock::topologicalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalSort() function in BasicBlock 170 ID = Block->topologicalSort(Blocks, ID); in topologicalSort() 292 unsigned NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size()); in computeNormalForm()
|
/external/clang/lib/Analysis/ |
D | ThreadSafetyTIL.cpp | 168 int BasicBlock::topologicalSort(SimpleArray<BasicBlock*>& Blocks, int ID) { in topologicalSort() function in BasicBlock 172 ID = Block->topologicalSort(Blocks, ID); in topologicalSort() 296 int NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size()); in computeNormalForm()
|
/external/llvm-project/mlir/include/mlir/Analysis/ |
D | SliceAnalysis.h | 202 topologicalSort(const llvm::SetVector<Operation *> &toSort);
|
/external/llvm-project/mlir/lib/Analysis/ |
D | SliceAnalysis.cpp | 158 return topologicalSort(slice); in getSlice() 192 mlir::topologicalSort(const SetVector<Operation *> &toSort) { in topologicalSort() function in mlir
|
/external/llvm/lib/Target/AMDGPU/ |
D | SIMachineScheduler.h | 300 void topologicalSort(); 474 void topologicalSort();
|
D | SIMachineScheduler.cpp | 610 topologicalSort(); in getBlocks() 1128 void SIScheduleBlockCreator::topologicalSort() { in topologicalSort() function in SIScheduleBlockCreator 1672 void SIScheduleDAGMI::topologicalSort() { in topologicalSort() function in SIScheduleDAGMI 1793 topologicalSort(); in schedule()
|
/external/llvm-project/llvm/lib/Target/AMDGPU/ |
D | SIMachineScheduler.h | 308 void topologicalSort(); 485 void topologicalSort();
|
D | SIMachineScheduler.cpp | 633 topologicalSort(); in getBlocks() 1279 void SIScheduleBlockCreator::topologicalSort() { in topologicalSort() function in SIScheduleBlockCreator 1808 void SIScheduleDAGMI::topologicalSort() { in topologicalSort() function in SIScheduleDAGMI 1928 topologicalSort(); in schedule()
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
D | SIMachineScheduler.h | 308 void topologicalSort(); 491 void topologicalSort();
|
D | SIMachineScheduler.cpp | 631 topologicalSort(); in getBlocks() 1277 void SIScheduleBlockCreator::topologicalSort() { in topologicalSort() function in SIScheduleBlockCreator 1809 void SIScheduleDAGMI::topologicalSort() { in topologicalSort() function in SIScheduleDAGMI 1929 topologicalSort(); in schedule()
|
/external/llvm-project/mlir/lib/Target/LLVMIR/ |
D | ModuleTranslation.cpp | 368 static llvm::SetVector<Block *> topologicalSort(T &f) { in topologicalSort() function 459 llvm::SetVector<Block *> blocks = topologicalSort(region); in convertOmpOpRegions() 958 auto blocks = topologicalSort(func); in convertOneFunction()
|
/external/llvm-project/mlir/lib/Dialect/Affine/Transforms/ |
D | SuperVectorize.cpp | 1114 worklist = topologicalSort(worklist); in vectorizeNonTerminals()
|
/external/llvm-project/clang/include/clang/Analysis/Analyses/ |
D | ThreadSafetyTIL.h | 1649 unsigned topologicalSort(SimpleArray<BasicBlock *> &Blocks, unsigned ID);
|
/external/clang/include/clang/Analysis/Analyses/ |
D | ThreadSafetyTIL.h | 1661 int topologicalSort(SimpleArray<BasicBlock*>& Blocks, int ID);
|