2012-07-15 23:13:08 +00:00
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
|
|
#include <time.h>
|
|
|
|
|
|
|
|
|
|
#include <DB/DataTypes/DataTypesNumberFixed.h>
|
|
|
|
|
#include <DB/Functions/IFunction.h>
|
2014-08-17 08:28:03 +00:00
|
|
|
|
#include <DB/Common/HashTable/Hash.h>
|
2014-02-22 19:51:19 +00:00
|
|
|
|
#include <stats/IntHash.h>
|
2012-07-15 23:13:08 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
namespace DB
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
/** Функции генерации псевдослучайных чисел.
|
|
|
|
|
* Функция может быть вызвана без аргументов или с одним аргументом.
|
|
|
|
|
* Аргумент игнорируется и служит лишь для того, чтобы несколько вызовов одной функции считались разными и не склеивались.
|
2014-08-17 08:28:03 +00:00
|
|
|
|
*
|
2012-07-15 23:13:08 +00:00
|
|
|
|
* Пример:
|
|
|
|
|
* SELECT rand(), rand() - выдаст два одинаковых столбца.
|
|
|
|
|
* SELECT rand(1), rand(2) - выдаст два разных столбца.
|
|
|
|
|
*
|
|
|
|
|
* Некриптографические генераторы:
|
2014-08-17 08:28:03 +00:00
|
|
|
|
*
|
|
|
|
|
* rand - linear congruental generator 0 .. 2^32 - 1.
|
2012-07-15 23:13:08 +00:00
|
|
|
|
* rand64 - комбинирует несколько значений rand, чтобы получить значения из диапазона 0 .. 2^64 - 1.
|
|
|
|
|
*
|
|
|
|
|
* В качестве затравки используют время.
|
|
|
|
|
* Замечание: переинициализируется на каждый блок.
|
|
|
|
|
* Это значит, что таймер должен быть достаточного разрешения, чтобы выдавать разные значения на каждый блок.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
namespace detail
|
|
|
|
|
{
|
2014-08-17 08:28:03 +00:00
|
|
|
|
struct LinearCongruentialGenerator
|
|
|
|
|
{
|
|
|
|
|
/// Константы из man lrand48_r.
|
|
|
|
|
static constexpr UInt64 a = 0x5DEECE66D;
|
|
|
|
|
static constexpr UInt64 c = 0xB;
|
|
|
|
|
|
|
|
|
|
/// А эта - из head -c8 /dev/urandom | xxd -p
|
|
|
|
|
UInt64 current = 0x09826f4a081cee35ULL;
|
|
|
|
|
|
|
|
|
|
LinearCongruentialGenerator() {}
|
|
|
|
|
LinearCongruentialGenerator(UInt64 value) : current(value) {}
|
|
|
|
|
|
|
|
|
|
void seed(UInt64 value)
|
|
|
|
|
{
|
|
|
|
|
current = value;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
UInt32 next()
|
|
|
|
|
{
|
|
|
|
|
current = current * a + c;
|
|
|
|
|
return current >> 16;
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
void seed(LinearCongruentialGenerator & generator, intptr_t additional_seed)
|
2012-07-15 23:13:08 +00:00
|
|
|
|
{
|
|
|
|
|
struct timespec times;
|
2012-07-15 23:16:35 +00:00
|
|
|
|
if (clock_gettime(CLOCK_THREAD_CPUTIME_ID, ×))
|
2012-07-15 23:13:08 +00:00
|
|
|
|
throwFromErrno("Cannot clock_gettime.", ErrorCodes::CANNOT_CLOCK_GETTIME);
|
|
|
|
|
|
2014-08-17 08:28:03 +00:00
|
|
|
|
generator.seed(intHash64(times.tv_nsec ^ intHash64(additional_seed)));
|
2012-07-15 23:13:08 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct RandImpl
|
|
|
|
|
{
|
|
|
|
|
typedef UInt32 ReturnType;
|
2014-08-17 08:28:03 +00:00
|
|
|
|
|
2013-12-08 02:29:40 +00:00
|
|
|
|
static void execute(PODArray<ReturnType> & res)
|
2012-07-15 23:13:08 +00:00
|
|
|
|
{
|
2014-08-17 08:28:03 +00:00
|
|
|
|
detail::LinearCongruentialGenerator generator0;
|
|
|
|
|
detail::LinearCongruentialGenerator generator1;
|
|
|
|
|
detail::LinearCongruentialGenerator generator2;
|
|
|
|
|
detail::LinearCongruentialGenerator generator3;
|
|
|
|
|
|
|
|
|
|
detail::seed(generator0, 0xfb4121280b2ab902ULL + reinterpret_cast<intptr_t>(&res[0]));
|
|
|
|
|
detail::seed(generator1, 0x0121cf76df39c673ULL + reinterpret_cast<intptr_t>(&res[0]));
|
|
|
|
|
detail::seed(generator2, 0x17ae86e3a19a602fULL + reinterpret_cast<intptr_t>(&res[0]));
|
|
|
|
|
detail::seed(generator3, 0x8b6e16da7e06d622ULL + reinterpret_cast<intptr_t>(&res[0]));
|
|
|
|
|
|
2012-07-15 23:13:08 +00:00
|
|
|
|
size_t size = res.size();
|
2014-08-17 08:28:03 +00:00
|
|
|
|
ReturnType * pos = &res[0];
|
|
|
|
|
ReturnType * end = pos + size;
|
|
|
|
|
ReturnType * end4 = pos + size / 4 * 4;
|
|
|
|
|
|
|
|
|
|
while (pos < end4)
|
|
|
|
|
{
|
|
|
|
|
pos[0] = generator0.next();
|
|
|
|
|
pos[1] = generator1.next();
|
|
|
|
|
pos[2] = generator2.next();
|
|
|
|
|
pos[3] = generator3.next();
|
|
|
|
|
pos += 4;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
while (pos < end)
|
2012-07-15 23:13:08 +00:00
|
|
|
|
{
|
2014-08-17 08:28:03 +00:00
|
|
|
|
pos[0] = generator0.next();
|
|
|
|
|
++pos;
|
2012-07-15 23:13:08 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
struct Rand64Impl
|
|
|
|
|
{
|
|
|
|
|
typedef UInt64 ReturnType;
|
|
|
|
|
|
2013-12-08 02:29:40 +00:00
|
|
|
|
static void execute(PODArray<ReturnType> & res)
|
2012-07-15 23:13:08 +00:00
|
|
|
|
{
|
2014-08-17 08:28:03 +00:00
|
|
|
|
detail::LinearCongruentialGenerator generator0;
|
|
|
|
|
detail::LinearCongruentialGenerator generator1;
|
|
|
|
|
detail::LinearCongruentialGenerator generator2;
|
|
|
|
|
detail::LinearCongruentialGenerator generator3;
|
|
|
|
|
|
|
|
|
|
detail::seed(generator0, 0xfb4121280b2ab902ULL + reinterpret_cast<intptr_t>(&res[0]));
|
|
|
|
|
detail::seed(generator1, 0x0121cf76df39c673ULL + reinterpret_cast<intptr_t>(&res[0]));
|
|
|
|
|
detail::seed(generator2, 0x17ae86e3a19a602fULL + reinterpret_cast<intptr_t>(&res[0]));
|
|
|
|
|
detail::seed(generator3, 0x8b6e16da7e06d622ULL + reinterpret_cast<intptr_t>(&res[0]));
|
2012-07-15 23:13:08 +00:00
|
|
|
|
|
|
|
|
|
size_t size = res.size();
|
2014-08-17 08:28:03 +00:00
|
|
|
|
ReturnType * pos = &res[0];
|
|
|
|
|
ReturnType * end = pos + size;
|
|
|
|
|
ReturnType * end2 = pos + size / 2 * 2;
|
|
|
|
|
|
|
|
|
|
while (pos < end2)
|
|
|
|
|
{
|
|
|
|
|
pos[0] = (static_cast<UInt64>(generator0.next()) << 32) | generator1.next();
|
|
|
|
|
pos[1] = (static_cast<UInt64>(generator2.next()) << 32) | generator3.next();
|
|
|
|
|
pos += 2;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
while (pos < end)
|
2012-07-15 23:13:08 +00:00
|
|
|
|
{
|
2014-08-17 08:28:03 +00:00
|
|
|
|
pos[0] = (static_cast<UInt64>(generator0.next()) << 32) | generator1.next();
|
|
|
|
|
++pos;
|
2012-07-15 23:13:08 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
template <typename Impl, typename Name>
|
|
|
|
|
class FunctionRandom : public IFunction
|
|
|
|
|
{
|
|
|
|
|
private:
|
|
|
|
|
typedef typename Impl::ReturnType ToType;
|
2014-08-17 08:28:03 +00:00
|
|
|
|
|
2012-07-15 23:13:08 +00:00
|
|
|
|
public:
|
|
|
|
|
/// Получить имя функции.
|
|
|
|
|
String getName() const
|
|
|
|
|
{
|
|
|
|
|
return Name::get();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Получить тип результата по типам аргументов. Если функция неприменима для данных аргументов - кинуть исключение.
|
|
|
|
|
DataTypePtr getReturnType(const DataTypes & arguments) const
|
|
|
|
|
{
|
|
|
|
|
if (arguments.size() > 1)
|
|
|
|
|
throw Exception("Number of arguments for function " + getName() + " doesn't match: passed "
|
2013-06-21 20:34:19 +00:00
|
|
|
|
+ toString(arguments.size()) + ", should be 0 or 1.",
|
2012-07-15 23:13:08 +00:00
|
|
|
|
ErrorCodes::NUMBER_OF_ARGUMENTS_DOESNT_MATCH);
|
|
|
|
|
|
|
|
|
|
return new typename DataTypeFromFieldType<typename Impl::ReturnType>::Type;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Выполнить функцию над блоком.
|
|
|
|
|
void execute(Block & block, const ColumnNumbers & arguments, size_t result)
|
|
|
|
|
{
|
|
|
|
|
ColumnVector<ToType> * col_to = new ColumnVector<ToType>;
|
|
|
|
|
block.getByPosition(result).column = col_to;
|
|
|
|
|
|
|
|
|
|
typename ColumnVector<ToType>::Container_t & vec_to = col_to->getData();
|
|
|
|
|
|
2013-06-08 20:19:29 +00:00
|
|
|
|
size_t size = block.rowsInFirstColumn();
|
2012-07-15 23:13:08 +00:00
|
|
|
|
vec_to.resize(size);
|
|
|
|
|
Impl::execute(vec_to);
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
struct NameRand { static const char * get() { return "rand"; } };
|
|
|
|
|
struct NameRand64 { static const char * get() { return "rand64"; } };
|
|
|
|
|
|
|
|
|
|
typedef FunctionRandom<RandImpl, NameRand> FunctionRand;
|
|
|
|
|
typedef FunctionRandom<Rand64Impl, NameRand64> FunctionRand64;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
}
|