Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/llvm-project/lld/ELF/
H A DCallGraphSort.cpp118 auto getOrCreateNode = [&](const InputSectionBase *isec) -> int { in CallGraphSort() local
142 int from = getOrCreateNode(fromSB); in CallGraphSort()
143 int to = getOrCreateNode(toSB); in CallGraphSort()
285 auto getOrCreateNode = [&](const InputSectionBase *inSec) -> size_t { in computeCacheDirectedSortOrder() local
309 size_t from = getOrCreateNode(fromSB); in computeCacheDirectedSortOrder()
310 size_t to = getOrCreateNode(toSB); in computeCacheDirectedSortOrder()
/freebsd-14.2/contrib/llvm-project/lld/COFF/
H A DCallGraphSort.cpp80 auto getOrCreateNode = [&](const SectionChunk *isec) -> int { in CallGraphSort() local
104 int from = getOrCreateNode(fromSec); in CallGraphSort()
105 int to = getOrCreateNode(toSec); in CallGraphSort()
/freebsd-14.2/contrib/llvm-project/llvm/lib/ProfileData/
H A DItaniumManglingCanonicalizer.cpp93 std::pair<Node *, bool> getOrCreateNode(bool CreateNewNodes, Args &&... As) { in getOrCreateNode() function in __anoncaa48b060111::FoldingNodeAllocator
127 return getOrCreateNode<T>(true, std::forward<Args>(As)...).first; in makeNode()
144 getOrCreateNode<T>(CreateNewNodes, std::forward<Args>(As)...); in makeNodeSimple()