forked from posterior/loom
-
Notifications
You must be signed in to change notification settings - Fork 0
/
kind_pipeline.cc
142 lines (128 loc) · 4.76 KB
/
kind_pipeline.cc
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
// Copyright (c) 2014, Salesforce.com, Inc. All rights reserved.
// Copyright (c) 2015, Google, Inc.
//
// 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 Salesforce.com 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 THE
// COPYRIGHT HOLDER OR CONTRIBUTORS 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.
#include <loom/kind_pipeline.hpp>
namespace loom
{
KindPipeline::KindPipeline (
const protobuf::Config::Kernels::Kind & config,
CrossCat & cross_cat,
StreamInterval & rows,
Assignments & assignments,
KindKernel & kind_kernel,
rng_t & rng) :
pipeline_(config.row_queue_capacity(), stage_count),
cross_cat_(cross_cat),
rows_(rows),
assignments_(assignments),
kind_kernel_(kind_kernel),
kind_count_(0),
rng_(rng)
{
start_threads(config.parser_threads());
}
template<class Fun>
inline void KindPipeline::add_thread (
size_t stage_number,
const Fun & fun)
{
ThreadState thread;
thread.rng.seed(rng_());
pipeline_.unsafe_add_thread(stage_number, thread, fun);
}
void KindPipeline::start_threads (size_t parser_threads)
{
// unzip
add_thread(0, [this](Task & task, const ThreadState &){
if (task.add) {
task.parsed.clear();
rows_.read_unassigned(task.raw);
}
});
add_thread(0, [this](Task & task, const ThreadState &){
if (not task.add) {
task.parsed.clear();
rows_.read_assigned(task.raw);
}
});
// parse
LOOM_ASSERT_LT(0, parser_threads);
for (size_t i = 0; i < parser_threads; ++i) {
add_thread(1, [this, parser_threads](Task & task, ThreadState &){
if (not task.parsed.test_and_set()) {
task.row.ParseFromArray(task.raw.data(), task.raw.size());
cross_cat_.splitter.split(task.row.diff(), task.partial_diffs);
cross_cat_.simplify(task.partial_diffs);
}
});
}
// add/remove
auto & rowids = assignments_.rowids();
add_thread(2, [&rowids](const Task & task, ThreadState &){
if (task.add) {
bool ok = rowids.try_push(task.row.id());
LOOM_ASSERT1(ok, "duplicate row: " << task.row.id());
} else {
const auto rowid = rowids.pop();
if (LOOM_DEBUG_LEVEL >= 1) {
LOOM_ASSERT_EQ(rowid, task.row.id());
}
}
});
start_kind_threads();
pipeline_.validate();
}
void KindPipeline::start_kind_threads ()
{
while (kind_count_ < cross_cat_.kinds.size()) {
size_t i = kind_count_++;
// add/remove
add_thread(2, [i, this](const Task & task, ThreadState & thread){
if (LOOM_LIKELY(i < cross_cat_.kinds.size())) {
if (task.add) {
auto groupid = kind_kernel_.add_to_cross_cat(
i,
task.partial_diffs[i],
thread.scores,
thread.rng);
kind_kernel_.add_to_kind_proposer(
i,
groupid,
task.row.diff(),
thread.rng);
} else {
auto groupid = kind_kernel_.remove_from_cross_cat(
i,
task.partial_diffs[i],
thread.rng);
kind_kernel_.remove_from_kind_proposer(i, groupid);
}
}
});
}
}
} // namespace loom