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
|
/*
* Copyright (C) 2012 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef SINGLE_STATE_QUEUE_H
#define SINGLE_STATE_QUEUE_H
// Non-blocking single element state queue, or
// Non-blocking single-reader / single-writer multi-word atomic load / store
#include <stdint.h>
#include <cutils/atomic.h>
namespace android {
template<typename T> class SingleStateQueue {
public:
class Mutator;
class Observer;
struct Shared {
// needs to be part of a union so don't define constructor or destructor
friend class Mutator;
friend class Observer;
private:
void init() { mAck = 0; mSequence = 0; }
volatile int32_t mAck;
volatile int32_t mSequence;
T mValue;
};
class Mutator {
public:
Mutator(Shared *shared)
: mSequence(0), mShared(shared)
{
// exactly one of Mutator and Observer must initialize, currently it is Observer
// shared->init();
}
// push new value onto state queue, overwriting previous value;
// returns a sequence number which can be used with ack()
int32_t push(const T& value)
{
Shared *shared = mShared;
int32_t sequence = mSequence;
sequence++;
android_atomic_acquire_store(sequence, &shared->mSequence);
shared->mValue = value;
sequence++;
android_atomic_release_store(sequence, &shared->mSequence);
mSequence = sequence;
// consider signalling a futex here, if we know that observer is waiting
return sequence;
}
// return true if most recent push has been observed
bool ack() const
{
return mShared->mAck - mSequence == 0;
}
// return true if a push with specified sequence number or later has been observed
bool ack(int32_t sequence) const
{
// this relies on 2's complement rollover to detect an ancient sequence number
return mShared->mAck - sequence >= 0;
}
private:
int32_t mSequence;
Shared * const mShared;
};
class Observer {
public:
Observer(Shared *shared)
: mSequence(0), mSeed(1), mShared(shared)
{
// exactly one of Mutator and Observer must initialize, currently it is Observer
shared->init();
}
// return true if value has changed
bool poll(T& value)
{
Shared *shared = mShared;
int32_t before = shared->mSequence;
if (before == mSequence) {
return false;
}
for (int tries = 0; ; ) {
const int MAX_TRIES = 5;
if (before & 1) {
if (++tries >= MAX_TRIES) {
return false;
}
before = shared->mSequence;
} else {
android_memory_barrier();
T temp = shared->mValue;
int32_t after = android_atomic_release_load(&shared->mSequence);
if (after == before) {
value = temp;
shared->mAck = before;
mSequence = before;
return true;
}
if (++tries >= MAX_TRIES) {
return false;
}
before = after;
}
}
}
private:
int32_t mSequence;
int mSeed; // for PRNG
Shared * const mShared;
};
#if 0
SingleStateQueue(void /*Shared*/ *shared);
/*virtual*/ ~SingleStateQueue() { }
static size_t size() { return sizeof(Shared); }
#endif
};
} // namespace android
#endif // SINGLE_STATE_QUEUE_H
|
