1 //===- InstrProfWriter.cpp - Instrumented profiling writer ----------------===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 // 9 // This file contains support for writing profiling data for clang's 10 // instrumentation based PGO and coverage. 11 // 12 //===----------------------------------------------------------------------===// 13 14 #include "llvm/ProfileData/InstrProfWriter.h" 15 #include "llvm/ADT/STLExtras.h" 16 #include "llvm/ADT/StringRef.h" 17 #include "llvm/IR/ProfileSummary.h" 18 #include "llvm/ProfileData/InstrProf.h" 19 #include "llvm/ProfileData/MemProf.h" 20 #include "llvm/ProfileData/ProfileCommon.h" 21 #include "llvm/Support/Endian.h" 22 #include "llvm/Support/EndianStream.h" 23 #include "llvm/Support/Error.h" 24 #include "llvm/Support/MemoryBuffer.h" 25 #include "llvm/Support/OnDiskHashTable.h" 26 #include "llvm/Support/raw_ostream.h" 27 #include <cstdint> 28 #include <memory> 29 #include <string> 30 #include <tuple> 31 #include <utility> 32 #include <vector> 33 34 using namespace llvm; 35 36 // A struct to define how the data stream should be patched. For Indexed 37 // profiling, only uint64_t data type is needed. 38 struct PatchItem { 39 uint64_t Pos; // Where to patch. 40 uint64_t *D; // Pointer to an array of source data. 41 int N; // Number of elements in \c D array. 42 }; 43 44 namespace llvm { 45 46 // A wrapper class to abstract writer stream with support of bytes 47 // back patching. 48 class ProfOStream { 49 public: 50 ProfOStream(raw_fd_ostream &FD) 51 : IsFDOStream(true), OS(FD), LE(FD, support::little) {} 52 ProfOStream(raw_string_ostream &STR) 53 : IsFDOStream(false), OS(STR), LE(STR, support::little) {} 54 55 uint64_t tell() { return OS.tell(); } 56 void write(uint64_t V) { LE.write<uint64_t>(V); } 57 58 // \c patch can only be called when all data is written and flushed. 59 // For raw_string_ostream, the patch is done on the target string 60 // directly and it won't be reflected in the stream's internal buffer. 61 void patch(PatchItem *P, int NItems) { 62 using namespace support; 63 64 if (IsFDOStream) { 65 raw_fd_ostream &FDOStream = static_cast<raw_fd_ostream &>(OS); 66 const uint64_t LastPos = FDOStream.tell(); 67 for (int K = 0; K < NItems; K++) { 68 FDOStream.seek(P[K].Pos); 69 for (int I = 0; I < P[K].N; I++) 70 write(P[K].D[I]); 71 } 72 // Reset the stream to the last position after patching so that users 73 // don't accidentally overwrite data. This makes it consistent with 74 // the string stream below which replaces the data directly. 75 FDOStream.seek(LastPos); 76 } else { 77 raw_string_ostream &SOStream = static_cast<raw_string_ostream &>(OS); 78 std::string &Data = SOStream.str(); // with flush 79 for (int K = 0; K < NItems; K++) { 80 for (int I = 0; I < P[K].N; I++) { 81 uint64_t Bytes = endian::byte_swap<uint64_t, little>(P[K].D[I]); 82 Data.replace(P[K].Pos + I * sizeof(uint64_t), sizeof(uint64_t), 83 (const char *)&Bytes, sizeof(uint64_t)); 84 } 85 } 86 } 87 } 88 89 // If \c OS is an instance of \c raw_fd_ostream, this field will be 90 // true. Otherwise, \c OS will be an raw_string_ostream. 91 bool IsFDOStream; 92 raw_ostream &OS; 93 support::endian::Writer LE; 94 }; 95 96 class InstrProfRecordWriterTrait { 97 public: 98 using key_type = StringRef; 99 using key_type_ref = StringRef; 100 101 using data_type = const InstrProfWriter::ProfilingData *const; 102 using data_type_ref = const InstrProfWriter::ProfilingData *const; 103 104 using hash_value_type = uint64_t; 105 using offset_type = uint64_t; 106 107 support::endianness ValueProfDataEndianness = support::little; 108 InstrProfSummaryBuilder *SummaryBuilder; 109 InstrProfSummaryBuilder *CSSummaryBuilder; 110 111 InstrProfRecordWriterTrait() = default; 112 113 static hash_value_type ComputeHash(key_type_ref K) { 114 return IndexedInstrProf::ComputeHash(K); 115 } 116 117 static std::pair<offset_type, offset_type> 118 EmitKeyDataLength(raw_ostream &Out, key_type_ref K, data_type_ref V) { 119 using namespace support; 120 121 endian::Writer LE(Out, little); 122 123 offset_type N = K.size(); 124 LE.write<offset_type>(N); 125 126 offset_type M = 0; 127 for (const auto &ProfileData : *V) { 128 const InstrProfRecord &ProfRecord = ProfileData.second; 129 M += sizeof(uint64_t); // The function hash 130 M += sizeof(uint64_t); // The size of the Counts vector 131 M += ProfRecord.Counts.size() * sizeof(uint64_t); 132 133 // Value data 134 M += ValueProfData::getSize(ProfileData.second); 135 } 136 LE.write<offset_type>(M); 137 138 return std::make_pair(N, M); 139 } 140 141 void EmitKey(raw_ostream &Out, key_type_ref K, offset_type N) { 142 Out.write(K.data(), N); 143 } 144 145 void EmitData(raw_ostream &Out, key_type_ref, data_type_ref V, offset_type) { 146 using namespace support; 147 148 endian::Writer LE(Out, little); 149 for (const auto &ProfileData : *V) { 150 const InstrProfRecord &ProfRecord = ProfileData.second; 151 if (NamedInstrProfRecord::hasCSFlagInHash(ProfileData.first)) 152 CSSummaryBuilder->addRecord(ProfRecord); 153 else 154 SummaryBuilder->addRecord(ProfRecord); 155 156 LE.write<uint64_t>(ProfileData.first); // Function hash 157 LE.write<uint64_t>(ProfRecord.Counts.size()); 158 for (uint64_t I : ProfRecord.Counts) 159 LE.write<uint64_t>(I); 160 161 // Write value data 162 std::unique_ptr<ValueProfData> VDataPtr = 163 ValueProfData::serializeFrom(ProfileData.second); 164 uint32_t S = VDataPtr->getSize(); 165 VDataPtr->swapBytesFromHost(ValueProfDataEndianness); 166 Out.write((const char *)VDataPtr.get(), S); 167 } 168 } 169 }; 170 171 } // end namespace llvm 172 173 InstrProfWriter::InstrProfWriter(bool Sparse) 174 : Sparse(Sparse), InfoObj(new InstrProfRecordWriterTrait()) {} 175 176 InstrProfWriter::~InstrProfWriter() { delete InfoObj; } 177 178 // Internal interface for testing purpose only. 179 void InstrProfWriter::setValueProfDataEndianness( 180 support::endianness Endianness) { 181 InfoObj->ValueProfDataEndianness = Endianness; 182 } 183 184 void InstrProfWriter::setOutputSparse(bool Sparse) { 185 this->Sparse = Sparse; 186 } 187 188 void InstrProfWriter::addRecord(NamedInstrProfRecord &&I, uint64_t Weight, 189 function_ref<void(Error)> Warn) { 190 auto Name = I.Name; 191 auto Hash = I.Hash; 192 addRecord(Name, Hash, std::move(I), Weight, Warn); 193 } 194 195 void InstrProfWriter::overlapRecord(NamedInstrProfRecord &&Other, 196 OverlapStats &Overlap, 197 OverlapStats &FuncLevelOverlap, 198 const OverlapFuncFilters &FuncFilter) { 199 auto Name = Other.Name; 200 auto Hash = Other.Hash; 201 Other.accumulateCounts(FuncLevelOverlap.Test); 202 if (FunctionData.find(Name) == FunctionData.end()) { 203 Overlap.addOneUnique(FuncLevelOverlap.Test); 204 return; 205 } 206 if (FuncLevelOverlap.Test.CountSum < 1.0f) { 207 Overlap.Overlap.NumEntries += 1; 208 return; 209 } 210 auto &ProfileDataMap = FunctionData[Name]; 211 bool NewFunc; 212 ProfilingData::iterator Where; 213 std::tie(Where, NewFunc) = 214 ProfileDataMap.insert(std::make_pair(Hash, InstrProfRecord())); 215 if (NewFunc) { 216 Overlap.addOneMismatch(FuncLevelOverlap.Test); 217 return; 218 } 219 InstrProfRecord &Dest = Where->second; 220 221 uint64_t ValueCutoff = FuncFilter.ValueCutoff; 222 if (!FuncFilter.NameFilter.empty() && Name.contains(FuncFilter.NameFilter)) 223 ValueCutoff = 0; 224 225 Dest.overlap(Other, Overlap, FuncLevelOverlap, ValueCutoff); 226 } 227 228 void InstrProfWriter::addRecord(StringRef Name, uint64_t Hash, 229 InstrProfRecord &&I, uint64_t Weight, 230 function_ref<void(Error)> Warn) { 231 auto &ProfileDataMap = FunctionData[Name]; 232 233 bool NewFunc; 234 ProfilingData::iterator Where; 235 std::tie(Where, NewFunc) = 236 ProfileDataMap.insert(std::make_pair(Hash, InstrProfRecord())); 237 InstrProfRecord &Dest = Where->second; 238 239 auto MapWarn = [&](instrprof_error E) { 240 Warn(make_error<InstrProfError>(E)); 241 }; 242 243 if (NewFunc) { 244 // We've never seen a function with this name and hash, add it. 245 Dest = std::move(I); 246 if (Weight > 1) 247 Dest.scale(Weight, 1, MapWarn); 248 } else { 249 // We're updating a function we've seen before. 250 Dest.merge(I, Weight, MapWarn); 251 } 252 253 Dest.sortValueData(); 254 } 255 256 void InstrProfWriter::addRecord(const memprof::MemProfRecord &MR, 257 function_ref<void(Error)> Warn) { 258 // Use 0 as a sentinel value since its highly unlikely that the lower 64-bits 259 // of a 128 bit md5 hash will be all zeros. 260 // TODO: Move this Key frame detection to the contructor to avoid having to 261 // scan all the callstacks again when adding a new record. 262 uint64_t Key = 0; 263 for (auto Iter = MR.CallStack.rbegin(), End = MR.CallStack.rend(); 264 Iter != End; Iter++) { 265 if (!Iter->IsInlineFrame) { 266 Key = Iter->Function; 267 break; 268 } 269 } 270 271 if (Key == 0) { 272 Warn(make_error<InstrProfError>( 273 instrprof_error::invalid_prof, 274 "could not determine leaf function for memprof record.")); 275 } 276 277 MemProfData[Key].push_back(MR); 278 } 279 280 void InstrProfWriter::mergeRecordsFromWriter(InstrProfWriter &&IPW, 281 function_ref<void(Error)> Warn) { 282 for (auto &I : IPW.FunctionData) 283 for (auto &Func : I.getValue()) 284 addRecord(I.getKey(), Func.first, std::move(Func.second), 1, Warn); 285 286 for (auto &I : IPW.MemProfData) 287 for (const auto &MR : I.second) 288 addRecord(MR, Warn); 289 } 290 291 bool InstrProfWriter::shouldEncodeData(const ProfilingData &PD) { 292 if (!Sparse) 293 return true; 294 for (const auto &Func : PD) { 295 const InstrProfRecord &IPR = Func.second; 296 if (llvm::any_of(IPR.Counts, [](uint64_t Count) { return Count > 0; })) 297 return true; 298 } 299 return false; 300 } 301 302 static void setSummary(IndexedInstrProf::Summary *TheSummary, 303 ProfileSummary &PS) { 304 using namespace IndexedInstrProf; 305 306 const std::vector<ProfileSummaryEntry> &Res = PS.getDetailedSummary(); 307 TheSummary->NumSummaryFields = Summary::NumKinds; 308 TheSummary->NumCutoffEntries = Res.size(); 309 TheSummary->set(Summary::MaxFunctionCount, PS.getMaxFunctionCount()); 310 TheSummary->set(Summary::MaxBlockCount, PS.getMaxCount()); 311 TheSummary->set(Summary::MaxInternalBlockCount, PS.getMaxInternalCount()); 312 TheSummary->set(Summary::TotalBlockCount, PS.getTotalCount()); 313 TheSummary->set(Summary::TotalNumBlocks, PS.getNumCounts()); 314 TheSummary->set(Summary::TotalNumFunctions, PS.getNumFunctions()); 315 for (unsigned I = 0; I < Res.size(); I++) 316 TheSummary->setEntry(I, Res[I]); 317 } 318 319 Error InstrProfWriter::writeImpl(ProfOStream &OS) { 320 using namespace IndexedInstrProf; 321 322 OnDiskChainedHashTableGenerator<InstrProfRecordWriterTrait> Generator; 323 324 InstrProfSummaryBuilder ISB(ProfileSummaryBuilder::DefaultCutoffs); 325 InfoObj->SummaryBuilder = &ISB; 326 InstrProfSummaryBuilder CSISB(ProfileSummaryBuilder::DefaultCutoffs); 327 InfoObj->CSSummaryBuilder = &CSISB; 328 329 // Populate the hash table generator. 330 for (const auto &I : FunctionData) 331 if (shouldEncodeData(I.getValue())) 332 Generator.insert(I.getKey(), &I.getValue()); 333 334 // Write the header. 335 IndexedInstrProf::Header Header; 336 Header.Magic = IndexedInstrProf::Magic; 337 Header.Version = IndexedInstrProf::ProfVersion::CurrentVersion; 338 if (static_cast<bool>(ProfileKind & InstrProfKind::IRInstrumentation)) 339 Header.Version |= VARIANT_MASK_IR_PROF; 340 if (static_cast<bool>(ProfileKind & InstrProfKind::ContextSensitive)) 341 Header.Version |= VARIANT_MASK_CSIR_PROF; 342 if (static_cast<bool>(ProfileKind & 343 InstrProfKind::FunctionEntryInstrumentation)) 344 Header.Version |= VARIANT_MASK_INSTR_ENTRY; 345 if (static_cast<bool>(ProfileKind & InstrProfKind::SingleByteCoverage)) 346 Header.Version |= VARIANT_MASK_BYTE_COVERAGE; 347 if (static_cast<bool>(ProfileKind & InstrProfKind::FunctionEntryOnly)) 348 Header.Version |= VARIANT_MASK_FUNCTION_ENTRY_ONLY; 349 if (static_cast<bool>(ProfileKind & InstrProfKind::MemProf)) 350 Header.Version |= VARIANT_MASK_MEMPROF; 351 352 Header.Unused = 0; 353 Header.HashType = static_cast<uint64_t>(IndexedInstrProf::HashType); 354 Header.HashOffset = 0; 355 Header.MemProfOffset = 0; 356 int N = sizeof(IndexedInstrProf::Header) / sizeof(uint64_t); 357 358 // Only write out all the fields except 'HashOffset' and 'MemProfOffset'. We 359 // need to remember the offset of these fields to allow back patching later. 360 for (int I = 0; I < N - 2; I++) 361 OS.write(reinterpret_cast<uint64_t *>(&Header)[I]); 362 363 // Save the location of Header.HashOffset field in \c OS. 364 uint64_t HashTableStartFieldOffset = OS.tell(); 365 // Reserve the space for HashOffset field. 366 OS.write(0); 367 368 // Save the location of MemProf profile data. This is stored in two parts as 369 // the schema and as a separate on-disk chained hashtable. 370 uint64_t MemProfSectionOffset = OS.tell(); 371 // Reserve space for the MemProf table field to be patched later if this 372 // profile contains memory profile information. 373 OS.write(0); 374 375 // Reserve space to write profile summary data. 376 uint32_t NumEntries = ProfileSummaryBuilder::DefaultCutoffs.size(); 377 uint32_t SummarySize = Summary::getSize(Summary::NumKinds, NumEntries); 378 // Remember the summary offset. 379 uint64_t SummaryOffset = OS.tell(); 380 for (unsigned I = 0; I < SummarySize / sizeof(uint64_t); I++) 381 OS.write(0); 382 uint64_t CSSummaryOffset = 0; 383 uint64_t CSSummarySize = 0; 384 if (static_cast<bool>(ProfileKind & InstrProfKind::ContextSensitive)) { 385 CSSummaryOffset = OS.tell(); 386 CSSummarySize = SummarySize / sizeof(uint64_t); 387 for (unsigned I = 0; I < CSSummarySize; I++) 388 OS.write(0); 389 } 390 391 // Write the hash table. 392 uint64_t HashTableStart = Generator.Emit(OS.OS, *InfoObj); 393 394 // Write the MemProf profile data if we have it. This includes a simple schema 395 // with the format described below followed by the hashtable: 396 // uint64_t Offset = MemProfGenerator.Emit 397 // uint64_t Num schema entries 398 // uint64_t Schema entry 0 399 // uint64_t Schema entry 1 400 // .... 401 // uint64_t Schema entry N - 1 402 // OnDiskChainedHashTable MemProfFunctionData 403 uint64_t MemProfSectionStart = 0; 404 if (static_cast<bool>(ProfileKind & InstrProfKind::MemProf)) { 405 MemProfSectionStart = OS.tell(); 406 OS.write(0ULL); // Reserve space for the offset. 407 408 auto Schema = memprof::PortableMemInfoBlock::getSchema(); 409 OS.write(static_cast<uint64_t>(Schema.size())); 410 for (const auto Id : Schema) { 411 OS.write(static_cast<uint64_t>(Id)); 412 } 413 414 auto MemProfWriter = std::make_unique<memprof::MemProfRecordWriterTrait>(); 415 MemProfWriter->Schema = &Schema; 416 OnDiskChainedHashTableGenerator<memprof::MemProfRecordWriterTrait> 417 MemProfGenerator; 418 for (const auto &I : MemProfData) { 419 // Insert the key (func hash) and value (vector of memprof records). 420 MemProfGenerator.insert(I.first, I.second); 421 } 422 423 uint64_t TableOffset = MemProfGenerator.Emit(OS.OS, *MemProfWriter); 424 PatchItem PatchItems[] = { 425 {MemProfSectionStart, &TableOffset, 1}, 426 }; 427 OS.patch(PatchItems, 1); 428 } 429 430 // Allocate space for data to be serialized out. 431 std::unique_ptr<IndexedInstrProf::Summary> TheSummary = 432 IndexedInstrProf::allocSummary(SummarySize); 433 // Compute the Summary and copy the data to the data 434 // structure to be serialized out (to disk or buffer). 435 std::unique_ptr<ProfileSummary> PS = ISB.getSummary(); 436 setSummary(TheSummary.get(), *PS); 437 InfoObj->SummaryBuilder = nullptr; 438 439 // For Context Sensitive summary. 440 std::unique_ptr<IndexedInstrProf::Summary> TheCSSummary = nullptr; 441 if (static_cast<bool>(ProfileKind & InstrProfKind::ContextSensitive)) { 442 TheCSSummary = IndexedInstrProf::allocSummary(SummarySize); 443 std::unique_ptr<ProfileSummary> CSPS = CSISB.getSummary(); 444 setSummary(TheCSSummary.get(), *CSPS); 445 } 446 InfoObj->CSSummaryBuilder = nullptr; 447 448 // Now do the final patch: 449 PatchItem PatchItems[] = { 450 // Patch the Header.HashOffset field. 451 {HashTableStartFieldOffset, &HashTableStart, 1}, 452 // Patch the Header.MemProfOffset (=0 for profiles without MemProf data). 453 {MemProfSectionOffset, &MemProfSectionStart, 1}, 454 // Patch the summary data. 455 {SummaryOffset, reinterpret_cast<uint64_t *>(TheSummary.get()), 456 (int)(SummarySize / sizeof(uint64_t))}, 457 {CSSummaryOffset, reinterpret_cast<uint64_t *>(TheCSSummary.get()), 458 (int)CSSummarySize}}; 459 460 OS.patch(PatchItems, sizeof(PatchItems) / sizeof(*PatchItems)); 461 462 for (const auto &I : FunctionData) 463 for (const auto &F : I.getValue()) 464 if (Error E = validateRecord(F.second)) 465 return E; 466 467 return Error::success(); 468 } 469 470 Error InstrProfWriter::write(raw_fd_ostream &OS) { 471 // Write the hash table. 472 ProfOStream POS(OS); 473 return writeImpl(POS); 474 } 475 476 std::unique_ptr<MemoryBuffer> InstrProfWriter::writeBuffer() { 477 std::string Data; 478 raw_string_ostream OS(Data); 479 ProfOStream POS(OS); 480 // Write the hash table. 481 if (Error E = writeImpl(POS)) 482 return nullptr; 483 // Return this in an aligned memory buffer. 484 return MemoryBuffer::getMemBufferCopy(Data); 485 } 486 487 static const char *ValueProfKindStr[] = { 488 #define VALUE_PROF_KIND(Enumerator, Value, Descr) #Enumerator, 489 #include "llvm/ProfileData/InstrProfData.inc" 490 }; 491 492 Error InstrProfWriter::validateRecord(const InstrProfRecord &Func) { 493 for (uint32_t VK = 0; VK <= IPVK_Last; VK++) { 494 uint32_t NS = Func.getNumValueSites(VK); 495 if (!NS) 496 continue; 497 for (uint32_t S = 0; S < NS; S++) { 498 uint32_t ND = Func.getNumValueDataForSite(VK, S); 499 std::unique_ptr<InstrProfValueData[]> VD = Func.getValueForSite(VK, S); 500 bool WasZero = false; 501 for (uint32_t I = 0; I < ND; I++) 502 if ((VK != IPVK_IndirectCallTarget) && (VD[I].Value == 0)) { 503 if (WasZero) 504 return make_error<InstrProfError>(instrprof_error::invalid_prof); 505 WasZero = true; 506 } 507 } 508 } 509 510 return Error::success(); 511 } 512 513 void InstrProfWriter::writeRecordInText(StringRef Name, uint64_t Hash, 514 const InstrProfRecord &Func, 515 InstrProfSymtab &Symtab, 516 raw_fd_ostream &OS) { 517 OS << Name << "\n"; 518 OS << "# Func Hash:\n" << Hash << "\n"; 519 OS << "# Num Counters:\n" << Func.Counts.size() << "\n"; 520 OS << "# Counter Values:\n"; 521 for (uint64_t Count : Func.Counts) 522 OS << Count << "\n"; 523 524 uint32_t NumValueKinds = Func.getNumValueKinds(); 525 if (!NumValueKinds) { 526 OS << "\n"; 527 return; 528 } 529 530 OS << "# Num Value Kinds:\n" << Func.getNumValueKinds() << "\n"; 531 for (uint32_t VK = 0; VK < IPVK_Last + 1; VK++) { 532 uint32_t NS = Func.getNumValueSites(VK); 533 if (!NS) 534 continue; 535 OS << "# ValueKind = " << ValueProfKindStr[VK] << ":\n" << VK << "\n"; 536 OS << "# NumValueSites:\n" << NS << "\n"; 537 for (uint32_t S = 0; S < NS; S++) { 538 uint32_t ND = Func.getNumValueDataForSite(VK, S); 539 OS << ND << "\n"; 540 std::unique_ptr<InstrProfValueData[]> VD = Func.getValueForSite(VK, S); 541 for (uint32_t I = 0; I < ND; I++) { 542 if (VK == IPVK_IndirectCallTarget) 543 OS << Symtab.getFuncNameOrExternalSymbol(VD[I].Value) << ":" 544 << VD[I].Count << "\n"; 545 else 546 OS << VD[I].Value << ":" << VD[I].Count << "\n"; 547 } 548 } 549 } 550 551 OS << "\n"; 552 } 553 554 Error InstrProfWriter::writeText(raw_fd_ostream &OS) { 555 // Check CS first since it implies an IR level profile. 556 if (static_cast<bool>(ProfileKind & InstrProfKind::ContextSensitive)) 557 OS << "# CSIR level Instrumentation Flag\n:csir\n"; 558 else if (static_cast<bool>(ProfileKind & InstrProfKind::IRInstrumentation)) 559 OS << "# IR level Instrumentation Flag\n:ir\n"; 560 561 if (static_cast<bool>(ProfileKind & 562 InstrProfKind::FunctionEntryInstrumentation)) 563 OS << "# Always instrument the function entry block\n:entry_first\n"; 564 InstrProfSymtab Symtab; 565 566 using FuncPair = detail::DenseMapPair<uint64_t, InstrProfRecord>; 567 using RecordType = std::pair<StringRef, FuncPair>; 568 SmallVector<RecordType, 4> OrderedFuncData; 569 570 for (const auto &I : FunctionData) { 571 if (shouldEncodeData(I.getValue())) { 572 if (Error E = Symtab.addFuncName(I.getKey())) 573 return E; 574 for (const auto &Func : I.getValue()) 575 OrderedFuncData.push_back(std::make_pair(I.getKey(), Func)); 576 } 577 } 578 579 llvm::sort(OrderedFuncData, [](const RecordType &A, const RecordType &B) { 580 return std::tie(A.first, A.second.first) < 581 std::tie(B.first, B.second.first); 582 }); 583 584 for (const auto &record : OrderedFuncData) { 585 const StringRef &Name = record.first; 586 const FuncPair &Func = record.second; 587 writeRecordInText(Name, Func.first, Func.second, Symtab, OS); 588 } 589 590 for (const auto &record : OrderedFuncData) { 591 const FuncPair &Func = record.second; 592 if (Error E = validateRecord(Func.second)) 593 return E; 594 } 595 596 return Error::success(); 597 } 598