Home
last modified time | relevance | path

Searched refs:HashTree (Results 1 – 6 of 6) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/CGData/
H A DOutlinedHashTreeRecord.h37 std::unique_ptr<OutlinedHashTree> HashTree; member
39 OutlinedHashTreeRecord() { HashTree = std::make_unique<OutlinedHashTree>(); } in OutlinedHashTreeRecord()
40 OutlinedHashTreeRecord(std::unique_ptr<OutlinedHashTree> HashTree) in OutlinedHashTreeRecord()
41 : HashTree(std::move(HashTree)) {}; in OutlinedHashTreeRecord()
54 HashTree->merge(Other.HashTree.get()); in merge()
58 bool empty() const { return HashTree->empty(); } in empty()
H A DCodeGenData.h157 void publishOutlinedHashTree(std::unique_ptr<OutlinedHashTree> HashTree) { in publishOutlinedHashTree() argument
158 PublishedHashTree = std::move(HashTree); in publishOutlinedHashTree()
191 publishOutlinedHashTree(std::unique_ptr<OutlinedHashTree> HashTree) { in publishOutlinedHashTree() argument
192 CodeGenData::getInstance().publishOutlinedHashTree(std::move(HashTree)); in publishOutlinedHashTree()
H A DCodeGenDataReader.h45 return std::move(HashTreeRecord.HashTree); in releaseOutlinedHashTree()
/freebsd/contrib/llvm-project/llvm/lib/CGData/
H A DCodeGenDataWriter.cpp66 assert(Record.HashTree && "empty hash tree in the record"); in addRecord()
67 HashTreeRecord.HashTree = std::move(Record.HashTree); in addRecord()
H A DOutlinedHashTreeRecord.cpp118 HashTree->walkGraph( in convertToStableData()
148 IdNodeMap[0] = HashTree->getRoot(); in convertFromStableData()
H A DCodeGenData.cpp282 cgdata::publishOutlinedHashTree(std::move(GlobalOutlineRecord.HashTree)); in mergeCodeGenData()