Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/lib/CodeGenData/
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/CodeGenData/
H A DOutlinedHashTree.h32 struct HashNode { struct
39 std::unordered_map<stable_hash, std::unique_ptr<HashNode>> Successors; argument
45 std::function<void(const HashNode *, const HashNode *)>;
46 using NodeCallbackFn = std::function<void(const HashNode *)>;
80 const HashNode *getRoot() const { return &Root; } in getRoot()
81 HashNode *getRoot() { return &Root; } in getRoot()
94 HashNode Root;
H A DOutlinedHashTreeRecord.h32 using IdHashNodeMapTy = DenseMap<unsigned, HashNode *>;
33 using HashNodeIdMapTy = DenseMap<const HashNode *, unsigned>;