#include "llvm/ADT/StringExtras.h"
#include "llvm/Support/EndianStream.h"
#include "llvm/Support/OnDiskHashTable.h"
+#include <tuple>
using namespace llvm;
namespace {
+static support::endianness ValueProfDataEndianness = support::little;
+
class InstrProfRecordTrait {
public:
typedef StringRef key_type;
M += ProfRecord.Counts.size() * sizeof(uint64_t);
// Value data
- M += sizeof(uint64_t); // Number of value kinds with value sites.
- for (uint32_t Kind = IPVK_First; Kind <= IPVK_Last; ++Kind) {
- uint32_t NumValueSites = ProfRecord.getNumValueSites(Kind);
- if (NumValueSites == 0) continue;
- M += sizeof(uint64_t); // Value kind
- M += sizeof(uint64_t); // The number of value sites for given value kind
- for (uint32_t I = 0; I < NumValueSites; I++) {
- M += sizeof(uint64_t); // Number of value data pairs at a value site
- uint64_t NumValueDataForSite =
- ProfRecord.getNumValueDataForSite(Kind, I);
- M += 2 * sizeof(uint64_t) * NumValueDataForSite; // Value data pairs
- }
- }
+ M += ValueProfData::getSize(ProfileData.second);
}
LE.write<offset_type>(M);
LE.write<uint64_t>(ProfileData.first); // Function hash
LE.write<uint64_t>(ProfRecord.Counts.size());
- for (uint64_t I : ProfRecord.Counts) LE.write<uint64_t>(I);
-
- // Compute the number of value kinds with value sites.
- uint64_t NumValueKinds = ProfRecord.getNumValueKinds();
- LE.write<uint64_t>(NumValueKinds);
+ for (uint64_t I : ProfRecord.Counts)
+ LE.write<uint64_t>(I);
// Write value data
- for (uint32_t Kind = IPVK_First; Kind <= IPVK_Last; ++Kind) {
- uint32_t NumValueSites = ProfRecord.getNumValueSites(Kind);
- if (NumValueSites == 0) continue;
- LE.write<uint64_t>(Kind); // Write value kind
- // Write number of value sites for current value kind
- LE.write<uint64_t>(NumValueSites);
-
- for (uint32_t I = 0; I < NumValueSites; I++) {
- // Write number of value data pairs at this value site
- uint64_t NumValueDataForSite =
- ProfRecord.getNumValueDataForSite(Kind, I);
- LE.write<uint64_t>(NumValueDataForSite);
- std::unique_ptr<InstrProfValueData[]> VD =
- ProfRecord.getValueForSite(Kind, I);
-
- for (uint32_t V = 0; V < NumValueDataForSite; V++) {
- if (Kind == IPVK_IndirectCallTarget)
- LE.write<uint64_t>(ComputeHash((const char *)VD[V].Value));
- else
- LE.write<uint64_t>(VD[V].Value);
- LE.write<uint64_t>(VD[V].Count);
- }
- }
- }
+ std::unique_ptr<ValueProfData> VDataPtr =
+ ValueProfData::serializeFrom(ProfileData.second);
+ uint32_t S = VDataPtr->getSize();
+ VDataPtr->swapBytesFromHost(ValueProfDataEndianness);
+ Out.write((const char *)VDataPtr.get(), S);
}
}
};
}
-static std::error_code combineInstrProfRecords(InstrProfRecord &Dest,
- InstrProfRecord &Source,
- uint64_t &MaxFunctionCount) {
- // If the number of counters doesn't match we either have bad data
- // or a hash collision.
- if (Dest.Counts.size() != Source.Counts.size())
- return instrprof_error::count_mismatch;
-
- for (size_t I = 0, E = Source.Counts.size(); I < E; ++I) {
- if (Dest.Counts[I] + Source.Counts[I] < Dest.Counts[I])
- return instrprof_error::counter_overflow;
- Dest.Counts[I] += Source.Counts[I];
- }
-
- for (uint32_t Kind = IPVK_First; Kind <= IPVK_Last; ++Kind) {
- if (std::error_code EC = Dest.mergeValueProfData(Kind, Source)) return EC;
- }
-
- // We keep track of the max function count as we go for simplicity.
- if (Dest.Counts[0] > MaxFunctionCount)
- MaxFunctionCount = Dest.Counts[0];
-
- return instrprof_error::success;
+// Internal interface for testing purpose only.
+void InstrProfWriter::setValueProfDataEndianness(
+ support::endianness Endianness) {
+ ValueProfDataEndianness = Endianness;
}
void InstrProfWriter::updateStringTableReferences(InstrProfRecord &I) {
updateStringTableReferences(I);
auto &ProfileDataMap = FunctionData[I.Name];
- auto Where = ProfileDataMap.find(I.Hash);
- if (Where == ProfileDataMap.end()) {
+ bool NewFunc;
+ ProfilingData::iterator Where;
+ std::tie(Where, NewFunc) =
+ ProfileDataMap.insert(std::make_pair(I.Hash, InstrProfRecord()));
+ InstrProfRecord &Dest = Where->second;
+ if (NewFunc) {
// We've never seen a function with this name and hash, add it.
- ProfileDataMap[I.Hash] = I;
-
- // We keep track of the max function count as we go for simplicity.
- if (I.Counts[0] > MaxFunctionCount)
- MaxFunctionCount = I.Counts[0];
- return instrprof_error::success;
+ Dest = std::move(I);
+ } else {
+ // We're updating a function we've seen before.
+ instrprof_error MergeResult = Dest.merge(I);
+ if (MergeResult != instrprof_error::success) {
+ return MergeResult;
+ }
}
- // We're updating a function we've seen before.
- return combineInstrProfRecords(Where->second, I, MaxFunctionCount);
+ // We keep track of the max function count as we go for simplicity.
+ if (Dest.Counts[0] > MaxFunctionCount)
+ MaxFunctionCount = Dest.Counts[0];
+
+ return instrprof_error::success;
}
std::pair<uint64_t, uint64_t> InstrProfWriter::writeImpl(raw_ostream &OS) {
endian::Writer<little>(OS).write<uint64_t>(TableStart.second);
}
+void InstrProfWriter::writeRecordInText(const InstrProfRecord &Func,
+ raw_fd_ostream &OS) {
+ OS << Func.Name << "\n";
+ OS << "# Func Hash:\n" << Func.Hash << "\n";
+ OS << "# Num Counters:\n" <<Func.Counts.size() << "\n";
+ OS << "# Counter Values:\n";
+ for (uint64_t Count : Func.Counts)
+ OS << Count << "\n";
+
+ OS << "\n";
+}
+
+void InstrProfWriter::writeText(raw_fd_ostream &OS) {
+ for (const auto &I : FunctionData)
+ for (const auto &Func : I.getValue())
+ writeRecordInText(Func.second, OS);
+}
+
std::unique_ptr<MemoryBuffer> InstrProfWriter::writeBuffer() {
std::string Data;
llvm::raw_string_ostream OS(Data);
projects / oota-llvm.git / blobdiff