ClickHouse/dbms/include/DB/Interpreters/AggregationCommon.h

126 lines
3.2 KiB
C
Raw Normal View History

2012-08-23 23:49:28 +00:00
#pragma once
#include <city.h>
2012-08-23 20:22:44 +00:00
#include <openssl/md5.h>
#include <DB/Common/SipHash.h>
2012-08-23 23:49:28 +00:00
#include <DB/Core/Row.h>
#include <DB/Core/StringRef.h>
#include <DB/Columns/IColumn.h>
#include <DB/Interpreters/HashMap.h>
2012-08-23 20:22:44 +00:00
namespace DB
{
2012-08-23 23:49:28 +00:00
/// Для агрегации по SipHash.
2012-08-23 23:49:28 +00:00
struct UInt128
{
UInt64 first;
UInt64 second;
bool operator== (const UInt128 rhs) const { return first == rhs.first && second == rhs.second; }
bool operator!= (const UInt128 rhs) const { return first != rhs.first || second != rhs.second; }
};
struct UInt128Hash
{
default_hash<UInt64> hash64;
size_t operator()(UInt128 x) const { return hash64(x.first ^ 0xB15652B8790A0D36ULL) ^ hash64(x.second); }
};
struct UInt128ZeroTraits
{
static inline bool check(UInt128 x) { return x.first == 0 && x.second == 0; }
static inline void set(UInt128 & x) { x.first = 0; x.second = 0; }
};
/// Немного быстрее стандартного
struct StringHash
{
size_t operator()(const String & x) const { return CityHash64(x.data(), x.size()); }
};
2012-08-23 20:22:44 +00:00
/** Преобразование значения в 64 бита. Для чисел - однозначное, для строк - некриптографический хэш. */
class FieldVisitorToUInt64 : public StaticVisitor<UInt64>
2012-08-23 20:22:44 +00:00
{
public:
FieldVisitorToUInt64() {}
UInt64 operator() (const Null & x) const { return 0; }
UInt64 operator() (const UInt64 & x) const { return x; }
UInt64 operator() (const Int64 & x) const { return x; }
UInt64 operator() (const Float64 & x) const
{
UInt64 res = 0;
memcpy(reinterpret_cast<char *>(&res), reinterpret_cast<const char *>(&x), sizeof(x));
return res;
}
UInt64 operator() (const String & x) const
{
2012-10-07 00:23:36 +00:00
return CityHash64(x.data(), x.size());
2012-08-23 20:22:44 +00:00
}
UInt64 operator() (const Array & x) const
{
throw Exception("Cannot aggregate by array", ErrorCodes::ILLEGAL_KEY_OF_AGGREGATION);
}
UInt64 operator() (const SharedPtr<IAggregateFunction> & x) const
{
throw Exception("Cannot aggregate by state of aggregate function", ErrorCodes::ILLEGAL_KEY_OF_AGGREGATION);
}
};
2012-08-23 23:49:28 +00:00
typedef std::vector<size_t> Sizes;
/// Записать набор ключей в UInt128. Либо уложив их подряд, либо вычислив SipHash.
2012-08-23 23:49:28 +00:00
inline UInt128 __attribute__((__always_inline__)) pack128(
size_t i, bool keys_fit_128_bits, size_t keys_size, Row & key, const Columns & key_columns, const Sizes & key_sizes)
{
union
{
UInt128 key_hash;
char bytes[16];
2012-08-23 23:49:28 +00:00
} key_hash_union;
/// Если все ключи числовые и помещаются в 128 бит
if (keys_fit_128_bits)
{
memset(key_hash_union.bytes, 0, 16);
size_t offset = 0;
for (size_t j = 0; j < keys_size; ++j)
{
key[j] = (*key_columns[j])[i];
StringRef key_data = key_columns[j]->getDataAt(i);
memcpy(key_hash_union.bytes + offset, key_data.data, key_sizes[j]);
2012-08-23 23:49:28 +00:00
offset += key_sizes[j];
}
}
else /// Иначе используем SipHash.
2012-08-23 23:49:28 +00:00
{
SipHash hash;
2012-08-23 23:49:28 +00:00
for (size_t j = 0; j < keys_size; ++j)
{
key[j] = (*key_columns[j])[i];
StringRef key_data = key_columns[j]->getDataAt(i);
hash.update(key_data.data, key_data.size);
2012-08-23 23:49:28 +00:00
}
hash.final(key_hash_union.bytes);
2012-08-23 23:49:28 +00:00
}
return key_hash_union.key_hash;
}
2012-08-23 20:22:44 +00:00
}