Lines Matching defs:fStack
201 for (int i = 0; i < fStack.count(); ++i) {
202 SkDebugf("%c/%c ", fStack[i].fNode->id(), fStack[i].fDest->id());
210 REPORTER_ASSERT(fReporter, fStack.empty());
219 for (int i = 0; i < fStack.count(); ++i) {
220 SkASSERT(fStack[i].fNode->visited());
225 // to be in violation of the topological constraints are placed in 'fStack'.
239 fStack.push_back({ sk_ref_sp(node), fNodes[upperBound].get() });
251 // Does 'fStack' have 'node'? That is, was 'node' discovered to be in violation of the
254 for (int i = 0; i < fStack.count(); ++i) {
255 if (node == fStack[i].fNode.get()) {
264 // were found to be in violation of the topological order (i.e., in 'fStack') to their correct
269 while (!fStack.empty()) {
273 // This node is in 'fStack' and was found to be in violation of the topological
290 while (!fStack.empty() && node.get() == fStack.back().fDest) {
292 // of the nodes in 'fStack'. Place them to the right of 'node' in the sort. Note
297 this->moveNodeInSort(fStack.back().fNode, index - numRemoved);
299 fStack.pop_back();
313 SkTArray<StackInfo> fStack; // only used in addEdges()