X-Git-Url: https://git.creatis.insa-lyon.fr/pubgit/?a=blobdiff_plain;f=src%2FgdcmValidator.cxx;h=ff1b532fc1d8c62ee22bb492972ef3b13f4ab806;hb=aabc92e9dcb866de68efd216d75ad197fe78aee9;hp=8d0e2ac0155a408a43005339af33c4190da4545d;hpb=3728b2f5c936e81d7ab96d576338fa7e8eb71e48;p=gdcm.git diff --git a/src/gdcmValidator.cxx b/src/gdcmValidator.cxx index 8d0e2ac0..ff1b532f 100644 --- a/src/gdcmValidator.cxx +++ b/src/gdcmValidator.cxx @@ -3,8 +3,8 @@ Program: gdcm Module: $RCSfile: gdcmValidator.cxx,v $ Language: C++ - Date: $Date: 2005/06/14 20:53:19 $ - Version: $Revision: 1.2 $ + Date: $Date: 2006/02/16 20:06:15 $ + Version: $Revision: 1.14 $ Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de l'Image). All rights reserved. See Doc/License.txt or @@ -18,71 +18,113 @@ #include "gdcmValidator.h" #include "gdcmElementSet.h" -#include "gdcmBinEntry.h" -#include "gdcmValEntry.h" +#include "gdcmDataEntry.h" +#include "gdcmUtil.h" +#include "gdcmDebug.h" // hidden way to include sstream +#include -#include namespace gdcm { - +//----------------------------------------------------------------------------- +typedef std::map GroupHT; // Hash Table +//----------------------------------------------------------------------------- +/// \brief Constructor Validator::Validator() { } - +///\brief Canonical Destructor Validator::~Validator() { } -// Function to compare the VM found while parsing d->GetValue() +// Function to compare the VM found while parsing d->GetString() // compare to the one from the dictionary -bool CheckVM(ValEntry *v) +bool CheckVM(DataEntry *entry) { - const std::string &s = v->GetValue(); - std::string::size_type n = s.find("\\"); - if (n == s.npos) // none found - { - n = 0; - } + // Don't waste time checking tags where VM is OB and OW, since we know + // it's always 1, whatever the actual length (found on disc) + + if ( entry->GetVR() == "OB" || entry->GetVR() == "OW" ) + return true; + + const std::string &s = entry->GetString(); + + unsigned int n = Util::CountSubstring( s , "\\"); + n++; // number of '\' + 1 == Value Multiplicity + std::string vmFromDict = entry->GetVM(); + if ( vmFromDict == "1-n" || vmFromDict == "2-n" || vmFromDict == "3-n" ) + return true; + unsigned int m; - std::istringstream os; - os.str( v->GetVM()); - os >> m; + std::istringstream is; + is.str( vmFromDict ); + is >> m; return n == m; } void Validator::SetInput(ElementSet *input) { + +DocEntry *d; +/* +// First stage to check group length + GroupHT grHT; + d=input->GetFirstEntry(); + while(d) + { + grHT[d->GetGroup()] = 0; + d=input->GetNextEntry(); + } + for (GroupHT::iterator it = grHT.begin(); it != grHT.end(); ++it) + { + std::cout << std::hex << it->first << std::endl; + } +*/ + // berk for now SetInput do two things at the same time - gdcm::DocEntry *d=input->GetFirstEntry(); + d=input->GetFirstEntry(); + if (!d) + { + std::cout << "No Entry found" << std::endl; + return; + } while(d) - { - if ( gdcm::BinEntry *b = dynamic_cast(d) ) + { + if ( DataEntry *v = dynamic_cast(d) ) + { + if ( v->GetVM() != gdcm::GDCM_UNKNOWN ) + if ( !CheckVM(v) ) + { + if (v->GetVM() == "FIXME" ) + std::cout << "For Tag " << v->GetKey() << " VM = [" + << v->GetVM() << "]" << std::endl; + + std::cout << "Tag (" << v->GetKey() + << ")-> [" << v->GetName() << "] VR :" << v->GetVR() + << " contains an illegal VM. Expected VM :[" + << v->GetVM() << "], value [" << v->GetString() << "]" + << std::endl; + } + + if ( v->GetReadLength() % 2 ) { -// copyH->InsertBinEntry( b->GetBinArea(),b->GetLength(), -// b->GetGroup(),b->GetElement(), -// b->GetVR() ); - (void)b; - } - else if ( gdcm::ValEntry *v = dynamic_cast(d) ) - { - if( !CheckVM(v)) - { - std::cout << "Rah this DICOM contains one wrong tag:" << - v->GetValue() << " " << - v->GetGroup() << "," << v->GetElement() << "," << - v->GetVR() << " " << v->GetVM() << " " << v->GetName() << std::endl; - } + std::cout << "Tag (" << v->GetKey() + << ")-> [" << v->GetName() << "] has an uneven length :" + << v->GetReadLength() + << " [" << v->GetString() << "] " + << std::endl; } + } else - { + { // We skip pb of SQ recursive exploration - } - d=input->GetNextEntry(); } + d=input->GetNextEntry(); + } } } // end namespace gdcm