blob: 7b49f7aac752a62b99d89004dd2af274856a63ea (
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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "isequencedtaskexecutor.h"
#include <vespa/vespalib/util/time.h>
#include <vespa/vespalib/util/runnable.h>
namespace vespalib {
class SyncableThreadExecutor;
/**
* Class to run multiple tasks in parallel, but tasks with same
* id has to be run in sequence.
*/
class SequencedTaskExecutor final : public ISequencedTaskExecutor
{
public:
using ISequencedTaskExecutor::getExecutorId;
using OptimizeFor = vespalib::Executor::OptimizeFor;
~SequencedTaskExecutor() override;
void setTaskLimit(uint32_t taskLimit) override;
void executeTask(ExecutorId id, vespalib::Executor::Task::UP task) override;
ExecutorId getExecutorId(uint64_t componentId) const override;
void sync() override;
ExecutorStats getStats() override;
void wakeup() override;
/*
* Note that if you choose Optimize::THROUGHPUT, you must ensure only a single producer, or synchronize on the outside.
*
*/
static std::unique_ptr<ISequencedTaskExecutor>
create(vespalib::Runnable::init_fun_t, uint32_t threads, uint32_t taskLimit = 1000,
OptimizeFor optimize = OptimizeFor::LATENCY, uint32_t kindOfWatermark = 0, duration reactionTime = 10ms);
/**
* For testing only
*/
uint32_t getComponentHashSize() const { return _component2Id.size(); }
uint32_t getComponentEffectiveHashSize() const { return _nextId; }
const vespalib::SyncableThreadExecutor* first_executor() const;
private:
explicit SequencedTaskExecutor(std::unique_ptr<std::vector<std::unique_ptr<vespalib::SyncableThreadExecutor>>> executor);
std::unique_ptr<std::vector<std::unique_ptr<vespalib::SyncableThreadExecutor>>> _executors;
const bool _lazyExecutors;
mutable std::vector<uint8_t> _component2Id;
mutable std::mutex _mutex;
mutable uint32_t _nextId;
};
} // namespace search
|