Searched refs:numChildProcessors (Results 1 – 10 of 10) sorted by relevance
38 if (this->numChildProcessors() != that.numChildProcessors()) { in isEqual()41 for (int i = 0; i < this->numChildProcessors(); ++i) { in isEqual()69 for (int i = 0; i < this->numChildProcessors(); ++i) { in instantiate()458 for (int i = 1; i < this->numChildProcessors() - 1; ++i) { in RunInSeries()464 this->emitChild(this->numChildProcessors() - 1, input.c_str(), args); in RunInSeries()491 int childCnt = this->numChildProcessors(); in RunInSeries()544 for (int i = back->numChildProcessors() - 1; i >= 0; --i) { in next()
19 } while (fp->numChildProcessors() != 0); in MakeChildFP()
76 if (fp->numChildProcessors()) { in dump_fragment_processor_tree()77 for (int i = 0; i < fp->numChildProcessors(); ++i) { in dump_fragment_processor_tree()
108 int numChildProcessors() const { return fChildProcessors.count(); } in numChildProcessors() function
154 for (int i = 0; i < fp.numChildProcessors(); ++i) { in gen_frag_proc_and_meta_keys()
17 SkASSERT(fChildProcessors.count() == processor.numChildProcessors()); in setData()77 for (int i = back->numChildProcessors() - 1; i >= 0; --i) { in next()
148 int numChildProcessors() const { return fChildProcessors.count(); } in numChildProcessors() function
360 for (int j = 0; j < fp->numChildProcessors(); ++j) { in DEF_GPUTEST_FOR_GL_RENDERING_CONTEXTS()383 for (int c = 0; c < fp->numChildProcessors(); ++c) { in DEF_GPUTEST_FOR_GL_RENDERING_CONTEXTS()388 children.append(c == fp->numChildProcessors() - 1 ? ")" : ", "); in DEF_GPUTEST_FOR_GL_RENDERING_CONTEXTS()
182 if (0 == fp->numChildProcessors()) { in create_random_proc_tree()
46 for (int i = 0; i < this->numChildProcessors(); ++i) { in dumpInfo()277 for (int i = 0; i < this->numChildProcessors(); ++i) { in dumpInfo()