1 /*=========================================================================
4 Module: $RCSfile: gdcmDocument.cxx,v $
6 Date: $Date: 2004/11/12 21:33:46 $
7 Version: $Revision: 1.122 $
9 Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de
10 l'Image). All rights reserved. See Doc/License.txt or
11 http://www.creatis.insa-lyon.fr/Public/Gdcm/License.html for details.
13 This software is distributed WITHOUT ANY WARRANTY; without even
14 the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 PURPOSE. See the above copyright notices for more information.
17 =========================================================================*/
19 #include "gdcmDocument.h"
20 #include "gdcmValEntry.h"
21 #include "gdcmBinEntry.h"
22 #include "gdcmSeqEntry.h"
23 #include "gdcmGlobal.h"
25 #include "gdcmDebug.h"
31 #if defined(_MSC_VER) || defined(__BORLANDC__)
34 #include <netinet/in.h>
39 static const char *TransferSyntaxStrings[] = {
40 // Implicit VR Little Endian
42 // Explicit VR Little Endian
43 "1.2.840.10008.1.2.1",
44 // Deflated Explicit VR Little Endian
45 "1.2.840.10008.1.2.1.99",
46 // Explicit VR Big Endian
47 "1.2.840.10008.1.2.2",
48 // JPEG Baseline (Process 1)
49 "1.2.840.10008.1.2.4.50",
50 // JPEG Extended (Process 2 & 4)
51 "1.2.840.10008.1.2.4.51",
52 // JPEG Extended (Process 3 & 5)
53 "1.2.840.10008.1.2.4.52",
54 // JPEG Spectral Selection, Non-Hierarchical (Process 6 & 8)
55 "1.2.840.10008.1.2.4.53",
56 // JPEG Full Progression, Non-Hierarchical (Process 10 & 12)
57 "1.2.840.10008.1.2.4.55",
58 // JPEG Lossless, Non-Hierarchical (Process 14)
59 "1.2.840.10008.1.2.4.57",
60 // JPEG Lossless, Hierarchical, First-Order Prediction (Process 14, [Selection Value 1])
61 "1.2.840.10008.1.2.4.70",
63 "1.2.840.10008.1.2.4.90",
65 "1.2.840.10008.1.2.4.91",
67 "1.2.840.10008.1.2.5",
69 "Unknown Transfer Syntax"
72 //-----------------------------------------------------------------------------
73 // Refer to Document::CheckSwap()
74 const unsigned int Document::HEADER_LENGTH_TO_READ = 256;
76 // Refer to Document::SetMaxSizeLoadEntry()
77 const unsigned int Document::MAX_SIZE_LOAD_ELEMENT_VALUE = 0xfff; // 4096
78 const unsigned int Document::MAX_SIZE_PRINT_ELEMENT_VALUE = 0x7fffffff;
80 //-----------------------------------------------------------------------------
81 // Constructor / Destructor
85 * @param filename file to be opened for parsing
87 Document::Document( std::string const & filename ) : ElementSet(-1)
89 SetMaxSizeLoadEntry(MAX_SIZE_LOAD_ELEMENT_VALUE);
99 dbg.Verbose(0, "Document::Document: starting parsing of file: ",
101 Fp->seekg( 0, std::ios_base::beg);
103 Fp->seekg(0, std::ios_base::end);
104 long lgt = Fp->tellg();
106 Fp->seekg( 0, std::ios_base::beg);
108 long beg = Fp->tellg();
111 ParseDES( this, beg, lgt, false); // le Load sera fait a la volee
113 Fp->seekg( 0, std::ios_base::beg);
115 // Load 'non string' values
117 std::string PhotometricInterpretation = GetEntryByNumber(0x0028,0x0004);
118 if( PhotometricInterpretation == "PALETTE COLOR " )
120 LoadEntryBinArea(0x0028,0x1200); // gray LUT
121 /// FIXME FIXME FIXME
122 /// The tags refered by the three following lines used to be CORRECTLY
123 /// defined as having an US Value Representation in the public
124 /// dictionnary. BUT the semantics implied by the three following
125 /// lines state that the corresponding tag contents are in fact
126 /// the ones of a BinEntry.
127 /// In order to fix things "Quick and Dirty" the dictionnary was
128 /// altered on PURPOUS but now contains a WRONG value.
129 /// In order to fix things and restore the dictionary to its
130 /// correct value, one needs to decided of the semantics by deciding
131 /// wether the following tags are either:
132 /// - multivaluated US, and hence loaded as ValEntry, but afterwards
133 /// also used as BinEntry, which requires the proper conversion,
134 /// - OW, and hence loaded as BinEntry, but afterwards also used
135 /// as ValEntry, which requires the proper conversion.
136 LoadEntryBinArea(0x0028,0x1201); // R LUT
137 LoadEntryBinArea(0x0028,0x1202); // G LUT
138 LoadEntryBinArea(0x0028,0x1203); // B LUT
140 // Segmented Red Palette Color LUT Data
141 LoadEntryBinArea(0x0028,0x1221);
142 // Segmented Green Palette Color LUT Data
143 LoadEntryBinArea(0x0028,0x1222);
144 // Segmented Blue Palette Color LUT Data
145 LoadEntryBinArea(0x0028,0x1223);
147 //FIXME later : how to use it?
148 LoadEntryBinArea(0x0028,0x3006); //LUT Data (CTX dependent)
152 // --------------------------------------------------------------
153 // Specific code to allow gdcm to read ACR-LibIDO formated images
154 // Note: ACR-LibIDO is an extension of the ACR standard that was
155 // used at CREATIS. For the time being (say a couple years)
156 // we keep this kludge to allow a smooth move to gdcm for
157 // CREATIS developpers (sorry folks).
159 // if recognition code tells us we deal with a LibIDO image
160 // we switch lineNumber and columnNumber
163 RecCode = GetEntryByNumber(0x0008, 0x0010); // recognition code
164 if (RecCode == "ACRNEMA_LIBIDO_1.1" ||
165 RecCode == "CANRME_AILIBOD1_1." ) // for brain-damaged softwares
166 // with "little-endian strings"
168 Filetype = ACR_LIBIDO;
169 std::string rows = GetEntryByNumber(0x0028, 0x0010);
170 std::string columns = GetEntryByNumber(0x0028, 0x0011);
171 SetEntryByNumber(columns, 0x0028, 0x0010);
172 SetEntryByNumber(rows , 0x0028, 0x0011);
174 // ----------------- End of ACR-LibIDO kludge ------------------
176 PrintLevel = 1; // 'Medium' print level by default
180 * \brief This default constructor doesn't parse the file. You should
181 * then invoke \ref Document::SetFileName and then the parsing.
183 Document::Document() : ElementSet(-1)
187 SetMaxSizeLoadEntry(MAX_SIZE_LOAD_ELEMENT_VALUE);
190 Filetype = ExplicitVR;
191 PrintLevel = 1; // 'Medium' print level by default
195 * \brief Canonical destructor.
197 Document::~Document ()
202 // Recursive clean up of sequences
203 for (TagDocEntryHT::const_iterator it = TagHT.begin();
204 it != TagHT.end(); ++it )
206 //delete it->second; //temp remove
213 //-----------------------------------------------------------------------------
217 * \brief Prints The Dict Entries of THE public Dicom Dictionary
220 void Document::PrintPubDict(std::ostream & os)
222 RefPubDict->Print(os);
226 * \brief Prints The Dict Entries of THE shadow Dicom Dictionary
229 void Document::PrintShaDict(std::ostream & os)
231 RefShaDict->Print(os);
234 //-----------------------------------------------------------------------------
237 * \brief Get the public dictionary used
239 Dict* Document::GetPubDict()
245 * \brief Get the shadow dictionary used
247 Dict* Document::GetShaDict()
253 * \brief Set the shadow dictionary used
254 * \param dict dictionary to use in shadow
256 bool Document::SetShaDict(Dict *dict)
263 * \brief Set the shadow dictionary used
264 * \param dictName name of the dictionary to use in shadow
266 bool Document::SetShaDict(DictKey const & dictName)
268 RefShaDict = Global::GetDicts()->GetDict(dictName);
273 * \brief This predicate, based on hopefully reasonable heuristics,
274 * decides whether or not the current Document was properly parsed
275 * and contains the mandatory information for being considered as
276 * a well formed and usable Dicom/Acr File.
277 * @return true when Document is the one of a reasonable Dicom/Acr file,
280 bool Document::IsReadable()
282 if( Filetype == Unknown)
284 dbg.Verbose(0, "Document::IsReadable: wrong filetype");
290 dbg.Verbose(0, "Document::IsReadable: no tags in internal"
300 * \brief Internal function that checks whether the Transfer Syntax given
301 * as argument is the one present in the current document.
302 * @param syntaxToCheck The transfert syntax we need to check against.
303 * @return True when SyntaxToCheck corresponds to the Transfer Syntax of
304 * the current document. False either when the document contains
305 * no Transfer Syntax, or when the Tranfer Syntaxes doesn't match.
307 TransferSyntaxType Document::GetTransferSyntax()
309 DocEntry *entry = GetDocEntryByNumber(0x0002, 0x0010);
315 // The entry might be present but not loaded (parsing and loading
316 // happen at different stages): try loading and proceed with check...
317 LoadDocEntrySafe(entry);
318 if (ValEntry* valEntry = dynamic_cast< ValEntry* >(entry) )
320 std::string transfer = valEntry->GetValue();
321 // The actual transfer (as read from disk) might be padded. We
322 // first need to remove the potential padding. We can make the
323 // weak assumption that padding was not executed with digits...
324 if ( transfer.length() == 0 )
326 // for brain damaged headers
329 while ( !isdigit(transfer[transfer.length()-1]) )
331 transfer.erase(transfer.length()-1, 1);
333 for (int i = 0; TransferSyntaxStrings[i] != NULL; i++)
335 if ( TransferSyntaxStrings[i] == transfer )
337 return TransferSyntaxType(i);
344 bool Document::IsJPEGLossless()
346 TransferSyntaxType r = GetTransferSyntax();
347 return r == JPEGFullProgressionProcess10_12
348 || r == JPEGLosslessProcess14
349 || r == JPEGLosslessProcess14_1;
353 * \brief Determines if the Transfer Syntax was already encountered
354 * and if it corresponds to a JPEG2000 one
355 * @return True when JPEG2000 (Lossly or LossLess) found. False in all
358 bool Document::IsJPEG2000()
360 TransferSyntaxType r = GetTransferSyntax();
361 return r == JPEG2000Lossless || r == JPEG2000;
365 * \brief Determines if the Transfer Syntax corresponds to any form
366 * of Jpeg encoded Pixel data.
367 * @return True when any form of JPEG found. False otherwise.
369 bool Document::IsJPEG()
371 TransferSyntaxType r = GetTransferSyntax();
372 return r == JPEGBaselineProcess1
373 || r == JPEGExtendedProcess2_4
374 || r == JPEGExtendedProcess3_5
375 || r == JPEGSpectralSelectionProcess6_8
381 * \brief Determines if the Transfer Syntax corresponds to encapsulated
382 * of encoded Pixel Data (as opposed to native).
383 * @return True when encapsulated. False when native.
385 bool Document::IsEncapsulate()
387 TransferSyntaxType r = GetTransferSyntax();
388 return IsJPEG() || r == RLELossless;
392 * \brief Predicate for dicom version 3 file.
393 * @return True when the file is a dicom version 3.
395 bool Document::IsDicomV3()
397 // Checking if Transfert Syntax exists is enough
398 // Anyway, it's to late check if the 'Preamble' was found ...
399 // And ... would it be a rich idea to check ?
400 // (some 'no Preamble' DICOM images exist !)
401 return GetDocEntryByNumber(0x0002, 0x0010) != NULL;
405 * \brief returns the File Type
406 * (ACR, ACR_LIBIDO, ExplicitVR, ImplicitVR, Unknown)
407 * @return the FileType code
409 FileType Document::GetFileType()
415 * \brief Tries to open the file \ref Document::Filename and
416 * checks the preamble when existing.
417 * @return The FILE pointer on success.
419 std::ifstream* Document::OpenFile()
421 if (Filename.length() == 0) return 0;
425 "Document::OpenFile is already opened when opening: ",
429 Fp = new std::ifstream(Filename.c_str(), std::ios::in | std::ios::binary);
434 "Document::OpenFile cannot open file: ",
440 Fp->read((char*)&zero, (size_t)2 );
442 //ACR -- or DICOM with no Preamble --
443 if( zero == 0x0008 || zero == 0x0800 || zero == 0x0002 || zero == 0x0200 )
449 Fp->seekg(126L, std::ios_base::cur);
451 Fp->read(dicm, (size_t)4);
452 if( memcmp(dicm, "DICM", 4) == 0 )
459 "Document::OpenFile not DICOM/ACR (missing preamble)",
466 * \brief closes the file
467 * @return TRUE if the close was successfull
469 bool Document::CloseFile()
478 return true; //FIXME how do we detect a non-close ifstream ?
482 * \brief Writes in a file all the Header Entries (Dicom Elements)
483 * @param fp file pointer on an already open file
484 * @param filetype Type of the File to be written
485 * (ACR-NEMA, ExplicitVR, ImplicitVR)
486 * \return Always true.
488 void Document::Write(std::ofstream* fp, FileType filetype)
490 /// \todo move the following lines (and a lot of others, to be written)
491 /// to a future function CheckAndCorrectHeader
492 /// (necessary if user wants to write a DICOM V3 file
493 /// starting from an ACR-NEMA (V2) Header
495 if (filetype == ImplicitVR)
498 Util::DicomString( TransferSyntaxStrings[ImplicitVRLittleEndian] );
499 ReplaceOrCreateByNumber(ts, 0x0002, 0x0010);
501 /// \todo Refer to standards on page 21, chapter 6.2
502 /// "Value representation": values with a VR of UI shall be
503 /// padded with a single trailing null
504 /// in the following case we have to padd manually with a 0
506 SetEntryLengthByNumber(18, 0x0002, 0x0010);
509 if (filetype == ExplicitVR)
512 Util::DicomString( TransferSyntaxStrings[ExplicitVRLittleEndian] );
513 ReplaceOrCreateByNumber(ts, 0x0002, 0x0010); //LEAK
515 /// \todo Refer to standards on page 21, chapter 6.2
516 /// "Value representation": values with a VR of UI shall be
517 /// padded with a single trailing null
518 /// Dans le cas suivant on doit pader manuellement avec un 0
520 SetEntryLengthByNumber(20, 0x0002, 0x0010);
524 * \todo rewrite later, if really usefull
525 * - 'Group Length' element is optional in DICOM
526 * - but un-updated odd groups lengthes can causes pb
529 * if ( (filetype == ImplicitVR) || (filetype == ExplicitVR) )
530 * UpdateGroupLength(false,filetype);
531 * if ( filetype == ACR)
532 * UpdateGroupLength(true,ACR);
535 ElementSet::Write(fp, filetype); // This one is recursive
540 * \brief Modifies the value of a given Header Entry (Dicom Element)
541 * when it exists. Create it with the given value when unexistant.
542 * @param value (string) Value to be set
543 * @param group Group number of the Entry
544 * @param elem Element number of the Entry
545 * @param VR V(alue) R(epresentation) of the Entry -if private Entry-
546 * \return pointer to the modified/created Header Entry (NULL when creation
549 ValEntry* Document::ReplaceOrCreateByNumber(
550 std::string const & value,
555 ValEntry* valEntry = 0;
556 DocEntry* currentEntry = GetDocEntryByNumber( group, elem);
560 // check if (group,element) DictEntry exists
561 // if it doesn't, create an entry in DictSet::VirtualEntry
564 // Find out if the tag we received is in the dictionaries:
565 Dict *pubDict = Global::GetDicts()->GetDefaultPubDict();
566 DictEntry* dictEntry = pubDict->GetDictEntryByNumber(group, elem);
569 currentEntry = NewDocEntryByNumber(group, elem, vr);
573 currentEntry = NewDocEntryByNumber(group, elem);
578 dbg.Verbose(0, "Document::ReplaceOrCreateByNumber: call to"
579 " NewDocEntryByNumber failed.");
582 valEntry = new ValEntry(currentEntry);
583 if ( !AddEntry(valEntry))
586 dbg.Verbose(0, "Document::ReplaceOrCreateByNumber: AddEntry"
587 " failed allthough this is a creation.");
589 // This is the reason why NewDocEntryByNumber are a real
590 // bad habit !!! FIXME
595 valEntry = dynamic_cast< ValEntry* >(currentEntry);
596 if ( !valEntry ) // Euuuuh? It wasn't a ValEntry
597 // then we change it to a ValEntry ?
598 // Shouldn't it be considered as an error ?
600 // We need to promote the DocEntry to a ValEntry:
601 valEntry = new ValEntry(currentEntry);
602 if (!RemoveEntry(currentEntry))
605 dbg.Verbose(0, "Document::ReplaceOrCreateByNumber: removal"
606 " of previous DocEntry failed.");
609 if ( !AddEntry(valEntry))
612 dbg.Verbose(0, "Document::ReplaceOrCreateByNumber: adding"
613 " promoted ValEntry failed.");
619 SetEntryByNumber(value, group, elem);
625 * \brief Modifies the value of a given Header Entry (Dicom Element)
626 * when it exists. Create it with the given value when unexistant.
627 * @param binArea (binary) value to be set
628 * @param Group Group number of the Entry
629 * @param Elem Element number of the Entry
630 * \return pointer to the modified/created Header Entry (NULL when creation
633 BinEntry* Document::ReplaceOrCreateByNumber(
640 BinEntry* binEntry = 0;
641 DocEntry* currentEntry = GetDocEntryByNumber( group, elem);
645 // check if (group,element) DictEntry exists
646 // if it doesn't, create an entry in DictSet::VirtualEntry
649 // Find out if the tag we received is in the dictionaries:
650 Dict *pubDict = Global::GetDicts()->GetDefaultPubDict();
651 DictEntry *dictEntry = pubDict->GetDictEntryByNumber(group, elem);
655 currentEntry = NewDocEntryByNumber(group, elem, vr);
659 currentEntry = NewDocEntryByNumber(group, elem);
663 dbg.Verbose(0, "Document::ReplaceOrCreateByNumber: call to"
664 " NewDocEntryByNumber failed.");
667 binEntry = new BinEntry(currentEntry);
668 if ( !AddEntry(binEntry))
670 dbg.Verbose(0, "Document::ReplaceOrCreateByNumber: AddEntry"
671 " failed allthough this is a creation.");
676 binEntry = dynamic_cast< BinEntry* >(currentEntry);
677 if ( !binEntry ) // Euuuuh? It wasn't a BinEntry
678 // then we change it to a BinEntry ?
679 // Shouldn't it be considered as an error ?
681 // We need to promote the DocEntry to a BinEntry:
682 binEntry = new BinEntry(currentEntry);
683 if (!RemoveEntry(currentEntry))
685 dbg.Verbose(0, "Document::ReplaceOrCreateByNumber: removal"
686 " of previous DocEntry failed.");
689 if ( !AddEntry(binEntry))
691 dbg.Verbose(0, "Document::ReplaceOrCreateByNumber: adding"
692 " promoted BinEntry failed.");
698 SetEntryByNumber(binArea, lgth, group, elem);
705 * \brief Modifies the value of a given Header Entry (Dicom Element)
706 * when it exists. Create it when unexistant.
707 * @param Group Group number of the Entry
708 * @param Elem Element number of the Entry
709 * \return pointer to the modified/created SeqEntry (NULL when creation
712 SeqEntry* Document::ReplaceOrCreateByNumber( uint16_t group, uint16_t elem)
715 DocEntry* a = GetDocEntryByNumber( group, elem);
718 a = NewSeqEntryByNumber(group, elem);
724 b = new SeqEntry(a, 1); // FIXME : 1 (Depth)
731 * \brief Set a new value if the invoked element exists
732 * Seems to be useless !!!
733 * @param value new element value
734 * @param group group number of the Entry
735 * @param elem element number of the Entry
738 bool Document::ReplaceIfExistByNumber(std::string const & value,
739 uint16_t group, uint16_t elem )
741 SetEntryByNumber(value, group, elem);
746 //-----------------------------------------------------------------------------
750 * \brief Checks if a given Dicom Element exists within the H table
751 * @param group Group number of the searched Dicom Element
752 * @param element Element number of the searched Dicom Element
753 * @return true is found
755 bool Document::CheckIfEntryExistByNumber(uint16_t group, uint16_t element )
757 const std::string &key = DictEntry::TranslateToKey(group, element );
758 return TagHT.count(key) != 0;
762 * \brief Searches within Header Entries (Dicom Elements) parsed with
763 * the public and private dictionaries
764 * for the element value of a given tag.
765 * \warning Don't use any longer : use GetPubEntryByName
766 * @param tagName name of the searched element.
767 * @return Corresponding element value when it exists,
768 * and the string GDCM_UNFOUND ("gdcm::Unfound") otherwise.
770 std::string Document::GetEntryByName(TagName const & tagName)
772 DictEntry* dictEntry = RefPubDict->GetDictEntryByName(tagName);
778 return GetEntryByNumber(dictEntry->GetGroup(),dictEntry->GetElement());
782 * \brief Searches within Header Entries (Dicom Elements) parsed with
783 * the public and private dictionaries
784 * for the element value representation of a given tag.
786 * Obtaining the VR (Value Representation) might be needed by caller
787 * to convert the string typed content to caller's native type
788 * (think of C++ vs Python). The VR is actually of a higher level
789 * of semantics than just the native C++ type.
790 * @param tagName name of the searched element.
791 * @return Corresponding element value representation when it exists,
792 * and the string GDCM_UNFOUND ("gdcm::Unfound") otherwise.
794 std::string Document::GetEntryVRByName(TagName const& tagName)
796 DictEntry *dictEntry = RefPubDict->GetDictEntryByName(tagName);
797 if( dictEntry == NULL)
802 DocEntry* elem = GetDocEntryByNumber(dictEntry->GetGroup(),
803 dictEntry->GetElement());
804 return elem->GetVR();
808 * \brief Searches within Header Entries (Dicom Elements) parsed with
809 * the public and private dictionaries
810 * for the element value representation of a given tag.
811 * @param group Group number of the searched tag.
812 * @param element Element number of the searched tag.
813 * @return Corresponding element value representation when it exists,
814 * and the string GDCM_UNFOUND ("gdcm::Unfound") otherwise.
816 std::string Document::GetEntryByNumber(uint16_t group, uint16_t element)
818 TagKey key = DictEntry::TranslateToKey(group, element);
819 /// \todo use map methods, instead of multimap JPR
820 if ( !TagHT.count(key))
825 return ((ValEntry *)TagHT.find(key)->second)->GetValue();
829 * \brief Searches within Header Entries (Dicom Elements) parsed with
830 * the public and private dictionaries
831 * for the element value representation of a given tag..
833 * Obtaining the VR (Value Representation) might be needed by caller
834 * to convert the string typed content to caller's native type
835 * (think of C++ vs Python). The VR is actually of a higher level
836 * of semantics than just the native C++ type.
837 * @param group Group number of the searched tag.
838 * @param element Element number of the searched tag.
839 * @return Corresponding element value representation when it exists,
840 * and the string GDCM_UNFOUND ("gdcm::Unfound") otherwise.
842 std::string Document::GetEntryVRByNumber(uint16_t group, uint16_t element)
844 DocEntry* elem = GetDocEntryByNumber(group, element);
849 return elem->GetVR();
853 * \brief Searches within Header Entries (Dicom Elements) parsed with
854 * the public and private dictionaries
855 * for the value length of a given tag..
856 * @param group Group number of the searched tag.
857 * @param element Element number of the searched tag.
858 * @return Corresponding element length; -2 if not found
860 int Document::GetEntryLengthByNumber(uint16_t group, uint16_t element)
862 DocEntry* elem = GetDocEntryByNumber(group, element);
865 return -2; //magic number
867 return elem->GetLength();
870 * \brief Sets the value (string) of the Header Entry (Dicom Element)
871 * @param content string value of the Dicom Element
872 * @param tagName name of the searched Dicom Element.
873 * @return true when found
875 bool Document::SetEntryByName(std::string const & content,
876 TagName const & tagName)
878 DictEntry *dictEntry = RefPubDict->GetDictEntryByName(tagName);
884 return SetEntryByNumber(content,dictEntry->GetGroup(),
885 dictEntry->GetElement());
889 * \brief Accesses an existing DocEntry (i.e. a Dicom Element)
890 * through it's (group, element) and modifies it's content with
892 * @param content new value (string) to substitute with
893 * @param group group number of the Dicom Element to modify
894 * @param element element number of the Dicom Element to modify
896 bool Document::SetEntryByNumber(std::string const& content,
897 uint16_t group, uint16_t element)
902 ValEntry* valEntry = GetValEntryByNumber(group, element);
905 dbg.Verbose(0, "Document::SetEntryByNumber: no corresponding",
906 " ValEntry (try promotion first).");
909 // Non even content must be padded with a space (020H)...
910 std::string finalContent = Util::DicomString( content.c_str() );
911 assert( !(finalContent.size() % 2) );
912 valEntry->SetValue(finalContent);
914 // Integers have a special treatement for their length:
916 l = finalContent.length();
917 if ( l != 0) // To avoid to be cheated by 'zero length' integers
919 VRKey vr = valEntry->GetVR();
920 if( vr == "US" || vr == "SS" )
922 // for multivaluated items
923 c = Util::CountSubstring(content, "\\") + 1;
926 else if( vr == "UL" || vr == "SL" )
928 // for multivaluated items
929 c = Util::CountSubstring(content, "\\") + 1;
933 valEntry->SetLength(l);
938 * \brief Accesses an existing DocEntry (i.e. a Dicom Element)
939 * through it's (group, element) and modifies it's content with
941 * @param content new value (void* -> uint8_t*) to substitute with
942 * @param lgth new value length
943 * @param group group number of the Dicom Element to modify
944 * @param element element number of the Dicom Element to modify
946 bool Document::SetEntryByNumber(uint8_t*content, int lgth,
947 uint16_t group, uint16_t element)
949 (void)lgth; //not used
950 TagKey key = DictEntry::TranslateToKey(group, element);
951 if ( !TagHT.count(key))
956 /* Hope Binary field length is *never* wrong
957 if(lgth%2) // Non even length are padded with a space (020H).
960 //content = content + '\0'; // fing a trick to enlarge a binary field?
963 BinEntry* a = (BinEntry *)TagHT[key];
964 a->SetBinArea(content);
966 a->SetValue(GDCM_BINLOADED);
972 * \brief Accesses an existing DocEntry (i.e. a Dicom Element)
973 * in the PubDocEntrySet of this instance
974 * through it's (group, element) and modifies it's length with
976 * \warning Use with extreme caution.
977 * @param l new length to substitute with
978 * @param group group number of the Entry to modify
979 * @param element element number of the Entry to modify
980 * @return true on success, false otherwise.
982 bool Document::SetEntryLengthByNumber(uint32_t l,
983 uint16_t group, uint16_t element)
985 /// \todo use map methods, instead of multimap JPR
986 TagKey key = DictEntry::TranslateToKey(group, element);
987 if ( !TagHT.count(key) )
993 l++; // length must be even
995 ( ((TagHT.equal_range(key)).first)->second )->SetLength(l);
1001 * \brief Gets (from Header) the offset of a 'non string' element value
1002 * (LoadElementValues has already be executed)
1003 * @param group group number of the Entry
1004 * @param elem element number of the Entry
1005 * @return File Offset of the Element Value
1007 size_t Document::GetEntryOffsetByNumber(uint16_t group, uint16_t elem)
1009 DocEntry* entry = GetDocEntryByNumber(group, elem);
1012 dbg.Verbose(1, "Document::GetDocEntryByNumber: no entry present.");
1015 return entry->GetOffset();
1019 * \brief Gets (from Header) a 'non string' element value
1020 * (LoadElementValues has already be executed)
1021 * @param group group number of the Entry
1022 * @param elem element number of the Entry
1023 * @return Pointer to the 'non string' area
1025 void* Document::GetEntryBinAreaByNumber(uint16_t group, uint16_t elem)
1027 DocEntry* entry = GetDocEntryByNumber(group, elem);
1030 dbg.Verbose(1, "Document::GetDocEntryByNumber: no entry");
1033 if ( BinEntry* binEntry = dynamic_cast<BinEntry*>(entry) )
1035 return binEntry->GetBinArea();
1042 * \brief Loads (from disk) the element content
1043 * when a string is not suitable
1044 * @param group group number of the Entry
1045 * @param elem element number of the Entry
1047 void* Document::LoadEntryBinArea(uint16_t group, uint16_t elem)
1049 DocEntry *docElement = GetDocEntryByNumber(group, elem);
1054 size_t o =(size_t)docElement->GetOffset();
1055 Fp->seekg( o, std::ios_base::beg);
1056 size_t l = docElement->GetLength();
1057 uint8_t* a = new uint8_t[l];
1060 dbg.Verbose(0, "Document::LoadEntryBinArea cannot allocate a");
1063 Fp->read((char*)a, l);
1064 if( Fp->fail() || Fp->eof() )//Fp->gcount() == 1
1069 /// \todo Drop any already existing void area! JPR
1070 if( !SetEntryBinAreaByNumber( a, group, elem ) )
1072 dbg.Verbose(0, "Document::LoadEntryBinArea setting failed.");
1077 * \brief Loads (from disk) the element content
1078 * when a string is not suitable
1079 * @param element Entry whose binArea is going to be loaded
1081 void* Document::LoadEntryBinArea(BinEntry* element)
1083 size_t o =(size_t)element->GetOffset();
1084 Fp->seekg(o, std::ios_base::beg);
1085 size_t l = element->GetLength();
1086 uint8_t* a = new uint8_t[l];
1089 dbg.Verbose(0, "Document::LoadEntryBinArea cannot allocate a");
1092 element->SetBinArea((uint8_t*)a);
1093 /// \todo check the result
1094 Fp->read((char*)a, l);
1095 if( Fp->fail() || Fp->eof()) //Fp->gcount() == 1
1105 * \brief Sets a 'non string' value to a given Dicom Element
1106 * @param area area containing the 'non string' value
1107 * @param group Group number of the searched Dicom Element
1108 * @param element Element number of the searched Dicom Element
1111 bool Document::SetEntryBinAreaByNumber(uint8_t* area,
1112 uint16_t group, uint16_t element)
1114 DocEntry* currentEntry = GetDocEntryByNumber(group, element);
1115 if ( !currentEntry )
1119 if ( BinEntry* binEntry = dynamic_cast<BinEntry*>(currentEntry) )
1121 binEntry->SetBinArea( area );
1128 * \brief Update the entries with the shadow dictionary.
1129 * Only non even entries are analyzed
1131 void Document::UpdateShaEntries()
1136 /// \todo TODO : still any use to explore recursively the whole structure?
1138 for(ListTag::iterator it=listEntries.begin();
1139 it!=listEntries.end();
1142 // Odd group => from public dictionary
1143 if((*it)->GetGroup()%2==0)
1146 // Peer group => search the corresponding dict entry
1148 entry=RefShaDict->GetDictEntryByNumber((*it)->GetGroup(),(*it)->GetElement());
1152 if((*it)->IsImplicitVR())
1157 (*it)->SetValue(GetDocEntryUnvalue(*it)); // to go on compiling
1159 // Set the new entry and the new value
1160 (*it)->SetDictEntry(entry);
1161 CheckDocEntryVR(*it,vr);
1163 (*it)->SetValue(GetDocEntryValue(*it)); // to go on compiling
1168 // Remove precedent value transformation
1169 (*it)->SetDictEntry(NewVirtualDictEntry((*it)->GetGroup(),(*it)->GetElement(),vr));
1176 * \brief Searches within the Header Entries for a Dicom Element of
1178 * @param tagName name of the searched Dicom Element.
1179 * @return Corresponding Dicom Element when it exists, and NULL
1182 DocEntry* Document::GetDocEntryByName(TagName const & tagName)
1184 DictEntry *dictEntry = RefPubDict->GetDictEntryByName(tagName);
1190 return GetDocEntryByNumber(dictEntry->GetGroup(),dictEntry->GetElement());
1194 * \brief retrieves a Dicom Element (the first one) using (group, element)
1195 * \warning (group, element) IS NOT an identifier inside the Dicom Header
1196 * if you think it's NOT UNIQUE, check the count number
1197 * and use iterators to retrieve ALL the Dicoms Elements within
1198 * a given couple (group, element)
1199 * @param group Group number of the searched Dicom Element
1200 * @param element Element number of the searched Dicom Element
1203 DocEntry* Document::GetDocEntryByNumber(uint16_t group, uint16_t element)
1205 TagKey key = DictEntry::TranslateToKey(group, element);
1206 if ( !TagHT.count(key))
1210 return TagHT.find(key)->second;
1214 * \brief Same as \ref Document::GetDocEntryByNumber except it only
1215 * returns a result when the corresponding entry is of type
1217 * @return When present, the corresponding ValEntry.
1219 ValEntry* Document::GetValEntryByNumber(uint16_t group, uint16_t element)
1221 DocEntry* currentEntry = GetDocEntryByNumber(group, element);
1222 if ( !currentEntry )
1226 if ( ValEntry* valEntry = dynamic_cast<ValEntry*>(currentEntry) )
1230 dbg.Verbose(0, "Document::GetValEntryByNumber: unfound ValEntry.");
1236 * \brief Loads the element while preserving the current
1237 * underlying file position indicator as opposed to
1238 * to LoadDocEntry that modifies it.
1239 * @param entry Header Entry whose value shall be loaded.
1242 void Document::LoadDocEntrySafe(DocEntry * entry)
1244 long PositionOnEntry = Fp->tellg();
1245 LoadDocEntry(entry);
1246 Fp->seekg(PositionOnEntry, std::ios_base::beg);
1250 * \brief Swaps back the bytes of 4-byte long integer accordingly to
1252 * @return The properly swaped 32 bits integer.
1254 uint32_t Document::SwapLong(uint32_t a)
1261 a=( ((a<<24) & 0xff000000) | ((a<<8) & 0x00ff0000) |
1262 ((a>>8) & 0x0000ff00) | ((a>>24) & 0x000000ff) );
1266 a=( ((a<<16) & 0xffff0000) | ((a>>16) & 0x0000ffff) );
1270 a=( ((a<< 8) & 0xff00ff00) | ((a>>8) & 0x00ff00ff) );
1273 //std::cout << "swapCode= " << SwapCode << std::endl;
1274 dbg.Error(" Document::SwapLong : unset swap code");
1281 * \brief Unswaps back the bytes of 4-byte long integer accordingly to
1283 * @return The properly unswaped 32 bits integer.
1285 uint32_t Document::UnswapLong(uint32_t a)
1291 * \brief Swaps the bytes so they agree with the processor order
1292 * @return The properly swaped 16 bits integer.
1294 uint16_t Document::SwapShort(uint16_t a)
1296 if ( SwapCode == 4321 || SwapCode == 2143 )
1298 a = ((( a << 8 ) & 0x0ff00 ) | (( a >> 8 ) & 0x00ff ) );
1304 * \brief Unswaps the bytes so they agree with the processor order
1305 * @return The properly unswaped 16 bits integer.
1307 uint16_t Document::UnswapShort(uint16_t a)
1309 return SwapShort(a);
1312 //-----------------------------------------------------------------------------
1316 * \brief Parses a DocEntrySet (Zero-level DocEntries or SQ Item DocEntries)
1317 * @return length of the parsed set.
1319 void Document::ParseDES(DocEntrySet *set, long offset,
1320 long l_max, bool delim_mode)
1322 DocEntry *newDocEntry = 0;
1326 if ( !delim_mode && (Fp->tellg()-offset) >= l_max)
1330 newDocEntry = ReadNextDocEntry( );
1336 VRKey vr = newDocEntry->GetVR();
1340 if ( Global::GetVR()->IsVROfGdcmStringRepresentable(vr) )
1342 /////////////////////// ValEntry
1343 ValEntry* newValEntry =
1344 new ValEntry( newDocEntry->GetDictEntry() );
1345 newValEntry->Copy( newDocEntry );
1347 // When "set" is a Document, then we are at the top of the
1348 // hierarchy and the Key is simply of the form ( group, elem )...
1349 if (Document* dummy = dynamic_cast< Document* > ( set ) )
1352 newValEntry->SetKey( newValEntry->GetKey() );
1354 // ...but when "set" is a SQItem, we are inserting this new
1355 // valEntry in a sequence item. Hence the key has the
1356 // generalized form (refer to \ref BaseTagKey):
1357 if (SQItem* parentSQItem = dynamic_cast< SQItem* > ( set ) )
1359 newValEntry->SetKey( parentSQItem->GetBaseTagKey()
1360 + newValEntry->GetKey() );
1363 set->AddEntry( newValEntry );
1364 LoadDocEntry( newValEntry );
1365 if (newValEntry->IsItemDelimitor())
1369 if ( !delim_mode && (Fp->tellg()-offset) >= l_max)
1376 if ( ! Global::GetVR()->IsVROfGdcmBinaryRepresentable(vr) )
1378 ////// Neither ValEntry NOR BinEntry: should mean UNKOWN VR
1379 dbg.Verbose(0, "Document::ParseDES: neither Valentry, "
1380 "nor BinEntry. Probably unknown VR.");
1383 //////////////////// BinEntry or UNKOWN VR:
1384 BinEntry* newBinEntry =
1385 new BinEntry( newDocEntry->GetDictEntry() ); //LEAK
1386 newBinEntry->Copy( newDocEntry );
1388 // When "this" is a Document the Key is simply of the
1389 // form ( group, elem )...
1390 if (Document* dummy = dynamic_cast< Document* > ( set ) )
1393 newBinEntry->SetKey( newBinEntry->GetKey() );
1395 // but when "this" is a SQItem, we are inserting this new
1396 // valEntry in a sequence item, and the kay has the
1397 // generalized form (refer to \ref BaseTagKey):
1398 if (SQItem* parentSQItem = dynamic_cast< SQItem* > ( set ) )
1400 newBinEntry->SetKey( parentSQItem->GetBaseTagKey()
1401 + newBinEntry->GetKey() );
1404 set->AddEntry( newBinEntry );
1405 LoadDocEntry( newBinEntry );
1408 if ( ( newDocEntry->GetGroup() == 0x7fe0 )
1409 && ( newDocEntry->GetElement() == 0x0010 ) )
1411 TransferSyntaxType ts = GetTransferSyntax();
1412 if ( ts == RLELossless )
1414 long PositionOnEntry = Fp->tellg();
1415 Fp->seekg( newDocEntry->GetOffset(), std::ios_base::beg );
1417 Fp->seekg( PositionOnEntry, std::ios_base::beg );
1419 else if ( IsJPEG() )
1421 long PositionOnEntry = Fp->tellg();
1422 Fp->seekg( newDocEntry->GetOffset(), std::ios_base::beg );
1423 ComputeJPEGFragmentInfo();
1424 Fp->seekg( PositionOnEntry, std::ios_base::beg );
1428 // Just to make sure we are at the beginning of next entry.
1429 SkipToNextDocEntry(newDocEntry);
1434 unsigned long l = newDocEntry->GetReadLength();
1435 if ( l != 0 ) // don't mess the delim_mode for zero-length sequence
1437 if ( l == 0xffffffff )
1446 // no other way to create it ...
1447 SeqEntry* newSeqEntry =
1448 new SeqEntry( newDocEntry->GetDictEntry() );
1449 newSeqEntry->Copy( newDocEntry );
1450 newSeqEntry->SetDelimitorMode( delim_mode );
1452 // At the top of the hierarchy, stands a Document. When "set"
1453 // is a Document, then we are building the first depth level.
1454 // Hence the SeqEntry we are building simply has a depth
1456 if (Document* dummy = dynamic_cast< Document* > ( set ) )
1459 newSeqEntry->SetDepthLevel( 1 );
1460 newSeqEntry->SetKey( newSeqEntry->GetKey() );
1462 // But when "set" is allready a SQItem, we are building a nested
1463 // sequence, and hence the depth level of the new SeqEntry
1464 // we are building, is one level deeper:
1465 if (SQItem* parentSQItem = dynamic_cast< SQItem* > ( set ) )
1467 newSeqEntry->SetDepthLevel( parentSQItem->GetDepthLevel() + 1 );
1468 newSeqEntry->SetKey( parentSQItem->GetBaseTagKey()
1469 + newSeqEntry->GetKey() );
1473 { // Don't try to parse zero-length sequences
1474 ParseSQ( newSeqEntry,
1475 newDocEntry->GetOffset(),
1478 set->AddEntry( newSeqEntry );
1479 if ( !delim_mode && (Fp->tellg()-offset) >= l_max)
1489 * \brief Parses a Sequence ( SeqEntry after SeqEntry)
1490 * @return parsed length for this level
1492 void Document::ParseSQ( SeqEntry* seqEntry,
1493 long offset, long l_max, bool delim_mode)
1495 int SQItemNumber = 0;
1500 DocEntry* newDocEntry = ReadNextDocEntry();
1503 // FIXME Should warn user
1508 if ( newDocEntry->IsSequenceDelimitor() )
1510 seqEntry->SetSequenceDelimitationItem( newDocEntry );
1514 if ( !delim_mode && (Fp->tellg()-offset) >= l_max)
1519 SQItem *itemSQ = new SQItem( seqEntry->GetDepthLevel() );
1520 std::ostringstream newBase;
1521 newBase << seqEntry->GetKey()
1525 itemSQ->SetBaseTagKey( newBase.str() );
1526 unsigned int l = newDocEntry->GetReadLength();
1528 if ( l == 0xffffffff )
1537 ParseDES(itemSQ, newDocEntry->GetOffset(), l, dlm_mod);
1539 seqEntry->AddEntry( itemSQ, SQItemNumber );
1541 if ( !delim_mode && ( Fp->tellg() - offset ) >= l_max )
1549 * \brief Loads the element content if its length doesn't exceed
1550 * the value specified with Document::SetMaxSizeLoadEntry()
1551 * @param entry Header Entry (Dicom Element) to be dealt with
1553 void Document::LoadDocEntry(DocEntry* entry)
1555 uint16_t group = entry->GetGroup();
1556 std::string vr = entry->GetVR();
1557 uint32_t length = entry->GetLength();
1559 Fp->seekg((long)entry->GetOffset(), std::ios_base::beg);
1561 // A SeQuence "contains" a set of Elements.
1562 // (fffe e000) tells us an Element is beginning
1563 // (fffe e00d) tells us an Element just ended
1564 // (fffe e0dd) tells us the current SeQuence just ended
1565 if( group == 0xfffe )
1567 // NO more value field for SQ !
1571 // When the length is zero things are easy:
1574 ((ValEntry *)entry)->SetValue("");
1578 // The elements whose length is bigger than the specified upper bound
1579 // are not loaded. Instead we leave a short notice of the offset of
1580 // the element content and it's length.
1582 std::ostringstream s;
1583 if (length > MaxSizeLoadEntry)
1585 if (BinEntry* binEntryPtr = dynamic_cast< BinEntry* >(entry) )
1587 //s << "gdcm::NotLoaded (BinEntry)";
1588 s << GDCM_NOTLOADED;
1589 s << " Address:" << (long)entry->GetOffset();
1590 s << " Length:" << entry->GetLength();
1591 s << " x(" << std::hex << entry->GetLength() << ")";
1592 binEntryPtr->SetValue(s.str());
1594 // Be carefull : a BinEntry IS_A ValEntry ...
1595 else if (ValEntry* valEntryPtr = dynamic_cast< ValEntry* >(entry) )
1597 // s << "gdcm::NotLoaded. (ValEntry)";
1598 s << GDCM_NOTLOADED;
1599 s << " Address:" << (long)entry->GetOffset();
1600 s << " Length:" << entry->GetLength();
1601 s << " x(" << std::hex << entry->GetLength() << ")";
1602 valEntryPtr->SetValue(s.str());
1607 std::cout<< "MaxSizeLoadEntry exceeded, neither a BinEntry "
1608 << "nor a ValEntry ?! Should never print that !" << std::endl;
1611 // to be sure we are at the end of the value ...
1612 Fp->seekg((long)entry->GetOffset()+(long)entry->GetLength(),
1613 std::ios_base::beg);
1617 // When we find a BinEntry not very much can be done :
1618 if (BinEntry* binEntryPtr = dynamic_cast< BinEntry* >(entry) )
1620 s << GDCM_BINLOADED;
1621 binEntryPtr->SetValue(s.str());
1622 LoadEntryBinArea(binEntryPtr); // last one, not to erase length !
1626 /// \todo Any compacter code suggested (?)
1627 if ( IsDocEntryAnInteger(entry) )
1631 // When short integer(s) are expected, read and convert the following
1632 // n *two characters properly i.e. consider them as short integers as
1633 // opposed to strings.
1634 // Elements with Value Multiplicity > 1
1635 // contain a set of integers (not a single one)
1636 if (vr == "US" || vr == "SS")
1639 NewInt = ReadInt16();
1643 for (int i=1; i < nbInt; i++)
1646 NewInt = ReadInt16();
1651 // See above comment on multiple integers (mutatis mutandis).
1652 else if (vr == "UL" || vr == "SL")
1655 NewInt = ReadInt32();
1659 for (int i=1; i < nbInt; i++)
1662 NewInt = ReadInt32();
1667 #ifdef GDCM_NO_ANSI_STRING_STREAM
1668 s << std::ends; // to avoid oddities on Solaris
1669 #endif //GDCM_NO_ANSI_STRING_STREAM
1671 ((ValEntry *)entry)->SetValue(s.str());
1675 // FIXME: We need an additional byte for storing \0 that is not on disk
1676 char *str = new char[length+1];
1677 Fp->read(str, (size_t)length);
1678 str[length] = '\0'; //this is only useful when length is odd
1679 // Special DicomString call to properly handle \0 and even length
1680 std::string newValue;
1683 newValue = Util::DicomString(str, length+1);
1684 //dbg.Verbose(0, "Warning: bad length: ", length );
1685 dbg.Verbose(0, "For string :", newValue.c_str());
1686 // Since we change the length of string update it length
1687 entry->SetReadLength(length+1);
1691 newValue = Util::DicomString(str, length);
1695 if ( ValEntry* valEntry = dynamic_cast<ValEntry* >(entry) )
1697 if ( Fp->fail() || Fp->eof())//Fp->gcount() == 1
1699 dbg.Verbose(1, "Document::LoadDocEntry",
1700 "unread element value");
1701 valEntry->SetValue(GDCM_UNREAD);
1707 // Because of correspondance with the VR dic
1708 valEntry->SetValue(newValue);
1712 valEntry->SetValue(newValue);
1717 dbg.Error(true, "Document::LoadDocEntry"
1718 "Should have a ValEntry, here !");
1724 * \brief Find the value Length of the passed Header Entry
1725 * @param entry Header Entry whose length of the value shall be loaded.
1727 void Document::FindDocEntryLength( DocEntry *entry )
1728 throw ( FormatError )
1730 uint16_t element = entry->GetElement();
1731 std::string vr = entry->GetVR();
1734 if ( Filetype == ExplicitVR && !entry->IsImplicitVR() )
1736 if ( vr == "OB" || vr == "OW" || vr == "SQ" || vr == "UN" )
1738 // The following reserved two bytes (see PS 3.5-2003, section
1739 // "7.1.2 Data element structure with explicit vr", p 27) must be
1740 // skipped before proceeding on reading the length on 4 bytes.
1741 Fp->seekg( 2L, std::ios_base::cur);
1742 uint32_t length32 = ReadInt32();
1744 if ( (vr == "OB" || vr == "OW") && length32 == 0xffffffff )
1749 /// \todo rename that to FindDocEntryLengthOBOrOW since
1750 /// the above test is on both OB and OW...
1751 lengthOB = FindDocEntryLengthOB();
1753 catch ( FormatUnexpected )
1755 // Computing the length failed (this happens with broken
1756 // files like gdcm-JPEG-LossLess3a.dcm). We still have a
1757 // chance to get the pixels by deciding the element goes
1758 // until the end of the file. Hence we artificially fix the
1759 // the length and proceed.
1760 long currentPosition = Fp->tellg();
1761 Fp->seekg(0L,std::ios_base::end);
1762 long lengthUntilEOF = Fp->tellg() - currentPosition;
1763 Fp->seekg(currentPosition, std::ios_base::beg);
1764 entry->SetLength(lengthUntilEOF);
1767 entry->SetLength(lengthOB);
1770 FixDocEntryFoundLength(entry, length32);
1774 // Length is encoded on 2 bytes.
1775 length16 = ReadInt16();
1777 // We can tell the current file is encoded in big endian (like
1778 // Data/US-RGB-8-epicard) when we find the "Transfer Syntax" tag
1779 // and it's value is the one of the encoding of a big endian file.
1780 // In order to deal with such big endian encoded files, we have
1781 // (at least) two strategies:
1782 // * when we load the "Transfer Syntax" tag with value of big endian
1783 // encoding, we raise the proper flags. Then we wait for the end
1784 // of the META group (0x0002) among which is "Transfer Syntax",
1785 // before switching the swap code to big endian. We have to postpone
1786 // the switching of the swap code since the META group is fully encoded
1787 // in little endian, and big endian coding only starts at the next
1788 // group. The corresponding code can be hard to analyse and adds
1789 // many additional unnecessary tests for regular tags.
1790 // * the second strategy consists in waiting for trouble, that shall
1791 // appear when we find the first group with big endian encoding. This
1792 // is easy to detect since the length of a "Group Length" tag (the
1793 // ones with zero as element number) has to be of 4 (0x0004). When we
1794 // encounter 1024 (0x0400) chances are the encoding changed and we
1795 // found a group with big endian encoding.
1796 // We shall use this second strategy. In order to make sure that we
1797 // can interpret the presence of an apparently big endian encoded
1798 // length of a "Group Length" without committing a big mistake, we
1799 // add an additional check: we look in the already parsed elements
1800 // for the presence of a "Transfer Syntax" whose value has to be "big
1801 // endian encoding". When this is the case, chances are we have got our
1802 // hands on a big endian encoded file: we switch the swap code to
1803 // big endian and proceed...
1804 if ( element == 0x0000 && length16 == 0x0400 )
1806 TransferSyntaxType ts = GetTransferSyntax();
1807 if ( ts != ExplicitVRBigEndian )
1809 throw FormatError( "Document::FindDocEntryLength()",
1810 " not explicit VR." );
1814 SwitchSwapToBigEndian();
1815 // Restore the unproperly loaded values i.e. the group, the element
1816 // and the dictionary entry depending on them.
1817 uint16_t correctGroup = SwapShort( entry->GetGroup() );
1818 uint16_t correctElem = SwapShort( entry->GetElement() );
1819 DictEntry* newTag = GetDictEntryByNumber( correctGroup,
1823 // This correct tag is not in the dictionary. Create a new one.
1824 newTag = NewVirtualDictEntry(correctGroup, correctElem);
1826 // FIXME this can create a memory leaks on the old entry that be
1827 // left unreferenced.
1828 entry->SetDictEntry( newTag );
1831 // Heuristic: well, some files are really ill-formed.
1832 if ( length16 == 0xffff)
1834 // 0xffff means that we deal with 'Unknown Length' Sequence
1837 FixDocEntryFoundLength( entry, (uint32_t)length16 );
1842 // Either implicit VR or a non DICOM conformal (see note below) explicit
1843 // VR that ommited the VR of (at least) this element. Farts happen.
1844 // [Note: according to the part 5, PS 3.5-2001, section 7.1 p25
1845 // on Data elements "Implicit and Explicit VR Data Elements shall
1846 // not coexist in a Data Set and Data Sets nested within it".]
1847 // Length is on 4 bytes.
1849 FixDocEntryFoundLength( entry, ReadInt32() );
1855 * \brief Find the Value Representation of the current Dicom Element.
1858 void Document::FindDocEntryVR( DocEntry *entry )
1860 if ( Filetype != ExplicitVR )
1867 long positionOnEntry = Fp->tellg();
1868 // Warning: we believe this is explicit VR (Value Representation) because
1869 // we used a heuristic that found "UL" in the first tag. Alas this
1870 // doesn't guarantee that all the tags will be in explicit VR. In some
1871 // cases (see e-film filtered files) one finds implicit VR tags mixed
1872 // within an explicit VR file. Hence we make sure the present tag
1873 // is in explicit VR and try to fix things if it happens not to be
1876 Fp->read (vr, (size_t)2);
1879 if( !CheckDocEntryVR(entry, vr) )
1881 Fp->seekg(positionOnEntry, std::ios_base::beg);
1882 // When this element is known in the dictionary we shall use, e.g. for
1883 // the semantics (see the usage of IsAnInteger), the VR proposed by the
1884 // dictionary entry. Still we have to flag the element as implicit since
1885 // we know now our assumption on expliciteness is not furfilled.
1887 if ( entry->IsVRUnknown() )
1889 entry->SetVR("Implicit");
1891 entry->SetImplicitVR();
1896 * \brief Check the correspondance between the VR of the header entry
1897 * and the taken VR. If they are different, the header entry is
1898 * updated with the new VR.
1899 * @param entry Header Entry to check
1900 * @param vr Dicom Value Representation
1901 * @return false if the VR is incorrect of if the VR isn't referenced
1902 * otherwise, it returns true
1904 bool Document::CheckDocEntryVR(DocEntry *entry, VRKey vr)
1907 bool realExplicit = true;
1909 // Assume we are reading a falsely explicit VR file i.e. we reached
1910 // a tag where we expect reading a VR but are in fact we read the
1911 // first to bytes of the length. Then we will interogate (through find)
1912 // the dicom_vr dictionary with oddities like "\004\0" which crashes
1913 // both GCC and VC++ implementations of the STL map. Hence when the
1914 // expected VR read happens to be non-ascii characters we consider
1915 // we hit falsely explicit VR tag.
1917 if ( !isalpha(vr[0]) && !isalpha(vr[1]) )
1919 realExplicit = false;
1922 // CLEANME searching the dicom_vr at each occurence is expensive.
1923 // PostPone this test in an optional integrity check at the end
1924 // of parsing or only in debug mode.
1925 if ( realExplicit && !Global::GetVR()->Count(vr) )
1927 realExplicit = false;
1930 if ( !realExplicit )
1932 // We thought this was explicit VR, but we end up with an
1933 // implicit VR tag. Let's backtrack.
1934 msg = Util::Format("Falsely explicit vr file (%04x,%04x)\n",
1935 entry->GetGroup(), entry->GetElement());
1936 dbg.Verbose(1, "Document::FindVR: ", msg.c_str());
1938 if( entry->GetGroup() % 2 && entry->GetElement() == 0x0000)
1940 // Group length is UL !
1941 DictEntry* newEntry = NewVirtualDictEntry(
1942 entry->GetGroup(), entry->GetElement(),
1943 "UL", "FIXME", "Group Length");
1944 entry->SetDictEntry( newEntry );
1949 if ( entry->IsVRUnknown() )
1951 // When not a dictionary entry, we can safely overwrite the VR.
1952 if( entry->GetElement() == 0x0000 )
1954 // Group length is UL !
1962 else if ( entry->GetVR() != vr )
1964 // The VR present in the file and the dictionary disagree. We assume
1965 // the file writer knew best and use the VR of the file. Since it would
1966 // be unwise to overwrite the VR of a dictionary (since it would
1967 // compromise it's next user), we need to clone the actual DictEntry
1968 // and change the VR for the read one.
1969 DictEntry* newEntry = NewVirtualDictEntry(
1970 entry->GetGroup(), entry->GetElement(),
1971 vr, "FIXME", entry->GetName());
1972 entry->SetDictEntry(newEntry);
1979 * \brief Get the transformed value of the header entry. The VR value
1980 * is used to define the transformation to operate on the value
1981 * \warning NOT end user intended method !
1982 * @param entry entry to tranform
1983 * @return Transformed entry value
1985 std::string Document::GetDocEntryValue(DocEntry *entry)
1987 if ( IsDocEntryAnInteger(entry) && entry->IsImplicitVR() )
1989 std::string val = ((ValEntry *)entry)->GetValue();
1990 std::string vr = entry->GetVR();
1991 uint32_t length = entry->GetLength();
1992 std::ostringstream s;
1995 // When short integer(s) are expected, read and convert the following
1996 // n * 2 bytes properly i.e. as a multivaluated strings
1997 // (each single value is separated fromthe next one by '\'
1998 // as usual for standard multivaluated filels
1999 // Elements with Value Multiplicity > 1
2000 // contain a set of short integers (not a single one)
2002 if( vr == "US" || vr == "SS" )
2007 for (int i=0; i < nbInt; i++)
2013 newInt16 = ( val[2*i+0] & 0xFF ) + ( ( val[2*i+1] & 0xFF ) << 8);
2014 newInt16 = SwapShort( newInt16 );
2019 // When integer(s) are expected, read and convert the following
2020 // n * 4 bytes properly i.e. as a multivaluated strings
2021 // (each single value is separated fromthe next one by '\'
2022 // as usual for standard multivaluated filels
2023 // Elements with Value Multiplicity > 1
2024 // contain a set of integers (not a single one)
2025 else if( vr == "UL" || vr == "SL" )
2030 for (int i=0; i < nbInt; i++)
2036 newInt32 = ( val[4*i+0] & 0xFF )
2037 + (( val[4*i+1] & 0xFF ) << 8 )
2038 + (( val[4*i+2] & 0xFF ) << 16 )
2039 + (( val[4*i+3] & 0xFF ) << 24 );
2040 newInt32 = SwapLong( newInt32 );
2044 #ifdef GDCM_NO_ANSI_STRING_STREAM
2045 s << std::ends; // to avoid oddities on Solaris
2046 #endif //GDCM_NO_ANSI_STRING_STREAM
2050 return ((ValEntry *)entry)->GetValue();
2054 * \brief Get the reverse transformed value of the header entry. The VR
2055 * value is used to define the reverse transformation to operate on
2057 * \warning NOT end user intended method !
2058 * @param entry Entry to reverse transform
2059 * @return Reverse transformed entry value
2061 std::string Document::GetDocEntryUnvalue(DocEntry* entry)
2063 if ( IsDocEntryAnInteger(entry) && entry->IsImplicitVR() )
2065 std::string vr = entry->GetVR();
2066 std::vector<std::string> tokens;
2067 std::ostringstream s;
2069 if ( vr == "US" || vr == "SS" )
2073 tokens.erase( tokens.begin(), tokens.end()); // clean any previous value
2074 Util::Tokenize (((ValEntry *)entry)->GetValue(), tokens, "\\");
2075 for (unsigned int i=0; i<tokens.size(); i++)
2077 newInt16 = atoi(tokens[i].c_str());
2078 s << ( newInt16 & 0xFF )
2079 << (( newInt16 >> 8 ) & 0xFF );
2083 if ( vr == "UL" || vr == "SL")
2087 tokens.erase(tokens.begin(),tokens.end()); // clean any previous value
2088 Util::Tokenize (((ValEntry *)entry)->GetValue(), tokens, "\\");
2089 for (unsigned int i=0; i<tokens.size();i++)
2091 newInt32 = atoi(tokens[i].c_str());
2092 s << (char)( newInt32 & 0xFF )
2093 << (char)(( newInt32 >> 8 ) & 0xFF )
2094 << (char)(( newInt32 >> 16 ) & 0xFF )
2095 << (char)(( newInt32 >> 24 ) & 0xFF );
2100 #ifdef GDCM_NO_ANSI_STRING_STREAM
2101 s << std::ends; // to avoid oddities on Solaris
2102 #endif //GDCM_NO_ANSI_STRING_STREAM
2106 return ((ValEntry *)entry)->GetValue();
2110 * \brief Skip a given Header Entry
2111 * \warning NOT end user intended method !
2112 * @param entry entry to skip
2114 void Document::SkipDocEntry(DocEntry *entry)
2116 SkipBytes(entry->GetLength());
2120 * \brief Skips to the begining of the next Header Entry
2121 * \warning NOT end user intended method !
2122 * @param entry entry to skip
2124 void Document::SkipToNextDocEntry(DocEntry *entry)
2126 Fp->seekg((long)(entry->GetOffset()), std::ios_base::beg);
2127 Fp->seekg( (long)(entry->GetReadLength()), std::ios_base::cur);
2131 * \brief When the length of an element value is obviously wrong (because
2132 * the parser went Jabberwocky) one can hope improving things by
2133 * applying some heuristics.
2134 * @param entry entry to check
2135 * @param foundLength fist assumption about length
2137 void Document::FixDocEntryFoundLength(DocEntry *entry,
2138 uint32_t foundLength)
2140 entry->SetReadLength( foundLength ); // will be updated only if a bug is found
2141 if ( foundLength == 0xffffffff)
2146 uint16_t gr = entry->GetGroup();
2147 uint16_t el = entry->GetElement();
2149 if ( foundLength % 2)
2151 std::ostringstream s;
2152 s << "Warning : Tag with uneven length "
2154 << " in x(" << std::hex << gr << "," << el <<")" << std::dec;
2155 dbg.Verbose(0, s.str().c_str());
2158 //////// Fix for some naughty General Electric images.
2159 // Allthough not recent many such GE corrupted images are still present
2160 // on Creatis hard disks. Hence this fix shall remain when such images
2161 // are no longer in user (we are talking a few years, here)...
2162 // Note: XMedCom probably uses such a trick since it is able to read
2163 // those pesky GE images ...
2164 if ( foundLength == 13)
2166 // Only happens for this length !
2167 if ( entry->GetGroup() != 0x0008
2168 || ( entry->GetElement() != 0x0070
2169 && entry->GetElement() != 0x0080 ) )
2172 entry->SetReadLength(10); /// \todo a bug is to be fixed !?
2176 //////// Fix for some brain-dead 'Leonardo' Siemens images.
2177 // Occurence of such images is quite low (unless one leaves close to a
2178 // 'Leonardo' source. Hence, one might consider commenting out the
2179 // following fix on efficiency reasons.
2180 else if ( entry->GetGroup() == 0x0009
2181 && ( entry->GetElement() == 0x1113
2182 || entry->GetElement() == 0x1114 ) )
2185 entry->SetReadLength(4); /// \todo a bug is to be fixed !?
2188 else if ( entry->GetVR() == "SQ" )
2190 foundLength = 0; // ReadLength is unchanged
2193 //////// We encountered a 'delimiter' element i.e. a tag of the form
2194 // "fffe|xxxx" which is just a marker. Delimiters length should not be
2195 // taken into account.
2196 else if( entry->GetGroup() == 0xfffe )
2198 // According to the norm, fffe|0000 shouldn't exist. BUT the Philips
2199 // image gdcmData/gdcm-MR-PHILIPS-16-Multi-Seq.dcm happens to
2200 // causes extra troubles...
2201 if( entry->GetElement() != 0x0000 )
2207 entry->SetUsableLength(foundLength);
2211 * \brief Apply some heuristics to predict whether the considered
2212 * element value contains/represents an integer or not.
2213 * @param entry The element value on which to apply the predicate.
2214 * @return The result of the heuristical predicate.
2216 bool Document::IsDocEntryAnInteger(DocEntry *entry)
2218 uint16_t element = entry->GetElement();
2219 uint16_t group = entry->GetGroup();
2220 const std::string & vr = entry->GetVR();
2221 uint32_t length = entry->GetLength();
2223 // When we have some semantics on the element we just read, and if we
2224 // a priori know we are dealing with an integer, then we shall be
2225 // able to swap it's element value properly.
2226 if ( element == 0 ) // This is the group length of the group
2234 // Allthough this should never happen, still some images have a
2235 // corrupted group length [e.g. have a glance at offset x(8336) of
2236 // gdcmData/gdcm-MR-PHILIPS-16-Multi-Seq.dcm].
2237 // Since for dicom compliant and well behaved headers, the present
2238 // test is useless (and might even look a bit paranoid), when we
2239 // encounter such an ill-formed image, we simply display a warning
2240 // message and proceed on parsing (while crossing fingers).
2241 std::ostringstream s;
2242 long filePosition = Fp->tellg();
2243 s << "Erroneous Group Length element length on : (" \
2244 << std::hex << group << " , " << element
2245 << ") -before- position x(" << filePosition << ")"
2246 << "lgt : " << length;
2247 dbg.Verbose(0, "Document::IsDocEntryAnInteger", s.str().c_str() );
2251 if ( vr == "UL" || vr == "US" || vr == "SL" || vr == "SS" )
2260 * \brief Find the Length till the next sequence delimiter
2261 * \warning NOT end user intended method !
2265 uint32_t Document::FindDocEntryLengthOB()
2266 throw( FormatUnexpected )
2268 // See PS 3.5-2001, section A.4 p. 49 on encapsulation of encoded pixel data.
2269 long positionOnEntry = Fp->tellg();
2270 bool foundSequenceDelimiter = false;
2271 uint32_t totalLength = 0;
2273 while ( !foundSequenceDelimiter )
2279 group = ReadInt16();
2282 catch ( FormatError )
2284 throw FormatError("Document::FindDocEntryLengthOB()",
2285 " group or element not present.");
2288 // We have to decount the group and element we just read
2291 if ( group != 0xfffe || ( ( elem != 0xe0dd ) && ( elem != 0xe000 ) ) )
2293 dbg.Verbose(1, "Document::FindDocEntryLengthOB: neither an Item "
2294 "tag nor a Sequence delimiter tag.");
2295 Fp->seekg(positionOnEntry, std::ios_base::beg);
2296 throw FormatUnexpected("Document::FindDocEntryLengthOB()",
2297 "Neither an Item tag nor a Sequence "
2301 if ( elem == 0xe0dd )
2303 foundSequenceDelimiter = true;
2306 uint32_t itemLength = ReadInt32();
2307 // We add 4 bytes since we just read the ItemLength with ReadInt32
2308 totalLength += itemLength + 4;
2309 SkipBytes(itemLength);
2311 if ( foundSequenceDelimiter )
2316 Fp->seekg( positionOnEntry, std::ios_base::beg);
2321 * \brief Reads a supposed to be 16 Bits integer
2322 * (swaps it depending on processor endianity)
2323 * @return read value
2325 uint16_t Document::ReadInt16()
2326 throw( FormatError )
2329 Fp->read ((char*)&g, (size_t)2);
2332 throw FormatError( "Document::ReadInt16()", " file error." );
2336 throw FormatError( "Document::ReadInt16()", "EOF." );
2343 * \brief Reads a supposed to be 32 Bits integer
2344 * (swaps it depending on processor endianity)
2345 * @return read value
2347 uint32_t Document::ReadInt32()
2348 throw( FormatError )
2351 Fp->read ((char*)&g, (size_t)4);
2354 throw FormatError( "Document::ReadInt32()", " file error." );
2358 throw FormatError( "Document::ReadInt32()", "EOF." );
2365 * \brief skips bytes inside the source file
2366 * \warning NOT end user intended method !
2369 void Document::SkipBytes(uint32_t nBytes)
2371 //FIXME don't dump the returned value
2372 Fp->seekg((long)nBytes, std::ios_base::cur);
2376 * \brief Loads all the needed Dictionaries
2377 * \warning NOT end user intended method !
2379 void Document::Initialise()
2381 RefPubDict = Global::GetDicts()->GetDefaultPubDict();
2383 RLEInfo = new RLEFramesInfo;
2384 JPEGInfo = new JPEGFragmentsInfo;
2388 * \brief Discover what the swap code is (among little endian, big endian,
2389 * bad little endian, bad big endian).
2391 * @return false when we are absolutely sure
2392 * it's neither ACR-NEMA nor DICOM
2393 * true when we hope ours assuptions are OK
2395 bool Document::CheckSwap()
2397 // The only guaranted way of finding the swap code is to find a
2398 // group tag since we know it's length has to be of four bytes i.e.
2399 // 0x00000004. Finding the swap code in then straigthforward. Trouble
2400 // occurs when we can't find such group...
2402 uint32_t x = 4; // x : for ntohs
2403 bool net2host; // true when HostByteOrder is the same as NetworkByteOrder
2407 char deb[256]; //HEADER_LENGTH_TO_READ];
2409 // First, compare HostByteOrder and NetworkByteOrder in order to
2410 // determine if we shall need to swap bytes (i.e. the Endian type).
2411 if ( x == ntohs(x) )
2420 // The easiest case is the one of a DICOM header, since it possesses a
2421 // file preamble where it suffice to look for the string "DICM".
2422 Fp->read(deb, HEADER_LENGTH_TO_READ);
2424 char *entCur = deb + 128;
2425 if( memcmp(entCur, "DICM", (size_t)4) == 0 )
2427 dbg.Verbose(1, "Document::CheckSwap:", "looks like DICOM Version3");
2429 // Next, determine the value representation (VR). Let's skip to the
2430 // first element (0002, 0000) and check there if we find "UL"
2431 // - or "OB" if the 1st one is (0002,0001) -,
2432 // in which case we (almost) know it is explicit VR.
2433 // WARNING: if it happens to be implicit VR then what we will read
2434 // is the length of the group. If this ascii representation of this
2435 // length happens to be "UL" then we shall believe it is explicit VR.
2436 // FIXME: in order to fix the above warning, we could read the next
2437 // element value (or a couple of elements values) in order to make
2438 // sure we are not commiting a big mistake.
2439 // We need to skip :
2440 // * the 128 bytes of File Preamble (often padded with zeroes),
2441 // * the 4 bytes of "DICM" string,
2442 // * the 4 bytes of the first tag (0002, 0000),or (0002, 0001)
2443 // i.e. a total of 136 bytes.
2447 // Sometimes (see : gdcmData/icone.dcm) group 0x0002 *is* Explicit VR,
2448 // but elem 0002,0010 (Transfert Syntax) tells us the file is
2449 // *Implicit* VR. -and it is !-
2451 if( memcmp(entCur, "UL", (size_t)2) == 0 ||
2452 memcmp(entCur, "OB", (size_t)2) == 0 ||
2453 memcmp(entCur, "UI", (size_t)2) == 0 ||
2454 memcmp(entCur, "CS", (size_t)2) == 0 ) // CS, to remove later
2455 // when Write DCM *adds*
2457 // Use Document::dicom_vr to test all the possibilities
2458 // instead of just checking for UL, OB and UI !? group 0000
2460 Filetype = ExplicitVR;
2461 dbg.Verbose(1, "Document::CheckSwap:",
2462 "explicit Value Representation");
2466 Filetype = ImplicitVR;
2467 dbg.Verbose(1, "Document::CheckSwap:",
2468 "not an explicit Value Representation");
2474 dbg.Verbose(1, "Document::CheckSwap:",
2475 "HostByteOrder != NetworkByteOrder");
2480 dbg.Verbose(1, "Document::CheckSwap:",
2481 "HostByteOrder = NetworkByteOrder");
2484 // Position the file position indicator at first tag (i.e.
2485 // after the file preamble and the "DICM" string).
2486 Fp->seekg(0, std::ios_base::beg);
2487 Fp->seekg ( 132L, std::ios_base::beg);
2491 // Alas, this is not a DicomV3 file and whatever happens there is no file
2492 // preamble. We can reset the file position indicator to where the data
2493 // is (i.e. the beginning of the file).
2494 dbg.Verbose(1, "Document::CheckSwap:", "not a DICOM Version3 file");
2495 Fp->seekg(0, std::ios_base::beg);
2497 // Our next best chance would be to be considering a 'clean' ACR/NEMA file.
2498 // By clean we mean that the length of the first tag is written down.
2499 // If this is the case and since the length of the first group HAS to be
2500 // four (bytes), then determining the proper swap code is straightforward.
2503 // We assume the array of char we are considering contains the binary
2504 // representation of a 32 bits integer. Hence the following dirty
2506 s32 = *((uint32_t *)(entCur));
2527 // We are out of luck. It is not a DicomV3 nor a 'clean' ACR/NEMA file.
2528 // It is time for despaired wild guesses.
2529 // So, let's check if this file wouldn't happen to be 'dirty' ACR/NEMA,
2530 // i.e. the 'group length' element is not present :
2532 // check the supposed to be 'group number'
2533 // 0x0002 or 0x0004 or 0x0008
2534 // to determine ' SwapCode' value .
2535 // Only 0 or 4321 will be possible
2536 // (no oportunity to check for the formerly well known
2537 // ACR-NEMA 'Bad Big Endian' or 'Bad Little Endian'
2538 // if unsuccessfull (i.e. neither 0x0002 nor 0x0200 etc -4, 8-)
2539 // the file IS NOT ACR-NEMA nor DICOM V3
2540 // Find a trick to tell it the caller...
2542 s16 = *((uint16_t *)(deb));
2559 dbg.Verbose(0, "Document::CheckSwap:",
2560 "ACR/NEMA unfound swap info (Really hopeless !)");
2564 // Then the only info we have is the net2host one.
2574 * \brief Restore the unproperly loaded values i.e. the group, the element
2575 * and the dictionary entry depending on them.
2577 void Document::SwitchSwapToBigEndian()
2579 dbg.Verbose(1, "Document::SwitchSwapToBigEndian",
2580 "Switching to BigEndian mode.");
2581 if ( SwapCode == 0 )
2585 else if ( SwapCode == 4321 )
2589 else if ( SwapCode == 3412 )
2593 else if ( SwapCode == 2143 )
2600 * \brief during parsing, Header Elements too long are not loaded in memory
2603 void Document::SetMaxSizeLoadEntry(long newSize)
2609 if ((uint32_t)newSize >= (uint32_t)0xffffffff )
2611 MaxSizeLoadEntry = 0xffffffff;
2614 MaxSizeLoadEntry = newSize;
2619 * \brief Header Elements too long will not be printed
2620 * \todo See comments of \ref Document::MAX_SIZE_PRINT_ELEMENT_VALUE
2623 void Document::SetMaxSizePrintEntry(long newSize)
2625 //DOH !! This is exactly SetMaxSizeLoadEntry FIXME FIXME
2630 if ((uint32_t)newSize >= (uint32_t)0xffffffff )
2632 MaxSizePrintEntry = 0xffffffff;
2635 MaxSizePrintEntry = newSize;
2641 * \brief Handle broken private tag from Philips NTSCAN
2642 * where the endianess is being switch to BigEndian for no
2646 void Document::HandleBrokenEndian(uint16_t group, uint16_t elem)
2648 // Endian reversion. Some files contain groups of tags with reversed endianess.
2649 static int reversedEndian = 0;
2650 // try to fix endian switching in the middle of headers
2651 if ((group == 0xfeff) && (elem == 0x00e0))
2653 // start endian swap mark for group found
2655 SwitchSwapToBigEndian();
2660 else if ((group == 0xfffe) && (elem == 0xe00d) && reversedEndian)
2662 // end of reversed endian group
2664 SwitchSwapToBigEndian();
2670 * \brief Read the next tag but WITHOUT loading it's value
2671 * (read the 'Group Number', the 'Element Number',
2672 * gets the Dict Entry
2673 * gets the VR, gets the length, gets the offset value)
2674 * @return On succes the newly created DocEntry, NULL on failure.
2676 DocEntry* Document::ReadNextDocEntry()
2683 group = ReadInt16();
2686 catch ( FormatError e )
2688 // We reached the EOF (or an error occured) therefore
2689 // header parsing has to be considered as finished.
2694 HandleBrokenEndian(group, elem);
2695 DocEntry *newEntry = NewDocEntryByNumber(group, elem);
2696 FindDocEntryVR(newEntry);
2700 FindDocEntryLength(newEntry);
2702 catch ( FormatError e )
2710 newEntry->SetOffset(Fp->tellg());
2717 * \brief Generate a free TagKey i.e. a TagKey that is not present
2718 * in the TagHt dictionary.
2719 * @param group The generated tag must belong to this group.
2720 * @return The element of tag with given group which is fee.
2722 uint32_t Document::GenerateFreeTagKeyInGroup(uint16_t group)
2724 for (uint32_t elem = 0; elem < UINT32_MAX; elem++)
2726 TagKey key = DictEntry::TranslateToKey(group, elem);
2727 if (TagHT.count(key) == 0)
2736 * \brief Assuming the internal file pointer \ref Document::Fp
2737 * is placed at the beginning of a tag check whether this
2738 * tag is (TestGroup, TestElement).
2739 * \warning On success the internal file pointer \ref Document::Fp
2740 * is modified to point after the tag.
2741 * On failure (i.e. when the tag wasn't the expected tag
2742 * (TestGroup, TestElement) the internal file pointer
2743 * \ref Document::Fp is restored to it's original position.
2744 * @param testGroup The expected group of the tag.
2745 * @param testElement The expected Element of the tag.
2746 * @return True on success, false otherwise.
2748 bool Document::ReadTag(uint16_t testGroup, uint16_t testElement)
2750 long positionOnEntry = Fp->tellg();
2751 long currentPosition = Fp->tellg(); // On debugging purposes
2753 //// Read the Item Tag group and element, and make
2754 // sure they are what we expected:
2755 uint16_t itemTagGroup;
2756 uint16_t itemTagElement;
2759 itemTagGroup = ReadInt16();
2760 itemTagElement = ReadInt16();
2762 catch ( FormatError e )
2764 //std::cerr << e << std::endl;
2767 if ( itemTagGroup != testGroup || itemTagElement != testElement )
2769 std::ostringstream s;
2770 s << " We should have found tag (";
2771 s << std::hex << testGroup << "," << testElement << ")" << std::endl;
2772 s << " but instead we encountered tag (";
2773 s << std::hex << itemTagGroup << "," << itemTagElement << ")"
2775 s << " at address: " << (unsigned)currentPosition << std::endl;
2776 dbg.Verbose(0, "Document::ReadItemTagLength: wrong Item Tag found:");
2777 dbg.Verbose(0, s.str().c_str());
2778 Fp->seekg(positionOnEntry, std::ios_base::beg);
2786 * \brief Assuming the internal file pointer \ref Document::Fp
2787 * is placed at the beginning of a tag (TestGroup, TestElement),
2788 * read the length associated to the Tag.
2789 * \warning On success the internal file pointer \ref Document::Fp
2790 * is modified to point after the tag and it's length.
2791 * On failure (i.e. when the tag wasn't the expected tag
2792 * (TestGroup, TestElement) the internal file pointer
2793 * \ref Document::Fp is restored to it's original position.
2794 * @param testGroup The expected group of the tag.
2795 * @param testElement The expected Element of the tag.
2796 * @return On success returns the length associated to the tag. On failure
2799 uint32_t Document::ReadTagLength(uint16_t testGroup, uint16_t testElement)
2801 long positionOnEntry = Fp->tellg();
2802 (void)positionOnEntry;
2804 if ( !ReadTag(testGroup, testElement) )
2809 //// Then read the associated Item Length
2810 long currentPosition = Fp->tellg();
2811 uint32_t itemLength = ReadInt32();
2813 std::ostringstream s;
2814 s << "Basic Item Length is: "
2815 << itemLength << std::endl;
2816 s << " at address: " << (unsigned)currentPosition << std::endl;
2817 dbg.Verbose(0, "Document::ReadItemTagLength: ", s.str().c_str());
2823 * \brief When parsing the Pixel Data of an encapsulated file, read
2824 * the basic offset table (when present, and BTW dump it).
2826 void Document::ReadAndSkipEncapsulatedBasicOffsetTable()
2828 //// Read the Basic Offset Table Item Tag length...
2829 uint32_t itemLength = ReadTagLength(0xfffe, 0xe000);
2831 // When present, read the basic offset table itself.
2832 // Notes: - since the presence of this basic offset table is optional
2833 // we can't rely on it for the implementation, and we will simply
2834 // trash it's content (when present).
2835 // - still, when present, we could add some further checks on the
2836 // lengths, but we won't bother with such fuses for the time being.
2837 if ( itemLength != 0 )
2839 char* basicOffsetTableItemValue = new char[itemLength + 1];
2840 Fp->read(basicOffsetTableItemValue, itemLength);
2843 for (unsigned int i=0; i < itemLength; i += 4 )
2845 uint32_t individualLength = str2num( &basicOffsetTableItemValue[i],
2847 std::ostringstream s;
2848 s << " Read one length: ";
2849 s << std::hex << individualLength << std::endl;
2851 "Document::ReadAndSkipEncapsulatedBasicOffsetTable: ",
2856 delete[] basicOffsetTableItemValue;
2861 * \brief Parse pixel data from disk of [multi-]fragment RLE encoding.
2862 * Compute the RLE extra information and store it in \ref RLEInfo
2863 * for later pixel retrieval usage.
2865 void Document::ComputeRLEInfo()
2867 TransferSyntaxType ts = GetTransferSyntax();
2868 if ( ts != RLELossless )
2873 // Encoded pixel data: for the time being we are only concerned with
2874 // Jpeg or RLE Pixel data encodings.
2875 // As stated in PS 3.5-2003, section 8.2 p44:
2876 // "If sent in Encapsulated Format (i.e. other than the Native Format) the
2877 // value representation OB is used".
2878 // Hence we expect an OB value representation. Concerning OB VR,
2879 // the section PS 3.5-2003, section A.4.c p 58-59, states:
2880 // "For the Value Representations OB and OW, the encoding shall meet the
2881 // following specifications depending on the Data element tag:"
2883 // - the first item in the sequence of items before the encoded pixel
2884 // data stream shall be basic offset table item. The basic offset table
2885 // item value, however, is not required to be present"
2887 ReadAndSkipEncapsulatedBasicOffsetTable();
2889 // Encapsulated RLE Compressed Images (see PS 3.5-2003, Annex G)
2890 // Loop on the individual frame[s] and store the information
2891 // on the RLE fragments in a RLEFramesInfo.
2892 // Note: - when only a single frame is present, this is a
2894 // - when more than one frame are present, then we are in
2895 // the case of a multi-frame image.
2897 while ( (frameLength = ReadTagLength(0xfffe, 0xe000)) )
2899 // Parse the RLE Header and store the corresponding RLE Segment
2900 // Offset Table information on fragments of this current Frame.
2901 // Note that the fragment pixels themselves are not loaded
2902 // (but just skipped).
2903 long frameOffset = Fp->tellg();
2905 uint32_t nbRleSegments = ReadInt32();
2906 if ( nbRleSegments > 16 )
2908 // There should be at most 15 segments (refer to RLEFrame class)
2909 dbg.Verbose(0, "Document::ComputeRLEInfo: too many segments.");
2912 uint32_t rleSegmentOffsetTable[15];
2913 for( int k = 1; k <= 15; k++ )
2915 rleSegmentOffsetTable[k] = ReadInt32();
2918 // Deduce from both the RLE Header and the frameLength the
2919 // fragment length, and again store this info in a
2921 long rleSegmentLength[15];
2922 // skipping (not reading) RLE Segments
2923 if ( nbRleSegments > 1)
2925 for(unsigned int k = 1; k <= nbRleSegments-1; k++)
2927 rleSegmentLength[k] = rleSegmentOffsetTable[k+1]
2928 - rleSegmentOffsetTable[k];
2929 SkipBytes(rleSegmentLength[k]);
2933 rleSegmentLength[nbRleSegments] = frameLength
2934 - rleSegmentOffsetTable[nbRleSegments];
2935 SkipBytes(rleSegmentLength[nbRleSegments]);
2937 // Store the collected info
2938 RLEFrame* newFrameInfo = new RLEFrame;
2939 newFrameInfo->NumberFragments = nbRleSegments;
2940 for( unsigned int uk = 1; uk <= nbRleSegments; uk++ )
2942 newFrameInfo->Offset[uk] = frameOffset + rleSegmentOffsetTable[uk];
2943 newFrameInfo->Length[uk] = rleSegmentLength[uk];
2945 RLEInfo->Frames.push_back( newFrameInfo );
2948 // Make sure that at the end of the item we encounter a 'Sequence
2950 if ( !ReadTag(0xfffe, 0xe0dd) )
2952 dbg.Verbose(0, "Document::ComputeRLEInfo: no sequence delimiter ");
2953 dbg.Verbose(0, " item at end of RLE item sequence");
2958 * \brief Parse pixel data from disk of [multi-]fragment Jpeg encoding.
2959 * Compute the jpeg extra information (fragment[s] offset[s] and
2960 * length) and store it[them] in \ref JPEGInfo for later pixel
2963 void Document::ComputeJPEGFragmentInfo()
2965 // If you need to, look for comments of ComputeRLEInfo().
2971 ReadAndSkipEncapsulatedBasicOffsetTable();
2973 // Loop on the fragments[s] and store the parsed information in a
2975 long fragmentLength;
2976 while ( (fragmentLength = ReadTagLength(0xfffe, 0xe000)) )
2978 long fragmentOffset = Fp->tellg();
2980 // Store the collected info
2981 JPEGFragment* newFragment = new JPEGFragment;
2982 newFragment->Offset = fragmentOffset;
2983 newFragment->Length = fragmentLength;
2984 JPEGInfo->Fragments.push_back( newFragment );
2986 SkipBytes( fragmentLength );
2989 // Make sure that at the end of the item we encounter a 'Sequence
2991 if ( !ReadTag(0xfffe, 0xe0dd) )
2993 dbg.Verbose(0, "Document::ComputeRLEInfo: no sequence delimiter ");
2994 dbg.Verbose(0, " item at end of JPEG item sequence");
2999 * \brief Walk recursively the given \ref DocEntrySet, and feed
3000 * the given hash table (\ref TagDocEntryHT) with all the
3001 * \ref DocEntry (Dicom entries) encountered.
3002 * This method does the job for \ref BuildFlatHashTable.
3003 * @param builtHT Where to collect all the \ref DocEntry encountered
3004 * when recursively walking the given set.
3005 * @param set The structure to be traversed (recursively).
3007 void Document::BuildFlatHashTableRecurse( TagDocEntryHT& builtHT,
3010 if (ElementSet* elementSet = dynamic_cast< ElementSet* > ( set ) )
3012 TagDocEntryHT const & currentHT = elementSet->GetTagHT();
3013 for( TagDocEntryHT::const_iterator i = currentHT.begin();
3014 i != currentHT.end();
3017 DocEntry* entry = i->second;
3018 if ( SeqEntry* seqEntry = dynamic_cast<SeqEntry*>(entry) )
3020 const ListSQItem& items = seqEntry->GetSQItems();
3021 for( ListSQItem::const_iterator item = items.begin();
3022 item != items.end();
3025 BuildFlatHashTableRecurse( builtHT, *item );
3029 builtHT[entry->GetKey()] = entry;
3034 if (SQItem* SQItemSet = dynamic_cast< SQItem* > ( set ) )
3036 const ListDocEntry& currentList = SQItemSet->GetDocEntries();
3037 for (ListDocEntry::const_iterator i = currentList.begin();
3038 i != currentList.end();
3041 DocEntry* entry = *i;
3042 if ( SeqEntry* seqEntry = dynamic_cast<SeqEntry*>(entry) )
3044 const ListSQItem& items = seqEntry->GetSQItems();
3045 for( ListSQItem::const_iterator item = items.begin();
3046 item != items.end();
3049 BuildFlatHashTableRecurse( builtHT, *item );
3053 builtHT[entry->GetKey()] = entry;
3060 * \brief Build a \ref TagDocEntryHT (i.e. a std::map<>) from the current
3063 * The structure used by a Document (through \ref ElementSet),
3064 * in order to old the parsed entries of a Dicom header, is a recursive
3065 * one. This is due to the fact that the sequences (when present)
3066 * can be nested. Additionaly, the sequence items (represented in
3067 * gdcm as \ref SQItem) add an extra complexity to the data
3068 * structure. Hence, a gdcm user whishing to visit all the entries of
3069 * a Dicom header will need to dig in the gdcm internals (which
3070 * implies exposing all the internal data structures to the API).
3071 * In order to avoid this burden to the user, \ref BuildFlatHashTable
3072 * recursively builds a temporary hash table, which holds all the
3073 * Dicom entries in a flat structure (a \ref TagDocEntryHT i.e. a
3075 * \warning Of course there is NO integrity constrain between the
3076 * returned \ref TagDocEntryHT and the \ref ElementSet used
3077 * to build it. Hence if the underlying \ref ElementSet is
3078 * altered, then it is the caller responsability to invoke
3079 * \ref BuildFlatHashTable again...
3080 * @return The flat std::map<> we juste build.
3082 TagDocEntryHT* Document::BuildFlatHashTable()
3084 TagDocEntryHT* FlatHT = new TagDocEntryHT;
3085 BuildFlatHashTableRecurse( *FlatHT, this );
3092 * \brief Compares two documents, according to \ref DicomDir rules
3093 * \warning Does NOT work with ACR-NEMA files
3094 * \todo Find a trick to solve the pb (use RET fields ?)
3096 * @return true if 'smaller'
3098 bool Document::operator<(Document &document)
3101 std::string s1 = GetEntryByNumber(0x0010,0x0010);
3102 std::string s2 = document.GetEntryByNumber(0x0010,0x0010);
3114 s1 = GetEntryByNumber(0x0010,0x0020);
3115 s2 = document.GetEntryByNumber(0x0010,0x0020);
3126 // Study Instance UID
3127 s1 = GetEntryByNumber(0x0020,0x000d);
3128 s2 = document.GetEntryByNumber(0x0020,0x000d);
3139 // Serie Instance UID
3140 s1 = GetEntryByNumber(0x0020,0x000e);
3141 s2 = document.GetEntryByNumber(0x0020,0x000e);
3156 } // end namespace gdcm
3158 //-----------------------------------------------------------------------------