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
|
/**************************************************************
*
* 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
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*
*************************************************************/
#include <hash_map>
#include <osl/conditn.h>
#include <rtl/byteseq.hxx>
#include <boost/shared_ptr.hpp>
#include "jobqueue.hxx"
using namespace ::rtl;
namespace cppu_threadpool {
class ORequestThread;
struct EqualThreadId
{
sal_Int32 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 *(sal_Int32 *)a.getConstArray();
}
return 0;
}
};
typedef ::std::hash_map
<
ByteSequence, // ThreadID
::std::pair < JobQueue * , JobQueue * >,
HashThreadId,
EqualThreadId
> ThreadIdHashMap;
typedef ::std::list < sal_Int64 > DisposedCallerList;
struct WaitingThread
{
oslCondition condition;
ORequestThread *thread;
};
typedef ::std::list < struct ::cppu_threadpool::WaitingThread * > WaitingThreadList;
class DisposedCallerAdmin;
typedef boost::shared_ptr<DisposedCallerAdmin> DisposedCallerAdminHolder;
class DisposedCallerAdmin
{
public:
~DisposedCallerAdmin();
static DisposedCallerAdminHolder getInstance();
void dispose( sal_Int64 nDisposeId );
void stopDisposing( sal_Int64 nDisposeId );
sal_Bool isDisposed( sal_Int64 nDisposeId );
private:
::osl::Mutex m_mutex;
DisposedCallerList m_lst;
};
class ThreadPool;
typedef boost::shared_ptr<ThreadPool> ThreadPoolHolder;
class ThreadPool
{
public:
ThreadPool();
~ThreadPool();
static ThreadPoolHolder getInstance();
void dispose( sal_Int64 nDisposeId );
void stopDisposing( sal_Int64 nDisposeId );
void addJob( const ByteSequence &aThreadId,
sal_Bool bAsynchron,
void *pThreadSpecificData,
RequestFun * doRequest );
void prepare( const ByteSequence &aThreadId );
void * enter( const ByteSequence &aThreadId, sal_Int64 nDisposeId );
/********
* @return true, if queue could be successfully revoked.
********/
sal_Bool revokeQueue( const ByteSequence & aThreadId , sal_Bool bAsynchron );
void waitInPool( ORequestThread *pThread );
private:
void createThread( JobQueue *pQueue, const ByteSequence &aThreadId, sal_Bool bAsynchron);
ThreadIdHashMap m_mapQueue;
::osl::Mutex m_mutex;
::osl::Mutex m_mutexWaitingThreadList;
WaitingThreadList m_lstThreads;
DisposedCallerAdminHolder m_DisposedCallerAdmin;
};
} // end namespace cppu_threadpool
|
