Mercurial > hg > orthanc

comparison Core/MultiThreading/SharedMessageQueue.cpp @ 450:58b433bb9762

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
SharedMessageQueue
author Sebastien Jodogne <s.jodogne@gmail.com>
date Thu, 04 Jul 2013 09:34:09 +0200
parents
children 80f7539147a2
comparison
equal deleted inserted replaced
449:694f06a84bf4 450:58b433bb9762
1 /**
2 * Orthanc - A Lightweight, RESTful DICOM Store
3 * Copyright (C) 2012-2013 Medical Physics Department, CHU of Liege,
4 * Belgium
5 *
6 * This program is free software: you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License as
8 * published by the Free Software Foundation, either version 3 of the
9 * License, or (at your option) any later version.
10 *
11 * In addition, as a special exception, the copyright holders of this
12 * program give permission to link the code of its release with the
13 * OpenSSL project's "OpenSSL" library (or with modified versions of it
14 * that use the same license as the "OpenSSL" library), and distribute
15 * the linked executables. You must obey the GNU General Public License
16 * in all respects for all of the code used other than "OpenSSL". If you
17 * modify file(s) with this exception, you may extend this exception to
18 * your version of the file(s), but you are not obligated to do so. If
19 * you do not wish to do so, delete this exception statement from your
20 * version. If you delete this exception statement from all source files
21 * in the program, then also delete it here.
22 *
23 * This program is distributed in the hope that it will be useful, but
24 * WITHOUT ANY WARRANTY; without even the implied warranty of
25 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
26 * General Public License for more details.
27 *
28 * You should have received a copy of the GNU General Public License
29 * along with this program. If not, see <http://www.gnu.org/licenses/>.
30 **/
31
32
33 #include "SharedMessageQueue.h"
34
35 namespace Orthanc
36 {
37 SharedMessageQueue::SharedMessageQueue(unsigned int maxSize)
38 {
39 maxSize_ = maxSize;
40 }
41
42
43 SharedMessageQueue::~SharedMessageQueue()
44 {
45 for (Queue::iterator it = queue_.begin(); it != queue_.end(); it++)
46 {
47 delete *it;
48 }
49 }
50
51
52 void SharedMessageQueue::Enqueue(IDynamicObject* message)
53 {
54 boost::mutex::scoped_lock lock(mutex_);
55
56 if (maxSize_ != 0 && queue_.size() > maxSize_)
57 {
58 // Too many elements in the queue: First remove the oldest
59 delete queue_.front();
60 queue_.pop_front();
61 }
62
63 queue_.push_back(message);
64 elementAvailable_.notify_one();
65 }
66
67
68 IDynamicObject* SharedMessageQueue::Dequeue(int32_t millisecondsTimeout)
69 {
70 boost::mutex::scoped_lock lock(mutex_);
71
72 // Wait for a message to arrive in the FIFO queue
73 while (queue_.empty())
74 {
75 if (millisecondsTimeout == 0)
76 {
77 elementAvailable_.wait(lock);
78 }
79 else
80 {
81 bool success = elementAvailable_.timed_wait
82 (lock, boost::posix_time::milliseconds(millisecondsTimeout));
83 if (!success)
84 {
85 return NULL;
86 }
87 }
88 }
89
90 std::auto_ptr<IDynamicObject> message(queue_.front());
91 queue_.pop_front();
92
93 return message.release();
94 }
95 }