/usr/include/gdcm-2.0/gdcmDataSet.txx is in libgdcm2-dev 2.0.18-7.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 | /*=========================================================================
Program: GDCM (Grassroots DICOM). A DICOM library
Copyright (c) 2006-2011 Mathieu Malaterre
All rights reserved.
See Copyright.txt or http://gdcm.sourceforge.net/Copyright.html for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
#ifndef GDCMDATASET_TXX
#define GDCMDATASET_TXX
#include "gdcmByteValue.h"
#include "gdcmParseException.h"
#include <cstring>
namespace gdcm
{
template <typename TDE, typename TSwap>
std::istream &DataSet::ReadNested(std::istream &is) {
DataElement de;
const Tag itemDelItem(0xfffe,0xe00d);
assert( de.GetTag() != itemDelItem ); // precondition before while loop
try
{
while( de.Read<TDE,TSwap>(is) && de.GetTag() != itemDelItem ) // Keep that order please !
{
//std::cerr << "DEBUG Nested: " << de << std::endl;
InsertDataElement( de );
}
}
catch(ParseException &pe)
{
if( pe.GetLastElement().GetTag() == Tag(0xfffe,0xe0dd) )
{
// BogusItemStartItemEnd.dcm
gdcmWarningMacro( "SQ End found but no Item end found" );
de.SetTag( itemDelItem );
is.seekg( -4, std::ios::cur );
}
else
{
// MR_Philips_Intera_PrivateSequenceExplicitVR_in_SQ_2001_e05f_item_wrong_lgt_use_NOSHADOWSEQ.dcm
// Need to rethrow the exception...sigh
throw pe;
}
}
assert( de.GetTag() == itemDelItem );
return is;
}
template <typename TDE, typename TSwap>
std::istream &DataSet::Read(std::istream &is) {
DataElement de;
while( !is.eof() && de.Read<TDE,TSwap>(is) )
{
//std::cerr << "DEBUG:" << de << std::endl;
InsertDataElement( de );
}
return is;
}
template <typename TDE, typename TSwap>
std::istream &DataSet::ReadUpToTag(std::istream &is, const Tag &t, const std::set<Tag> & skiptags) {
DataElement de;
while( !is.eof() && de.template ReadPreValue<TDE,TSwap>(is, skiptags) )
{
// If tag read was in skiptags then we should NOT add it:
if( skiptags.count( de.GetTag() ) == 0 )
{
de.template ReadValue<TDE,TSwap>(is, skiptags);
InsertDataElement( de );
}
else
{
/// FIXME we could just seek
if( de.GetTag() != t )
de.template ReadValue<TDE,TSwap>(is, skiptags);
//is.seekg( de.GetVL() );
}
// tag was found, we can exit the loop:
if ( t <= de.GetTag() ) break;
}
return is;
}
template <typename TDE, typename TSwap>
std::istream &DataSet::ReadUpToTagWithLength(std::istream &is, const Tag &t, VL & length) {
DataElement de;
while( !is.eof() && de.ReadWithLength<TDE,TSwap>(is,length) )
{
//assert( de.GetTag() != Tag(0,0) );
InsertDataElement( de );
// FIXME FIXME
// the following is a HACK
if( de.GetTag() == t )
{
std::streamoff off = de.GetVL();
is.seekg( -off , std::ios_base::cur);
}
// tag was found, we can exit the loop:
if ( t <= de.GetTag() ) break;
}
return is;
}
template <typename TDE, typename TSwap>
std::istream &DataSet::ReadSelectedTags(std::istream &inputStream, const std::set<Tag> & selectedTags) {
if ( ! (selectedTags.empty() || inputStream.fail()) )
{
const Tag maxTag = *(selectedTags.rbegin());
std::set<Tag> tags = selectedTags;
DataElement dataElem;
while( !inputStream.eof() )
{
static_cast<TDE&>(dataElem).template ReadPreValue<TSwap>(inputStream);
const Tag& tag = dataElem.GetTag();
if ( inputStream.fail() || maxTag < tag )
{
// Failed to read the tag, or the read tag exceeds the maximum.
// As we assume ascending tag ordering, we can exit the loop.
break;
}
static_cast<TDE&>(dataElem).template ReadValue<TSwap>(inputStream);
if ( inputStream.fail() )
{
// Failed to read the value.
break;
}
const std::set<Tag>::iterator found = tags.find(tag);
if ( found != tags.end() )
{
InsertDataElement( dataElem );
tags.erase(found);
if ( tags.empty() )
{
// All selected tags were found, we can exit the loop:
break;
}
}
if ( ! (tag < maxTag ) )
{
// The maximum tag was encountered, and as we assume
// ascending tag ordering, we can exit the loop:
break;
}
}
}
return inputStream;
}
template <typename TDE, typename TSwap>
std::istream &DataSet::ReadSelectedTagsWithLength(std::istream &inputStream, const std::set<Tag> & selectedTags, VL & length) {
if ( ! selectedTags.empty() )
{
const Tag maxTag = *(selectedTags.rbegin());
std::set<Tag> tags = selectedTags;
DataElement dataElem;
// TODO There's an optimization opportunity here:
// dataElem.ReadWithLength only needs to read the value if the tag is selected!
// Niels Dekker, LKEB, Jan 2010.
while( !inputStream.eof() && dataElem.template ReadWithLength<TDE,TSwap>(inputStream, length) )
{
const Tag tag = dataElem.GetTag();
const std::set<Tag>::iterator found = tags.find(tag);
if ( found != tags.end() )
{
InsertDataElement( dataElem );
tags.erase(found);
if ( tags.empty() )
{
// All selected tags were found, we can exit the loop:
break;
}
}
if ( ! (tag < maxTag ) )
{
// The maximum tag was encountered, and as we assume
// ascending tag ordering, we can exit the loop:
break;
}
}
}
return inputStream;
}
template <typename TDE, typename TSwap>
std::istream &DataSet::ReadWithLength(std::istream &is, VL &length) {
DataElement de;
VL l = 0;
//std::cout << "ReadWithLength Length: " << length << std::endl;
VL locallength = length;
try
{
while( l != locallength && de.ReadWithLength<TDE,TSwap>(is, locallength))
{
//std::cout << "Nested: " << de << std::endl;
#ifndef GDCM_SUPPORT_BROKEN_IMPLEMENTATION
assert( de.GetTag() != Tag(0xfffe,0xe000) ); // We should not be reading the next item...
#endif
InsertDataElement( de );
l += de.GetLength<TDE>();
//std::cout << "l:" << l << std::endl;
//assert( !de.GetVL().IsUndefined() );
//std::cerr << "DEBUG: " << de.GetTag() << " "<< de.GetLength() <<
// "," << de.GetVL() << "," << l << std::endl;
// Bug_Philips_ItemTag_3F3F
// (0x2005, 0x1080): for some reason computation of length fails...
if( l == 70 && locallength == 63 )
{
gdcmWarningMacro( "PMS: Super bad hack. Changing length" );
length = locallength = 140;
}
if( l > locallength )
{
gdcmDebugMacro( "Out of Range SQ detected: " << l << " while max: " << locallength );
throw Exception( "Out of Range" );
}
}
}
catch(ParseException &pe)
{
if( pe.GetLastElement().GetTag() == Tag(0xfffe,0xe000) )
{
// gdcm-MR-PHILIPS-16-Multi-Seq.dcm
// Long story short, I think Philips engineer inserted 0xfffe,0x0000 instead of an item start element
// assert( FindDataElement( Tag(0xfffe,0x0000) ) == false );
is.seekg(-6, std::ios::cur );
length = locallength = l;
}
else
{
// Could be the famous :
// gdcmDataExtra/gdcmBreakers/BuggedDicomWorksImage_Hopeless.dcm
// let's just give up:
throw Exception( "Unhandled" );
}
}
catch(Exception &pe)
{
if( strcmp( pe.GetDescription(), "Out of Range" ) == 0 )
{
// BogugsItemAndSequenceLength.dcm
// This is most likely the "Out of Range" one
// Cautiously read until we find the next item starter and then stop.
//std::cout << "Length read was:" << l << " should be at most:" << locallength ;
while( de.Read<TDE,TSwap>(is) && de.GetTag() != Tag(0xfffe,0xe000) && de.GetTag().GetElement() != 0x0 )
{
//std::cout << "Nested2: " << de << std::endl;
InsertDataElement( de );
l += de.GetLength<TDE>();
//std::cout << l << std::endl;
}
// seek back since we read the next item starter:
int iteml = de.GetLength<TDE>();
//assert( de.GetTag().GetElement() );
if( !de.GetTag().GetElement() )
{
assert( iteml == 12 ); (void)iteml;
is.seekg( -12, std::ios::cur );
}
else
{
//assert( de.GetTag() == Tag(0xfffe,0xe000) );
is.seekg( -4, std::ios::cur );
}
// let's fix the length now:
length = locallength = l;
gdcmWarningMacro( "Item length is wrong" );
throw Exception( "Changed Length" );
}
else
{
// re throw
throw pe;
}
}
// technically we could only do this assert if the dataset did not contains duplicate data elements
// so only do a <= instead:
//assert( l == locallength );
assert( l <= locallength );
return is;
}
template <typename TDE, typename TSwap>
std::ostream const &DataSet::Write(std::ostream &os) const {
typename DataSet::ConstIterator it = DES.begin();
for( ; it != DES.end(); ++it)
{
const DataElement & de = *it;
//if( de.GetTag().GetGroup() >= 0x0008 || de.GetTag().GetGroup() == 0x0002 )
{
de.Write<TDE,TSwap>(os);
}
}
return os;
}
} // end namespace gdcm
#endif // GDCMDATASET_TXX
|