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 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239
|
/*
* Copyright (C) 2010-2023 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 "SyncRequestID.h"
#include <wtf/ArgumentCoder.h>
#include <wtf/Function.h>
#include <wtf/HashSet.h>
#include <wtf/OptionSet.h>
#include <wtf/RetainPtr.h>
#include <wtf/StdLibExtras.h>
#include <wtf/TZoneMalloc.h>
#include <wtf/Vector.h>
#if PLATFORM(MAC)
#include "ImportanceAssertion.h"
#endif
#ifdef __OBJC__
typedef Class ClassStructPtr;
#else
typedef struct objc_class* ClassStructPtr;
#endif
namespace IPC {
enum class MessageFlags : uint8_t;
enum class ShouldDispatchWhenWaitingForSyncReply : uint8_t;
template<typename, typename> struct ArgumentCoder;
#ifdef __OBJC__
template<typename T> using IsObjCObject = std::enable_if_t<std::is_convertible<T *, id>::value, T *>;
template<typename T> using IsNotObjCObject = std::enable_if_t<!std::is_convertible<T *, id>::value, T *>;
template<typename T, typename = IsObjCObject<T>> std::optional<RetainPtr<T>> decodeRequiringAllowedClasses(Decoder&);
template<typename T, typename = IsObjCObject<T>> Class getClass()
{
return [T class];
}
#endif
#if PLATFORM(COCOA)
using AllowedClassHashSet = HashSet<RetainPtr<ClassStructPtr>>;
#endif
class Decoder {
WTF_MAKE_TZONE_ALLOCATED(Decoder);
public:
static std::unique_ptr<Decoder> create(std::span<const uint8_t> buffer, Vector<Attachment>&&);
using BufferDeallocator = Function<void(std::span<const uint8_t>)>;
static std::unique_ptr<Decoder> create(std::span<const uint8_t> buffer, BufferDeallocator&&, Vector<Attachment>&&);
Decoder(std::span<const uint8_t> stream, uint64_t destinationID);
~Decoder();
Decoder() = delete;
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; }
SyncRequestID syncRequestID() const { ASSERT(m_syncRequestID); return *m_syncRequestID; }
bool matches(const ReceiverMatcher& matcher) const { return matcher.matches(messageReceiverName(), destinationID()); }
bool isSyncMessage() const { return messageIsSync(messageName()); }
ShouldDispatchWhenWaitingForSyncReply shouldDispatchMessageWhenWaitingForSyncReply() const;
bool isAllowedWhenWaitingForSyncReply() const { return messageAllowedWhenWaitingForSyncReply(messageName()) || m_isAllowedWhenWaitingForSyncReplyOverride; }
bool isAllowedWhenWaitingForUnboundedSyncReply() const { return messageAllowedWhenWaitingForUnboundedSyncReply(messageName()); }
bool shouldUseFullySynchronousModeForTesting() const;
bool shouldMaintainOrderingWithAsyncMessages() const;
void setIsAllowedWhenWaitingForSyncReplyOverride(bool value) { m_isAllowedWhenWaitingForSyncReplyOverride = value; }
#if PLATFORM(MAC)
void setImportanceAssertion(ImportanceAssertion&&);
#endif
static std::unique_ptr<Decoder> unwrapForTesting(Decoder&);
std::span<const uint8_t> span() const { return m_buffer; }
size_t currentBufferOffset() const { return std::distance(m_buffer.begin(), m_bufferPosition); }
WARN_UNUSED_RETURN bool isValid() const { return !!m_buffer.data(); }
void markInvalid()
{
auto buffer = std::exchange(m_buffer, { });
if (m_bufferDeallocator && !buffer.empty())
m_bufferDeallocator(WTFMove(buffer));
}
template<typename T>
WARN_UNUSED_RETURN std::span<const T> decodeSpan(size_t);
template<typename T>
WARN_UNUSED_RETURN std::optional<T> decodeObject();
template<typename T>
Decoder& operator>>(std::optional<T>& t)
{
t = decode<T>();
return *this;
}
template<typename T>
std::optional<T> decode()
{
std::optional<T> t { ArgumentCoder<std::remove_cvref_t<T>, void>::decode(*this) };
if (UNLIKELY(!t))
markInvalid();
return t;
}
#ifdef __OBJC__
template<typename T, typename = IsObjCObject<T>>
std::optional<RetainPtr<T>> decodeWithAllowedClasses(const AllowedClassHashSet& allowedClasses = { getClass<T>() })
{
m_allowedClasses = allowedClasses;
return IPC::decodeRequiringAllowedClasses<T>(*this);
}
template<typename T, typename = IsNotObjCObject<T>>
std::optional<T> decodeWithAllowedClasses(const AllowedClassHashSet& allowedClasses)
{
m_allowedClasses = allowedClasses;
return decode<T>();
}
AllowedClassHashSet& allowedClasses() { return m_allowedClasses; }
#endif
std::optional<Attachment> takeLastAttachment();
void setIndexOfDecodingFailure(int32_t indexOfObjectFailingDecoding)
{
if (m_indexOfObjectFailingDecoding == -1)
m_indexOfObjectFailingDecoding = indexOfObjectFailingDecoding;
}
int32_t indexOfObjectFailingDecoding() const { return m_indexOfObjectFailingDecoding; }
private:
Decoder(std::span<const uint8_t> buffer, BufferDeallocator&&, Vector<Attachment>&&);
std::span<const uint8_t> m_buffer;
std::span<const uint8_t>::iterator m_bufferPosition;
BufferDeallocator m_bufferDeallocator;
Vector<Attachment> m_attachments;
OptionSet<MessageFlags> m_messageFlags;
bool m_isAllowedWhenWaitingForSyncReplyOverride { false };
MessageName m_messageName { MessageName::Invalid };
#if PLATFORM(MAC)
ImportanceAssertion m_importanceAssertion;
#endif
#if PLATFORM(COCOA)
AllowedClassHashSet m_allowedClasses;
#endif
uint64_t m_destinationID;
Markable<SyncRequestID> m_syncRequestID;
int32_t m_indexOfObjectFailingDecoding { -1 };
};
template<>
inline std::optional<Attachment> Decoder::decode<Attachment>()
{
return takeLastAttachment();
}
inline bool alignedBufferIsLargeEnoughToContain(size_t bufferSize, const size_t alignedBufferPosition, size_t bytesNeeded)
{
// When bytesNeeded == 0 for the last argument and it's a variable length byte array,
// alignedBufferPosition == bufferSize, so checking (bufferSize >= alignedBufferPosition)
// is not an off-by-one error since (bufferSize - alignedBufferPosition) >= bytesNeeded)
// will catch issues when bytesNeeded > 0.
return (bufferSize >= alignedBufferPosition) && ((bufferSize - alignedBufferPosition) >= bytesNeeded);
}
template<typename T>
inline std::span<const T> Decoder::decodeSpan(size_t size)
{
if (size > std::numeric_limits<size_t>::max() / sizeof(T))
return { };
const size_t alignedBufferPosition = static_cast<size_t>(std::distance(m_buffer.data(), roundUpToMultipleOf<alignof(T)>(std::to_address(m_bufferPosition))));
const size_t bytesNeeded = size * sizeof(T);
if (UNLIKELY(!alignedBufferIsLargeEnoughToContain(m_buffer.size_bytes(), alignedBufferPosition, bytesNeeded))) {
markInvalid();
return { };
}
m_bufferPosition = m_buffer.begin() + alignedBufferPosition + bytesNeeded;
return spanReinterpretCast<const T>(m_buffer.subspan(alignedBufferPosition, bytesNeeded));
}
template<typename T>
inline std::optional<T> Decoder::decodeObject()
{
static_assert(std::is_trivially_copyable_v<T>);
auto data = decodeSpan<T>(1);
if (!data.data())
return std::nullopt;
return data[0];
}
} // namespace IPC
|