3 Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU Lesser General Public License as published by
7 the Free Software Foundation; either version 2.1 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
20 #ifndef UTIL_THREAD_HEADER
21 #define UTIL_THREAD_HEADER
23 #include "../irrlichttypes.h"
24 #include "../jthread/jthread.h"
25 #include "../jthread/jmutex.h"
26 #include "../jthread/jmutexautolock.h"
32 MutexedVariable(T value):
39 JMutexAutoLock lock(m_mutex);
45 JMutexAutoLock lock(m_mutex);
49 // You'll want to grab this in a SharedPtr
50 JMutexAutoLock * getLock()
52 return new JMutexAutoLock(m_mutex);
55 // You pretty surely want to grab the lock when accessing this
63 A single worker thread - multiple client threads queue framework.
65 template<typename Key, typename T, typename Caller, typename CallerData>
71 std::pair<Caller, CallerData> caller;
74 template<typename Key, typename T, typename Caller, typename CallerData>
75 class ResultQueue: public MutexedQueue< GetResult<Key, T, Caller, CallerData> >
79 template<typename Caller, typename Data, typename Key, typename T>
85 ResultQueue< Key, T, Caller, Data>* dest;
88 template<typename Key, typename T, typename Caller, typename CallerData>
104 std::list<CallerInfo<Caller, CallerData, Key, T> > callers;
108 * Notes for RequestQueue usage
109 * @param Key unique key to identify a request for a specific resource
111 * @param Caller unique id of calling thread
112 * @param CallerData data passed back to caller
114 template<typename Key, typename T, typename Caller, typename CallerData>
120 return m_queue.empty();
123 void add(Key key, Caller caller, CallerData callerdata,
124 ResultQueue<Key, T, Caller, CallerData> *dest)
126 JMutexAutoLock lock(m_queue.getMutex());
129 If the caller is already on the list, only update CallerData
131 for(typename std::list< GetRequest<Key, T, Caller, CallerData> >::iterator
132 i = m_queue.getList().begin();
133 i != m_queue.getList().end(); ++i)
135 GetRequest<Key, T, Caller, CallerData> &request = *i;
137 if(request.key == key)
139 for(typename std::list< CallerInfo<Caller, CallerData, Key, T> >::iterator
140 i = request.callers.begin();
141 i != request.callers.end(); ++i)
143 CallerInfo<Caller, CallerData, Key, T> &ca = *i;
144 if(ca.caller == caller)
146 ca.data = callerdata;
150 CallerInfo<Caller, CallerData, Key, T> ca;
152 ca.data = callerdata;
154 request.callers.push_back(ca);
160 Else add a new request to the queue
163 GetRequest<Key, T, Caller, CallerData> request;
165 CallerInfo<Caller, CallerData, Key, T> ca;
167 ca.data = callerdata;
169 request.callers.push_back(ca);
171 m_queue.getList().push_back(request);
174 GetRequest<Key, T, Caller, CallerData> pop(bool wait_if_empty=false)
176 return m_queue.pop_front(wait_if_empty);
179 void pushResult(GetRequest<Key, T, Caller, CallerData> req,
182 for(typename std::list< CallerInfo<Caller, CallerData, Key, T> >::iterator
183 i = req.callers.begin();
184 i != req.callers.end(); ++i)
186 CallerInfo<Caller, CallerData, Key, T> &ca = *i;
188 GetResult<Key,T,Caller,CallerData> result;
190 result.key = req.key;
192 result.caller.first = ca.caller;
193 result.caller.second = ca.data;
195 ca.dest->push_back(result);
200 MutexedQueue< GetRequest<Key, T, Caller, CallerData> > m_queue;