207         for (int i = 0; i < fStack.size(); ++i) {  in print()
208            SkDebugf("%c/%c ", fStack[i].fNode->id(), fStack[i].fDest->id());  in print()
216         REPORTER_ASSERT(fReporter, fStack.empty());  in validate()
225         for (int i = 0; i < fStack.size(); ++i) {  in validate()
226             SkASSERT(fStack[i].fNode->visited());  in validate()
245         fStack.push_back({ sk_ref_sp(node), fNodes[upperBound].get() });  in dfs()
260         for (int i = 0; i < fStack.size(); ++i) {  in stackContains()
261             if (node == fStack[i].fNode.get()) {  in stackContains()
275         while (!fStack.empty()) {  in shift()
296             while (!fStack.empty() && node.get() == fStack.back().fDest) {  in shift()
303                 this->moveNodeInSort(fStack.back().fNode, index - numRemoved);  in shift()
305                 fStack.pop_back();  in shift()
319     SkTArray<StackInfo>   fStack;     // only used in addEdges()  member in Graph