Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/lib/CGData/
H A DOutlinedHashTree.cpp24 SmallVector<const HashNode *> Stack; in walkGraph()
32 auto HandleNext = [&](const HashNode *Next) { in walkGraph()
38 SmallVector<std::pair<stable_hash, const HashNode *>> SortedSuccessors; in walkGraph()
53 walkGraph([&Size, GetTerminalCountOnly](const HashNode *N) { in size()
61 DenseMap<const HashNode *, size_t> DepthMap; in depth()
63 const HashNode *N) { Size = std::max(Size, DepthMap[N]); }, in depth()
64 [&DepthMap](const HashNode *Src, const HashNode *Dst) { in depth()
73 HashNode *Current = getRoot(); in insert()
78 std::unique_ptr<HashNode> Next = std::make_unique<HashNode>(); in insert()
79 HashNode *NextPtr = Next.get(); in insert()
[all …]
H A DOutlinedHashTreeRecord.cpp119 [&NodeIdMap](const HashNode *Current) { in convertToStableData()
155 HashNode *Curr = IdNodeMap[Id]; in convertFromStableData()
162 auto Sucessor = std::make_unique<HashNode>(); in convertFromStableData()
/freebsd/contrib/llvm-project/llvm/include/llvm/CGData/
H A DOutlinedHashTree.h33 struct HashNode { struct
40 std::unordered_map<stable_hash, std::unique_ptr<HashNode>> Successors; argument
46 std::function<void(const HashNode *, const HashNode *)>;
47 using NodeCallbackFn = std::function<void(const HashNode *)>;
81 const HashNode *getRoot() const { return &Root; } in getRoot()
82 HashNode *getRoot() { return &Root; } in getRoot()
95 HashNode Root;
H A DOutlinedHashTreeRecord.h33 using IdHashNodeMapTy = DenseMap<unsigned, HashNode *>;
34 using HashNodeIdMapTy = DenseMap<const HashNode *, unsigned>;
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineOutliner.cpp681 [](const MachineInstr &MI, const HashNode *CurrNode) -> const HashNode * { in getMatchedEntries()
693 const HashNode *CurrNode = getStableHashAndFollow(*MI, RootNode); in getMatchedEntries()