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