blob: 9bb03e1e77a38deda428e062385d465410028011 [file] [log] [blame]
Justin Bognerb9bd7f82014-03-21 17:46:22 +00001//=-- InstrProfWriter.cpp - Instrumented profiling writer -------------------=//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file contains support for writing profiling data for clang's
11// instrumentation based PGO and coverage.
12//
13//===----------------------------------------------------------------------===//
14
15#include "llvm/ProfileData/InstrProfWriter.h"
Justin Bognerb7aa2632014-04-18 21:48:40 +000016#include "llvm/ADT/StringExtras.h"
17#include "llvm/Support/EndianStream.h"
18#include "llvm/Support/OnDiskHashTable.h"
Reid Kleckner437b1b32015-11-20 19:29:40 +000019#include <tuple>
Justin Bognerb7aa2632014-04-18 21:48:40 +000020
Justin Bognerb9bd7f82014-03-21 17:46:22 +000021using namespace llvm;
22
Justin Bognerb7aa2632014-04-18 21:48:40 +000023namespace {
Xinliang David Liee415892015-11-10 00:24:45 +000024static support::endianness ValueProfDataEndianness = support::little;
25
Justin Bognerb7aa2632014-04-18 21:48:40 +000026class InstrProfRecordTrait {
27public:
28 typedef StringRef key_type;
29 typedef StringRef key_type_ref;
30
Justin Bogner9e9a0572015-09-29 22:13:58 +000031 typedef const InstrProfWriter::ProfilingData *const data_type;
32 typedef const InstrProfWriter::ProfilingData *const data_type_ref;
Justin Bognerb7aa2632014-04-18 21:48:40 +000033
34 typedef uint64_t hash_value_type;
35 typedef uint64_t offset_type;
36
37 static hash_value_type ComputeHash(key_type_ref K) {
Xinliang David Li49ee76d2015-12-18 22:22:12 +000038 return IndexedInstrProf::ComputeHash(K);
Justin Bognerb7aa2632014-04-18 21:48:40 +000039 }
40
41 static std::pair<offset_type, offset_type>
42 EmitKeyDataLength(raw_ostream &Out, key_type_ref K, data_type_ref V) {
43 using namespace llvm::support;
44 endian::Writer<little> LE(Out);
45
Justin Bognere8081712014-04-19 00:33:15 +000046 offset_type N = K.size();
Justin Bognerb7aa2632014-04-18 21:48:40 +000047 LE.write<offset_type>(N);
48
Justin Bogner821d7472014-08-01 22:50:07 +000049 offset_type M = 0;
Justin Bogner9e9a0572015-09-29 22:13:58 +000050 for (const auto &ProfileData : *V) {
Xinliang David Li2004f002015-11-02 05:08:23 +000051 const InstrProfRecord &ProfRecord = ProfileData.second;
Justin Bogner9e9a0572015-09-29 22:13:58 +000052 M += sizeof(uint64_t); // The function hash
53 M += sizeof(uint64_t); // The size of the Counts vector
Xinliang David Li2004f002015-11-02 05:08:23 +000054 M += ProfRecord.Counts.size() * sizeof(uint64_t);
Justin Bogner9e9a0572015-09-29 22:13:58 +000055
56 // Value data
Xinliang David Li99556872015-11-17 23:00:40 +000057 M += ValueProfData::getSize(ProfileData.second);
Justin Bogner9e9a0572015-09-29 22:13:58 +000058 }
Justin Bognerb7aa2632014-04-18 21:48:40 +000059 LE.write<offset_type>(M);
60
61 return std::make_pair(N, M);
62 }
63
Justin Bognere8081712014-04-19 00:33:15 +000064 static void EmitKey(raw_ostream &Out, key_type_ref K, offset_type N){
Justin Bognerb7aa2632014-04-18 21:48:40 +000065 Out.write(K.data(), N);
66 }
67
68 static void EmitData(raw_ostream &Out, key_type_ref, data_type_ref V,
Justin Bognere8081712014-04-19 00:33:15 +000069 offset_type) {
Justin Bognerb7aa2632014-04-18 21:48:40 +000070 using namespace llvm::support;
71 endian::Writer<little> LE(Out);
Justin Bogner9e9a0572015-09-29 22:13:58 +000072 for (const auto &ProfileData : *V) {
Xinliang David Li2004f002015-11-02 05:08:23 +000073 const InstrProfRecord &ProfRecord = ProfileData.second;
74
Justin Bogner9e9a0572015-09-29 22:13:58 +000075 LE.write<uint64_t>(ProfileData.first); // Function hash
Xinliang David Li2004f002015-11-02 05:08:23 +000076 LE.write<uint64_t>(ProfRecord.Counts.size());
Xinliang David Li6aa216c2015-11-06 07:54:21 +000077 for (uint64_t I : ProfRecord.Counts)
78 LE.write<uint64_t>(I);
Justin Bogner9e9a0572015-09-29 22:13:58 +000079
Justin Bogner9e9a0572015-09-29 22:13:58 +000080 // Write value data
Xinliang David Li99556872015-11-17 23:00:40 +000081 std::unique_ptr<ValueProfData> VDataPtr =
82 ValueProfData::serializeFrom(ProfileData.second);
Xinliang David Liee415892015-11-10 00:24:45 +000083 uint32_t S = VDataPtr->getSize();
84 VDataPtr->swapBytesFromHost(ValueProfDataEndianness);
85 Out.write((const char *)VDataPtr.get(), S);
Justin Bogner821d7472014-08-01 22:50:07 +000086 }
Justin Bognerb7aa2632014-04-18 21:48:40 +000087 }
88};
Alexander Kornienkof00654e2015-06-23 09:49:53 +000089}
Justin Bognerb7aa2632014-04-18 21:48:40 +000090
Xinliang David Liee415892015-11-10 00:24:45 +000091// Internal interface for testing purpose only.
92void InstrProfWriter::setValueProfDataEndianness(
93 support::endianness Endianness) {
94 ValueProfDataEndianness = Endianness;
95}
96
Nathan Slingerland7f5b47d2015-12-15 17:37:09 +000097std::error_code InstrProfWriter::addRecord(InstrProfRecord &&I,
98 uint64_t Weight) {
Justin Bogner9e9a0572015-09-29 22:13:58 +000099 auto &ProfileDataMap = FunctionData[I.Name];
100
Nathan Slingerlanda7318292015-11-20 19:12:43 +0000101 bool NewFunc;
102 ProfilingData::iterator Where;
103 std::tie(Where, NewFunc) =
104 ProfileDataMap.insert(std::make_pair(I.Hash, InstrProfRecord()));
105 InstrProfRecord &Dest = Where->second;
Nathan Slingerlandaa5702d2015-12-02 18:19:24 +0000106
107 instrprof_error Result;
Nathan Slingerlanda7318292015-11-20 19:12:43 +0000108 if (NewFunc) {
Justin Bogner821d7472014-08-01 22:50:07 +0000109 // We've never seen a function with this name and hash, add it.
Nathan Slingerlanda7318292015-11-20 19:12:43 +0000110 Dest = std::move(I);
Xinliang David Li60057282015-12-20 08:46:18 +0000111 // Fix up the name to avoid dangling reference.
112 Dest.Name = FunctionData.find(Dest.Name)->getKey();
Nathan Slingerlandaa5702d2015-12-02 18:19:24 +0000113 Result = instrprof_error::success;
Nathan Slingerland7f5b47d2015-12-15 17:37:09 +0000114 if (Weight > 1) {
115 for (auto &Count : Dest.Counts) {
116 bool Overflowed;
117 Count = SaturatingMultiply(Count, Weight, &Overflowed);
118 if (Overflowed && Result == instrprof_error::success) {
119 Result = instrprof_error::counter_overflow;
120 }
121 }
122 }
Nathan Slingerlanda7318292015-11-20 19:12:43 +0000123 } else {
124 // We're updating a function we've seen before.
Nathan Slingerland7f5b47d2015-12-15 17:37:09 +0000125 Result = Dest.merge(I, Weight);
Justin Bognerb9bd7f82014-03-21 17:46:22 +0000126 }
127
Nathan Slingerlanda7318292015-11-20 19:12:43 +0000128 // We keep track of the max function count as we go for simplicity.
Nathan Slingerlandaa5702d2015-12-02 18:19:24 +0000129 // Update this statistic no matter the result of the merge.
Nathan Slingerlanda7318292015-11-20 19:12:43 +0000130 if (Dest.Counts[0] > MaxFunctionCount)
131 MaxFunctionCount = Dest.Counts[0];
132
Nathan Slingerlandaa5702d2015-12-02 18:19:24 +0000133 return Result;
Justin Bognerb9bd7f82014-03-21 17:46:22 +0000134}
135
Justin Bogner2b6c5372015-02-18 01:58:17 +0000136std::pair<uint64_t, uint64_t> InstrProfWriter::writeImpl(raw_ostream &OS) {
Justin Bognerb7aa2632014-04-18 21:48:40 +0000137 OnDiskChainedHashTableGenerator<InstrProfRecordTrait> Generator;
Justin Bognerb9bd7f82014-03-21 17:46:22 +0000138
Justin Bognerb7aa2632014-04-18 21:48:40 +0000139 // Populate the hash table generator.
Justin Bogner821d7472014-08-01 22:50:07 +0000140 for (const auto &I : FunctionData)
Justin Bognerfa5b0132014-04-23 18:50:16 +0000141 Generator.insert(I.getKey(), &I.getValue());
Justin Bognerb7aa2632014-04-18 21:48:40 +0000142
143 using namespace llvm::support;
144 endian::Writer<little> LE(OS);
145
146 // Write the header.
Xinliang David Lidab183ed2015-10-18 01:02:29 +0000147 IndexedInstrProf::Header Header;
148 Header.Magic = IndexedInstrProf::Magic;
149 Header.Version = IndexedInstrProf::Version;
150 Header.MaxFunctionCount = MaxFunctionCount;
151 Header.HashType = static_cast<uint64_t>(IndexedInstrProf::HashType);
152 Header.HashOffset = 0;
153 int N = sizeof(IndexedInstrProf::Header) / sizeof(uint64_t);
154
155 // Only write out all the fields execpt 'HashOffset'. We need
156 // to remember the offset of that field to allow back patching
157 // later.
158 for (int I = 0; I < N - 1; I++)
159 LE.write<uint64_t>(reinterpret_cast<uint64_t *>(&Header)[I]);
Justin Bognerb7aa2632014-04-18 21:48:40 +0000160
161 // Save a space to write the hash table start location.
162 uint64_t HashTableStartLoc = OS.tell();
Xinliang David Lidab183ed2015-10-18 01:02:29 +0000163 // Reserve the space for HashOffset field.
Justin Bognerb7aa2632014-04-18 21:48:40 +0000164 LE.write<uint64_t>(0);
165 // Write the hash table.
166 uint64_t HashTableStart = Generator.Emit(OS);
167
Justin Bogner2b6c5372015-02-18 01:58:17 +0000168 return std::make_pair(HashTableStartLoc, HashTableStart);
169}
170
171void InstrProfWriter::write(raw_fd_ostream &OS) {
172 // Write the hash table.
173 auto TableStart = writeImpl(OS);
174
Justin Bognerb7aa2632014-04-18 21:48:40 +0000175 // Go back and fill in the hash table start.
Justin Bogner2b6c5372015-02-18 01:58:17 +0000176 using namespace support;
177 OS.seek(TableStart.first);
Xinliang David Lidab183ed2015-10-18 01:02:29 +0000178 // Now patch the HashOffset field previously reserved.
Justin Bogner2b6c5372015-02-18 01:58:17 +0000179 endian::Writer<little>(OS).write<uint64_t>(TableStart.second);
180}
181
Xinliang David Lie3bf4fd32015-12-14 18:44:01 +0000182static const char *ValueProfKindStr[] = {
183#define VALUE_PROF_KIND(Enumerator, Value) #Enumerator,
184#include "llvm/ProfileData/InstrProfData.inc"
185};
186
Xinliang David Li6f7c19a2015-11-23 20:47:38 +0000187void InstrProfWriter::writeRecordInText(const InstrProfRecord &Func,
Xinliang David Lia716cc52015-12-20 06:22:13 +0000188 InstrProfSymtab &Symtab,
Xinliang David Li6f7c19a2015-11-23 20:47:38 +0000189 raw_fd_ostream &OS) {
Xinliang David Lic6676832015-11-23 22:31:22 +0000190 OS << Func.Name << "\n";
191 OS << "# Func Hash:\n" << Func.Hash << "\n";
Xinliang David Lie3bf4fd32015-12-14 18:44:01 +0000192 OS << "# Num Counters:\n" << Func.Counts.size() << "\n";
Xinliang David Lic6676832015-11-23 22:31:22 +0000193 OS << "# Counter Values:\n";
Xinliang David Li6f7c19a2015-11-23 20:47:38 +0000194 for (uint64_t Count : Func.Counts)
195 OS << Count << "\n";
196
Xinliang David Lie3bf4fd32015-12-14 18:44:01 +0000197 uint32_t NumValueKinds = Func.getNumValueKinds();
198 if (!NumValueKinds) {
199 OS << "\n";
200 return;
201 }
202
203 OS << "# Num Value Kinds:\n" << Func.getNumValueKinds() << "\n";
204 for (uint32_t VK = 0; VK < IPVK_Last + 1; VK++) {
205 uint32_t NS = Func.getNumValueSites(VK);
206 if (!NS)
207 continue;
208 OS << "# ValueKind = " << ValueProfKindStr[VK] << ":\n" << VK << "\n";
209 OS << "# NumValueSites:\n" << NS << "\n";
210 for (uint32_t S = 0; S < NS; S++) {
211 uint32_t ND = Func.getNumValueDataForSite(VK, S);
212 OS << ND << "\n";
213 std::unique_ptr<InstrProfValueData[]> VD = Func.getValueForSite(VK, S);
214 for (uint32_t I = 0; I < ND; I++) {
215 if (VK == IPVK_IndirectCallTarget)
Xinliang David Lia716cc52015-12-20 06:22:13 +0000216 OS << Symtab.getFuncName(VD[I].Value) << ":" << VD[I].Count << "\n";
Xinliang David Lie3bf4fd32015-12-14 18:44:01 +0000217 else
218 OS << VD[I].Value << ":" << VD[I].Count << "\n";
219 }
220 }
221 }
222
Xinliang David Li6f7c19a2015-11-23 20:47:38 +0000223 OS << "\n";
224}
225
226void InstrProfWriter::writeText(raw_fd_ostream &OS) {
Xinliang David Lia716cc52015-12-20 06:22:13 +0000227 InstrProfSymtab Symtab;
228 for (const auto &I : FunctionData)
229 Symtab.addFuncName(I.getKey());
230 Symtab.finalizeSymtab();
231
Xinliang David Li6f7c19a2015-11-23 20:47:38 +0000232 for (const auto &I : FunctionData)
233 for (const auto &Func : I.getValue())
Xinliang David Lia716cc52015-12-20 06:22:13 +0000234 writeRecordInText(Func.second, Symtab, OS);
Xinliang David Li6f7c19a2015-11-23 20:47:38 +0000235}
236
Justin Bogner2b6c5372015-02-18 01:58:17 +0000237std::unique_ptr<MemoryBuffer> InstrProfWriter::writeBuffer() {
238 std::string Data;
239 llvm::raw_string_ostream OS(Data);
240 // Write the hash table.
241 auto TableStart = writeImpl(OS);
242 OS.flush();
243
244 // Go back and fill in the hash table start.
245 using namespace support;
246 uint64_t Bytes = endian::byte_swap<uint64_t, little>(TableStart.second);
247 Data.replace(TableStart.first, sizeof(uint64_t), (const char *)&Bytes,
248 sizeof(uint64_t));
249
250 // Return this in an aligned memory buffer.
251 return MemoryBuffer::getMemBufferCopy(Data);
Justin Bognerb9bd7f82014-03-21 17:46:22 +0000252}