Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenSchedule.cpp833 assert(SchedClasses.empty() && "Expected empty sched class"); in collectSchedClasses()
834 SchedClasses.emplace_back(0, "NoInstrModel", Records.getDef("NoItinerary")); in collectSchedClasses()
835 SchedClasses.back().ProcIndices.push_back(0); in collectSchedClasses()
854 NumInstrSchedClasses = SchedClasses.size(); in collectSchedClasses()
897 for (const Record *RWDef : SchedClasses[SCIdx].InstRWs) { in collectSchedClasses()
976 auto I = find_if(SchedClasses, IsKeyEqual); in addSchedClass()
978 I == SchedClasses.end() ? 0 : std::distance(SchedClasses.begin(), I); in addSchedClass()
979 if (Idx || SchedClasses[0].isKeyEqual(ItinClassDef, OperWrites, OperReads)) { in addSchedClass()
981 std::set_union(SchedClasses[Idx].ProcIndices.begin(), in addSchedClass()
982 SchedClasses[Idx].ProcIndices.end(), ProcIndices.begin(), in addSchedClass()
[all …]
H A DCodeGenSchedule.h451 std::vector<CodeGenSchedClass> SchedClasses; variable
533 assert(Idx < SchedClasses.size() && "bad SchedClass index"); in getSchedClass()
534 return SchedClasses[Idx]; in getSchedClass()
537 assert(Idx < SchedClasses.size() && "bad SchedClass index"); in getSchedClass()
538 return SchedClasses[Idx]; in getSchedClass()
546 ArrayRef<CodeGenSchedClass> schedClasses() const { return SchedClasses; } in schedClasses()