Home
last modified time | relevance | path

Searched refs:getOrCreateNode (Results 1 – 5 of 5) sorted by relevance

/freebsd/contrib/llvm-project/lld/ELF/
H A DCallGraphSort.cpp119 auto getOrCreateNode = [&](const InputSectionBase *isec) -> int { in CallGraphSort() local
143 int from = getOrCreateNode(fromSB); in CallGraphSort()
144 int to = getOrCreateNode(toSB); in CallGraphSort()
288 auto getOrCreateNode = [&](const InputSectionBase *inSec) -> size_t { in computeCacheDirectedSortOrder() local
312 size_t from = getOrCreateNode(fromSB); in computeCacheDirectedSortOrder()
313 size_t to = getOrCreateNode(toSB); in computeCacheDirectedSortOrder()
/freebsd/contrib/llvm-project/lld/COFF/
H A DCallGraphSort.cpp79 auto getOrCreateNode = [&](const SectionChunk *isec) -> int { in CallGraphSort() local
103 int from = getOrCreateNode(fromSec); in CallGraphSort()
104 int to = getOrCreateNode(toSec); in CallGraphSort()
/freebsd/contrib/llvm-project/llvm/lib/ProfileData/
H A DItaniumManglingCanonicalizer.cpp93 std::pair<Node *, bool> getOrCreateNode(bool CreateNewNodes, Args &&... As) { in getOrCreateNode() function in __anonef03fe500111::FoldingNodeAllocator
127 return getOrCreateNode<T>(true, std::forward<Args>(As)...).first; in makeNode()
144 getOrCreateNode<T>(CreateNewNodes, std::forward<Args>(As)...); in makeNodeSimple()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/
H A DDependencyGraph.cpp302 DGNode *LastN = getOrCreateNode(NewInterval.top()); in createNewNodes()
305 auto *N = getOrCreateNode(&I); in createNewNodes()
387 auto *N = getOrCreateNode(I); in notifyCreateInstr()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/
H A DDependencyGraph.h436 DGNode *getOrCreateNode(Instruction *I) { in getOrCreateNode() function