Home
last modified time | relevance | path

Searched refs:SchedClasses (Results 1 – 2 of 2) sorted by relevance

/external/llvm/utils/TableGen/
DCodeGenSchedule.h245 std::vector<CodeGenSchedClass> SchedClasses; variable
264 class_iterator classes_begin() { return SchedClasses.begin(); } in classes_begin()
265 const_class_iterator classes_begin() const { return SchedClasses.begin(); } in classes_begin()
266 class_iterator classes_end() { return SchedClasses.end(); } in classes_end()
267 const_class_iterator classes_end() const { return SchedClasses.end(); } in classes_end()
350 assert(Idx < SchedClasses.size() && "bad SchedClass index"); in getSchedClass()
351 return SchedClasses[Idx]; in getSchedClass()
354 assert(Idx < SchedClasses.size() && "bad SchedClass index"); in getSchedClass()
355 return SchedClasses[Idx]; in getSchedClass()
364 SchedClassIter schedClassBegin() const { return SchedClasses.begin(); } in schedClassBegin()
[all …]
DCodeGenSchedule.cpp499 SchedClasses.resize(1); in collectSchedClasses()
500 SchedClasses.back().Index = 0; in collectSchedClasses()
501 SchedClasses.back().Name = "NoInstrModel"; in collectSchedClasses()
502 SchedClasses.back().ItinClassDef = Records.getDef("NoItinerary"); in collectSchedClasses()
503 SchedClasses.back().ProcIndices.push_back(0); in collectSchedClasses()
525 NumInstrSchedClasses = SchedClasses.size(); in collectSchedClasses()
560 const RecVec &RWDefs = SchedClasses[SCIdx].InstRWs; in collectSchedClasses()
648 if (Idx || SchedClasses[0].isKeyEqual(ItinClassDef, OperWrites, OperReads)) { in addSchedClass()
650 std::set_union(SchedClasses[Idx].ProcIndices.begin(), in addSchedClass()
651 SchedClasses[Idx].ProcIndices.end(), in addSchedClass()
[all …]