blob: 184ff55220fccec710bbe30845212e9b8135e5b3 (
plain) (
blame)
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
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include "sequencedtaskexecutor.h"
#include <vespa/vespalib/util/blockingthreadstackexecutor.h>
using vespalib::BlockingThreadStackExecutor;
namespace search {
namespace {
constexpr uint32_t stackSize = 128 * 1024;
}
SequencedTaskExecutor::SequencedTaskExecutor(uint32_t threads, uint32_t taskLimit)
: ISequencedTaskExecutor(threads),
_executors()
{
for (uint32_t id = 0; id < threads; ++id) {
auto executor = std::make_unique<BlockingThreadStackExecutor>(1, stackSize, taskLimit);
_executors.push_back(std::move(executor));
}
}
SequencedTaskExecutor::~SequencedTaskExecutor()
{
sync();
}
void
SequencedTaskExecutor::setTaskLimit(uint32_t taskLimit)
{
for (const auto &executor : _executors) {
executor->setTaskLimit(taskLimit);
}
}
void
SequencedTaskExecutor::executeTask(ExecutorId id, vespalib::Executor::Task::UP task)
{
assert(id.getId() < _executors.size());
vespalib::ThreadStackExecutorBase &executor(*_executors[id.getId()]);
auto rejectedTask = executor.execute(std::move(task));
assert(!rejectedTask);
}
void
SequencedTaskExecutor::sync()
{
for (auto &executor : _executors) {
executor->sync();
}
}
SequencedTaskExecutor::Stats
SequencedTaskExecutor::getStats()
{
Stats accumulatedStats;
for (auto &executor : _executors) {
accumulatedStats += executor->getStats();
}
return accumulatedStats;
}
} // namespace search
|