Changeset 16546 for trunk/Mars/mcore/checksum.h

Timestamp:

06/01/13 13:38:04 (11 years ago)

Author:

tbretz

Message:

Improved performance of checksum calculation by partly unrolling the loop (avoiding modulo operation, which avoids the integert and an improved byte-swap).

File:

• trunk/Mars/mcore/checksum.h (modified) (2 diffs)

trunk/Mars/mcore/checksum.h

@@ -1 +1 @@
 #ifndef MARS_checksum
 #define MARS_checksum
+
+#include <arpa/inet.h>
 
 namespace std
@@ -65 +67 @@
         }
 
-        const unsigned short *sbuf = reinterpret_cast<const unsigned short *>(buf);
+        const uint32_t *sbuf = reinterpret_cast<const uint32_t*>(buf);
 
         uint32_t *hilo  = reinterpret_cast<uint32_t*>(&buffer);
 
+        /*
         for (size_t i = 0; i < len/2; i++)
         {
             //swap the bytes of the 32 bits value. but...
             //the hi and lo values are stored in fits-like order. do not swap them
-            hilo[i%2] += (sbuf[i]&0xff00)>>8 | (sbuf[i]&0x00ff)<<8;
-        }
+            hilo[i%2] += ntohs(sbuf[i]); //(sbuf[i]&0xff00)>>8 | (sbuf[i]&0x00ff)<<8;
+        }*/
+
+        // This is about as twice as fast as the loop above
+        // ntohs is CPU optimized, hilo[n] doesn't need to be computed
+        const uint32_t *end = sbuf + len/2;
+        while (1)
+        {
+            hilo[0] += ntohs(*sbuf++);
+            if (sbuf==end)
+                break;
+
+            hilo[1] += ntohs(*sbuf++);
+            if (sbuf==end)
+                break;
+        }
+
         HandleCarryBits();