diff options
| author | shadchin <[email protected]> | 2022-02-10 16:44:39 +0300 |
|---|---|---|
| committer | Daniil Cherednik <[email protected]> | 2022-02-10 16:44:39 +0300 |
| commit | e9656aae26e0358d5378e5b63dcac5c8dbe0e4d0 (patch) | |
| tree | 64175d5cadab313b3e7039ebaa06c5bc3295e274 /contrib/libs/llvm12/lib/DebugInfo/CodeView | |
| parent | 2598ef1d0aee359b4b6d5fdd1758916d5907d04f (diff) | |
Restoring authorship annotation for <[email protected]>. Commit 2 of 2.
Diffstat (limited to 'contrib/libs/llvm12/lib/DebugInfo/CodeView')
9 files changed, 32 insertions, 32 deletions
diff --git a/contrib/libs/llvm12/lib/DebugInfo/CodeView/DebugFrameDataSubsection.cpp b/contrib/libs/llvm12/lib/DebugInfo/CodeView/DebugFrameDataSubsection.cpp index 2e029feb5e5..9bc69abea10 100644 --- a/contrib/libs/llvm12/lib/DebugInfo/CodeView/DebugFrameDataSubsection.cpp +++ b/contrib/libs/llvm12/lib/DebugInfo/CodeView/DebugFrameDataSubsection.cpp @@ -47,9 +47,9 @@ Error DebugFrameDataSubsection::commit(BinaryStreamWriter &Writer) const { } std::vector<FrameData> SortedFrames(Frames.begin(), Frames.end()); - llvm::sort(SortedFrames, [](const FrameData &LHS, const FrameData &RHS) { - return LHS.RvaStart < RHS.RvaStart; - }); + llvm::sort(SortedFrames, [](const FrameData &LHS, const FrameData &RHS) { + return LHS.RvaStart < RHS.RvaStart; + }); if (auto EC = Writer.writeArray(makeArrayRef(SortedFrames))) return EC; return Error::success(); diff --git a/contrib/libs/llvm12/lib/DebugInfo/CodeView/EnumTables.cpp b/contrib/libs/llvm12/lib/DebugInfo/CodeView/EnumTables.cpp index 46bd73b4bc4..949707bf547 100644 --- a/contrib/libs/llvm12/lib/DebugInfo/CodeView/EnumTables.cpp +++ b/contrib/libs/llvm12/lib/DebugInfo/CodeView/EnumTables.cpp @@ -39,14 +39,14 @@ static const EnumEntry<uint16_t> RegisterNames_X86[] = { #undef CV_REGISTERS_X86 }; -static const EnumEntry<uint16_t> RegisterNames_ARM[] = { -#define CV_REGISTERS_ARM -#define CV_REGISTER(name, val) CV_ENUM_CLASS_ENT(RegisterId, name), -#include "llvm/DebugInfo/CodeView/CodeViewRegisters.def" -#undef CV_REGISTER -#undef CV_REGISTERS_ARM -}; - +static const EnumEntry<uint16_t> RegisterNames_ARM[] = { +#define CV_REGISTERS_ARM +#define CV_REGISTER(name, val) CV_ENUM_CLASS_ENT(RegisterId, name), +#include "llvm/DebugInfo/CodeView/CodeViewRegisters.def" +#undef CV_REGISTER +#undef CV_REGISTERS_ARM +}; + static const EnumEntry<uint16_t> RegisterNames_ARM64[] = { #define CV_REGISTERS_ARM64 #define CV_REGISTER(name, val) CV_ENUM_CLASS_ENT(RegisterId, name), @@ -442,9 +442,9 @@ ArrayRef<EnumEntry<TypeLeafKind>> getTypeLeafNames() { } ArrayRef<EnumEntry<uint16_t>> getRegisterNames(CPUType Cpu) { - if (Cpu == CPUType::ARMNT) { - return makeArrayRef(RegisterNames_ARM); - } else if (Cpu == CPUType::ARM64) { + if (Cpu == CPUType::ARMNT) { + return makeArrayRef(RegisterNames_ARM); + } else if (Cpu == CPUType::ARM64) { return makeArrayRef(RegisterNames_ARM64); } return makeArrayRef(RegisterNames_X86); diff --git a/contrib/libs/llvm12/lib/DebugInfo/CodeView/LazyRandomTypeCollection.cpp b/contrib/libs/llvm12/lib/DebugInfo/CodeView/LazyRandomTypeCollection.cpp index d924a5809d4..c0fc3e0ef65 100644 --- a/contrib/libs/llvm12/lib/DebugInfo/CodeView/LazyRandomTypeCollection.cpp +++ b/contrib/libs/llvm12/lib/DebugInfo/CodeView/LazyRandomTypeCollection.cpp @@ -172,10 +172,10 @@ Error LazyRandomTypeCollection::visitRangeForType(TypeIndex TI) { if (PartialOffsets.empty()) return fullScanForType(TI); - auto Next = llvm::upper_bound(PartialOffsets, TI, - [](TypeIndex Value, const TypeIndexOffset &IO) { - return Value < IO.Type; - }); + auto Next = llvm::upper_bound(PartialOffsets, TI, + [](TypeIndex Value, const TypeIndexOffset &IO) { + return Value < IO.Type; + }); assert(Next != PartialOffsets.begin()); auto Prev = std::prev(Next); @@ -185,7 +185,7 @@ Error LazyRandomTypeCollection::visitRangeForType(TypeIndex TI) { // They've asked us to fetch a type index, but the entry we found in the // partial offsets array has already been visited. Since we visit an entire // block every time, that means this record should have been previously - // discovered. Ultimately, this means this is a request for a non-existent + // discovered. Ultimately, this means this is a request for a non-existent // type index. return make_error<CodeViewError>("Invalid type index"); } diff --git a/contrib/libs/llvm12/lib/DebugInfo/CodeView/RecordName.cpp b/contrib/libs/llvm12/lib/DebugInfo/CodeView/RecordName.cpp index 80c3408491e..1ca899789be 100644 --- a/contrib/libs/llvm12/lib/DebugInfo/CodeView/RecordName.cpp +++ b/contrib/libs/llvm12/lib/DebugInfo/CodeView/RecordName.cpp @@ -9,7 +9,7 @@ #include "llvm/DebugInfo/CodeView/RecordName.h" #include "llvm/ADT/SmallString.h" -#include "llvm/ADT/StringExtras.h" +#include "llvm/ADT/StringExtras.h" #include "llvm/DebugInfo/CodeView/CVSymbolVisitor.h" #include "llvm/DebugInfo/CodeView/CVTypeVisitor.h" #include "llvm/DebugInfo/CodeView/SymbolRecordMapping.h" @@ -78,10 +78,10 @@ Error TypeNameComputer::visitKnownRecord(CVType &CVR, ArgListRecord &Args) { uint32_t Size = Indices.size(); Name = "("; for (uint32_t I = 0; I < Size; ++I) { - if (Indices[I] < CurrentTypeIndex) - Name.append(Types.getTypeName(Indices[I])); - else - Name.append("<unknown 0x" + utohexstr(Indices[I].getIndex()) + ">"); + if (Indices[I] < CurrentTypeIndex) + Name.append(Types.getTypeName(Indices[I])); + else + Name.append("<unknown 0x" + utohexstr(Indices[I].getIndex()) + ">"); if (I + 1 != Size) Name.append(", "); } diff --git a/contrib/libs/llvm12/lib/DebugInfo/CodeView/RecordSerialization.cpp b/contrib/libs/llvm12/lib/DebugInfo/CodeView/RecordSerialization.cpp index 68a2a7b7153..63ce302a4e0 100644 --- a/contrib/libs/llvm12/lib/DebugInfo/CodeView/RecordSerialization.cpp +++ b/contrib/libs/llvm12/lib/DebugInfo/CodeView/RecordSerialization.cpp @@ -34,7 +34,7 @@ StringRef llvm::codeview::getBytesAsCString(ArrayRef<uint8_t> LeafData) { } Error llvm::codeview::consume(BinaryStreamReader &Reader, APSInt &Num) { - // Used to avoid overload ambiguity on APInt constructor. + // Used to avoid overload ambiguity on APInt constructor. bool FalseVal = false; uint16_t Short; if (auto EC = Reader.readInteger(Short)) diff --git a/contrib/libs/llvm12/lib/DebugInfo/CodeView/TypeIndexDiscovery.cpp b/contrib/libs/llvm12/lib/DebugInfo/CodeView/TypeIndexDiscovery.cpp index a8af5419e76..682747a2b81 100644 --- a/contrib/libs/llvm12/lib/DebugInfo/CodeView/TypeIndexDiscovery.cpp +++ b/contrib/libs/llvm12/lib/DebugInfo/CodeView/TypeIndexDiscovery.cpp @@ -5,9 +5,9 @@ // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// - + #include "llvm/DebugInfo/CodeView/TypeIndexDiscovery.h" -#include "llvm/DebugInfo/CodeView/TypeRecord.h" +#include "llvm/DebugInfo/CodeView/TypeRecord.h" #include "llvm/ADT/ArrayRef.h" #include "llvm/Support/Endian.h" diff --git a/contrib/libs/llvm12/lib/DebugInfo/CodeView/TypeRecordMapping.cpp b/contrib/libs/llvm12/lib/DebugInfo/CodeView/TypeRecordMapping.cpp index b049252f09e..7ac37615614 100644 --- a/contrib/libs/llvm12/lib/DebugInfo/CodeView/TypeRecordMapping.cpp +++ b/contrib/libs/llvm12/lib/DebugInfo/CodeView/TypeRecordMapping.cpp @@ -232,7 +232,7 @@ Error TypeRecordMapping::visitMemberBegin(CVMemberRecord &Record) { // The largest possible subrecord is one in which there is a record prefix, // followed by the subrecord, followed by a continuation, and that entire - // sequence spawns `MaxRecordLength` bytes. So the record's length is + // sequence spawns `MaxRecordLength` bytes. So the record's length is // calculated as follows. constexpr uint32_t ContinuationLength = 8; diff --git a/contrib/libs/llvm12/lib/DebugInfo/CodeView/TypeStreamMerger.cpp b/contrib/libs/llvm12/lib/DebugInfo/CodeView/TypeStreamMerger.cpp index 52c8621738f..587a68142a4 100644 --- a/contrib/libs/llvm12/lib/DebugInfo/CodeView/TypeStreamMerger.cpp +++ b/contrib/libs/llvm12/lib/DebugInfo/CodeView/TypeStreamMerger.cpp @@ -38,7 +38,7 @@ namespace { /// 0x1000. /// /// Type records are only allowed to use type indices smaller than their own, so -/// a type stream is effectively a topologically sorted DAG. Cycles occurring in +/// a type stream is effectively a topologically sorted DAG. Cycles occurring in /// the type graph of the source program are resolved with forward declarations /// of composite types. This class implements the following type stream merging /// algorithm, which relies on this DAG structure: diff --git a/contrib/libs/llvm12/lib/DebugInfo/CodeView/ya.make b/contrib/libs/llvm12/lib/DebugInfo/CodeView/ya.make index 000c00e8e9f..8829a8f09f5 100644 --- a/contrib/libs/llvm12/lib/DebugInfo/CodeView/ya.make +++ b/contrib/libs/llvm12/lib/DebugInfo/CodeView/ya.make @@ -12,9 +12,9 @@ LICENSE(Apache-2.0 WITH LLVM-exception) LICENSE_TEXTS(.yandex_meta/licenses.list.txt) PEERDIR( - contrib/libs/llvm12 - contrib/libs/llvm12/lib/DebugInfo/MSF - contrib/libs/llvm12/lib/Support + contrib/libs/llvm12 + contrib/libs/llvm12/lib/DebugInfo/MSF + contrib/libs/llvm12/lib/Support ) ADDINCL( |
