Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/
H A DDependencyGraph.cpp268 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()
313 if (!DAGInterval.empty()) { in createNewNodes()
314 bool NewIsAbove = NewInterval.comesBefore(DAGInterval); in createNewNodes()
315 const auto &TopInterval = NewIsAbove ? NewInterval : DAGInterval; in createNewNodes()
316 const auto &BotInterval = NewIsAbove ? DAGInterval : NewInterval; in createNewNodes()
330 auto UnionIntvl = DAGInterval.getUnionInterval(NewInterval); in createNewNodes()
383 if (!(DAGInterval.contains(I) || DAGInterval.touches(I))) in notifyCreateInstr()
386 DAGInterval = DAGInterval.getUnionInterval({I, I}); in notifyCreateInstr()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/
H A DDependencyGraph.h335 Interval<Instruction> DAGInterval; variable
450 Interval<Instruction> getInterval() const { return DAGInterval; } in getInterval()
453 DAGInterval = {}; in clear()
459 assert(IsEmpty == DAGInterval.empty() && in empty()