0
0
mirror of https://github.com/mongodb/mongo.git synced 2024-12-01 09:32:32 +01:00
mongodb/util/checksum.h
dwight 6113b4cd26 change to a faster checksum (old was md5). new is less discriminating but fast.
also, now includes the JSectHeader in the checksum.
2011-02-24 13:34:42 -05:00

38 lines
1.4 KiB
C++

#pragma once
#include "../pch.h"
namespace mongo {
/** a simple, rather dumb, but very fast checksum. see perftests.cpp for unit tests. */
struct Checksum {
union {
unsigned char bytes[16];
unsigned long long words[2];
};
// if you change this you must bump dur::CurrentVersion
void gen(const void *buf, unsigned len) {
wassert( ((size_t)buf) % 8 == 0 ); // performance warning
unsigned n = len / 8 / 2;
const unsigned long long *p = (const unsigned long long *) buf;
unsigned long long a = 0;
for( unsigned i = 0; i < n; i++ ) {
a += (*p ^ i);
p++;
}
unsigned long long b = 0;
for( unsigned i = 0; i < n; i++ ) {
b += (*p ^ i);
p++;
}
unsigned long long c = 0;
for( unsigned i = n * 2 * 8; i < len; i++ ) { // 0-7 bytes left
c = (c << 8) | ((const char *)buf)[i];
}
words[0] = a ^ len;
words[1] = b ^ c;
}
bool operator==(const Checksum& rhs) const { return words[0]==rhs.words[0] && words[1]==rhs.words[1]; }
bool operator!=(const Checksum& rhs) const { return words[0]!=rhs.words[0] || words[1]!=rhs.words[1]; }
};
}