201         for (int i = 0; i < fStack.count(); ++i) {  in print()
202            SkDebugf("%c/%c ", fStack[i].fNode->id(), fStack[i].fDest->id());  in print()
210         REPORTER_ASSERT(fReporter, fStack.empty());  in validate()
219         for (int i = 0; i < fStack.count(); ++i) {  in validate()
220             SkASSERT(fStack[i].fNode->visited());  in validate()
239         fStack.push_back({ sk_ref_sp(node), fNodes[upperBound].get() });  in dfs()
254         for (int i = 0; i < fStack.count(); ++i) {  in stackContains()
255             if (node == fStack[i].fNode.get()) {  in stackContains()
269         while (!fStack.empty()) {  in shift()
290             while (!fStack.empty() && node.get() == fStack.back().fDest) {  in shift()
297                 this->moveNodeInSort(fStack.back().fNode, index - numRemoved);  in shift()
299                 fStack.pop_back();  in shift()
313     SkTArray<StackInfo>   fStack;     // only used in addEdges()  member in Graph