Searched refs:numChildProcessors (Results 1 – 20 of 20) sorted by relevance
38 if (this->numChildProcessors() != that.numChildProcessors()) { in isEqual()41 for (int i = 0; i < this->numChildProcessors(); ++i) { in isEqual()83 for (int i = 0; i < this->numChildProcessors(); ++i) { in instantiate()98 for (int i = 0; i < this->numChildProcessors(); ++i) { in markPendingExecution()385 SkSTArray<4, std::unique_ptr<GrFragmentProcessor>> children(this->numChildProcessors()); in RunInSeries()386 for (int i = 0; i < this->numChildProcessors(); ++i) { in RunInSeries()391 return Make(children.begin(), this->numChildProcessors()); in RunInSeries()403 for (int i = 1; i < this->numChildProcessors() - 1; ++i) { in RunInSeries()409 this->emitChild(this->numChildProcessors() - 1, input.c_str(), args); in RunInSeries()436 int childCnt = this->numChildProcessors(); in RunInSeries()[all …]
19 } while (fp->numChildProcessors() != 0); in MakeChildFP()
67 if (this->numChildProcessors()) { in emitCode()107 this->numChildProcessors() ? this->childProcessor(0).clone() : nullptr; in clone()
89 if (fp->numChildProcessors()) { in dump_fragment_processor_tree()90 for (int i = 0; i < fp->numChildProcessors(); ++i) { in dump_fragment_processor_tree()
183 for (int i = 0; i < fp.numChildProcessors(); ++i) { in gen_frag_proc_and_meta_keys()
120 int numChildProcessors() const { return fChildProcessors.count(); } in numChildProcessors() function
30 if (this->numChildProcessors() != that.numChildProcessors()) { in isEqual()33 for (int i = 0; i < this->numChildProcessors(); ++i) { in isEqual()82 for (int index = 0; index < fp.numChildProcessors(); ++index) { in recursive_dump_tree_info()196 for (int i = 0; i < src.numChildProcessors(); ++i) { in cloneAndRegisterAllChildProcessors()514 for (int i = back->numChildProcessors() - 1; i >= 0; --i) { in operator ++()
126 b->add32(fp.numChildProcessors(), "fpNumChildren"); in gen_fp_key()128 for (int i = 0; i < fp.numChildProcessors(); ++i) { in gen_fp_key()
136 int numChildProcessors() const { return fChildProcessors.count(); } in numChildProcessors() function
32 for (int i = 0; i < this->numChildProcessors(); ++i) { in emitCode()223 int childIndex = this->numChildProcessors(); in addChild()256 for (int i = 0; i < this->numChildProcessors(); ++i) { in constantOutputForConstantInput()
230 int numPlanes = yuvEffect.numChildProcessors(); in onMakeProgramImpl()
114 for (int i = 0; i < that.numChildProcessors(); ++i) { in TestFP()479 for (int j = 0; j < fp->numChildProcessors(); ++j) { in DEF_GPUTEST_FOR_GL_RENDERING_CONTEXTS()506 for (int c = 0; c < fp->numChildProcessors(); ++c) { in DEF_GPUTEST_FOR_GL_RENDERING_CONTEXTS()511 children.append(c == fp->numChildProcessors() - 1 ? ")" : ", "); in DEF_GPUTEST_FOR_GL_RENDERING_CONTEXTS()717 REPORTER_ASSERT(reporter, fp->numChildProcessors() == clone->numChildProcessors()); in DEF_GPUTEST_FOR_GL_RENDERING_CONTEXTS()
193 if (0 == fp->numChildProcessors()) { in create_random_proc_tree()
81 for (int i = back->numChildProcessors() - 1; i >= 0; --i) { in next()
133 int numChildProcessors() const { return fChildProcessors.count(); } in numChildProcessors() function
124 int numChildProcessors() const { return fChildProcessors.count(); } in numChildProcessors() function
173 for (int i = back->numChildProcessors() - 1; i >= 0; --i) { in operator ++()
47 for (int i = 0; i < this->numChildProcessors(); ++i) { in dumpInfo()288 for (int i = 0; i < this->numChildProcessors(); ++i) { in dumpInfo()
131 for (int i = 0; i < this->numChildProcessors(); ++i) { in emitCode()358 for (int i = 0; i < this->numChildProcessors(); ++i) { in clone()
818 REPORTER_ASSERT(reporter, fp.numChildProcessors() == clone.numChildProcessors(), in assert_processor_equality()