209         for (int i = 0; i < fStack.size(); ++i) {  in print()
210            SkDebugf("%c/%c ", fStack[i].fNode->id(), fStack[i].fDest->id());  in print()
218         REPORTER_ASSERT(fReporter, fStack.empty());  in validate()
227         for (int i = 0; i < fStack.size(); ++i) {  in validate()
228             SkASSERT(fStack[i].fNode->visited());  in validate()
247         fStack.push_back({ sk_ref_sp(node), fNodes[upperBound].get() });  in dfs()
262         for (int i = 0; i < fStack.size(); ++i) {  in stackContains()
263             if (node == fStack[i].fNode.get()) {  in stackContains()
277         while (!fStack.empty()) {  in shift()
298             while (!fStack.empty() && node.get() == fStack.back().fDest) {  in shift()
305                 this->moveNodeInSort(fStack.back().fNode, index - numRemoved);  in shift()
307                 fStack.pop_back();  in shift()
321     TArray<StackInfo>   fStack;     // only used in addEdges()  member in Graph