summaryrefslogtreecommitdiff
path: root/libs/appleutility/CoreAudio/PublicUtility/CAThreadSafeList.h
diff options
context:
space:
mode:
Diffstat (limited to 'libs/appleutility/CoreAudio/PublicUtility/CAThreadSafeList.h')
-rw-r--r--libs/appleutility/CoreAudio/PublicUtility/CAThreadSafeList.h48
1 files changed, 24 insertions, 24 deletions
diff --git a/libs/appleutility/CoreAudio/PublicUtility/CAThreadSafeList.h b/libs/appleutility/CoreAudio/PublicUtility/CAThreadSafeList.h
index d0b7391476..18c3a0dd51 100644
--- a/libs/appleutility/CoreAudio/PublicUtility/CAThreadSafeList.h
+++ b/libs/appleutility/CoreAudio/PublicUtility/CAThreadSafeList.h
@@ -2,14 +2,14 @@
File: CAThreadSafeList.h
Abstract: Part of CoreAudio Utility Classes
Version: 1.1
-
+
Disclaimer: IMPORTANT: This Apple software is supplied to you by Apple
Inc. ("Apple") in consideration of your agreement to the following
terms, and your use, installation, modification or redistribution of
this Apple software constitutes acceptance of these terms. If you do
not agree with these terms, please do not use, install, modify or
redistribute this Apple software.
-
+
In consideration of your agreement to abide by the following terms, and
subject to these terms, Apple grants you a personal, non-exclusive
license, under Apple's copyrights in this original Apple software (the
@@ -25,13 +25,13 @@
implied, are granted by Apple herein, including but not limited to any
patent rights that may be infringed by your derivative works or by other
works in which the Apple Software may be incorporated.
-
+
The Apple Software is provided by Apple on an "AS IS" basis. APPLE
MAKES NO WARRANTIES, EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION
THE IMPLIED WARRANTIES OF NON-INFRINGEMENT, MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE, REGARDING THE APPLE SOFTWARE OR ITS USE AND
OPERATION ALONE OR IN COMBINATION WITH YOUR PRODUCTS.
-
+
IN NO EVENT SHALL APPLE BE LIABLE FOR ANY SPECIAL, INDIRECT, INCIDENTAL
OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
@@ -40,9 +40,9 @@
AND WHETHER UNDER THEORY OF CONTRACT, TORT (INCLUDING NEGLIGENCE),
STRICT LIABILITY OR OTHERWISE, EVEN IF APPLE HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
-
+
Copyright (C) 2014 Apple Inc. All Rights Reserved.
-
+
*/
#ifndef __CAThreadSafeList_h__
#define __CAThreadSafeList_h__
@@ -60,7 +60,7 @@ private:
Node * mNext;
EEventType mEventType;
T mObject;
-
+
Node *& next() { return mNext; }
};
@@ -69,19 +69,19 @@ public:
public:
iterator() { }
iterator(Node *n) : mNode(n) { }
-
+
bool operator == (const iterator &other) const { return this->mNode == other.mNode; }
bool operator != (const iterator &other) const { return this->mNode != other.mNode; }
-
+
T & operator * () const { return mNode->mObject; }
-
+
iterator & operator ++ () { mNode = mNode->next(); return *this; } // preincrement
iterator operator ++ (int) { iterator tmp = *this; mNode = mNode->next(); return tmp; } // postincrement
-
+
private:
Node * mNode;
};
-
+
TThreadSafeList() { }
~TThreadSafeList()
{
@@ -89,9 +89,9 @@ public:
mPendingList.free_all();
mFreeList.free_all();
}
-
+
// These may be called on any thread
-
+
void deferred_add(const T &obj) // can be called on any thread
{
Node *node = AllocNode();
@@ -100,7 +100,7 @@ public:
mPendingList.push_atomic(node);
//mPendingList.dump("pending after add");
}
-
+
void deferred_remove(const T &obj) // can be called on any thread
{
Node *node = AllocNode();
@@ -109,22 +109,22 @@ public:
mPendingList.push_atomic(node);
//mPendingList.dump("pending after remove");
}
-
+
void deferred_clear() // can be called on any thread
{
Node *node = AllocNode();
node->mEventType = kClear;
mPendingList.push_atomic(node);
}
-
+
// These must be called from only one thread
-
+
void update() // must only be called from one thread
{
NodeStack reversed;
Node *event, *node, *next;
bool workDone = false;
-
+
// reverse the events so they are in order
event = mPendingList.pop_all();
while (event != NULL) {
@@ -136,7 +136,7 @@ public:
if (workDone) {
//reversed.dump("pending popped");
//mActiveList.dump("active before update");
-
+
// now process them
while ((event = reversed.pop_NA()) != NULL) {
switch (event->mEventType) {
@@ -190,14 +190,14 @@ public:
//mActiveList.dump("active after update");
}
}
-
+
iterator begin() const {
//mActiveList.dump("active at begin");
return iterator(mActiveList.head());
}
iterator end() const { return iterator(NULL); }
-
+
private:
Node * AllocNode()
{
@@ -206,7 +206,7 @@ private:
node = (Node *)CA_malloc(sizeof(Node));
return node;
}
-
+
void FreeNode(Node *node)
{
mFreeList.push_atomic(node);
@@ -220,7 +220,7 @@ private:
while ((node = this->pop_NA()) != NULL)
free(node);
}
-
+
Node ** phead() { return &this->mHead; }
Node * head() const { return this->mHead; }
};