Searched refs:SchedWrites (Results 1 – 4 of 4) sorted by relevance
234 std::vector<CodeGenSchedRW> SchedWrites; variable285 assert(Idx < SchedWrites.size() && "bad SchedWrite index"); in getSchedWrite()286 assert(SchedWrites[Idx].isValid() && "invalid SchedWrite"); in getSchedWrite()287 return SchedWrites[Idx]; in getSchedWrite()
210 SchedWrites.resize(1); in collectSchedRW()286 SchedWrites.push_back(CodeGenSchedRW(SchedWrites.size(), *SWI)); in collectSchedRW()294 for (std::vector<CodeGenSchedRW>::iterator WI = SchedWrites.begin(), in collectSchedRW()295 WE = SchedWrites.end(); WI != WE; ++WI) { in collectSchedRW()312 for (unsigned WIdx = 0, WEnd = SchedWrites.size(); WIdx != WEnd; ++WIdx) { in collectSchedRW()314 SchedWrites[WIdx].dump(); in collectSchedRW()347 const std::vector<CodeGenSchedRW> &RWVec = IsRead ? SchedReads : SchedWrites; in getSchedRWIdx()467 std::vector<CodeGenSchedRW> &RWVec = IsRead ? SchedReads : SchedWrites; in findRWForSequence()489 unsigned RWIdx = IsRead ? SchedReads.size() : SchedWrites.size(); in findOrInsertRW()494 SchedWrites.push_back(SchedRW); in findOrInsertRW()[all …]
167 // SchedWrites with additive latency. This allows a single operand to169 // SchedWrites.205 // be used instead to define subtarget specific SchedWrites and map207 // itinerary classes to the subtarget's SchedWrites.260 // A ReadAdvance may be associated with a list of SchedWrites
32 // Multiclass that produces a linked pair of SchedWrites.