|
1367
|
1 /**
|
|
|
2 * Orthanc - A Lightweight, RESTful DICOM Store
|
|
1900
|
3 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics
|
|
1367
|
4 * Department, University Hospital of Liege, 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 "../PrecompiledHeaders.h"
|
|
|
34 #include "SharedArchive.h"
|
|
|
35
|
|
|
36
|
|
|
37 namespace Orthanc
|
|
|
38 {
|
|
|
39 void SharedArchive::RemoveInternal(const std::string& id)
|
|
|
40 {
|
|
|
41 Archive::iterator it = archive_.find(id);
|
|
|
42
|
|
|
43 if (it != archive_.end())
|
|
|
44 {
|
|
|
45 delete it->second;
|
|
|
46 archive_.erase(it);
|
|
|
47 }
|
|
|
48 }
|
|
|
49
|
|
|
50
|
|
|
51 SharedArchive::Accessor::Accessor(SharedArchive& that,
|
|
|
52 const std::string& id) :
|
|
|
53 lock_(that.mutex_)
|
|
|
54 {
|
|
|
55 Archive::iterator it = that.archive_.find(id);
|
|
|
56
|
|
|
57 if (it == that.archive_.end())
|
|
|
58 {
|
|
|
59 throw OrthancException(ErrorCode_InexistentItem);
|
|
|
60 }
|
|
|
61 else
|
|
|
62 {
|
|
|
63 that.lru_.MakeMostRecent(id);
|
|
|
64 item_ = it->second;
|
|
|
65 }
|
|
|
66 }
|
|
|
67
|
|
|
68
|
|
1368
|
69 SharedArchive::SharedArchive(size_t maxSize) :
|
|
|
70 maxSize_(maxSize)
|
|
|
71 {
|
|
|
72 if (maxSize == 0)
|
|
|
73 {
|
|
|
74 throw OrthancException(ErrorCode_ParameterOutOfRange);
|
|
|
75 }
|
|
|
76 }
|
|
|
77
|
|
|
78
|
|
1367
|
79 SharedArchive::~SharedArchive()
|
|
|
80 {
|
|
|
81 for (Archive::iterator it = archive_.begin();
|
|
1386
|
82 it != archive_.end(); ++it)
|
|
1367
|
83 {
|
|
|
84 delete it->second;
|
|
|
85 }
|
|
|
86 }
|
|
|
87
|
|
|
88
|
|
|
89 std::string SharedArchive::Add(IDynamicObject* obj)
|
|
|
90 {
|
|
|
91 boost::mutex::scoped_lock lock(mutex_);
|
|
|
92
|
|
|
93 if (archive_.size() == maxSize_)
|
|
|
94 {
|
|
|
95 // The quota has been reached, remove the oldest element
|
|
|
96 std::string oldest = lru_.RemoveOldest();
|
|
|
97 RemoveInternal(oldest);
|
|
|
98 }
|
|
|
99
|
|
|
100 std::string id = Toolbox::GenerateUuid();
|
|
|
101 RemoveInternal(id); // Should never be useful because of UUID
|
|
|
102 archive_[id] = obj;
|
|
|
103 lru_.Add(id);
|
|
|
104
|
|
|
105 return id;
|
|
|
106 }
|
|
|
107
|
|
|
108
|
|
|
109 void SharedArchive::Remove(const std::string& id)
|
|
|
110 {
|
|
|
111 boost::mutex::scoped_lock lock(mutex_);
|
|
|
112 RemoveInternal(id);
|
|
|
113 lru_.Invalidate(id);
|
|
|
114 }
|
|
|
115
|
|
|
116
|
|
|
117 void SharedArchive::List(std::list<std::string>& items)
|
|
|
118 {
|
|
|
119 items.clear();
|
|
|
120
|
|
|
121 boost::mutex::scoped_lock lock(mutex_);
|
|
|
122
|
|
|
123 for (Archive::const_iterator it = archive_.begin();
|
|
1386
|
124 it != archive_.end(); ++it)
|
|
1367
|
125 {
|
|
|
126 items.push_back(it->first);
|
|
|
127 }
|
|
|
128 }
|
|
|
129 }
|
|
|
130
|
|
|
131
|
