Lines Matching refs:mOutputs
65 for (size_t ct=0; ct < n->mOutputs.size(); ct++) { in calcOrderRecurse()
66 const Link *l = n->mOutputs[ct]; in calcOrderRecurse()
123 n->mOutputs.add(l); in calcOrder()
156 for (size_t ct2=0; ct2 < n->mOutputs.size(); ct2++) { in calcOrder()
157 if (n->mOutputs[ct2]->mSource.get() == k) { in calcOrder()
164 mOutputs.add(new IO(k)); in calcOrder()
230 for (size_t ct2=0; ct2 < n->mOutputs.size(); ct2++) { in create()
231 Link *l = n->mOutputs[ct2]; in create()
241 for (size_t ct3=ct2+1; ct3 < n->mOutputs.size(); ct3++) { in create()
242 if (n->mOutputs[ct3]->mSource.get() == l->mSource.get()) { in create()
243 n->mOutputs[ct3]->mAlloc = alloc; in create()
271 for (size_t ct=0; ct < mOutputs.size(); ct++) { in setOutput()
272 if (mOutputs[ct]->mKernel == kid) { in setOutput()
273 mOutputs[ct]->mAlloc = a; in setOutput()
313 for (size_t ct3=0; ct3 < n->mOutputs.size(); ct3++) { in execute()
314 if (n->mOutputs[ct3]->mSource.get() == k) { in execute()
315 aout = n->mOutputs[ct3]->mAlloc.get(); in execute()
319 for (size_t ct3=0; ct3 < mOutputs.size(); ct3++) { in execute()
320 if (mOutputs[ct3]->mKernel == k) { in execute()
321 aout = mOutputs[ct3]->mAlloc.get(); in execute()