* almost rewrote BMessageQueue; simplified code, removed over-extensive documentation,
cleanup. * made BMessageQueue::IsLocked() const - the non-const version is still provided for binary compatibility. * Both BMessageQueue::FindMessage() versions are now thread safe, the queue's BLocker is now mutable to allow for this. * renamed BMessage::link to fQueueLink as the "Message4" implementation uses it. git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@14955 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
@@ -399,7 +399,7 @@ static BBlockCache *sMsgCache;
|
||||
void da_swap_var_sized(dyn_array *da);
|
||||
void da_swap_fixed_sized(dyn_array *da);
|
||||
|
||||
BMessage *link;
|
||||
BMessage *fQueueLink;
|
||||
int32 fTarget;
|
||||
BMessage *fOriginal;
|
||||
uint32 fChangeCount;
|
||||
|
||||
@@ -1,65 +1,56 @@
|
||||
//
|
||||
// $Id: MessageQueue.h 1686 2002-10-26 18:59:16Z beveloper $
|
||||
//
|
||||
// This is the BMessageQueue interface for OpenBeOS. It has been created
|
||||
// to be source and binary compatible with the BeOS version of
|
||||
// BMessageQueue.
|
||||
//
|
||||
|
||||
|
||||
#ifndef _OPENBEOS_MESSAGEQUEUE_H
|
||||
#define _OPENBEOS_MESSAGEQUEUE_H
|
||||
/*
|
||||
* Copyright 2001-2005, Haiku, Inc. All Rights Reserved.
|
||||
* Distributed under the terms of the MIT License.
|
||||
*/
|
||||
#ifndef _MESSAGE_QUEUE_H
|
||||
#define _MESSAGE_QUEUE_H
|
||||
|
||||
|
||||
#include <Locker.h>
|
||||
#include <Message.h> /* For convenience */
|
||||
#include <Message.h>
|
||||
/* For convenience */
|
||||
|
||||
|
||||
#ifdef USE_OPENBEOS_NAMESPACE
|
||||
namespace OpenBeOS {
|
||||
#endif
|
||||
|
||||
class BMessageQueue {
|
||||
public:
|
||||
BMessageQueue();
|
||||
virtual ~BMessageQueue();
|
||||
|
||||
void AddMessage(BMessage *message);
|
||||
void RemoveMessage(BMessage *message);
|
||||
|
||||
int32 CountMessages(void) const;
|
||||
bool IsEmpty(void) const;
|
||||
|
||||
BMessage *FindMessage(int32 index) const;
|
||||
BMessage *FindMessage(uint32 what, int32 index=0) const;
|
||||
|
||||
bool Lock(void);
|
||||
void Unlock(void);
|
||||
bool IsLocked(void);
|
||||
public:
|
||||
BMessageQueue();
|
||||
virtual ~BMessageQueue();
|
||||
|
||||
BMessage *NextMessage(void);
|
||||
void AddMessage(BMessage* message);
|
||||
void RemoveMessage(BMessage* message);
|
||||
|
||||
private:
|
||||
int32 CountMessages() const;
|
||||
bool IsEmpty() const;
|
||||
|
||||
// Reserved space in the vtable for future changes to BMessageQueue
|
||||
virtual void _ReservedMessageQueue1(void);
|
||||
virtual void _ReservedMessageQueue2(void);
|
||||
virtual void _ReservedMessageQueue3(void);
|
||||
|
||||
BMessageQueue(const BMessageQueue &);
|
||||
BMessageQueue &operator=(const BMessageQueue &);
|
||||
|
||||
BMessage *fTheQueue;
|
||||
BMessage *fQueueTail;
|
||||
int32 fMessageCount;
|
||||
BLocker fLocker;
|
||||
|
||||
// Reserved space for future changes to BMessageQueue
|
||||
uint32 fReservedSpace[3];
|
||||
BMessage* FindMessage(int32 index) const;
|
||||
BMessage* FindMessage(uint32 what, int32 index = 0) const;
|
||||
|
||||
bool Lock();
|
||||
void Unlock();
|
||||
bool IsLocked() const;
|
||||
|
||||
BMessage *NextMessage();
|
||||
|
||||
private:
|
||||
// Reserved space in the vtable for future changes to BMessageQueue
|
||||
virtual void _ReservedMessageQueue1();
|
||||
virtual void _ReservedMessageQueue2();
|
||||
virtual void _ReservedMessageQueue3();
|
||||
|
||||
BMessageQueue(const BMessageQueue &);
|
||||
BMessageQueue &operator=(const BMessageQueue &);
|
||||
|
||||
bool IsLocked();
|
||||
// this needs to be exported for R5 compatibility and should
|
||||
// be dropped as soon as possible
|
||||
|
||||
private:
|
||||
BMessage* fHead;
|
||||
BMessage* fTail;
|
||||
int32 fMessageCount;
|
||||
mutable BLocker fLock;
|
||||
|
||||
uint32 _reserved[3];
|
||||
};
|
||||
|
||||
#ifdef USE_OPENBEOS_NAMESPACE
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif // _OPENBEOS_MESSAGEQUEUE_H
|
||||
#endif // _MESSAGE_QUEUE_H
|
||||
|
||||
Reference in New Issue
Block a user