Searched refs:SortedEdges (Results 1 - 2 of 2) sorted by relevance

/freebsd-current/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h329 std::multiset<const EdgeType *, EdgeComparer> SortedEdges; local
333 SortedEdges.insert(&Edge);
340 for (auto *Edge : SortedEdges) {
354 // Walk through SortedEdges to initialize the queue, instead of using NodeInfoMap
356 for (auto *Edge : SortedEdges) {
/freebsd-current/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DJITLink.cpp304 std::vector<Edge> SortedEdges; local
305 llvm::copy(B->edges(), std::back_inserter(SortedEdges));
306 llvm::sort(SortedEdges, [](const Edge &LHS, const Edge &RHS) {
309 for (auto &E : SortedEdges) {

Completed in 163 milliseconds