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
|
// ==========================================================================
// SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2018, Knut Reinert, FU Berlin
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * 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.
// * Neither the name of Knut Reinert or the FU Berlin nor the names of
// its contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 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 KNUT REINERT OR THE FU BERLIN 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.
//
// ==========================================================================
// Author: Enrico Siragusa <enrico.siragusa@fu-berlin.de>
// ==========================================================================
// Thread-safe / lock-free sequence operations.
// ==========================================================================
#ifndef SEQAN_PARALLEL_PARALLEL_SEQUENCE_H_
#define SEQAN_PARALLEL_PARALLEL_SEQUENCE_H_
namespace seqan {
// ============================================================================
// Classes
// ============================================================================
// ----------------------------------------------------------------------------
// Class ConcurrentAppender
// ----------------------------------------------------------------------------
template <typename TString, typename TSpec = void>
struct ConcurrentAppender
{
TString * data_host;
ReadWriteLock lock;
ConcurrentAppender() :
data_host()
{}
ConcurrentAppender(TString & string)
{
setHost(*this, string);
}
};
// ============================================================================
// Metafunctions
// ============================================================================
// ----------------------------------------------------------------------------
// Metafunction Value
// ----------------------------------------------------------------------------
template <typename TString, typename TSpec>
struct Value<ConcurrentAppender<TString, TSpec> > : Value<TString> {};
// ============================================================================
// Functions
// ============================================================================
// ----------------------------------------------------------------------------
// Function host()
// ----------------------------------------------------------------------------
template <typename TString, typename TSpec>
inline TString &
host(ConcurrentAppender<TString, TSpec> & me)
{
return *me.data_host;
}
template <typename TString, typename TSpec>
inline TString const &
host(ConcurrentAppender<TString, TSpec> const & me)
{
return *me.data_host;
}
// ----------------------------------------------------------------------------
// Function setHost()
// ----------------------------------------------------------------------------
template <typename TString, typename TSpec>
inline void
setHost(ConcurrentAppender<TString, TSpec> & me, TString & string)
{
me.data_host = &string;
}
// ----------------------------------------------------------------------------
// Function _incLength()
// ----------------------------------------------------------------------------
template <typename TValue, typename TSpec, typename TParallel>
inline typename Size<String<TValue, Alloc<TSpec> > >::Type
_incLength(String<TValue, Alloc<TSpec> > & me, Tag<TParallel> const & tag)
{
return atomicInc(me.data_end, tag) - begin(me, Standard());
}
// ----------------------------------------------------------------------------
// Function _decLength()
// ----------------------------------------------------------------------------
template <typename TValue, typename TSpec, typename TParallel>
inline typename Size<String<TValue, Alloc<TSpec> > >::Type
_decLength(String<TValue, Alloc<TSpec> > & me, Tag<TParallel> const & tag)
{
return atomicDec(me.data_end, tag) - begin(me, Standard());
}
// ----------------------------------------------------------------------------
// Function appendValue()
// ----------------------------------------------------------------------------
template <typename TTargetValue, typename TTargetSpec, typename TValue>
inline void
appendValue(String<TTargetValue, TTargetSpec> & me, TValue const & _value, Insist, Parallel)
{
valueConstruct(begin(me, Standard()) + _incLength(me, Parallel()) - 1, _value);
}
template <typename TString, typename TSpec, typename TValue, typename TExpand, typename TParallel>
inline void
appendValue(ConcurrentAppender<TString, TSpec> & me,
TValue const & val,
Tag<TExpand> const & expandTag,
Tag<TParallel> const & parallelTag)
{
appendValue(host(me), val, expandTag, parallelTag);
}
template <typename TString, typename TSpec, typename TValue, typename TExpand>
inline void
appendValue(ConcurrentAppender<TString, TSpec> & me,
TValue const & val,
Tag<TExpand> const & expandTag,
Parallel)
{
typedef typename Size<TString>::Type TSize;
TString & string = host(me);
while (true)
{
// try to append the value
{
ScopedReadLock<> readLock(me.lock);
TSize newLen = _incLength(string, Parallel());
if (newLen <= capacity(string))
{
valueConstruct(begin(string, Standard()) + newLen - 1, val);
break;
}
_decLength(string, Parallel());
}
// try to extend capacity
{
ScopedWriteLock<> writeLock(me.lock);
TSize cap = capacity(string);
if (cap == length(string))
reserve(string, cap + 1, expandTag);
}
}
}
} // namespace seqan
#endif // #ifndef SEQAN_PARALLEL_PARALLEL_SEQUENCE_H_
|
