Lines Matching refs:mOutputs
45 for (auto output : mOutputs) {
81 for (size_t ct=0; ct < n->mOutputs.size(); ct++) {
82 const Link *l = n->mOutputs[ct];
140 n->mOutputs.add(l);
173 for (size_t ct2=0; ct2 < n->mOutputs.size(); ct2++) {
174 if (n->mOutputs[ct2]->mSource.get() == k) {
181 mOutputs.add(new IO(k));
247 for (size_t ct2=0; ct2 < n->mOutputs.size(); ct2++) {
248 Link *l = n->mOutputs[ct2];
258 for (size_t ct3=ct2+1; ct3 < n->mOutputs.size(); ct3++) {
259 if (n->mOutputs[ct3]->mSource.get() == l->mSource.get()) {
260 n->mOutputs[ct3]->mAlloc = alloc;
288 for (size_t ct=0; ct < mOutputs.size(); ct++) {
289 if (mOutputs[ct]->mKernel == kid) {
290 mOutputs[ct]->mAlloc = a;
309 for(size_t i = 0; i < mOutputs.size(); i++) {
310 if (mOutputs[i]->mAlloc.get() == nullptr) {
331 //ALOGE("node %i, order %i, in %i out %i", (int)ct, n->mOrder, (int)n->mInputs.size(), (int)n->mOutputs.size());
351 for (size_t ct3=0; ct3 < n->mOutputs.size(); ct3++) {
352 if (n->mOutputs[ct3]->mSource.get() == k) {
353 aout = n->mOutputs[ct3]->mAlloc.get();
357 for (size_t ct3=0; ct3 < mOutputs.size(); ct3++) {
358 if (mOutputs[ct3]->mKernel == k) {
359 aout = mOutputs[ct3]->mAlloc.get();
