003 File Manager
Current Path:
/usr/src/contrib/llvm-project/llvm/lib/DebugInfo/CodeView
usr
/
src
/
contrib
/
llvm-project
/
llvm
/
lib
/
DebugInfo
/
CodeView
/
📁
..
📄
AppendingTypeTableBuilder.cpp
(3.51 KB)
📄
CVSymbolVisitor.cpp
(2.78 KB)
📄
CVTypeVisitor.cpp
(9.14 KB)
📄
CodeViewError.cpp
(1.89 KB)
📄
CodeViewRecordIO.cpp
(11.73 KB)
📄
ContinuationRecordBuilder.cpp
(9.18 KB)
📄
DebugChecksumsSubsection.cpp
(3.89 KB)
📄
DebugCrossExSubsection.cpp
(1.74 KB)
📄
DebugCrossImpSubsection.cpp
(3.29 KB)
📄
DebugFrameDataSubsection.cpp
(2.02 KB)
📄
DebugInlineeLinesSubsection.cpp
(3.85 KB)
📄
DebugLinesSubsection.cpp
(5.52 KB)
📄
DebugStringTableSubsection.cpp
(3.21 KB)
📄
DebugSubsection.cpp
(538 B)
📄
DebugSubsectionRecord.cpp
(3.4 KB)
📄
DebugSubsectionVisitor.cpp
(3.34 KB)
📄
DebugSymbolRVASubsection.cpp
(1.28 KB)
📄
DebugSymbolsSubsection.cpp
(1.02 KB)
📄
EnumTables.cpp
(21.1 KB)
📄
Formatters.cpp
(1.47 KB)
📄
GlobalTypeTableBuilder.cpp
(4.43 KB)
📄
LazyRandomTypeCollection.cpp
(8.94 KB)
📄
Line.cpp
(748 B)
📄
MergingTypeTableBuilder.cpp
(4.81 KB)
📄
RecordName.cpp
(10.4 KB)
📄
RecordSerialization.cpp
(4.86 KB)
📄
SimpleTypeSerializer.cpp
(2.4 KB)
📄
StringsAndChecksums.cpp
(2.58 KB)
📄
SymbolDumper.cpp
(25.61 KB)
📄
SymbolRecordHelpers.cpp
(2.82 KB)
📄
SymbolRecordMapping.cpp
(16.92 KB)
📄
SymbolSerializer.cpp
(1.83 KB)
📄
TypeDumpVisitor.cpp
(21.43 KB)
📄
TypeHashing.cpp
(3.03 KB)
📄
TypeIndex.cpp
(3.84 KB)
📄
TypeIndexDiscovery.cpp
(16.54 KB)
📄
TypeRecordHelpers.cpp
(1.59 KB)
📄
TypeRecordMapping.cpp
(24.67 KB)
📄
TypeStreamMerger.cpp
(18.42 KB)
📄
TypeTableCollection.cpp
(1.96 KB)
Editing: TypeHashing.cpp
//===- TypeHashing.cpp -------------------------------------------*- C++-*-===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// #include "llvm/DebugInfo/CodeView/TypeHashing.h" #include "llvm/DebugInfo/CodeView/TypeIndexDiscovery.h" #include "llvm/Support/SHA1.h" using namespace llvm; using namespace llvm::codeview; LocallyHashedType DenseMapInfo<LocallyHashedType>::Empty{0, {}}; LocallyHashedType DenseMapInfo<LocallyHashedType>::Tombstone{hash_code(-1), {}}; static std::array<uint8_t, 8> EmptyHash = { {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}}; static std::array<uint8_t, 8> TombstoneHash = { {0xFF, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}}; GloballyHashedType DenseMapInfo<GloballyHashedType>::Empty{EmptyHash}; GloballyHashedType DenseMapInfo<GloballyHashedType>::Tombstone{TombstoneHash}; LocallyHashedType LocallyHashedType::hashType(ArrayRef<uint8_t> RecordData) { return {llvm::hash_value(RecordData), RecordData}; } GloballyHashedType GloballyHashedType::hashType(ArrayRef<uint8_t> RecordData, ArrayRef<GloballyHashedType> PreviousTypes, ArrayRef<GloballyHashedType> PreviousIds) { SmallVector<TiReference, 4> Refs; discoverTypeIndices(RecordData, Refs); SHA1 S; S.init(); uint32_t Off = 0; S.update(RecordData.take_front(sizeof(RecordPrefix))); RecordData = RecordData.drop_front(sizeof(RecordPrefix)); for (const auto &Ref : Refs) { // Hash any data that comes before this TiRef. uint32_t PreLen = Ref.Offset - Off; ArrayRef<uint8_t> PreData = RecordData.slice(Off, PreLen); S.update(PreData); auto Prev = (Ref.Kind == TiRefKind::IndexRef) ? PreviousIds : PreviousTypes; auto RefData = RecordData.slice(Ref.Offset, Ref.Count * sizeof(TypeIndex)); // For each type index referenced, add in the previously computed hash // value of that type. ArrayRef<TypeIndex> Indices( reinterpret_cast<const TypeIndex *>(RefData.data()), Ref.Count); for (TypeIndex TI : Indices) { ArrayRef<uint8_t> BytesToHash; if (TI.isSimple() || TI.isNoneType()) { const uint8_t *IndexBytes = reinterpret_cast<const uint8_t *>(&TI); BytesToHash = makeArrayRef(IndexBytes, sizeof(TypeIndex)); } else { if (TI.toArrayIndex() >= Prev.size() || Prev[TI.toArrayIndex()].empty()) { // There are references to yet-unhashed records. Suspend hashing for // this record until all the other records are processed. return {}; } BytesToHash = Prev[TI.toArrayIndex()].Hash; } S.update(BytesToHash); } Off = Ref.Offset + Ref.Count * sizeof(TypeIndex); } // Don't forget to add in any trailing bytes. auto TrailingBytes = RecordData.drop_front(Off); S.update(TrailingBytes); return {S.final().take_back(8)}; }
Upload File
Create Folder