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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#pragma once
#include <mutex>
#include <vector>
#include <unordered_map>
#include <osl/conditn.hxx>
#include <osl/mutex.hxx>
#include <rtl/byteseq.hxx>
#include <rtl/ref.hxx>
#include <salhelper/simplereferenceobject.hxx>
#include "jobqueue.hxx"
namespace cppu_threadpool {
class ORequestThread;
struct EqualThreadId
{
bool operator () ( const ::rtl::ByteSequence &a , const ::rtl::ByteSequence &b ) const
{
return a == b;
}
};
struct HashThreadId
{
sal_Int32 operator () ( const ::rtl::ByteSequence &a ) const
{
if( a.getLength() >= 4 )
{
return *reinterpret_cast<sal_Int32 const *>(a.getConstArray());
}
return 0;
}
};
typedef std::unordered_map
<
::rtl::ByteSequence, // ThreadID
std::pair < JobQueue * , JobQueue * >,
HashThreadId,
EqualThreadId
> ThreadIdHashMap;
struct WaitingThread
{
osl::Condition condition;
rtl::Reference< ORequestThread > thread;
explicit WaitingThread(
rtl::Reference<ORequestThread> theThread);
};
typedef std::deque< struct ::cppu_threadpool::WaitingThread * > WaitingThreadDeque;
class DisposedCallerAdmin;
typedef std::shared_ptr<DisposedCallerAdmin> DisposedCallerAdminHolder;
class DisposedCallerAdmin
{
public:
~DisposedCallerAdmin();
static DisposedCallerAdminHolder const & getInstance();
void dispose( void const * nDisposeId );
void destroy( void const * nDisposeId );
bool isDisposed( void const * nDisposeId );
private:
std::mutex m_mutex;
std::vector< void const * > m_vector;
};
class ThreadAdmin
{
public:
ThreadAdmin();
~ThreadAdmin ();
void remove( rtl::Reference< ORequestThread > const & );
void join();
bool add_locked( rtl::Reference< ORequestThread > const & );
void remove_locked( rtl::Reference< ORequestThread > const & );
std::mutex m_mutex;
private:
std::deque< rtl::Reference< ORequestThread > > m_deque;
bool m_disposed;
};
class ThreadPool;
typedef rtl::Reference<ThreadPool> ThreadPoolHolder;
class ThreadPool: public salhelper::SimpleReferenceObject
{
public:
ThreadPool();
virtual ~ThreadPool() override;
void dispose( void const * nDisposeId );
void destroy( void const * nDisposeId );
bool addJob( const ::rtl::ByteSequence &aThreadId,
bool bAsynchron,
void *pThreadSpecificData,
RequestFun * doRequest,
void const * disposeId );
void prepare( const ::rtl::ByteSequence &aThreadId );
void * enter( const ::rtl::ByteSequence &aThreadId, void const * nDisposeId );
/********
* @return true, if queue could be successfully revoked.
********/
bool revokeQueue( const ::rtl::ByteSequence & aThreadId , bool bAsynchron );
void waitInPool( rtl::Reference< ORequestThread > const & pThread );
void joinWorkers();
ThreadAdmin & getThreadAdmin() { return m_aThreadAdmin; }
private:
bool createThread( JobQueue *pQueue, const ::rtl::ByteSequence &aThreadId, bool bAsynchron);
ThreadIdHashMap m_mapQueue;
std::mutex m_mutex;
std::mutex m_mutexWaitingThreadList;
WaitingThreadDeque m_dequeThreads;
DisposedCallerAdminHolder m_DisposedCallerAdmin;
ThreadAdmin m_aThreadAdmin;
};
} // end namespace cppu_threadpool
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
