Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/
H A DDependencyGraph.cpp371 auto *NextMemN = dyn_cast<MemDGNode>(NextN); in getMemDGNodeAfter() local
372 if (NextMemN != nullptr && NextMemN != SkipN) in getMemDGNodeAfter()
373 return NextMemN; in getMemDGNodeAfter()
393 PrevMemN->NextMemN = MemN; in notifyCreateInstr()
396 if (auto *NextMemN = getMemDGNodeAfter(MemN, /*IncludingN=*/false)) { in notifyCreateInstr() local
397 NextMemN->PrevMemN = MemN; in notifyCreateInstr()
398 MemN->NextMemN = NextMemN; in notifyCreateInstr()
499 auto *NextMemN = getMemDGNodeAfter(MemN, /*IncludingN=*/false); in notifyEraseInstr() local
501 PrevMemN->NextMemN = NextMemN; in notifyEraseInstr()
502 if (NextMemN != nullptr) in notifyEraseInstr()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/
H A DDependencyGraph.h223 MemDGNode *NextMemN = nullptr; variable
232 NextMemN = N; in setNextNode()
233 if (NextMemN != nullptr) in setNextNode()
234 NextMemN->PrevMemN = this; in setNextNode()
241 PrevMemN->NextMemN = this; in setPrevNode()
246 PrevMemN->NextMemN = NextMemN; in detachFromChain()
247 if (NextMemN != nullptr) in detachFromChain()
248 NextMemN->PrevMemN = PrevMemN; in detachFromChain()
250 NextMemN = nullptr; in detachFromChain()
271 MemDGNode *getNextNode() const { return NextMemN; } in getNextNode()