|
1352
|
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 "PrecompiledHeadersServer.h"
|
|
|
34 #include "ResourceFinder.h"
|
|
|
35
|
|
|
36 #include "FromDcmtkBridge.h"
|
|
|
37
|
|
|
38 #include <glog/logging.h>
|
|
|
39 #include <boost/algorithm/string/predicate.hpp>
|
|
|
40
|
|
|
41 namespace Orthanc
|
|
|
42 {
|
|
|
43 static bool Compare(const std::string& a,
|
|
|
44 const std::string& b,
|
|
|
45 bool caseSensitive)
|
|
|
46 {
|
|
|
47 if (caseSensitive)
|
|
|
48 {
|
|
|
49 return a == b;
|
|
|
50 }
|
|
|
51 else
|
|
|
52 {
|
|
|
53 return boost::iequals(a, b);
|
|
|
54 }
|
|
|
55 }
|
|
|
56
|
|
|
57
|
|
1354
|
58 class ResourceFinder::CandidateResources
|
|
1352
|
59 {
|
|
1354
|
60 private:
|
|
|
61 typedef std::map<DicomTag, std::string> Query;
|
|
1353
|
62
|
|
1354
|
63 ServerIndex& index_;
|
|
|
64 ResourceType level_;
|
|
|
65 bool isFilterApplied_;
|
|
|
66 std::set<std::string> filtered_;
|
|
1352
|
67
|
|
|
68
|
|
1354
|
69 static void ListToSet(std::set<std::string>& target,
|
|
|
70 const std::list<std::string>& source)
|
|
|
71 {
|
|
|
72 for (std::list<std::string>::const_iterator
|
|
|
73 it = source.begin(); it != source.end(); ++it)
|
|
1352
|
74 {
|
|
1354
|
75 target.insert(*it);
|
|
1352
|
76 }
|
|
1354
|
77 }
|
|
1352
|
78
|
|
|
79
|
|
1354
|
80 void RestrictIdentifier(const DicomTag& tag,
|
|
|
81 const std::string& value)
|
|
|
82 {
|
|
|
83 assert((level_ == ResourceType_Patient && tag == DICOM_TAG_PATIENT_ID) ||
|
|
|
84 (level_ == ResourceType_Study && tag == DICOM_TAG_STUDY_INSTANCE_UID) ||
|
|
|
85 (level_ == ResourceType_Study && tag == DICOM_TAG_ACCESSION_NUMBER) ||
|
|
|
86 (level_ == ResourceType_Series && tag == DICOM_TAG_SERIES_INSTANCE_UID) ||
|
|
|
87 (level_ == ResourceType_Instance && tag == DICOM_TAG_SOP_INSTANCE_UID));
|
|
1353
|
88
|
|
1354
|
89 LOG(INFO) << "Lookup for identifier tag "
|
|
|
90 << FromDcmtkBridge::GetName(tag) << " (value: " << value << ")";
|
|
1353
|
91
|
|
1354
|
92 std::list<std::string> resources;
|
|
|
93 index_.LookupIdentifier(resources, tag, value, level_);
|
|
1353
|
94
|
|
1354
|
95 if (isFilterApplied_)
|
|
|
96 {
|
|
|
97 std::set<std::string> s;
|
|
|
98 ListToSet(s, resources);
|
|
1353
|
99
|
|
1354
|
100 std::set<std::string> tmp = filtered_;
|
|
|
101 filtered_.clear();
|
|
|
102
|
|
|
103 for (std::set<std::string>::const_iterator
|
|
|
104 it = tmp.begin(); it != tmp.end(); ++it)
|
|
|
105 {
|
|
|
106 if (s.find(*it) != s.end())
|
|
1353
|
107 {
|
|
1354
|
108 filtered_.insert(*it);
|
|
1353
|
109 }
|
|
|
110 }
|
|
1354
|
111 }
|
|
|
112 else
|
|
|
113 {
|
|
|
114 assert(filtered_.empty());
|
|
|
115 isFilterApplied_ = true;
|
|
|
116 ListToSet(filtered_, resources);
|
|
1353
|
117 }
|
|
1354
|
118 }
|
|
|
119
|
|
|
120
|
|
|
121 void RestrictIdentifier(Query& query,
|
|
|
122 const DicomTag& tag)
|
|
|
123 {
|
|
|
124 Query::iterator it = query.find(tag);
|
|
|
125 if (it != query.end())
|
|
|
126 {
|
|
|
127 RestrictIdentifier(it->first, it->second);
|
|
|
128 query.erase(it);
|
|
|
129 }
|
|
|
130 }
|
|
1353
|
131
|
|
|
132
|
|
1354
|
133 public:
|
|
|
134 CandidateResources(ServerIndex& index) :
|
|
|
135 index_(index),
|
|
|
136 level_(ResourceType_Patient),
|
|
|
137 isFilterApplied_(false)
|
|
|
138 {
|
|
|
139 }
|
|
|
140
|
|
|
141 ResourceType GetLevel() const
|
|
|
142 {
|
|
|
143 return level_;
|
|
|
144 }
|
|
|
145
|
|
|
146 void GoDown()
|
|
|
147 {
|
|
|
148 assert(level_ != ResourceType_Instance);
|
|
|
149
|
|
|
150 if (isFilterApplied_)
|
|
1353
|
151 {
|
|
1354
|
152 std::set<std::string> tmp = filtered_;
|
|
|
153
|
|
|
154 filtered_.clear();
|
|
|
155
|
|
|
156 for (std::set<std::string>::const_iterator
|
|
|
157 it = tmp.begin(); it != tmp.end(); ++it)
|
|
1353
|
158 {
|
|
1354
|
159 std::list<std::string> children;
|
|
|
160 index_.GetChildren(children, *it);
|
|
|
161 ListToSet(filtered_, children);
|
|
1353
|
162 }
|
|
|
163 }
|
|
|
164
|
|
1354
|
165 switch (level_)
|
|
1352
|
166 {
|
|
1354
|
167 case ResourceType_Patient:
|
|
|
168 level_ = ResourceType_Study;
|
|
|
169 break;
|
|
1352
|
170
|
|
1354
|
171 case ResourceType_Study:
|
|
|
172 level_ = ResourceType_Series;
|
|
|
173 break;
|
|
1352
|
174
|
|
1354
|
175 case ResourceType_Series:
|
|
|
176 level_ = ResourceType_Instance;
|
|
|
177 break;
|
|
1352
|
178
|
|
1354
|
179 default:
|
|
|
180 throw OrthancException(ErrorCode_InternalError);
|
|
|
181 }
|
|
|
182 }
|
|
|
183
|
|
1352
|
184
|
|
1354
|
185 void Flatten(std::list<std::string>& resources) const
|
|
|
186 {
|
|
|
187 resources.clear();
|
|
|
188
|
|
|
189 if (isFilterApplied_)
|
|
|
190 {
|
|
|
191 for (std::set<std::string>::const_iterator
|
|
|
192 it = filtered_.begin(); it != filtered_.end(); ++it)
|
|
1352
|
193 {
|
|
1354
|
194 resources.push_back(*it);
|
|
1352
|
195 }
|
|
|
196 }
|
|
1354
|
197 else
|
|
1352
|
198 {
|
|
1354
|
199 index_.GetAllUuids(resources, level_);
|
|
1352
|
200 }
|
|
1354
|
201 }
|
|
1352
|
202
|
|
|
203
|
|
1354
|
204 void RestrictIdentifier(Query& query)
|
|
|
205 {
|
|
|
206 switch (level_)
|
|
1352
|
207 {
|
|
1354
|
208 case ResourceType_Patient:
|
|
1352
|
209 {
|
|
1354
|
210 RestrictIdentifier(query, DICOM_TAG_PATIENT_ID);
|
|
|
211 break;
|
|
|
212 }
|
|
1353
|
213
|
|
1354
|
214 case ResourceType_Study:
|
|
|
215 {
|
|
|
216 RestrictIdentifier(query, DICOM_TAG_STUDY_INSTANCE_UID);
|
|
|
217 RestrictIdentifier(query, DICOM_TAG_ACCESSION_NUMBER);
|
|
|
218 break;
|
|
|
219 }
|
|
1353
|
220
|
|
1354
|
221 case ResourceType_Series:
|
|
|
222 {
|
|
|
223 RestrictIdentifier(query, DICOM_TAG_SERIES_INSTANCE_UID);
|
|
|
224 break;
|
|
1352
|
225 }
|
|
|
226
|
|
1354
|
227 case ResourceType_Instance:
|
|
1353
|
228 {
|
|
1354
|
229 RestrictIdentifier(query, DICOM_TAG_SOP_INSTANCE_UID);
|
|
|
230 break;
|
|
1353
|
231 }
|
|
|
232
|
|
1354
|
233 default:
|
|
|
234 throw OrthancException(ErrorCode_InternalError);
|
|
|
235 }
|
|
|
236 }
|
|
|
237
|
|
1352
|
238
|
|
1354
|
239 void RestrictMainDicomTags(const Query& query,
|
|
|
240 bool caseSensitive)
|
|
|
241 {
|
|
|
242 if (query.size() == 0)
|
|
|
243 {
|
|
|
244 return;
|
|
|
245 }
|
|
|
246
|
|
|
247 std::list<std::string> resources;
|
|
|
248 Flatten(resources);
|
|
1352
|
249
|
|
1354
|
250 isFilterApplied_ = true;
|
|
|
251 filtered_.clear();
|
|
|
252
|
|
|
253 for (std::list<std::string>::const_iterator
|
|
|
254 it = resources.begin(); it != resources.end(); it++)
|
|
|
255 {
|
|
|
256 DicomMap mainTags;
|
|
|
257 if (index_.GetMainDicomTags(mainTags, *it, level_))
|
|
1352
|
258 {
|
|
1354
|
259 for (Query::const_iterator tag = query.begin();
|
|
|
260 tag != query.end(); ++tag)
|
|
1352
|
261 {
|
|
1354
|
262 assert(DicomMap::IsMainDicomTag(tag->first, level_));
|
|
|
263 if (tag->first != DICOM_TAG_PATIENT_ID &&
|
|
|
264 tag->first != DICOM_TAG_STUDY_INSTANCE_UID &&
|
|
|
265 tag->first != DICOM_TAG_ACCESSION_NUMBER &&
|
|
|
266 tag->first != DICOM_TAG_SERIES_INSTANCE_UID &&
|
|
|
267 tag->first != DICOM_TAG_SOP_INSTANCE_UID)
|
|
1352
|
268 {
|
|
1354
|
269 LOG(INFO) << "Lookup for main DICOM tag "
|
|
|
270 << FromDcmtkBridge::GetName(tag->first) << " (value: " << tag->second << ")";
|
|
1353
|
271
|
|
1354
|
272 const DicomValue* value = mainTags.TestAndGetValue(tag->first);
|
|
|
273 if (value != NULL &&
|
|
|
274 Compare(value->AsString(), tag->second, caseSensitive))
|
|
|
275 {
|
|
|
276 filtered_.insert(*it);
|
|
1352
|
277 }
|
|
1354
|
278 }
|
|
|
279 }
|
|
1352
|
280 }
|
|
|
281 }
|
|
1354
|
282 }
|
|
|
283 };
|
|
1352
|
284
|
|
|
285
|
|
1354
|
286 ResourceFinder::ResourceFinder(ServerIndex& index) :
|
|
|
287 index_(index),
|
|
1352
|
288 level_(ResourceType_Patient),
|
|
1355
|
289 caseSensitive_(true),
|
|
|
290 nonMainTagsIgnored_(false)
|
|
1352
|
291 {
|
|
|
292 }
|
|
|
293
|
|
|
294
|
|
|
295 void ResourceFinder::AddTag(const std::string& tag,
|
|
|
296 const std::string& value)
|
|
|
297 {
|
|
|
298 AddTag(FromDcmtkBridge::ParseTag(tag.c_str()), value);
|
|
|
299 }
|
|
|
300
|
|
|
301
|
|
1354
|
302 void ResourceFinder::ExtractTagsForLevel(Query& target,
|
|
|
303 Query& source,
|
|
|
304 ResourceType level)
|
|
1353
|
305 {
|
|
|
306 typedef std::set<DicomTag> Tags;
|
|
|
307
|
|
|
308 Tags tags;
|
|
|
309 DicomMap::GetMainDicomTags(tags, level);
|
|
|
310
|
|
1354
|
311 target.clear();
|
|
|
312
|
|
1353
|
313 for (Tags::const_iterator tag = tags.begin(); tag != tags.end(); tag++)
|
|
|
314 {
|
|
1354
|
315 Query::iterator value = source.find(*tag);
|
|
1353
|
316 if (value != source.end())
|
|
|
317 {
|
|
1354
|
318 target.insert(*value);
|
|
|
319 source.erase(value);
|
|
1353
|
320 }
|
|
|
321 }
|
|
|
322 }
|
|
|
323
|
|
|
324
|
|
1354
|
325 void ResourceFinder::ApplyAtLevel(CandidateResources& candidates,
|
|
|
326 ResourceType level)
|
|
|
327 {
|
|
|
328 if (level != ResourceType_Patient)
|
|
|
329 {
|
|
|
330 candidates.GoDown();
|
|
|
331 }
|
|
|
332
|
|
|
333 candidates.RestrictIdentifier(query_);
|
|
|
334
|
|
|
335 Query tmp;
|
|
|
336 ExtractTagsForLevel(tmp, query_, level);
|
|
|
337 candidates.RestrictMainDicomTags(tmp, caseSensitive_);
|
|
|
338 }
|
|
|
339
|
|
|
340
|
|
1352
|
341 void ResourceFinder::Apply(std::list<std::string>& result)
|
|
|
342 {
|
|
1354
|
343 CandidateResources candidates(index_);
|
|
|
344
|
|
|
345 ApplyAtLevel(candidates, ResourceType_Patient);
|
|
1353
|
346
|
|
1354
|
347 if (level_ == ResourceType_Study ||
|
|
|
348 level_ == ResourceType_Series ||
|
|
|
349 level_ == ResourceType_Instance)
|
|
|
350 {
|
|
|
351 ApplyAtLevel(candidates, ResourceType_Study);
|
|
|
352 }
|
|
|
353
|
|
|
354 if (level_ == ResourceType_Series ||
|
|
|
355 level_ == ResourceType_Instance)
|
|
|
356 {
|
|
|
357 ApplyAtLevel(candidates, ResourceType_Series);
|
|
|
358 }
|
|
|
359
|
|
|
360 if (level_ == ResourceType_Instance)
|
|
|
361 {
|
|
|
362 ApplyAtLevel(candidates, ResourceType_Instance);
|
|
|
363 }
|
|
|
364
|
|
1355
|
365 if (!nonMainTagsIgnored_ &&
|
|
|
366 !query_.empty())
|
|
1354
|
367 {
|
|
|
368 LOG(ERROR) << "Invalid query: Searching against a tag that is not valid for the requested level";
|
|
|
369 throw OrthancException(ErrorCode_BadRequest);
|
|
|
370 }
|
|
|
371
|
|
|
372 candidates.Flatten(result);
|
|
1352
|
373 }
|
|
|
374 }
|
