1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224
|
/*
* Copyright (C) 2010-2020 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#include "Attachment.h"
#include "MessageNames.h"
#include "ReceiverMatcher.h"
#include <wtf/Function.h>
#include <wtf/OptionSet.h>
#include <wtf/Vector.h>
#if PLATFORM(MAC)
#include "ImportanceAssertion.h"
#endif
namespace IPC {
enum class MessageFlags : uint8_t;
enum class ShouldDispatchWhenWaitingForSyncReply : uint8_t;
template<typename, typename> struct ArgumentCoder;
template<typename, typename> struct HasLegacyDecoder;
template<typename, typename> struct HasModernDecoder;
class Decoder {
WTF_MAKE_FAST_ALLOCATED;
public:
static std::unique_ptr<Decoder> create(const uint8_t* buffer, size_t bufferSize, Vector<Attachment>&&);
using BufferDeallocator = Function<void(const uint8_t*, size_t)>;
static std::unique_ptr<Decoder> create(const uint8_t* buffer, size_t bufferSize, BufferDeallocator&&, Vector<Attachment>&&);
Decoder(const uint8_t* stream, size_t streamSize, uint64_t destinationID);
~Decoder();
Decoder(const Decoder&) = delete;
Decoder(Decoder&&) = delete;
Decoder& operator=(const Decoder&) = delete;
Decoder& operator=(Decoder&&) = delete;
ReceiverName messageReceiverName() const { return receiverName(m_messageName); }
MessageName messageName() const { return m_messageName; }
uint64_t destinationID() const { return m_destinationID; }
bool matches(const ReceiverMatcher& matcher) const { return matcher.matches(messageReceiverName(), destinationID()); }
bool isSyncMessage() const { return messageIsSync(messageName()); }
ShouldDispatchWhenWaitingForSyncReply shouldDispatchMessageWhenWaitingForSyncReply() const;
bool shouldUseFullySynchronousModeForTesting() const;
bool shouldMaintainOrderingWithAsyncMessages() const;
#if PLATFORM(MAC)
void setImportanceAssertion(ImportanceAssertion&&);
#endif
static std::unique_ptr<Decoder> unwrapForTesting(Decoder&);
const uint8_t* buffer() const { return m_buffer; }
size_t currentBufferPosition() const { return m_bufferPos - m_buffer; }
size_t length() const { return m_bufferEnd - m_buffer; }
WARN_UNUSED_RETURN bool isValid() const { return m_bufferPos != nullptr; }
void markInvalid() { m_bufferPos = nullptr; }
WARN_UNUSED_RETURN bool decodeFixedLengthData(uint8_t* data, size_t, size_t alignment);
// The data in the returned pointer here will only be valid for the lifetime of the Decoder object.
// Returns nullptr on failure.
WARN_UNUSED_RETURN const uint8_t* decodeFixedLengthReference(size_t, size_t alignment);
template<typename T>
WARN_UNUSED_RETURN bool decode(T& t)
{
using Impl = ArgumentCoder<std::remove_const_t<std::remove_reference_t<T>>, void>;
if constexpr(HasLegacyDecoder<T, Impl>::value) {
if (UNLIKELY(!Impl::decode(*this, t))) {
markInvalid();
return false;
}
} else {
std::optional<T> optional { decode<T>() };
if (UNLIKELY(!optional)) {
markInvalid();
return false;
}
t = WTFMove(*optional);
}
return true;
}
template<typename T>
Decoder& operator>>(std::optional<T>& t)
{
t = decode<T>();
return *this;
}
// The preferred decode() function. Can decode T which is not default constructible when T
// has a modern decoder, e.g decoding function that returns std::optional.
template<typename T>
std::optional<T> decode()
{
using Impl = ArgumentCoder<std::remove_const_t<std::remove_reference_t<T>>, void>;
if constexpr(HasModernDecoder<T, Impl>::value) {
std::optional<T> t { Impl::decode(*this) };
if (UNLIKELY(!t))
markInvalid();
return t;
} else {
std::optional<T> t { T { } };
if (LIKELY(Impl::decode(*this, *t)))
return t;
markInvalid();
return std::nullopt;
}
}
template<typename T>
bool bufferIsLargeEnoughToContain(size_t numElements) const
{
static_assert(std::is_arithmetic<T>::value, "Type T must have a fixed, known encoded size!");
if (numElements > std::numeric_limits<size_t>::max() / sizeof(T))
return false;
return bufferIsLargeEnoughToContain(alignof(T), numElements * sizeof(T));
}
std::optional<Attachment> takeLastAttachment();
static constexpr bool isIPCDecoder = true;
private:
Decoder(const uint8_t* buffer, size_t bufferSize, BufferDeallocator&&, Vector<Attachment>&&);
bool alignBufferPosition(size_t alignment, size_t);
bool bufferIsLargeEnoughToContain(size_t alignment, size_t) const;
const uint8_t* m_buffer;
const uint8_t* m_bufferPos;
const uint8_t* m_bufferEnd;
BufferDeallocator m_bufferDeallocator;
Vector<Attachment> m_attachments;
OptionSet<MessageFlags> m_messageFlags;
MessageName m_messageName;
uint64_t m_destinationID;
#if PLATFORM(MAC)
ImportanceAssertion m_importanceAssertion;
#endif
};
inline const uint8_t* roundUpToAlignment(const uint8_t* ptr, size_t alignment)
{
// Assert that the alignment is a power of 2.
ASSERT(alignment && !(alignment & (alignment - 1)));
uintptr_t alignmentMask = alignment - 1;
return reinterpret_cast<uint8_t*>((reinterpret_cast<uintptr_t>(ptr) + alignmentMask) & ~alignmentMask);
}
inline bool alignedBufferIsLargeEnoughToContain(const uint8_t* alignedPosition, const uint8_t* bufferStart, const uint8_t* bufferEnd, size_t size)
{
// When size == 0 for the last argument and it's a variable length byte array,
// bufferStart == alignedPosition == bufferEnd, so checking (bufferEnd >= alignedPosition)
// is not an off-by-one error since (static_cast<size_t>(bufferEnd - alignedPosition) >= size)
// will catch issues when size != 0.
return bufferEnd >= alignedPosition && bufferStart <= alignedPosition && static_cast<size_t>(bufferEnd - alignedPosition) >= size;
}
inline bool Decoder::alignBufferPosition(size_t alignment, size_t size)
{
const uint8_t* alignedPosition = roundUpToAlignment(m_bufferPos, alignment);
if (UNLIKELY(!alignedBufferIsLargeEnoughToContain(alignedPosition, m_buffer, m_bufferEnd, size))) {
// We've walked off the end of this buffer.
markInvalid();
return false;
}
m_bufferPos = alignedPosition;
return true;
}
inline bool Decoder::bufferIsLargeEnoughToContain(size_t alignment, size_t size) const
{
return alignedBufferIsLargeEnoughToContain(roundUpToAlignment(m_bufferPos, alignment), m_buffer, m_bufferEnd, size);
}
inline bool Decoder::decodeFixedLengthData(uint8_t* data, size_t size, size_t alignment)
{
if (!alignBufferPosition(alignment, size))
return false;
memcpy(data, m_bufferPos, size);
m_bufferPos += size;
return true;
}
} // namespace IPC
|