Home
last modified time | relevance | path

Searched refs:NewInterval (Results 1 – 3 of 3) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/
H A DDependencyGraph.cpp242 const Interval<Instruction> &NewInterval) { in setDefUseUnscheduledSuccs() argument
250 for (Instruction &I : NewInterval) { in setDefUseUnscheduledSuccs()
258 if (!NewInterval.contains(OpI)) in setDefUseUnscheduledSuccs()
268 bool NewIsAbove = DAGInterval.empty() || NewInterval.comesBefore(DAGInterval); in setDefUseUnscheduledSuccs()
269 const auto &TopInterval = NewIsAbove ? NewInterval : DAGInterval; in setDefUseUnscheduledSuccs()
270 const auto &BotInterval = NewIsAbove ? DAGInterval : NewInterval; in setDefUseUnscheduledSuccs()
300 void DependencyGraph::createNewNodes(const Interval<Instruction> &NewInterval) { in createNewNodes() argument
302 DGNode *LastN = getOrCreateNode(NewInterval.top()); in createNewNodes()
304 for (Instruction &I : drop_begin(NewInterval)) { in createNewNodes()
314 bool NewIsAbove = NewInterval.comesBefore(DAGInterval); in createNewNodes()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/
H A DDependencyGraph.h372 void setDefUseUnscheduledSuccs(const Interval<Instruction> &NewInterval);
376 void createNewNodes(const Interval<Instruction> &NewInterval);
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineScheduler.cpp4926 ResourceSegments::IntervalTy NewInterval = in getFirstAvailableAt() local
4929 if (!intersects(NewInterval, Interval)) in getFirstAvailableAt()
4934 assert(Interval.second > NewInterval.first && in getFirstAvailableAt()
4936 RetCycle += (unsigned)Interval.second - (unsigned)NewInterval.first; in getFirstAvailableAt()
4937 NewInterval = IntervalBuilder(RetCycle, AcquireAtCycle, ReleaseAtCycle); in getFirstAvailableAt()