/* * Copyright 2005-2015, Haiku Inc. All rights reserved. * Distributed under the terms of the MIT License. * * Authors: * Michael Lotz */ #ifndef _MESSAGE_PRIVATE_H_ #define _MESSAGE_PRIVATE_H_ #include #include #include #include #define MESSAGE_BODY_HASH_TABLE_SIZE 5 #define MAX_DATA_PREALLOCATION B_PAGE_SIZE * 10 #define MAX_FIELD_PREALLOCATION 50 static const int32 kPortMessageCode = 'pjpp'; enum { MESSAGE_FLAG_VALID = 0x0001, MESSAGE_FLAG_REPLY_REQUIRED = 0x0002, MESSAGE_FLAG_REPLY_DONE = 0x0004, MESSAGE_FLAG_IS_REPLY = 0x0008, MESSAGE_FLAG_WAS_DELIVERED = 0x0010, MESSAGE_FLAG_HAS_SPECIFIERS = 0x0020, MESSAGE_FLAG_WAS_DROPPED = 0x0040, MESSAGE_FLAG_PASS_BY_AREA = 0x0080, MESSAGE_FLAG_REPLY_AS_KMESSAGE = 0x0100 }; enum { FIELD_FLAG_VALID = 0x0001, FIELD_FLAG_FIXED_SIZE = 0x0002, }; struct BMessage::field_header { uint16 flags; uint16 name_length; type_code type; uint32 count; uint32 data_size; uint32 offset; int32 next_field; } _PACKED; struct BMessage::message_header { uint32 format; uint32 what; uint32 flags; int32 target; int32 current_specifier; area_id message_area; // reply info port_id reply_port; int32 reply_target; team_id reply_team; // body info uint32 data_size; uint32 field_count; uint32 hash_table_size; int32 hash_table[MESSAGE_BODY_HASH_TABLE_SIZE]; /* The hash table does contain indexes into the field list and not direct offsets to the fields. This has the advantage of not needing to update offsets in two locations. The hash table must be reevaluated when we remove a field though. */ } _PACKED; class BMessage::Private { public: Private(BMessage *msg) : fMessage(msg) { } Private(BMessage &msg) : fMessage(&msg) { } void SetTarget(int32 token) { fMessage->fHeader->target = token; } void SetReply(BMessenger messenger) { BMessenger::Private messengerPrivate(messenger); fMessage->fHeader->reply_port = messengerPrivate.Port(); fMessage->fHeader->reply_target = messengerPrivate.Token(); fMessage->fHeader->reply_team = messengerPrivate.Team(); } void SetReply(team_id team, port_id port, int32 target) { fMessage->fHeader->reply_port = port; fMessage->fHeader->reply_target = target; fMessage->fHeader->reply_team = team; } int32 GetTarget() { return fMessage->fHeader->target; } bool UsePreferredTarget() { return fMessage->fHeader->target == B_PREFERRED_TOKEN; } void SetWasDropped(bool wasDropped) { if (wasDropped) fMessage->fHeader->flags |= MESSAGE_FLAG_WAS_DROPPED; else fMessage->fHeader->flags &= ~MESSAGE_FLAG_WAS_DROPPED; } status_t Clear() { return fMessage->_Clear(); } status_t InitHeader() { return fMessage->_InitHeader(); } BMessage::message_header* GetMessageHeader() { return fMessage->fHeader; } BMessage::field_header* GetMessageFields() { return fMessage->fFields; } uint8* GetMessageData() { return fMessage->fData; } status_t FlattenToArea(message_header **header) const { return fMessage->_FlattenToArea(header); } status_t SendMessage(port_id port, team_id portOwner, int32 token, bigtime_t timeout, bool replyRequired, BMessenger &replyTo) const { return fMessage->_SendMessage(port, portOwner, token, timeout, replyRequired, replyTo); } status_t SendMessage(port_id port, team_id portOwner, int32 token, BMessage *reply, bigtime_t sendTimeout, bigtime_t replyTimeout) const { return fMessage->_SendMessage(port, portOwner, token, reply, sendTimeout, replyTimeout); } void* ArchivingPointer() { return fMessage->fArchivingPointer; } void SetArchivingPointer(void* pointer) { fMessage->fArchivingPointer = pointer; } // static methods static status_t SendFlattenedMessage(void *data, int32 size, port_id port, int32 token, bigtime_t timeout) { return BMessage::_SendFlattenedMessage(data, size, port, token, timeout); } static void StaticInit() { BMessage::_StaticInit(); } static void StaticReInitForkedChild() { BMessage::_StaticReInitForkedChild(); } static void StaticCleanup() { BMessage::_StaticCleanup(); } static void StaticCacheCleanup() { BMessage::_StaticCacheCleanup(); } private: BMessage* fMessage; }; #endif // _MESSAGE_PRIVATE_H_