Chris@50: // Copyright (c) 2013-2016 Sandstorm Development Group, Inc. and contributors Chris@50: // Licensed under the MIT License: Chris@50: // Chris@50: // Permission is hereby granted, free of charge, to any person obtaining a copy Chris@50: // of this software and associated documentation files (the "Software"), to deal Chris@50: // in the Software without restriction, including without limitation the rights Chris@50: // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell Chris@50: // copies of the Software, and to permit persons to whom the Software is Chris@50: // furnished to do so, subject to the following conditions: Chris@50: // Chris@50: // The above copyright notice and this permission notice shall be included in Chris@50: // all copies or substantial portions of the Software. Chris@50: // Chris@50: // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR Chris@50: // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, Chris@50: // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE Chris@50: // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER Chris@50: // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, Chris@50: // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN Chris@50: // THE SOFTWARE. Chris@50: Chris@50: #include Chris@50: #include Chris@50: #include Chris@50: #include Chris@50: #include "common.h" Chris@50: #include "layout.h" Chris@50: #include "any.h" Chris@50: Chris@50: #ifndef CAPNP_MESSAGE_H_ Chris@50: #define CAPNP_MESSAGE_H_ Chris@50: Chris@50: #if defined(__GNUC__) && !defined(CAPNP_HEADER_WARNINGS) Chris@50: #pragma GCC system_header Chris@50: #endif Chris@50: Chris@50: namespace capnp { Chris@50: Chris@50: namespace _ { // private Chris@50: class ReaderArena; Chris@50: class BuilderArena; Chris@50: } Chris@50: Chris@50: class StructSchema; Chris@50: class Orphanage; Chris@50: template Chris@50: class Orphan; Chris@50: Chris@50: // ======================================================================================= Chris@50: Chris@50: struct ReaderOptions { Chris@50: // Options controlling how data is read. Chris@50: Chris@50: uint64_t traversalLimitInWords = 8 * 1024 * 1024; Chris@50: // Limits how many total words of data are allowed to be traversed. Traversal is counted when Chris@50: // a new struct or list builder is obtained, e.g. from a get() accessor. This means that calling Chris@50: // the getter for the same sub-struct multiple times will cause it to be double-counted. Once Chris@50: // the traversal limit is reached, an error will be reported. Chris@50: // Chris@50: // This limit exists for security reasons. It is possible for an attacker to construct a message Chris@50: // in which multiple pointers point at the same location. This is technically invalid, but hard Chris@50: // to detect. Using such a message, an attacker could cause a message which is small on the wire Chris@50: // to appear much larger when actually traversed, possibly exhausting server resources leading to Chris@50: // denial-of-service. Chris@50: // Chris@50: // It makes sense to set a traversal limit that is much larger than the underlying message. Chris@50: // Together with sensible coding practices (e.g. trying to avoid calling sub-object getters Chris@50: // multiple times, which is expensive anyway), this should provide adequate protection without Chris@50: // inconvenience. Chris@50: // Chris@50: // The default limit is 64 MiB. This may or may not be a sensible number for any given use case, Chris@50: // but probably at least prevents easy exploitation while also avoiding causing problems in most Chris@50: // typical cases. Chris@50: Chris@50: int nestingLimit = 64; Chris@50: // Limits how deeply-nested a message structure can be, e.g. structs containing other structs or Chris@50: // lists of structs. Chris@50: // Chris@50: // Like the traversal limit, this limit exists for security reasons. Since it is common to use Chris@50: // recursive code to traverse recursive data structures, an attacker could easily cause a stack Chris@50: // overflow by sending a very-deeply-nested (or even cyclic) message, without the message even Chris@50: // being very large. The default limit of 64 is probably low enough to prevent any chance of Chris@50: // stack overflow, yet high enough that it is never a problem in practice. Chris@50: }; Chris@50: Chris@50: class MessageReader { Chris@50: // Abstract interface for an object used to read a Cap'n Proto message. Subclasses of Chris@50: // MessageReader are responsible for reading the raw, flat message content. Callers should Chris@50: // usually call `messageReader.getRoot()` to get a `MyStructType::Reader` Chris@50: // representing the root of the message, then use that to traverse the message content. Chris@50: // Chris@50: // Some common subclasses of `MessageReader` include `SegmentArrayMessageReader`, whose Chris@50: // constructor accepts pointers to the raw data, and `StreamFdMessageReader` (from Chris@50: // `serialize.h`), which reads the message from a file descriptor. One might implement other Chris@50: // subclasses to handle things like reading from shared memory segments, mmap()ed files, etc. Chris@50: Chris@50: public: Chris@50: MessageReader(ReaderOptions options); Chris@50: // It is suggested that subclasses take ReaderOptions as a constructor parameter, but give it a Chris@50: // default value of "ReaderOptions()". The base class constructor doesn't have a default value Chris@50: // in order to remind subclasses that they really need to give the user a way to provide this. Chris@50: Chris@50: virtual ~MessageReader() noexcept(false); Chris@50: Chris@50: virtual kj::ArrayPtr getSegment(uint id) = 0; Chris@50: // Gets the segment with the given ID, or returns null if no such segment exists. This method Chris@50: // will be called at most once for each segment ID. Chris@50: Chris@50: inline const ReaderOptions& getOptions(); Chris@50: // Get the options passed to the constructor. Chris@50: Chris@50: template Chris@50: typename RootType::Reader getRoot(); Chris@50: // Get the root struct of the message, interpreting it as the given struct type. Chris@50: Chris@50: template Chris@50: typename RootType::Reader getRoot(SchemaType schema); Chris@50: // Dynamically interpret the root struct of the message using the given schema (a StructSchema). Chris@50: // RootType in this case must be DynamicStruct, and you must #include to Chris@50: // use this. Chris@50: Chris@50: bool isCanonical(); Chris@50: // Returns whether the message encoded in the reader is in canonical form. Chris@50: Chris@50: private: Chris@50: ReaderOptions options; Chris@50: Chris@50: // Space in which we can construct a ReaderArena. We don't use ReaderArena directly here Chris@50: // because we don't want clients to have to #include arena.h, which itself includes a bunch of Chris@50: // big STL headers. We don't use a pointer to a ReaderArena because that would require an Chris@50: // extra malloc on every message which could be expensive when processing small messages. Chris@50: void* arenaSpace[15 + sizeof(kj::MutexGuarded) / sizeof(void*)]; Chris@50: bool allocatedArena; Chris@50: Chris@50: _::ReaderArena* arena() { return reinterpret_cast<_::ReaderArena*>(arenaSpace); } Chris@50: AnyPointer::Reader getRootInternal(); Chris@50: }; Chris@50: Chris@50: class MessageBuilder { Chris@50: // Abstract interface for an object used to allocate and build a message. Subclasses of Chris@50: // MessageBuilder are responsible for allocating the space in which the message will be written. Chris@50: // The most common subclass is `MallocMessageBuilder`, but other subclasses may be used to do Chris@50: // tricky things like allocate messages in shared memory or mmap()ed files. Chris@50: // Chris@50: // Creating a new message ususually means allocating a new MessageBuilder (ideally on the stack) Chris@50: // and then calling `messageBuilder.initRoot()` to get a `MyStructType::Builder`. Chris@50: // That, in turn, can be used to fill in the message content. When done, you can call Chris@50: // `messageBuilder.getSegmentsForOutput()` to get a list of flat data arrays containing the Chris@50: // message. Chris@50: Chris@50: public: Chris@50: MessageBuilder(); Chris@50: virtual ~MessageBuilder() noexcept(false); Chris@50: KJ_DISALLOW_COPY(MessageBuilder); Chris@50: Chris@50: struct SegmentInit { Chris@50: kj::ArrayPtr space; Chris@50: Chris@50: size_t wordsUsed; Chris@50: // Number of words in `space` which are used; the rest are free space in which additional Chris@50: // objects may be allocated. Chris@50: }; Chris@50: Chris@50: explicit MessageBuilder(kj::ArrayPtr segments); Chris@50: // Create a MessageBuilder backed by existing memory. This is an advanced interface that most Chris@50: // people should not use. THIS METHOD IS INSECURE; see below. Chris@50: // Chris@50: // This allows a MessageBuilder to be constructed to modify an in-memory message without first Chris@50: // making a copy of the content. This is especially useful in conjunction with mmap(). Chris@50: // Chris@50: // The contents of each segment must outlive the MessageBuilder, but the SegmentInit array itself Chris@50: // only need outlive the constructor. Chris@50: // Chris@50: // SECURITY: Do not use this in conjunction with untrusted data. This constructor assumes that Chris@50: // the input message is valid. This constructor is designed to be used with data you control, Chris@50: // e.g. an mmap'd file which is owned and accessed by only one program. When reading data you Chris@50: // do not trust, you *must* load it into a Reader and then copy into a Builder as a means of Chris@50: // validating the content. Chris@50: // Chris@50: // WARNING: It is NOT safe to initialize a MessageBuilder in this way from memory that is Chris@50: // currently in use by another MessageBuilder or MessageReader. Other readers/builders will Chris@50: // not observe changes to the segment sizes nor newly-allocated segments caused by allocating Chris@50: // new objects in this message. Chris@50: Chris@50: virtual kj::ArrayPtr allocateSegment(uint minimumSize) = 0; Chris@50: // Allocates an array of at least the given number of words, throwing an exception or crashing if Chris@50: // this is not possible. It is expected that this method will usually return more space than Chris@50: // requested, and the caller should use that extra space as much as possible before allocating Chris@50: // more. The returned space remains valid at least until the MessageBuilder is destroyed. Chris@50: // Chris@50: // Cap'n Proto will only call this once at a time, so the subclass need not worry about Chris@50: // thread-safety. Chris@50: Chris@50: template Chris@50: typename RootType::Builder initRoot(); Chris@50: // Initialize the root struct of the message as the given struct type. Chris@50: Chris@50: template Chris@50: void setRoot(Reader&& value); Chris@50: // Set the root struct to a deep copy of the given struct. Chris@50: Chris@50: template Chris@50: typename RootType::Builder getRoot(); Chris@50: // Get the root struct of the message, interpreting it as the given struct type. Chris@50: Chris@50: template Chris@50: typename RootType::Builder getRoot(SchemaType schema); Chris@50: // Dynamically interpret the root struct of the message using the given schema (a StructSchema). Chris@50: // RootType in this case must be DynamicStruct, and you must #include to Chris@50: // use this. Chris@50: Chris@50: template Chris@50: typename RootType::Builder initRoot(SchemaType schema); Chris@50: // Dynamically init the root struct of the message using the given schema (a StructSchema). Chris@50: // RootType in this case must be DynamicStruct, and you must #include to Chris@50: // use this. Chris@50: Chris@50: template Chris@50: void adoptRoot(Orphan&& orphan); Chris@50: // Like setRoot() but adopts the orphan without copying. Chris@50: Chris@50: kj::ArrayPtr> getSegmentsForOutput(); Chris@50: // Get the raw data that makes up the message. Chris@50: Chris@50: Orphanage getOrphanage(); Chris@50: Chris@50: bool isCanonical(); Chris@50: // Check whether the message builder is in canonical form Chris@50: Chris@50: private: Chris@50: void* arenaSpace[22]; Chris@50: // Space in which we can construct a BuilderArena. We don't use BuilderArena directly here Chris@50: // because we don't want clients to have to #include arena.h, which itself includes a bunch of Chris@50: // big STL headers. We don't use a pointer to a BuilderArena because that would require an Chris@50: // extra malloc on every message which could be expensive when processing small messages. Chris@50: Chris@50: bool allocatedArena = false; Chris@50: // We have to initialize the arena lazily because when we do so we want to allocate the root Chris@50: // pointer immediately, and this will allocate a segment, which requires a virtual function Chris@50: // call on the MessageBuilder. We can't do such a call in the constructor since the subclass Chris@50: // isn't constructed yet. This is kind of annoying because it means that getOrphanage() is Chris@50: // not thread-safe, but that shouldn't be a huge deal... Chris@50: Chris@50: _::BuilderArena* arena() { return reinterpret_cast<_::BuilderArena*>(arenaSpace); } Chris@50: _::SegmentBuilder* getRootSegment(); Chris@50: AnyPointer::Builder getRootInternal(); Chris@50: }; Chris@50: Chris@50: template Chris@50: typename RootType::Reader readMessageUnchecked(const word* data); Chris@50: // IF THE INPUT IS INVALID, THIS MAY CRASH, CORRUPT MEMORY, CREATE A SECURITY HOLE IN YOUR APP, Chris@50: // MURDER YOUR FIRST-BORN CHILD, AND/OR BRING ABOUT ETERNAL DAMNATION ON ALL OF HUMANITY. DO NOT Chris@50: // USE UNLESS YOU UNDERSTAND THE CONSEQUENCES. Chris@50: // Chris@50: // Given a pointer to a known-valid message located in a single contiguous memory segment, Chris@50: // returns a reader for that message. No bounds-checking will be done while traversing this Chris@50: // message. Use this only if you have already verified that all pointers are valid and in-bounds, Chris@50: // and there are no far pointers in the message. Chris@50: // Chris@50: // To create a message that can be passed to this function, build a message using a MallocAllocator Chris@50: // whose preferred segment size is larger than the message size. This guarantees that the message Chris@50: // will be allocated as a single segment, meaning getSegmentsForOutput() returns a single word Chris@50: // array. That word array is your message; you may pass a pointer to its first word into Chris@50: // readMessageUnchecked() to read the message. Chris@50: // Chris@50: // This can be particularly handy for embedding messages in generated code: you can Chris@50: // embed the raw bytes (using AlignedData) then make a Reader for it using this. This is the way Chris@50: // default values are embedded in code generated by the Cap'n Proto compiler. E.g., if you have Chris@50: // a message MyMessage, you can read its default value like so: Chris@50: // MyMessage::Reader reader = Message::readMessageUnchecked(MyMessage::DEFAULT.words); Chris@50: // Chris@50: // To sanitize a message from an untrusted source such that it can be safely passed to Chris@50: // readMessageUnchecked(), use copyToUnchecked(). Chris@50: Chris@50: template Chris@50: void copyToUnchecked(Reader&& reader, kj::ArrayPtr uncheckedBuffer); Chris@50: // Copy the content of the given reader into the given buffer, such that it can safely be passed to Chris@50: // readMessageUnchecked(). The buffer's size must be exactly reader.totalSizeInWords() + 1, Chris@50: // otherwise an exception will be thrown. The buffer must be zero'd before calling. Chris@50: Chris@50: template Chris@50: typename RootType::Reader readDataStruct(kj::ArrayPtr data); Chris@50: // Interprets the given data as a single, data-only struct. Only primitive fields (booleans, Chris@50: // numbers, and enums) will be readable; all pointers will be null. This is useful if you want Chris@50: // to use Cap'n Proto as a language/platform-neutral way to pack some bits. Chris@50: // Chris@50: // The input is a word array rather than a byte array to enforce alignment. If you have a byte Chris@50: // array which you know is word-aligned (or if your platform supports unaligned reads and you don't Chris@50: // mind the performance penalty), then you can use `reinterpret_cast` to convert a byte array into Chris@50: // a word array: Chris@50: // Chris@50: // kj::arrayPtr(reinterpret_cast(bytes.begin()), Chris@50: // reinterpret_cast(bytes.end())) Chris@50: Chris@50: template Chris@50: typename kj::ArrayPtr writeDataStruct(BuilderType builder); Chris@50: // Given a struct builder, get the underlying data section as a word array, suitable for passing Chris@50: // to `readDataStruct()`. Chris@50: // Chris@50: // Note that you may call `.toBytes()` on the returned value to convert to `ArrayPtr`. Chris@50: Chris@50: template Chris@50: static typename Type::Reader defaultValue(); Chris@50: // Get a default instance of the given struct or list type. Chris@50: // Chris@50: // TODO(cleanup): Find a better home for this function? Chris@50: Chris@50: // ======================================================================================= Chris@50: Chris@50: class SegmentArrayMessageReader: public MessageReader { Chris@50: // A simple MessageReader that reads from an array of word arrays representing all segments. Chris@50: // In particular you can read directly from the output of MessageBuilder::getSegmentsForOutput() Chris@50: // (although it would probably make more sense to call builder.getRoot().asReader() in that case). Chris@50: Chris@50: public: Chris@50: SegmentArrayMessageReader(kj::ArrayPtr> segments, Chris@50: ReaderOptions options = ReaderOptions()); Chris@50: // Creates a message pointing at the given segment array, without taking ownership of the Chris@50: // segments. All arrays passed in must remain valid until the MessageReader is destroyed. Chris@50: Chris@50: KJ_DISALLOW_COPY(SegmentArrayMessageReader); Chris@50: ~SegmentArrayMessageReader() noexcept(false); Chris@50: Chris@50: virtual kj::ArrayPtr getSegment(uint id) override; Chris@50: Chris@50: private: Chris@50: kj::ArrayPtr> segments; Chris@50: }; Chris@50: Chris@50: enum class AllocationStrategy: uint8_t { Chris@50: FIXED_SIZE, Chris@50: // The builder will prefer to allocate the same amount of space for each segment with no Chris@50: // heuristic growth. It will still allocate larger segments when the preferred size is too small Chris@50: // for some single object. This mode is generally not recommended, but can be particularly useful Chris@50: // for testing in order to force a message to allocate a predictable number of segments. Note Chris@50: // that you can force every single object in the message to be located in a separate segment by Chris@50: // using this mode with firstSegmentWords = 0. Chris@50: Chris@50: GROW_HEURISTICALLY Chris@50: // The builder will heuristically decide how much space to allocate for each segment. Each Chris@50: // allocated segment will be progressively larger than the previous segments on the assumption Chris@50: // that message sizes are exponentially distributed. The total number of segments that will be Chris@50: // allocated for a message of size n is O(log n). Chris@50: }; Chris@50: Chris@50: constexpr uint SUGGESTED_FIRST_SEGMENT_WORDS = 1024; Chris@50: constexpr AllocationStrategy SUGGESTED_ALLOCATION_STRATEGY = AllocationStrategy::GROW_HEURISTICALLY; Chris@50: Chris@50: class MallocMessageBuilder: public MessageBuilder { Chris@50: // A simple MessageBuilder that uses malloc() (actually, calloc()) to allocate segments. This Chris@50: // implementation should be reasonable for any case that doesn't require writing the message to Chris@50: // a specific location in memory. Chris@50: Chris@50: public: Chris@50: explicit MallocMessageBuilder(uint firstSegmentWords = SUGGESTED_FIRST_SEGMENT_WORDS, Chris@50: AllocationStrategy allocationStrategy = SUGGESTED_ALLOCATION_STRATEGY); Chris@50: // Creates a BuilderContext which allocates at least the given number of words for the first Chris@50: // segment, and then uses the given strategy to decide how much to allocate for subsequent Chris@50: // segments. When choosing a value for firstSegmentWords, consider that: Chris@50: // 1) Reading and writing messages gets slower when multiple segments are involved, so it's good Chris@50: // if most messages fit in a single segment. Chris@50: // 2) Unused bytes will not be written to the wire, so generally it is not a big deal to allocate Chris@50: // more space than you need. It only becomes problematic if you are allocating many messages Chris@50: // in parallel and thus use lots of memory, or if you allocate so much extra space that just Chris@50: // zeroing it out becomes a bottleneck. Chris@50: // The defaults have been chosen to be reasonable for most people, so don't change them unless you Chris@50: // have reason to believe you need to. Chris@50: Chris@50: explicit MallocMessageBuilder(kj::ArrayPtr firstSegment, Chris@50: AllocationStrategy allocationStrategy = SUGGESTED_ALLOCATION_STRATEGY); Chris@50: // This version always returns the given array for the first segment, and then proceeds with the Chris@50: // allocation strategy. This is useful for optimization when building lots of small messages in Chris@50: // a tight loop: you can reuse the space for the first segment. Chris@50: // Chris@50: // firstSegment MUST be zero-initialized. MallocMessageBuilder's destructor will write new zeros Chris@50: // over any space that was used so that it can be reused. Chris@50: Chris@50: KJ_DISALLOW_COPY(MallocMessageBuilder); Chris@50: virtual ~MallocMessageBuilder() noexcept(false); Chris@50: Chris@50: virtual kj::ArrayPtr allocateSegment(uint minimumSize) override; Chris@50: Chris@50: private: Chris@50: uint nextSize; Chris@50: AllocationStrategy allocationStrategy; Chris@50: Chris@50: bool ownFirstSegment; Chris@50: bool returnedFirstSegment; Chris@50: Chris@50: void* firstSegment; Chris@50: Chris@50: struct MoreSegments; Chris@50: kj::Maybe> moreSegments; Chris@50: }; Chris@50: Chris@50: class FlatMessageBuilder: public MessageBuilder { Chris@50: // THIS IS NOT THE CLASS YOU'RE LOOKING FOR. Chris@50: // Chris@50: // If you want to write a message into already-existing scratch space, use `MallocMessageBuilder` Chris@50: // and pass the scratch space to its constructor. It will then only fall back to malloc() if Chris@50: // the scratch space is not large enough. Chris@50: // Chris@50: // Do NOT use this class unless you really know what you're doing. This class is problematic Chris@50: // because it requires advance knowledge of the size of your message, which is usually impossible Chris@50: // to determine without actually building the message. The class was created primarily to Chris@50: // implement `copyToUnchecked()`, which itself exists only to support other internal parts of Chris@50: // the Cap'n Proto implementation. Chris@50: Chris@50: public: Chris@50: explicit FlatMessageBuilder(kj::ArrayPtr array); Chris@50: KJ_DISALLOW_COPY(FlatMessageBuilder); Chris@50: virtual ~FlatMessageBuilder() noexcept(false); Chris@50: Chris@50: void requireFilled(); Chris@50: // Throws an exception if the flat array is not exactly full. Chris@50: Chris@50: virtual kj::ArrayPtr allocateSegment(uint minimumSize) override; Chris@50: Chris@50: private: Chris@50: kj::ArrayPtr array; Chris@50: bool allocated; Chris@50: }; Chris@50: Chris@50: // ======================================================================================= Chris@50: // implementation details Chris@50: Chris@50: inline const ReaderOptions& MessageReader::getOptions() { Chris@50: return options; Chris@50: } Chris@50: Chris@50: template Chris@50: inline typename RootType::Reader MessageReader::getRoot() { Chris@50: return getRootInternal().getAs(); Chris@50: } Chris@50: Chris@50: template Chris@50: inline typename RootType::Builder MessageBuilder::initRoot() { Chris@50: return getRootInternal().initAs(); Chris@50: } Chris@50: Chris@50: template Chris@50: inline void MessageBuilder::setRoot(Reader&& value) { Chris@50: getRootInternal().setAs>(value); Chris@50: } Chris@50: Chris@50: template Chris@50: inline typename RootType::Builder MessageBuilder::getRoot() { Chris@50: return getRootInternal().getAs(); Chris@50: } Chris@50: Chris@50: template Chris@50: void MessageBuilder::adoptRoot(Orphan&& orphan) { Chris@50: return getRootInternal().adopt(kj::mv(orphan)); Chris@50: } Chris@50: Chris@50: template Chris@50: typename RootType::Reader MessageReader::getRoot(SchemaType schema) { Chris@50: return getRootInternal().getAs(schema); Chris@50: } Chris@50: Chris@50: template Chris@50: typename RootType::Builder MessageBuilder::getRoot(SchemaType schema) { Chris@50: return getRootInternal().getAs(schema); Chris@50: } Chris@50: Chris@50: template Chris@50: typename RootType::Builder MessageBuilder::initRoot(SchemaType schema) { Chris@50: return getRootInternal().initAs(schema); Chris@50: } Chris@50: Chris@50: template Chris@50: typename RootType::Reader readMessageUnchecked(const word* data) { Chris@50: return AnyPointer::Reader(_::PointerReader::getRootUnchecked(data)).getAs(); Chris@50: } Chris@50: Chris@50: template Chris@50: void copyToUnchecked(Reader&& reader, kj::ArrayPtr uncheckedBuffer) { Chris@50: FlatMessageBuilder builder(uncheckedBuffer); Chris@50: builder.setRoot(kj::fwd(reader)); Chris@50: builder.requireFilled(); Chris@50: } Chris@50: Chris@50: template Chris@50: typename RootType::Reader readDataStruct(kj::ArrayPtr data) { Chris@50: return typename RootType::Reader(_::StructReader(data)); Chris@50: } Chris@50: Chris@50: template Chris@50: typename kj::ArrayPtr writeDataStruct(BuilderType builder) { Chris@50: auto bytes = _::PointerHelpers>::getInternalBuilder(kj::mv(builder)) Chris@50: .getDataSectionAsBlob(); Chris@50: return kj::arrayPtr(reinterpret_cast(bytes.begin()), Chris@50: reinterpret_cast(bytes.end())); Chris@50: } Chris@50: Chris@50: template Chris@50: static typename Type::Reader defaultValue() { Chris@50: return typename Type::Reader(_::StructReader()); Chris@50: } Chris@50: Chris@50: template Chris@50: kj::Array canonicalize(T&& reader) { Chris@50: return _::PointerHelpers>::getInternalReader(reader).canonicalize(); Chris@50: } Chris@50: Chris@50: } // namespace capnp Chris@50: Chris@50: #endif // CAPNP_MESSAGE_H_