X-Git-Url: https://git.creatis.insa-lyon.fr/pubgit/?a=blobdiff_plain;f=src%2FgdcmValidator.cxx;h=d156d02aa418d936748c58d311c53863cb2eb565;hb=72ed6f4e0e142afcbdc21965587489aeb9a18a97;hp=af42a3b65b6aa34a46af882fda36e59f8bf8a5ac;hpb=2f119e4daab0342ba672b8aa3d21b1fb6212a2bb;p=gdcm.git

diff --git a/src/gdcmValidator.cxx b/src/gdcmValidator.cxx
index af42a3b6..d156d02a 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/17 12:15:54 $
-  Version:   $Revision: 1.3 $
+  Date:      $Date: 2005/11/09 08:36:47 $
+  Version:   $Revision: 1.12 $
                                                                                 
   Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de
   l'Image). All rights reserved. See Doc/License.txt or
@@ -18,13 +18,17 @@
 
 #include "gdcmValidator.h"
 #include "gdcmElementSet.h"
-#include "gdcmBinEntry.h"
-#include "gdcmValEntry.h"
+#include "gdcmDataEntry.h"
+#include "gdcmUtil.h"
+#include <map>
 
 #include <sstream>
 
 namespace gdcm 
 {
+//-----------------------------------------------------------------------------
+typedef std::map<uint16_t, int> GroupHT;    //  Hash Table
+//-----------------------------------------------------------------------------
 
 Validator::Validator()
 {
@@ -34,54 +38,92 @@ 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 allways 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)
 {
-  // berk for now SetInput do two things at the same time
-  gdcm::DocEntry *d=input->GetFirstEntry();
+
+DocEntry *d;
+/*
+// First stage to check group length
+  GroupHT grHT;
+  d=input->GetFirstEntry();
   while(d)
   {
-    if ( gdcm::BinEntry *b = dynamic_cast<gdcm::BinEntry*>(d) )
-    {
-//      copyH->InsertBinEntry( b->GetBinArea(),b->GetLength(),
-//        b->GetGroup(),b->GetElement(),
-//        b->GetVR() );
-        (void)b;
-    }
-    else if ( gdcm::ValEntry *v = dynamic_cast<gdcm::ValEntry*>(d) )
-    {   
-      if( !CheckVM(v))
+    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
+  d=input->GetFirstEntry();
+  if (!d)
+  {
+     std::cout << "No Entry found" << std::endl;
+     return;
+  }
+  while(d)
+  { 
+    if ( DataEntry *v = dynamic_cast<DataEntry *>(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() << "] contains an illegal VM. "
+                     << "value [" << v->GetString() << "] VR :"
+                     << v->GetVR() << ", Expected VM : [" << v->GetVM() << "] " 
+                     << std::endl;
+         }
+      
+      if ( v->GetReadLength() % 2 )
       {
-        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();
   }
 }