thevar1able/ClickHouse
1
0
Fork 0
mirror of https://github.com/ClickHouse/ClickHouse.git synced 2024-11-28 10:31:57 +00:00
Code Issues Packages Projects Releases Wiki Activity

dbms: Server: Performance improvements. [#METR-15210]

Browse Source
This commit is contained in:
Alexey Arno 2015-05-28 15:58:09 +03:00
parent 463ee81a9d
commit 79bad96d98
1 changed files with 40 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

52
dbms/include/DB/Functions/FunctionsRound.h
View File

@ -511,9 +511,16 @@ namespace DB
static inline void apply(const PODArray<T> & in, size_t scale, typename ColumnVector<T>::Container_t & out) static inline void apply(const PODArray<T> & in, size_t scale, typename ColumnVector<T>::Container_t & out)
{ {
auto divisor = Op::prepare(scale); auto divisor = Op::prepare(scale);
size_t size = in.size();
for (size_t i = 0; i < size; ++i) auto begin_in = &in[0];
out[i] = Op::compute(in[i], divisor); auto end_in = begin_in + in.size();
auto p_out = &out[0];
for (auto p_in = begin_in; p_in != end_in; ++p_in)
{
*p_out = Op::compute(*p_in, divisor);
++p_out;
}
} }
static inline T apply(T val, size_t scale) static inline T apply(T val, size_t scale)
@ -540,24 +547,45 @@ namespace DB
Scale mm_scale; Scale mm_scale;
Op::prepareScale(scale, mm_scale); Op::prepareScale(scale, mm_scale);
const size_t size = in.size();
const size_t data_count = std::tuple_size<Data>(); const size_t data_count = std::tuple_size<Data>();
size_t i; auto begin_in = &in[0];
for (i = 0; i < (size - data_count + 1); i += data_count) auto end_in = begin_in + in.size();
Op::compute(reinterpret_cast<const T *>(&in[i]), mm_scale, reinterpret_cast<T *>(&out[i])); auto limit = end_in - (data_count - 1);
if (i < size) auto begin_out = &out[0];
auto end_out = begin_out + out.size();
auto p_in = begin_in;
auto p_out = begin_out;
for (; p_in < limit; p_in += data_count)
{
Op::compute(reinterpret_cast<const T *>(p_in), mm_scale, reinterpret_cast<T *>(p_out));
p_out += data_count;
}
if (p_in < end_in)
{ {
Data tmp{0}; Data tmp{0};
for (size_t j = 0; (j < data_count) && ((i + j) < size); ++j) auto begin_tmp = &tmp[0];
tmp[j] = in[i + j]; auto end_tmp = begin_tmp + data_count;
for (auto p_tmp = begin_tmp; (p_tmp != end_tmp) && (p_in != end_in); ++p_tmp)
{
*p_tmp = *p_in;
++p_in;
}
Data res; Data res;
Op::compute(reinterpret_cast<T *>(&tmp), mm_scale, reinterpret_cast<T *>(&res)); Op::compute(reinterpret_cast<T *>(&tmp), mm_scale, reinterpret_cast<T *>(&res));
for (size_t j = 0; (j < data_count) && ((i + j) < size); ++j) auto begin_res = &res[0];
out[i + j] = res[j]; auto end_res = begin_res + data_count;
for (auto p_res = begin_res; (p_res != end_res) && (p_out != end_out); ++p_res)
{
*p_out = *p_res;
++p_out;
}
} }
} }