Mercurial > hg > orthanc-stone

comparison Resources/Orthanc/Core/Cache/SharedArchive.cpp @ 200:03afbee0cc7b

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
integration of Orthanc core into Stone
author Sebastien Jodogne <s.jodogne@gmail.com>
date Fri, 23 Mar 2018 11:04:03 +0100
parents
children 795d71f66f31
comparison
equal deleted inserted replaced
199:dabe9982fca3 200:03afbee0cc7b
1 /**
2 * Orthanc - A Lightweight, RESTful DICOM Store
3 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics
4 * Department, University Hospital of Liege, Belgium
5 * Copyright (C) 2017-2018 Osimis S.A., Belgium
6 *
7 * This program is free software: you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License as
9 * published by the Free Software Foundation, either version 3 of the
10 * License, or (at your option) any later version.
11 *
12 * In addition, as a special exception, the copyright holders of this
13 * program give permission to link the code of its release with the
14 * OpenSSL project's "OpenSSL" library (or with modified versions of it
15 * that use the same license as the "OpenSSL" library), and distribute
16 * the linked executables. You must obey the GNU General Public License
17 * in all respects for all of the code used other than "OpenSSL". If you
18 * modify file(s) with this exception, you may extend this exception to
19 * your version of the file(s), but you are not obligated to do so. If
20 * you do not wish to do so, delete this exception statement from your
21 * version. If you delete this exception statement from all source files
22 * in the program, then also delete it here.
23 *
24 * This program is distributed in the hope that it will be useful, but
25 * WITHOUT ANY WARRANTY; without even the implied warranty of
26 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
27 * General Public License for more details.
28 *
29 * You should have received a copy of the GNU General Public License
30 * along with this program. If not, see <http://www.gnu.org/licenses/>.
31 **/
32
33
34 #include "../PrecompiledHeaders.h"
35 #include "SharedArchive.h"
36
37 #include "../SystemToolbox.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
72 SharedArchive::SharedArchive(size_t maxSize) :
73 maxSize_(maxSize)
74 {
75 if (maxSize == 0)
76 {
77 throw OrthancException(ErrorCode_ParameterOutOfRange);
78 }
79 }
80
81
82 SharedArchive::~SharedArchive()
83 {
84 for (Archive::iterator it = archive_.begin();
85 it != archive_.end(); ++it)
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 = SystemToolbox::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();
127 it != archive_.end(); ++it)
128 {
129 items.push_back(it->first);
130 }
131 }
132 }
133
134