Searched refs:mOutputs (Results 1 – 10 of 10) sorted by relevance
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()[all …]
53 Vector<Link *> mOutputs; variable71 Vector<IO *> mOutputs; variable
46 IO mOutputs[]; field in ScriptGroup81 ArrayList<ConnectLine> mOutputs = new ArrayList<ConnectLine>(); field in ScriptGroup.Node126 for (int ct=0; ct < mOutputs.length; ct++) { in setOutput()127 if (mOutputs[ct].mKID == s) { in setOutput()128 mOutputs[ct].mAllocation = a; in setOutput()188 for (int ct = 0; ct < target.mOutputs.size(); ct++) { in validateCycle()189 final ConnectLine cl = target.mOutputs.get(ct); in validateCycle()222 for (int ct=0; ct < n.mOutputs.size(); ct++) { in validateDAGRecurse()223 final ConnectLine cl = n.mOutputs.get(ct); in validateDAGRecurse()239 if (n.mOutputs.size() == 0 && mNodes.size() > 1) { in validateDAG()[all …]
70 Element mOutputs[]; field in Program203 Element mOutputs[]; field in Program.BaseProgramBuilder218 mOutputs = new Element[MAX_OUTPUT]; in BaseProgramBuilder()356 p.mOutputs = new Element[mOutputCount]; in initProgram()357 System.arraycopy(mOutputs, 0, p.mOutputs, 0, mOutputCount); in initProgram()
78 tmp[idx++] = mOutputs[i].getID(mRS); in create()
139 tmp[idx++] = mOutputs[i].getID(mRS); in create()
65 tmp[idx++] = mOutputs[i].getID(mRS); in create()
92 tmp[idx++] = mOutputs[i].getID(mRS); in create()
47 IO mOutputs[]; field in ScriptGroup82 ArrayList<ConnectLine> mOutputs = new ArrayList<ConnectLine>(); field in ScriptGroup.Node127 for (int ct=0; ct < mOutputs.length; ct++) { in setOutput()128 if (mOutputs[ct].mKID == s) { in setOutput()129 mOutputs[ct].mAllocation = a; in setOutput()194 for (int ct = 0; ct < target.mOutputs.size(); ct++) { in validateCycle()195 final ConnectLine cl = target.mOutputs.get(ct); in validateCycle()228 for (int ct=0; ct < n.mOutputs.size(); ct++) { in validateDAGRecurse()229 final ConnectLine cl = n.mOutputs.get(ct); in validateDAGRecurse()245 if (n.mOutputs.size() == 0 && mNodes.size() > 1) { in validateDAG()[all …]
164 for (size_t ct3=0; ct3 < n->mOutputs.size(); ct3++) { in execute()165 if (n->mOutputs[ct3]->mSource.get() == k) { in execute()166 aout = n->mOutputs[ct3]->mAlloc.get(); in execute()167 if(n->mOutputs[ct3]->mDstField.get() != NULL) { in execute()173 for (size_t ct3=0; ct3 < mSG->mOutputs.size(); ct3++) { in execute()174 if (mSG->mOutputs[ct3]->mKernel == k) { in execute()175 aout = mSG->mOutputs[ct3]->mAlloc.get(); in execute()