clang -cc1 -cc1 -triple amd64-unknown-openbsd7.0 -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name TestModuleFileExtension.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model static -mframe-pointer=all -relaxed-aliasing -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/usr/src/gnu/usr.bin/clang/libclangFrontend/obj -resource-dir /usr/local/lib/clang/13.0.0 -I /usr/src/gnu/usr.bin/clang/libclangFrontend/../../../llvm/clang/include -I /usr/src/gnu/usr.bin/clang/libclangFrontend/../../../llvm/llvm/include -I /usr/src/gnu/usr.bin/clang/libclangFrontend/../include -I /usr/src/gnu/usr.bin/clang/libclangFrontend/obj -I /usr/src/gnu/usr.bin/clang/libclangFrontend/obj/../include -D NDEBUG -D __STDC_LIMIT_MACROS -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D LLVM_PREFIX="/usr" -internal-isystem /usr/include/c++/v1 -internal-isystem /usr/local/lib/clang/13.0.0/include -internal-externc-isystem /usr/include -O2 -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-comment -std=c++14 -fdeprecated-macro -fdebug-compilation-dir=/usr/src/gnu/usr.bin/clang/libclangFrontend/obj -ferror-limit 19 -fvisibility-inlines-hidden -fwrapv -stack-protector 2 -fno-rtti -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -fno-builtin-malloc -fno-builtin-calloc -fno-builtin-realloc -fno-builtin-valloc -fno-builtin-free -fno-builtin-strdup -fno-builtin-strndup -analyzer-output=html -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /home/ben/Projects/vmm/scan-build/2022-01-12-194120-40624-1 -x c++ /usr/src/gnu/usr.bin/clang/libclangFrontend/../../../llvm/clang/lib/Frontend/TestModuleFileExtension.cpp
| 1 | |
| 2 | |
| 3 | |
| 4 | |
| 5 | |
| 6 | |
| 7 | |
| 8 | #include "TestModuleFileExtension.h" |
| 9 | #include "clang/Frontend/FrontendDiagnostic.h" |
| 10 | #include "clang/Serialization/ASTReader.h" |
| 11 | #include "llvm/ADT/Hashing.h" |
| 12 | #include "llvm/Bitstream/BitstreamWriter.h" |
| 13 | #include "llvm/Support/raw_ostream.h" |
| 14 | #include <cstdio> |
| 15 | using namespace clang; |
| 16 | using namespace clang::serialization; |
| 17 | |
| 18 | char TestModuleFileExtension::ID = 0; |
| 19 | |
| 20 | TestModuleFileExtension::Writer::~Writer() { } |
| 21 | |
| 22 | void TestModuleFileExtension::Writer::writeExtensionContents( |
| 23 | Sema &SemaRef, |
| 24 | llvm::BitstreamWriter &Stream) { |
| 25 | using namespace llvm; |
| 26 | |
| 27 | |
| 28 | auto Abv = std::make_shared<llvm::BitCodeAbbrev>(); |
| 29 | Abv->Add(BitCodeAbbrevOp(FIRST_EXTENSION_RECORD_ID)); |
| 30 | Abv->Add(BitCodeAbbrevOp(BitCodeAbbrevOp::VBR, 6)); |
| 31 | Abv->Add(BitCodeAbbrevOp(BitCodeAbbrevOp::Blob)); |
| 32 | auto Abbrev = Stream.EmitAbbrev(std::move(Abv)); |
| 33 | |
| 34 | |
| 35 | SmallString<64> Message; |
| 36 | { |
| 37 | auto Ext = static_cast<TestModuleFileExtension *>(getExtension()); |
| 38 | raw_svector_ostream OS(Message); |
| 39 | OS << "Hello from " << Ext->BlockName << " v" << Ext->MajorVersion << "." |
| 40 | << Ext->MinorVersion; |
| 41 | } |
| 42 | uint64_t Record[] = {FIRST_EXTENSION_RECORD_ID, Message.size()}; |
| 43 | Stream.EmitRecordWithBlob(Abbrev, Record, Message); |
| 44 | } |
| 45 | |
| 46 | TestModuleFileExtension::Reader::Reader(ModuleFileExtension *Ext, |
| 47 | const llvm::BitstreamCursor &InStream) |
| 48 | : ModuleFileExtensionReader(Ext), Stream(InStream) |
| 49 | { |
| 50 | |
| 51 | SmallVector<uint64_t, 4> Record; |
| 52 | while (true) { |
| 3 | | Loop condition is true. Entering loop body | |
|
| 53 | llvm::Expected<llvm::BitstreamEntry> MaybeEntry = |
| 54 | Stream.advanceSkippingSubblocks(); |
| 4 | | Calling 'BitstreamCursor::advanceSkippingSubblocks' | |
|
| 55 | if (!MaybeEntry) |
| 56 | (void)MaybeEntry.takeError(); |
| 57 | llvm::BitstreamEntry Entry = MaybeEntry.get(); |
| 58 | |
| 59 | switch (Entry.Kind) { |
| 60 | case llvm::BitstreamEntry::SubBlock: |
| 61 | case llvm::BitstreamEntry::EndBlock: |
| 62 | case llvm::BitstreamEntry::Error: |
| 63 | return; |
| 64 | |
| 65 | case llvm::BitstreamEntry::Record: |
| 66 | break; |
| 67 | } |
| 68 | |
| 69 | Record.clear(); |
| 70 | StringRef Blob; |
| 71 | Expected<unsigned> MaybeRecCode = |
| 72 | Stream.readRecord(Entry.ID, Record, &Blob); |
| 73 | if (!MaybeRecCode) |
| 74 | fprintf(stderr, "Failed reading rec code: %s\n", |
| 75 | toString(MaybeRecCode.takeError()).c_str()); |
| 76 | switch (MaybeRecCode.get()) { |
| 77 | case FIRST_EXTENSION_RECORD_ID: { |
| 78 | StringRef Message = Blob.substr(0, Record[0]); |
| 79 | fprintf(stderr, "Read extension block message: %s\n", |
| 80 | Message.str().c_str()); |
| 81 | break; |
| 82 | } |
| 83 | } |
| 84 | } |
| 85 | } |
| 86 | |
| 87 | TestModuleFileExtension::Reader::~Reader() { } |
| 88 | |
| 89 | TestModuleFileExtension::~TestModuleFileExtension() { } |
| 90 | |
| 91 | ModuleFileExtensionMetadata |
| 92 | TestModuleFileExtension::getExtensionMetadata() const { |
| 93 | return { BlockName, MajorVersion, MinorVersion, UserInfo }; |
| 94 | } |
| 95 | |
| 96 | llvm::hash_code TestModuleFileExtension::hashExtension( |
| 97 | llvm::hash_code Code) const { |
| 98 | if (Hashed) { |
| 99 | Code = llvm::hash_combine(Code, BlockName); |
| 100 | Code = llvm::hash_combine(Code, MajorVersion); |
| 101 | Code = llvm::hash_combine(Code, MinorVersion); |
| 102 | Code = llvm::hash_combine(Code, UserInfo); |
| 103 | } |
| 104 | |
| 105 | return Code; |
| 106 | } |
| 107 | |
| 108 | std::unique_ptr<ModuleFileExtensionWriter> |
| 109 | TestModuleFileExtension::createExtensionWriter(ASTWriter &) { |
| 110 | return std::unique_ptr<ModuleFileExtensionWriter>(new Writer(this)); |
| 111 | } |
| 112 | |
| 113 | std::unique_ptr<ModuleFileExtensionReader> |
| 114 | TestModuleFileExtension::createExtensionReader( |
| 115 | const ModuleFileExtensionMetadata &Metadata, |
| 116 | ASTReader &Reader, serialization::ModuleFile &Mod, |
| 117 | const llvm::BitstreamCursor &Stream) |
| 118 | { |
| 119 | assert(Metadata.BlockName == BlockName && "Wrong block name"); |
| 120 | if (std::make_pair(Metadata.MajorVersion, Metadata.MinorVersion) != |
| |
| 121 | std::make_pair(MajorVersion, MinorVersion)) { |
| 122 | Reader.getDiags().Report(Mod.ImportLoc, |
| 123 | diag::err_test_module_file_extension_version) |
| 124 | << BlockName << Metadata.MajorVersion << Metadata.MinorVersion |
| 125 | << MajorVersion << MinorVersion; |
| 126 | return nullptr; |
| 127 | } |
| 128 | |
| 129 | return std::unique_ptr<ModuleFileExtensionReader>( |
| 130 | new TestModuleFileExtension::Reader(this, Stream)); |
| 2 | | Calling constructor for 'Reader' | |
|
| 131 | } |
| 132 | |
| 133 | std::string TestModuleFileExtension::str() const { |
| 134 | std::string Buffer; |
| 135 | llvm::raw_string_ostream OS(Buffer); |
| 136 | OS << BlockName << ":" << MajorVersion << ":" << MinorVersion << ":" << Hashed |
| 137 | << ":" << UserInfo; |
| 138 | return OS.str(); |
| 139 | } |
| 1 | |
| 2 | |
| 3 | |
| 4 | |
| 5 | |
| 6 | |
| 7 | |
| 8 | |
| 9 | |
| 10 | |
| 11 | |
| 12 | |
| 13 | |
| 14 | #ifndef LLVM_BITSTREAM_BITSTREAMREADER_H |
| 15 | #define LLVM_BITSTREAM_BITSTREAMREADER_H |
| 16 | |
| 17 | #include "llvm/ADT/ArrayRef.h" |
| 18 | #include "llvm/ADT/SmallVector.h" |
| 19 | #include "llvm/Bitstream/BitCodes.h" |
| 20 | #include "llvm/Support/Endian.h" |
| 21 | #include "llvm/Support/Error.h" |
| 22 | #include "llvm/Support/ErrorHandling.h" |
| 23 | #include "llvm/Support/MathExtras.h" |
| 24 | #include "llvm/Support/MemoryBuffer.h" |
| 25 | #include <algorithm> |
| 26 | #include <cassert> |
| 27 | #include <climits> |
| 28 | #include <cstddef> |
| 29 | #include <cstdint> |
| 30 | #include <memory> |
| 31 | #include <string> |
| 32 | #include <utility> |
| 33 | #include <vector> |
| 34 | |
| 35 | namespace llvm { |
| 36 | |
| 37 | |
| 38 | class BitstreamBlockInfo { |
| 39 | public: |
| 40 | |
| 41 | |
| 42 | struct BlockInfo { |
| 43 | unsigned BlockID = 0; |
| 44 | std::vector<std::shared_ptr<BitCodeAbbrev>> Abbrevs; |
| 45 | std::string Name; |
| 46 | std::vector<std::pair<unsigned, std::string>> RecordNames; |
| 47 | }; |
| 48 | |
| 49 | private: |
| 50 | std::vector<BlockInfo> BlockInfoRecords; |
| 51 | |
| 52 | public: |
| 53 | |
| 54 | |
| 55 | const BlockInfo *getBlockInfo(unsigned BlockID) const { |
| 56 | |
| 57 | if (!BlockInfoRecords.empty() && BlockInfoRecords.back().BlockID == BlockID) |
| 58 | return &BlockInfoRecords.back(); |
| 59 | |
| 60 | for (unsigned i = 0, e = static_cast<unsigned>(BlockInfoRecords.size()); |
| 61 | i != e; ++i) |
| 62 | if (BlockInfoRecords[i].BlockID == BlockID) |
| 63 | return &BlockInfoRecords[i]; |
| 64 | return nullptr; |
| 65 | } |
| 66 | |
| 67 | BlockInfo &getOrCreateBlockInfo(unsigned BlockID) { |
| 68 | if (const BlockInfo *BI = getBlockInfo(BlockID)) |
| 69 | return *const_cast<BlockInfo*>(BI); |
| 70 | |
| 71 | |
| 72 | BlockInfoRecords.emplace_back(); |
| 73 | BlockInfoRecords.back().BlockID = BlockID; |
| 74 | return BlockInfoRecords.back(); |
| 75 | } |
| 76 | }; |
| 77 | |
| 78 | |
| 79 | |
| 80 | |
| 81 | class SimpleBitstreamCursor { |
| 82 | ArrayRef<uint8_t> BitcodeBytes; |
| 83 | size_t NextChar = 0; |
| 84 | |
| 85 | public: |
| 86 | |
| 87 | |
| 88 | |
| 89 | |
| 90 | |
| 91 | using word_t = size_t; |
| 92 | |
| 93 | private: |
| 94 | word_t CurWord = 0; |
| 95 | |
| 96 | |
| 97 | |
| 98 | unsigned BitsInCurWord = 0; |
| 99 | |
| 100 | public: |
| 101 | static const constexpr size_t MaxChunkSize = sizeof(word_t) * 8; |
| 102 | |
| 103 | SimpleBitstreamCursor() = default; |
| 104 | explicit SimpleBitstreamCursor(ArrayRef<uint8_t> BitcodeBytes) |
| 105 | : BitcodeBytes(BitcodeBytes) {} |
| 106 | explicit SimpleBitstreamCursor(StringRef BitcodeBytes) |
| 107 | : BitcodeBytes(arrayRefFromStringRef(BitcodeBytes)) {} |
| 108 | explicit SimpleBitstreamCursor(MemoryBufferRef BitcodeBytes) |
| 109 | : SimpleBitstreamCursor(BitcodeBytes.getBuffer()) {} |
| 110 | |
| 111 | bool canSkipToPos(size_t pos) const { |
| 112 | |
| 113 | return pos <= BitcodeBytes.size(); |
| 114 | } |
| 115 | |
| 116 | bool AtEndOfStream() { |
| 117 | return BitsInCurWord == 0 && BitcodeBytes.size() <= NextChar; |
| 118 | } |
| 119 | |
| 120 | |
| 121 | uint64_t GetCurrentBitNo() const { |
| 122 | return NextChar*CHAR_BIT - BitsInCurWord; |
| 123 | } |
| 124 | |
| 125 | |
| 126 | uint64_t getCurrentByteNo() const { return GetCurrentBitNo() / 8; } |
| 127 | |
| 128 | ArrayRef<uint8_t> getBitcodeBytes() const { return BitcodeBytes; } |
| 129 | |
| 130 | |
| 131 | Error JumpToBit(uint64_t BitNo) { |
| 132 | size_t ByteNo = size_t(BitNo/8) & ~(sizeof(word_t)-1); |
| 133 | unsigned WordBitNo = unsigned(BitNo & (sizeof(word_t)*8-1)); |
| 134 | assert(canSkipToPos(ByteNo) && "Invalid location"); |
| 135 | |
| 136 | |
| 137 | NextChar = ByteNo; |
| 138 | BitsInCurWord = 0; |
| 139 | |
| 140 | |
| 141 | if (WordBitNo) { |
| 142 | if (Expected<word_t> Res = Read(WordBitNo)) |
| 143 | return Error::success(); |
| 144 | else |
| 145 | return Res.takeError(); |
| 146 | } |
| 147 | |
| 148 | return Error::success(); |
| 149 | } |
| 150 | |
| 151 | |
| 152 | const uint8_t *getPointerToByte(uint64_t ByteNo, uint64_t NumBytes) { |
| 153 | return BitcodeBytes.data() + ByteNo; |
| 154 | } |
| 155 | |
| 156 | |
| 157 | |
| 158 | |
| 159 | const uint8_t *getPointerToBit(uint64_t BitNo, uint64_t NumBytes) { |
| 160 | assert(!(BitNo % 8) && "Expected bit on byte boundary"); |
| 161 | return getPointerToByte(BitNo / 8, NumBytes); |
| 162 | } |
| 163 | |
| 164 | Error fillCurWord() { |
| 165 | if (NextChar >= BitcodeBytes.size()) |
| 166 | return createStringError(std::errc::io_error, |
| 167 | "Unexpected end of file reading %u of %u bytes", |
| 168 | NextChar, BitcodeBytes.size()); |
| 169 | |
| 170 | |
| 171 | const uint8_t *NextCharPtr = BitcodeBytes.data() + NextChar; |
| 172 | unsigned BytesRead; |
| 173 | if (BitcodeBytes.size() >= NextChar + sizeof(word_t)) { |
| 174 | BytesRead = sizeof(word_t); |
| 175 | CurWord = |
| 176 | support::endian::read<word_t, support::little, support::unaligned>( |
| 177 | NextCharPtr); |
| 178 | } else { |
| 179 | |
| 180 | BytesRead = BitcodeBytes.size() - NextChar; |
| 181 | CurWord = 0; |
| 182 | for (unsigned B = 0; B != BytesRead; ++B) |
| 183 | CurWord |= uint64_t(NextCharPtr[B]) << (B * 8); |
| 184 | } |
| 185 | NextChar += BytesRead; |
| 186 | BitsInCurWord = BytesRead * 8; |
| 187 | return Error::success(); |
| 188 | } |
| 189 | |
| 190 | Expected<word_t> Read(unsigned NumBits) { |
| 191 | static const unsigned BitsInWord = MaxChunkSize; |
| 192 | |
| 193 | assert(NumBits && NumBits <= BitsInWord && |
| 194 | "Cannot return zero or more than BitsInWord bits!"); |
| 195 | |
| 196 | static const unsigned Mask = sizeof(word_t) > 4 ? 0x3f : 0x1f; |
| |
| 197 | |
| 198 | |
| 199 | if (BitsInCurWord >= NumBits) { |
| 12 | | Assuming 'NumBits' is <= field 'BitsInCurWord' | |
|
| |
| 200 | word_t R = CurWord & (~word_t(0) >> (BitsInWord - NumBits)); |
| 14 | | The result of the right shift is undefined due to shifting by '64', which is greater or equal to the width of type 'llvm::SimpleBitstreamCursor::word_t' |
|
| 201 | |
| 202 | |
| 203 | CurWord >>= (NumBits & Mask); |
| 204 | |
| 205 | BitsInCurWord -= NumBits; |
| 206 | return R; |
| 207 | } |
| 208 | |
| 209 | word_t R = BitsInCurWord ? CurWord : 0; |
| 210 | unsigned BitsLeft = NumBits - BitsInCurWord; |
| 211 | |
| 212 | if (Error fillResult = fillCurWord()) |
| 213 | return std::move(fillResult); |
| 214 | |
| 215 | |
| 216 | if (BitsLeft > BitsInCurWord) |
| 217 | return createStringError(std::errc::io_error, |
| 218 | "Unexpected end of file reading %u of %u bits", |
| 219 | BitsInCurWord, BitsLeft); |
| 220 | |
| 221 | word_t R2 = CurWord & (~word_t(0) >> (BitsInWord - BitsLeft)); |
| 222 | |
| 223 | |
| 224 | CurWord >>= (BitsLeft & Mask); |
| 225 | |
| 226 | BitsInCurWord -= BitsLeft; |
| 227 | |
| 228 | R |= R2 << (NumBits - BitsLeft); |
| 229 | |
| 230 | return R; |
| 231 | } |
| 232 | |
| 233 | Expected<uint32_t> ReadVBR(unsigned NumBits) { |
| 234 | Expected<unsigned> MaybeRead = Read(NumBits); |
| 235 | if (!MaybeRead) |
| 236 | return MaybeRead; |
| 237 | uint32_t Piece = MaybeRead.get(); |
| 238 | |
| 239 | if ((Piece & (1U << (NumBits-1))) == 0) |
| 240 | return Piece; |
| 241 | |
| 242 | uint32_t Result = 0; |
| 243 | unsigned NextBit = 0; |
| 244 | while (true) { |
| 245 | Result |= (Piece & ((1U << (NumBits-1))-1)) << NextBit; |
| 246 | |
| 247 | if ((Piece & (1U << (NumBits-1))) == 0) |
| 248 | return Result; |
| 249 | |
| 250 | NextBit += NumBits-1; |
| 251 | MaybeRead = Read(NumBits); |
| 252 | if (!MaybeRead) |
| 253 | return MaybeRead; |
| 254 | Piece = MaybeRead.get(); |
| 255 | } |
| 256 | } |
| 257 | |
| 258 | |
| 259 | |
| 260 | Expected<uint64_t> ReadVBR64(unsigned NumBits) { |
| 261 | Expected<uint64_t> MaybeRead = Read(NumBits); |
| 262 | if (!MaybeRead) |
| 263 | return MaybeRead; |
| 264 | uint32_t Piece = MaybeRead.get(); |
| 265 | |
| 266 | if ((Piece & (1U << (NumBits-1))) == 0) |
| 267 | return uint64_t(Piece); |
| 268 | |
| 269 | uint64_t Result = 0; |
| 270 | unsigned NextBit = 0; |
| 271 | while (true) { |
| 272 | Result |= uint64_t(Piece & ((1U << (NumBits-1))-1)) << NextBit; |
| 273 | |
| 274 | if ((Piece & (1U << (NumBits-1))) == 0) |
| 275 | return Result; |
| 276 | |
| 277 | NextBit += NumBits-1; |
| 278 | MaybeRead = Read(NumBits); |
| 279 | if (!MaybeRead) |
| 280 | return MaybeRead; |
| 281 | Piece = MaybeRead.get(); |
| 282 | } |
| 283 | } |
| 284 | |
| 285 | void SkipToFourByteBoundary() { |
| 286 | |
| 287 | |
| 288 | if (sizeof(word_t) > 4 && |
| 289 | BitsInCurWord >= 32) { |
| 290 | CurWord >>= BitsInCurWord-32; |
| 291 | BitsInCurWord = 32; |
| 292 | return; |
| 293 | } |
| 294 | |
| 295 | BitsInCurWord = 0; |
| 296 | } |
| 297 | |
| 298 | |
| 299 | size_t SizeInBytes() const { return BitcodeBytes.size(); } |
| 300 | |
| 301 | |
| 302 | void skipToEnd() { NextChar = BitcodeBytes.size(); } |
| 303 | }; |
| 304 | |
| 305 | |
| 306 | |
| 307 | struct BitstreamEntry { |
| 308 | enum { |
| 309 | Error, |
| 310 | EndBlock, |
| 311 | |
| 312 | SubBlock, |
| 313 | Record |
| 314 | } Kind; |
| 315 | |
| 316 | unsigned ID; |
| 317 | |
| 318 | static BitstreamEntry getError() { |
| 319 | BitstreamEntry E; E.Kind = Error; return E; |
| 320 | } |
| 321 | |
| 322 | static BitstreamEntry getEndBlock() { |
| 323 | BitstreamEntry E; E.Kind = EndBlock; return E; |
| 324 | } |
| 325 | |
| 326 | static BitstreamEntry getSubBlock(unsigned ID) { |
| 327 | BitstreamEntry E; E.Kind = SubBlock; E.ID = ID; return E; |
| 328 | } |
| 329 | |
| 330 | static BitstreamEntry getRecord(unsigned AbbrevID) { |
| 331 | BitstreamEntry E; E.Kind = Record; E.ID = AbbrevID; return E; |
| 332 | } |
| 333 | }; |
| 334 | |
| 335 | |
| 336 | |
| 337 | |
| 338 | |
| 339 | |
| 340 | class BitstreamCursor : SimpleBitstreamCursor { |
| 341 | |
| 342 | |
| 343 | unsigned CurCodeSize = 2; |
| 344 | |
| 345 | |
| 346 | std::vector<std::shared_ptr<BitCodeAbbrev>> CurAbbrevs; |
| 347 | |
| 348 | struct Block { |
| 349 | unsigned PrevCodeSize; |
| 350 | std::vector<std::shared_ptr<BitCodeAbbrev>> PrevAbbrevs; |
| 351 | |
| 352 | explicit Block(unsigned PCS) : PrevCodeSize(PCS) {} |
| 353 | }; |
| 354 | |
| 355 | |
| 356 | SmallVector<Block, 8> BlockScope; |
| 357 | |
| 358 | BitstreamBlockInfo *BlockInfo = nullptr; |
| 359 | |
| 360 | public: |
| 361 | static const size_t MaxChunkSize = sizeof(word_t) * 8; |
| 362 | |
| 363 | BitstreamCursor() = default; |
| 364 | explicit BitstreamCursor(ArrayRef<uint8_t> BitcodeBytes) |
| 365 | : SimpleBitstreamCursor(BitcodeBytes) {} |
| 366 | explicit BitstreamCursor(StringRef BitcodeBytes) |
| 367 | : SimpleBitstreamCursor(BitcodeBytes) {} |
| 368 | explicit BitstreamCursor(MemoryBufferRef BitcodeBytes) |
| 369 | : SimpleBitstreamCursor(BitcodeBytes) {} |
| 370 | |
| 371 | using SimpleBitstreamCursor::AtEndOfStream; |
| 372 | using SimpleBitstreamCursor::canSkipToPos; |
| 373 | using SimpleBitstreamCursor::fillCurWord; |
| 374 | using SimpleBitstreamCursor::getBitcodeBytes; |
| 375 | using SimpleBitstreamCursor::GetCurrentBitNo; |
| 376 | using SimpleBitstreamCursor::getCurrentByteNo; |
| 377 | using SimpleBitstreamCursor::getPointerToByte; |
| 378 | using SimpleBitstreamCursor::JumpToBit; |
| 379 | using SimpleBitstreamCursor::Read; |
| 380 | using SimpleBitstreamCursor::ReadVBR; |
| 381 | using SimpleBitstreamCursor::ReadVBR64; |
| 382 | using SimpleBitstreamCursor::SizeInBytes; |
| 383 | using SimpleBitstreamCursor::skipToEnd; |
| 384 | |
| 385 | |
| 386 | unsigned getAbbrevIDWidth() const { return CurCodeSize; } |
| 387 | |
| 388 | |
| 389 | enum { |
| 390 | |
| 391 | |
| 392 | AF_DontPopBlockAtEnd = 1, |
| 393 | |
| 394 | |
| 395 | |
| 396 | AF_DontAutoprocessAbbrevs = 2 |
| 397 | }; |
| 398 | |
| 399 | |
| 400 | Expected<BitstreamEntry> advance(unsigned Flags = 0) { |
| 401 | while (true) { |
| 7 | | Loop condition is true. Entering loop body | |
|
| 402 | if (AtEndOfStream()) |
| |
| 403 | return BitstreamEntry::getError(); |
| 404 | |
| 405 | Expected<unsigned> MaybeCode = ReadCode(); |
| 9 | | Calling 'BitstreamCursor::ReadCode' | |
|
| 406 | if (!MaybeCode) |
| 407 | return MaybeCode.takeError(); |
| 408 | unsigned Code = MaybeCode.get(); |
| 409 | |
| 410 | if (Code == bitc::END_BLOCK) { |
| 411 | |
| 412 | if (!(Flags & AF_DontPopBlockAtEnd) && ReadBlockEnd()) |
| 413 | return BitstreamEntry::getError(); |
| 414 | return BitstreamEntry::getEndBlock(); |
| 415 | } |
| 416 | |
| 417 | if (Code == bitc::ENTER_SUBBLOCK) { |
| 418 | if (Expected<unsigned> MaybeSubBlock = ReadSubBlockID()) |
| 419 | return BitstreamEntry::getSubBlock(MaybeSubBlock.get()); |
| 420 | else |
| 421 | return MaybeSubBlock.takeError(); |
| 422 | } |
| 423 | |
| 424 | if (Code == bitc::DEFINE_ABBREV && |
| 425 | !(Flags & AF_DontAutoprocessAbbrevs)) { |
| 426 | |
| 427 | |
| 428 | if (Error Err = ReadAbbrevRecord()) |
| 429 | return std::move(Err); |
| 430 | continue; |
| 431 | } |
| 432 | |
| 433 | return BitstreamEntry::getRecord(Code); |
| 434 | } |
| 435 | } |
| 436 | |
| 437 | |
| 438 | |
| 439 | Expected<BitstreamEntry> advanceSkippingSubblocks(unsigned Flags = 0) { |
| 440 | while (true) { |
| 5 | | Loop condition is true. Entering loop body | |
|
| 441 | |
| 442 | Expected<BitstreamEntry> MaybeEntry = advance(Flags); |
| 6 | | Calling 'BitstreamCursor::advance' | |
|
| 443 | if (!MaybeEntry) |
| 444 | return MaybeEntry; |
| 445 | BitstreamEntry Entry = MaybeEntry.get(); |
| 446 | |
| 447 | if (Entry.Kind != BitstreamEntry::SubBlock) |
| 448 | return Entry; |
| 449 | |
| 450 | |
| 451 | if (Error Err = SkipBlock()) |
| 452 | return std::move(Err); |
| 453 | } |
| 454 | } |
| 455 | |
| 456 | Expected<unsigned> ReadCode() { return Read(CurCodeSize); } |
| 10 | | Calling 'SimpleBitstreamCursor::Read' | |
|
| 457 | |
| 458 | |
| 459 | |
| 460 | |
| 461 | |
| 462 | Expected<unsigned> ReadSubBlockID() { return ReadVBR(bitc::BlockIDWidth); } |
| 463 | |
| 464 | |
| 465 | |
| 466 | Error SkipBlock() { |
| 467 | |
| 468 | if (Expected<uint32_t> Res = ReadVBR(bitc::CodeLenWidth)) |
| 469 | ; |
| 470 | |
| 471 | else |
| 472 | return Res.takeError(); |
| 473 | |
| 474 | SkipToFourByteBoundary(); |
| 475 | Expected<unsigned> MaybeNum = Read(bitc::BlockSizeWidth); |
| 476 | if (!MaybeNum) |
| 477 | return MaybeNum.takeError(); |
| 478 | size_t NumFourBytes = MaybeNum.get(); |
| 479 | |
| 480 | |
| 481 | |
| 482 | size_t SkipTo = GetCurrentBitNo() + NumFourBytes * 4 * 8; |
| 483 | if (AtEndOfStream()) |
| 484 | return createStringError(std::errc::illegal_byte_sequence, |
| 485 | "can't skip block: already at end of stream"); |
| 486 | if (!canSkipToPos(SkipTo / 8)) |
| 487 | return createStringError(std::errc::illegal_byte_sequence, |
| 488 | "can't skip to bit %zu from %" PRIu64, SkipTo, |
| 489 | GetCurrentBitNo()); |
| 490 | |
| 491 | if (Error Res = JumpToBit(SkipTo)) |
| 492 | return Res; |
| 493 | |
| 494 | return Error::success(); |
| 495 | } |
| 496 | |
| 497 | |
| 498 | Error EnterSubBlock(unsigned BlockID, unsigned *NumWordsP = nullptr); |
| 499 | |
| 500 | bool ReadBlockEnd() { |
| 501 | if (BlockScope.empty()) return true; |
| 502 | |
| 503 | |
| 504 | |
| 505 | SkipToFourByteBoundary(); |
| 506 | |
| 507 | popBlockScope(); |
| 508 | return false; |
| 509 | } |
| 510 | |
| 511 | private: |
| 512 | void popBlockScope() { |
| 513 | CurCodeSize = BlockScope.back().PrevCodeSize; |
| 514 | |
| 515 | CurAbbrevs = std::move(BlockScope.back().PrevAbbrevs); |
| 516 | BlockScope.pop_back(); |
| 517 | } |
| 518 | |
| 519 | |
| 520 | |
| 521 | |
| 522 | |
| 523 | public: |
| 524 | |
| 525 | const BitCodeAbbrev *getAbbrev(unsigned AbbrevID) { |
| 526 | unsigned AbbrevNo = AbbrevID - bitc::FIRST_APPLICATION_ABBREV; |
| 527 | if (AbbrevNo >= CurAbbrevs.size()) |
| 528 | report_fatal_error("Invalid abbrev number"); |
| 529 | return CurAbbrevs[AbbrevNo].get(); |
| 530 | } |
| 531 | |
| 532 | |
| 533 | Expected<unsigned> skipRecord(unsigned AbbrevID); |
| 534 | |
| 535 | Expected<unsigned> readRecord(unsigned AbbrevID, |
| 536 | SmallVectorImpl<uint64_t> &Vals, |
| 537 | StringRef *Blob = nullptr); |
| 538 | |
| 539 | |
| 540 | |
| 541 | |
| 542 | Error ReadAbbrevRecord(); |
| 543 | |
| 544 | |
| 545 | |
| 546 | |
| 547 | |
| 548 | |
| 549 | Expected<Optional<BitstreamBlockInfo>> |
| 550 | ReadBlockInfoBlock(bool ReadBlockInfoNames = false); |
| 551 | |
| 552 | |
| 553 | |
| 554 | void setBlockInfo(BitstreamBlockInfo *BI) { BlockInfo = BI; } |
| 555 | }; |
| 556 | |
| 557 | } |
| 558 | |
| 559 | #endif // LLVM_BITSTREAM_BITSTREAMREADER_H |