63         Node *n = mNodes[ct];  in findNode()  local
64         for (size_t ct2=0; ct2 < n->mKernels.size(); ct2++) {  in findNode()
65             if (n->mKernels[ct2]->mScript == s) {  in findNode()
66                 return n;  in findNode()
74 bool ScriptGroup::calcOrderRecurse(Node *n, int depth) {  in calcOrderRecurse()  argument
75     n->mSeen = true;  in calcOrderRecurse()
76     if (n->mOrder < depth) {  in calcOrderRecurse()
77         n->mOrder = depth;  in calcOrderRecurse()
81     for (size_t ct=0; ct < n->mOutputs.size(); ct++) {  in calcOrderRecurse()
82         const Link *l = n->mOutputs[ct];  in calcOrderRecurse()
92         ret &= calcOrderRecurse(nt, n->mOrder + 1);  in calcOrderRecurse()
111         Node *n = findNode(k->mScript);  in calcOrder()  local
113         if (n == NULL) {  in calcOrder()
114             n = new Node(k->mScript);  in calcOrder()
115             mNodes.push_back(n);  in calcOrder()
117         n->mKernels.push_back(k);  in calcOrder()
125         Node *n = findNode(l->mSource->mScript);  in calcOrder()  local
127         n->mOutputs.push_back(l);  in calcOrder()
131             n = findNode(l->mDstKernel->mScript);  in calcOrder()
133             n->mInputs.push_back(l);  in calcOrder()
135             n = findNode(l->mDstField->mScript);  in calcOrder()
137             n->mInputs.push_back(l);  in calcOrder()
145         Node *n = mNodes[ct];  in calcOrder()  local
146         if (n->mInputs.size() == 0) {  in calcOrder()
150             ret &= calcOrderRecurse(n, 0);  in calcOrder()
156         const Node *n = findNode(k->mScript);  in calcOrder()  local
160             for (size_t ct2=0; ct2 < n->mOutputs.size(); ct2++) {  in calcOrder()
161                 if (n->mOutputs[ct2]->mSource.get() == k) {  in calcOrder()
174             for (size_t ct2=0; ct2 < n->mInputs.size(); ct2++) {  in calcOrder()
175                 if (n->mInputs[ct2]->mDstKernel.get() == k) {  in calcOrder()
228         const Node *n = sg->mNodes[ct];  in create()  local
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()
310         Node *n = mNodes[ct];  in execute()  local
313         for (size_t ct2=0; ct2 < n->mKernels.size(); ct2++) {  in execute()
314             const ScriptKernelID *k = n->mKernels[ct2];  in execute()
318             for (size_t ct3=0; ct3 < n->mInputs.size(); ct3++) {  in execute()
319                 if (n->mInputs[ct3]->mDstKernel.get() == k) {  in execute()
320                     ain = n->mInputs[ct3]->mAlloc.get();  in execute()
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()
345                 n->mScript->runForEach(rsc, k->mSlot, NULL, 0, aout, NULL, 0);  in execute()
349                 n->mScript->runForEach(rsc, k->mSlot, ains,  in execute()