45     for (auto output : mOutputs) {  in ~ScriptGroup()
81     for (size_t ct=0; ct < n->mOutputs.size(); ct++) {  in calcOrderRecurse()
82         const Link *l = n->mOutputs[ct];  in calcOrderRecurse()
127         n->mOutputs.push_back(l);  in calcOrder()
160             for (size_t ct2=0; ct2 < n->mOutputs.size(); ct2++) {  in calcOrder()
161                 if (n->mOutputs[ct2]->mSource.get() == k) {  in calcOrder()
168                 mOutputs.push_back(new IO(k));  in calcOrder()
229         for (size_t ct2=0; ct2 < n->mOutputs.size(); ct2++) {  in create()
230             Link *l = n->mOutputs[ct2];  in create()
238             for (size_t ct3=ct2+1; ct3 < n->mOutputs.size(); ct3++) {  in create()
239                 if (n->mOutputs[ct3]->mSource.get() == l->mSource.get()) {  in create()
240                     n->mOutputs[ct3]->mAlloc = alloc;  in create()
268     for (size_t ct=0; ct < mOutputs.size(); ct++) {  in setOutput()
269         if (mOutputs[ct]->mKernel == kid) {  in setOutput()
270             mOutputs[ct]->mAlloc = a;  in setOutput()
289     for(size_t i = 0; i < mOutputs.size(); i++) {  in validateInputAndOutput()
290         if (mOutputs[i]->mAlloc.get() == nullptr) {  in validateInputAndOutput()
331             for (size_t ct3=0; ct3 < n->mOutputs.size(); ct3++) {  in execute()
332                 if (n->mOutputs[ct3]->mSource.get() == k) {  in execute()
333                     aout = n->mOutputs[ct3]->mAlloc.get();  in execute()
337             for (size_t ct3=0; ct3 < mOutputs.size(); ct3++) {  in execute()
338                 if (mOutputs[ct3]->mKernel == k) {  in execute()
339                     aout = mOutputs[ct3]->mAlloc.get();  in execute()