Welcome To Our Shell

Mister Spy & Souheyl Bypass Shell

Current Path : /usr/include/gdcm-3.0/

Linux ift1.ift-informatik.de 5.4.0-216-generic #236-Ubuntu SMP Fri Apr 11 19:53:21 UTC 2025 x86_64
Upload File :
Current File : //usr/include/gdcm-3.0/gdcmByteSwap.txx

/*=========================================================================

  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 GDCMBYTESWAP_TXX
#define GDCMBYTESWAP_TXX

#include "gdcmByteSwap.h"
#include <iostream>

#include <stdlib.h> // abort

namespace gdcm
{

/*
  template (class T)
{
void bswap(inout T i)
{
byte* p = cast(byte*)&i;
for (int b = 0; b < T.size/2; ++b)
instance swap(byte).swap(p[b], p[T.size-1-b]);
}
}
*/


// Machine definitions
#ifdef GDCM_WORDS_BIGENDIAN
template <class T>
bool ByteSwap<T>::SystemIsBigEndian() { return true; }
template <class T>
bool ByteSwap<T>::SystemIsLittleEndian() { return false; }
#else
template <class T>
bool ByteSwap<T>::SystemIsBigEndian() { return false; }
template <class T>
bool ByteSwap<T>::SystemIsLittleEndian() { return true; }
#endif

template <class T>
void ByteSwap<T>::Swap(T &p)
{
#ifdef GDCM_WORDS_BIGENDIAN
    ByteSwap<T>::SwapFromSwapCodeIntoSystem(p, SwapCode::LittleEndian);
#else
    ByteSwap<T>::SwapFromSwapCodeIntoSystem(p, SwapCode::BigEndian);
#endif
}

// Swaps the bytes so they agree with the processor order
template <class T>
void ByteSwap<T>::SwapFromSwapCodeIntoSystem(T &a, SwapCode const &swapcode)
{
  //std::cerr << "sizeof(T)= " << sizeof(T) << " " << (int)a << std::endl;
  switch(sizeof(T))
    {
  case 1:
    break;
  case 2:
    Swap4(a, swapcode);
    break;
  case 4:
    Swap8(a, swapcode);
    break;
  default:
    std::cerr << "Impossible" << std::endl;
    abort();
    }
}

template <class T>
void ByteSwap<T>::SwapRange(T *p, unsigned int num)
{
  for(unsigned int i=0; i<num; i++)
    {
    ByteSwap<T>::Swap(p[i]);
    }
}

template <class T>
void ByteSwap<T>::SwapRangeFromSwapCodeIntoSystem(T *p, SwapCode const &sc,
  std::streamoff num)
{
  for( std::streamoff i=0; i<num; i++)
    {
    ByteSwap<T>::SwapFromSwapCodeIntoSystem(p[i], sc);
    }
}

// Private:
//

template<class T>
void Swap4(T &a, SwapCode const &swapcode)
{
#ifndef GDCM_WORDS_BIGENDIAN
  if ( swapcode == 4321 || swapcode == 2143 )
    a = (T)(( a << 8 ) | ( a >> 8 ));
#else
  if ( swapcode == 1234 || swapcode == 3412 )
    a = ( a << 8 ) | ( a >> 8 );
  // On big endian as long as the SwapCode is Unknown let's pretend we were
  // on a LittleEndian system (might introduce overhead on those system).
  else if ( swapcode == SwapCode::Unknown )
    a = ( a << 8 ) | ( a >> 8 );
#endif
}

//note: according to http://www.parashift.com/c++-faq-lite/templates.html#faq-35.8
//the inlining of the template class means that the specialization doesn't cause linker errors
template<class T>
inline void Swap8(T &a, SwapCode const &swapcode)
{
  switch (swapcode)
    {
  case SwapCode::Unknown:
#ifdef GDCM_WORDS_BIGENDIAN
    a= (( a<<24) | ((a<<8)  & 0x00ff0000) | ((a>>8) & 0x0000ff00) | (a>>24) );
#endif
    break;
  case 1234 :
#ifdef GDCM_WORDS_BIGENDIAN
    a= (( a<<24) | ((a<<8)  & 0x00ff0000) | ((a>>8) & 0x0000ff00) | (a>>24) );
#endif
    break;
  case 4321 :
#ifndef GDCM_WORDS_BIGENDIAN
    a= (( a<<24) | ((a<<8)  & 0x00ff0000) | ((a>>8) & 0x0000ff00) | (a>>24) );
#endif
    break;
  case 3412 :
    a= ((a<<16) | (a>>16)  );
    break;
  case 2143 :
    a= (((a<< 8) & 0xff00ff00) | ((a>>8) & 0x00ff00ff) );
    break;
  default :
    std::cerr << "Unexpected swap code:" << swapcode;
    }
}

template <>
inline void Swap8<uint16_t>(uint16_t &a, SwapCode const &swapcode)
{
  switch (swapcode)
    {
  case SwapCode::Unknown:
#ifdef GDCM_WORDS_BIGENDIAN
    a= (( a<<24) | ((a<<8)  & 0x00ff0000) | ((a>>8) & 0x0000ff00) | (a>>24) );
#endif
    break;
  case 1234 :
#ifdef GDCM_WORDS_BIGENDIAN
    a= (( a<<24) | ((a<<8)  & 0x00ff0000) | ((a>>8) & 0x0000ff00) | (a>>24) );
#endif
    break;
  case 4321 :
#ifndef GDCM_WORDS_BIGENDIAN
//    probably not really useful since the lowest 0x0000 are what's used in unsigned shorts
//    a= (( a<<24) | ((a<<8)  & 0x00ff0000) | ((a>>8) & 0x0000ff00) | (a>>24) );
#endif
    break;
  case 3412 :
    //a= ((a<<16) | (a>>16)  );//do nothing, a = a
    break;
  case 2143 :
    a= (uint16_t)(((a<< 8) & 0xff00) | ((a>>8) & 0x00ff) );
    break;
  default :
    std::cerr << "Unexpected swap code:" << swapcode;
    }
}


} // end namespace gdcm

#endif // GDCMBYTESWAP_TXX

bypass 1.0, Devloped By El Moujahidin (the source has been moved and devloped)
Email: contact@elmoujehidin.net bypass 1.0, Devloped By El Moujahidin (the source has been moved and devloped) Email: contact@elmoujehidin.net