• Home
  • Raw
  • Download

Lines Matching refs:graph

16 void GrTTopoSort_CheckAllUnmarked(const SkTArray<sk_sp<T>>& graph) {  in GrTTopoSort_CheckAllUnmarked()  argument
17 for (int i = 0; i < graph.count(); ++i) { in GrTTopoSort_CheckAllUnmarked()
18 SkASSERT(!Traits::IsTempMarked(graph[i].get())); in GrTTopoSort_CheckAllUnmarked()
19 SkASSERT(!Traits::WasOutput(graph[i].get())); in GrTTopoSort_CheckAllUnmarked()
24 void GrTTopoSort_CleanExit(const SkTArray<sk_sp<T>>& graph) { in GrTTopoSort_CleanExit() argument
25 for (int i = 0; i < graph.count(); ++i) { in GrTTopoSort_CleanExit()
26 SkASSERT(!Traits::IsTempMarked(graph[i].get())); in GrTTopoSort_CleanExit()
27 SkASSERT(Traits::WasOutput(graph[i].get())); in GrTTopoSort_CleanExit()
28 SkASSERT(Traits::GetIndex(graph[i].get()) == (uint32_t) i); in GrTTopoSort_CleanExit()
85 bool GrTTopoSort(SkTArray<sk_sp<T>>* graph) { in GrTTopoSort() argument
89 GrTTopoSort_CheckAllUnmarked<T, Traits>(*graph); in GrTTopoSort()
94 for (int i = 0; i < graph->count(); ++i) { in GrTTopoSort()
95 if (Traits::WasOutput((*graph)[i].get())) { in GrTTopoSort()
102 if (!GrTTopoSort_Visit<T, Traits>((*graph)[i].get(), &counter)) { in GrTTopoSort()
107 SkASSERT(counter == (uint32_t) graph->count()); in GrTTopoSort()
110 for (uint32_t i = 0; i < (uint32_t) graph->count(); ++i) { in GrTTopoSort()
111 for (uint32_t correctIndex = Traits::GetIndex((*graph)[i].get()); in GrTTopoSort()
113 correctIndex = Traits::GetIndex((*graph)[i].get())) { in GrTTopoSort()
114 (*graph)[i].swap((*graph)[correctIndex]); in GrTTopoSort()
119 GrTTopoSort_CleanExit<T, Traits>(*graph); in GrTTopoSort()