Program: gdcm
Module: $RCSfile: gdcmUtil.cxx,v $
Language: C++
- Date: $Date: 2005/02/02 15:07:41 $
- Version: $Revision: 1.130 $
+ Date: $Date: 2005/02/14 10:43:53 $
+ Version: $Revision: 1.140 $
Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de
l'Image). All rights reserved. See Doc/License.txt or
/**
* \brief Provide a better 'c++' approach for sprintf
* For example c code is:
- * sprintf(trash, "%04x|%04x", group , elem);
+ * char result[200]; // hope 200 is enough
+ * sprintf(result, "%04x|%04x", group , elem);
*
* c++ code is
* std::ostringstream buf;
* buf.str();
*
* gdcm style code is
- * Format("%04x|%04x", group , elem);
+ * string result;
+ * result = gdcm::Util::Format("%04x|%04x", group , elem);
*/
std::string Util::Format(const char *format, ...)
{
/**
* \brief Because not available in C++ (?)
+ * @param str string to check
+ * @param tokens std::vector to receive the tokenized substrings
+ * @param delimiters string containing the character delimitors
+
*/
void Util::Tokenize (const std::string &str,
std::vector<std::string> &tokens,
/**
* \brief Because not available in C++ (?)
* Counts the number of occurences of a substring within a string
+ * @param str string to check
+ * @param subStr substring to count
*/
int Util::CountSubstring (const std::string &str,
const std::string &subStr)
{
- int count = 0; // counts how many times it appears
- std::string::size_type x = 0; // The index position in the string
+ int count = 0; // counts how many times it appears
+ std::string::size_type x = 0; // The index position in the string
do
{
- x = str.find(subStr,x); // Find the substring
- if (x != std::string::npos) // If present
+ x = str.find(subStr,x); // Find the substring
+ if (x != std::string::npos) // If present
{
- count++; // increase the count
- x += subStr.length(); // Skip this word
+ count++; // increase the count
+ x += subStr.length(); // Skip this word
}
}
- while (x != std::string::npos); // Carry on until not present
+ while (x != std::string::npos);// Carry on until not present
return count;
}
*/
bool Util::IsCurrentProcessorBigEndian()
{
-#ifdef GDCM_WORDS_BIGENDIAN
+#if defined(GDCM_WORDS_BIGENDIAN)
return true;
#else
return false;
OUT AsnObjectIdentifier * supportedView);
#endif //_WIN32
-
+/// \brief gets current M.A.C adress (for internal use only)
int GetMacAddrSys ( unsigned char *addr )
{
#ifdef _WIN32
HANDLE PollForTrapEvent;
AsnObjectIdentifier SupportedView;
- UINT OID_ifEntryType[] = { 1, 3, 6, 1, 2, 1, 2, 2, 1, 3 };
- UINT OID_ifEntryNum[] = { 1, 3, 6, 1, 2, 1, 2, 1 };
+ UINT OID_ifEntryType[] = { 1, 3, 6, 1, 2, 1, 2, 2, 1, 3 };
+ UINT OID_ifEntryNum[] = { 1, 3, 6, 1, 2, 1, 2, 1 };
UINT OID_ipMACEntAddr[] = { 1, 3, 6, 1, 2, 1, 2, 2, 1, 6 };
AsnObjectIdentifier MIB_ifMACEntAddr = {
sizeof(OID_ipMACEntAddr) / sizeof(UINT), OID_ipMACEntAddr };
}
/**
- * Mini function to return the last digit from a number express in base 256
- * pre condition data contain an array of 6 unsigned char
- * post condition carry contain the last digit
+ * \brief Mini function to return the last digit from a number express in base 256
+ * pre condition data contain an array of 6 unsigned char
+ * post condition carry contain the last digit
*/
inline int getlastdigit(unsigned char *data)
{
{
res = getlastdigit(addr);
sres.insert(sres.begin(), '0' + res);
- zero = (addr[0] == 0) && (addr[1] == 0) && (addr[2] == 0) && (addr[3] == 0) && (addr[4] == 0) && (addr[5] == 0);
+ zero = (addr[0] == 0) && (addr[1] == 0) && (addr[2] == 0)
+ && (addr[3] == 0) && (addr[4] == 0) && (addr[5] == 0);
}
return sres;
}
else
{
- gdcmVerboseMacro("Problem in finding the MAC Address");
+ gdcmWarningMacro("Problem in finding the MAC Address");
return "";
}
}
}
//-------------------------------------------------------------------------
-/**
- * \brief
- * @param os ostream to write to
- * @param val val
- */
-template <class T>
-std::ostream &binary_write(std::ostream &os, const T &val)
-{
- return os.write(reinterpret_cast<const char*>(&val), sizeof val);
-}
-
/**
* \brief binary_write binary_write
* @param os ostream to write to
*/
std::ostream &binary_write(std::ostream &os, const uint16_t &val)
{
-#ifdef GDCM_WORDS_BIGENDIAN
+#if defined(GDCM_WORDS_BIGENDIAN) || defined(GDCM_FORCE_BIGENDIAN_EMULATION)
uint16_t swap;
- swap = ((( val << 8 ) & 0x0ff00 ) | (( val >> 8 ) & 0x00ff ) );
+ //swap = ((( val << 8 ) & 0xff00 ) | (( val >> 8 ) & 0x00ff ) );
+ //save CPU time
+ swap = ( val << 8 | val >> 8 );
+
return os.write(reinterpret_cast<const char*>(&swap), 2);
#else
return os.write(reinterpret_cast<const char*>(&val), 2);
*/
std::ostream &binary_write(std::ostream &os, const uint32_t &val)
{
-#ifdef GDCM_WORDS_BIGENDIAN
+#if defined(GDCM_WORDS_BIGENDIAN) || defined(GDCM_FORCE_BIGENDIAN_EMULATION)
uint32_t swap;
- swap = ( ((val<<24) & 0xff000000) | ((val<<8) & 0x00ff0000) |
- ((val>>8) & 0x0000ff00) | ((val>>24) & 0x000000ff) );
+// swap = ( ((val<<24) & 0xff000000) | ((val<<8) & 0x00ff0000) |
+// ((val>>8) & 0x0000ff00) | ((val>>24) & 0x000000ff) );
+// save CPU time
+ swap = ( (val<<24) | ((val<<8) & 0x00ff0000) |
+ ((val>>8) & 0x0000ff00) | (val>>24) );
return os.write(reinterpret_cast<const char*>(&swap), 4);
#else
return os.write(reinterpret_cast<const char*>(&val), 4);
return os.write(val.c_str(), val.size());
}
+/**
+ * \brief binary_write binary_write
+ * @param os ostream to write to
+ * @param val val
+ */
+std::ostream &binary_write(std::ostream &os, const uint8_t *val, size_t len)
+{
+ // We are writting sizeof(char) thus no need to swap bytes
+ return os.write(reinterpret_cast<const char*>(val), len);
+}
+
+/**
+ * \brief binary_write binary_write
+ * @param os ostream to write to
+ * @param val val
+ */
+std::ostream &binary_write(std::ostream &os, const uint16_t *val, size_t len)
+{
+// This is tricky since we are writting two bytes buffer.
+// Be carefull with little endian vs big endian.
+// Also this other trick is to allocate a small (efficient) buffer that store
+// intermediate result before writting it.
+#if defined(GDCM_WORDS_BIGENDIAN) || defined(GDCM_FORCE_BIGENDIAN_EMULATION)
+ const int BUFFER_SIZE = 4096;
+ uint16_t *binArea16 = (uint16_t*)val;
+ uint16_t *buffer = new uint16_t[BUFFER_SIZE/2];
+ uint16_t *pbuffer = buffer;
+
+ // how many BUFFER_SIZE long pieces in binArea ?
+ int nbPieces = len/BUFFER_SIZE; //(16 bits = 2 Bytes)
+ int remainingSize = len%BUFFER_SIZE;
+
+ for (int j=0;j<nbPieces;j++)
+ {
+
+ for (int i = 0; i < BUFFER_SIZE/2; i++)
+ {
+ //uint16_t val16 = binArea16[i];
+ //buffer[i] = ((( val16 << 8 ) & 0xff00 ) | (( val16 >> 8 ) & 0x00ff ) );
+ // save CPU time :
+ // 1) Save 1 affectation and 2 AND operations
+ // buffer[i] = (binArea16[i] >> 8) | (binArea16[i] << 8);
+ // 2) Replace * operations by + operations using pointers
+ *pbuffer = *binArea16 >> 8 | *binArea16 >> 8;
+ pbuffer++;
+ binArea16++;
+ }
+ os.write ( (char*)buffer, BUFFER_SIZE );
+ binArea16 += BUFFER_SIZE/2;
+ }
+ if ( remainingSize > 0)
+ {
+ for (int i = 0; i < remainingSize/2; i++)
+ {
+ //uint16_t val16 = binArea16[i];
+ //buffer[i] = ((( val16 << 8 ) & 0xff00 ) | (( val16 >> 8 ) & 0x00ff) );
+ *pbuffer = *binArea16 >> 8 | *binArea16 >> 8;
+ pbuffer++;
+ binArea16++;
+ }
+ os.write ( (char*)buffer, remainingSize );
+ }
+ delete[] buffer;
+ return os;
+#else
+ return os.write(reinterpret_cast<const char*>(val), len);
+#endif
+}
+
//-------------------------------------------------------------------------
// Protected