File Manager

003 File Manager

Current Path: /usr/src/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView

usr / src / contrib / llvm-project / llvm / include / llvm / DebugInfo / CodeView /

📁 ..
📄 AppendingTypeTableBuilder.h(2.24 KB)
📄 CVRecord.h(4.16 KB)
📄 CVSymbolVisitor.h(1.23 KB)
📄 CVTypeVisitor.h(2.19 KB)
📄 CodeView.h(17.73 KB)
📄 CodeViewError.h(1.46 KB)
📄 CodeViewRecordIO.h(7.83 KB)
📄 CodeViewRegisters.def(16.43 KB)
📄 CodeViewSymbols.def(9.57 KB)
📄 CodeViewTypes.def(7.58 KB)
📄 ContinuationRecordBuilder.h(2.14 KB)
📄 DebugChecksumsSubsection.h(3.06 KB)
📄 DebugCrossExSubsection.h(2.1 KB)
📄 DebugCrossImpSubsection.h(2.76 KB)
📄 DebugFrameDataSubsection.h(2.02 KB)
📄 DebugInlineeLinesSubsection.h(3.86 KB)
📄 DebugLinesSubsection.h(4.77 KB)
📄 DebugStringTableSubsection.h(2.92 KB)
📄 DebugSubsection.h(1.43 KB)
📄 DebugSubsectionRecord.h(3.09 KB)
📄 DebugSubsectionVisitor.h(4.28 KB)
📄 DebugSymbolRVASubsection.h(1.83 KB)
📄 DebugSymbolsSubsection.h(1.6 KB)
📄 DebugUnknownSubsection.h(925 B)
📄 EnumTables.h(2.32 KB)
📄 Formatters.h(1.94 KB)
📄 FunctionId.h(1.34 KB)
📄 GUID.h(1.34 KB)
📄 GlobalTypeTableBuilder.h(4.39 KB)
📄 LazyRandomTypeCollection.h(4.64 KB)
📄 Line.h(3.57 KB)
📄 MergingTypeTableBuilder.h(2.71 KB)
📄 RecordName.h(809 B)
📄 RecordSerialization.h(7.07 KB)
📄 SimpleTypeSerializer.h(1.24 KB)
📄 StringsAndChecksums.h(3.92 KB)
📄 SymbolDeserializer.h(3.47 KB)
📄 SymbolDumpDelegate.h(1.18 KB)
📄 SymbolDumper.h(2.05 KB)
📄 SymbolRecord.h(27.67 KB)
📄 SymbolRecordHelpers.h(1.78 KB)
📄 SymbolRecordMapping.h(1.52 KB)
📄 SymbolSerializer.h(2.99 KB)
📄 SymbolVisitorCallbackPipeline.h(2.58 KB)
📄 SymbolVisitorCallbacks.h(1.81 KB)
📄 SymbolVisitorDelegate.h(1.02 KB)
📄 TypeCollection.h(1.35 KB)
📄 TypeDeserializer.h(5.47 KB)
📄 TypeDumpVisitor.h(3.26 KB)
📄 TypeHashing.h(8.75 KB)
📄 TypeIndex.h(9.64 KB)
📄 TypeIndexDiscovery.h(1.71 KB)
📄 TypeRecord.h(31.56 KB)
📄 TypeRecordHelpers.h(1.47 KB)
📄 TypeRecordMapping.h(1.97 KB)
📄 TypeStreamMerger.h(4.51 KB)
📄 TypeSymbolEmitter.h(884 B)
📄 TypeTableCollection.h(1.25 KB)
📄 TypeVisitorCallbackPipeline.h(3.74 KB)
📄 TypeVisitorCallbacks.h(2.67 KB)

Editing: LazyRandomTypeCollection.h

//===- LazyRandomTypeCollection.h -------------------------------*- 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
//
//===----------------------------------------------------------------------===//

#ifndef LLVM_DEBUGINFO_CODEVIEW_LAZYRANDOMTYPECOLLECTION_H
#define LLVM_DEBUGINFO_CODEVIEW_LAZYRANDOMTYPECOLLECTION_H

#include "llvm/ADT/ArrayRef.h"
#include "llvm/ADT/Optional.h"
#include "llvm/ADT/StringRef.h"
#include "llvm/DebugInfo/CodeView/TypeCollection.h"
#include "llvm/DebugInfo/CodeView/TypeIndex.h"
#include "llvm/DebugInfo/CodeView/TypeRecord.h"
#include "llvm/Support/Allocator.h"
#include "llvm/Support/BinaryStreamArray.h"
#include "llvm/Support/Error.h"
#include "llvm/Support/StringSaver.h"
#include <cstdint>
#include <vector>

namespace llvm {
namespace codeview {

/// Provides amortized O(1) random access to a CodeView type stream.
/// Normally to access a type from a type stream, you must know its byte
/// offset into the type stream, because type records are variable-lengthed.
/// However, this is not the way we prefer to access them.  For example, given
/// a symbol record one of the fields may be the TypeIndex of the symbol's
/// type record.  Or given a type record such as an array type, there might
/// be a TypeIndex for the element type.  Sequential access is perfect when
/// we're just dumping every entry, but it's very poor for real world usage.
///
/// Type streams in PDBs contain an additional field which is a list of pairs
/// containing indices and their corresponding offsets, roughly every ~8KB of
/// record data.  This general idea need not be confined to PDBs though.  By
/// supplying such an array, the producer of a type stream can allow the
/// consumer much better access time, because the consumer can find the nearest
/// index in this array, and do a linear scan forward only from there.
///
/// LazyRandomTypeCollection implements this algorithm, but additionally goes
/// one step further by caching offsets of every record that has been visited at
/// least once.  This way, even repeated visits of the same record will never
/// require more than one linear scan.  For a type stream of N elements divided
/// into M chunks of roughly equal size, this yields a worst case lookup time
/// of O(N/M) and an amortized time of O(1).
class LazyRandomTypeCollection : public TypeCollection {
  using PartialOffsetArray = FixedStreamArray<TypeIndexOffset>;

struct CacheEntry {
    CVType Type;
    uint32_t Offset;
    StringRef Name;
  };

public:
  explicit LazyRandomTypeCollection(uint32_t RecordCountHint);
  LazyRandomTypeCollection(StringRef Data, uint32_t RecordCountHint);
  LazyRandomTypeCollection(ArrayRef<uint8_t> Data, uint32_t RecordCountHint);
  LazyRandomTypeCollection(const CVTypeArray &Types, uint32_t RecordCountHint,
                           PartialOffsetArray PartialOffsets);
  LazyRandomTypeCollection(const CVTypeArray &Types, uint32_t RecordCountHint);

void reset(ArrayRef<uint8_t> Data, uint32_t RecordCountHint);
  void reset(StringRef Data, uint32_t RecordCountHint);
  void reset(BinaryStreamReader &Reader, uint32_t RecordCountHint);

uint32_t getOffsetOfType(TypeIndex Index);

Optional<CVType> tryGetType(TypeIndex Index);

CVType getType(TypeIndex Index) override;
  StringRef getTypeName(TypeIndex Index) override;
  bool contains(TypeIndex Index) override;
  uint32_t size() override;
  uint32_t capacity() override;
  Optional<TypeIndex> getFirst() override;
  Optional<TypeIndex> getNext(TypeIndex Prev) override;
  bool replaceType(TypeIndex &Index, CVType Data, bool Stabilize) override;

private:
  Error ensureTypeExists(TypeIndex Index);
  void ensureCapacityFor(TypeIndex Index);

Error visitRangeForType(TypeIndex TI);
  Error fullScanForType(TypeIndex TI);
  void visitRange(TypeIndex Begin, uint32_t BeginOffset, TypeIndex End);

/// Number of actual records.
  uint32_t Count = 0;

/// The largest type index which we've visited.
  TypeIndex LargestTypeIndex = TypeIndex::None();

BumpPtrAllocator Allocator;
  StringSaver NameStorage;

/// The type array to allow random access visitation of.
  CVTypeArray Types;

std::vector<CacheEntry> Records;

/// An array of index offsets for the given type stream, allowing log(N)
  /// lookups of a type record by index.  Similar to KnownOffsets but only
  /// contains offsets for some type indices, some of which may not have
  /// ever been visited.
  PartialOffsetArray PartialOffsets;
};

} // end namespace codeview
} // end namespace llvm

#endif // LLVM_DEBUGINFO_CODEVIEW_LAZYRANDOMTYPECOLLECTION_H

003 File Manager

Editing: LazyRandomTypeCollection.h

Upload File

Create Folder