Home
last modified time | relevance | path

Searched refs:topologicalSort (Results 1 – 17 of 17) sorted by relevance

/external/testng/src/test/java/test/
DGraphTest.java36 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/
DMethodHelper.java191 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()
DGraph.java100 public void topologicalSort() { in topologicalSort() method in Graph
/external/llvm-project/clang/lib/Analysis/
DThreadSafetyTIL.cpp165 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/
DThreadSafetyTIL.cpp168 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/
DSliceAnalysis.h202 topologicalSort(const llvm::SetVector<Operation *> &toSort);
/external/llvm-project/mlir/lib/Analysis/
DSliceAnalysis.cpp158 return topologicalSort(slice); in getSlice()
192 mlir::topologicalSort(const SetVector<Operation *> &toSort) { in topologicalSort() function in mlir
/external/llvm/lib/Target/AMDGPU/
DSIMachineScheduler.h300 void topologicalSort();
474 void topologicalSort();
DSIMachineScheduler.cpp610 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/
DSIMachineScheduler.h308 void topologicalSort();
485 void topologicalSort();
DSIMachineScheduler.cpp633 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/
DSIMachineScheduler.h308 void topologicalSort();
491 void topologicalSort();
DSIMachineScheduler.cpp631 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/
DModuleTranslation.cpp368 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/
DSuperVectorize.cpp1114 worklist = topologicalSort(worklist); in vectorizeNonTerminals()
/external/llvm-project/clang/include/clang/Analysis/Analyses/
DThreadSafetyTIL.h1649 unsigned topologicalSort(SimpleArray<BasicBlock *> &Blocks, unsigned ID);
/external/clang/include/clang/Analysis/Analyses/
DThreadSafetyTIL.h1661 int topologicalSort(SimpleArray<BasicBlock*>& Blocks, int ID);