1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-31 20:51:52 +01:00

ThinLTO: fix non-determinism in bitcode writing

Calls are initialized from a DenseMap. We can sort them using the
value id to recover some determinism during serialization.

From: Mehdi Amini <mehdi.amini@apple.com>
llvm-svn: 269634
This commit is contained in:
Mehdi Amini 2016-05-16 08:50:23 +00:00
parent 1241c40298
commit 808f87655d

View File

@ -3177,8 +3177,14 @@ void ModuleBitcodeWriter::writePerModuleFunctionSummaryRecord(
NameVals.insert(NameVals.end(), Refs.begin(), Refs.end());
std::vector<FunctionSummary::EdgeTy> Calls = FS->calls();
std::sort(Calls.begin(), Calls.end(),
[this](FunctionSummary::EdgeTy &L, FunctionSummary::EdgeTy &R) {
return VE.getValueID(L.first.getValue()) <
VE.getValueID(R.first.getValue());
});
bool HasProfileData = F.getEntryCount().hasValue();
for (auto &ECI : FS->calls()) {
for (auto &ECI : Calls) {
NameVals.push_back(VE.getValueID(ECI.first.getValue()));
assert(ECI.second.CallsiteCount > 0 && "Expected at least one callsite");
NameVals.push_back(ECI.second.CallsiteCount);