Searched refs:SchedWrites (Results 1 – 8 of 8) sorted by relevance
234 std::vector<CodeGenSchedRW> SchedWrites; variable310 assert(Idx < SchedWrites.size() && "bad SchedWrite index"); in getSchedWrite()311 assert(SchedWrites[Idx].isValid() && "invalid SchedWrite"); in getSchedWrite()312 return SchedWrites[Idx]; in getSchedWrite()
209 SchedWrites.resize(1); in collectSchedRW()284 SchedWrites.push_back(CodeGenSchedRW(SchedWrites.size(), *SWI)); in collectSchedRW()292 for (std::vector<CodeGenSchedRW>::iterator WI = SchedWrites.begin(), in collectSchedRW()293 WE = SchedWrites.end(); WI != WE; ++WI) { in collectSchedRW()310 for (unsigned WIdx = 0, WEnd = SchedWrites.size(); WIdx != WEnd; ++WIdx) { in collectSchedRW()312 SchedWrites[WIdx].dump(); in collectSchedRW()345 const std::vector<CodeGenSchedRW> &RWVec = IsRead ? SchedReads : SchedWrites; in getSchedRWIdx()465 std::vector<CodeGenSchedRW> &RWVec = IsRead ? SchedReads : SchedWrites; in findRWForSequence()487 unsigned RWIdx = IsRead ? SchedReads.size() : SchedWrites.size(); in findOrInsertRW()492 SchedWrites.push_back(SchedRW); in findOrInsertRW()[all …]
215 // SchedWrites with additive latency. This allows a single operand to217 // SchedWrites.253 // be used instead to define subtarget specific SchedWrites and map255 // itinerary classes to the subtarget's SchedWrites.308 // A ReadAdvance may be associated with a list of SchedWrites
54 // Many SchedWrites are defined in pairs with and without a folded load.
67 // Many SchedWrites are defined in pairs with and without a folded load.
72 // Many SchedWrites are defined in pairs with and without a folded load.
32 // Multiclass that produces a linked pair of SchedWrites.
77 // Many SchedWrites are defined in pairs with and without a folded load.