blob: b7f6df85d7c9f22e8ab4fa96055f73d179e0eabd (
plain)
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
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2014 CohortFS, LLC
*
* This is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software
* Foundation. See file COPYING.
*
*/
#ifndef QUEUE_STRATEGY_H
#define QUEUE_STRATEGY_H
#include <vector>
#include <memory>
#include <boost/intrusive/list.hpp>
#include "DispatchStrategy.h"
#include "msg/Messenger.h"
namespace bi = boost::intrusive;
class QueueStrategy : public DispatchStrategy {
ceph::mutex lock = ceph::make_mutex("QueueStrategy::lock");
const int n_threads;
bool stop;
Message::Queue mqueue;
class QSThread : public Thread {
public:
bi::list_member_hook<> thread_q;
QueueStrategy *dq;
ceph::condition_variable cond;
explicit QSThread(QueueStrategy *dq) : thread_q(), dq(dq) {}
void* entry() {
dq->entry(this);
return NULL;
}
typedef bi::list< QSThread,
bi::member_hook< QSThread,
bi::list_member_hook<>,
&QSThread::thread_q > > Queue;
};
std::vector<std::unique_ptr<QSThread>> threads; //< all threads
QSThread::Queue disp_threads; //< waiting threads
public:
explicit QueueStrategy(int n_threads);
void ds_dispatch(Message *m) override;
void shutdown() override;
void start() override;
void wait() override;
void entry(QSThread *thrd);
virtual ~QueueStrategy() {}
};
#endif /* QUEUE_STRATEGY_H */
|
