Lines Matching full:chain
39 static void sortChain(const SIInstrInfo *TII, SmallVector<SUnit *, 8> &Chain, in sortChain() argument
41 if (!PosCount || PosCount == Chain.size()) in sortChain()
48 SmallVector<SUnit *, 8> Copy(Chain); in sortChain()
53 Chain[PosIdx++] = SU; in sortChain()
55 Chain[OtherIdx++] = SU; in sortChain()
62 // Now construct cluster from chain by adding new edges. in buildCluster()
67 // Copy all dependencies to the head of the chain to avoid any in buildCluster()
68 // computation being inserted into the chain. in buildCluster()
111 SmallVector<SUnit *, 8> Chain; in apply() local
122 Chain.push_back(&SU); in apply()
134 if (Chain.size() > 1) { in apply()
135 sortChain(TII, Chain, PosCount); in apply()
136 buildCluster(Chain, DAG); in apply()