//===- RecordSerialization.h ------------------------------------*- C++ -*-===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// #ifndef LLVM_DEBUGINFO_CODEVIEW_RECORDSERIALIZATION_H #define LLVM_DEBUGINFO_CODEVIEW_RECORDSERIALIZATION_H #include "llvm/ADT/APSInt.h" #include "llvm/ADT/ArrayRef.h" #include "llvm/ADT/StringRef.h" #include "llvm/Support/Endian.h" #include "llvm/DebugInfo/CodeView/CodeView.h" #include #include namespace llvm { namespace codeview { using llvm::support::little32_t; using llvm::support::ulittle16_t; using llvm::support::ulittle32_t; struct RecordPrefix { ulittle16_t RecordLen; // Record length, starting from &Leaf. ulittle16_t RecordKind; // Record kind enum (SymRecordKind or TypeRecordKind) }; /// Reinterpret a byte array as an array of characters. Does not interpret as /// a C string, as StringRef has several helpers (split) that make that easy. StringRef getBytesAsCharacters(ArrayRef LeafData); StringRef getBytesAsCString(ArrayRef LeafData); /// Consumes sizeof(T) bytes from the given byte sequence. Returns an error if /// there are not enough bytes remaining. Reinterprets the consumed bytes as a /// T object and points 'Res' at them. template inline std::error_code consumeObject(U &Data, const T *&Res) { if (Data.size() < sizeof(*Res)) return std::make_error_code(std::errc::illegal_byte_sequence); Res = reinterpret_cast(Data.data()); Data = Data.drop_front(sizeof(*Res)); return std::error_code(); } inline std::error_code consume(ArrayRef &Data) { return std::error_code(); } /// Decodes a numeric "leaf" value. These are integer literals encountered in /// the type stream. If the value is positive and less than LF_NUMERIC (1 << /// 15), it is emitted directly in Data. Otherwise, it has a tag like LF_CHAR /// that indicates the bitwidth and sign of the numeric data. std::error_code consume(ArrayRef &Data, APSInt &Num); std::error_code consume(StringRef &Data, APSInt &Num); /// Decodes a numeric leaf value that is known to be a particular type. std::error_code consume_numeric(ArrayRef &Data, uint64_t &Value); /// Decodes signed and unsigned fixed-length integers. std::error_code consume(ArrayRef &Data, uint32_t &Item); std::error_code consume(StringRef &Data, uint32_t &Item); std::error_code consume(ArrayRef &Data, int32_t &Item); /// Decodes a null terminated string. std::error_code consume(ArrayRef &Data, StringRef &Item); /// Decodes an arbitrary object whose layout matches that of the underlying /// byte sequence, and returns a pointer to the object. template std::error_code consume(ArrayRef &Data, T *&Item) { return consumeObject(Data, Item); } template struct serialize_conditional_impl { serialize_conditional_impl(T &Item, U Func) : Item(Item), Func(Func) {} std::error_code deserialize(ArrayRef &Data) const { if (!Func()) return std::error_code(); return consume(Data, Item); } T &Item; U Func; }; template serialize_conditional_impl serialize_conditional(T &Item, U Func) { return serialize_conditional_impl(Item, Func); } template struct serialize_array_impl { serialize_array_impl(ArrayRef &Item, U Func) : Item(Item), Func(Func) {} std::error_code deserialize(ArrayRef &Data) const { uint32_t N = Func(); if (N == 0) return std::error_code(); uint32_t Size = sizeof(T) * N; if (Size / sizeof(T) != N) return std::make_error_code(std::errc::illegal_byte_sequence); if (Data.size() < Size) return std::make_error_code(std::errc::illegal_byte_sequence); Item = ArrayRef(reinterpret_cast(Data.data()), N); Data = Data.drop_front(Size); return std::error_code(); } ArrayRef &Item; U Func; }; template struct serialize_vector_tail_impl { serialize_vector_tail_impl(std::vector &Item) : Item(Item) {} std::error_code deserialize(ArrayRef &Data) const { T Field; // Stop when we run out of bytes or we hit record padding bytes. while (!Data.empty() && Data.front() < LF_PAD0) { if (auto EC = consume(Data, Field)) return EC; Item.push_back(Field); } return std::error_code(); } std::vector &Item; }; struct serialize_null_term_string_array_impl { serialize_null_term_string_array_impl(std::vector &Item) : Item(Item) {} std::error_code deserialize(ArrayRef &Data) const { if (Data.empty()) return std::make_error_code(std::errc::illegal_byte_sequence); StringRef Field; // Stop when we run out of bytes or we hit record padding bytes. while (Data.front() != 0) { if (auto EC = consume(Data, Field)) return EC; Item.push_back(Field); if (Data.empty()) return std::make_error_code(std::errc::illegal_byte_sequence); } Data = Data.drop_front(1); return std::error_code(); } std::vector &Item; }; template struct serialize_arrayref_tail_impl { serialize_arrayref_tail_impl(ArrayRef &Item) : Item(Item) {} std::error_code deserialize(ArrayRef &Data) const { uint32_t Count = Data.size() / sizeof(T); Item = ArrayRef(reinterpret_cast(Data.begin()), Count); return std::error_code(); } ArrayRef &Item; }; template struct serialize_numeric_impl { serialize_numeric_impl(T &Item) : Item(Item) {} std::error_code deserialize(ArrayRef &Data) const { return consume_numeric(Data, Item); } T &Item; }; template serialize_array_impl serialize_array(ArrayRef &Item, U Func) { return serialize_array_impl(Item, Func); } inline serialize_null_term_string_array_impl serialize_null_term_string_array(std::vector &Item) { return serialize_null_term_string_array_impl(Item); } template serialize_vector_tail_impl serialize_array_tail(std::vector &Item) { return serialize_vector_tail_impl(Item); } template serialize_arrayref_tail_impl serialize_array_tail(ArrayRef &Item) { return serialize_arrayref_tail_impl(Item); } template serialize_numeric_impl serialize_numeric(T &Item) { return serialize_numeric_impl(Item); } // This field is only present in the byte record if the condition is true. The // condition is evaluated lazily, so it can depend on items that were // deserialized // earlier. #define CV_CONDITIONAL_FIELD(I, C) \ serialize_conditional(I, [&]() { return !!(C); }) // This is an array of N items, where N is evaluated lazily, so it can refer // to a field deserialized earlier. #define CV_ARRAY_FIELD_N(I, N) serialize_array(I, [&]() { return N; }) // This is an array that exhausts the remainder of the input buffer. #define CV_ARRAY_FIELD_TAIL(I) serialize_array_tail(I) // This is an array that consumes null terminated strings until a double null // is encountered. #define CV_STRING_ARRAY_NULL_TERM(I) serialize_null_term_string_array(I) #define CV_NUMERIC_FIELD(I) serialize_numeric(I) template std::error_code consume(ArrayRef &Data, const serialize_conditional_impl &Item) { return Item.deserialize(Data); } template std::error_code consume(ArrayRef &Data, const serialize_array_impl &Item) { return Item.deserialize(Data); } inline std::error_code consume(ArrayRef &Data, const serialize_null_term_string_array_impl &Item) { return Item.deserialize(Data); } template std::error_code consume(ArrayRef &Data, const serialize_vector_tail_impl &Item) { return Item.deserialize(Data); } template std::error_code consume(ArrayRef &Data, const serialize_arrayref_tail_impl &Item) { return Item.deserialize(Data); } template std::error_code consume(ArrayRef &Data, const serialize_numeric_impl &Item) { return Item.deserialize(Data); } template std::error_code consume(ArrayRef &Data, T &&X, U &&Y, Args &&... Rest) { if (auto EC = consume(Data, X)) return EC; return consume(Data, Y, std::forward(Rest)...); } #define CV_DESERIALIZE(...) \ if (auto EC = consume(__VA_ARGS__)) \ return EC; } } #endif